Stochastic quay partitioning problem

DOI10.1016/J.EJOR.2025.07.043MaRDI QIDQ6862075zbMATH OpenFDO

Authors Jakub Wawrzyniak, M. Drozdowski, Eric Sanlaville

Publication date 9 February 2026

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

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.07.043

zbMATH Keywords

berth allocation problemmaritime container terminal designschedulingship traffic modelingstochastic optimization

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• A self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter control
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Algorithm Portfolios
• Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
• Metaheuristic approaches for the berth allocation problem
• Multi-objective and prioritized berth allocation in container ports
• Neural network assisted branch and bound algorithm for dynamic berth allocation problems
• On contiguous and non-contiguous parallel task scheduling
• Operations research at container terminals: a literature update
• Optimizing integrated berth allocation and quay crane assignment: a distributionally robust approach
• Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
• Quay partitioning problem
• Selecting algorithms for large berth allocation problems
• The berth planning problem
• The collaborative berth allocation problem with row-generation algorithms for stable cost allocations
• Variable neighborhood search for minimum cost berth allocation

This page was built for publication: Stochastic quay partitioning problem

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