A note on hierarchical minimization of flowtimes on parallel-machines

Edwin Tai Chiu Cheng; J. E. Diamond

doi:10.1080/07408179408966602

A note on hierarchical minimization of flowtimes on parallel-machines

Edwin Tai Chiu Cheng, J. E. Diamond

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

1 Citation (Scopus)

Abstract

We consider a hierarchical multiple criteria scheduling problem on parallel-machines. The jobs are divided into p priority classes and the total flowtime of the class with the Jfc-th highest priority is the fc-th highest objective criterion. We show that the optimal schedule can be constructed by a generalized shortest processing time (SPT) rule.

Original language	English
Pages (from-to)	109-111
Number of pages	3
Journal	IIE Transactions (Institute of Industrial Engineers)
Volume	26
Issue number	2
DOIs	https://doi.org/10.1080/07408179408966602
Publication status	Published - 1 Jan 1994

ASJC Scopus subject areas

Industrial and Manufacturing Engineering

More information

10.1080/07408179408966602

Cite this

@article{e3f754e747754ebf99bf8e7596956ad3,

title = "A note on hierarchical minimization of flowtimes on parallel-machines",

abstract = "We consider a hierarchical multiple criteria scheduling problem on parallel-machines. The jobs are divided into p priority classes and the total flowtime of the class with the Jfc-th highest priority is the fc-th highest objective criterion. We show that the optimal schedule can be constructed by a generalized shortest processing time (SPT) rule.",

author = "Cheng, {Edwin Tai Chiu} and Diamond, {J. E.}",

year = "1994",

month = jan,

day = "1",

doi = "10.1080/07408179408966602",

language = "English",

volume = "26",

pages = "109--111",

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

issn = "0740-817X",

publisher = "Taylor and Francis Ltd.",

number = "2",

}

TY - JOUR

T1 - A note on hierarchical minimization of flowtimes on parallel-machines

AU - Cheng, Edwin Tai Chiu

AU - Diamond, J. E.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - We consider a hierarchical multiple criteria scheduling problem on parallel-machines. The jobs are divided into p priority classes and the total flowtime of the class with the Jfc-th highest priority is the fc-th highest objective criterion. We show that the optimal schedule can be constructed by a generalized shortest processing time (SPT) rule.

AB - We consider a hierarchical multiple criteria scheduling problem on parallel-machines. The jobs are divided into p priority classes and the total flowtime of the class with the Jfc-th highest priority is the fc-th highest objective criterion. We show that the optimal schedule can be constructed by a generalized shortest processing time (SPT) rule.

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

U2 - 10.1080/07408179408966602

DO - 10.1080/07408179408966602

M3 - Journal article

SN - 0740-817X

VL - 26

SP - 109

EP - 111

JO - IIE Transactions (Institute of Industrial Engineers)

JF - IIE Transactions (Institute of Industrial Engineers)

IS - 2

ER -

A note on hierarchical minimization of flowtimes on parallel-machines

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this