(Acyclic) ob shops are hard to approximate

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 583-591

  Mastrolilli, Monaldo ^a   Svensson, Ola ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; CONTROL THEORY; FIBER OPTIC CHEMICAL SENSORS; POLYNOMIALS;

APPROXIMATE SOLUTIONS; INAPPROXIMABILITY; JOB SHOPS; LOWER BOUNDS; OPEN PROBLEMS; OPTIMAL VALUES; POLYNOMIAL ALGORITHMS; POLYNOMIAL TIMES; TWO MACHINES; VEGAS ALGORITHMS;

POLYNOMIAL APPROXIMATION;

EID: 57949108531     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.36     Document Type: Conference Paper

References (18)

1. P. Alimonti and V. Kann. Some APX-completeness results for cubic graphs. Theor. Comput. Sci., 237(1-2):123-134, 2000.
2. N. Bansal, T. Kimbrel, and M. Sviridenko. Job shop scheduling with unit processing times. Mathematics of Operations Research, 31:381-389, 2006.
3. A. Czumaj and C. Scheideler. A new algorithm approach to the general lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC, pages 38-47, 2000.
4. U. Feige and C. Scheideler. Improved bounds for acyclic job shop scheduling. Combinatorica, 22(3):361-399, 2002.
5. A. V. Fishkin, K. Jansen, and M. Mastrolilli. Grouping techniques for scheduling problems: Simpler and faster. Algorithmica, 51(2):183-199, 2008.
6. L. Goldberg, M. Paterson, A. Srinivasan, and E. Sweedyk. Better approximation guarantees for job-shop scheduling. SIAM Journal on Discrete Mathematics, 14(1):67-92, 2001.
7. T. Gonzalez and S. Sahni. Flowshop and jobshop schedules: complexity and approximation. Operations Research, 26:36-52, .1978.
8. R. Graham, E. Lawler, J. Lenstra, and A. R. Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. In Annals of Discrete Mathematics, volume 5, pages 287-326. North-Holland, 1979.
9. K. Jansen, R. Solis-Oba, and M. Sviridenko. Makespan minimization in job shops: A linear time approximation scheme. SIAM J. Discrete Math., 16(2):288-300, 2003.
10. S. Khot. Improved inaproximability results for maxclique, chromatic number and approximate graph coloring. In FOCS, pages 600-609, 2001.
11. E. Lawler, J. Lenstra, A. R. Kan, and D. Shmoys. Sequencing and scheduling: Algorithms and complexity. Handbook in Operations Research and Management Science, 4:445-522, 1993.
12. F. T. Leighton, B. M. Maggs, and S. B. Rao. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica, 14(2):167-186, 1994.
13. F. T. Leighton, B. M. Maggs, and. A. W. Richa. Fast algorithms for finding O (congestion + dilation) packet routing schedules. Combinatorica, 19:375-401, 1999.
14. M. Mastrolilli and O. Svensson. (acyclic) job shops are hard to approximate. http://www.idsia.chrmonaldo, 2008.
15. M. Queyranne and M. Sviridenko. Approximation algorithms for shop scheduling problems with minsum objective. Journal of Scheduling, 5(4):287-305, 2002.
16. P. Schuurman and G. J. Woeginger. Polynomial time approximation algorithms for machine scheduling: ten open problems. Journal of Scheduling, 2(5):203-213, 1999.
17. D. Shmoys, C. Stein, and J. Wein. Improved approximation algorithms for shop scheduling problems. SIAM Journal on Computing, 23:617-632, 1994.
18. D. Williamson, L. Hall, J. Hoogeveen, C. Hurkens, J. Lenstra, S. Sevastianov, and D. Shmoys. Short shop schedules. Operations Research, 45:288-294, 1997.