Applying circular coloring to open shop scheduling

zbMATH Open1225.90055MaRDI QIDQ3173765FDOQ3173765

Authors: Mohammad Modarres, Mahsa Ghandehari 

Publication date: 10 October 2011

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

Mathematics Subject Classification ID

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

Cited In (3)

• Circular coloring of graphs via linear programming and tabu search
• Resource-sharing system scheduling and circular chromatic number
• A survey of graph coloring -- its types, methods and applications

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)