Parallelized sequential value correction procedure for the one-dimensional cutting stock problem with multiple stock lengths

References

• Alves, C., and J. Carvalho. 2008. “A Stabilized Branch-and-Price-and-Cut Algorithm for the Multiple Length Cutting Stock Problem.” Computers and Operations Research 35: 1315–1328. doi: 10.1016/j.cor.2006.08.014
   Web of Science ®Google Scholar
• Araujo, S. A., A. A. Constantino, and K. C. Poldi. 2010. “An Evolutionary Algorithm for the One-Dimensional Cutting Stock Problem.” International Transactions in Operational Research 18: 115–127. doi: 10.1111/j.1475-3995.2009.00760.x
   Web of Science ®Google Scholar
• Becceneri, J. C., H. H. Yanasse, and N. Y. Soma. 2004. “A Method for Solving the Minimization of the Maximum Number of Open Stacks Problem within a Cutting Process.” Computers and Operations Research 31: 2315–2332. doi: 10.1016/S0305-0548(03)00189-8
   Web of Science ®Google Scholar
• Belov, G., and G. Scheithauer. 2002. “A Cutting Plane Algorithm for the One-Dimensional Cutting Stock Problem with Multiple Stock Lengths.” European Journal of Operational Research 141: 274–294. doi: 10.1016/S0377-2217(02)00125-X
   Web of Science ®Google Scholar
• Belov, G., and G. Scheithauer. 2007. “Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting.” INFORMS Journal on Computing 19: 27–35. doi: 10.1287/ijoc.1050.0132
   Web of Science ®Google Scholar
• Cherri, A. C., M. N. Arenales, and H. H. Yanasse. 2009. “The One-Dimensional Cutting Stock Problem with Usable Leftover—A Heuristic Approach.” European Journal of Operational Research 196: 897–908. doi: 10.1016/j.ejor.2008.04.039
   Web of Science ®Google Scholar
• Cui, Y. 2012. “Extended Block Patterns for the Two-Dimensional Cutting Stock Problem.” Engineering Optimization 44: 657–672. doi: 10.1080/0305215X.2011.600757
   Web of Science ®Google Scholar
• Cui, Y. 2013. “Heuristic for Two-Dimensional Homogeneous Two-Segment Cutting Patterns.” Engineering Optimization 45: 89–105. doi: 10.1080/0305215X.2012.658784
   Web of Science ®Google Scholar
• Cui, Y., and Z. Liu. 2011. “C-Sets-Based Sequential Heuristic Procedure for the One-Dimensional Cutting Stock Problem with Pattern Reduction.” Optimization Methods and Software 26: 155–167. doi: 10.1080/10556780903420531
   Web of Science ®Google Scholar
• Cui, Y., and Y. Yang. 2010. “A Heuristic for the One-Dimensional Cutting Stock Problem with Usable Leftover.” European Journal of Operational Research 204: 245–250. doi: 10.1016/j.ejor.2009.10.028
   Web of Science ®Google Scholar
• Dikili, A. C., A. C. Takinaci, and A. N. Pek. 2008. “A New Heuristic Approach to One-Dimensional Stock-Cutting Problems with Multiple Stock Lengths in Ship Production.” Ocean Engineering 35: 637–645. doi: 10.1016/j.oceaneng.2008.01.003
   Web of Science ®Google Scholar
• Dyckoff, H. 1990. “A Typology of Cutting and Packing Problems.” European Journal of Operational Research 44: 145–159. doi: 10.1016/0377-2217(90)90350-K
   Web of Science ®Google Scholar
• Eshghi, K., and H. Javanshir. 2008. “A Revised Version of Ant Colony Algorithm for One-Dimensional Cutting Stock Problem.” International Journal of Industrial Engineering 15: 341–348.
   Web of Science ®Google Scholar
• Gilmore, P. C., and R. E. Gomory. 1963. “A Linear Programming Approach to the Cutting Stock Problem—Part II.” Operations Research 11: 863–888. doi: 10.1287/opre.11.6.863
   Web of Science ®Google Scholar
• Haessler, R. W. 1975. “Controlling Cutting Pattern Changes in One-Dimensional Trim Problems.” Operations Research 23: 483–493. doi: 10.1287/opre.23.3.483
   Web of Science ®Google Scholar
• Holthaus, O. 2002. “Decomposition Approaches for Solving the Integer One-Dimensional Cutting Stock Problem with Different Types of Standard Lengths.” European Journal of Operational Research 141: 295–312. doi: 10.1016/S0377-2217(02)00126-1
   Web of Science ®Google Scholar
• Mukhacheva, A. E., G. Belov, M. V. Kartack, and S. A. Mukhacheva. 2000. “Linear One-Dimensional Cutting-Packing Problems: Numerical Experiments with the Sequential Value Correction Method (SVC) and a Modified Branch-and-Bound Method (MBB).” Pesquisa Operacional 20: 153–168. doi: 10.1590/S0101-74382000000200002
   Google Scholar
• Poldi, C. K., and N. M. Arenales. 2009. “Heuristics for the One-Dimensional Cutting Stock Problem with Limited Multiple Lengths.” Computers and Operations Research 36: 2074–2081. doi: 10.1016/j.cor.2008.07.001
   Web of Science ®Google Scholar
• Shahin, A. A., and O. M. Salem. 2004. “Using Genetic Algorithms in Solving the One-Dimensional Cutting Stock Problem in the Construction Industry.” Canadian Journal of Civil Engineering 31: 321–332. doi: 10.1139/l03-101
   Web of Science ®Google Scholar
• Umetani, S., M. Yagiura, and T. Ibaraki. 2003. “One-Dimensional Cutting Stock Problem to Minimize the Number of Different Patterns.” European Journal of Operational Research 146: 388–402. doi: 10.1016/S0377-2217(02)00239-4
   Web of Science ®Google Scholar
• Yang, C.-T., T.-C. Sung, and W.-C. Weng. 2006. “An Improved Tabu Search Approach with Mixed Objective Function for One-Dimensional Cutting Stock Problems.” Advances in Engineering Software 37: 502–513. doi: 10.1016/j.advengsoft.2006.01.005
   Web of Science ®Google Scholar