文档介绍：附录
英文原文
Crane Scheduling with Spatial Constraints
Andrew Lim, Brian Rodrigues, Fei Xiao, and Yi Zhu
Abstract
In this work, we examine port crane scheduling with spatial and separation constraints. mon to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane-to-job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform pared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times.
1 Introduction
The Port of Singapore Authority (PSA) is a large port operator located in Singapore, one of the busiest ports in the world. PSA handles million TEU’s annually or nine percent of global container traffic in Singapore, the world’s largest transshipment hub. PSA is concerned with maximizing throughput at its port due to limited port size, high cargo transshipment volumes and limited physical facilities and equipment . Crane scheduling and work schedules are critical in port management since cranes are at the interface between land and water sections of any port, each with its own traffic lanes, intersections, and vehicle flow control systems. In this multi-channel interface we are likely to find bottlenecks where cranes and other cargo-handling equipment (forklifts, conveyors etc.) converge.
Sabria and Daganzo studied port operations which focused on berthing and cargo-handling systems. In berthing, which is a widely-analyzed port activity, queuing theory has been used widely. Traffic and vehicle-flow scheduling on land in ports has also been well studied. Danganzo studied a static crane scheduling case where cranes could move