Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays
DOI10.1016/j.ejor.2020.12.056zbMath1487.90453OpenAlexW3008065337MaRDI QIDQ2030331
Gülgün Alpan, Hamza Bouzekri, Vincent Giard
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.056
integer programmingOR in maritime industrypredicatesberth and quay crane assignmentlaycan allocation
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)
Related Items (2)
Cites Work
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Ship scheduling: The last decade
- MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
- New exact methods for the time-invariant berth allocation and quay crane assignment problem
- A scheduling method for Berth and Quay cranes
- Optimal berth allocation and time-invariant quay crane assignment in container terminals
This page was built for publication: Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays