One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model

DOI10.1111/ITOR.12134zbMath1338.90332OpenAlexW2106915499MaRDI QIDQ2803255

Claudio Arbib, Fabrizio Marinelli, Paolo Ventura

Publication date: 4 May 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12134

zbMATH Keywords

integer linear programmingcutting stockpattern sequencingopen stacks

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (7)

Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ A heuristic for the skiving and cutting stock problem in paper and plastic film industries ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ Cutting stock with no three parts per pattern: work-in-process and pattern minimization ⋮ Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches ⋮ Models for two-dimensional bin packing problems with customer order spread

Cites Work

• On the one-dimensional stock cutting problem in the paper tube industry
• On the choice of explicit stabilizing terms in column generation
• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
• An integrated cutting stock and sequencing problem
• Mathematical Methods of Organizing and Planning Production
• Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
• Exact and Asymptotically Exact Solutions for a Class of Assortment Problems
• A Linear Programming Approach to the Cutting-Stock Problem
• Cutting and Reuse: An Application from Automobile Component Manufacturing
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• Selected Topics in Column Generation
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model