Skip to main content
SpringerLink
Log in

Minimum Makespan on Unrelated Machines

1990; Lenstra, Shmoys, Tardos

  • Reference work entry
Book cover Encyclopedia of Algorithms

  • 411 Accesses

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

Access this chapter

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 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Jeng-Fung, C.: Unrelated parallel machine scheduling with secondary resource constraints. Int. J. Adv. Manuf. Technol. 26, 285–292 (2005)

    Article  Google Scholar 

  2. Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM 53(3), 324–360 (2006)

    Article  MathSciNet  Google Scholar 

  3. Grigoriev, A., Sviridenko, M., Uetz, M.: Machine scheduling with resource dependent processing times. Math. Program. 110(1B), 209–228 (2002)

    MathSciNet  Google Scholar 

  4. Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. Assoc. Comput. Mach. 34(1), 144–162 (1987)

    Article  MathSciNet  Google Scholar 

  5. Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM J. Comput. 17(3), 539–551 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  6. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and Scheduling: Algorithms and Complexity. In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H. (eds.) Logistics of Production and Inventory. Handbooks in Operations Research and Management Science, vol. 4, pp. 445–522. North–Holland, Amsterdam (1993)

    Chapter  Google Scholar 

  7. Lenstra, J.K., Shmoys, D., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(3A), 259–271 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  8. Shmoys, D., Tardos, E.: An approximation algorithm for the generalized assignment problem. Math. Program. 62(3A), 461–474 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  9. Yu, L., Shih, H., Pfund, M., Carlyle, W., Fowler, J.: Scheduling of unrelated parallel machines: an application to PWB manufacturing. IIE Trans. 34, 921–931 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research, IBM, Yorktown Heights, NY, USA

    Maxim Sviridenko

Authors
  1. Maxim Sviridenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Sviridenko, M. (2008). Minimum Makespan on Unrelated Machines. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_238

Download citation

Publish with us

Policies and ethics

Search

Navigation