A note on “Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date”

In this note, through a counter-example we show that the results in a recent paper (Kacem, 2010)  [1] are incorrect. Since the proposed dynamic programming in Kacem (2010)  [1] fails to optimally solve the problem in some instances, the designed FPTAS with O(n2/ε) complexity is wrong. Then, we provi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics Jg. 161; H. 13-14; S. 2205 - 2206
Hauptverfasser: Kianfar, K., Moslehi, G.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.09.2013
Schlagworte:
Approximation
Common due date
Complexity
Due dates
Dynamic programming
FPTAS
Mathematical analysis
Minimization
Optimization
Polynomials
Scheduling
Tardiness
Scheduling
Approximation
Common due date
FPTAS
Tardiness
ISSN:0166-218X, 1872-6771
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this note, through a counter-example we show that the results in a recent paper (Kacem, 2010)  [1] are incorrect. Since the proposed dynamic programming in Kacem (2010)  [1] fails to optimally solve the problem in some instances, the designed FPTAS with O(n2/ε) complexity is wrong. Then, we provide a modified FPTAS of O(n3/ε) time complexity for the considered problem.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2013.02.026