Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 1999: Algorithms - ESA’ 99 pp 151–162Cite as

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1643))

Abstract

We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the machine completion times, including minimizing the l p norm of the vector of completion times. This generalizes and simplifies many previous results in this area.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon, Y. Azar, G. J. Woeginger, and T. Yadid. Approximation schemes for scheduling. In Proc. of the 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 493–500.ACM-SIAM, 1997.

    Google Scholar 

  2. N. Alon, Y. Azar, G. J. Woeginger, and T. Yadid. Approximation schemes for scheduling on parallel machines. J. of Scheduling, 1:55–66, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  3. 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), Lecture Notes in Comput. Sci. 1444, pages 39–47. Springer-Verlag, 1998.

    Google Scholar 

  4. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stougie. Multiprocessor scheduling with rejection. In Proc. of the 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 95–103. ACM-SIAM, 1996.

    Google Scholar 

  5. 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.

    Article  MATH  MathSciNet  Google Scholar 

  6. 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.

    MATH  MathSciNet  Google Scholar 

  7. 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.

    Article  MATH  MathSciNet  Google Scholar 

  8. D. K. Friesen and B. L. Deuermeyer. Analysis of greedy solutions for a replacement part sequencing problem. Mathematics of Operations Research, 6:74–87, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.

    Google Scholar 

  10. R. L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical J., 45:1563–1581, Nov. 1966.

    Google Scholar 

  11. R. L. Graham. Bounds on multiprocessor timing anomalies. SIAM J. Appl. Math., 17(2):416–429, 1969.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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, 1993.

    Google Scholar 

  15. S. Sahni. Algorithms for scheduling independent tasks. J. Assoc. Comput. Mach., 23:116–127, 1976.

    MATH  MathSciNet  Google Scholar 

  16. G. J. Woeginger. A polynomial time approximation scheme for maximizing the minimum machine completion time. Oper. Res. Lett., 20:149–154, 1997.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Tel-Aviv University, Israel

    Leah Epstein

  2. Mathematical Inst., AS CR, Žitná 25, CZ-11567, Praha 1, Czech Republic

    Jiří Sgall

  3. Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Praha

    Jiří Sgall

Authors
  1. Leah Epstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiří Sgall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics and DIMATIA Centre, Charles University, Malostranská nám. 25, CZ-11800, Prague 1, Czech Republic

    Jaroslav Nešetřil

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Epstein, L., Sgall, J. (1999). Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-48481-7_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66251-8

  • Online ISBN: 978-3-540-48481-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation