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

DOI10.1016/j.ejor.2017.01.007zbMath1403.90313OpenAlexW2577971819MaRDI QIDQ1753475

Jiang Hang Chen, Michel Bierlaire

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.01.007

zbMATH Keywords

robustnessrisk aversionOR in maritime industryport container terminalunidirectional quay crane scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level ⋮ Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel ⋮ Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model ⋮ An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability

Cites Work

• Unnamed Item
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Robust discrete optimization and network flows
• Modeling and solving rich quay crane scheduling problems
• A crane scheduling method for port container terminals
• An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
• A fast heuristic for quay crane scheduling with interference constraints
• The quay crane scheduling problem with time windows
• Crane scheduling with spatial constraints
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
• The Price of Robustness
• A m‐parallel crane scheduling problem with a non‐crossing constraint

This page was built for publication: The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion