Queue management system7/18/2023 ![]() ![]() But the question is which 2 out of those 6 people. Hence, we can transfer 2 people from 2nd counter to 1st counter to balance it out. Now, 1st counter has 2 people and 2nd counter has 6 people in it. length of largest queue > length of smallest queue + 1.Ĭonsider there are 2 counters, one counter attended people faster than the other. It will work till the condition is satisfied i.e. The person at position (3 + 2) of largest queue will be transferred to last position (3 + 1) of smallest queue and so on. For example, if smallest queue has 3 people in it, the algorithm will find the largest queue, say queue of length 7. ![]() It finds the largest and smallest queue and transfers some people from the largest to the smallest queue if the new position of the person would be better than before. This algorithm works whenever the 'next customer' button is clicked by any employee which rearranges the queue accordingly. The user will also be notified through SMS and email when its their turn. Registration, the user will be sent to a webpage where they can check their position and counter number using token number. A confirmation of their registration will alsoīe sent to their mobile number as SMS and their email address. The queue and provide them with a token number. The user can use their mobile phone to scan a QR code and be redirected to a webpage which will be used to register the user into The customer can book their place in the queue and can estimate the expectedĭuration of his turn while being in a comfortable place. Instead of standing in long queues, the software attempts to provide a way by which Stores, fast food restaurants and other institutions where long queues are present. This project is aimed to optimize the current queue system being used in retail
0 Comments
Leave a Reply. |