Description: The realization of the mathematical model of bank queuing
Question:
N bank has n Windows open to the outside world, each window can only receive one customer at a time
The time of arrival and processing of n customers is different (random generation).
N USES the list queue to simulate the total processing and processing time
N hypothesis
N is not allowed to queue, the handover time of different customers is ignored
Strategy I:
strategy
The customer selects the unattended window to handle first
If not, queue at the least number of Windows
discuss
The minimum number of people is not likely to be dealt with as soon as possible
If the customer finds that the queue in other Windows is less than the number of the other Windows, he is not in the line
Strategy II:
strategy
The customer arrived and waited
Which window is processed, that is, to handle the next number of customers
discuss
Will some customers have less waiting time?
Is the total waiting time reduced?
Strategy 3:
strategy
Open a window to handle large customers
Big customers are different from other customer selection systems
The processing time of a large customer exceeds a certain threshold
Customers can handle other customers temporarily if they have no customers
discuss
Which customers will have less waiting time?
Whether the total waiting time will be reduced
File list (Check if you may need any files):
Download