Tighter approximation bounds for LPT scheduling in two special cases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3998 LNCS, Issue , 2006, Pages 187-198

  Kovács, Annamária ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; SCHEDULING;

2-DIVISIBLE MACHINES; LONGEST PROCESSING TIME (LPT); WORST CASE APPROXIMATION RATIO;

PROBLEM SOLVING;

EID: 33746065270     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758471_20     Document Type: Conference Paper

References (15)

1. A. Archer and É. Tardos. Truthful mechanisms for one-parameter agents. In Proc. 42nd IEEE Symp. on Found, of Comp. Sci. (FOCS), pages 482-491, 2001.
2. Y. Cho and S. Sahni. Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9(1):91-103, 1980.
3. E.G. Coffman, M.R. Garey, and D.S. Johnson. An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing, 7(1):1-17, 1978.
4. G. Dobson. Scheduling independent tasks on uniform processors. SIAM Journal on Computing, 13(4):705-716, 1984.
5. D.K. Friesen. Tighter bounds for LPT scheduling on uniform processors. SIAM Journal on Computing, 16(3):554-560, 1987.
6. T. Gonzalez, O.H. Ibarra, and S. Sahni. Bounds for LPT schedules on uniform processors. SIAM Journal on Computing, 6(1):155-166, 1977.
7. D.S. Hochbaum and D.B. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comp., 17(3):539-551, 1988.
8. E. Horowitz and S. Sahni. Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM, 23:317-327, 1976.
9. A. Kovács. Tighter approximation bounds for LPT scheduling in two special cases. Extended version: http://www.mpi-inf.mpg.de/~panni/approx.ps.
10. A. Kovács. Fast monotone 3-approximation algorithm for scheduling related machines. In Proc. 13th Ann. Europ. Symp. on Algo. (ESA), LNCS. Springer, 2005.
11. R. Li and L. Shi. An on-line algorithm for some uniform processor scheduling. SIAM Journal on Computing, 27(2):414-422, 1998.
12. J.W.S. Liu and C.L. Liu. Bounds on scheduling algorithms for heterogeneous computing systems. In Proc. Intern. Feder, of Inf. Proc. Soc., p. 349-353, 1974.
13. P. Mireault, J.B. Orlin, and R.V. Vohra. A parametric worst case analysis of the LPT heuristic for two uniform machines. Oper. Res., 45(1):116-125, 1997.
14. D.S. Johnson M.R. Garey. Computers and Intractability; A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1979.
15. V. Auletta R. De Prisco P. Penna and G. Persiano. Deterministic truthful approximation mechanisms for scheduling related machines. In Proc. 21st STACS, volume 2996 of LNCS, p. 608-619. Springer, 2004.