Chromatic scheduling

MaRDI QIDQ2822599zbMATH OpenFDO

Authors Dominique De Werra, Alain Hertz

Publication date 30 September 2016

zbMATH Keywords

co-colouringcolouringedge-colouringvertex-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Deterministic scheduling theory in operations research (90B35)

Review text

Variations and extensions of the basic vertex-colouring and edge-colouring models have been developed to deal with increasingly complex scheduling problems. They are presented and illustrated in specific situations where additional requirements are imposed. List colouring, mixed graph colouring, co-colouring, colouring with preferences and bandwidth colouring are included, and applications of edge colouring to open shop, school timetabling and sports scheduling problems are presented. Balancing and compactness constraints which often appear in practical situations are also discussed.NEWLINENEWLINEFor the entire collection see [Zbl 1317.05004].

Recommendations

• Chromatic scheduling and frequency assignment
• On a multiconstrained model for chromatic scheduling
• Compact Cylindrical Chromatic Scheduling
• Preassignment requirements in chromatic scheduling
• Chromatic scheduling in a cyclic open shop
• scientific article; zbMATH DE number 151873
• On the combinatorial structure of chromatic scheduling polytopes
• Edge-Chromatic Scheduling with Simultaneity Constraints
• The combinatorial stages of chromatic scheduling polytopes

Cited in

(17)

• A graph colouring model for assigning a heterogeneous workforce to a given schedule
• On a multiconstrained model for chromatic scheduling
• Chromatic scheduling and frequency assignment
• Restricted coloring models for timetabling
• Preassignment requirements in chromatic scheduling
• Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
• Plurigraph coloring and scheduling problems
• The tournament scheduling problem with absences
• Colouring walls may help to make good schedules.
• Split Vertices in Vertex Colouring and Their Application in Developing a Solution to the Faculty Timetable Problem
• scientific article; zbMATH DE number 4072696 (Why is no real title available?)
• Compact Cylindrical Chromatic Scheduling
• scientific article; zbMATH DE number 151873 (Why is no real title available?)
• Edge-Chromatic Scheduling with Simultaneity Constraints
• Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions
• A supernodal formulation of vertex colouring with applications in course timetabling
• On the application of graph colouring techniques in round-robin sports scheduling

This page was built for publication: Chromatic scheduling

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