A Note on a Fully Polynomial-Time Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

In (1998), Kovalyov and Kubiak studied the problem of scheduling n deteriorating jobs on a single machine to minimize makespan. They presented a fully polynomial-time approximation scheme which is based on a dynamic programming. Unfortunately, their dynamic programming is incorrect. So the fully pol...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Mathematical problems in engineering Ročník 2013; číslo 2013; s. 1 - 7
Hlavný autor: Wan, Long
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Cairo, Egypt Hindawi Publishing Corporation 01.01.2013
John Wiley & Sons, Inc
Predmet:
Approximation
Construction
Deterioration
Dynamic programming
Job shops
Mathematical analysis
Mathematical problems
Polynomials
Production scheduling
Scheduling
ISSN:1024-123X, 1563-5147
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In (1998), Kovalyov and Kubiak studied the problem of scheduling n deteriorating jobs on a single machine to minimize makespan. They presented a fully polynomial-time approximation scheme which is based on a dynamic programming. Unfortunately, their dynamic programming is incorrect. So the fully polynomial-time approximation scheme is also invalid. In this paper, we construct an instance to show how their dynamic programming does not work and provide a correct dynamic programming, based on which a new fully polynomial-time approximation scheme is derived.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1024-123X
1563-5147
DOI:10.1155/2013/957494