Inapproximability results for no-wait job shop scheduling

Authors:
Gerhard J. Woeginger
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Operations Research Letters
Year:
2004

Citing 6
Cited 3

The Three-Machine No-Wait Flow Shop is NP-Complete

Journal of the ACM (JACM)
Maximum bounded 3-dimensional matching is MAX SNP-complete

Information Processing Letters
The hardness of approximation: gap location

Computational Complexity
Makespan minimization in job shops: a polynomial time approximation scheme

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme

SIAM Journal on Discrete Mathematics
Approximability and in-approximability results for no-wait shop scheduling

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science

Minimizing Makespan in No-Wait Job Shops

Mathematics of Operations Research
An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops

Computers and Operations Research
Short Communication: An effective TPA-based algorithm for job-shop scheduling problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the approximability of the no-wait job shop scheduling problem under the makespan criterion. We show that this problem is APX-hard (i) for the case of two machines with at most five operations per job, and (ii) for the case of three machines with at most three operations per job. Hence, these problems do not possess a polynomial time approximation scheme, unless P=NP.