You are on page 1of 1

DSC tutorial 3

1.
CV arrival time = 0
CV service time = 1
Process utilization = (1/10)/(1/9) = 9/10
Waiting time = 9*(9)*(1/2) = 40.5
Queue length = 40.5*1/10 = 4.05
2.
CV arrival time = 1
CV service time = 0
Process utilization = (1/8)/(1/9) = 9/8
Since service time < arrival, time waiting time does not decrease but increases as more customers arrive,
therefore there is no average waiting time and queue length.
Increase the number of servers to minimum level since lambda > mew and solve for average time
3.
Arrival rate = 0.87 passenger per minute
1/Service time = 3 minute
M > 0.87/(1/3) = 2.61
Smallest M = 3
Resulting utlilisation = 52/(3*20) = 86.67%
If something follows exponential distribution, CV = 1
4.
CV arrival time = 1
Arrival rate = 18 or 0.3 films per minute
Service time = mean 30 SD 30
Cost of equipment = $100/hr
Average expected result time = 40
Process Utilization = 0.3*30 = 9
Minimum m = 10
When m = 10,
Process utilization = 0.3*30/10 = 0.9
Therefore waiting time =

40minutes = service time + waiting time, but since service time is the same, can only change waiting time.
Trial and error such that waiting time is within acceptable range.
Inter-arrival time/ Service time is exponentially distributed => CV = 1

You might also like