【摘要】 研究了带有安全距离约束的无交叉岸桥调度问题。其中,安全距离指相邻岸桥同时作业时必须间隔一定数量的船舱,目标是极小化轮船的装卸时间。并对岸桥带有1个船舱安全距离的2台和3台情景设计了调度算法,并证明了算法的最坏情况界分别为4/3和3/2。更多还原

【Abstract】 This paper investigates quay cranes(QCs)scheduling with both non-crossing constraints and safety margins between QCs,where a safety margin signifies a certain number of in-between holds between adjacent QCs.The goal is to minimize the overall loading or unloading time of a vessel.Approximation algorithms are designed for two and three QCs with one-hold safety margins,where the worst case ratios are proven to be 4/3 and 3/2 respectively.更多还原