A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals
type: Item
instance of: scholarly article
title: A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals
zbMATH Open document ID: 1217.90110
author: Hassan Rashidi
author: Edward Tsang
publication date: 2011-07-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B90
zbMATH DE Number: 5929989
zbMATH Keywords: search methods
zbMATH Keywords: scheduling problems
zbMATH Keywords: network simplex algorithm
zbMATH Keywords: optimization
zbMATH Keywords: container terminals
zbMATH Keywords: \texttt{DSGAV}
MaRDI profile type: Publication
full work available at URL: j.camwa.2010.12.009
OpenAlex ID: W2160364094
cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems.
cites work: Q5480999
cites work: Q3056948
cites work: An efficient cost scaling algorithm for the assignment problem
cites work: Pivot Strategies for Primal-Simplex Network Codes
cites work: An efficient implementation of the network simplex method
cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
cites work: Q4335206
cites work: A general pricing scheme for the simplex method
cites work: Q4538171
cites work: Scheduling and routing algorithms for AGVs: A survey
cites work: Q4845364
cites work: Theoretical Properties of the Network Simplex Method
cites work: Q3844775
cites work: Algorithms for the Simple Equal Flow Problem
cites work: A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
DOI: 10.1016/J.CAMWA.2010.12.009
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 5929989