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 条
[1]   A SEQUENCE OF SERVICE STATIONS WITH ARBITRARY INPUT AND REGULAR SERVICE TIMES [J].
AVIITZHAK, B .
MANAGEMENT SCIENCE, 1965, 11 (05) :565-571
[2]  
Bagga P.C., 1970, OPSEARCH, V7, P184
[3]  
DATTATREYA ES, 1978, THESIS U CALIFORNIA
[4]   ANALYSIS OF APPROXIMATIONS FOR FINDING A MAXIMUM WEIGHT HAMILTONIAN CIRCUIT [J].
FISHER, ML ;
NEMHAUSER, GL ;
WOLSEY, LA .
OPERATIONS RESEARCH, 1979, 27 (04) :799-809
[5]  
Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117
[6]   SEQUENCING 1 STATE-VARIABLE MACHINE - SOLVABLE CASE OF TRAVELING SALESMAN PROBLEM [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1964, 12 (05) :655-&
[7]  
Johnson S. M., 1954, NAV RES LOGIST Q, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]
[8]  
Lenstra J.K., 1977, ANN DISCRETE MATH, V4, P281
[9]  
Levner E.V., 1969, AUTOMAT REM CONTR+, V12, P1972
[10]   REVERSIBILITY PROPERTY OF PRODUCTION LINES [J].
MUTH, EJ .
MANAGEMENT SCIENCE, 1979, 25 (02) :152-158