A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan

被引：77

作者：

Riane, F

Artiba, A

Elmaghraby, SE

机构：

[1] FUCAM, CREGI, B-7000 Mons, Belgium

[2] N Carolina State Univ, IE OR, Raleigh, NC 27695 USA

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1998年 / 109卷 / 02期

关键词：

scheduling; hybrid flowshop; heuristics;

D O I：

10.1016/S0377-2217(98)00060-5

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We treat a problem of scheduling n jobs on a three stages hybrid flowshop of particular structure (one machine in the first and third stages and two dedicated machines in stage two). The objective is to minimize the makespan. This problem is NP-complete. We propose two heuristic procedures to cope with realistic problems. Extensive experimentation with various problem sizes are conducted and the computational results show excellent performance of the proposed heuristics. (C) 1998 Elsevier Science B.V. All rights reserved.

引用

页码：321 / 329

页数：9

共 11 条

[1]

ARTIBA A, 1996, ICOQMS P JAIP 2, P467

[2]

BOTTA GV, 1996, THESIS U C BERNARD L

[3]

CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630

[4] A new heuristic for three-machine flow shop scheduling [J].

Chen, B ;

Glass, CA ;

Potts, CN ;

Strusevich, VA .

OPERATIONS RESEARCH, 1996, 44 (06) :891-898

[5]

GUINET A, 1996, WORKSH PROD PLANN CO, P299

[6]

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

[7] FLOW-SHOP SCHEDULING WITH BRANCH-AND-BOUND METHOD [J].

MCMAHON, GB ;

BURTON, PG .

OPERATIONS RESEARCH, 1967, 15 (03) :473-&

[8] A HEURISTIC ALGORITHM FOR THE M-MACHINE, N-JOB FLOWSHOP SEQUENCING PROBLEM [J].

NAWAZ, M ;

ENSCORE, EE ;

HAM, I .

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1983, 11 (01) :91-95

[9]

Portmann M.C., 1997, PLANNING SCHEDULING

[10]

Riane F., 1997, 31097WR214 FUCAM

← 1 2 →