Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24651
Title: Unrelated parallel-machine scheduling with deteriorating maintenance activities
Authors: Cheng, TCE 
Hsu, CJ
Yang, DL
Keywords: Assignment problem
Deteriorating maintenance activity
Scheduling
Total completion time
Total machine load
Issue Date: 2011
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2011, v. 60, no. 4, p. 602-605 How to cite?
Journal: Computers and industrial engineering 
Abstract: We study the problem of unrelated parallel-machine scheduling with deteriorating maintenance activities. Each machine has at most one maintenance activity, which can be performed at any time throughout the planning horizon. The length of the maintenance activity increases linearly with its starting time. The objective is to minimize the total completion time or the total machine load. We show that both versions of the problem can be optimally solved in polynomial time.
URI: http://hdl.handle.net/10397/24651
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2010.12.017
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

36
Last Week
0
Last month
0
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

32
Last Week
0
Last month
0
Citations as of Aug 13, 2017

Page view(s)

46
Last Week
4
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.