Skip to main content
SpringerLink
Log in

Open shop scheduling with some additional constraints

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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”

  2. Berge, C.: Graphes, Gauthier-Villars, Paris, 1983

    MATH  Google Scholar 

  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. Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems, SIAM Journal on Computing5, 691–703 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gonzales, T., Sahni, S.: Open shop scheduling to minimize finish time. Journal of ACM23, 665–679 (1976)

    Article  Google Scholar 

  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)

    MathSciNet  Google Scholar 

  7. Trotter, L.E.: Line-perfect graphs. Mathematical Programming12, 255–259 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  8. de Werra, D., Solot, Ph.: Compact cylindrical chromatic scheduling. SIAM Journal on Discrete Mathematics4, 528–534 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  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

    Chapter  Google Scholar 

  10. de Werra, D.: Almost nonpreemptive schedules. Annals of Operations Research26, 243–256 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de Mathématiques, Swiss Federal Institute of Technology in Lausanne, Switzerland

    D. de Werra

  2. Laboratoire d'Automatique et d'Analyse de Systèmes, C.N.R.S., Toulouse, France

    J. Erschler

Authors
  1. D. de Werra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Erschler
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

de Werra, D., Erschler, J. Open shop scheduling with some additional constraints. Graphs and Combinatorics 12, 81–93 (1996). https://doi.org/10.1007/BF01858447

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01858447

Keywords

Search

Navigation