p.1542
p.1546
p.1550
p.1555
p.1559
p.1563
p.1567
p.1571
p.1575
Heuristic Algorithm for Solving Multi-Crane Scheduling in Steel Coil Warehouse
Abstract:
We consider a multi-crane scheduling problem commonly encountered in real warehouse operations in steel enterprises. Given some demanded coils, if a demanded coil is in upper level or in lower level without being blocked, it can be picked up directly to designated place; else, the blocking coils need to be picked up to another position first. Unlike previous literatures in which both operations have been considered to be scheduled separately, our problem schedules transportation operation and shuffling operation coordinately. The objective is to minimize the last demanded coil transported to its designated place which is consistent with the earliest possible completion time of one crane. We propose a heuristic algorithm for solving this demonstrated strongly NP-hard.
Info:
Periodical:
Pages:
1559-1562
Citation:
Online since:
March 2014
Authors:
Price:
Сopyright:
© 2014 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: