conference paper
Preassignments in Chromatic Scheduling
1994
Operations Research ’93. Extended Abstracts of the 18th Symposium on Operations Research held at the University of Cologne September 1–3, 1993
Some types of scheduling problems can be solved as edge coloring models in bipartite multigraphs. It is in particular the case for preemptive open shop scheduling. The presence of additional constraints generally transforms this polynomially solvable type of problem into a difficult one. The study of polynomially solvable special cases is therefore interesting for guiding the development of general heuristic procedures.
Type
conference paper
Author(s)
École Polytechnique Fédérale de Lausanne
Date Issued
1994
Publisher
Publisher place
Berlin
Published in
Operations Research ’93. Extended Abstracts of the 18th Symposium on Operations Research held at the University of Cologne September 1–3, 1993
DOI of the book
ISBN of the book
978-3-7908-0794-3
978-3-642-46955-8
Total of pages
XXVI, 550
Start page
526
End page
528
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
| Event name | Event acronym | Event place | Event date |
Cologne | 1993-09-01 - 1993-09-03 | ||
Available on Infoscience
February 4, 2026
Use this identifier to reference this record