Parallel-machine scheduling with controllable processing times

Edwin Tai Chiu Cheng; Z. L. Chen; Chung Lun Li

doi:10.1080/07408179608966263

Parallel-machine scheduling with controllable processing times

Edwin Tai Chiu Cheng, Z. L. Chen, Chung Lun Li

Research output: Journal article publication › Journal article › Academic research › peer-review

41 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 (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.

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

ASJC Scopus subject areas

Industrial and Manufacturing Engineering

More information

10.1080/07408179608966263

Cite this

@article{1c36b26ec68643f2912f11e8b4a9f539,

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.",

author = "Cheng, {Edwin Tai Chiu} and Chen, {Z. L.} and Li, {Chung Lun}",

year = "1996",

month = jan,

day = "1",

doi = "10.1080/07408179608966263",

language = "English",

volume = "28",

pages = "177--180",

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

issn = "0740-817X",

publisher = "Taylor and Francis Ltd.",

number = "2",

}

TY - JOUR

T1 - Parallel-machine scheduling with controllable processing times

AU - Cheng, Edwin Tai Chiu

AU - Chen, Z. L.

AU - Li, Chung Lun

PY - 1996/1/1

Y1 - 1996/1/1

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.

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.

UR - http://www.scopus.com/inward/record.url?scp=0030081776&partnerID=8YFLogxK

U2 - 10.1080/07408179608966263

DO - 10.1080/07408179608966263

M3 - Journal article

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

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this