Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/25943
Title: Parallel-machine scheduling with controllable processing times and rate-modifying activities to minimise total cost involving total completion time and job compressions
Authors: Yang, DL
Cheng, TCE 
Yang, SJ
Keywords: Controllable processing time
Rate-modifying activity
Scheduling
Unrelated parallel-machine
Issue Date: 2014
Publisher: Taylor & Francis
Source: International journal of production research, 2014, v. 52, no. 4, p. 1133-1141 How to cite?
Journal: International journal of production research 
Abstract: In this paper, we consider unrelated parallel-machine scheduling involving controllable processing times and rate-modifying activities simultaneously. We assume that the actual processing time of a job can be compressed by allocating a greater amount of a common resource to process the job. We further assume that each machine may require a rate-modifying activity during the scheduling horizon. The objective is to determine the optimal job compressions, the optimal positions of the rate-modifying activities and the optimal schedule to minimise a total cost function that depends on the total completion time and total job compressions. If the number of machines is a given constant, we propose an efficient polynomial time algorithm to solve the problem.
URI: http://hdl.handle.net/10397/25943
ISSN: 0020-7543
EISSN: 1366-588X
DOI: 10.1080/00207543.2013.841330
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

17
Last Week
0
Last month
0
Citations as of Sep 23, 2017

WEB OF SCIENCETM
Citations

14
Last Week
0
Last month
0
Citations as of Sep 23, 2017

Page view(s)

60
Last Week
2
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



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