A NOTE ON HIERARCHICAL MINIMIZATION OF FLOWTIMES ON PARALLEL-MACHINES
作者:
T. C. E. CHENG,
J. E. DIAMOND,
期刊:
IIE Transactions
(Taylor Available online 1994)
卷期:
Volume 26,
issue 2
页码: 109-111
ISSN:0740-817X
年代: 1994
DOI:10.1080/07408179408966602
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
We consider a hierarchical multiple criteria scheduling problem on parallel-machines. The jobs are divided intoppriority classes and the total flowtime of die class with thek-th highest priority is thek-th highest objective criterion. We show that the optimal schedule can be constructed by a generalized shortest processing time (SPT) rule.
点击下载:
PDF (316KB)
返 回