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

Authors:
Alexander A. Ageev
Affiliations:
Sobolev Institute of Mathematics, Novosibirsk, Russia
Venue:
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Year:
2007

Citing 4
Cited 1

A heuristic for two-machine open-shop scheduling problem with transportation times

Discrete Applied Mathematics
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Journal of Scheduling
Approximation algorithms for scheduling problems with exact delays

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Approximation algorithms for UET scheduling problems with exact delays

Operations Research Letters

Polynomial-time approximation schemes for scheduling problems with time lags

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

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 Yu for the case of unit processing times.