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 条

[31] The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm
Akkan, C
Karabati, S
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 159 (02) : 420 - 429
[32] Resolution Search and Dynamic Branch-and-Bound
Saïd Hanafi
Fred Glover
Journal of Combinatorial Optimization, 2002, 6 : 401 - 423
[33] Scalability of branch-and-bound and adaptive integration
Zanny, R
Kangars, K
de Doncker, E
PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, 2001, : 674 - 680
[34] A BRANCH-AND-BOUND INCREMENTAL CONCEPTUAL CLUSTERER
NEVINS, AJ
MACHINE LEARNING, 1995, 18 (01) : 5 - 22
[35] Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
Schaller, Jeffrey
Valente, Jorge
COMPUTERS & OPERATIONS RESEARCH, 2019, 109 : 1 - 11
[36] Branch and bound lower bounds for the hybrid flowshop
Moursli, O
INTELLIGENT MANUFACTURING SYSTEMS 1997 (IMS'97), 1997, : 31 - 36
[37] RANDOMIZED PARALLEL ALGORITHMS FOR BACKTRACK SEARCH AND BRANCH-AND-BOUND COMPUTATION
KARP, RM
ZHANG, YJ
JOURNAL OF THE ACM, 1993, 40 (03) : 765 - 789
[38] OPTIMAL RELIABILITY ALLOCATION BY BRANCH-AND-BOUND TECHNIQUE
NAKAGAWA, Y
NAKASHIMA, K
HATTORI, Y
IEEE TRANSACTIONS ON RELIABILITY, 1978, 27 (01) : 31 - 38
[39] LIS using backtracking and branch-and-bound approaches
Seema Rani
Dharmveer Singh Rajpoot
CSI Transactions on ICT, 2016, 4 (2-4) : 87 - 93
[40] 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

← 1 2 3 4 5 →