Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
From MaRDI portal
Publication:2003581
DOI10.1016/j.cor.2019.05.013zbMath1458.90552OpenAlexW2946432934WikidataQ127891532 ScholiaQ127891532MaRDI QIDQ2003581
Publication date: 9 July 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.05.013
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)
Related Items (7)
A residual recombination heuristic for one-dimensional cutting stock problems ⋮ 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 ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ 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 ⋮ Unnamed Item
Uses Software
Cites Work
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
- A fix-and-optimize heuristic for the high school timetabling problem
- Solution approaches for the cutting stock problem with setup cost
- A linear optimization approach to the combined production planning model
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
- Classification and literature review of integrated lot-sizing and cutting stock problems
- The combined cutting stock and lot-sizing problem in industrial processes
- A coupling cutting stock-lot sizing problem in the paper industry
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- The trim-loss and assortment problems: A survey
- Packing problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
- Combined cutting stock and lot-sizing problem with pattern setup
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- LP models for bin packing and cutting stock problems
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Pattern minimisation in cutting stock problems
- A combined cutting-stock and lot-sizing problem
- Furniture supply chain tactical planning optimization using a time decomposition approach
- An improved typology of cutting and packing problems
- Mathematical Methods of Organizing and Planning Production
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- A Linear Programming Approach to the Cutting-Stock Problem
- 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
- Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
This page was built for publication: Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
