Finite Buffer Closed Lines - Illustration of Buffering Principle and Diminishing Returns Principle
We consider a closed line with four stations wih parameters as given in the following table. All times are in minutes. Moreover, process times are assumed deterministic (constant) and the time to failure and repair follow the exponential distribution. Note that, since Station 3 has the longest process time and all failure parameters are identical, it is the bottleneck of the line.
|
Station |
Processing Time |
Mean Time to Repair |
Mean Time to Failure |
|
Station 1 |
1.0 |
1.0 |
5.0 |
|
Station 2 |
1.0 |
1.0 |
5.0 |
|
Station 3 |
1.2 |
1.0 |
5.0 |
|
Station 4 |
1.0 |
1.0 |
5.0 |
We assume that there is an unlimited buffer in front of Station 1, but that all other buffers (i.e., between Stations 1&2, 2&3, and 3&4) are finite and equal. The following figure plots the throughput as a function of WIP for various buffer sizes. Note that WIP level refers to the total number of jobs allowed in the line, which is held constant, while the buffer sizes refer to the maximum number of jobs that can accumulate between stations.
|
|
|
Effect of Buffer Size on Throughput for Closed Lines |