ON J-MAXIMAL AND J-MINIMAL FLOWSHOP SCHEDULES

被引：15

作者：

CHIN, FY

TSAI, LL

机构：

来源：

JOURNAL OF THE ACM | 1981年 / 28卷 / 03期

关键词：

D O I：

10.1145/322261.322265

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：462 / 476

页数：15

共 12 条

[1]

ACHUGBUE JO, 1980, COMPLEXITY SOLUTIONS

[2] 3-STAGE FLOW-SHOPS WITH RECESSIVE SECOND STAGE [J].

BURNS, F ;

ROOKER, J .

OPERATIONS RESEARCH, 1978, 26 (01) :207-208

[3]

Coffman E.G., 1976, COMPUTER JOB SHOP SC

[4]

Conway R, 1967, THEORY SCHEDULING

[5]

Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117

[6] FLOW-SHOP AND JOB-SHOP SCHEDULES - COMPLEXITY AND APPROXIMATION [J].

GONZALEZ, T ;

SAHNI, S .

OPERATIONS RESEARCH, 1978, 26 (01) :36-52

[7]

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

[8]

Karp R.M., 1972, COMPLEXITY COMPUTER

[9]

Lenstra J.K., 1977, ANN DISCRETE MATH, V1, P343, DOI [/10.1016/S0167-5060(08)70743-X, DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]

[10]

MCMAHON GB, 1971, THESIS U NEW S WALES

← 1 2 →