Scheduling in Container Terminals using Network Simplex Algorithm

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional simplex algorithm for linear programs. many random data are generated and fed to the model for 50 vehicles. the results show that nsa is fast and efficient. it is found that, in practice, nsa takes polynomial time to solve problems in this application.