STOCHASTIC MINIMIZATION OF THE MAKESPAN IN FLOW SHOPS WITH IDENTICAL MACHINES AND BUFFERS OF ARBITRARY SIZE

被引：5

作者：

KIJIMA, M ^{[1
]}

MAKIMOTO, N ^{[1
]}

SHIRAKAWA, H ^{[1
]}

机构：

[1] TOKYO INST TECHNOL,DEPT INFORMAT SCI,TOKYO 152,JAPAN

来源：

OPERATIONS RESEARCH | 1990年 / 38卷 / 05期

关键词：

D O I：

10.1287/opre.38.5.924

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Stochastic permutation flow shops of m identical machines and n jobs are considered. There exist buffers of arbitrary size between two consecutive machines. For particular types of job processing times, we present optimal schedules which minimize the makespan in the stochastic sense. Moreover, it will be shown that the optimal schedules are closely related to those of the no buffer case. Finally, our results are recaptured in the context of tandem queues.

引用

页码：924 / 928

页数：5

共 5 条

[1] SCHEDULING N NONOVERLAPPING JOBS AND 2 STOCHASTIC JOBS IN A FLOWSHOP [J].