院子
调度(生产过程)
线性规划
动态优先级调度
计算机科学
整数规划
运筹学
数学优化
作业车间调度
工程类
实时计算
计算机网络
算法
数学
布线(电子设计自动化)
物理
量子力学
服务质量
作者
Yong Chun Wu,Wenkai Li,Matthew E.H. Petering,Mark Goh,Robert de Souza
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:2015-08-25
卷期号:49 (4): 990-1005
被引量:74
标识
DOI:10.1287/trsc.2015.0641
摘要
Container terminals require robust scheduling algorithms for yard cranes to optimally determine the sequence of storage and retrieval operations in yard blocks for higher container terminal performance. This paper investigates the multiple yard crane scheduling problem within a generic yard block and considers the operational restrictions such as the crane noncrossing constraint and models the crane travel time realistically. Further, the fact that any two adjacent cranes must keep an operational safety distance is also taken into consideration. These physical constraints limit the mobility of yard cranes and greatly render the scheduling difficulty for such pieces of equipment. This paper proposes a clustering-reassigning approach, which fully considers all of the operational constraints in practice. The complexity of the approach is o(n3), where n is the number of container moves to be scheduled, making it suitable for real-time scheduling. Numerical experiments and benchmark with a continuous time-based mixed-integer linear programming model indicate that the clustering-reassigning approach can provide satisfactory near optimal solutions for different sets of test cases in a real-time scheduling context.
科研通智能强力驱动
Strongly Powered by AbleSci AI