THE 2-MACHINE SEQUENCE DEPENDENT FLOWSHOP SCHEDULING PROBLEM

被引：95

作者：

GUPTA, JND ^{[1
]}

DARROW, WP ^{[1
]}

机构：

[1] TOWSON STATE UNIV,TOWSON,MD 21204

来源：

关键词：

FLOWSHOP - HEURISTIC - NP-COMPLETE - TWO-MACHINE SEQUENCE;

D O I：

10.1016/0377-2217(86)90037-8

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：439 / 446

页数：8

共 11 条

[1]

Bellman R., 1982, MATH ASPECTS SCHEDUL

CORWIN, BD ;

ESOGBUE, AO .

[3]

DARROW WP, 1980, THESIS PENNSYLVANIA

[4]

French S., 1982, SEQUENCING SCHEDULIN

[5]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[6]

Gupta J. N. D., 1975, Computers & Operations Research, V2, P83, DOI 10.1016/0305-0548(75)90011-8

[7]

GUPTA JND, 1985, INDIAN J MANAGEMENT, V1, P6

[8]

Gupta JND, 1979, DISAGGREGATION PROBL

[9]

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

[10] HEURISTIC PROGRAMMING SOLUTION OF A FLOWSHOP-SCHEDULING PROBLEM [J].

KRONE, MJ ;

STEIGLIT.K .