Robust cyclic berth planning of container vessels

From MaRDI portal
Publication:989624

DOI10.1007/s00291-010-0198-zzbMath1201.90027OpenAlexW2147155263MaRDI QIDQ989624

Maarten Hendriks, Jan Tijmen Udding, Erjen Lefeber, Marco Laumanns

Publication date: 23 August 2010

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-010-0198-z




Related Items (17)

Collaborative emergency berth scheduling based on decentralized decision and price mechanismSolving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithmA follow-up survey of berth allocation and quay crane scheduling problems in container terminalsTactical berth allocation under uncertaintyOptimal policies for the berth allocation problem under stochastic natureBerth allocation and quay crane assignment/scheduling problem under uncertainty: a surveySimultaneous berth allocation and yard planning at tactical levelIntegrated proactive-reactive approach and a hybrid adaptive large neighborhood search algorithm for berth and quay crane scheduling under uncertain combinationAn integrated berth allocation and yard assignment problem for bulk ports: Formulation and case studyReal-time management of berth allocation with stochastic arrival and handling timesRobust scheduling for berth allocation and quay crane assignment problemAn exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival timesOptimal berth allocation and time-invariant quay crane assignment in container terminalsSelecting algorithms for large berth allocation problemsFuzziness in the Berth Allocation ProblemNew formulations and solutions for the strategic berth template problemA survey of berth allocation and quay crane scheduling problems in container terminals



Cites Work


This page was built for publication: Robust cyclic berth planning of container vessels