Quay partitioning problem

DOI10.1111/itor.13389OpenAlexW4387774150WikidataQ128213526 ScholiaQ128213526MaRDI QIDQ6146630

Jakub Wawrzyniak, Eric Sanlaville, Yoann Pigné, Frédéric Guinand, Maciej Drozdowski

Publication date: 31 January 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13389

zbMATH Keywords

combinatorial optimizationberth allocation problemmaritime container terminal design

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• On contiguous and non-contiguous parallel task scheduling
• A survey of berth allocation and quay crane scheduling problems in container terminals
• The berth planning problem
• Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays
• Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
• Selecting algorithms for large berth allocation problems
• Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by bestial metaphors
• A decision method on yard cranes transformation and deployment in green ports
• Schedule robustness in the periodic supply vessels planning problem with stochastic demand and travel time

This page was built for publication: Quay partitioning problem