Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19934
Title: Parallel-machine scheduling with controllable processing times
Authors: Cheng, TCE 
Chen, ZL
Li, CL 
Issue Date: 1996
Publisher: Taylor & Francis
Source: IIE transactions, 1996, v. 28, no. 2, p. 177-180 How to cite?
Journal: IIE transactions 
Abstract: We consider a problem of scheduling n independent and simultaneously available jobs on m unrelated parallel machines. The job processing times can be compressed through incurring an additional cost, which is a convex function of the amount of compression. Two problems are formulated as assignment problems, which can be solved in O (n3in + irm log(w)i)) time. One is to minimize the total compression cost plus the total flow time. The other is to minimize the total compression cost plus the sum of earliness and tardiness costs.
URI: http://hdl.handle.net/10397/19934
ISSN: 0740-817X
EISSN: 1545-8830
DOI: 10.1080/07408179608966263
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

37
Last Week
0
Last month
1
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

32
Last Week
0
Last month
0
Citations as of Jul 28, 2017

Page view(s)

46
Last Week
0
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



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