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 条

[1] A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
Cheng, JL
Kise, H
Matsumoto, H
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (03) : 578 - 590
[2] A branch-and-bound algorithm for the hybrid flowshop
Moursli, O
Pochet, Y
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2000, 64 (1-3) : 113 - 125
[3] AND/OR Branch-and-Bound on a Computational Grid
Otten, Lars
Dechter, Rina
[J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 59 : 351 - 435
[4] A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking
Débora P. Ronconi
[J]. Annals of Operations Research, 2005, 138 : 53 - 65
[5] A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
Ronconi, DP
[J]. ANNALS OF OPERATIONS RESEARCH, 2005, 138 (01) : 53 - 65
[6] Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives
Madhushini, N.
Rajendran, Chandrasekharan
[J]. EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2011, 5 (04) : 361 - 387
[7] A branch-and-bound approach to the no-idle flowshop scheduling problem
Jarboui, Bassem
Eddaly, Mansour
[J]. DISCRETE APPLIED MATHEMATICS, 2024, 347 : 297 - 310
[8] An Efficient Branch and Bound Search Strategy for Permutation Flowshop Problems
Chung, Chia-Shin
Flynn, James
Sang, Janche
[J]. PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 40 - 49
[9] A BRANCH-AND-BOUND APPROACH FOR A 2-MACHINE FLOWSHOP SCHEDULING PROBLEM
NAGAR, A
HERAGU, SS
HADDOCK, J
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1995, 46 (06) : 721 - 734
[10] CHARACTERIZATION AND THEORETICAL COMPARISON OF BRANCH-AND-BOUND ALGORITHMS FOR PERMUTATION PROBLEMS
KOHLER, WH
STEIGLIT.K
[J]. JOURNAL OF THE ACM, 1974, 21 (01) : 140 - 156

← 1 2 3 4 5 →