Mean queue time approximation of tandem queues with finite buffer
Tandem queues are the fundamental structure of queuing networks. Existing studies on tandem queues have mostly assumed infinite buffer capacities in order to approximate mean queue times. However, this is not possible in practical production environments due to limited floor space. This paper he...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/53278 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | Tandem queues are the fundamental structure of queuing networks. Existing studies on tandem queues have mostly assumed infinite buffer capacities in order to approximate mean queue times. However, this is not possible in practical production environments due to limited floor space.
This paper hence considers a queuing system with two single servers in tandem with an intermediate buffer of finite capacity between the two servers. The buffer in front of the first server is assumed to be of infinite capacity. By assuming Poisson arrivals and gamma distributed service times, simulations are carried out to study the properties and behaviour of tandem queues with finite buffer. Through these simulations, the variation of queue times with several factors such as buffer capacity, mean service times and square coefficient of variation are evaluated. In particular, stability of tandem queues with finite buffer will be discussed. |
|---|