A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs

In this paper we study the NP-hard problem of scheduling n deteriorating jobs on m identical parallel machines to minimize the makespan. Each job's processing time is a linear nondecreasing function of its start time. We present a fully polynomial-time approximation scheme for the problem, thus...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production economics Jg. 109; H. 1; S. 180 - 184
Hauptverfasser: Kang, Liying, Ng, C.T.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.09.2007
Elsevier
Elsevier Sequoia S.A
Schriftenreihe:International Journal of Production Economics
Schlagworte:
Approximation
Deteriorating jobs
Fully polynomial-time approximation scheme
Job shops
Parallel-machine scheduling
Production scheduling
Studies
Fully polynomial-time approximation scheme
Deteriorating jobs
Parallel-machine scheduling
ISSN:0925-5273, 1873-7579
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we study the NP-hard problem of scheduling n deteriorating jobs on m identical parallel machines to minimize the makespan. Each job's processing time is a linear nondecreasing function of its start time. We present a fully polynomial-time approximation scheme for the problem, thus establishing that the problem is NP-hard in the ordinary sense only.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0925-5273
1873-7579
DOI:10.1016/j.ijpe.2006.11.014