Abstract

Queuing is an important component of a process in service. Queues are formed in a company or institution due to customers. Disorderly queues are a big problem for all concerned. Where, disorderly queues occur at University Prima Indonesia at the time of tuition payment so that the campus has to carry out a crowded queue process and students have to stand waiting for the next call resulting in less effective and efficient even waste of energy for students and employees. This research designed a system of tuition payment queues using the First In First Out (FIFO) algorithm which aims to reduce the time students are queuing at the checkout at the time of tuition payment so as not to wait too long so that the time of students and campus employees is not wasted too much and reduce the crowded queue time. The result of this study is an android-based tuition payment system, which is useful for reducing student build up when paying tuition. Thus it can be said that the calculation result of P0 queue has a result of 0.25%, and the number of customers 3 people, the average customer in the queue has a value of 2.25, the total customer time is 20 minutes, and the average customer time in the row is 15 minutes, the server busy time is 0.75, and the server’s empty time is 0.25%.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.