Please use this identifier to cite or link to this item:
Title: Performance analysis and buffer allocations in some open assembly systems
Keywords: Mathematical Models
Queueing Networks
State-Space Methods
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.
ISSN: 0305-0548
Appears in Collections:Article

Files in This Item:
File Description SizeFormat 
Hemachandra444230.pdf102.25 kBAdobe PDFThumbnail

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