A Multiple-Server Waiting Line System OM Student - Multiple server model
(only edit green-shaded cells)
Input: Input the arrival rate,
service rate, number of
lambda Arrival rate = 5 per hour servers, and n for
mu Service rate = 2 per hour calculating the
probability of n
No. of servers, s = 6 customers in the
system.
Output:
Po = 0.082
Pw = 0.047
Pn = 0.082 n=
Average number in the system (L) = 2.53
Average number in the queue (Lq) = 0.03
Average time in the system (W) = 30.41 minutes
Average time in the queue (Wq) = 0.41 minutes
n P(n)
1 1.0000
2 3.5000
3 6.6250
4 9.2292
5 10.8568
6 11.6706
7 12.0097
8 12.1308
9 12.1686
10 12.1791
11 12.1817
12 12.1823
13 12.1825
14 12.1825
15 12.1825
16 12.1825
17 12.1825
18 12.1825
19 12.1825
20 12.1825
rho is lmabda/k(number of servers)*mu which is always less than 1.
L*Maintainenace Cost+Number of Servers*Labour Cost
300 1210.167
75