Abstract :
We study automated guided vehicle systems that contain multiple vehicles. Each vehicle transports an item from a certain point to its destination. The inter-arrival time of items to each node is assumed to be independently and geometrically distributed. Each node has an infinite buffer capacity, and thus no item is lost. The deadhead time of the empty vehicle and the transportation time of the loaded vehicle are assumed to be arbitrarily distributed. We propose two empty vehicle dispatching policies, and numerically calculate the waiting time distributions of the items for each policy using a state-space reduction technique for Markov chains. Several examples are given to demonstrate the advantages and disadvantages of each policy.
