...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Applied Mathematical Modelling >Yard crane scheduling in port container terminals
【24h】

Yard crane scheduling in port container terminals

机译：港口集装箱码头的堆场起重机调度

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Yard cranes are the most popular container handling equipment for loading containers onto or unloading containers from trucks in container yards of land scarce port container terminals. However, such equipment is bulky, and very often generates bottlenecks in the container flow in a terminal because of their slow operations. Hence, it is essential to develop good yard crane work schedules to ensure a high terminal throughput. This paper studies the problem of scheduling a yard crane to perform a given set of loading/unloading jobs with different ready times. The objective is to minimize the sum of job waiting times. A branch and bound algorithm is proposed to solve the scheduling problem optimally. Efficient and effective algorithms are proposed to find lower bounds and upper bounds. The performance of the proposed branch and bound algorithm is evaluated by a set of test problems generated based on real life data. The results show that the algorithm can find the optimal sequence for most problems of realistic sizes.
机译：堆场起重机是最普遍的集装箱装卸设备，用于在缺乏土地的港口集装箱码头的集装箱堆场中将集装箱装到卡车上或从卡车上卸下集装箱。但是，这样的设备笨重，并且由于操作缓慢而经常在终端的集装箱流中产生瓶颈。因此，必须制定良好的堆场起重机工作计划，以确保较高的码头吞吐量。本文研究了安排堆场起重机在不同准备时间执行一组给定的装/卸作业的问题。目的是使工作等待时间的总和最小化。提出了一种分支定界算法，以最优地解决调度问题。提出了一种有效和有效的算法来找到下界和上限。所提出的分支定界算法的性能是通过根据实际数据生成的一组测试问题来评估的。结果表明，该算法可以为大多数实际大小的问题找到最优序列。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号