Skip to main content
Article thumbnail
Location of Repository

Approximation schemes for scheduling on parallel machines

By Noga Alon, Yossi Azar, Gerhard J. Woeginger and Tal Yadid

Abstract

We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depend on the machine completion times. As a main result, we identify some conditions on the objective function, under which the resulting scheduling problems possess a polynomial time approximation scheme. Our result contains, generalizes, improves, simplifies, and unifies many other results in this area in a natural way

Topics: Scheduling theory, approximation algorithm, approximation scheme, worst case
Year: 1998
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.6361
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.tau.ac.il/~nogaa... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.