A Method of Quay Crane Scheduling For Container Terminals

Abstract:

This paper discusses the problem of allocating and scheduling quay cranes (QCs). The problem is decomposed into two sub problems. One is QCs-allocation problem, the other is QCs-scheduling problem. The objective is to find an optimal QCs-to-tasks matching and the QCs’ work sequence so as to ensure the synchronous among QCs and then maximizes container terminal’s throughput ultimately. And then for solving the QCs-scheduling model, a novel search methodology based on heuristic rule-modules with different priority is studied. Through experiments the decision-making system for QCs allocating and scheduling is proved efficient and applied.

• Periodical: Advanced Materials Research (Volumes 524-527)
• Pages: 824-827
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.524-527.824
• Online since: May 2012
• Authors: Ning Zhao, Wei Jian Mi, Xue Bao
• Keywords: Allocation, Container Terminal, Dynamic Scheduling, Heuristic Rule, QCs, Quay Crane Scheduling, Ship, Vessel

References

[1] C.F. Daganzo. Transport Sci 24, 205-216, (1990).

[2] R.I. Peterkofsky and C.F. Daganzo. Transport Res 24B, 159-172, (1990).

[3] K.H. Kim and Y.M. Park. Eur J Oper Res 156, 752-768, (2004).

[4] L. Moccia, J.F. Cordeau, Manlio Gaudioso, G. Laporte1.Nav Res Logis 53, 45-59, (2006).

[5] J. Liu, Y.W. Wan, L. Wang. Nav Res Logis 53, 60-74, (2006).