A traditional Benders’ approach to sports timetabling

European Journal of Operational Research - Tập 307 - Trang 813-826 - 2023
David Van Bulck1,2, Dries Goossens1,2
1Ghent University, Faculty of Economics and Business Administration, Belgium
2FlandersMake@UGent – core lab CVAM, Belgium

Tài liệu tham khảo

Alarcón, 2017, Operations research transforms the scheduling of Chilean soccer leagues and South American world cup qualifiers, Interfaces, 47, 52, 10.1287/inte.2016.0861 Atan, 2018, Minimization of rest mismatches in round robin tournaments, Computers & Operations Research, 99, 78, 10.1016/j.cor.2018.06.003 Bagger, 2018, Benders’ decomposition for curriculum-based course timetabling, Computers & Operations Research, 91, 178, 10.1016/j.cor.2017.10.009 Ball, 1977, Optimal scheduling for even-numbered team athletic conferences, Aiie T., 9, 161, 10.1080/05695557708975138 Bao, 2009 Benders, 1962, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, 4, 238, 10.1007/BF01386316 Briskorn, 2008, Feasibility of home-away-pattern sets for round robin tournaments, Operations Research Letters, 36, 283, 10.1016/j.orl.2007.09.009 Briskorn, 2012, A Lagrangian approach for minimum cost single round robin tournaments, Computers & Operations Research, 39, 718, 10.1016/j.cor.2011.05.018 Çavdaroǧlu, 2020, Determining matchdays in sports league schedules to minimize rest differences, Operations Research Letters, 48, 209, 10.1016/j.orl.2020.03.001 Cheung, 2009, A benders approach for computing lower bounds for the mirrored traveling tournament problem, Discrete Optimization, 6, 189, 10.1016/j.disopt.2008.12.004 Codato, 2006, Combinatorial benders’ cuts for mixed-integer linear programming, Operations Research, 54, 756, 10.1287/opre.1060.0286 Costa, 1994, An evolutionary tabu search algorithm and the NHL scheduling problem, INFOR, 33, 161 Di Gaspero, 2007, A composite-neighborhood tabu search approach to the traveling tournament problem, Journal of Heuristics, 13, 189, 10.1007/s10732-006-9007-x Durán, 2019, Scheduling Argentina’s professional basketball leagues: A variation on the travelling tournament problem, European Journal of Operational Research, 275, 1126, 10.1016/j.ejor.2018.12.018 Durán, 2021, Scheduling the main professional football league of Argentina, INFORMS Journal on Applied Analytics, 51, 361, 10.1287/inte.2021.1088 Easton, 2001, The traveling tournament problem description and benchmarks, 580 Edmonds, 1965, Maximum matching and a polyhedron with (0,1)-vertices, Journal of Research of the National Bureau of Standards, 69B, 125, 10.6028/jres.069B.013 Freund, 1956, Round robin mathematics, The American Mathematical Monthly, 63, 112 Frohner, 2020, A beam search approach to the traveling tournament problem, 67 Fujiwara, 2007, Constructive algorithms for the constant distance traveling tournament problem, 135 Goossens, 2018, Optimization in sports league scheduling: Experiences from the Belgian Pro League soccer, 3 Goossens, 2012, Soccer schedules in Europe: An overview, Journal of Scheduling, 15, 641, 10.1007/s10951-011-0238-9 Guyon, 2010, Cut generation for an integrated employee timetabling and production scheduling problem, European Journal of Operational Research, 201, 557, 10.1016/j.ejor.2009.03.013 Hooker, 2003, Logic-based benders decomposition, Mathematical Programming, 96, 33, 10.1007/s10107-003-0375-9 Kashiwabara, 2009, Scheduling partial round robin tournaments subject to home away pattern sets, The Electronic Journal of Combinatorics, 16, R55, 10.37236/144 Khelifa, 2015, A variable neighborhood search method for solving the traveling tournaments problem, Electronic Notes in Discrete Mathematics, 47, 157, 10.1016/j.endm.2014.11.021 Khelifa, 2016, Hybrid harmony search combined with variable neighborhood search for the traveling tournament problem, 520 Lambers, 2022, The flexibility of home away pattern sets, Journal of Scheduling, 10.1007/s10951-022-00734-w Miyashiro, 2003, Characterizing feasible pattern sets with a minimum number of breaks, 78 Nemhauser, 1998, Scheduling a major college basketball conference, Operations Research, 46, 1, 10.1287/opre.46.1.1 Noronha, 2007, A branch-and-cut algorithm for scheduling the highly-constrained Chilean soccer tournament, 174 Padberg, 1982, Odd minimum cut-sets and b-matchings, Mathematics of Operations Research, 7, 67, 10.1287/moor.7.1.67 Rahmaniani, 2017, The Benders decomposition algorithm: A literature review, European Journal of Operational Research, 259, 801, 10.1016/j.ejor.2016.12.005 Rasmussen, 2008, Scheduling a triple round robin tournament for the best Danish soccer league, European Journal of Operational Research, 185, 795, 10.1016/j.ejor.2006.12.050 Rasmussen, 2007, A Benders approach for the constrained minimum break problem, European Journal of Operational Research, 177, 198, 10.1016/j.ejor.2005.10.063 Russell, 1980, Balancing carry-over effects in round robin tournaments, Biometrika, 67, 127, 10.1093/biomet/67.1.127 Suksompong, 2016, Scheduling asynchronous round-robin tournaments, Operations Research Letters, 44, 96, 10.1016/j.orl.2015.12.008 Trick, 2003, Integer and constraint programming approaches for round-robin tournament scheduling, 63 Tuffaha, 2022, Round-robin scheduling with regard to rest differences, TOP, 10.1007/s11750-022-00637-1 Urrutia, 2006, Maximizing breaks and bounding solutions to the mirrored traveling tournament problem, Discrete Applied Mathematics, 154, 1932, 10.1016/j.dam.2006.03.030 Urrutia, S., Ribeiro, C. C., & Melo, R. A. (2007). A new lower bound to the traveling tournament problem. IEEE. Computational Intelligence in Scheduling, 2007. SCIS’07. IEEE Symposium on, (pp. 15–18). Van Bulck, 2020, Handling fairness issues in time-relaxed tournaments with availability constraints, Computers & Operations Research, 115, 95, 10.1016/j.cor.2019.104856 Van Bulck, 2020, On the complexity of pattern feasibility problems in time-relaxed sports timetabling, Operations Research Letters, 48, 452, 10.1016/j.orl.2020.05.005 Van Bulck, 2022, Optimizing rest times and differences in games played: An iterative two-phase approach, Journal of Scheduling, 25, 261, 10.1007/s10951-021-00717-3 Van Bulck, 2020, RobinX: A three-field classification and unified data format for round-robin sports timetabling, European Journal of Operational Research, 280, 568, 10.1016/j.ejor.2019.07.023 Van Bulck, 2019, Scheduling a non-professional indoor football league: A tabu search based approach, Annals of Operations Research, 275, 715, 10.1007/s10479-018-3013-x Weninger, D., & Wolsey, L., et al. (2020). Benders’ algorithm with (mixed)-integer subproblems. Technical Report de Werra, 1981, Scheduling in sports, 381 Westphal, 2014, Scheduling the German basketball league, Interfaces, 44, 498, 10.1287/inte.2014.0764 Yi, 2022, Strategies for dealing with uncertainty in time-relaxed sports timetabling, Annals of Operations Research