Scheduling co-operating stacking cranes with predetermined container sequences

Scheduling co-operating stacking cranes with predetermined container sequences
复制标题

DOI:
10.1016/j.dam.2015.07.042
复制
发表时间:
2016-03
期刊:
Discret. Appl. Math.
影响因子:
--
通讯作者:
D. Briskorn;Panagiotis Angeloudis
D. Briskorn;Panagiotis Angeloudis
中科院分区:
其他
文献类型:
--
作者:
D. Briskorn;Panagiotis Angeloudis

文献摘要

被引文献

相似文献

随着多门式自动化堆垛起重机的普及,集装箱码头本已困难的起重机调度问题变得更加具有挑战性。在本文中,我们提出了一种有效的算法,它可以解决在这种情况下产生的子问题,即一旦分配了运输任务,起重机龙门运动的优先顺序。我们解决了双吊和交叉吊的设置问题,并开发了相应的图形模型和强多项式算法。一系列的实验表明,该方法能够以极小的运行时间产生最优解。
With the proliferation of multi-gantry automated stacking cranes, the already difficult crane scheduling problem in container terminals has become even more challenging. In this paper we present an efficient algorithm that can solve a sub-problem that arises in this context, namely the prioritization of crane gantry movements once transportation tasks have been assigned. We tackle this problem for both, twin crane setting and crossover crane setting, and develop graphical models and strongly polynomial algorithms accordingly. A series of experiments is carried out where it is shown that the method can produce optimum solutions with exceptionally small run times.