1Imai, A. , Nishimura, E. , Papadimitriou, S.. The dynamic berth allocation problem for a container port[J]. Transportation Re- search Part B,2001,35(4) :401-417.
2Imai, A. ,Nagaiwa,K. ,Tat,C. W.. Efficient planning of berth al- location for container terminals in Asia[J]. Journal of Advanced Transportation, 1997,31 (1) : 75-94.
7Liu,J. , Wan, Y. W. , Wang, L.. Quay crane scheduling at contain- er terminals to minimize the maximum relative tardiness of vessel departures[J].Naval Research Logistics,2006,53(1):60-74.
7Vis I F A, de Koster R. Transshipment of containers at a container terminal.. An overview [J]. European Journal of Operational Research, 2003, 147(1): 1-16.
8Imai A, Nagaiwa K, Tat C W. Efficient planning of berth allocation for container terminals in Asia [J]. Journal of Advanced Transportation, 1997, 31 ( 1 ) :75- 94.
9Park K T, Kim K H. Berth scheduling for container terminals by using a sub-gradient optimization technique [J]. Journal of the Operational Research Society, 2002, 53(9): 1054-1062.
10Imai A, Nishimura E, Papadimitriou S. The dynamic berth allocation problem for a container port [J]. Transportation Research Part B, 2001, 35(4): 401- 417.