The quay crane scheduling problem with time windows
From MaRDI portal
Publication:2892125
DOI10.1002/nav.20471zbMath1241.90052OpenAlexW2099189023MaRDI QIDQ2892125
Publication date: 18 June 2012
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20471
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (14)
A follow-up survey of berth allocation and quay crane scheduling problems in container terminals ⋮ Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level ⋮ Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel ⋮ Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity ⋮ A generalized classification scheme for crane scheduling with interference ⋮ A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints ⋮ The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion ⋮ An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem ⋮ Modeling and solving rich quay crane scheduling problems ⋮ Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading ⋮ A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules ⋮ Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles ⋮ A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem ⋮ A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
Uses Software
Cites Work
- A tabu search heuristic for the quay crane scheduling problem
- A survey of berth allocation and quay crane scheduling problems in container terminals
- A crane scheduling method for port container terminals
- A fast heuristic for quay crane scheduling with interference 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
- Algorithm Theory - SWAT 2004
- A m‐parallel crane scheduling problem with a non‐crossing constraint
This page was built for publication: The quay crane scheduling problem with time windows
