Approximation schemes for scheduling and covering on unrelated machines

Theoretical Computer Science

Volumn 359, Issue 1-3, 2006, Pages 400-417

  Efraimidis, Pavlos S ^a   Spirakis, Paul G ^b  

^a DEMOCRITUS UNIVERSITY OF THRACE   (Greece)

^b University of Patras and Computer Technology Institute   (Greece)

Author keywords

Approximation schemes; Covering; Derandomization; Multi objective scheduling; Randomized rounding

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

APPROXIMATION SCHEMES; COVERING; DERANDOMIZATION; MULTI-OBJECTIVE SCHEDULING; RANDOMIZED ROUNDING;

COMPUTER SCIENCE;

EID: 33746374355     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.05.025     Document Type: Article

References (29)

1. F.N. Afrati, E. Bampis, C. Chekuri, D.R. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Sartinutella, C. Stein, M. Sviridenko, Approximation schemes for minimizing average weighted completion time with release dates, in: IEEE FOCS, 1999, pp. 32-44.
2. E. Angel, E. Bampis, A. Kononov, A fptas for approximating the unrelated parallel machines scheduling problem with costs, in: ESA'01, Lecture Notes in Computer Science, Vol. 2161, 2001, pp. 194-205.
3. Angel E., Bampis E., and Kononov A. On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theoret. Comput. Sci. 306 (2003) 319-338
4. Y. Azar, L. Epstein, Approximation schemes for covering and scheduling on related machines, in: Proc. of First APPROX, 1998, pp. 39-47.
5. Blum C., and Roli A. Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35 3 (2003) 268-308
6. Csirik J., Kellerer H., and Woeginger G. The exact lpt-bound for maximizing the minimum completion time. Oper. Res. Lett. 11 (1992) 281-287
7. P.S. Efraimidis, P.G. Spirakis, Randomized approximation schemes for scheduling unrelated parallel machines, Electron. Colloq. on Computational Complexity (ECCC) (007), 2000.
8. Friesen D.K., and L Deuermeyer B. Analysis of greedy solutions for a replacement part sequencing problem. Math. Oper. Res. 6 (1981) 74-87
9. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company
10. Grigoriadis M., and Khachiyan L. Coordination complexity of parallel price-directive decomposition. Math. Oper. Res. 21 (1996) 317-327
11. M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, B. Reed (Eds.), Probabilistic Methods for Algorithmic Discrete Mathematics, Springer, Berlin, 1998.
12. Hall L. Approximation algorithms for scheduling. In: Hochbaum D. (Ed). Approximation Algorithm for NP-hard Problems (1997), PWS Publishing Company (Chapter 1)
13. He Y., and Jiang Y. Optimal semi-online preemptive algorithms for machine covering on two uniform machines. Theoret. Comput. Sci. 339 (2005) 293-314
14. He Y., and Tan Z. Ordinal on-line scheduling for maximizing the minimum machine completion time. J. Combin. Optim. 6 2 (2002) 199-206
15. Hochbaum D., and Shmoys D.B. A unified approach to approximation algorithms for bottleneck problems. J. ACM 3 33 (1986) 533-550
16. Horowitz E., and Sahni S. Exact and approximate algorithms for scheduling nonidentical processors. J. ACM 23 (1976) 317-327
17. K. Jansen, L. Porkolab, Improved approximation schemes for scheduling unrelated parallel machines, in: ACM STOC, 1999, pp. 408-417.
18. K. Jansen, M.I. Sviridenko, Polynomial time approximation schemes for the multiprocessor open and flow shop scheduling problem, Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000, pp. 455-465.
19. Lenstra J.K., Shmoys D.B., and Tardos E. Approximation algorithms for scheduling unrelated parallel machines. Math. Programming 46 (1990) 259-271
20. J. Leung (Ed.), Handbook of Scheduling: Algorithms, Models and Performance Analysis, Chapman & Hall/CRC, Boca Raton, FL, London, 2004.
21. Mitzenmacher M., Richa A., and Sitaraman R. The power of two random choices: a survey of techniques and results. In: Pardalos P.M., Rajasekaran S., Reif J., and Rolim J.D.P. (Eds). Handbook of Randomized Algorithms (2001), Kluwer Academic Publishers, Dordrecht
22. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press, Cambridge
23. Raghavan P. Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. System Sci. 37 (1988) 130-143
24. P. Schuurman, G.J. Woeginger, Approximation schemes-a tutorial, in: R.H. Moehring, C.N. Potts, A.S. Schulz, G.J. Woeginger, L.A. Wolsey (Eds.), Lectures on Scheduling, to appear, http://www.win.tue.nl/∼egwoegi/papers/ptas.ps.
25. Schuurman P., and Woeginger G.J. Polynomial time approximation algorithms for machine scheduling: ten open problems. J. Scheduling 2 (1999) 203-213
26. Shmoys D., and Tardos E. An approximation algorithm for the generalized assignment problem. Math. Programming A62 (1993) 461-474
27. Vöcking B. How asymmetry helps load balancing. J. ACM 50 4 (2003) 568-589
28. Woeginger G.J. A polynomial-time approximation scheme for maximizing the minimum machine completion time. Oper. Res. Lett. 20 4 (1997) 149-154
29. N.E. Young, Sequential and parallel algorithms for mixed packing and covering, in: IEEE FOCS, 2001, pp. 538-546.