期刊
COMPUTERS & OPERATIONS RESEARCH
卷 39, 期 12, 页码 2915-2928出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2012.02.013
关键词
Container terminal operation; Quay crane scheduling
类别
资金
- National Natural Science Foundation of China [71171130, 70771065]
- National High Technology Research and Development Program of China (863 Program) [2009AA043000, 2009AA043001]
Quay cranes (QC) are key resources at container terminals, and the efficiency of QC operations is vital for terminal productivity. The Quay Crane Scheduling Problem (QCSP) is to schedule the work activities for a set of cranes assigned to a single berthed vessel with the objective of minimizing the completion time of all container handling tasks. The problem is complicated by special characteristics of QC operations. Considering QC moving time and interference constraints, the concept of contiguous bay operations is proposed and a heuristic is developed to generate QC schedules with this feature. The heuristic is efficient and effective: it has polynomial computational complexity, and it produces schedules with a completion time objective bounded above by a small increment over the optimal completion time. Importantly, the heuristic guarantees that no quay cranes are idle due to interference. Numerical experiments demonstrate that the optimality gap is small for practical instances. (C) 2012 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据