Minimization of the number of breaks in sports scheduling problems using constraint programming
DIMACS workshop on on Constraint programming and large scale discrete optimization
The Traveling Tournament Problem Description and Benchmarks
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Scheduling a Major College Basketball Conference
Operations Research
Scheduling a Major College Basketball Conference--Revisited
Operations Research
A simulated annealing approach to the traveling tournament problem
Journal of Scheduling
Scheduling the professional soccer leagues of Austria and Germany
Computers and Operations Research
Semidefinite programming based approaches to the break minimization problem
Computers and Operations Research
A composite-neighborhood tabu search approach to the traveling tournament problem
Journal of Heuristics
Minimizing costs in round robin tournaments with place constraints
Computers and Operations Research
A method for combining complementary techniques for document image segmentation
Pattern Recognition
The traveling tournament problem with predefined venues
Journal of Scheduling
Feasibility of home-away-pattern sets for round robin tournaments
Operations Research Letters
Minimizing breaks by maximizing cuts
Operations Research Letters
A polynomial-time algorithm to find an equitable home-away assignment
Operations Research Letters
Hi-index | 0.02 |
This paper considers the separation in 2-period double round robin tournaments (2P-DRRTs) with minimum breaks. The separation is a lower bound on the number of slots between the two games with the same opponents. None of known schemes provides 2P-DRRTs with minimum breaks and a positive separation. We first propose a new scheme to generate 2-separation 2P-DRRTs with minimum breaks, based on single round robin tournaments (SRRTs) with minimum breaks which have the last break in the third slot from the end. Our experiment results show that such SRRTs exist for 8-68 teams. Secondly, we consider maximizing the separation in general 2P-DRRTs with minimum breaks by integer programming and constraint programming, respectively. The two approaches of direct formulation and ''first-break, then-schedule'' decomposition are presented and compared. We obtain the maximum separation for up to 14 teams. Furthermore, we consider the application with place constraints to show the flexibility and efficiency of scheduling 2P-DRRTs with minimum breaks and a positive separation.