Graphs and Combinatorics

, Volume 12, Issue 1, pp 81–93 | Cite as

Open shop scheduling with some additional constraints

  • D. de Werra
  • J. Erschler
Article
First Online:
Received:
Revised:

Abstract

An open shop scheduling problem is presented; preemptions during processing of a job on a processorp is allowed but the job cannot be sent on another processorq before it is finished onp. A graph-theoretical model is described and a characterization is given for problems where schedules with such restricted preemptions useT time units whereT is the maximum of the processing times of the jobs and of the working times of the processors. The general case is shown to be NP-complete. We also consider the case where some constraints of simultaneity are present. Complexity of the problem is discussed and a solvable case is described.

Keywords

Open shop scheduling preemptions line-perfectness unrelated processors chromatic scheduling simultaneity 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agnetis, A., Lucertini, M., Nicolo, F.: Modelling and Optimizaion of a Flexible Pipeline Assembling System. Report 04.89 Dept of Computer and System Science, University of Roma “La Sapienza”Google Scholar
  2. 2.
    Berge, C.: Graphes, Gauthier-Villars, Paris, 1983MATHGoogle Scholar
  3. 3.
    Blazewicz, J., Cellary, W., Slowinski, R., Weglarz, J.: Scheduling under Resource Constraints-Deterministic Models. Annals of Operations Research (Balzer AG, Basel, 1986)Google Scholar
  4. 4.
    Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems, SIAM Journal on Computing5, 691–703 (1976)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Gonzales, T., Sahni, S.: Open shop scheduling to minimize finish time. Journal of ACM23, 665–679 (1976)CrossRefGoogle Scholar
  6. 6.
    Mahadev, N.V.R., Solot, Ph., de Werra, D.: Cylindrical Open Shop Scheduling: Some Solvable Cases, Vishwa International Journal of Graph Theory1, 29–52 (1992)MathSciNetGoogle Scholar
  7. 7.
    Trotter, L.E.: Line-perfect graphs. Mathematical Programming12, 255–259 (1977)CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    de Werra, D., Solot, Ph.: Compact cylindrical chromatic scheduling. SIAM Journal on Discrete Mathematics4, 528–534 (1991)CrossRefMATHMathSciNetGoogle Scholar
  9. 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–185CrossRefGoogle Scholar
  10. 10.
    de Werra, D.: Almost nonpreemptive schedules. Annals of Operations Research26, 243–256 (1990)CrossRefMATHMathSciNetGoogle Scholar
  11. 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)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • D. de Werra
    • 1
  • J. Erschler
    • 2
  1. 1.Département de MathématiquesSwiss Federal Institute of Technology in LausanneSwitzerland
  2. 2.Laboratoire d'Automatique et d'Analyse de SystèmesC.N.R.S.ToulouseFrance

Personalised recommendations