A survey of berth allocation and quay crane scheduling problems in container terminals
DOI10.1016/j.ejor.2009.05.031zbMath1176.90373OpenAlexW2069479298MaRDI QIDQ1040981
Christian Bierwirth, Frank Meisel
Publication date: 27 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.031
berth allocationquay crane assignmentquay crane schedulingcontainer terminal operationsintegrated planningproblem classification
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Related Items (only showing first 100 items - show all)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks
- A tabu search heuristic for the quay crane scheduling problem
- Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents
- Berth allocation at indented berths for mega-containerships
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
- Variable neighborhood search for minimum cost berth allocation
- Container sequencing for quay cranes with internal reshuffles
- Robust cyclic berth planning of container vessels
- The berth planning problem
- Container terminal operation and operations research -- a classification and literature review
- The berth allocation problem: models and solution methods
- A beam search algorithm for the load sequencing of outbound containers in port container terminals
- A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
- Transshipment of containers at a container terminal: An overview
- A multiple-crane-constrained scheduling problem in a container terminal
- A scheduling method for Berth and Quay cranes
- A crane scheduling method for port container terminals
- A fast heuristic for quay crane scheduling with interference constraints
- Berth management in container terminal: the template design problem
- A queuing network model for the management of berth crane operations
- Operations research at container terminals: a literature update
- Optimal two- and three-stage production schedules with setup times included
- Berth Allocation Planning Optimization in Container Terminals
- Crane scheduling with spatial constraints
- A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- Crane scheduling with non-crossing constraint
- Optimizing ship berthing
- Berth scheduling for container terminals by using a sub-gradient optimization technique
- Algorithm Theory - SWAT 2004
- The Berth Allocation Problem with a Cut-and-Run Option
- A m‐parallel crane scheduling problem with a non‐crossing constraint
- Principles and Practice of Constraint Programming – CP 2004
- Berth allocation planning in the public berth system by genetic algorithms
- Berth planning and resources optimisation at a container terminal via discrete event simulation
This page was built for publication: A survey of berth allocation and quay crane scheduling problems in container terminals