A New Parallel Approach to the Constrained Two-Dimensional Cutting Stock Problem

In this paper we present a new parallelization of an efficient best-first branch-and-bound algorithm to solve the constrained two-dimensional single stock guillotine cutting stock problem (CSP) to optimality.

[1]  Teodor Gabriel Crainic,et al.  PARALLEL BRANCH-AND-BOUND ALGORITHMS: SURVEY AND SYNTHESIS , 1993 .

[2]  P. Y. Wang,et al.  Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..

[3]  A. Bagchi,et al.  Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems , 1993, Oper. Res..

[4]  JoséFernando Oliveira,et al.  An improved version of Wang's algorithm for two-dimensional cutting problems , 1990 .

[5]  Reinhard Lüling,et al.  A dynamic distributed load balancing algorithm with provable good performance , 1993, SPAA '93.

[6]  Bernard Gendron,et al.  Parallel Branch-and-Branch Algorithms: Survey and Synthesis , 1994, Oper. Res..

[7]  Reinhard Lüling,et al.  Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network , 1995, Proceedings of 9th International Parallel Processing Symposium.

[8]  Vipin Kumar,et al.  General Branch and Bound, and its Relation to A and AO , 1984, Artif. Intell..

[9]  Nicos Christofides,et al.  An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

[10]  Reinhard Lüling,et al.  Load balancing for distributed branch & bound algorithms , 1992, Proceedings Sixth International Parallel Processing Symposium.

[11]  Francis C. M. Lau,et al.  An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers , 1995, Proceedings of 9th International Parallel Processing Symposium.

[12]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[13]  Paul E. Sweeney,et al.  Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography , 1992 .

[14]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .