Crane scheduling in a warehouse storing steel coils

Lixin Tang, Xie Xie and Jiyin Liu

IISE Transactions, 2014, vol. 46, issue 3, 267-282

Abstract: This article studies a single-crane scheduling problem in a warehouse where steel coils are stored in two levels. A given set of coils is to be retrieved from their designated places. If a required coil at the lower level is blocked by one or two coils at the upper level, to retrieve it, the blocking coils must be first moved to other positions. The considered problem is to determine the new positions and the required crane movements so that all coils are retrieved in the shortest possible time. A mixed-integer linear programming model is formulated for the problem and a sequential solution approach is implemented. A dynamic programming algorithm is proposed for optimally solving a restricted case. Based on the analysis of a special case, a heuristic algorithm is proposed for the general case and its worst-case performance is analyzed. The average performances of the solution approaches are computationally evaluated. The results show that the proposed heuristic algorithms are capable of generating good quality solutions.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2013.802841 (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:taf:uiiexx:v:46:y:2014:i:3:p:267-282

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2013.802841

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().