A heuristic for the quay crane scheduling problem based on contiguous bay crane operations
From MaRDI portal
(Redirected from Publication:339620)
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
Cites work
- A m‐parallel crane scheduling problem with a non‐crossing constraint
- A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
- A crane scheduling method for port container terminals
- A fast heuristic for quay crane scheduling with interference constraints
- A survey of berth allocation and quay crane scheduling problems in container terminals
- A tabu search heuristic for the quay crane scheduling problem
- Container sequencing for quay cranes with internal reshuffles
- Container terminal operation and operations research -- a classification and literature review
- Crane scheduling with spatial constraints
- Operations research at container terminals: a literature update
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- Transshipment of containers at a container terminal: An overview
Cited in
(19)- A fast heuristic for quay crane scheduling with interference constraints
- The quay crane scheduling problem with time windows
- A tree search algorithm for uncertainty-considered consecutive discharging and loading operations between ship and offshore platform
- Double girder bridge crane with double cycling: scheduling strategy and performance evaluation
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- 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
- Container sequencing for quay cranes with internal reshuffles
- Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity
- Scheduling multiple factory cranes on a common track
- A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
- An algorithm based on makespan lower bound for quay crane schedule problem in container terminals
- 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)