A heuristic for the quay crane scheduling problem based on contiguous bay crane operations
From MaRDI portal
Publication:339620
DOI10.1016/j.cor.2012.02.013zbMath1349.90379OpenAlexW1966870289MaRDI QIDQ339620
Alan L. Erera, Li-Feng Xi, Xiao-Le Han, Zhi-Qiang Lu
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.02.013
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Some complexity results and an efficient algorithm for quay crane scheduling problem, A follow-up survey of berth allocation and quay crane scheduling problems in container terminals, Hybrid evolutionary computation methods for quay crane scheduling problems, Scheduling multiple factory cranes on a common track, Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level, 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, Double girder bridge crane with double cycling: scheduling strategy and performance evaluation
Cites Work
- A tabu search heuristic for the quay crane scheduling problem
- Container sequencing for quay cranes with internal reshuffles
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Container terminal operation and operations research -- a classification and literature review
- Transshipment of containers at a container terminal: An overview
- 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
- 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
- A m‐parallel crane scheduling problem with a non‐crossing constraint