Cutting optimization with variable-sized stock and inventory status data
From MaRDI portal
Publication:4468878
DOI10.1080/00207540210128161zbMath1044.90026OpenAlexW2130643350MaRDI QIDQ4468878
Publication date: 11 June 2004
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540210128161
Related Items (6)
An improved typology of cutting and packing problems ⋮ One-dimensional stock cutting: optimization of usable leftovers in consecutive orders ⋮ A two-objective mathematical model without cutting patterns for one-dimensional assortment problems ⋮ Renovation of the cutting stock process ⋮ Optimization of a line-cutting procedure for ship hull construction by an effective tabu search ⋮ The one-dimensional cutting stock problem with usable leftovers -- a survey
Uses Software
Cites Work
- Unnamed Item
- A new version of on-line variable-sized bin packing
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- A typology of cutting and packing problems
- Variable Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- Computing Partitions with Applications to the Knapsack Problem
This page was built for publication: Cutting optimization with variable-sized stock and inventory status data