Skip to main content
SpringerLink
Log in

A 3/2-Approximation for the proportionate two-machine flow shop scheduling with minimum delays

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

We study the two-machine flow shop problem with minimum delays. The problem is known to be strongly NP-hard even in the case of unit processing times and to be approximable within a factor of 2 of the length of an optimal schedule in the general case. The question whether there exists a polynomial-time algorithm with a better approximation ratio has been posed by several researchers but still remains open. In this paper, we improve the above bound to 3/2 for the special case of the problem when both operations of each job have equal processing times (this case of flow shop is known as the proportionate flow shop). Our analysis of the algorithm relies upon a nontrivial generalization of the lower bound established by W. Yu for the case of unit processing times.

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. A. A. Ageev and A. E. Baburin, “Approximation Algorithms for UET Scheduling Problems with Exact Delays,” Oper. Res. Lett. 35(4), 533–540 (2007).

    Article  MATH  MathSciNet  Google Scholar 

  2. A. A. Ageev and A. V. Kononov, “Approximation Algorithms for Scheduling Problems with Exact Delays,” in: Lecture Notes in Computer Sciences, Vol. 4368: Approximation and Online Algorithms. 4th International Workshop, WAOA 2006 (Zurich, September 14–15, 2006) (Springer, Berlin, 2006), pp. 1–14.

    Google Scholar 

  3. M. Dell’Amico, “Shop Problems with Two Machines and Time Lags,” Oper. Res. 44(4), 777–787 (1996).

    Article  MATH  Google Scholar 

  4. M. Dell’Amico and R. J. M. Vaessens, “Flow and Open Shop Scheduling on Two Machines with Transportation Times and Machine-Independent Processing Times is NP-Hard,” in Materiali di discussione 141 (Dipartimento di Economia Politica, Università diModena, 1996).

  5. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey,” Ann. of Discrete Math. 5, 287–326 (1979).

    Article  MATH  MathSciNet  Google Scholar 

  6. S. M. Johnson, “Optimal Two-and Three-Stage Production Schedules with Setup Times Included,” Naval Res. Logist. Quart. 1, 61–68 (1954).

    Article  Google Scholar 

  7. S.M. Johnson, “Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags,” Management Sci. 5, 299–303 (1958).

    Article  Google Scholar 

  8. W. Kern and W. M. Nawijn, “Scheduling Multi-Operation Jobs with Time Lags on a Single Machine,” in: Proceedings of the 2nd Workshop on Graphs and Combinatorial Optimization (Enschede, 1991).

  9. J. K. Lenstra (private communication, 1991).

  10. L. G. Mitten, “Sequencing n Jobs on Two Machines with Arbitrary Time Lags,” Management Sci. 5, 293–298 (1958).

    Article  MathSciNet  Google Scholar 

  11. V. A. Strusevich, “A Heuristic for the Two-Machine Open-Shop Scheduling with Transportation Times,” Discrete Appl. Math. 93(2–3), 287–304 (1999).

    Article  MATH  MathSciNet  Google Scholar 

  12. W. Yu, The Two-Machine Shop Problem with Delays and the One-Machine Total Tardiness Problem, PhD Thesis (Depart. Math. Comput. Sci., Technische Universiteit Eindhoven, 1996).

  13. W. Yu, H. Hoogeveen and J. K. Lenstra, “Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard,” J. Sched. 7(5), 333–348 (2004).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia

    A. A. Ageev

Authors
  1. A. A. Ageev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. A. Ageev.

Additional information

Original Russian Text © A.A. Ageev, 2007, published in Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2007, Vol. 14, No. 4, pp. 3–15.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ageev, A.A. A 3/2-Approximation for the proportionate two-machine flow shop scheduling with minimum delays. J. Appl. Ind. Math. 2, 447–454 (2008). https://doi.org/10.1134/S1990478908040017

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1990478908040017

Keywords

Search

Navigation