Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.