On the generalized mirrored scheme for double round robin tournaments in sports scheduling

DOI10.1142/S0217595913400083MaRDI QIDQ2846487zbMATH OpenFDO

Authors Lishun Zeng, Shinji Mizuno

Publication date 5 September 2013

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217595913400083

zbMATH Keywords

breaksgeneralized mirrored schemeround robin tournamentseparationsports scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Recommendations

• On the separation in 2-period double round robin tournaments with minimum breaks
• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
• Constructing fair round robin tournaments with a minimum number of breaks
• Minimizing costs in round robin tournaments with place constraints
• Round robin scheduling -- a survey

Cites work

• A Benders approach for the constrained minimum break problem
• A polynomial-time algorithm to find an equitable home--away assignment
• Feasibility of home-away-pattern sets for round robin tournaments
• Minimizing breaks by maximizing cuts.
• On the separation in 2-period double round robin tournaments with minimum breaks
• Round robin scheduling -- a survey
• Scheduling in Sports
• Scheduling in sports: an annotated bibliography
• Semidefinite programming based approaches to the break minimization problem
• Some models of graphs for scheduling sports competitions

Cited in

(1)

• On the separation in 2-period double round robin tournaments with minimum breaks

This page was built for publication: On the generalized mirrored scheme for double round robin tournaments in sports scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2846487)