Solution approaches for the cutting stock problem with setup cost
From MaRDI portal
Publication:339571
DOI10.1016/J.COR.2012.06.007zbMATH Open1349.90571OpenAlexW2157658483MaRDI QIDQ339571FDOQ339571
Authors: Azadeh Mobasher, Ali Ekici 
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.06.007
Recommendations
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Title not available (Why is that?)
- A Linear Programming Approach to the Cutting-Stock Problem
- An improved typology of cutting and packing problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact solution of bin-packing problems using column generation and branch-and-bound
- LP models for bin packing and cutting stock problems
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Pattern reduction in one-dimensional cutting stock 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
- Multistage Cutting Stock Problems of Two and More Dimensions
- A typology of cutting and packing problems
- Pattern minimisation in cutting stock problems
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- One-dimensional cutting stock problem to minimize the number of different patterns
- Setup and open-stacks minimization in one-dimensional stock cutting
- C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- Setup minimising conditions in the trim loss problem
- Optimization of wafer exposure patterns using a two-dimensional cutting algorithm
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- Fixed charge problems with identical fixed charges
Cited In (17)
- Nonlinear cutting stock problem model to minimize the number of different patterns and objects
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- Alternative configurations for cutting machines in a tube cutting mill
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries
- A cutting stock problem in the wood products industry: a two‐stage solution approach
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
- The stochastic trim-loss problem
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- One-dimensional stock cutting: optimization of usable leftovers in consecutive orders
- Title not available (Why is that?)
- The one-dimensional cutting stock problem with sequence-dependent cut losses
- Optimal solutions for the cutting stock problem
- Two-dimensional cutting stock problem with sequence dependent setup times
This page was built for publication: Solution approaches for the cutting stock problem with setup cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339571)
