Scheduling small number of quay cranes with non-interference constraint

DOI10.1007/S11590-014-0756-4zbMath1310.90053OpenAlexW2070867136MaRDI QIDQ2017842

Feifeng Zheng, Jinfeng Li, Ming Liu

Publication date: 23 March 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0756-4

zbMATH Keywords

schedulingapproximation algorithmcontainer portquay crane

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Related Items (5)

Approximation algorithm for uniform quay crane scheduling at container ports ⋮ Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level ⋮ A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints ⋮ Approximate the scheduling of quay cranes with non-crossing constraints ⋮ Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles

Cites Work

• Unnamed Item
• Unnamed Item
• Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks
• Container sequencing for quay cranes with internal reshuffles
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Operations research at container terminals: a literature update
• Algorithm Theory - SWAT 2004
• A m‐parallel crane scheduling problem with a non‐crossing constraint

This page was built for publication: Scheduling small number of quay cranes with non-interference constraint