A tabu search heuristic for the quay crane scheduling problem
- 15 August 2007
- journal article
- Published by Springer Science and Business Media LLC in Journal of Scheduling
- Vol. 10 (4-5), 327-336
- https://doi.org/10.1007/s10951-007-0029-5
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminalNaval Research Logistics (NRL), 2005
- A crane scheduling method for port container terminalsEuropean Journal of Operational Research, 2004
- Crane scheduling with spatial constraintsNaval Research Logistics (NRL), 2004
- Container terminal operation and operations research - a classification and literature reviewOR Spectrum, 2004
- A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shopNaval Research Logistics (NRL), 1999
- Tabu SearchPublished by Springer Science and Business Media LLC ,1998
- A tabu search heuristic for periodic and multi-depot vehicle routing problemsNetworks, 1997
- A Fast Taboo Search Algorithm for the Job Shop ProblemManagement Science, 1996
- A branch and bound solution method for the crane scheduling problemTransportation Research Part B: Methodological, 1990
- The crane scheduling problemTransportation Research Part B: Methodological, 1989