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

Abstract

We confront a practical cutting stock problem from a production plant of plastic rolls. The problem is a variant of the well-known one dimensional cutting stock, with particular constraints and optimization criteria defined by the experts of the company. We start by giving a problem formulation in which optimization criteria have been considered in linear hierarchy according to expert preferences, and then propose a heuristic solution based on a GRASP algorithm. The generation phase of this algorithm solves a simplified version which is rather similar to the conventional one dimensional cutting stock. To do that, we propose a Sequential Heuristic Randomized Procedure (SHRP). Then in the repairing phase, the solution of the simplified problem is transformed into a solution to the real problem. For experimental study we have chosen a set of problem instances of com-mon use to compare SHRP with another recent approach. Also, we show by means of examples, how our approach works over instances taken from the real production process.

Pricing-based primal and dual bounds for selected packing problems

“…• [129] presents a 1D-CSP arising in a plastic manufacturing facility, with five objective functions hierarchically ranked, some technical parameters related to the employed cutting machines and order priorities. A GRASP algorithm with a call to a sequential heuristic procedure is implemented.…”

El Problema de patrones de corte, clasificación y enfoques/Cutting stock problem, classification and approaches

“…Sus primeros intentos para resolverlo fueron a través de métodos analíticos; donde en un principio determinaron los patrones de corte posibles, que son descritos como el número de referencias de cada tipo que se cortan en longitudes estándar; posteriormente, la solución se logró utilizando un modelo matemático basado en estos patrones [9]. Este modelo tiene como objetivo minimizar el desperdicio generado por la operación de corte, para lo cual se hace necesario encontrar una combinación óptima de corte a través de patrones de corte [1].…”

A Multi-Objective Genetic Algorithm for Cutting-Stock in Plastic Rolls Industry

“…This is because the setup cost between two consecutive cuts A k and A l of the main problem is null if both A k and A l belongs to the same equivalence class E j . To solve this simplified problem, in (Puente et al 2005 andVarela et al 2007) we have proposed a GRASP algorithm. Then, the solution given by this algorithm is transformed into a solution to the main problem by a greedy algorithm that assigns items to actual orders so as to optimize objectives 2, 3, and 4 in hierarchical order, while keeping the values of the first two objectives.…”