On a multiconstrained model for chromatic scheduling

Discrete Applied Mathematics

Volumn 94, Issue 1-3, 1999, Pages 171-180

  De Werra, D ^a  

^a EPFL   (Switzerland)

Author keywords

Chromatic scheduling; Constrained programming; Graph coloring; Network flow; Timetabling

Indexed keywords

EID: 0042208608     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00019-0     Document Type: Article

References (12)

1. K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
2. E. Balas, Machine sequencing via disjunctive graphs: an implicit enumeration algorithm, Oper. Res. 17 (1969).
3. C. Berge, Graphes, Gauthier-Villars, Paris, 1983.
4. S. Even, A. Itai, R. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J. Comput. 5 (1976) 691-703.
5. T. Gabow, O. Nishizeki, D. Kariv, O. Leven, O. Terada, Algorithms for edge coloring graphs. University of Colorado, Boulder, 1983, unpublished manuscript.
6. M.R. Garey, D.S. Johnson, Computers and Intractability, A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979.
7. P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160.
8. M. Kubale, Interval edge colorings of a graph with forbidden colors, Discrete Math. 121 (1993) 135-143.
9. G. Nemhauser, L. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
10. D. de Werra, An introduction to timetabling, European J. Oper. Res. 19 (1985) 151-162.
11. D. de Werra, A.J. Hoffman, N.V.R. Mahadev, U.N. Peled, Restrictions and Preassignments in preemptive open shop scheduling, Discrete Appl. Math. 68 (1996) 169-188.
12. D. de Werra, Restricted coloring models for timetabling, Discrete Math. 165/166 (1997) 161-170.