Queuing Systems In The Workplace:

2282 Words10 Pages
Efficiency would be a good word to bear in mind when describing a queuing system. A queuing system is a mathematical studying of lines and more specifically, waiting in lines. This type of study includes a wide range of topics such as traffic control, hospital bed occupancy, resource allocation in library systems and the use of waiting line models in banks or other services. The mathematical study of queuing systems is almost one hundred years old. Agner Krarup Erlang, a Danish engineer who worked for the Copenhagen Telephone Exchange, published the first paper on queuing theory in 1909 with a focus on traffic engineering (www.referenceforbusiness.com/encyclopedia/Pro-Res/Queuing-Theory.html). In 1953, David G. Kendall began to describe the characteristics of a queuing model. This included arrival time distribution (A), service time distribution (B) and number of servers (C) or A/B/C queuing notation (www.referenceforbusiness.com/encyclopedia/Pro-Res/Queuing-Theory.html). The arrival rate of a queuing system is random in nature and as a result, models are based on very strong assumptions that may or may not be satisfied. Due to this nature, the notion of simulation is very important and essential due to the fact that many systems are not soluble at all. Even though queuing theory seems to be anything but pin point accurate, it is very important because of the trade-off between the various costs of providing service and the costs associated with waiting for the service (or leaving the system without being served). As North America continues its transformation from an industrialized society to a service society, there is a greater emphasis towards the high quality of service. High-speed service is expensive, but compared to the costs caused by customers waiting in line (or in the queue), prompt service costs are minimal. Long queues also cost a lot

More about Queuing Systems In The Workplace:

Open Document