Abstract: In the past, the quay crane operations have been well studied. There were a certain number of scheduling algorithms for quay crane operations, but without considering some nuisance factors that might disrupt the quay crane operations. For example, bad grapples make a crane unable to load or unload containers or a sudden strong breeze stops operations temporarily. Although these disruptive conditions randomly occur, they influence the efficiency of quay crane operations. The disruption is not considered in the operational procedures nor is evaluated in advance for its impacts. This study applies simulation and optimization approaches to develop structures of pre-analysis and post-analysis for the Quay Crane Scheduling Problem to deal with disruptive scenarios for quay crane operation. Numerical experiments are used for demonstrations for the validity of the developed approaches.
Abstract: This research aims to develop an algorithm to
generate a schedule of multiple cranes that will maximize load
throughputs in anodizing operation. The algorithm proposed utilizes
an enumerative strategy to search for constant time between
successive loads and crane covering range over baths. The computer
program developed is able to generate a near-optimal crane schedule
within reasonable times, i.e. within 10 minutes. Its results are
compared with existing solutions from an aluminum extrusion
industry. The program can be used to generate crane schedules for
mixed products, thus allowing mixed-model line balancing to
improve overall cycle times.