Chromatic scheduling in a cyclic open shop

DOI10.1016/j.ejor.2003.06.047zbMath1057.90017OpenAlexW1973216570MaRDI 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

SchedulingNP-completnessCircular edge-coloringCyclic open shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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.

This page was built for publication: Chromatic scheduling in a cyclic open shop