OPTIMAL FLOWSHOP SCHEDULES WITH NO INTERMEDIATE STORAGE SPACE

被引:40
作者
GUPTA, JND [1 ]
机构
[1] US POSTAL SERV,DEPT MANAGEMENT INFORMATION SYST,WASHINGTON,DC
关键词
D O I
10.1002/nav.3800230206
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:235 / 243
页数:9
相关论文
共 9 条
[1]  
BAKSHI MS, 1969, MANAGE SCI B-APPL, V16, pB247
[2]   TRAVELING SALESMAN PROBLEM - A SURVEY [J].
BELLMORE, M ;
NEHAUSE.GL .
OPERATIONS RESEARCH, 1968, 16 (03) :538-&
[3]   REVIEW OF SEQUENCING RESEARCH [J].
DAY, JE ;
HOTTENSTEIN, MP .
NAVAL RESEARCH LOGISTICS QUARTERLY, 1970, 17 (01) :11-+
[4]  
ELMAGHRABY SE, 1968, NAV RES LOGIST Q, V15, P205
[5]   SEQUENCING 1 STATE-VARIABLE MACHINE - SOLVABLE CASE OF TRAVELING SALESMAN PROBLEM [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1964, 12 (05) :655-&
[6]  
Gupta J.N.D., 1971, INT J PROD RES, V9, P267
[7]  
Gupta JND, 1968, OPSEARCH, V5, P181
[8]  
REDDI SS, 1972, OPERATIONAL RESEARCH
[9]   SOLUTION OF FLOWSHOP-SCHEDULING PROBLEM WITH NO INTERMEDIATE QUEUES [J].
WISMER, DA .
OPERATIONS RESEARCH, 1972, 20 (03) :689-&