Grid Branch-and-Bound for Permutation Flowshop

被引：0

作者：

Drozdowski, Maciej ^{[1
]}

Marciniak, Pawel ^{[1
]}

Pawlak, Grzegorz ^{[1
]}

Plaza, Maciej ^{[1
]}

机构：

[1] Poznan Univ Tech, Inst Comp Sci, PL-60965 Poznan, Poland

来源：

PARALLEL PROCESSING AND APPLIED MATHEMATICS, PT II | 2012年 / 7204卷

关键词：

branch-and-bound; flowshop; grid computing; SCHEDULING PROBLEMS; SEQUENCING PROBLEM; ALGORITHMS;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Flowshop is an example of a classic hard combinatorial problem. Branch-and-bound is a technique commonly used for solving such hard problems. Together, the two can be used as a benchmark of maturity of parallel processing environment. Grid systems pose a number of hurdles which must be overcome in practical applications. We give a report on applying parallel branch-and-bound for flowshop in grid environment. Methods dealing with the complexities of the environment and the application are proposed, and evaluated.

引用

页码：21 / 30

页数：10

共 50 条

[41] A branch-and-bound algorithm for the cell formation problem
Utkina, Irina E.
Batsyn, Mikhail V.
Batsyna, Ekaterina K.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (09) : 3262 - 3273
[42] A branch-and-bound algorithm for the coupled task problem
Bekesi, Jozsef
Galambos, Gabor
Jung, Michael N.
Oswald, Marcus
Reinelt, Gerhard
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2014, 80 (01) : 47 - 81
[43] LIS using backtracking and branch-and-bound approaches
Seema Rani
Dharmveer Singh Rajpoot
CSI Transactions on ICT, 2016, 4 (2-4) : 87 - 93
[44] OPTIMAL RELIABILITY ALLOCATION BY BRANCH-AND-BOUND TECHNIQUE
NAKAGAWA, Y
NAKASHIMA, K
HATTORI, Y
IEEE TRANSACTIONS ON RELIABILITY, 1978, 27 (01) : 31 - 38
[45] Constrained branch-and-bound algorithm for image registration
Jin J.-Q.
Wang Z.-Y.
Peng Q.-S.
Journal of Zhejiang University-SCIENCE A, 2005, 6 (Suppl 1): : 94 - 99
[46] Branch-and-Bound Methods for Euclidean Registration Problems
Olsson, Carl
Kahl, Fredrik
Oskarsson, Magnus
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2009, 31 (05) : 783 - 794
[47] A branch-and-bound approach for robust railway timetabling
Maróti G.
Public Transport, 2017, 9 (1-2) : 73 - 94
[48] A Branch-and-Bound Algorithm for the Talent Scheduling Problem
Liang, Xiaocong
Zhang, Zizhen
Qin, Hu
Guo, Songshan
Lim, Andrew
MODERN ADVANCES IN APPLIED INTELLIGENCE, IEA/AIE 2014, PT I, 2014, 8481 : 208 - 217
[49] A branch-and-bound algorithm for hardware/software partitioning
Wu, JG
Thambipillai, S
PROCEEDINGS OF THE FOURTH IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY, 2004, : 526 - 529
[50] Performance of convex underestimators in a branch-and-bound framework
Guzman, Yannis A.
Hasan, M. M. Faruque
Floudas, Christodoulos A.
OPTIMIZATION LETTERS, 2016, 10 (02) : 283 - 308

← 1 2 3 4 5 →