A NOTE ON THE FLOWSHOP PROBLEM WITHOUT INTERRUPTIONS IN JOB PROCESSING

被引：14
作者：
SZWARC, W
机构：
来源：
NAVAL RESEARCH LOGISTICS | 1981年 / 28卷 / 04期
关键词：
D O I：
10.1002/nav.3800280413
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：665 / 669
页数：5
相关论文
共 6 条
[1]   OPTIMAL FLOWSHOP SCHEDULES WITH NO INTERMEDIATE STORAGE SPACE [J].
GUPTA, JND .
NAVAL RESEARCH LOGISTICS, 1976, 23 (02) :235-243
[2]  
Johnson S. M., 1954, NAV RES LOGIST Q, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]
[3]   COUNTEREXAMPLES TO OPTIMAL PERMUTATION SCHEDULES FOR CERTAIN FLOW-SHOP PROBLEMS [J].
PANWALKAR, SS ;
SMITH, ML ;
WOOLLAM, CR .
NAVAL RESEARCH LOGISTICS, 1981, 28 (02) :339-340
[4]   FLOW-SHOP SEQUENCING PROBLEM WITH NO WAIT IN PROCESS [J].
REDDI, SS ;
RAMAMOORTHY, CV .
OPERATIONAL RESEARCH QUARTERLY, 1972, 23 (03) :323-+
[5]  
VANDEMAN JM, 1974, AIIE T, V6, P28
[6]   SOLUTION OF FLOWSHOP-SCHEDULING PROBLEM WITH NO INTERMEDIATE QUEUES [J].
WISMER, DA .
OPERATIONS RESEARCH, 1972, 20 (03) :689-&
1