Current Issue

Optimal Job Scheduling of Multiple Rail Cranes in Rail Stations

Nguyen Vu Anh Duy1, Nguyen Le Thai2

 DOI : https://dx.doi.org/10.31142/rajar/v4i6.05

 Author's Affiliations

1,2Faculty of Mechanical Engineering Technology, Ho Chi Minh City University of Food Industry, Ho Chi Minh City, Vietnam


 

ABSTRACT

This paper considers the scheduling problem of multiple rail cranes to load and unload inbound and outbound containers to and from wagons of trains within rail stations. We not only assign working areas to cranes, but also determine the job sequence of each crane. We minimize the maximum completion time (makespan) of all rail cranes. Dual-cycle operations of cranes are applied and the re-handling work of containers is also considered. A branch-and-bound algorithm is developed to find an optimal solution. A simulated annealing algorithm is designed to obtain near optimal solutions of large-sized problems. Numerical examples are studied to investigate the performance of these algorithms.