Record Details

Performance analysis and buffer allocations in some open assembly systems

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Performance analysis and buffer allocations in some open assembly systems
 
Creator HEMACHANDRA, N
EEDUPUGANTI, SARAT KUMAR
 
Subject mathematical models
queueing networks
state-space methods
synchronization
probability
 
Description This paper considers a finite capacity fork–join queueing model for open assembly systems with arrival and departure synchronizations and presents an approach for enumerating the state space and obtaining the steady state probabilities of the same for such a model under exponential assumptions. Several performance measures like the throughput of the system, fraction of arrivals that actually enter into the system, utilizations of the work stations, etc., are obtained. Further, design of such fork–join systems in terms of buffer size configurations for maximizing the throughput of the system, or for minimizing the mean waiting time of a typical job, or for minimizing the Work-In-Process of the system is done using the above performance prediction approach. Such optimal configurations exhibit some interesting features.
 
Publisher Elsevier
 
Date 2009-04-23T11:39:41Z
2011-11-25T21:17:09Z
2011-12-26T13:08:49Z
2011-12-27T05:34:11Z
2009-04-23T11:39:41Z
2011-11-25T21:17:09Z
2011-12-26T13:08:49Z
2011-12-27T05:34:11Z
2003
 
Type Article
 
Identifier Computers & Operations Research 30(5), 695-704
0305-0548
http://dx.doi.org/10.1016/S0305-0548(02)00034-5
http://hdl.handle.net/10054/1208
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1208
 
Language en