Global constraints for round robin tournament scheduling

European Journal of Operational Research

Volumn 153, Issue 1, 2004, Pages 92-101

  Henz, Martin ^a   Müller, Tobias ^b   Thiel, Sven ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b SAARLAND UNIVERSITY   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Constraints satisfaction; Graph theory; Timetabling

Indexed keywords

ALGORITHMS; BENCHMARKING; CONSTRAINT THEORY; GRAPH THEORY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPERATIONS RESEARCH; PROBLEM SOLVING;

CONSTRIANTS SATISFACTION; TIMETABLING;

SCHEDULING;

EID: 1642382721     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00101-2     Document Type: Conference Paper

References (24)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows: Theory, Algorithms and Applications. 1993;Prentice Hall, Englewood Cliffs, NJ.
2. Anderson I. Combinatorial Designs and Tournaments. 1997;Oxford University Press.
3. Cain W.O. Jr. The computer-assisted heuristic approach used to schedule the major league baseball clubs. Ladany S.P., Machol R.E. Optimal Strategies in Sports, number 5 in Studies in Management Science and Systems. 1977;32-41 North-Holland, Amsterdam.
4. de Werra D. Scheduling in sports. Hansen P. Studies on Graphs and Discrete Programming. 1980;381-395 North-Holland, Amsterdam.
5. Edmonds J. Maximum matching and a polyhedron with 0, 1-vertices. Journal of Research of the National Bureau of Standards. 69B:1965;125-130.
6. Edmonds J. Paths, trees, and flowers. Canadian Journal on Mathematics. 23:1965;449-467.
7. Henz M. Constraint-based round robin tournament planning. De Schreye D. Proceedings of the International Conference on Logic Programming, Las Cruces, New Mexico. 1999;545-557 The MIT Press, Cambridge, MA.
8. Henz M. Scheduling a major college basketball conference - revisited. Operations Research. 49(1):2001.
9. M. Henz, T. Müller, S. Thiel, M. van Brandenburg, Benchmarks and results for round robin tournaments, http://www.comp.nus.edu.sg/~henz/roundrobin_benchmarks, 2000.
10. ILOG Inc., Mountain View, CA 94043, USA, http://www.ilog.com, ILOG Solver 4.0, Reference Manual, 1997.
11. K. McAloon, C. Tretkoff, G. Wetzel, Sports league scheduling, in: Proceedings of the 1997 ILOG Optimization Suite International Users' Conference, Paris, July 1997.
12. Mehlhorn K., Näher S. LEDA: A Platform for Combinatorial and Geometric Computing. 1999;Cambridge University Press, Cambridge.
13. Mozart Consortium, The Mozart Programming System. Documentation and system available from http://www.mozart-oz.org , Programming Systems Lab, Saarbrücken, Swedish Institute of Computer Science, Stockholm, and Université Catholique de Louvain, 1999.
14. T. Müller, Constraint extensions tutorial, http://www.mozart-oz.org , Programming Systems Lab, Saarbrücken, Swedish Institute of Computer Science, Stockholm, and Université Catholique de Louvain, 1999.
15. Nemhauser G.L., Trick M.A. Scheduling a major college basketball conference. Operations Research. 46(1):1998;1-8.
16. Régin J.-C. A filtering algorithm for constraints of difference in CSPs. Proceedings of the AAAI 12th National Conference on Artificial Intelligence. 1994;362-367 AAAI Press.
17. Régin J.-C. The symmetric alldiff constraint. Dean T. Proceedings of the International Joint Conference on Artificial Intelligence, Stockholm, Sweden. vol. 1:1999;420-425 Morgan Kaufmann Publishers, San Mateo, CA.
18. Russell K.G. Balancing carry-over effects in round robin tournaments. Biometrika. 67(1):1980;127-131.
19. Schaerf A. Scheduling sport tournaments using constraint logic programming. Constraints. 4(1):1999;43-65.
20. Schreuder J.A.M. Combinatorial aspects of construction of competition Dutch professional football leagues. Discrete Applied Mathematics. 35:1992;301-312.
21. Smolka G. The Oz programming model. van Leeuwen J. Computer Science Today, Lecture Notes in Computer Science 1000. 1995;324-343 Springer-Verlag, Berlin.
22. Trick M.A. A schedule-then-break approach to sports timetabling. Burke E., Erben W. Practice and Theory of Automated Timetabling III, Selected Papers of PATAT 2000, Konstanz, Germany, Lecture Notes in Computer Science 2079. 2000;Springer-Verlag, Berlin.
23. Wallis W.D. One-Factorizations. 1997;Kluwer Academic Publishers, Dordrecht.
24. J.P. Walser, Domain-Independent Local Search for Linear Integer Optimization, PhD thesis, Universität des Saarlandes, Saarbrücken, August 1998.