GRAPH COLOURING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING
Dániel Marx · 2004
Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems. In this paper we review several variants of graph colouring, such as precolouring extension, list colouring, multicolouring, minimum sum colouring, and discuss their applications in scheduling.