A NOTE ON HIERARCHICAL MINIMIZATION OF FLOWTIMES ON PARALLEL-MACHINES

被引：1

作者：

CHENG, TCE ^{[1
]}

DIAMOND, JE ^{[1
]}

机构：

[1] UNIV MANITOBA,DEPT ACTUARIAL & MANAGEMENT SCI,WINNIPEG R3T 2N2,MANITOBA,CANADA

来源：

IIE TRANSACTIONS | 1994年 / 26卷 / 02期

关键词：

D O I：

10.1080/07408179408966602

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

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 k-th highest priority is the k-th highest objective criterion. We show that the optimal schedule can be constructed by a generalized shortest processing time (SPT) rule.

引用

页码：109 / 111

页数：3

共 6 条

[1]

Conway RW., 1967, THEORY SCHEDULING

[2] BICRITERION STATIC SCHEDULING RESEARCH FOR A SINGLE-MACHINE [J].

DILEEPAN, P ;

SEN, T .

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1988, 16 (01) :53-59

[3] ONE MACHINE SEQUENCING TO MINIMIZE MEAN FLOW TIME WITH MINIMUM NUMBER TARDY [J].

EMMONS, H .

NAVAL RESEARCH LOGISTICS, 1975, 22 (03) :585-592

[4]

EMMONS H, 1987, NAV RES LOG, V34, P803, DOI 10.1002/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO

[5]

2-2

[6]

Smith W., 1956, NAV RES LOGIST Q, V3, P59, DOI [https://doi.org/10.1002/nav.3800030106, DOI 10.1002/NAV.3800030106]

← 1 →