Preassignment requirements in chromatic scheduling
From MaRDI portal
Publication:1363744
DOI10.1016/S0166-218X(97)82776-XzbMath0882.90076OpenAlexW2022686688MaRDI QIDQ1363744
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
Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An introduction to timetabling
- Some results concerning the complexity of restricted colorings of graphs
- Precoloring extension. I: Interval graphs
- Interval edge coloring of a graph with forbidden colors
- Chromatic scheduling and frequency assignment
- Interval vertex-coloring of a graph with forbidden colors
- Open shop scheduling with some additional constraints
- Restrictions and preassignments in preemptive open shop scheduling
- The NP-Completeness of Edge-Coloring
- On the Complexity of Timetable and Multicommodity Flow Problems
- Edge-Chromatic Scheduling with Simultaneity Constraints