Please use this identifier to cite or link to this item: https://doi.org/10.1080/00207540110054605
Title: Optimal dwell point location of automated guided vehicles to minimize mean response time in a loop layout
Authors: Lee, C. 
Ventura, J.A.
Issue Date: 20-Nov-2001
Source: Lee, C., Ventura, J.A. (2001-11-20). Optimal dwell point location of automated guided vehicles to minimize mean response time in a loop layout. International Journal of Production Research 39 (17) : 4013-4031. ScholarBank@NUS Repository. https://doi.org/10.1080/00207540110054605
Abstract: An important control issue in operating an automated guided vehicle system is where to locate idle vehicles. Dwell points for idle vehicles affect the performance of manufacturing systems. A polynomial time algorithm has been developed to determine dwell points for idle automated guided vehicles that minimize the mean response time. Both uni- and bidirectional loop layouts are considered. The proposed algorithm, based on a dynamic programming model, partitions the set of pick-up stations into subsets so that a single vehicle serves all stations in a subset. The dynamic programming algorithm has been streamlined by applying certain optimality properties. Computational results show that the proposed algorithm can solve large-scale problems in a reasonable time. A simulation experiment has also been conducted to compare several idle vehicle positioning rules, and the results show that best performance is obtained by positioning idle vehicles in dwell points that minimize the mean response time.
Source Title: International Journal of Production Research
URI: http://scholarbank.nus.edu.sg/handle/10635/63233
ISSN: 00207543
DOI: 10.1080/00207540110054605
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

10
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

9
checked on Nov 19, 2017

Page view(s)

30
checked on Dec 17, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.