Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals

DOI10.1016/J.EJOR.2016.04.022zbMath1346.90394OpenAlexW2342820711MaRDI QIDQ323449

Mohammad Hasan, M. Dambrine

Publication date: 7 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.04.022

zbMATH Keywords

integer programmingberth allocationcrane schedulingcontainer terminal managementcrane assignment

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (14)

A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals ⋮ Minimum cost noncrossing flow problem on layered networks ⋮ Minimum cost flow problem with conflicts ⋮ Simultaneous operation of next-generation and traditional quay cranes at container terminals ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ 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 ⋮ Integrated berth allocation and time-variant quay crane scheduling with tidal impact in approach channel ⋮ An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports ⋮ The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach ⋮ The berth allocation problem in terminals with irregular layouts ⋮ Approximate the scheduling of quay cranes with non-crossing constraints ⋮ Assignment problem with conflicts ⋮ Integrated laycan and berth allocation and time-invariant quay crane assignment problem in tidal ports with multiple quays

Cites Work

• Unnamed Item
• Unnamed Item
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Partitioning procedures for solving mixed-variables programming problems
• Container terminal operation and operations research -- a classification and literature review
• Transshipment of containers at a container terminal: An overview
• A scheduling method for Berth and Quay cranes
• Optimal berth allocation and time-invariant quay crane assignment in container terminals
• Operations research at container terminals: a literature update
• Crane scheduling with spatial constraints
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
• Crane scheduling with non-crossing constraint

This page was built for publication: Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals