Preassignment requirements in chromatic scheduling

DOI10.1016/S0166-218X(97)82776-XzbMATH Open0882.90076OpenAlexW2022686688MaRDI QIDQ1363744FDOQ1363744

N. V. R. Mahadev, Dominique De Werra

Publication date: 24 February 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

Recommendations

• Restrictions and preassignments in preemptive open shop scheduling
• On a multiconstrained model for chromatic scheduling
• Chromatic scheduling
• Extensions of coloring models for scheduling purposes
• Precoloring extension. I: Interval graphs

zbMATH Keywords

graph coloringopen shoptimetablingedge \(k\)-coloringpreassignment

Mathematics Subject Classification ID

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

Cites Work

• The NP-Completeness of Edge-Coloring
• Title not available (Why is that?)
• On the Complexity of Timetable and Multicommodity Flow Problems
• An introduction to timetabling
• Precoloring extension. I: Interval graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some results concerning the complexity of restricted colorings of graphs
• Chromatic scheduling and frequency assignment
• Open shop scheduling with some additional constraints
• Interval vertex-coloring of a graph with forbidden colors
• Restrictions and preassignments in preemptive open shop scheduling
• Interval edge coloring of a graph with forbidden colors
• Edge-Chromatic Scheduling with Simultaneity Constraints

Cited In (2)

• The combinatorics of timetabling
• Chromatic scheduling

This page was built for publication: Preassignment requirements in chromatic scheduling

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