The cyclic compact open-shop scheduling problem
DOI10.1016/0012-365X(93)90171-OzbMATH Open0797.90045OpenAlexW1971413514MaRDI QIDQ686491FDOQ686491
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
Recommendations
graph-theoretic modelautomated production systemscyclic schedulescylindrical schedulingnonpreemptive open shop scheduling
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)
Cites Work
Cited In (11)
- Open shop cyclic scheduling
- Cyclic flow-shop scheduling with no-wait constraints and missing operations
- The combinatorics of timetabling
- Open shop scheduling with synchronization
- Chromatic scheduling in a cyclic open shop
- Open shop scheduling with some additional constraints
- Applying circular coloring to open shop scheduling
- Title not available (Why is that?)
- Scheduling Periodic Jobs Compactly Within A Fixed Time Period In Open Shops
- NP-hardness of compact scheduling in simplified open and flow shops.
- Efficient scheduling of periodic information monitoring requests
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)