Compact Cylindrical Chromatic Scheduling

DOI10.1137/0404046zbMath0754.05037OpenAlexW2076108970MaRDI QIDQ3985537

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

edge colouringscheduling problemopen shop problemcylindrical chromatic scheduling

Mathematics Subject Classification ID

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

Related Items (13)

Interval cyclic edge-colorings of graphs ⋮ Some complexity results in cyclic scheduling ⋮ Unnamed Item ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Open shop scheduling with some additional constraints ⋮ A generalization of interval edge-colorings of graphs ⋮ Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs ⋮ Compact cyclic edge-colorings of graphs ⋮ Chromatic scheduling in a cyclic open shop ⋮ Compact scheduling of zero-one time operations in multi-stage systems ⋮ Cyclic deficiency of graphs ⋮ A family of multigraphs with large palette index ⋮ Extensions of coloring models for scheduling purposes

This page was built for publication: Compact Cylindrical Chromatic Scheduling