Combined cutting stock and lot-sizing problem with pattern setup
From MaRDI portal
Publication:1652627
DOI10.1016/j.cor.2018.02.016zbMath1458.90674OpenAlexW2789287767WikidataQ130185502 ScholiaQ130185502MaRDI QIDQ1652627
Zhili Zhou, Ning Ma, Chengbin Chu, Ya Liu
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.02.016
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
An analysis of the integrated lot-sizing and cutting-stock problem formulation ⋮ 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 ⋮ 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 ⋮ Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries ⋮ Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
Uses Software
Cites Work
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- The combined cutting stock and lot-sizing problem in industrial processes
- A coupling cutting stock-lot sizing problem in the paper industry
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- The one-dimensional cutting stock problem with due dates
- An LP-based approach to a two-stage cutting stock problem
- The trim-loss and assortment problems: A survey
- Packing problems
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- Pattern minimisation in cutting stock problems
- A combined cutting-stock and lot-sizing problem
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Pattern reduction in one-dimensional cutting stock problems
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems
- A Cutting Stock and Scheduling Problem in the Copper Industry
This page was built for publication: Combined cutting stock and lot-sizing problem with pattern setup
