Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
From MaRDI portal
Publication:319143
DOI10.1016/j.ejor.2014.12.015zbMath1346.90610OpenAlexW1964475202MaRDI QIDQ319143
Yaodong Cui, Yi Yao, Cheng Zhong
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.015
Related Items (11)
The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production ⋮ 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 cutting stock problem with sequence dependent setup times ⋮ Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries ⋮ Heuristic algorithms based on column generation for an online product shipping problem ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Mathematical models for the minimization of open stacks problem ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems
Uses Software
Cites Work
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- Solution approaches for the cutting stock problem with setup cost
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Random search in the one-dimensional cutting stock problem
- One-dimensional cutting stock problem to minimize the number of different patterns
- The one-dimensional cutting stock problem with usable leftovers -- a survey
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- 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
- Pattern reduction in one-dimensional cutting stock problems
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
This page was built for publication: Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
