The cyclic compact open-shop scheduling problem

DOI10.1016/0012-365X(93)90171-OMaRDI QIDQ686491zbMATH OpenOpenAlexFDO

Authors N. V. R. Mahadev, Ph. Solot, Dominique De Werra

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)

Recommendations

• Open shop cyclic scheduling
• Chromatic scheduling in a cyclic open shop
• Scheduling Periodic Jobs Compactly Within A Fixed Time Period In Open Shops
• Compact Cylindrical Chromatic Scheduling
• Open shop scheduling with synchronization

Cites work

• scientific article; zbMATH DE number 4095196 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• On cyclic sequence types for constructing cyclic schedules
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs

Cited in

(12)

• Chromatic scheduling in a cyclic open shop
• Open shop scheduling with some additional constraints
• Cyclic flow-shop scheduling with no-wait constraints and missing operations
• NP-hardness of compact scheduling in simplified open and flow shops.
• scientific article; zbMATH DE number 7141490 (Why is no real title available?)
• Applying circular coloring to open shop scheduling
• Scheduling Periodic Jobs Compactly Within A Fixed Time Period In Open Shops
• Efficient scheduling of periodic information monitoring requests
• Open shop scheduling with synchronization
• Open shop cyclic scheduling
• Compact Scheduling In Open Shop With Zero-One Time Operations
• The combinatorics of timetabling

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

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