Sports scheduling

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Volumn , Issue , 2004, Pages 52-1-52-20

  Easton, Kelly ^a   Nemhauser, George ^b   Trick, Michael ^c  

^a KANSAS STATE UNIVERSITY   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84945397419     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (45)

1. Anderson, I., 1997. Combinatorial Designs and Tournament, Clarendon Press, Oxford, 160–161.
2. deWerra, D., L. Jacot-Descombes, and P. Masson, 1990. A Constrained Sports Scheduling Problem, Discrete Applied Mathematics 26, 41–49.
3. deWerra, D., 1981. Scheduling in Sports, Annals of Discrete Mathematics 11, 381–395.
4. Easton, T. and R. G. Parker, 2001. On Completing Latin Squares, Discrete Applied Mathematics 113, 167–181.
5. Colbourn, C. and J. H. Dinitz, 1996. The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, FL.
6. Colbourn, C., 1983. Embedding Partial Steiner Triple Systems is NP-Complete, Journal of Combinatorial Theory (A) 35, 100–105.
7. Easton, K., 2003. Solving Sports Scheduling Problems Using Integer Programming and Constraint Programming, Ph. D. thesis, Georgia Institute of Technology.
8. de Werra, D., 1988. Some Models of Graphs for Scheduling Sports Competitions, Discrete Applied Mathematics 21, 47–65.
9. Miyashiro, R., H. Iwasaki, and T. Matsui, 2002. Characterizing Feasible Pattern Setswith a Minimum Number of Breaks. (Unpublished)
10. Haselgrove, J. and J. Leech, 1977. A Tournament Design Problem, AmericanMathematicalMonthly 84, 198–201.
11. Schellenberg, P. J., G. H. J. van Rees, and S. A. Vanstone, 1977. The existence of Balanced Tournament Designs, Ars Combinatoria 3, 303–318.
12. Lamken, E. R. and S. A. Vanstone, 1985. The Existence of Factored Balanced Tournament Designs, Ars Combinatoria 19, 157–160.
13. Blest, D. C. and D. G. Fitzgerald, 1988. Scheduling Sports Competitions with a Given Distribution of Times, Discrete Applied Mathematics 22, 9–19.
14. Russell, K. G., 1980. Balancing Carry-Over Effects in Round Robin Tournaments, Biometrica 67, 127–131.
15. deWerra, D., 1980. Geography, Graphs and Games, Discrete Applied Mathematics 2, 327–337.
16. de Werra, D., 1985. On the Multiplication of Divisions: The Use of Graphs for Sports Scheduling, Networks 15, 125–136.
17. Kotzig, A., 1972. Decompositions of Complete Graphs into Regular Bichromatic Factors, Discrete Mathematics 2, 383–387.
18. de Werra, D., 1982. Minimizing Irregularities in Sports Scheduling Using Graph Theory, Discrete Applied Mathematics 4, 217–226.
19. Bartsch, T., A. Drexl, and S. Kroger, 2002. Scheduling European Soccer Leagues: Models, Methods and Applications, PATAT 2002.
20. Russell, R. A. and J. M. Y. Leung, 1994. Devising a Cost Effective Schedule for a Baseball League, Operations Research 42, 614–625.
21. Schaerf, A., 1999. Scheduling Sport TournamentsUsingConstraint Logic Programming, Constraints 4, 43–65.
22. Schreuder, J. A. M., 1992. CombinatorialAspects ofConstruction ofCompetition Dutch Professional Football League, Discrete Applied Mathematics 35, 301–312.
23. Nemhauser, G. L. and M. A. Trick, 1988. Scheduling a Major College Basketball Conference, Operations Research 46, 1–8.
24. Trick, M. A., 2002. Integer and Constraint Programming Approaches for Round Robin Tournament Scheduling, Keynote Address at PATAT 2002.
25. Dechter, Rina, 2003. Constraint Processing, Morgan Kaufmann, New York, NY.
26. Henz, M., 1999. Constraint-Based Round Robin Tournament Planning, Proceedings of the 1999 International Conference on Logic Programming, Las Cruces, NM.
27. Cain, W. O., Jr., 1977. A Computer-Assisted Heuristic Approach Used to Schedule theMajor League Baseball Clubs, In S. P. Ladany and R. E. Machol, (editors), Optimal Strategies in Sports, North- Holland Publishing Company, New York, 32–41.
28. Henz, M., T. Müller, and S. Theil, 2002. GlobalConstraints forRoundRobinTournamentScheduling, European Journal of Operations Research 153(1), 92–101.
29. Easton, K., G. L. Nemhauser, and M. A. Trick, 2001. The Traveling Tournament Problem: Description and Benchmarks, Principles and Practice of Constraint Programming — CP 2001, Springer Lecture Notes in Computer Science 2239, 580–585.
30. Easton, K., G. L. Nemhauser, and M. A. Trick, 2002. Solving the Traveling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach, PATAT 2002.
31. Benoist, T., F. Laburthe, and B. Rottembourg, 2001. Lagrange Relaxation and Constraint Programming Collaborative Schemes for Traveling Tournament Problems, Proceedings of CP-AI-OR ’01, Wye College, UK, 15–26.
32. Trick, M. A., 2001. A Schedule-and-Break Approach to Sports Scheduling, In E. Burke andW. Erben (editors), PATAT 2000, Springer Lecture Notes in Computer Science 2079, 242–253.
33. Regin, J. C., 2000. Modeling with Constraint Programming, Dagstuhl Seminar on Constraint and Integer Programming.
34. Anagnostopolous, A., L. Michel, P. Van Hentenryck, and Y. Vergados, 2003. A Simulated Annealing Approach to the Traveling Tournament Problem. (Unpublished)
35. Willis, R. J. and B. J. Terrill, 1994. Scheduling the Australian State Cricket Season Using Simulated Annealing, Journal of the Operations Research Society 45, 276–280.
36. Wright, M., 1994. Timetabling County Cricket Fixtures Using a Form of Tabu Search, Journal of the Operations Research Society 45, 758–770.
37. Campbell, R. T. and D. S. Chen, 1976. A Minimum Distance Basketball Scheduling Problem, In S. P. Ladany, R. E. Machol, and D. G. Morrison, (editors), Managament Science in Sports, North-Holland Publishing Company, New York, 15–26.
38. Ball, B. C. and D. B. Webster, 1977. Optimal Scheduling for Even-Numbered Team Athletic Conferences, AIIE Transactions 9, 161–169.
39. Bean, J. C. and J. R. Birge, 1980. Reducing Travelling Costs and Player Fatigue in the National Basketball Association, INTERFACES 10, 98–102.
40. Armstrong, J. and R. J. Willis, 1993. Scheduling the Cricket World Cup — a Case Study, Journal of the Operations Research Society 44, 1067–1072.
41. Ferland, J. A. and C. Fleurent, 1991. Computer Aided Scheduling for a Sports League, INFOR 29, 14–25.
42. Fleurent, C. and J. A. Ferland, 1993. Allocating Games for the NHL Using Integer Programming, Operations Research 41, 649–654.
43. Henz, M., 2001. Scheduling aMajorCollege BasketballConference—Revisited, Operations Research 49, 163–168.
44. Regin, J. C., 1999. Minimization of the Number of Breaks in Sports Scheduling Problems Using Constraint Programming, DIMACS Workshop on Constraint Programming and Large Scale Discrete Optimization.
45. Schreuder, J. A. M., 1980. Constructing Timetables for Sports Competitions, Mathematical Programming Study 13, 58–67.