BRANCH AND BOUND ALGORITHM FOR THE FLOW-SHOP WITH MULTIPLE PROCESSORS

被引：180

作者：

BRAH, SA

HUNSUCKER, JL

机构：

[1] Department of Industrial Engineering, University of Houston, Houston

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1991年 / 51卷 / 01期

关键词：

FLOWSHOP; MULTIPLE PROCESSORS; BRANCH AND BOUND;

D O I：

10.1016/0377-2217(91)90148-O

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The sequencing of a flow shop with multiple processors at each stage is a general case of the flow shop problem. It involves sequencing n jobs in a flow shop where, for at least one stage, the facility has one or more identical machines. The purpose of this paper is to present a branch and bound algorithm to solve scheduling problems of such facilities for optimizing the maximum completion time. The lower bounds and elimination rules developed in this research are based upon the generalization of the flow shop problem. Furthermore, a computational algorithm, along with results, is also presented. The branch and bound algorithm can also be used to optimize other measures of performance in a flow shop with multiple processors.

引用

页码：88 / 99

页数：12

共 23 条

[1]

Ashour S., 1970, AIIE T, V2, P172

[2] COMPARATIVE STUDY OF FLOW-SHOP ALGORITHMS [J].