A heuristic for the quay crane scheduling problem based on contiguous bay crane operations
DOI10.1016/J.COR.2012.02.013zbMATH Open1349.90379OpenAlexW1966870289MaRDI QIDQ339620FDOQ339620
Authors: Alan L. Erera, Zhiqiang Lu, Xiaole Han, Lifeng Xi 
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
Recommendations
- A fast heuristic for quay crane scheduling with interference constraints
- The quay crane scheduling problem with time windows
- A tabu search heuristic for the quay crane scheduling problem
- An algorithm based on makespan lower bound for quay crane schedule problem in container terminals
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- A crane scheduling method for port container terminals
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Container terminal operation and operations research -- a classification and literature review
- Operations research at container terminals: a literature update
- Transshipment of containers at a container terminal: An overview
- A tabu search heuristic for the quay crane scheduling problem
- Container sequencing for quay cranes with internal reshuffles
- A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
- Crane scheduling with spatial constraints
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- A fast heuristic for quay crane scheduling with interference constraints
- A m‐parallel crane scheduling problem with a non‐crossing constraint
Cited In (19)
- A tree search algorithm for uncertainty-considered consecutive discharging and loading operations between ship and offshore platform
- A fast heuristic for quay crane scheduling with interference constraints
- The quay crane scheduling problem with time windows
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- Double girder bridge crane with double cycling: scheduling strategy and performance evaluation
- Scheduling small number of quay cranes with non-interference constraint
- 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
- A tabu search heuristic for the quay crane scheduling problem
- Hybrid evolutionary computation methods for quay crane scheduling problems
- 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
- Container sequencing for quay cranes with internal reshuffles
- Scheduling multiple factory cranes on a common track
- An algorithm based on makespan lower bound for quay crane schedule problem in container terminals
- A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
- Sequencing dual-spreader crane operations: mathematical formulation and heuristic algorithm
- 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
This page was built for publication: A heuristic for the quay crane scheduling problem based on contiguous bay crane operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339620)
