TIME COMPLETION FOR VARIOUS DISPATCHING RULES IN JOB SHOPS

被引：25

作者：

ELVERS, DA ^{[1
]}

TAUBE, LR ^{[1
]}

机构：

[1] BOWLING GREEN STATE UNIV,BOWLING GREEN,OH 43403

来源：

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 1983年 / 11卷 / 01期

关键词：

D O I：

10.1016/0305-0483(83)90087-7

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：81 / 89

页数：9

共 22 条

[1] SIMULATION OF A SIMPLIFIED JOB SHOP [J].

BAKER, CT ;

DZIELINSKI, BP .

[2]

Baker K., 1974, INTRO SEQUENCING SCH

[3]

Carroll D. C, 1965, THESIS MASSACHUSETTS

[4]

Conway R, 1967, THEORY SCHEDULING

[5]

CONWAY RW, 1965, J IND ENGINEERING, V16, P228

[6] NETWORK DISPATCHING BY THE SHORTEST-OPERATION DISCIPLINE [J].

CONWAY, RW ;

MAXWELL, WL .

[7]

CONWAY RW, 1965, J IND ENGINEERING, V16, P123

[8]

Eilon S., 1976, International Journal of Production Research, V14, P223, DOI 10.1080/00207547608956596

[9]

Eilon S, 1967, INT J PROD RES, V6, P1

[10]

Elvers D. A., 1974, AIIE T, V6, P41