The berth planning problem
From MaRDI portal
Recommendations
- Berth allocation planning optimization in container terminals
- Berth allocation planning in the public berth system by genetic algorithms
- The berth allocation problem: models and solution methods
- Port space allocation with a time dimension
- The berth allocation problem in terminals with irregular layouts
Cited in
(56)- A survey of berth allocation and quay crane scheduling problems in container terminals
- Managing the ship movements in the Port of Venice
- MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
- Mathematical models for the berth allocation problem in dry bulk terminals
- Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels
- Robust scheduling for 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
- A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
- A crane scheduling method for port container terminals
- Simultaneous berth allocation and yard planning at tactical level
- The berth allocation problem in terminals with irregular layouts
- Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems
- Pilotage planning in seaports
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
- Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem
- Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
- The dock problem revisited
- Inventory-based dispatching of automated guided vehicles on container terminals
- Berth management in container terminal: the template design problem
- Operations research at container terminals: a literature update
- A critical-shaking neighborhood search for the yard allocation problem
- Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
- On the berth allocation problem
- On minimizing dataset transfer time in an acyclic network with four servers
- Berth allocation planning optimization in container terminals
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- Tactical berth allocation under uncertainty
- A set-partitioning-based model for the berth allocation problem under time-dependent limitations
- Dynamically scheduling ships to multiple continuous berth spaces in an iron and steel complex
- The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions
- Berth allocation with time-dependent physical limitations on vessels
- Metaheuristic approaches for the berth allocation problem
- A fuzzy optimization model for the berth allocation problem
- Fuzziness in the berth allocation problem
- Nonlinear mathematical programming for optimal management of container terminals
- Berth allocation planning in the public berth system by genetic algorithms
- A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics
- Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs
- Multi-objective and prioritized berth allocation in container ports
- Quay partitioning problem
- Improved sequential insertion heuristics for berth allocation problems
- A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics
- Proactive berth scheduling with data-driven buffer time in container terminals
- An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
- Stochastic quay partitioning problem
- Integrated proactive and reactive strategies for sustainable berth allocation and quay crane assignment under uncertainty
- Operations research, machine learning, and integrated techniques for decision problems in the Seaside area of container terminals
- Time-constrained project scheduling with adjacent resources
- Vessel arrival planning with full information
- Robust berth scheduling with uncertain vessel delay and handling time
- Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents
- Berth allocation at indented berths for mega-containerships
- On contiguous and non-contiguous parallel task scheduling
- Variable neighborhood search for minimum cost berth allocation
- Robust cyclic berth planning of container vessels
This page was built for publication: The berth planning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1271388)
