An exact method for solving the multi-processor flow-shop

被引：111

作者：

Carlier, J ^{[1
]}

Néron, E ^{[1
]}

机构：

[1] Univ Technol Compiegne, Ctr Rech Royallieu, UMR CNRS 6599 HEUDIASYC, F-60205 Compiegne, France

来源：

RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH | 2000年 / 34卷 / 01期

关键词：

branch and bound; multi-processor flow-shop; m-machine problems; inputs and selection;

D O I：

10.1051/ro:2000103

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The aim of this paper is to present a new branch and bound method for solving the Multi-Processor Flow-Shop. This method is based on the relaxation of the initial problem to m-machine problems corresponding to centers. Release dates and tails are associated with operations and machines. The branching scheme consists in fixing the inputs of a critical center and the lower bounds are those of the m-machine problem. Several techniques for adjusting release dates and tails have also been introduced. As shown by our personal study, the overall method is very efficient.

引用

页码：1 / 25

页数：25

共 11 条

[1]

BAPTISTE P, IN PRESS ANN OPER RE

[2] BRANCH AND BOUND ALGORITHM FOR THE FLOW-SHOP WITH MULTIPLE PROCESSORS [J].

BRAH, SA ;

HUNSUCKER, JL .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 51 (01) :88-99

[3]

CARLER J, 1984, THESIS MASI

[4] Jackson's Pseudo Preemptive Schedule for the Pm/ri, qi/Cmax scheduling problem [J].

Carlier, J ;

Pinson, E .

ANNALS OF OPERATIONS RESEARCH, 1998, 83 (0) :41-58

[5] A BRANCH-AND-BOUND PROCEDURE FOR THE MULTIPLE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM [J].

DEMEULEMEESTER, E ;

HERROELEN, W .

MANAGEMENT SCIENCE, 1992, 38 (12) :1803-1818

[6]

GUPTA JND, 1988, OPERATIONAL RES SOC, V4, P359

[7]

PERREGAARD M, 1995, THESIS DATALOGISK I

[8]

PORTMANN MC, 1998, EUROPEAN J OPER RES, V107, P339

[9]

Sprecher A., 1994, LECT NOTES EC MATH S

[10]

VANDEVELDE A, 1994, THESIS EINDHOVEN U T

← 1 2 →