The world trade has tremendous growth in marine transportation. This paper studies yard crane scheduling problem between different blocks in container terminal. Its purpose is to minimize total travel time of cranes between blocks and total delayed workload in blocks at different periods. In this way the problem is formulated as a mixed integer programming (MIP) model. The block pairs between which yard cranes will be transferred, during the various periods, is determined by this model. Afterwards the model is coded in LINGO software, which benefits from branch and bound algorithm to solve. Computational results determine the yard cranes movement sequence among blocks to achieve minimum total travel time for cranes and minimum total delayed workload in blocks at different planning periods. Also the results show capability and adequacy of the developed model.

Javanshir, H., Ghomi, S & Ghomi, M. (2012). Investigating transportation system in container terminals and developing a yard crane scheduling model.Management Science Letters, 2(1), 171-180.

Amin, G.R., & Golchubian, H., (2009). The optimal number of yard cranes in container terminal. Journal of Industrial Engineering International, 5, 71-76.

Chen, L., Bostel, N., Dejax, P., Cai, J., & Xi, L. (2007). A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. European Journal of Operational Research, 181, 40–58.

He, J., Chang, D., Mi, W., & Yan, W. (2010). A hybrid parallel genetic algorithm for yard crane scheduling. Transportation Research Part E, 46, 136–155.

Huang, Y., Liang, C., & Yang, Y. (2009). The optimum route problem by genetic algorithm for loading/unloading of yard crane. Computers & Industrial Engineering, 56, 993–1001.

Javanshir, H., & SeyedAlizadeh-Ganji, S.R. (2010). Yard crane scheduling in port container terminals using genetic algorithm. Journal of Industrial Engineering International, 6, 39-50.

Kim, K., Lee, K., & Hwang, H. (2003). Sequencing delivery and receiving operations for yard cranes in port container terminals. International Journal of Production Economics, 84, 283–292.

Lee, Y., & Lee, Y.J., (2010). A heuristic for retrieving containers from a yard. Computers & Operations Research, 37, 1139–1147.

Lee, D.H., Cao, Z., & Meng, Q. (2007). Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm. International Journal of Production Economics, 107, 115–124.

Lee, B., & Kim, K. (2009). Comparing operation cycle times of container yard cranes under various sequencing rules. International Journal of Management Science, 15, 23-52.

Legato, P., Canonaco, P., M., & Mazza, R. (2009). Yard crane management by simulation and optimization. Maritime Economics & Logistics, 11, 36–57.

Linn, R., Liu, J.y., Wan, Y.W., Zhang, C., G., & Murty, K. (2003). Rubber tired gantry crane deployment for container yard operation. Computers & Industrial Engineering, 45, 429–442.

Ng. W.C., & Mak. K.L. (2005). Yard crane scheduling in port container terminals, Applied Mathematical Modelling, 29, 263–276.

Ng, W.C. (2005). Crane scheduling in container yards with inter crane interferences. European Journal of operational research, 164, 64–78.

Park, T., Choe, R., Ok, M., & Ryu, K. (2010). Real-time scheduling for twin RMGs in an automated container yard. OR Spectrum, 32, 593–615.

Seyedalizadeh Ganji, S. R., Javanshir, H., & Vaseghi. F. (2009). Nonlinear mathematical programming for optimal management of container terminals. International Journal of Modern Physics B, 23, 5333-5342.

Seyedalizadeh Ganji, S. R., Babazadeh, A., & Arabshahi, V. (2010). Analysis of the continuous berth allocation problem in container ports using genetic algorithm. Journal of Marine Science and Technology, 15, 408-416.

Zhang, C., Liu, J., Wan Y., Liu, J., & Linn, RJ. (2002). Dynamic crane deployment in container storage yards. Transportation Research Part B, 36, 537–555.