Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/62378
Title: Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work
Authors: Yin, Y
Xu, J
Cheng, TCE 
Wu, CC
Wang, DJ
Keywords: Scheduling
Late work
Fully polynomial-time approximation scheme
Issue Date: 2016
Publisher: John Wiley & Sons
Source: Naval research logistics, 2016, v. 63, no. 2, p. 172-183 How to cite?
Journal: Naval research logistics 
Abstract: 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.
URI: http://hdl.handle.net/10397/62378
ISSN: 0894-069X
EISSN: 1520-6750
DOI: 10.1002/nav.21684
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

12
Last Week
1
Last month
Citations as of Dec 6, 2017

WEB OF SCIENCETM
Citations

10
Last Week
0
Last month
Citations as of Dec 10, 2017

Page view(s)

58
Last Week
1
Last month
Checked on Dec 11, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.