Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Consider a bank with a single bank teller, who can process any customer requests. Customers arrive to the bank, and if the bank teller
Consider a bank with a single bank teller, who can process any customer requests. Customers arrive to the bank, and if the bank teller is busy, the customers wait in the queue and are subsequently processed according to a first-in-first-out (FIFO) queuing discipline. If the teller is idle, customers are immediately processed. Assume that the teller may process only one customer at a time. Also, assume that each customer has only one request and the customer departs when her/his request is processed. Use the ordered interarrival times (1,3,5,4) and service times (5,2,1,3,2). Assume that the customers arrive to the bank in numerical sequence (first customer 1, then customer 2, then customer 3, then customer 4, customer part 5), and that customer 1 arrives to the bank at time zero. a) Perform a hand simulation of this system by completing the table below. Stop the simulation after all five customers have been processed. Arrival Service Time Time Time Customer Time Since Last Arrival Service Begins Time Time Customer Service Waits in Ends Queue Time Customer Spends in System Idle Time of Teller b) What is the average time a customer spends in the system? c) What is the probability that a customer has to wait in the queue? d) What is the fraction of idle time of the bank teller for the time period simulated? e) Is the average service time dependent on the interarrival times? Why or why not?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
This simulation is a common exercise in operations research and queuing theory Lets simulate the system for each customer and fill out the table with the given information Customer 1 Time Since Last A...Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started