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 条

[21] Genetic Branch-and-Bound or exact genetic algorithm?
Pessan, C.
Bouquard, J. -L.
Neron, E.
[J]. ARTIFICIAL EVOLUTION, 2008, 4926 : 136 - 147
[22] A branch-and-bound algorithm for the acyclic partitioning problem
Nossack, Jenny
Pesch, Erwin
[J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 174 - 184
[23] A branch-and-bound algorithm for the cell formation problem
Utkina, Irina E.
Batsyn, Mikhail V.
Batsyna, Ekaterina K.
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (09) : 3262 - 3273
[24] A branch-and-bound algorithm for the coupled task problem
Bekesi, Jozsef
Galambos, Gabor
Jung, Michael N.
Oswald, Marcus
Reinelt, Gerhard
[J]. MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2014, 80 (01) : 47 - 81
[25] A new branch-and-bound approach for the n/2/flowshop/αF+βCmax flowshop scheduling problem
Yeh, WC
[J]. COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (13) : 1293 - 1310
[26] Constrained branch-and-bound algorithm for image registration
Jin J.-Q.
Wang Z.-Y.
Peng Q.-S.
[J]. Journal of Zhejiang University-SCIENCE A, 2005, 6 (Suppl 1): : 94 - 99
[27] A Branch-and-Bound Algorithm for the Talent Scheduling Problem
Liang, Xiaocong
Zhang, Zizhen
Qin, Hu
Guo, Songshan
Lim, Andrew
[J]. MODERN ADVANCES IN APPLIED INTELLIGENCE, IEA/AIE 2014, PT I, 2014, 8481 : 208 - 217
[28] A branch-and-bound algorithm for hardware/software partitioning
Wu, JG
Thambipillai, S
[J]. PROCEEDINGS OF THE FOURTH IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY, 2004, : 526 - 529
[29] An enhanced branch-and-bound algorithm for a partitioning problem
Brusco, MJ
[J]. BRITISH JOURNAL OF MATHEMATICAL & STATISTICAL PSYCHOLOGY, 2003, 56 : 83 - 92
[30] Constrained branch-and-bound algorithm for image registration
金剑秋
王章野
彭群生
[J]. Journal of Zhejiang University-Science A(Applied Physics & Engineering), 2005, (S1) : 94 - 99

← 1 2 3 4 5 →