COUNTEREXAMPLES TO OPTIMAL PERMUTATION SCHEDULES FOR CERTAIN FLOW-SHOP PROBLEMS

被引：9

作者：

PANWALKAR, SS ^{[1
]}

SMITH, ML ^{[1
]}

WOOLLAM, CR ^{[1
]}

机构：

[1] UNIV TENNESSEE,KNOXVILLE,TN 37916

来源：

关键词：

D O I：

10.1002/nav.3800280215

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：339 / 340

页数：2

共 11 条

[1]

ASHOUR S, 1972, SEQUENCING THEORY

[2]

Baker K., 1974, INTRO SEQUENCING SCH

[3] SPECIAL CASE OF 3XN FLOW SHOP PROBLEM [J].

BURNS, F ;

ROOKER, J .

[4]

Conway R, 1967, THEORY SCHEDULING

[5]

EISELT HA, 1977, OPERATIONS RES HDB

[6]

FABRICKI WJ, 1972, IND OPERATIONS RES

[7] OPTIMAL FLOWSHOP SCHEDULES WITH NO INTERMEDIATE STORAGE SPACE [J].

GUPTA, JND .

[8]

Johnson S. M., 1954, NAV RES LOGIST Q, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]

LOMNICKI, ZA .

[10] FLOW-SHOP SEQUENCING PROBLEM WITH NO WAIT IN PROCESS [J].

REDDI, SS ;

RAMAMOORTHY, CV .