An effective solution for a real cutting stock problem in manufacturing plastic rolls

DOI10.1007/s10479-008-0407-1zbMath1163.90745OpenAlexW2000390652WikidataQ57587887 ScholiaQ57587887MaRDI QIDQ1026560

Camino R. Vela, Jorge Puente, Inés González-Rodríguez, Ramiro Varela, María R. Sierra

Publication date: 25 June 2009

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10651/6062

zbMATH Keywords

multi-objective optimizationmeta-heuristicsrandomized algorithmscutting stockiterative sequential heuristics

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Cutting stock problems and solution procedures
• A simulated annealing heuristic for the one-dimensional cutting stock problem
• Random search in the one-dimensional cutting stock problem
• Evaluation of algorithms for one-dimensional cutting
• Optimal solutions for the cutting stock problem
• LP models for bin packing and cutting stock problems
• One-dimensional cutting stock problem to minimize the number of different patterns
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
• A Linear Programming Approach to the Cutting-Stock Problem
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: An effective solution for a real cutting stock problem in manufacturing plastic rolls