Preassignment requirements in chromatic scheduling

DOI10.1016/S0166-218X(97)82776-XMaRDI QIDQ1363744zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

edge \(k\)-coloringgraph coloringopen shoppreassignmenttimetabling

Mathematics Subject Classification ID

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

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

Cites work

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

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)