Approximate the scheduling of quay cranes with non-crossing constraints

DOI10.1016/j.ejor.2016.10.021zbMath1394.90316OpenAlexW2539000210MaRDI QIDQ1751714

An Zhang, Yong Chen, Guangting Chen, Wenshuai Zhang, Xufeng Chen

Publication date: 25 May 2018

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

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

zbMATH Keywords

schedulingapproximation algorithmsnon-crossingworst case analysisquay cranes

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level ⋮ Simultaneous operation of next-generation and traditional quay cranes at container terminals ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach ⋮ Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles ⋮ Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

Cites Work

• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
• Crane scheduling in container yards with inter-crane interference
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Transshipment of containers at a container terminal: An overview
• A crane scheduling method for port container terminals
• Scheduling small number of quay cranes with non-interference constraint
• Crane scheduling with spatial constraints
• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
• Crane scheduling with non-crossing constraint
• Algorithm Theory - SWAT 2004
• A m‐parallel crane scheduling problem with a non‐crossing constraint

This page was built for publication: Approximate the scheduling of quay cranes with non-crossing constraints