Abstract
An important problem for a steel company is the assigning of slabs, i.e. semi-finished rectangular pieces of steel, to customer orders. Due to its discrete nature, the prolem can be formulated as a zero-one integer programming problem; however, real-world problems are too large (12,000–16,000 zero-one variable) to be solved exactly in a reasonable amount of computer time. In this paper we present a transportation formulation for this problem that can be efficiently solved using a network code of Bertsekas. Then, using rounding heuristics, the transportation solution can be transformed into a practical solution. An example is used to illustrate this approach. Empirical results indicate that excellent (low-cost) practical solutions can be generated for large-scale (300 orders and 3000 slabs) problems in less than 1 min on a 386 PC (25 MHZ).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.