The quay crane scheduling problem with time windows
From MaRDI portal
Publication:2892125
DOI10.1002/nav.20471zbMath1241.90052MaRDI 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
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
A follow-up survey of berth allocation and quay crane scheduling problems in container terminals, A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints, A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules, Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level, A generalized classification scheme for crane scheduling with interference, The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion, Modeling and solving rich quay crane scheduling problems, An effective mathematical formulation for the unidirectional cluster-based quay crane 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
