The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion

Jiang Hang Chen*, Michel Bierlaire

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

25 Citations (Scopus)


As a special case of the quay crane scheduling problem, the unidirectional quay crane scheduling problem has been received more and more attention. In this paper, we analyze the computational complexity of the unidirectional quay crane scheduling problem and propose a tighter mixed integer programming formulation. Next, we develop three makespan-constrained models to obtain risk-averse solutions to mitigate the impacts of ship instability and solution infeasibility (thus, need to revamp or even reschedule the plans). Comprehensive numerical experiments are designed to investigate the benefits of the tighter formulation and the three optimization models for risk-aversion.

Original languageEnglish
Pages (from-to)613-624
Number of pages12
JournalEuropean Journal of Operational Research
Issue number2
Publication statusPublished - 16 Jul 2017
Externally publishedYes


  • OR in maritime industry
  • Port container terminal
  • Risk aversion
  • Robustness
  • Unidirectional quay crane scheduling problem

Cite this