An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem

DOI10.1016/j.ejor.2013.06.051zbMath1305.90176OpenAlexW1990033027MaRDI QIDQ2255903

Jiang Hang Chen, Mark Goh, Der-Horng Lee

Publication date: 18 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.06.051

zbMATH Keywords

mathematical formulationport container terminalunidirectional quay crane scheduling problem(S) scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A follow-up survey of berth allocation and quay crane scheduling problems in container terminals, Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level, Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel, Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity, The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions, A generalized classification scheme for crane scheduling with interference, Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model, 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, 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, Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading

Cites Work

• A tabu search heuristic for the quay crane scheduling problem
• Modeling and solving rich quay crane scheduling problems
• A crane scheduling method for port container terminals
• A fast heuristic for quay crane scheduling with interference constraints
• 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
• Algorithm Theory - SWAT 2004
• A m‐parallel crane scheduling problem with a non‐crossing constraint