Container sequencing for quay cranes with internal reshuffles
From MaRDI portal
Publication:989615
DOI10.1007/s00291-009-0191-6zbMath1201.90031OpenAlexW2074400428MaRDI QIDQ989615
Publication date: 23 August 2010
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-009-0191-6
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
Loading, unloading and premarshalling of stacks in storage areas: survey and classification ⋮ A follow-up survey of berth allocation and quay crane scheduling problems in container terminals ⋮ A heuristic for the quay crane scheduling problem based on contiguous bay crane operations ⋮ A generalized classification scheme for crane scheduling with interference ⋮ A tree search procedure for the container pre-marshalling problem ⋮ A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints ⋮ Scheduling small number of quay cranes with non-interference constraint ⋮ Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles ⋮ A survey of berth allocation and quay crane scheduling problems in container terminals ⋮ Double girder bridge crane with double cycling: scheduling strategy and performance evaluation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A mathematical formulation and complexity considerations for the blocks relocation problem
- 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
- A survey of berth allocation and quay crane scheduling problems in container terminals
- A beam search algorithm for the load sequencing of outbound containers in port container terminals
- A crane scheduling method for port container terminals
- A fast heuristic for quay crane scheduling with interference constraints
- Operations research at container terminals: a literature update
- A heuristic rule for relocating blocks
- Optimal two- and three-stage production schedules with setup times included
- 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
- A m‐parallel crane scheduling problem with a non‐crossing constraint
This page was built for publication: Container sequencing for quay cranes with internal reshuffles