Scheduling in stochastic flowshops with independent setup, processing and removal times

被引：26

作者：

Allahverdi, A

机构：

[1] Dept. of Mech. and Indust. Eng., College of Engineering and Petroleum, Kuwait University, Safat, 13060

[2] Industrial Engineering Department, Marmara University, Istanbul

来源：

COMPUTERS & OPERATIONS RESEARCH | 1997年 / 24卷 / 10期

关键词：

D O I：

10.1016/S0305-0548(97)00006-3

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The two-machine flowshop problem, where setup and removal times are independent from processing times and machines suffer stochastic breakdowns, is considered with respect to makespan performance measure. After the problem is formulated, an objective function for the makespan is developed. Under certain conditions on the breakdown processes, it is shown that Sule and Huang's [5] algorithm for the deterministic problem stochastically minimizes makespan for the stochastic counterpart problem. (C) 1997 Elsevier Science Ltd.

引用

页码：955 / 960

页数：6

共 15 条

[1] Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness [J].