A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading

DOI10.1016/S0377-2217(98)00035-6zbMath0946.90114MaRDI QIDQ1809825

Francis J. Vasko, Kenneth L. jun. Stott, Dennis D. Newhart

Publication date: 25 November 1999

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

zbMATH Keywords

heuristicscutting stockmetals application

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX^® ⋮ Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners ⋮ A nested column generation algorithm to the meta slab allocation problem in the steel making industry ⋮ Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches

Cites Work

• A real-time one-dimensional cutting stock algorithm for balanced cutting patterns
• One-dimensional cutting stock decisions for rolls with multiple quality grades
• A Linear Programming Approach to the Cutting-Stock Problem
• A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading