Question: Design, implement, test, and document a probabilistic simulation of a queueing system with several queues and several servers, one server for each queue, as in
Design, implement, test, and document a probabilistic simulation of a queueing system with several queues and several servers, one server for each queue, as in a grocery or discount store. Because there are several lines, each arriving customer always joins the line that is currently the shortest. If several lines are equally short, the new arrival may join any one of them. A line with a free teller is "shorter" than one whose teller is occupied. Once in a line, a customer does not leave it until served.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
