Chromatic scheduling in a cyclic open shop

DOI10.1016/j.ejor.2003.06.047zbMath1057.90017MaRDI QIDQ1767677

Marek Kubale, Adam Nadolski

Publication date: 8 March 2005

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.06.047

zbMATH Keywords

Scheduling; NP-completness; Circular edge-coloring; Cyclic open shop

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Unnamed Item, Interval cyclic edge-colorings of graphs, On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic, The circular chromatic index of some Class 2 graphs, Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs, Open shop cyclic scheduling, Cyclic deficiency of graphs, On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs, Compact cyclic edge-colorings of graphs, On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees

Cites Work

• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Compact Cylindrical Chromatic Scheduling
• Open Shop Scheduling to Minimize Finish Time
• Some graph‐theoretical models for scheduling in automated production systems
• Short Shop Schedules
• NP-hardness of compact scheduling in simplified open and flow shops.
• Unnamed Item
• Unnamed Item