Applying circular coloring to open shop scheduling

MaRDI QIDQ3173765zbMATHFDO

Authors Mohammad Modarres, Mahsa Ghandehari

Publication date 10 October 2011

Mathematics Subject Classification ID

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

Recommendations

• Circular coloring of graphs via linear programming and tabu search
• Compact Cylindrical Chromatic Scheduling
• Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
• The cyclic compact open-shop scheduling problem
• Chromatic scheduling in a cyclic open shop

Cited in

(4)

• Resource-sharing system scheduling and circular chromatic number
• A survey of graph coloring -- its types, methods and applications
• Circular coloring of graphs via linear programming and tabu search
• Bounded colouring motivated by the limited resource partially concurrent open shop problem

This page was built for publication: Applying circular coloring to open shop scheduling

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