Algorithm Theory - SWAT 2004
From MaRDI portal
Publication:5315384
DOI10.1007/b98413zbMath1095.90551MaRDI 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
approximation algorithm; dynamic programming algorithm; crane efficiency; loading and unloading of ships; port throughput; sea transportation
90B35: Deterministic scheduling theory in operations research
90C39: Dynamic programming
68W25: Approximation algorithms
Related Items
Some complexity results and an efficient algorithm for quay crane scheduling problem, A m‐parallel crane scheduling problem with a non‐crossing constraint, Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model, On-line scheduling with non-crossing constraints, A survey of berth allocation and quay crane scheduling problems in container terminals, The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach, Approximate the scheduling of quay cranes with non-crossing constraints, Scheduling small number of quay cranes with non-interference constraint, An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem, Operations research at container terminals: a literature update, The quay crane scheduling problem with time windows, Approximation algorithm for uniform quay crane scheduling at container ports, Vehicle Routing Problems and Container Terminal Operations – An Update of Research
