The crane scheduling problem: models and solution approaches
From MaRDI portal
Publication:2393470
DOI10.1007/s10479-010-0765-3zbMath1269.90041OpenAlexW2095301531MaRDI QIDQ2393470
Kang-Hung Yang, Zhili Zhou, Yongpei Guan
Publication date: 8 August 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-010-0765-3
Related Items (19)
A Benders decomposition-based framework for solving quay crane scheduling problems ⋮ A follow-up survey of berth allocation and quay crane scheduling problems in container terminals ⋮ Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems ⋮ Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level ⋮ An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes ⋮ Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse ⋮ Pallet location and job scheduling in a twin-robot system ⋮ An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints ⋮ MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem ⋮ A generalized classification scheme for crane scheduling with interference ⋮ An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports ⋮ An integrated model for berth and yard planning in container terminals with multi-continuous berth layout ⋮ Scheduling quay cranes and yard trucks for unloading operations in container ports ⋮ The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach ⋮ A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints ⋮ An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability ⋮ A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules ⋮ Optimal solutions for a dock assignment problem with trailer transportation ⋮ A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
Cites Work
- Variable neighborhood search for minimum cost berth allocation
- A crane scheduling method for port container terminals
- Operations research at container terminals: a literature update
- 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
- A m‐parallel crane scheduling problem with a non‐crossing constraint
This page was built for publication: The crane scheduling problem: models and solution approaches
