Solving a real world steel stacking problem
by Sebastian Raggl; Andreas Beham; Fabien Tricoire; Michael Affenzeller
International Journal of Service and Computing Oriented Manufacturing (IJSCOM), Vol. 3, No. 2/3, 2018

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.

Online publication date: Tue, 08-May-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Service and Computing Oriented Manufacturing (IJSCOM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com