ABSTRACT
In Chapter 5, the static scheduling problem of automated guided vehicles (AGVs) in container terminals was solved by the standard version of network simplex algorithm (NSA). In this chapter, some modifications are applied to the NSA to obtain a novel version of the algorithm. The new algorithm is then applied to the dynamic scheduling problem of AGVs in container terminal (the problem defined in Chapter 4 and modeled as the MCF-AGV).
