【摘要】 主要研究一类集成岸桥分派的在线泊位分配问题.考虑了3个连续泊位、4台岸桥的情形,以极小化集装箱货轮的总处理(装载、卸载任务)时间为目标函数,证明了最好可能的在线分派方案是2-2-0,并设计了竞争比为5/4的最优在线泊位分配算法.更多还原

【Abstract】 This paper studies an online over-list model of integrated allocation of 3 berths and 4 quay cranes in a container terminal.The objective is to minimize the maximum completion time for loading or unloading container vessels.It proves that 2-2-0is the best possible quay cranes assignment(QCA)scheme for online berth allocation.In addition,an optimal online algorithm with competitive ratio 5/4 is provided.更多还原