Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


csu1268666743.pdf (1.65 MB)

ETD Abstract Container

Abstract Header

Time Relaxed Round Robin Tournament and the NBA Scheduling Problem

Bao, Renjun
http://rave.ohiolink.edu/etdc/view?acc_num=csu1268666743

Abstract Details

2009, Doctor of Engineering, Cleveland State University, Fenn College of Engineering.
This dissertation study was inspired by the National Basketball Association regular reason scheduling problem. NBA uses the time-relaxed round robin tournament format, which has drawn less research attention compared to the other scheduling formats. Besides NBA, the National Hockey League and many amateur leagues use the time-relaxed round robin tournament as well. This dissertation study is the first ever to examine the properties of general time-relaxed round robin tournaments. Single round, double round and multiple round time-relaxed round robin tournaments are defined. The integer programming and constraint programming models for those tournaments scheduling are developed and presented. Because of the complexity of this problem, several decomposition methods are presented as well. Traveling distance is an important factor in the tournament scheduling. Traveling tournament problem defined in the time constrained conditions has been well studied. This dissertation defines the novel problem of time-relaxed traveling tournament problem. Three algorithms has been developed and compared to address this problem. In addition, this dissertation study presents all major constraints for the NBA regular season scheduling. These constraints are grouped into three categories: structural, external and fairness. Both integer programming and constraint programming are used to model these constraints and the computation studies are presented.
L. Ken Keys, PhD (Advisor)
Joseph Svestka, PhD (Committee Member)
John Frater, PhD (Committee Member)
Wenbing Zhao, PhD (Committee Member)
Hanz Richter, PhD (Committee Member)
Walter Rom, PhD (Committee Member)
138 p.
Engineering
Time relaxed; Sports Scheduling; Round Robin Tournament; NBA; Basketball

Recommended Citations

Citations

  • Bao, R. (2009). Time Relaxed Round Robin Tournament and the NBA Scheduling Problem [Doctoral dissertation, Cleveland State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=csu1268666743

    APA Style (7th edition)

  • Bao, Renjun. Time Relaxed Round Robin Tournament and the NBA Scheduling Problem. 2009. Cleveland State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=csu1268666743.

    MLA Style (8th edition)

  • Bao, Renjun. "Time Relaxed Round Robin Tournament and the NBA Scheduling Problem." Doctoral dissertation, Cleveland State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=csu1268666743

    Chicago Manual of Style (17th edition)

csu1268666743
4,394
© 2009, all rights reserved.
This open access ETD is published by Cleveland State University and OhioLINK.