ABSTRACT
In this chapter, an incomplete algorithm to the scheduling problem of automated guided vehicles (AGVs) is presented. We called it greedy vehicle search (GVS). To evaluate the relative strength and weakness of the network simplex plus algorithm (NSA+) and GVS, the results of the two algorithms are compared.
