起重机调度与空间限制—外文翻译.docVIP

附录 英文原文 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. Although common 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 ?nd 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 well compared 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 17.04 million TEU’s annually or nine percent of global container tra?c 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 tra?c lanes, intersections, and vehicle ?ow control systems. In this multi-channel interface we are likely to ?nd 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. Tra?c and vehicle-?ow scheduling on land in ports has also been well studied. Danganzo studied a static crane scheduling case where cran