A flexible flowshop problem with total flow time minimization

被引：51

作者：

Azizoglu, M ^{[1
]}

Çakmak, E

Kondakci, S

机构：

[1] Middle E Tech Univ, Dept Ind Engn, TR-06531 Ankara, Turkey

[2] Anadolu Univ, Dept Ind Engn, Eskisehir, Turkey

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2001年 / 132卷 / 03期

关键词：

flexible flowshop; parallel machines; total flow time;

D O I：

10.1016/S0377-2217(00)00142-9

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this study, we consider total flow time problem in a flexible flowshop environment. We develop a branch and bound algorithm to find the optimal schedule. The efficiency of the algorithm is enhanced by upper and lower bounds and a dominance criterion. Computational experience reveals that the algorithm solves moderate sized problems in reasonable solution times. (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：528 / 538

页数：11

共 27 条

[1] IMPROVED LOWER BOUNDS FOR MINIMIZING THE SUM OF COMPLETION TIMES OF N-JOBS OVER M-MACHINES IN A FLOW-SHOP [J].

AHMADI, RH ;

BAGCHI, U .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 44 (03) :331-336

[2]

Arthanary T., 1971, Opsearch J. Oper. Res. Soc. India, V8, P10

[3]

Bansal S. P., 1977, AIIE Transactions, V9, P306, DOI 10.1080/05695557708975160

[4] 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

[5]

Conway R.W., 1967, Theory of Scheduling

[6]

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

[7] TEXTILE PRODUCTION SYSTEMS - A SUCCESSION OF NONIDENTICAL PARALLEL PROCESSOR SHOPS [J].

GUINET, A .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1991, 42 (08) :655-671

[8] Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time [J].

Guinet, AGP ;

Solomon, MM .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (06) :1643-1654

[9] 2-STAGE, HYBRID FLOWSHOP SCHEDULING PROBLEM [J].

GUPTA, JND .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (04) :359-364

[10] SCHEDULING A 2-STAGE HYBRID FLOWSHOP WITH SEPARABLE SETUP AND REMOVAL TIMES [J].

GUPTA, JND ;

TUNC, EA .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 77 (03) :415-428

← 1 2 3 →