Case study queue

Waiting in line is a part of everyday life because as a process it has several important functions. Queues are a fair and essential way of dealing with the flow of customers when there are limited resources. Negative outcomes arise if a queue process isn’t established to deal with overcapacity.

At its core, a queuing situation involves two parts. Someone or something that requests a service—usually referred to as the customer, job, or request. Someone or something that completes or delivers the services—usually referred to as the server. To illustrate, let’s take two examples.

Stacks and queues are special cases of the idea of a collection. Each is characterized by four operations: create the collection, insert an item, remove an item, and test whether the collection is empty.

Queuing nodes are classified using the notation A/S/c/K/N/D where: For example, think of an ATM. It can serve: one customer at a time; in a first-in-first-out order; with a randomly-distributed arrival process and service distribution time; unlimited queue capacity; and unlimited number of possible customers.