Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays

DOI10.1016/J.EJOR.2020.12.056zbMATH Open1487.90453OpenAlexW3008065337MaRDI QIDQ2030331FDOQ2030331

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

zbMATH Keywords

integer programmingOR in maritime industrypredicatesberth and quay crane assignmentlaycan allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• A survey of berth allocation and quay crane scheduling problems in container terminals
• Ship scheduling: The last decade
• A scheduling method for Berth and Quay cranes
• Optimal berth allocation and time-invariant quay crane assignment in container terminals
• 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
• 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

Cited In (2)

• Quay partitioning problem
• The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions

This page was built for publication: Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2030331)