Heuristics for quay crane scheduling at indented berth

Jiang Hang Chen, Der Horng Lee*, Jin Xin Cao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

37 Citations (Scopus)


This paper discusses the quay crane scheduling problem at indented berth, an extension to the current quay crane scheduling problem in the field of container terminal operation. A mixed integer programming model by considering the unique features of the quay crane scheduling problem at indented berth is formulated. For solution, decomposition heuristic framework is developed and enhanced by Tabu search. To evaluate the performance of the proposed heuristic framework, a comprehensive numerical test is carried out and its results show the good quality of the proposed heuristic framework.

Original languageEnglish
Pages (from-to)1005-1020
Number of pages16
JournalTransportation Research Part E: Logistics and Transportation Review
Issue number6
Publication statusPublished - Nov 2011
Externally publishedYes


  • Heuristics
  • Indented berth
  • Quay crane scheduling

Cite this