Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Naval research logistics Ročník 63; číslo 2; s. 172 - 183
Hlavní autoři: Yin, Yunqiang, Xu, Jianyou, Cheng, T. C. E., Wu, Chin-Chia, Wang, Du-Juan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Blackwell Publishing Ltd 01.03.2016
Wiley Subscription Services, Inc
Témata:
Algorithms
Approximation
fully polynomial-time approximation scheme
late work
Logistics
Maintenance
Mathematical analysis
Naval
Optimization
Scheduling
ISSN:0894-069X, 1520-6750
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016
Bibliografie:ark:/67375/WNG-BVWQ37XF-D
ArticleID:NAV21684
istex:1859C1A093162FF35AE4F2E54019500611A11DF5
National Natural Science Foundation of China under grant numbers 11561036 and 71301022; and in part by the Ministry of Science Technology (MOST) of Taiwan under grant numbers NSC 102-2221-E-035-070-MY3 and MOST 103-2410-H-035-022-MY2. Cheng was supported in part by The Hong Kong Polytechnic University under the Fung Yiu King-Wing Hang Bank Endowed Professorship in Business Administration
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0894-069X
1520-6750
DOI:10.1002/nav.21684