TY - JOUR
T1 - Performance analysis of a multiple vehicle tandem system with inter-vehicle buffers and blocking
AU - Petering, Matthew E.H.
AU - Seo, Jaeyoung
AU - Lee, Chulung
N1 - Funding Information:
This work was supported by the Korean Science and Engineering Foundation Project R01-2006-000-10941-0 ‘Design and distributed simulation of reconfigurable manufacturing systems’.
Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2007/1
Y1 - 2007/1
N2 - We analyze a new tandem system in which items are transported through a sequence of stations from an origin to a destination via a series of vehicles that move back and forth between consecutive stations. Each pair of consecutive stations is connected by a single vehicle with unit capacity that travels back and forth between the upstream and downstream station. Each vehicle travels with an item in the downstream direction and without an item in the upstream direction. The stations act as holding areas for items awaiting further transport within the system. Stations may have non-identical capacities. We model this system as a continuous time Markov chain and develop a recursive algorithm for generating the state transition matrix. After solving for the steady state probabilities using the Gauss-Seidel method, we compute the average throughput rate, average number of items in the system, and average sojourn time for various system configurations.
AB - We analyze a new tandem system in which items are transported through a sequence of stations from an origin to a destination via a series of vehicles that move back and forth between consecutive stations. Each pair of consecutive stations is connected by a single vehicle with unit capacity that travels back and forth between the upstream and downstream station. Each vehicle travels with an item in the downstream direction and without an item in the upstream direction. The stations act as holding areas for items awaiting further transport within the system. Stations may have non-identical capacities. We model this system as a continuous time Markov chain and develop a recursive algorithm for generating the state transition matrix. After solving for the steady state probabilities using the Gauss-Seidel method, we compute the average throughput rate, average number of items in the system, and average sojourn time for various system configurations.
KW - Material handling system
KW - Production line
KW - Tandem system
KW - Throughput
KW - Vehicle
UR - http://www.scopus.com/inward/record.url?scp=33751425926&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33751425926&partnerID=8YFLogxK
U2 - 10.1016/j.compind.2005.11.007
DO - 10.1016/j.compind.2005.11.007
M3 - Article
AN - SCOPUS:33751425926
VL - 58
SP - 3
EP - 11
JO - Computers in Industry
JF - Computers in Industry
SN - 0166-3615
IS - 1
ER -