Abstract
In this paper, we re-visit the problem of scheduling a set of proportional deteriorating non-resumable jobs on a single machine subject to maintenance. The maintenance has to be started prior to a given deadline. The jobs as well as the maintenance are to be scheduled so that to minimize the total completion time. For this problem we propose a new dynamic programming algorithm and a faster fully polynomial time approximation scheme improving a recent result by Luo and Chen [JIMO (2012), 8:2, 271-283].
| Original language | English |
|---|---|
| Pages (from-to) | 811-817 |
| Number of pages | 7 |
| Journal | Journal of Industrial and Management Optimization |
| Volume | 12 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2016 |
| Externally published | Yes |
Bibliographical note
Funding Information:The research of the second author was supported in part by the National Natural Science Foundation of China under grant 71101016.
Funding
The research of the second author was supported in part by the National Natural Science Foundation of China under grant 71101016.
| Funders | Funder number |
|---|---|
| National Natural Science Foundation of China | 71101016 |
Keywords
- Approximation scheme
- Deteriorating jobs
- Maintenance activities
- Scheduling
- Total completion time
Fingerprint
Dive into the research topics of 'An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver