Loading...
research article
Hardness of Approximating Flow and Job Shop Scheduling Problems
2011
We consider several variants of the job shop problem that is a fundamental and classical problem in scheduling. The currently best approximation algorithms have worse than logarithmic performance guarantee, but the only previously known inapproximability result says that it is NP-hard to approximate job shops within a factor less than 5/4. Closing this big approximability gap is a well-known and long-standing open problem.
Type
research article
Web of Science ID
WOS:000297210200002
Authors
Publication date
2011
Published in
Volume
58
Issue
5
Start page
20
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
December 16, 2011
Use this identifier to reference this record