Tight bounds for break minimization in tournament scheduling

DOI10.1016/j.jcta.2007.10.002zbMath1151.90014OpenAlexW2113542372MaRDI QIDQ941319

Andries E. Brouwer, Gerhard J. Woeginger, Gerhard F. Post

Publication date: 4 September 2008

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/tight-bounds-for-break-minimization-in-tournament-scheduling(7e98eead-5d17-41ec-9e2d-15233b963998).html

zbMATH Keywords

Latin squaressports schedulingbreak minimizationsports tournament

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

First-break-heuristically-schedule: constructing highly-constrained sports timetables, Sports scheduling: Problems and applications

Cites Work

• Round robin scheduling -- a survey
• Sports tournaments, home-away assignments, and the break minimization problem
• Scheduling in Sports