ANALYSIS OF A COMBINATORIAL APPROACH TO FLOWSHOP SCHEDULING PROBLEMS

被引:5
作者
GUPTA, JND [1 ]
机构
[1] US POSTAL SERV,WASHINGTON,DC 20000
关键词
D O I
10.2307/3007753
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:431 / 440
页数:10
相关论文
共 11 条
[1]  
BAKER KR, 1973, IE732 N CAR STAT U T
[2]  
Gupta Jatinder N. D., 1971, AIIE T, V3, P199
[3]   IMPROVED COMBINATORIAL ALGORITHM FOR FLOWSHOP-SCHEDULING PROBLEM [J].
GUPTA, JND .
OPERATIONS RESEARCH, 1971, 19 (07) :1753-&
[4]  
GUPTA JND, 1975, NAV RES LOGIST Q, V22
[5]  
GUPTA JND, 1972, AIIE T, V4, P238
[6]  
Johnson S. M., 1954, NAV RES LOGIST Q, V1, P61, DOI DOI 10.1002/NAV.3800010110
[7]  
MCMAHON GB, 1969, CANADIAN OPERATIONS, V7, P141
[8]   A GENERAL ALGORITHM FOR SOLUTION OF N-JOB M-MACHINE SEQUENCING PROBLEM OF FLOW SHOP [J].
SMITH, RD ;
DUDEK, RA .
OPERATIONS RESEARCH, 1967, 15 (01) :71-&
[9]   CORRECTIONS [J].
SMITH, RD .
OPERATIONS RESEARCH, 1969, 17 (04) :756-&
[10]  
Smith W.E., 1956, NAV RES LOGIST Q, V3, P59, DOI DOI 10.1002/NAV.3800030106