An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach
From MaRDI portal
Publication:3804426
DOI10.1057/jors.1988.130zbMath0656.90042OpenAlexW1963764072MaRDI QIDQ3804426
Publication date: 1988
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1988.130
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Production models (90B30) Dynamic programming (90C39)
Related Items (7)
Bun splitting: a practical cutting stock problem ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects ⋮ An exact model for a slitting problem in the steel industry ⋮ Composite stock cutting through simulated annealing ⋮ Knowledge based approach to the cutting stock problem ⋮ Integrated defect detection and optimization for cross cutting of wooden boards
This page was built for publication: An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach
