Solving a real world steel stacking problem

Sebastian Raggl, Andreas Beham, Fabien Tricoire and Michael Affenzeller

International Journal of Service and Computing Oriented Manufacturing, 2018, vol. 3, issue 2/3, 94-108

Abstract: We present a real world steel slab stacking problem. The problem features continuous production and retrieval and non-instantaneous crane movements. There are stacking constraints, based on dimensions, weight and temperature of the slabs and temporal constraints based on the casting schedule, the delivery due times as well as the availability of rolling pallets for transport. We present a prioritisation heuristic for the possible crane movements. Based on this heuristic we build a branch and bound solver as well as a greedy look-ahead heuristic. We evaluate the heuristics using randomly generated problem instances of various sizes with the same characteristics as the real world problem and find that the greedy look-ahead heuristic outperforms the branch and bound approach when using realistic time limits.

Keywords: steel stacking; stacking problem; branch and bound; greedy heuristic; stacking constraints; continous production and retrieval. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=91621 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijscom:v:3:y:2018:i:2/3:p:94-108

Access Statistics for this article

More articles in International Journal of Service and Computing Oriented Manufacturing from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().