MINIMIZING THE EXPECTED MAKESPAN IN STOCHASTIC FLOW SHOPS

被引:77
作者
PINEDO, M
机构
关键词
D O I
10.1287/opre.30.1.148
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:148 / 162
页数:15
相关论文
共 14 条
[11]  
PINEDO ML, 1981, JAN P C APPL PROB CO
[12]   FLOW-SHOP SEQUENCING PROBLEM WITH NO WAIT IN PROCESS [J].
REDDI, SS ;
RAMAMOORTHY, CV .
OPERATIONAL RESEARCH QUARTERLY, 1972, 23 (03) :323-+
[13]   OPTIMAL ORDER OF SERVICE IN TANDEM QUEUES [J].
TEMBE, SV ;
WOLFF, RW .
OPERATIONS RESEARCH, 1974, 22 (04) :824-832
[14]   INTERCHANGEABILITY OF [M]1 QUEUES IN SERIES [J].
WEBER, RR .
JOURNAL OF APPLIED PROBABILITY, 1979, 16 (03) :690-695