Compact Cylindrical Chromatic Scheduling

DOI10.1137/0404046MaRDI QIDQ3985537zbMATH OpenOpenAlexFDO

Authors Dominique De Werra, Ph. Solot

Publication date 27 June 1992

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0404046

zbMATH Keywords

cylindrical chromatic schedulingedge colouringopen shop problemscheduling problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Deterministic scheduling theory in operations research (90B35)

Recommendations

• The cyclic compact open-shop scheduling problem
• Chromatic scheduling in a cyclic open shop
• Chromatic scheduling
• Applying circular coloring to open shop scheduling

Cited in

(17)

• Extensions of coloring models for scheduling purposes
• Some complexity results in cyclic scheduling
• Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs
• Chromatic scheduling in a cyclic open shop
• Open shop scheduling with some additional constraints
• Cyclic deficiency of graphs
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Compact cyclic edge-colorings of graphs
• Interval cyclic edge-colorings of graphs
• Chromatic scheduling
• Circular coloring of graphs via linear programming and tabu search
• Applying circular coloring to open shop scheduling
• scientific article; zbMATH DE number 7141490 (Why is no real title available?)
• A family of multigraphs with large palette index
• A generalization of interval edge-colorings of graphs
• The cyclic compact open-shop scheduling problem
• Compact scheduling of zero-one time operations in multi-stage systems

This page was built for publication: Compact Cylindrical Chromatic Scheduling

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