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

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

0.00 Avg rating0 Votes
Article ID: iaor20001582
Country: Netherlands
Volume: 114
Issue: 1
Start Page Number: 72
End Page Number: 82
Publication Date: Apr 1999
Journal: European Journal of Operational Research
Authors: , ,
Keywords: heuristics
Abstract:

In the steel industry, as hot steel products exit the producing facility, they are cut at primary saws (hotsaws) into shorter pieces. After these prices cool, they are inspected for defects and either applied directly to customer orders or are further cut to ordered lengths at secondary saws (cold saws). In this case study, we will describe a hierarchical algorithm, DYNACUT_CS, that efficiently and effectively generates cutting patterns for material that is to be cut at cold saws. DYNACUT_CS strives to maximize yield over all the material cut and simultaneously tries to minimize overgrading (applying higher quality material than specified by the customer). An example will be given to illustrate how the algorithm works. This approach has been implemented for a variety of products at several different Bethlehem Steel Corporation facilities.

Reviews

Required fields are marked *. Your email address will not be published.