The assigned counter number might change later as the queue is dynamic. Given there are more than one counter present at the location. It will start with one again if the system is restarted.Īssign counter: It can assign user a counter with the smallest queue, The token number starts with one and increments by one. Provide token number: It provides the customer with a unique token number that distinguishes Compiling twilio and smtplib codes in a seperate file is suggested before moving on to views.py file. You might also need to lower the security of your email account for it to work. If you want to use the SMS or email privileges, you need to fill details at line 10-19 and uncomment those lines. I have also commented the codes in the same file at lines 90-104, 142-156, 290-304. You need to fill those details if you want to use them. I have left the variables for both as a blank string at top in views.py file. Twilio API is used to send SMS and smtplib module is used to send emails. This page can be accessed at if you localhost it. Only one phone number can be registered at a time. OTP can minimize the risk of fraudulent login attempts. The user will receive an OTP on their phone via SMS and email. Register user: The software is able to register user by asking their name, phone numberĪnd email address. The software is able to perform the following operations: The 4th and 5th person of 2nd queue will be assigned 3rd and 4th position of 1st counter and the 6th person of counter 2 will naturally get the 4th position of counter 2. So, the algorithm will work in the following way: If we take the last 2, it would be easier to implement but unfair to the people who came before them. 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. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |