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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Applied Mathematics Ročník 161; číslo 13-14; s. 2205 - 2206
Hlavní autori:	Kianfar, K., Moslehi, G.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.09.2013
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!