Solution approaches for the cutting stock problem with setup cost
From MaRDI portal
(Redirected from Publication:339571)
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
Cites work
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- 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
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A typology of cutting and packing problems
- An improved typology of cutting and packing problems
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- 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
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- Fixed charge problems with identical fixed charges
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- LP models for bin packing and cutting stock problems
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Multistage Cutting Stock Problems of Two and More Dimensions
- One-dimensional cutting stock problem to minimize the number of different patterns
- Optimization of wafer exposure patterns using a two-dimensional cutting algorithm
- Pattern minimisation in cutting stock problems
- Pattern reduction in one-dimensional cutting stock problems
- Setup and open-stacks minimization in one-dimensional stock cutting
- Setup minimising conditions in the trim loss problem
Cited in
(24)- The stochastic trim-loss problem
- Combined cutting stock and lot-sizing problem with pattern setup
- Two-dimensional cutting stock problem with sequence dependent setup times
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- Optimal solutions for the cutting stock problem
- 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
- Formulations and theoretical analysis of the one-dimensional multi-period 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
- 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
- The one-dimensional cutting stock problem with sequence-dependent cut losses
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
- Mathematical and computational model for the efficient solution of two-dimensional (2D) material cutting problems using integer linear programming
- A nonlinear cutting stock problem
- Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries
- Mathematical models for the cutting stock with limited open stacks problem
- A cutting stock problem in the wood products industry: a two‐stage solution approach
- Random-key optimizer with reinforcement learning for the capacitated multi-period cutting stock problem with setup cost
- Mathematical models for the one-dimensional cutting stock problem with setups and open stacks
- Nonlinear cutting stock problem model to minimize the number of different patterns and objects
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)
