Proceedings of IEEE 36th Annual Foundations of Computer Science (1995)

Milwaukee, Wisconsin

Oct. 23, 1995 to Oct. 25, 1995

ISSN: 0272-5428

ISBN: 0-8186-7183-1

pp: 82

L.A. Hall , Dept. of Math. Sci., Johns Hopkins Univ., Baltimore, MD, USA

ABSTRACT

Shop scheduling problems are notorious for their intractability, both in theory and practice. In this paper, we demonstrate the existence of a polynomial approximation scheme for the flow shop scheduling problem with an arbitrary fixed number of machines. For the three common shop models (open, flow, and job), this result is the only known approximation scheme. Since none of the three models can be approximated arbitrarily closely in the general case (unless P=NP), the result demonstrates the approximability gap between the models in which the number of machines is fixed, and those in which it is part of the input of the instance. The result can be extended to flow shops with job release dates and delivery times and to flow shops with a fixed number stages, where the number of machines at any stage is fixed. We also describe a related polynomial approximation scheme for the problem of scheduling an open shop with a single bottleneck machine and an arbitrary number of non-bottleneck machines.

INDEX TERMS

scheduling; resource allocation; flow shop scheduling; polynomial approximation scheme; shop models; open shop; single bottleneck machine

CITATION

L. Hall, "Approximability of flow shop scheduling,"

*Proceedings of IEEE 36th Annual Foundations of Computer Science(FOCS)*, Milwaukee, Wisconsin, 1995, pp. 82.

doi:10.1109/SFCS.1995.492465

CITATIONS

SEARCH