The crane scheduling problem: models and solution approaches

DOI10.1007/S10479-010-0765-3zbMATH Open1269.90041OpenAlexW2095301531MaRDI QIDQ2393470FDOQ2393470

Authors: Yongpei Guan, Kang-Hung Yang, Zhili Zhou 

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

Recommendations

• The quay crane scheduling problem with time windows
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
• Interblock Crane Deployment in Container Terminals
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
• Crane scheduling with spatial constraints

zbMATH Keywords

dynamic programmingheuristicworst case analysiscrane schedulingnetwork flow modelcrane interference

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• 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
• Crane scheduling with non-crossing constraint
• Variable neighborhood search for minimum cost berth allocation
• 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

Cited In (31)

• The quay crane scheduling problem with time windows
• 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
• Crane scheduling with non-crossing constraint
• Interblock Crane Deployment in Container Terminals
• Crane scheduling with spatial constraints
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
• Solution techniques for a crane sequencing problem
• CLSS: An intelligent crane lorry scheduling system
• Tree based models and algorithms for the preemptive asymmetric stacker crane problem
• Container vessel scheduling with bi-directional flows
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints
• Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level
• Optimal solutions for a dock assignment problem with trailer transportation
• Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems
• Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse
• A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
• A m‐parallel crane scheduling problem with a non‐crossing constraint
• Principles and Practice of Constraint Programming – CP 2004
• An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes
• Pallet location and job scheduling in a twin-robot system
• A Benders decomposition-based framework for solving quay crane scheduling problems
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
• Dynamically scheduling ships to multiple continuous berth spaces in an iron and steel complex
• 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: The crane scheduling problem: models and solution approaches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393470)