The cutting stock problem for large sections in the iron and steel industries

DOI10.1016/0377-2217(85)90247-4zbMath0572.90048OpenAlexW1996347155MaRDI QIDQ1062609

N. Ueno, H. Tokuyama

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90247-4

zbMATH Keywords

production schedulingcutting stockheuristic methodone-dimensional cuttingtwo-phase algorithmlarge-section production systemnearly optimal solutionsoptimal stock selection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (5)

An approximation algorithm for solving unconstrained two-dimensional knapsack problems ⋮ Knowledge based approach to the cutting stock problem ⋮ A nested column generation algorithm to the meta slab allocation problem in the steel making industry ⋮ Heuristic methods and applications: A categorized survey ⋮ The cutting stock problem for large sections in the iron and steel industries

Cites Work

• The cutting stock problem for large sections in the iron and steel industries
• The Trim Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem

This page was built for publication: The cutting stock problem for large sections in the iron and steel industries