Highly Influenced

@article{Mastrolilli2011HardnessOA, title={Hardness of Approximating Flow and Job Shop Scheduling Problems}, author={Monaldo Mastrolilli and Ola Svensson}, journal={J. ACM}, year={2011}, volume={58}, pages={20:1-20:32} }

- Published 2011 in J. ACM
DOI:10.1145/2027216.2027218

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.
This article closes many gaps in our understanding of the hardness of… CONTINUE READING

Showing 1-10 of 15 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential