The tournament scheduling problem with absences

Uwe Schauz

European Journal of Operational Research, 2016, vol. 254, issue 3, 746-754

Abstract: We study time scheduling problems with allowed absences as a new kind of graph coloring problem. One may think of a sport tournament where each player (each team) is permitted a certain number t of absences. We then examine how many rounds are needed to schedule the whole tournament in the worst case. This upper limit depends on t and on the structure of the graph G whose edges represent the games that have to be played, but also on whether or not the absences are announced before the tournament starts. Therefore, we actually have two upper limits for the number of required rounds. We have χt(G) for pre-scheduling if all absences are pre-fixed, and we have χOLt(G) for on-line scheduling if we have to stay flexible and deal with absences when they occur. We conjecture that χt(G)=Δ(G)+2t and that χOLt(G)=χ′(G)+2t. The first conjecture is stronger than the Total Coloring Conjecture while the second is weaker than the On-Line List Edge Coloring Conjecture. Our conjectures hold for all bipartite graphs. For complete graphs, we prove them partially. Lower and upper bounds to χt(G) and χOLt(G) for general multigraphs G are established, too.

Keywords: OR in sports; Sport scheduling; Graph coloring; Coloring games; Latin squares (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221716302934
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:254:y:2016:i:3:p:746-754

DOI: 10.1016/j.ejor.2016.04.056

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().