Locating workstations in tandem automated guided vehicle systems

This paper presents a new solution framework to locate the workstations in the tandem automated guided vehicle (AGV) systems. So far, the research has focused on minimizing the total flow or minimizing the total AGV transitions in each zone. In this paper, we focus on minimizing total cumulative flow among workstations. This objective allocates workstations to an AGV route such that total waiting time of workstations to be supplied by the AGV is minimized. We develop a property which simplifies the available mathematical formulation of the problem. We also develop a heuristic algorithm for the problem. Computational results show that our heuristic could yield very high-quality solutions and in many cases optimal solutions.