Skip to main content
SpringerLink
Log in

A polynomial algorithm for the three‐machineopen shop with a bottleneck machine

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The paper considers the three‐machine open shop scheduling problem to minimize themakespan. It is assumed that each job consists of at most two operations, one of which is tobe processed on the bottleneck machine, the same for all jobs. A new lower bound on theoptimal makespan is derived, and a linear‐time algorithm for finding an optimalnon‐preemptive schedule is presented.

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. I. Adiri and N. Aizikowitz (Hefetz), Open-shop problems with dominated machines, Naval Res. Log. 36(1989)273-291.

    Google Scholar 

  2. I. Bárány and T. Fiala, Nearly optimum solution of multimachine scheduling problems, Szigma 15(1982)177-191 (in Hungarian).

    Google Scholar 

  3. B. Chen and V.A. Strusevich, Approximation algorithms for three-machine open shop scheduling, ORSA J. Comput. 5(1993)321-326.

    Google Scholar 

  4. T. Fiala, An algorithm for the open-shop problem, Math. Oper. Res. 8(1983)100-109.

    Google Scholar 

  5. J.N.D. Gupta, A flowshop scheduling problem with two operations per job, Int. J. Prod. Res. 35 (1997)2309-2325.

    Google Scholar 

  6. J.W. Herrmann and C.-Y. Lee, Three-machine look-ahead scheduling problems, Research Report No. 92-93, Department of Industrial Engineering, University of Florida, Gainesville, FL, USA, 1992.

    Google Scholar 

  7. T. Gonzalez and S. Sahni, Open shop scheduling to minimize finish time, J. ACM 23(1976)665-679.

    Google Scholar 

  8. A. Kononov, S. Sevastianov and I. Tschernykh, When difference in machine loads leads to efficient scheduling in open shops, Ann. Oper. Res. 92(1999), this volume.

  9. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: Handbook in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory, eds. S.C. Graves et al., North-Holland, Amsterdam, 1993, pp. 445-522.

    Google Scholar 

  10. T. Masuda, H. Ishii and T. Nishida, A solvable case of n/3/O/C max problem, Technol. Reports Osaka University 40, No. 1986, 1990, pp. 1-7.

  11. Y.D. Neumytov and S.V. Sevast'janov, An approximation algorithm with an exact bound for the three-machine problem with the opposite routes, Upravlyaemye Sistemy 31(1993)53-65 (in Russian).

    Google Scholar 

  12. C. Oğuz, B.M.T. Lin and T.C.E. Cheng, Two-stage flow shop scheduling with a common secondstage machine. Comput. Oper. Res. 24(1997)1169-1174.

    Google Scholar 

  13. M. Pinedo and L. Schrage, Stochastic shop scheduling: A survey, in: Deterministic and Stochastic Scheduling, eds. M.A.H. Dempster et al., Reidel, Dordrecht, 1982, pp. 181-196.

    Google Scholar 

  14. V.S. Tanaev, Y.N. Sotskov and V.A. Strusevich, Scheduling Theory. Multi-Stage Systems, Kluwer, Dordrecht, 1994.

    Google Scholar 

Download references

Authors
  1. I.G. Drobouchevitch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V.A. Strusevich
    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

Drobouchevitch, I., Strusevich, V. A polynomial algorithm for the three‐machineopen shop with a bottleneck machine. Annals of Operations Research 92, 185–210 (1999). https://doi.org/10.1023/A:1018982630730

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018982630730

Keywords

Search

Navigation