Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/25535
Title: Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time
Authors: Hsu, CJ
Cheng, TCE 
Yang, DL
Keywords: Rate-modifying activity
Scheduling
Total completion time
Unrelated parallel machines
Issue Date: 2011
Publisher: Elsevier
Source: Information sciences, 2011, v. 181, no. 20, p. 4799-4803 How to cite?
Journal: Information sciences 
Abstract: Zhao et al. (2009) [24] study the m identical parallel-machine scheduling problem with rate-modifying activities to minimize the total completion time. They show that the problem can be solved in O(n2m+3) time. In this study we extend the scheduling environment to the unrelated parallel-machine setting and present a more efficient algorithm to solve the extended problem. For the cases where the rate-modifying rate is (i) larger than 0 and not larger than 1, and (ii) larger than 0, we show that the problem can be solved in O(nm+3) and O(n2m+2) time, respectively.
URI: http://hdl.handle.net/10397/25535
ISSN: 0020-0255
EISSN: 1872-6291
DOI: 10.1016/j.ins.2011.06.010
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

31
Last Week
0
Last month
0
Citations as of Aug 10, 2017

WEB OF SCIENCETM
Citations

28
Last Week
0
Last month
0
Citations as of Aug 16, 2017

Page view(s)

45
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.