Design a java program that simulates a checkout line at a supermarket. The line is a queue object. Customers (i.e., customer objects) arrive in random integer intervals of from 1 to 4 minutes. Also, each customer is serviced in random integer intervals of from 1 to 4 minutes. Obviously, the rates need to be balanced. If the average arrival rate is larger than the average service rate, the queue will grow infinitely. Even with “balanced” rates, randomness can still cause long lines. Run the supermarket simulation for a 12-hour day (720 minutes), using the following algorithm: Choose a random integer between 1 and 4 to determine the minute at which the first customer arrives .At the first customer’s arrival time, do the following: Determine customer’s service time (random integer from 1 to 4). Begin servicing the customer. Schedule the arrival time of the next customer (random integer 1 to 4 added to the current time). For each minute of the day, consider the following: If the next customer arrives, proceed as follows: Enqueue the customer. Schedule the arrival time of the next customer. If service was completed for the last customer, do the following: Dequeue next customer to be serviced. Determine customer’s service completion time (random integer from 1 to 4 added to the current time). Now run your simulation for 720 minutes and answer each of the following: What is the maximum number of customers in the queue at any time? What is the longest wait any one customer experiences? What happens if the arrival interval is changed from 1 to 4 minutes to 1 to 3 minutes?
Design a java program that simulates a checkout line at a supermarket. The line is a queue object. Customers (i.e., customer objects) arrive in random integer intervals of from 1 to 4 minutes. Also, each customer is serviced in random integer intervals of from 1 to 4 minutes. Obviously, the rates need to be balanced. If the average arrival rate is larger than the average service rate, the queue will grow infinitely. Even with “balanced” rates, randomness can still cause long lines. Run the supermarket simulation for a 12-hour day (720 minutes),
using the following
Choose a random integer between 1 and 4 to determine the minute at which the first customer arrives
.At the first customer’s arrival time, do the following:
Determine customer’s service time (random integer from 1 to 4).
Begin servicing the customer.
Schedule the arrival time of the next customer (random integer 1 to 4 added to the current time).
For each minute of the day, consider the following:
If the next customer arrives, proceed as follows:
Enqueue the customer.
Schedule the arrival time of the next customer.
If service was completed for the last customer, do the following:
Dequeue next customer to be serviced.
Determine customer’s service completion time (random integer from 1 to 4 added to the current time).
Now run your simulation for 720 minutes and answer each of the following:
What is the maximum number of customers in the queue at any time?
What is the longest wait any one customer experiences? What happens if the arrival interval is changed from 1 to 4 minutes to 1 to 3 minutes?
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
