A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals

DOI10.1016/j.camwa.2010.12.009zbMath1217.90110OpenAlexW2160364094MaRDI QIDQ552189

Hassan Rashidi, Edward P. K. Tsang

Publication date: 21 July 2011

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.12.009

zbMATH Keywords

optimizationscheduling problemssearch methodscontainer terminals\texttt{DSGAV}network simplex algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items

Transport operations in container terminals: literature overview, trends, research directions and classification scheme ⋮ Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers ⋮ Planning and control of autonomous mobile robots for intralogistics: literature review and research agenda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• A general pricing scheme for the simplex method
• A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
• An efficient cost scaling algorithm for the assignment problem
• Algorithms for the Simple Equal Flow Problem
• An efficient implementation of the network simplex method
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Pivot Strategies for Primal-Simplex Network Codes
• Theoretical Properties of the Network Simplex Method
• Scheduling and routing algorithms for AGVs: A survey