2D cutting stock problem: A new parallel algorithm and bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4641 LNCS, Issue , 2007, Pages 795-804

  León, Coromoto ^a   Miranda, Gara ^a   Rodríguez, Casiano ^a   Segura, Carlos ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; DISTRIBUTED COMPUTER SYSTEMS; INVENTORY CONTROL; PARALLEL ALGORITHMS; PROBLEM SOLVING; STORAGE ALLOCATION (COMPUTER);

CUTTING STOCK PROBLEM; DISTRIBUTED MEMORY MACHINES; SYNCHRONIZATION SERVICES;

COST BENEFIT ANALYSIS;

EID: 38049128928     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74466-5_85     Document Type: Conference Paper

References (11)

1. Wang, P.Y.: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems. Operations Research 31(3), 573-586 (1983)
2. Viswanathan, K.V., Bagchi, A.: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems. Operations Research 41(4), 768-776 (1993)
3. Gilmore, P.C., Gomory, R.E.: The Theory and Computation of Knapsack Functions. Operations Research 14, 1045-1074 (1966)
4. Hifi, M.: An Improvement of Viswanathan and Bagchi's Exact Algorithm for Constrained Two-Dimensional Cutting Stock. Computer Operations Research 24(8), 727-736 (1997)
5. Cung, V.D., Hifi, M., Le-Cun, B.: Constrained Two-Dimensional Cutting Stock Problems: A Best-First Branch-and-Bound Algorithm. Technical Report 97/020, Laboratoire PRiSM - CNRS URA 1525. Université de Versailles, Saint Quentin en Yvelines. 78035 Versailles Cedex, France (November 1997)
6. Nicklas, L.D., Atkins, R.W., Setia, S.K., Wang, P.Y.: The Design and Implementation of a Parallel Solution to the Cutting Stock Problem. Concurrency - Practice and Experience 10(10), 783-805 (1998)
7. Tschöke, S., Holthöfer, N.: A New Parallel Approach to the Constrained TwoDimensional Cutting Stock Problem. In: Ferreira, A., Rolim, J. (eds.) Parallel Algorithms for Irregularly Structured Problems, Berlin, Germany, pp. 285-300. Springer, Heidelberg (1995)
8. Tschöke, S., Polzer, T.: Portable Parallel Branch-and-Bound Library - PPBB-LIB, Department of Computer Science, University of Paderborn, D-33095 Paderborn, Germany (December 1996)
9. Garcia, L., León, C., Miranda, G., Rodríguez, C.: A Parallel Algorithm for the Two-Dimensional Cutting Stock Problem. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par 2006. LNCS, vol. 4128, pp. 821-830. Springer, Heidelberg (2006)
10. Group, D.O.R.: Library of Instances (Two-Constraint Bin Packing Problem), http://www.or.deis.unibo.it/research_pages/0Rinstances/2CBP.html
11. Network-Based Computing Laboratory, Dept. of Computer Science and Eng., The Ohio State University: MPI over InfiniBand Project (2006), http://nowlab.cse.ohio-state.edu/projects/mpi-iba