Open shop scheduling with some additional constraints

Graphs and Combinatorics

Volumn 12, Issue 1, 1996, Pages 81-93

  De Werra, D ^a   Erschler, J ^b  

^a EPFL   (Switzerland)

^b CNRS   (France)

Author keywords

Chromatic scheduling; Line perfectness; Open shop scheduling; Preemptions; Simultaneity; Unrelated processors

Indexed keywords

EID: 0042080266     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01858447     Document Type: Article

References (11)

1. Agnetis, A., Lucertini, M., Nicolo, F.: Modelling and Optimization of a Flexible Pip bay Assembling System. Report 04.89 Dept of Computer and System Science, University of Roma "La Sapienza"
2. Berge, C.: Graphes, Gauthier-Villars, Paris, 1983
3. Blazewicz, J., Cellary, W., Slowinski, R., Weglarz, J.: Scheduling under Resources Constraints-Deterministic Models. Annals of Operations Research (Balzer AG, Basel, 1986)
4. Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems, SIAM Journal on Computing 5, 691-703 (1976)
5. Gonzales, T., Sahni, S.: Open shop scheduling to minimize finish time. Journal of ACM 23, 665-679 (1976)
6. Mahadev, N.V.R., Solot, Ph., de Werra, D.: Cylindrical Open Shop Scheduling: Some Solvable Cases, Vishwa International Journal of Graph Theory 1, 29-52 (1992)
7. Trotter, L.E.: Line-perfect graphs. Mathematical Programming 12, 255-259 (1977)
8. de Werra, D., Solot, Ph.: Compact cylindrical chromatic scheduling. SIAM Journal on Discrete Mathematics 4, 528-534 (1991)
9. de Werra, D.: Graph-Theoretical Models for Preemptive Scheduling in: Advances in Project Scheduling, R. Slowinski, J. Weglarz, eds. (Elsevier Science Publishers, Amsterdam, 1989), 171-185
10. de Werra, D.: Almost nonpreemptive schedules. Annals of Operations Research 26, 243-256 (1990)
11. de Werra, D., Mahadev, N.V.R., Peled, U.: Edge chromatic scheduling with simultaneity constraints. SIAM Journal on Discrete Math. 6, 631-641 (1993)