Non-Approximability Results for Scheduling Problems with Minsum Criteria

INFORMS Journal on Computing

Volumn 13, Issue 2, 2001, Pages 157-168

  Hoogeveen, Han ^a   Schuurman, Petra ^b   Woeginger, Gerhard J ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Approximation Algorithm; Approximation Scheme; Apx hardness; Communication Delays; Flow Shop; Gap Reduction; L Reduction; Non Approximability; Open Shop; Precedence Constraints; Scheduling; Unrelated Parallel Machines; Worst Case Analysis

Indexed keywords

EID: 0011508774     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.13.2.157.10520     Document Type: Article

References (22)

1. Afrati, F., E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko. 1999. Approximation schemes for minimizing average weighted completion time with release dates. Proceedings of the 40th IEEE Symposium on the Foundations of Computer Science (FOCS'99). 32-43.
2. Arora, S., C. Lund, R. Motwani, M. Sudan, M. Szegedy. 1992. Proof verification and hardness of approximation problems. Proceedings of the 33rd IEEE Symposium on the Foundations of Computer Science (FOCS'92). 14-23.
3. Ausiello, G., P. Crescenzi, G. Gambiosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi. 1999. Complexity and Approximation. Springer, Berlin, Germany.
4. Bruno, J.L., E.G. Coffman, Jr., R. Sethi. 1974. Scheduling independent tasks to reduce mean finishing time. Communications of the ACM 17 382-387.
5. Garey, M.R., D.S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of . NP-Completeness. Freeman, San Francisco, CA.
6. Graham, R.L., E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 287-326.
7. Hall, L.A., A.S. Schulz, D.B. Shmoys, J. Wein. 1997. Scheduling to minimize average completion time: offline and online approximation algorithms. Mathematics of Operations Research 22 513-544.
8. Hoogeveen, J.A., J.K. Lenstra, B. Veltman. 1994. Three, four, five, six, or the complexity of scheduling with communication delays. Operations Research Letters 16 129-137.
9. Horn, W.A. 1973. Minimizing average flow time on parallel machines. Operations Research 21 846-847.
10. Kann, V. 1991. Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters 37 27-35.
11. Kellerer, H., T. Tautenhahn, G.J. Woeginger. 1996. Approximability and nonapproximability results for minimizing total flow time on a single machine. Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC'96). 418-426.
12. Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys. 1993. Sequencing and scheduling: algorithms and complexity. S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin, eds. Logistics of Pro- auction and Inventory, Handbooks in Operations Research and Management Science, Vol. 4. North-Holland, Amsterdam, The Netherlands. 445-522.
13. Lenstra, J.K., A.H.G. Rinnooy Kan. 1978. Complexity of scheduling under precedence constraints. Operations Research 26 22-35.
14. Lenstra, J.K., D.B. Shmoys. 1995. Computing near-optimal schedules. P. Chrétienne, E.G. Coffman, Jr., J.K. Lenstra, Z. Liu, eds. Scheduling Theory and Its Applications, Wiley, Chichester, United Kingdom. 1-14.
15. Lenstra, J.K., D.B. Shmoys, É. Tardos. 1990. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46 259-271.
16. Leonardi, S., D. Raz. 1997. Approximating total flow time on parallel machines. Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC'97). 110-119.
17. Munier, A., M. Queyranne, A.S. Schulz. 1998. Approximation bounds for a general class of precedence constrained parallel machines scheduling problems. Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization (IPCO'98), Springer LNCS 1412. 367-382.
18. Papadimitriou, C.H., M. Yannakakis. 1991. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43 425-440.
19. Schulz, A.S., M. Skutella. 1997. Random-based scheduling: New approximations and LP lower bounds. Proceedings of the Work-shop on Randomization and Approximation Techniques in Computer Science (RANDOM'97), Springer LNCS 1269. 119-133.
20. Skutella, M. 1997. Problem posed at the open problem session of the Dagstuhl Meeting on "Parallel Machine Scheduling." Schloß Dagstuhl, Germany, July 14-18, 1997.
21. Skutella, M., G.J. Woeginger. 1999. An approximation scheme for minimizing the weighted sum of job completion times on parallel machines. Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (STOC'99). 400-407.
22. Williamson, D.P., L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevastianov, D.B. Shmoys. 1997. Short shop schedules. Operations Research 45 288-294.