Question: Question 1: Consider the Able-Baker problem. Able always gets the first customer whenever both are idle. Interarrival time is uniformly distributed between 1 and 4,
Question 1: Consider the Able-Baker problem. Able always gets the first customer whenever both are idle.
Interarrival time is uniformly distributed between 1 and 4,
Able service time is exponentially distributed with a mean 3,
Baker Se service time is exponentially distributed with a mean 5.
Simulate the problem for 100 customers for 5 replications using arena program and filling in the simulation table given below.
| Average waiting time in queue | |
| Probability that a customer has to wait in queue | |
| Fraction of idle time of ABLE | |
| Fraction of idle time of BAKER | |
| Average service time for ABLE | |
| Average service time for BAKER | |
| Average time between arrivals | |
| Average waiting time of those who had to wait | |
| Average time a customer spends in the system |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
