loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)
Two-Dimensional Cutting Stock Problem: Shared Memory Parallelizations
Bialystok, Poland
September 13-September 17
ISBN: 0-7695-2554-7
ASCII Text
x 
 
Luis Garcia, Coromoto Leon, Gara Miranda, Casiano Rodriguez, "Two-Dimensional Cutting Stock Problem: Shared Memory Parallelizations," Parallel Computing in Electrical Engineering, International Conference on, pp. 438-443, International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/PARELEC.2006.83,
author = {Luis Garcia and Coromoto Leon and Gara Miranda and Casiano Rodriguez},
title = {Two-Dimensional Cutting Stock Problem: Shared Memory Parallelizations},
journal ={Parallel Computing in Electrical Engineering, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2554-7},
pages = {438-443},
doi = {http://doi.ieeecomputersociety.org/10.1109/PARELEC.2006.83},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Computing in Electrical Engineering, International Conference on
TI - Two-Dimensional Cutting Stock Problem: Shared Memory Parallelizations
SN - 0-7695-2554-7
SP438
EP443
A1 - Luis Garcia,
A1 - Coromoto Leon,
A1 - Gara Miranda,
A1 - Casiano Rodriguez,
PY - 2006
KW - null
VL - 0
JA - Parallel Computing in Electrical Engineering, International Conference on
ER -
 
Luis Garcia, Universidad de La Laguna, Spain
Coromoto Leon, Universidad de La Laguna, Spain
Gara Miranda, Universidad de La Laguna, Spain
Casiano Rodriguez, Universidad de La Laguna, Spain
Cutting Stock Problems arise in many industries where large stock sheets of a given material must be cut into smaller pieces. Many algorithms have been proposed for solving each of the problem formulations. We present different implementations based on Viswanathan and Bagchi?s algorithm to solve the Two-Dimensional Cutting Stock Problem (2DCSP). One approximation parallelizes the generation of new builds from different subproblems. Also a highly efficient data structures to store subproblems are introduced, allowing to provide a parallel implementation where the generation of new subproblems from a particular one can be distributed. The OpenMP tool has been used for the parallel implementations and some computational results are presented.
Citation:
Luis Garcia, Coromoto Leon, Gara Miranda, Casiano Rodriguez, "Two-Dimensional Cutting Stock Problem: Shared Memory Parallelizations," parelec, pp.438-443, International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.