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

DOI10.1111/ITOR.12134MaRDI QIDQ2803255zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

integer linear programmingcutting stockpattern sequencingopen stacks

Mathematics Subject Classification ID

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

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

• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Linear Programming Approach to the Cutting-Stock Problem
• An integrated cutting stock and sequencing problem
• Cutting and Reuse: An Application from Automobile Component Manufacturing
• Exact and asymptotically exact solutions for a class of assortment problems
• Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
• 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
• On the one-dimensional stock cutting problem in the paper tube industry
• Selected Topics in Column Generation
• Setup and open-stacks minimization in one-dimensional stock cutting
• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows

Cited in

(13)

• Models for two-dimensional bin packing problems with customer order spread
• Arc-flow formulations for the one-dimensional cutting stock problem with multiple manufacturing modes
• 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
• A heuristic for the skiving and cutting stock problem in paper and plastic film industries
• One-dimensional stock cutting resilient against singular random defects
• A cutting stock problem in the wood products industry: a two‐stage solution approach
• Alternative configurations for cutting machines in a tube cutting mill
• New integer programming formulations and an exact algorithm for the ordered cutting stock problem
• A new model for complete solutions to one-dimensional cutting stock problems.
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• Mathematical models for the cutting stock with limited open stacks problem
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems

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)