A note on: a flexible crane scheduling methodology for container terminals

Jiang Hang Chen*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


In Dik and Kozan (2017) published in Flexible Services and Manufacturing Journal, a Tabu search algorithm was proposed for the quay crane scheduling problem raised in the operation of container terminals. According to the computational experiments and results, Dik and Kozan (2017) demonstrated that by relaxing the non-preemption restrictions when handling tasks (i.e., flexible jobs) and quay cranes’ moving pattern to unidirectional/bidirectional manner, through Tabu search, better solutions of the quay crane scheduling problems could be obtained in an efficient way. However, it should be highlighted that compared to most of the relevent researches in the literature, in Dik and Kozan (2017), the initial quay crane positions were disregarded. Dik and Kozan (2017) has discussed that the improvements on makespan can be attributed to flexible jobs and unidirectional/bidirectional schedules. In this note, the impact of initial crane positions on the makespan would be investigated.

Original languageEnglish
Pages (from-to)34-40
Number of pages7
JournalFlexible Services and Manufacturing Journal
Issue number1
Publication statusPublished - 15 Mar 2019
Externally publishedYes


  • Flexible jobs
  • Initial quay crane positions
  • Quay crane scheduling problem

Cite this