One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
From MaRDI portal
Publication:2803255
DOI10.1111/ITOR.12134zbMATH Open1338.90332OpenAlexW2106915499MaRDI QIDQ2803255FDOQ2803255
Authors: Claudio Arbib, Fabrizio Marinelli, P. 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
Recommendations
- A new model for complete solutions to one-dimensional cutting stock problems.
- One-dimensional cutting stock problems and solution procedures
- New integer programming formulations and an exact algorithm for the ordered cutting stock problem
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Optimal Integer Solutions to Industrial Cutting Stock Problems
Cites Work
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- A Linear Programming Approach to the Cutting-Stock Problem
- Selected Topics in Column Generation
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- An integrated cutting stock and sequencing problem
- Setup and open-stacks minimization in one-dimensional stock cutting
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- On the choice of explicit stabilizing terms in column generation
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- On the one-dimensional stock cutting problem in the paper tube industry
- Cutting and Reuse: An Application from Automobile Component Manufacturing
- Exact and asymptotically exact solutions for a class of assortment problems
Cited In (12)
- Arc-flow formulations for the one-dimensional cutting stock problem with multiple manufacturing modes
- New integer programming formulations and an exact algorithm for the ordered cutting stock problem
- Alternative configurations for cutting machines in a tube cutting mill
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization
- 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
- A new model for complete solutions to one-dimensional cutting stock problems.
- 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
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- One-dimensional stock cutting resilient against singular random defects
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803255)
