Optimal Job Scheduling of Multiple Rail Cranes in Rail Stations

DATE PUBLISHED
June 7, 2018
SECTION
Articles

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.

Keywords

Branch and bound; simulated annealing; rail crane; scheduling

References

Alicke, Knut. 2002. "Modeling and optimization of the intermodal terminal Mega Hub." OR Spectrum 24 (1):1-18.

Boysen, N., and M. Fliedner. 2010. "Determining crane areas in intermodal transshipment yards: The yard partition problem." European Journal of Operational Research 204 (2):336-342.

Boysen, N., M. Fliedner, and M. Kellner. 2010. "Determining fixed crane areas in rail-rail transshipment yards." Transportation Research Part E-Logistics and Transportation Review 46 (6):1005-1016..

Boysen, Nils, Malte Fliedner, Florian Jaehn, and Erwin Pesch. 2013. "A survey on container processing in railway yards." Transportation Science 47 (3):312-329. Carlo, HéctorJ, IrisF A. Vis, and KeesJan Roodbergen. 2013. "Seaside operations in container terminals: literature overview, trends, and research directions." Flexible Services and Manufacturing Journal:1-39.

Guo, Peng, Wenming Cheng, Zeqiang Zhang, Min Zhang, and Jian Liang. 2013. "Gantry Crane Scheduling with Interference Constraints in Railway Container Terminals." International Journal of Computational Intelligence Systems 6 (2):244-260.

Jeong, B. J., and K. H. Kim. 2011. "Scheduling operations of a rail crane and container deliveries between rail and port terminals." Engineering Optimization 43 (6):597-613.

Kim, Kap Hwan, and Young-Man Park. 2004. "A crane scheduling method for port container terminals." European Journal of Operational Research 156 (3):752-768.

Lundy, M., and A. Mees. 1986. "Convergence of an annealing algorithm." Mathematical Programming 34 (1):111-124.

Nguyen, Duy Vu Anh, and Won Young Yun. 2014. “Optimal job scheduling of a rail crane in rail terminals.” International Journal of Industrial Engineering: Theory, Application and Practice 21(3): 129-140.

Pap, E., G. Bojanic, N. Ralevic, M. Georgijevic, and V. Bojanic. 2012. "Crane scheduling method for train reloading at inland intermodal container terminal." Intelligent Systems and Informatics (SISY), 2012 IEEE 10th Jubilee International Symposium on, 20-22 Sept. 2012.

Author Details

Nguyen Vu Anh Duy

  • Faculty of Mechanical Engineering Technology, Ho Chi Minh City University of Food Industry, Ho Chi Minh City, Vietnam
  • Google Scholar
  • RAJAR Journal

Nguyen Le Thai

  • Faculty of Mechanical Engineering Technology, Ho Chi Minh City University of Food Industry, Ho Chi Minh City, Vietnam
  • Google Scholar
  • RAJAR Journal