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 \(\frac{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 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 chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ageev, A.A., Baburin, A.E.: Approximation algorithms for UET scheduling problems with Exact Delays. Oper. Res. Letters 35, 533–540 (2007)
Ageev, A.A., Kononov, A.V.: Approximation algorithms for scheduling problems with exact delays. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 1–14. Springer, Heidelberg (2007)
Dell’Amico, M.: Shop problems with two machines and time lags. Operations Research 44, 777–787 (1996)
Dell’Amico, M., Vaessens, R.J.M.: Flow and open shop scheduling on two machines with transportation times and machine-independent processing times is NP-hard. Materiali di discussione 141, Dipartimento di Economia Politica, Università di Modena (1996)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5, 287–326 (1979)
Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1, 61–68 (1954)
Johnson, S.M.: Discussion: Sequencing n jobs on two machines with arbitrary time lags. Management Science 5, 293–298 (1958)
Kern, W., Nawijn, W.M.: Scheduling multi-operation jobs with time lags on a single machine. In: Faigle, U., Hoede, C. (eds.) Proceedings of the 2nd Twente Workshop on Graphs and Combinatorial Optimization, Enschede (1991)
Lenstra, J.K.: Private communication (1991)
Mitten, L.G.: Sequencing n jobs on two machines with arbitrary time lags. Management Science 5, 293–298 (1958)
Strusevich, V.A.: A heuristic for the two-machine open-shop scheduling with transportation times. Discrete Applied Mathematics 93, 287–304 (1999)
Yu, W.: The two-machine shop problem with delays and the one-machine total tardiness problem, Ph.D. thesis, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven (1996)
Yu, W., Hoogeveen, H., Lenstra, J.K.: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. J. Sched. 7(5), 333–348 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ageev, A.A. (2008). A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays. In: Kaklamanis, C., Skutella, M. (eds) Approximation and Online Algorithms. WAOA 2007. Lecture Notes in Computer Science, vol 4927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77918-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-77918-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77917-9
Online ISBN: 978-3-540-77918-6
eBook Packages: Computer ScienceComputer Science (R0)