Approximation schemes for scheduling on uniformly related and identical parallel machines

Algorithmica (New York)

Volumn 39, Issue 1, 2004, Pages 43-57

  Epstein, Leah ^a   Sgall, Jiri ^b,c  

^a INTERDISCIPLINARY CENTER   (Israel)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

^c INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

Approximation algorithms; Machine completion time; Parallel machines; Polynomial time approximation scheme; Scheduling

Indexed keywords

APPROXIMATION ALGORITHMS; MACHINE COMPLETION TIME; PARALLEL MACHINES; POLYNOMIAL TIME APPROXIMATION SCHEME;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

APPROXIMATION THEORY;

EID: 21044439058     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-003-1077-7     Document Type: Article

References (16)

1. N. Alon, Y. Azar, G. J. Woeginger, and T. Yadid. Approximation schemes for scheduling on parallel machines. J. Scheduling, 1:55-66, 1998.
2. Y. Azar and L. Epstein. Approximation schemes for covering and scheduling on related machines. In Proc. of the 1st Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX '98), pages 39-47. Lecture Notes in Computer Science 1444. Springer-Verlag, Berlin, 1998.
3. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stougie. Multiprocessor scheduling with rejection. SIAM J. Discrete Math., 13(1):64-78, 2000.
4. A. K. Chandra and C. K. Wong. Worst-case analysis of a placement algorithm related to storage allocation. SIAM J. Comput., 4:249-263, 1975.
5. R. A. Cody and E. G. Coffman. Record allocation for minimizing expected retrieval costs on drum-like storage devices. J. Assoc. Comput. Mach., 23:103-115, 1976.
6. J. Csirik, H. Kellerer, and G. J. Woeginger. The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett., 11:281-287, 1992.
7. L. Epstein and J. Sgall. Approximation schemes for scheduling on uniformly related and identical parallel machines. In Proc. of the 7th Ann. European Symp. on Algorithms, pages 151-162. Lecture Notes in Computer Science 1643. Springer-Verlag, Berlin, 1999.
8. D. K. Friesen and B. L. Deuermeyer. Analysis of greedy solutions for a replacement part sequencing problem. Math. Opera. Res., 6:74-87, 1981.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, CA, 1979.
10. R. L. Graham. Bounds for certain multiprocessor anomalies. Bell System Tech. J., 45:1563-1581, Nov. 1966.
11. R.- L.Graham. Bounds on multiprocessor timing anomalies. SIAM J. Appl. Math., 17(2):416-429, 1969.
12. D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. Assoc. Comput. Mach., 34:144-162, 1987.
13. D. S. Hochbaum and D. B. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM J. Comput., 17:539-551, 1988.
14. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: algorithms and complexity. In S. C. Graves, A. H. G. Rinnooy Kan, and P. Zipkin, editors. Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, pages 445-552. North-Holland, Amsterdam, 1993.
15. S. Sahni. Algorithms for scheduling independent tasks. J. Assoc. Comput. Mach., 23:116-127, 1976.
16. G. J. Woeginger. A polynomial time approximation scheme for maximizing the minimum machine completion time. Oper. Res. Lett., 20:149-154, 1997.