Robust scheduling for berth allocation and quay crane assignment problem

DOI10.1155/2014/834927zbMath1407.90173OpenAlexW2114653571WikidataQ59069817 ScholiaQ59069817MaRDI QIDQ1719234

M. Rodriguez-Molins, Federico Barber, Miguel A. Salido

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/834927

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items

A sample average approximation approach to the berth allocation problem with uncertain tides, Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey, Integrated proactive-reactive approach and a hybrid adaptive large neighborhood search algorithm for berth and quay crane scheduling under uncertain combination, New exact methods for the time-invariant berth allocation and quay crane assignment problem

Uses Software

• SPEA2

Cites Work

• A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
• Robust berth scheduling with uncertain vessel delay and handling time
• Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities
• Hybrid metaheuristics. An emerging approach to optimization.
• Robust cyclic berth planning of container vessels
• A survey of berth allocation and quay crane scheduling problems in container terminals
• The berth planning problem
• A scheduling method for Berth and Quay cranes
• Operations research at container terminals: a literature update