Optimal location of workstations in tandem automated-guided vehicle systems
- 312 Downloads
The way workstations are located in a tandem automated-guided vehicle (AGV) systems affect the total lateness of the system. So far, almost all studies have focused on either minimizing the total flow or minimizing the total AGV transitions in each zone. This study presented a novel approach to locate the workstations in a tandem AGV zones by developing a new mixed-integer programming (MIP) formulation. The objective is to minimize total waiting time of all workstations which is equivalent to minimizing the total lateness of each zone. Lateness is defined as the total idle time of a workstation waiting to be supplied by an AGV. The proposed MIP formulation is very competitive and has the capability to solve instances of up to 25 workstations to optimality in a reasonable amount of time.
KeywordsZone workstation layout Tandem AGV Waiting time Total cumulative flow
Unable to display preview. Download preview PDF.
- 1.Tompkins JA, White JA, Bozer YA, Tanchoco JMA (2003) Facilities planning, 3rd edn. Wiley, New YorkGoogle Scholar
- 3.Bozer YA, Srinivasan MM (1989) Tandem configurations for automated guided vehicle systems offer simplicity and flexibility. Ind Eng 21(2):23–27Google Scholar
- 9.Tavakkoli-Moghddam R, Aryanezahd MBG, Kazemipoor H, Salehipour A (2008) A threshold accepting algorithm for partitioning machines in tandem automated guided vehicle. Int J Eng Sci 19(1–2):33–42Google Scholar
- 11.Fahmy SA, Shalaby MA, Elmekkawy TY (2005) A multi-objective partitioning algorithm for tandem AGV system. 35th Int Conf Comput Industrial Eng 715–720Google Scholar
- 12.Shalaby MA, Elmekkawy TY, Fahmy SA (2005) A cost based evaluation of a zones formation algorithm in tandem AGV systems. Int J Adv Manuf Technol 31(1–2):175–187Google Scholar
- 16.Asef-Vaziri A, Laporte G, Sriskandarajah C (2000) The block layout shortest loop design problem. IIE Trans 32:724–734Google Scholar
- 27.Eijl E (1995) A polyhedral approach to the delivery man problem. Memorandum COSOT 95, Eindhoven University of TechnologyGoogle Scholar
- 28.Sarubbi JFM, Luna HPL (2007) A flow formulation for the minimum latency problem. Int Network Optim Conf (INOC)Google Scholar