Implementation of a queue with priority with parameterizable variables to improve QoS

Abstract

Listen

Translate article

This article presents the implementation of a priority queue with simulated parameterized components on the scenario of a banking institution in which four main elements were used: 1) the dispenser, 2) the cashier(s), 3) the server that receives and assigns the priority of the turns, and 4) a screen that displays the order of the turns. In any banking institution, there is always a large number of users that require attention, so they implement special turns to give priority to customers, improving the quality of service. One of the important elements within the cycle of service provision is related to the waiting lines, commonly called queues. Basically one queue is managed with the First-In, First-Out discipline. In this aspect, disciplines such as queuing theory help to understand the behavior of queues by examining all the components of the waiting lists. One of the most used disciplines for the management of a queue, is the enqueue with priority. In a priority queue, the element with the highest priority is removed before any other elements. The research was carried out using mainly a quantitative approach. The main goal of this type of research is the formulation and demonstration of theories and seeks that the studies carried out can be replicated. The algorithm implemented highly parameterizable allowed the correct simulation of a priority queue that can be taken as a basis for a subsequent application in any type of organization.