Abstract
Real sports scheduling problems are difficult to solve due to the variety of different constraints that might be imposed. Over the last decade, through the work of a number of researchers, it has become easier to solve round-robin tournament problems. These tournaments can then become building blocks for more complicated schedules. For example, we have worked extensively with Major League Baseball on creating “what-if” schedules for various league formats. Success in providing those schedules has depended on breaking the schedule into easily solvable pieces. Integer programming and constraint programming methods each have their places in this approach, depending on the constraints and objective function.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, I.: Combinatorial Designs and Tournaments. Oxford University Press, Oxford (1997)
Ball, B.C., Webster, D.B.: Optimal Scheduling for Even-Numbered Team Athletic Conferences. AIIE Trans. 9, 161–169 (1977)
Cain Jr., W.O.: A Computer Assisted Heuristic Approach Used to Schedule the Major League Baseball Clubs. In: Ladany, S.P., Machol, R.E. (eds.) Optimal Strategies in Sports, pp. 32–41. North-Holland, Amsterdam (1977)
Campbell, R.T., Chen, D.-S.: A Minimum Distance Basketball Scheduling Problem. In: Machol, R.E., Ladany, S.P., Morrison, D.G. (eds.) Management Science in Sports, pp. 15–25. North-Holland, Amsterdam (1976)
Colbourn, C.J.: Embedding Partial Steiner Triple Systems is NP-Complete. J. Combinat. Theory, Series A 35, 100–105 (1983)
de Werra, D.: Geography, Games and Graphs. Discr. Appl. Math. 2, 327–337 (1980)
de Werra, D.: Some Models of Graphs for Scheduling Sports Competitions. Discr. Appl. Math. 21, 47–65 (1988)
Easton, K.K.: Using Integer Programming and Constraint Programming to Solve Sports Scheduling Problems. Doctoral Dissertation, Georgia Institute of Technology (2002)
Edmonds, J.: Maximum Matching and a Polyhedron with (0, 1) Vertices. J. Res. Natl Bureau Standards 69B, 125–130 (1965)
Easton, K.K., Nemhauser, G.L., Trick, M.A.: Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 100–109. Springer, Heidelberg (2003)
Henz, M.: Scheduling a Major College Basketball Conference: Revisited. Oper. Res. 49, 163–168 (2001)
Henz, M., Müller, T., Thiel, S.: Global Constraints for Round Robin Tournament Scheduling. Eur. J. Oper. Res (to appear)
ILOG OPL Studio, User’s Manual and Program Guide. ILOG (2000)
Marriott, K., Stuckey, P.J.: Programming with Constraints: An Introduction. MIT Press, Cambridge (1998)
Nemhauser, G.L., Trick, M.A.: Scheduling a Major College Basketball Conference. Oper. Res. 46, 1–8 (1998)
Padberg, M.W., Rao, M.R.: Odd Minimum Cut-Sets and b-matchings. Math. Oper. Res. 47, 67–80 (1982)
Régin, J.-C.: A Filtering Algorithm for Constraints of Difference in CSPs. In: Proc. AAA 12th Natl Conf. Artif, pp. 362–367 (1994)
Régin, J.-C.: The Symmetric alldiff Constraint. In: Dean, T. (ed.) Proc. Int. Joint Conf. Artif. Intell., vol. 1, pp. 420–425 (1999)
Régin, J.-C.: Minimization of the Number of Breaks in Sports Scheduling Problems using Constraint Programming. In: DIMACS Workshop on Constraint Programming and Large Scale Discrete Optimization (1999)
Russell, R.A., Leung, J.M.: Devising a Cost Effective Schedule for a Baseball League. Oper. Res. 42, 614–625 (1994)
Schaerf, A.: Scheduling Sport Tournaments using Constraint Logic Programming. Constraints 4, 43–65 (1999)
Schreuder, J.A.M.: Constructing Timetables for Sport Competitions. Math. Program. Study 13, 58–67 (1980)
Schreuder, J.A.M.: Combinatorial Aspects of Construction of Competition Dutch Professional Football Leagues. Discr. Appl. Math. 35, 301–312 (1992)
Trick, M.A.: A Schedule-Then-Break Approach to Sports Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 242–253. Springer, Heidelberg (2001)
Van Hentenryck, P.: The OPL Optimization Programming Language. MIT Press, Cambridge (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trick, M.A. (2003). Integer and Constraint Programming Approaches for Round-Robin Tournament Scheduling. In: Burke, E., De Causmaecker, P. (eds) Practice and Theory of Automated Timetabling IV. PATAT 2002. Lecture Notes in Computer Science, vol 2740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45157-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-45157-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40699-0
Online ISBN: 978-3-540-45157-0
eBook Packages: Springer Book Archive