On double cycling for container port productivity improvement
From MaRDI portal
Publication:338901
DOI10.1007/s10479-014-1645-zzbMath1347.90043OpenAlexW2011691640MaRDI QIDQ338901
Publication date: 7 November 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1645-z
Related Items (3)
A follow-up survey of berth allocation and quay crane scheduling problems in container terminals ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
Cites Work
- A tabu search heuristic for the quay crane scheduling problem
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Stowage planning for container ships to reduce the number of shifts
- Greedy randomized adaptive search procedures
- A crane scheduling method for port container terminals
- A fast heuristic for quay crane scheduling with interference constraints
- Optimal two- and three-stage production schedules with setup times included
- A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
- Tabu Search—Part I
This page was built for publication: On double cycling for container port productivity improvement