Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32013
Title: Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time
Authors: Wang, LY
Huang, X
Ji, P 
Feng, EM
Keywords: Maintenance activity
Scheduling
Total completion time
Unrelated parallel-machine
Issue Date: 2012
Publisher: Springer
Source: Optimization letters, 2012, p. 1-6 How to cite?
Journal: Optimization letters 
Abstract: Wang et al. (J Operat Res Soc 62: 1898-1902, 2011) studied the m identical parallel-machine and unrelated parallel-machine scheduling with a deteriorating maintenance activity to minimize the total completion time. They showed that each problem can be solved in O(n 2 m+3) time, where n is the number of jobs. In this note, we discuss the unrelated parallel-machine setting and show that the problem can be optimally solved by a lower order algorithm.
URI: http://hdl.handle.net/10397/32013
ISSN: 1862-4472
EISSN: 1862-4480
DOI: 10.1007/s11590-012-0472-x
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

8
Last Week
0
Last month
0
Citations as of Aug 11, 2017

WEB OF SCIENCETM
Citations

8
Last Week
0
Last month
0
Citations as of Aug 12, 2017

Page view(s)

42
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



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