Heuristics for quay crane scheduling at indented berth
- 30 November 2011
- journal article
- Published by Elsevier BV in Transportation Research. Part E, Logistics and Transportation Review
- Vol. 47 (6), 1005-1020
- https://doi.org/10.1016/j.tre.2011.04.004
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A survey of berth allocation and quay crane scheduling problems in container terminalsEuropean Journal of Operational Research, 2010
- A fast heuristic for quay crane scheduling with interference constraintsJournal of Scheduling, 2009
- A tabu search heuristic for the quay crane scheduling problemJournal of Scheduling, 2007
- A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminalNaval Research Logistics (NRL), 2005
- Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approachEuropean Journal of Operational Research, 2005
- A crane scheduling method for port container terminalsEuropean Journal of Operational Research, 2004
- An effective heuristic for minimising makespan on unrelated parallel machinesJournal of the Operational Research Society, 1998
- The berth planning problemOperations Research Letters, 1998
- Duality-Based Algorithms for Scheduling Unrelated Parallel MachinesINFORMS Journal on Computing, 1993
- Heuristics for scheduling unrelated parallel machinesComputers & Operations Research, 1991