A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals
- 1 February 2011
- journal article
- Published by Elsevier BV in Computers & Mathematics with Applications
- Vol. 61 (3), 630-641
- https://doi.org/10.1016/j.camwa.2010.12.009
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A decision support system for operations in a container terminalDecision Support Systems, 2005
- Scheduling and routing algorithms for AGVs: A surveyInternational Journal of Production Research, 2002
- Meta-heuristics: The State of the ArtLecture Notes in Computer Science, 2001
- Algorithms for the Simple Equal Flow ProblemManagement Science, 1999
- An Efficient Implementation of a Scaling Minimum-Cost Flow AlgorithmJournal of Algorithms, 1997
- An efficient implementation of the network simplex methodMathematical Programming Studies, 1986
- Theoretical Properties of the Network Simplex MethodMathematics of Operations Research, 1979
- Pivot Strategies for Primal-Simplex Network CodesJournal of the ACM, 1978
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment AlgorithmsManagement Science, 1977