期刊
NAVAL RESEARCH LOGISTICS
卷 58, 期 7, 页码 619-636出版社
WILEY
DOI: 10.1002/nav.20471
关键词
container terminal; quay crane scheduling; crane time windows
资金
- German Academic Exchange Service (DAAD) [D/09/49358]
The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time windows. The problem is of practical relevance, because container terminal operators frequently redeploy cranes among vessels to speed up the service of high-priority vessels while serving low-priority vessels casually. This article provides a mathematical formulation of the problem and a tree-search-based heuristic solution method. A computational investigation on a large set of test instances is used to evaluate the performance of the heuristic and to identify the impact of differently structured crane time windows on the achievable vessel handling time. (C) 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 619-636,2011
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据