Parallel-machine scheduling with controllable processing times

T. C.E. Cheng; Z. L. Chen; Chung-Lun Li

doi:10.1080/07408179608966263

Parallel-machine scheduling with controllable processing times

T. C.E. Cheng
, Z. L. Chen
, Chung-Lun Li

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

42 Citations (Scopus)

Abstract

We consider a problem of scheduling nindependent and simultaneously available jobs on munrelated 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 inO (n<sup>3</sup>m + n<sup>2</sup>m log(nm))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. © 1996 Taylor & Francis Group, LLC.

Original language	English
Pages (from-to)	177-180
Journal	IIE Transactions (Institute of Industrial Engineers)
Volume	28
Issue number	2
DOIs	https://doi.org/10.1080/07408179608966263
Publication status	Published - Feb 1996
Externally published	Yes

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Access Output

10.1080/07408179608966263

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{aeae37bec9644044bd021704d685a4c8,

title = "Parallel-machine scheduling with controllable processing times",

abstract = "We consider a problem of scheduling nindependent and simultaneously available jobs on munrelated 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 inO (n3m + n2m log(nm))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. {\textcopyright} 1996 Taylor \& Francis Group, LLC.",

author = "Cheng, \{T. C.E.\} and Chen, \{Z. L.\} and Chung-Lun Li",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].",

year = "1996",

month = feb,

doi = "10.1080/07408179608966263",

language = "English",

volume = "28",

pages = "177--180",

journal = "IIE Transactions (Institute of Industrial Engineers)",

issn = "0740-817X",

publisher = "Taylor \& Francis",

number = "2",

}

TY - JOUR

T1 - Parallel-machine scheduling with controllable processing times

AU - Cheng, T. C.E.

AU - Chen, Z. L.

AU - Li, Chung-Lun

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 1996/2

Y1 - 1996/2

N2 - We consider a problem of scheduling nindependent and simultaneously available jobs on munrelated 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 inO (n3m + n2m log(nm))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. © 1996 Taylor & Francis Group, LLC.

AB - We consider a problem of scheduling nindependent and simultaneously available jobs on munrelated 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 inO (n3m + n2m log(nm))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. © 1996 Taylor & Francis Group, LLC.

UR - https://www.scopus.com/pages/publications/0030081776

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0030081776&origin=recordpage

U2 - 10.1080/07408179608966263

DO - 10.1080/07408179608966263

M3 - RGC 21 - Publication in refereed journal

SN - 0740-817X

VL - 28

SP - 177

EP - 180

JO - IIE Transactions (Institute of Industrial Engineers)

JF - IIE Transactions (Institute of Industrial Engineers)

IS - 2

ER -

Parallel-machine scheduling with controllable processing times

Abstract

Bibliographical note

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this