DSpace
 

DSpace at IIT Bombay >
IITB Publications >
Article >

Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/jspui/handle/10054/1208

Title: Performance analysis and buffer allocations in some open assembly systems
Authors: HEMACHANDRA, N
EEDUPUGANTI, SARAT KUMAR
Keywords: mathematical models
queueing networks
state-space methods
synchronization
probability
Issue Date: 2003
Publisher: Elsevier
Citation: Computers & Operations Research 30(5), 695-704
Abstract: 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.
URI: 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
ISSN: 0305-0548
Appears in Collections:Article

Files in This Item:

File Description SizeFormat
Hemachandra444230.pdf102.25 kBAdobe PDFView/Open
View Statistics

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

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback