Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles

DOI10.1007/s10878-019-00508-9zbMath1441.90175OpenAlexW2996429240WikidataQ126566386 ScholiaQ126566386MaRDI QIDQ2307494

Ming Liu, Yaxin Pang, Feifeng Zheng, Yin-Feng Xu

Publication date: 24 March 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00508-9

zbMATH Keywords

schedulingdynamic programmingcombinatorial optimizationsequencingquay crane

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items

Optimization for integrated scheduling of intelligent handling equipment with bidirectional flows and limited buffers at automated container terminals

Cites Work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Container sequencing for quay cranes with internal reshuffles
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Approximate the scheduling of quay cranes with non-crossing constraints
• Modeling and solving rich quay crane scheduling problems
• A crane scheduling method for port container terminals
• Scheduling small number of quay cranes with non-interference constraint
• A fast heuristic for quay crane scheduling with interference constraints
• Operations research at container terminals: a literature update
• A heuristic rule for relocating blocks
• Optimal two- and three-stage production schedules with setup times included
• The quay crane scheduling problem with time windows
• A m‐parallel crane scheduling problem with a non‐crossing constraint