On a multiconstrained model for chromatic scheduling

DOI10.1016/S0166-218X(99)00019-0zbMath0940.90030MaRDI QIDQ1293198

Dominique de Werra

Publication date: 28 June 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

graph coloringtimetablingnetwork flowconstrained programmingchromatic scheduling

Mathematics Subject Classification ID

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

Related Items (7)

Coloration de graphes : fondements et applications ⋮ Cyclic transfers in school timetabling ⋮ Consensus models: computational complexity aspects in modern approaches to the list coloring problem ⋮ A flow based pruning scheme for enumerative equitable coloring algorithms ⋮ A tutorial on the use of graph coloring for some problems in robotics ⋮ An XML format for benchmarks in high school timetabling ⋮ An exact method for graph coloring

Cites Work

• Unnamed Item
• Unnamed Item
• An introduction to timetabling
• Interval edge coloring of a graph with forbidden colors
• Restricted coloring models for timetabling
• Mixed graph colorings
• Restrictions and preassignments in preemptive open shop scheduling
• On the Complexity of Timetable and Multicommodity Flow Problems
• Two-Processor Scheduling with Start-Times and Deadlines
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

This page was built for publication: On a multiconstrained model for chromatic scheduling