MINIMIZING TOTAL TARDINESS IN PERMUTATION FLOWSHOPS

被引：63

作者：

KIM, YD

机构：

[1] Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Daejon, 305-701, Yusong-gu

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1995年 / 85卷 / 03期

关键词：

SCHEDULING; BRANCH AND BOUND;

D O I：

10.1016/0377-2217(94)00029-C

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider the permutation flowshop scheduling problem with the objective of minimizing total tardiness. Presented are several properties that are used to calculate lower bounds on total tardiness of jobs for a given partial sequence and to identify sequences dominated by others. We develop a branch and bound algorithm using these bounds and a dominance rule. Results of computational experiments on randomly generated problems are reported.

引用

页码：541 / 555

页数：15

共 24 条

[1]

Baker K., 1974, INTRO SEQUENCING SCH

[2] NEW BOUND FOR MACHINE SCHEDULING [J].

BESTWICK, PF ;

HASTINGS, NAJ .

OPERATIONAL RESEARCH QUARTERLY, 1976, 27 (02) :479-487

[3] MINIMIZING TOTAL TARDINESS ON ONE MACHINE IS NP-HARD [J].

DU, JZ ;

LEUNG, JYT .

MATHEMATICS OF OPERATIONS RESEARCH, 1990, 15 (03) :483-495

[4] THE LESSONS OF FLOWSHOP SCHEDULING RESEARCH [J].

DUDEK, RA ;

PANWALKAR, SS ;

SMITH, ML .

OPERATIONS RESEARCH, 1992, 40 (01) :7-13

[5]

French S., 1982, SEQUENCING SCHEDULIN

[6] A NEW INTEGER PROGRAMMING FORMULATION FOR THE PERMUTATION FLOWSHOP PROBLEM [J].

FRIEZE, AM ;

YADEGAR, J .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 40 (01) :90-98

[7]

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

[8] 4 SIMPLE HEURISTICS FOR SCHEDULING A FLOW-SHOP [J].

GELDERS, LF ;

SAMBANDAM, N .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1978, 16 (03) :221-231

[9] ON FLOWSHOP SCHEDULING WITH RELEASE AND DUE DATES TO MINIMIZE MAXIMUM LATENESS [J].

GRABOWSKI, J ;

SKUBALSKA, E ;

SMUTNICKI, C .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1983, 34 (07) :615-620

[10] GENERATING IMPROVED DOMINANCE CONDITIONS FOR THE FLOWSHOP PROBLEM [J].

GUPTA, JND ;

SHANTHIKUMAR, JG ;

SZWARC, W .

COMPUTERS & OPERATIONS RESEARCH, 1987, 14 (01) :41-45

← 1 2 3 →