Queues are people or goods in a line waiting to be served. The beginning of this theory is that it comes from a row of elements which if an element is added then the addition is in the back position and if an element is taken it is done at the front element. Queuing theory is a model theory that concerns the mathematical study of queues or waiting lines. The formation of waiting lines is something that usually happens when the need for a service exceeds the available capacity to provide the service. The purpose of the queuing system is to minimize total costs, namely costs due to queuing and costs due to adding service facilities, or direct costs of providing service facilities and indirect costs that arise because individuals have to wait to be served. There are two kinds of this element, namely enqueue means adding an element, dequeue to remove an element. Therefore, the queue is FIFO (first in first out), i.e. the data that is first entered into the queue is the data that is the first to come out of the queue. Queuing theory was proposed in 1909 by the Danish mathematician and engineer named Agner Kraup Erlang. The discovery occurred when there was a problem with the density of telephone usage at Copenhagen Telephone. The queuing system functions to manage customer queues effectively and efficiently so that it is possible to get the services they need easily and quickly without waiting too long and spending time and energy. We as humans usually always complain about long queues. Even though there is a definite determination that we will experience the longest queue. A queue that leads us to the path of eternal happiness, or the road to the worst place to return.
