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

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 161; no. 13-14; pp. 2205 - 2206
Main Authors: Kianfar, K., Moslehi, G.
Format: Journal Article
Language:English
Published: Elsevier B.V 01.09.2013
Subjects:
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 Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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