Approximation algorithm for uniform quay crane scheduling at container ports
From MaRDI portal
Publication:3178146
DOI10.1142/S179383091650018XzbMath1362.90201MaRDI QIDQ3178146
Chengbin Chu, Ming Liu, Feifeng Zheng, Yin-Feng Xu
Publication date: 8 July 2016
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Cites Work
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Container terminal operation and operations research -- a classification and literature review
- 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
- Algorithm Theory - SWAT 2004
- A m‐parallel crane scheduling problem with a non‐crossing constraint
This page was built for publication: Approximation algorithm for uniform quay crane scheduling at container ports