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

113_徐鹏飞_114_舒向阳_112_武海龙_Project_2
..........................................\project2
..........................................\........\client.cpp
..........................................\........\client.h
..........................................\........\creat_queue.h
..........................................\........\custom.txt
..........................................\........\main.cpp
..........................................\........\project2.dsp
..........................................\........\project2.dsw
..........................................\........\project2.ncb
..........................................\........\project2.opt
..........................................\........\project2.plg
..........................................\........\queue.cpp
..........................................\........\queue.h
..........................................\........\strategys.cpp
..........................................\........\strategys.h
..........................................\........\strategy_1.cpp
..........................................\........\strategy_1.h
..........................................\........\strategy_1.txt
..........................................\........\strategy_2.cpp
..........................................\........\strategy_2.h
..........................................\........\strategy_2.txt
..........................................\........\strategy_3.cpp
..........................................\........\strategy_3.h
..........................................\........\strategy_3.txt
..........................................\........\strategy_simulation_1.txt
..........................................\........\strategy_simulation_2.txt
..........................................\........\strategy_simulation_3.txt
..........................................\........\算法简介.doc

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．