Extensions of coloring models for scheduling purposes

DOI10.1016/0377-2217(96)00013-6zbMath0914.90161OpenAlexW2097424969MaRDI QIDQ1268282

Dominique de Werra

Publication date: 3 December 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(96)00013-6

zbMATH Keywords

course timetablingautomated production systemschromatic scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (8)

Inverse chromatic number problems in interval and permutation graphs ⋮ Grouping products for the optimization of production processes: a case in the steel manufacturing industry ⋮ Mutual exclusion scheduling with interval graphs or related classes. II ⋮ Mathematical programming models and algorithms for a class--faculty assignment problem ⋮ The robust coloring problem. ⋮ The combinatorics of timetabling ⋮ A generalized class-teacher model for some timetabling problems ⋮ Complexity of some special types of timetabling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results concerning the complexity of restricted colorings of graphs
• Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
• Interval edge coloring of a graph with forbidden colors
• A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}\) open shop problem]
• Parallel concepts in graph theory
• Open shop problem with zero-one time operations and integer release date/deadline intervals
• Open shop scheduling with some additional constraints
• Restrictions and preassignments in preemptive open shop scheduling
• On cyclic sequence types for constructing cyclic schedules
• Cyclic Scheduling via Integer Programs with Circular Ones
• Compact Cylindrical Chromatic Scheduling
• Open Shop Scheduling to Minimize Finish Time
• On the Complexity of Timetable and Multicommodity Flow Problems
• Some graph‐theoretical models for scheduling in automated production systems
• Edge-Chromatic Scheduling with Simultaneity Constraints
• Two-Machine Open Shops with Renewable Resources
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Balanced matrices

This page was built for publication: Extensions of coloring models for scheduling purposes