Algorithm Theory - SWAT 2004

DOI10.1007/b98413zbMath1095.90551OpenAlexW2615963353MaRDI QIDQ5315384

Andrew E. B. Lim, Brian Rodrigues, Zhou Xu

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98413

zbMATH Keywords

approximation algorithmdynamic programming algorithmcrane efficiencyloading and unloading of shipsport throughputsea transportation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Approximation algorithms (68W25)

Related Items (13)

The quay crane scheduling problem with time windows ⋮ Some complexity results and an efficient algorithm for quay crane scheduling problem ⋮ Approximation algorithm for uniform quay crane scheduling at container ports ⋮ 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 ⋮ Vehicle Routing Problems and Container Terminal Operations – An Update of Research ⋮ Approximate the scheduling of quay cranes with non-crossing constraints ⋮ On-line scheduling with non-crossing constraints ⋮ Operations research at container terminals: a literature update ⋮ An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem ⋮ Scheduling small number of quay cranes with non-interference constraint ⋮ A m‐parallel crane scheduling problem with a non‐crossing constraint ⋮ A survey of berth allocation and quay crane scheduling problems in container terminals

This page was built for publication: Algorithm Theory - SWAT 2004