JOB LATENESS IN A 2-MACHINE FLOWSHOP WITH SETUP TIMES SEPARATED

被引：27

作者：

DILEEPAN, P ^{[1
]}

SEN, T ^{[1
]}

机构：

[1] UNIV TENNESSEE,SCH BUSINESS ADM,DEPT MANAGEMENT,615 MCCALLIE AVE,CHATTANOOGA,TN 37403

来源：

COMPUTERS & OPERATIONS RESEARCH | 1991年 / 18卷 / 06期

关键词：

D O I：

10.1016/0305-0548(91)90060-5

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper considers the two-machine flowshop problem of minimizing maximum lateness where setup times are separated from process times. Two sufficient conditions for optimality are presented. These conditions and a lower bound are used to develop a branch-and-bound solution procedure to arrive at an optimal solution. Computational results are also given. The computational results include comparison of the optimal solutions with the solutions obtained by two heuristic procedures based on the two sufficiency conditions mentioned earlier.

引用

页码：549 / 556

页数：8

共 24 条

[1]

Baker K., 1974, INTRO SEQUENCING SCH

[2]

Conway RW., 1967, THEORY SCHEDULING

[3] DUAL ALGORITHM FOR ONE-MACHINE SCHEDULING PROBLEM [J].

FISHER, ML .

MATHEMATICAL PROGRAMMING, 1976, 11 (03) :229-251

[4]

Grabowski J., 1980, Opsearch, V17, P133

[5] 2-STAGE, HYBRID FLOWSHOP SCHEDULING PROBLEM [J].

GUPTA, JND .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (04) :359-364

[6]

Jackson J.R., 1955, MANAGEMENT SCI RES P

[7]

Johnson S.M., 1954, NAV RES LOG, V1, P61, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]

[8] ON JOHNSONS 2-MACHINE FLOWSHOP WITH RANDOM PROCESSING TIMES [J].

KU, PS ;

NIU, SC .

OPERATIONS RESEARCH, 1986, 34 (01) :130-136

[9]

KURISU T, 1976, J OPL RES SOC JAPAN, V19

[10]

LAWLER EL, 1981, MATH OPER RES, V6, P153, DOI 10.1287/moor.6.1.153

← 1 2 3 →