Approximation schemes for scheduling on uniformly related and identical parallel machines

Leah Epstein; Jiri Sgall

doi:10.1007/s00453-003-1077-7

Approximation schemes for scheduling on uniformly related and identical parallel machines

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	43-57
Number of pages	15
Journal	Algorithmica
Volume	39
Issue number	1
DOIs	https://doi.org/10.1007/s00453-003-1077-7
State	Published - Jan 2004
Externally published	Yes

Keywords

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

ASJC Scopus subject areas

General Computer Science
Computer Science Applications
Applied Mathematics

Access to Document

10.1007/s00453-003-1077-7

Cite this

@article{198cef1793884872af0926e17839991d,

title = "Approximation schemes for scheduling on uniformly related and identical parallel machines",

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

keywords = "Approximation algorithms, Machine completion time, Parallel machines, Polynomial time approximation scheme, Scheduling",

author = "Leah Epstein and Jiri Sgall",

year = "2004",

month = jan,

doi = "10.1007/s00453-003-1077-7",

language = "English",

volume = "39",

pages = "43--57",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Approximation schemes for scheduling on uniformly related and identical parallel machines

AU - Epstein, Leah

AU - Sgall, Jiri

PY - 2004/1

Y1 - 2004/1

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

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

KW - Approximation algorithms

KW - Machine completion time

KW - Parallel machines

KW - Polynomial time approximation scheme

KW - Scheduling

UR - https://www.scopus.com/pages/publications/21044439058

U2 - 10.1007/s00453-003-1077-7

DO - 10.1007/s00453-003-1077-7

M3 - Article

AN - SCOPUS:21044439058

SN - 0178-4617

VL - 39

SP - 43

EP - 57

JO - Algorithmica

JF - Algorithmica

IS - 1

ER -

Approximation schemes for scheduling on uniformly related and identical parallel machines

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this