Journal
NAVAL RESEARCH LOGISTICS
Volume 58, Issue 7, Pages 619-636Publisher
WILEY
DOI: 10.1002/nav.20471
Keywords
container terminal; quay crane scheduling; crane time windows
Categories
Funding
- German Academic Exchange Service (DAAD) [D/09/49358]
Ask authors/readers for more resources
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
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available