Grid branch-and-bound for permutation flowshop

Authors:
Maciej Drozdowski;Paweł Marciniak;Grzegorz Pawlak;Maciej Płaza
Affiliations:
Institute of Computing Science, Poznań University of Technology, Poznań, Poland;Institute of Computing Science, Poznań University of Technology, Poznań, Poland;Institute of Computing Science, Poznań University of Technology, Poznań, Poland;Institute of Computing Science, Poznań University of Technology, Poznań, Poland
Venue:
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Year:
2011

Citing 4
Cited 0

Anomalies in parallel branch-and-bound algorithms

Communications of the ACM
Improved genetic algorithm for the permutation flowshop scheduling problem

Computers and Operations Research
Genetic algorithms, path relinking, and the flowshop sequencing problem

Evolutionary Computation
A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.