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

This paper presents a parallel branch-and-bound method to address the two-dimensional rectangular guillotine strip cutting problem. Our paper focuses on a parallel branching schema. We present a series of computational experiments to evaluate the strength of the approach. Optimal solutions have been...

Full description

Saved in:
Bibliographic Details
Published inINFORMS journal on computing Vol. 23; no. 1; pp. 15 - 25
Main Authors Bak, Slawomir, Blazewicz, Jacek, Pawlak, Grzegorz, Plaza, Maciej, Burke, Edmund K, Kendall, Graham
Format Journal Article
LanguageEnglish
Published Linthicum INFORMS 01.01.2011
Institute for Operations Research and the Management Sciences
Subjects
Algorithms
analysis of algorithms
Branch & bound algorithms
cutting stock
Cutting stock problem
Dynamic programming
Genetic algorithms
Heuristic
Linear programming
material handling
Materials handling
Methods
Neural networks
Packing problem
parallel branch-and-bound method
Problem solving
Production management
production scheduling
Scheduling
Scheduling (Management)
Studies
Online AccessGet full text

Cover

More Information
Summary:This paper presents a parallel branch-and-bound method to address the two-dimensional rectangular guillotine strip cutting problem. Our paper focuses on a parallel branching schema. We present a series of computational experiments to evaluate the strength of the approach. Optimal solutions have been found for some benchmark instances that had unknown solutions until now. For many other instances, we demonstrate that the proposed approach is time effective. The efficiency of the parallel version of the algorithm is compared and the speedup, when increasing the number of processors, is clearly demonstrated with an upper bound calculated by a specialised heuristic procedure.
ISSN:1091-9856
1526-5528
1091-9856
DOI:10.1287/ijoc.1100.0394