Berth allocation with time-dependent physical limitations on vessels
From MaRDI portal
Publication:421704
DOI10.1016/j.ejor.2011.07.012zbMath1237.90136OpenAlexW1997472486MaRDI QIDQ421704
Dongsheng Xu, Chung-Lun Li, Joseph Y.-T. Leung
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.07.012
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (18)
A sample average approximation approach to the berth allocation problem with uncertain tides ⋮ A follow-up survey of berth allocation and quay crane scheduling problems in container terminals ⋮ Optimal sequence of container ships in a string ⋮ A set-partitioning-based model for the berth allocation problem under time-dependent limitations ⋮ An adaptive large neighborhood search for the discrete and continuous berth allocation problem ⋮ A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals ⋮ A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics ⋮ Scheduling of waterways with tide and passing box ⋮ Novel formulations and modeling enhancements for the dynamic berth allocation problem ⋮ A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics ⋮ A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations ⋮ Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem ⋮ An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study ⋮ Mathematical models for the berth allocation problem in dry bulk terminals ⋮ Integrated berth allocation and time-variant quay crane scheduling with tidal impact in approach channel ⋮ The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm ⋮ On the Berth Allocation Problem ⋮ New formulations and solutions for the strategic berth template problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-objective and prioritized berth allocation in container ports
- Berth allocation at indented berths for mega-containerships
- Variable neighborhood search for minimum cost berth allocation
- A survey of berth allocation and quay crane scheduling problems in container terminals
- The berth planning problem
- Container terminal operation and operations research -- a classification and literature review
- The berth allocation problem: models and solution methods
- A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
- A scheduling method for Berth and Quay cranes
- Berth management in container terminal: the template design problem
- Operations research at container terminals: a literature update
- Berth Allocation Planning Optimization in Container Terminals
- Scheduling parallel machines with inclusive processing set restrictions
- Dynamically scheduling ships to multiple continuous berth spaces in an iron and steel complex
- Optimizing ship berthing
- Berth scheduling for container terminals by using a sub-gradient optimization technique
- Berth allocation planning in the public berth system by genetic algorithms
This page was built for publication: Berth allocation with time-dependent physical limitations on vessels