![](/images/graphics-bg.png)
A Note on a Fully Polynomial-Time Approximation Scheme for Minimizing Makespan of Deteriorating Jobs
Author
Source
Mathematical Problems in Engineering
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-09-11
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Wan, Long. 2013. A Note on a Fully Polynomial-Time Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. Mathematical Problems in Engineering،Vol. 2013, no. 2013, pp.1-7.
https://search.emarefa.net/detail/BIM-1011298
Modern Language Association (MLA)
Wan, Long. A Note on a Fully Polynomial-Time Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. Mathematical Problems in Engineering No. 2013 (2013), pp.1-7.
https://search.emarefa.net/detail/BIM-1011298
American Medical Association (AMA)
Wan, Long. A Note on a Fully Polynomial-Time Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. Mathematical Problems in Engineering. 2013. Vol. 2013, no. 2013, pp.1-7.
https://search.emarefa.net/detail/BIM-1011298
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1011298