A branch-and-bound algorithm for the hybrid flowshop

被引：94

作者：

Moursli, O ^{[1
]}

Pochet, Y ^{[1
]}

机构：

[1] Univ Catholique Louvain, Inst Adm & Gest, B-1348 Louvain, Belgium

来源：

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2000年 / 64卷 / 1-3期

关键词：

hybrid flowshop; branch and bound; lower bound; upper bound; scheduling with release dates and tails;

D O I：

10.1016/S0925-5273(99)00051-1

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper introduces a branch-and-bound algorithm for the hybrid flowshop scheduling problem to minimize makespan. The algorithm can also cope with problems with release dates and tails. Several heuristics art: used to compute upper bounds. Lower bounds are based upon the single-stage subproblem relaxation. Several upper and lower bounding strategies are considered. Numerical tests show that, in a few minutes of running time, and even for the hardest (i.e. without a bottleneck stage) and mid-size problems, the algorithm has reduced the initial gap between upper and lower bounds by 50% on average. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

引用

页码：113 / 125

页数：13

共 50 条

[41] A hybrid Tabu Search/Branch-and-Bound algorithm for the direct flight network design problem
Büdenbender, K
Grünert, T
Sebastian, HJ
[J]. TRANSPORTATION SCIENCE, 2000, 34 (04) : 364 - 380
[42] A Hybrid Branch-and-Bound Strategy for Hardware/Software Partitioning
Jigang, Wu
Chang, Baofang
Srikanthan, Thambipillai
[J]. PROCEEDINGS OF THE 8TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE, 2009, : 641 - +
[43] A MULTICRITERIA SCHEDULING TOOL USING A BRANCH-AND-BOUND ALGORITHM
BAUSCH, R
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 61 (1-2) : 215 - 218
[44] Towards a heterogeneous and adaptive parallel Branch-and-Bound algorithm
Chakroun, I.
Melab, N.
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2015, 81 (01) : 72 - 84
[45] Fuzzy branch-and-bound algorithm for flow shop scheduling
İzzettİn Temİz
Serpİl Erol
[J]. Journal of Intelligent Manufacturing, 2004, 15 : 449 - 454
[46] A reduced dimension branch-and-bound algorithm for molecular design
Ostrovsky, GM
Achenie, LEK
Sinha, M
[J]. COMPUTERS & CHEMICAL ENGINEERING, 2003, 27 (04) : 551 - 567
[47] An improved branch-and-bound algorithm for the test cover problem
Fahle, T
Tiemann, K
[J]. EXPERIMENTAL AND EFFICIENT ALGORITHMS, PROCEEDINGS, 2005, 3503 : 89 - 100
[48] A BRANCH-AND-BOUND ALGORITHM FOR ONE CLASS OF SCHEDULING PROBLEM
ANISIMOV, VG
ANISIMOV, YG
[J]. COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1992, 32 (12) : 1827 - 1832
[49] A branch-and-bound algorithm for the concave cost supply problem
Yenipazarli, Arda
Benson, Harold P.
Erenguc, Selcuk
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (13) : 3943 - 3961
[50] EVALUATION OF A PARALLEL BRANCH-AND-BOUND ALGORITHM ON A CLASS OF MULTIPROCESSORS
YANG, MK
DAS, CR
[J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (01) : 74 - 86

← 1 2 3 4 5 →