A Benders approach for the constrained minimum break problem

This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without place constraints are considered. The algorithm uses Benders cuts to obtain feasible home-away pattern sets in few iterations and this approach leads to significant reductions in computation time for hard instances. Furthermore, the algorithm is capable of solving a number of previously unsolved benchmark problems for the Traveling Tournament Problem with constant distances.

[1]  George L. Nemhauser,et al.  The Traveling Tournament Problem Description and Benchmarks , 2001, CP.

[2]  John N. Hooker,et al.  A Hybrid Method for Planning and Scheduling , 2004, CP.

[3]  Tomomi Matsui,et al.  Characterizing Feasible Pattern Sets with a Minimum Number of Breaks , 2002, PATAT.

[4]  Tomomi Matsui,et al.  Semidefinite programming based approaches to the break minimization problem , 2006, Comput. Oper. Res..

[5]  Federico Della Croce,et al.  Scheduling the Italian Football League: an ILP-based approach , 2006, Comput. Oper. Res..

[6]  Jan A. M. Schreuder,et al.  Combinatorial aspects of construction of competition Dutch Professional Football Leagues , 1992, Discret. Appl. Math..

[7]  P. Masson,et al.  A constrained sports scheduling problem , 1989, Discret. Appl. Math..

[8]  Celso C. Ribeiro,et al.  Maximizing breaks and bounding solutions to the mirrored traveling tournament problem , 2006, Discret. Appl. Math..

[9]  P. Harker,et al.  Scheduling a Major College Basketball Conference , 1998 .

[10]  Michael A. Trick.  A Schedule-Then-Break Approach to Sports Timetabling , 2000, PATAT.

[11]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[12]  Tomomi Matsui,et al.  A polynomial-time algorithm to find an equitable home-away assignment , 2005, Oper. Res. Lett..

[13]  Jean-Charles Régin.  Minimization of the number of breaks in sports scheduling problems using constraint programming , 1998, Constraint Programming and Large Scale Discrete Optimization.

[14]  Michael Jünger,et al.  Minimizing breaks by maximizing cuts , 2003, Oper. Res. Lett..

[15]  George L. Nemhauser,et al.  Scheduling A Major College Basketball Conference , 1998, Oper. Res..

[16]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

[17]  Andrea Schaerf,et al.  Scheduling Sport Tournaments using Constraint Logic Programming , 1999, Constraints.

[18]  Martin Henz,et al.  Scheduling a Major College Basketball Conference - Revisited , 2001, Oper. Res..

[19]  Dominique de Werra,et al.  Some models of graphs for scheduling sports competitions , 1988, Discret. Appl. Math..

[20]  D. Werra.  Scheduling in Sports , 1981 .

[21]  J. A. M. Schreuder,et al.  Constructing timetables for sport competitions , 1980 .

[22]  Martin Henz,et al.  Global constraints for round robin tournament scheduling , 2004, Eur. J. Oper. Res..

[23]  Michael A. Trick.  Integer and Constraint Programming Approaches for Round-Robin Tournament Scheduling , 2002, PATAT.

[24]  Martin Henz.  Constraint-based Round Robin Tournament Planning , 1999, ICLP.