One-dimensional stock cutting: optimization of usable leftovers in consecutive orders
From MaRDI portal
Publication:2401325
DOI10.1007/s10100-017-0466-yzbMath1370.90311OpenAlexW2575832905MaRDI QIDQ2401325
Publication date: 8 September 2017
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-017-0466-y
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Combinatorial optimization (90C27)
Related Items (8)
Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers ⋮ The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ A stochastic programming approach to the cutting stock problem with usable leftovers ⋮ The cutting stock problem applied to the hardening process in an automotive spring factory ⋮ An exact model for a slitting problem in the steel industry ⋮ Editorial
Uses Software
Cites Work
- Unnamed Item
- A hybrid algorithm for constrained order packing
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- Solution approaches for the cutting stock problem with setup cost
- The constrained compartmentalized knapsack problem: mathematical models and solution methods
- One-dimensional cutting stock optimization in consecutive time periods
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- The one-dimensional cutting stock problem with usable leftover - a heuristic approach
- A sequential heuristic procedure for one-dimensional cutting
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Setup minimising conditions in the trim loss problem
- Optimization of roll cutting in clothing industry
- Efficient algorithms for real-life instances of the variable size bin packing problem
- The one-dimensional cutting stock problem with usable leftovers -- a survey
- Roll assortment optimization in a paper mill: an integer programming approach
- A heuristic for the one-dimensional cutting stock problem with usable leftover
- Mathematical Methods of Organizing and Planning Production
- A Linear Programming Approach to the Cutting-Stock Problem
- Cutting and Reuse: An Application from Automobile Component Manufacturing
- A note on handling residual lengths
- The One Dimensional Cutting Stock Problem Using Two Objectives
- Cutting optimization with variable-sized stock and inventory status data
- The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic
This page was built for publication: One-dimensional stock cutting: optimization of usable leftovers in consecutive orders