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 条

[21] SEQUENCING N JOBS ON 2 MACHINES WITH SETUP, PROCESSING AND REMOVAL TIMES SEPARATED [J].

SULE, DR .

NAVAL RESEARCH LOGISTICS, 1982, 29 (03) :517-519

[22] SEQUENCY ON 2 AND 3 MACHINES WITH SETUP, PROCESSING AND REMOVAL TIMES SEPARATED [J].

SULE, DR ;

HUANG, KY .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1983, 21 (05) :723-732

[23] SEQUENCING N JOBS ON M MACHINES TO MINIMIZE MAXIMUM TARDINESS - A BRANCH-AND-BOUND SOLUTION [J].

TOWNSEND, W .

MANAGEMENT SCIENCE, 1977, 23 (09) :1016-1019

[24] OPTIMAL 2-STAGE PRODUCTION SCHEDULING WITH SETUP TIMES SEPARATED [J].

YOSHIDA, T ;

HITOMI, K .

AIIE TRANSACTIONS, 1979, 11 (03) :261-263

← 1 2 3 →