Modeling and solving rich quay crane scheduling problems

DOI10.1016/j.cor.2011.09.025zbMath1251.90163MaRDI QIDQ1761126

Frank Meisel, Roberto Trunfio, Pasquale Legato

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.09.025

zbMATH Keywords

timed Petri net; container terminal; quay crane scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Some complexity results and an efficient algorithm for quay crane scheduling problem, Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity, Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model, A follow-up survey of berth allocation and quay crane scheduling problems in container terminals, Scheduling multiple factory cranes on a common track, A reclaimer scheduling problem arising in coal stockyard management, A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints, A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules, Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level, A generalized classification scheme for crane scheduling with interference, Scheduling reclaimers serving a stock pad at a coal terminal, Scheduling quay cranes and yard trucks for unloading operations in container ports, The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion, An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability, Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel, An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem, Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading, Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles, Double girder bridge crane with double cycling: scheduling strategy and performance evaluation, An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes

Cites Work

• Unnamed Item
• A tabu search heuristic for the quay crane scheduling problem
• Simulation-based optimization for discharge/loading operations at a maritime container terminal
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Exact and approximation algorithms for makespan minimization on unrelated parallel machines
• Container terminal operation and operations research -- a classification and literature review
• 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
• The quay crane scheduling problem with time windows
• 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
• Crane scheduling with non-crossing constraint
• Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
• A m‐parallel crane scheduling problem with a non‐crossing constraint