Open shop scheduling with some additional constraints

DOI10.1007/BF01858447zbMath0846.90055OpenAlexW1982463691MaRDI QIDQ1911243

Dominique de Werra, Jacques Erschler

Publication date: 7 October 1996

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01858447

zbMATH Keywords

NP-completeopen shop schedulingsimultaneitypreemptionschromatic schedulinggraph-theoretical model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Preassignment requirements in chromatic scheduling ⋮ Time slot scheduling of compatible jobs ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Extensions of coloring models for scheduling purposes

Cites Work

• The cyclic compact open-shop scheduling problem
• Almost nonpreemptive schedules
• Compact Cylindrical Chromatic Scheduling
• Open Shop Scheduling to Minimize Finish Time
• On the Complexity of Timetable and Multicommodity Flow Problems
• Line perfect graphs
• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• Edge-Chromatic Scheduling with Simultaneity Constraints
• Flow Management in Flexible Manufacturing Cells with Pipeline Operations

This page was built for publication: Open shop scheduling with some additional constraints