In a bank there are 2 checkouts, each with its own row of infinite size: checkout 1 for “fast” customers, with a time of 2 minutes, and checkout 2 for “slow” customers, with a time of 16.4 minutes, in both cases with exponential distribution. “Slow” and “fast” customers arrive according to an exponential function, with mean 8 and 20 minutes/customer, respectively. Some days, in particular, only 1 cashier comes to work who has to serve both lines according to the following cyclical sequence; 5 “fast” clients and 2 “slow” clients. The time to move between the boxes is 0.33 minutes. Simulate the process in ProModel for 80 hours and determine: The average number of customers waiting in each queue. The optimal service sequence to minimize waiting time, considering both types of customers.
In a bank there are 2 checkouts, each with its own row of infinite size: checkout 1 for “fast” customers, with a time of 2 minutes, and checkout 2 for “slow” customers, with a time of 16.4 minutes, in both cases with exponential distribution. “Slow” and “fast” customers arrive according to an exponential function, with mean 8 and 20 minutes/customer, respectively. Some days, in particular, only 1 cashier comes to work who has to serve both lines according to the following cyclical sequence; 5 “fast” clients and 2 “slow” clients. The time to move between the boxes is 0.33 minutes. Simulate the process in ProModel for 80 hours and determine: The average number of customers waiting in each queue. The optimal service sequence to minimize waiting time, considering both types of customers.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
18. In a bank there are 2 checkouts, each with its own row of infinite size: checkout 1 for “fast” customers, with a time of 2 minutes, and checkout 2 for “slow” customers, with a time of 16.4 minutes, in both cases with exponential distribution. “Slow” and “fast” customers arrive according to an exponential function, with mean 8 and 20 minutes/customer, respectively. Some days, in particular, only 1 cashier comes to work who has to serve both lines according to the following cyclical sequence; 5 “fast” clients and 2 “slow” clients. The time to move between the boxes is 0.33 minutes. Simulate the process in ProModel for 80 hours and determine:
The average number of customers waiting in each queue.
The optimal service sequence to minimize waiting time, considering both types of customers.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
