Skip to main content

Advertisement

Springer Nature Link
Log in

Makespan minimization in preemptive two machine job shops

  • Short Communication
  • Published:
Computing Aims and scope Submit manuscript

Abstract

In this note we investigate the NP-complete problem of minimizing the makespan in a preemptive two machine job shop. We present a polynomial time approximation algorithm with worst case ratio 3/2 for this problem, and we also argue that this is the best possible result that can be derived via our line of approach.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Akers, S. B.: A graphical approach to production scheduling problems. Oper. Res.4, 244–245 (1956).

    Article  Google Scholar 

  2. Brucker, P., Kravchenko, S. A., Sotskov, Y. N.: Preemptive job-shop scheduling problems with a fixed number of jobs. Osnabrücker Schriften zur Mathematik,184, Universität Osnabrück, Germany (1997).

    Google Scholar 

  3. Gonzalez, T., Sahni, S.: Flowshop and jobshop schedules: complexity and approximation. Oper. Res.26, 36–52 (1978).

    MATH  MathSciNet  Google Scholar 

  4. Graham, R. L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math.17, 416–429 (1969).

    Article  MATH  MathSciNet  Google Scholar 

  5. Hall, L. A.: Approximability of flow shop scheduling. In: Proceedings of 36th IEEE Symposium on Foundations of Computer Science, pp. 82–91 (1995).

  6. Hefetz, N., Adiri, I.: An efficient optimal algorithm for the two-machine, unit-time, jobshop, schedule-length problem. Math. Oper. Res.7, 354–360 (1982).

    MATH  Google Scholar 

  7. Jackson, J. R.: An extension of Johnson’s result on job lot scheduling. Naval. Res. Log. Q.3, 201–203 (1956).

    Article  Google Scholar 

  8. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., Shmoys, D. B.: Sequencing and scheduling: algorithms and complexity. In: Handbooks in Operations Research and Management Science, Vol. 4, pp. 445–522. Amsterdam: North Holland, 1993.

    Google Scholar 

  9. Sevastianov, S. V., Woeginger, G. J.: Makespan minimization in open shops: a polynomial time approximation scheme. Math. Program. to appear (1997).

  10. Shmoys, D. B., Stein, C., Wein, J.: Improved approximation algorithm for shop scheduling problems. SIAM. J. Comput.23, 617–632 (1996).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Universitetskii pr. 4, 630090, Novosibirsk-90, Russia

    S. V. Sevastianov

  2. Institut für Mathematik, Graz University of Technology, Steyrergasse 30, A-8010, Graz, Austria

    G. J. Woeginger

Authors
  1. S. V. Sevastianov
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. G. J. Woeginger
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sevastianov, S.V., Woeginger, G.J. Makespan minimization in preemptive two machine job shops. Computing 60, 73–79 (1998). https://doi.org/10.1007/BF02684330

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS Subject Classifications

Key words