Skip to main content
SpringerLink
Log in

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

  • Published:
Algorithmica Aims and scope Submit manuscript

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 lp 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 to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Computer Science, The Interdisciplinary Center, Herzliya, Israel

    Leah Epstein\thanks{School of Computer Science, The Interdisciplinary Center, Herzliya, Israel. lea@idc.ac.il.

  2. Mathematical Institute, AS CR, Zitná 25, CZ-11567 Praha 1, Czech Republic

    Jiri Sgall

Authors
  1. Leah Epstein\thanks{School of Computer Science, The Interdisciplinary Center, Herzliya, Israel. lea@idc.ac.il.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiri Sgall
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Leah Epstein\thanks{School of Computer Science, The Interdisciplinary Center, Herzliya, Israel. lea@idc.ac.il. or Jiri Sgall.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Epstein\thanks{School of Computer Science, The Interdisciplinary Center, Herzliya, Israel. lea@idc.ac.il., L., Sgall, J. Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. Algorithmica 39, 43–57 (2004). https://doi.org/10.1007/s00453-003-1077-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-003-1077-7

Search

Navigation