The cyclic compact open-shop scheduling problem

DOI10.1016/0012-365X(93)90171-OzbMath0797.90045OpenAlexW1971413514MaRDI QIDQ686491

Dominique de Werra, N. V. R. Mahadev, Ph. Solot

Publication date: 27 October 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90171-o

zbMATH Keywords

graph-theoretic modelautomated production systemscyclic schedulescylindrical schedulingnonpreemptive open shop scheduling

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) Structural characterization of families of graphs (05C75)

Related Items (4)

Unnamed Item ⋮ Open shop scheduling with some additional constraints ⋮ Efficient scheduling of periodic information monitoring requests ⋮ The combinatorics of timetabling

Cites Work

• Unnamed Item
• Unnamed Item
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• On cyclic sequence types for constructing cyclic schedules
• On the Flow-Shop Sequencing Problem with No Wait in Process^†

This page was built for publication: The cyclic compact open-shop scheduling problem