ON AN AUTOMATED 2-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER

被引：47

作者：

KISE, H ^{[1
]}

机构：

[1] KYOTO INST TECHNOL,DEPT MECH & SYST ENGN,SAKYOU KU,KYOTO 606,JAPAN

来源：

JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN | 1991年 / 34卷 / 03期

关键词：

D O I：

10.15807/jorsj.34.354

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

A new flowshop scheduling problem related to automated manufacturing systems such as FMS's and FMC's is discussed. The problem is shown to be an extension of the two-machine flowship problem addressed by Johnson (or a special case of the three machine flowshop problem), and to be NP-hard. Some solvable cases are discussed.

引用

页码：354 / 361

页数：8

共 11 条

[1]

ARTHANARI TS, 1971, NAV RES LOG, V15, P135

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

BURNS, F ;

ROOKER, J .

NAVAL RESEARCH LOGISTICS, 1975, 22 (04) :811-817

[3]

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

[4]

GAREY MR, 1979, COMPUTERS INTRATRACT

[5]

Graham R. L., 1979, Discrete Optimisation, P287

[6]

JAIKUMAR R, 1986, HARVARD BUSINESS NOV

[7]

Johnson SM, 1954, NAVAL RES LOGIST, V1, P61, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]

[8]

KISE H, 1991, T IIE, V23, P10

[9] FLOWSHOP SCHEDULING WITH LIMITED TEMPORARY-STORAGE [J].

PAPADIMITRIOU, CH ;

KANELLAKIS, PC .

JOURNAL OF THE ACM, 1980, 27 (03) :533-549

[10] MATHEMATICAL ASPECTS OF 3XN JOB-SHOP SEQUENCING PROBLEM [J].

SZWARC, W .

NAVAL RESEARCH LOGISTICS, 1974, 21 (01) :145-153

← 1 2 →