Page 1 of 10

Journal for Studies in Management and Planning

Available at http://internationaljournalofresearch.org/index.php/JSMaP

e-ISSN: 2395-0463

Volume 01 Issue 09

October 2015

Available online: http://internationaljournalofresearch.org/ P a g e | 83

Queuing Theory Application to Banks ATM Service Delivery.

(A Case Study of EcoBank Plc, Okigwe.)

O.D. Adubisi, Dr. E. Otuonye, Dr. J. Ohakwe

Department of Mathematics and Statistics, Federal University Wukari, Taraba State, Nigeria.

Department of Statistics, Abia State University Uturu, Abia State, Nigeria.

Department of Mathematics and Statistics, Federal University Otuoke, Bayelsa State, Nigeria.

Email: obinnadubisi@yahoo.com

Abstract

This study applies queuing theory to assess

the utility function of the ATM service

delivery. In other to achieve this, the basic

characteristics of the case ATM as a

queuing system were defined. The primary

source of data collection was adopted for

this study and is limited to Ecobank plc,

Okigwe records on direct observation of the

number of customers including each

customer’s arrival and service time

respectively, during the peak hours of

8:00am to 2:00pm for a period of ten (10)

working days. The study revealed that the

service pattern did not follow the

exponential distribution as described by

queue theory which lead to the application

of Pollaczek-Klintcline formula. The M/G/1

queuing model best described the ATM

queuing system. The study further revealed

that the traffic intensity of the system is

0.521 (52.1%), which implied that the

system was operating under the steady- state condition. The average waiting time in

the system and in the queue are 6.1 and 3.2

minutes which implies that on arrival

customers are expected to wait in the

system for approximately six (6) minutes at

the ATM Service facility.

Keywords:

Bank ATM; M/G/1 model; Queuing theory;

Waiting time; Service rate; Arrival rate;

Pollaczek-Khintchine formula

1. Introduction

Every business organization faces the

problem of waiting line or queue,

irrespective of the kind of service they offer

to the public. Queuing theory had its

beginning in the research study of a Danish

engineer named A.K Erlang in which he

experimented with fluctuating demand in

telephone traffic (Hillier and Lieberman,

2015; Taha, 2007). Queuing theory is the

mathematical study of waiting lines. The

theory enables mathematical analysis of

several related processes, including

arriving at the back of the queue, waiting in

the queue and being served by the service

facility server(s) at the front of the queue

(Taha, 2007) while (Murthy, 2007) stated

that queuing theory is the present system of

tying a belt with time to the hands of a

customer.

Given the rapid growth in population and

the advancement in technology, queuing

theory has become very helpful in so many

areas such as bank management. In queuing

theory, a queuing model is used to

approximate a real queuing situation, so

that the queuing behaviour can be analyzed

mathematically. The automated teller

machine (ATM) is a computerized telecom

device designed to provide effective and

efficient financial services to bank

customers at the shortest possible time but

due to variation in arrival and service time,

customers still have to wait for a long

period of time before they are served which

Page 2 of 10

Journal for Studies in Management and Planning

Available at http://internationaljournalofresearch.org/index.php/JSMaP

e-ISSN: 2395-0463

Volume 01 Issue 09

October 2015

Available online: http://internationaljournalofresearch.org/ P a g e | 84

eventually leads to queue formation (Bakari

et.al, 2014).

1.1 Statement of the problem

Queues or waiting lines arise when the

demand for service exceeds the capacity of

a service facility. One of the major

challenges bank customers encounter in

banks is waiting line. Hence it becomes

pertinent that a study of this kind be

conducted in order to assist the bank

management in making certain decisions in

an effort to minimize the time customers

spend waiting in line at the ATM service

facility.

2. Queuing theory

Queuing theory is the study of waiting

lines. It uses queuing models to represent

the various types of queuing system

(systems that involves queues of some

kind) that arise in practice (Hillier and

Lieberman, 2015). Therefore, queuing

theory is used extensively to analyze any

system exhibiting random variability in

terms of arrival and service times.

According to (Bakari et.al, 2014), it also

provides techniques for maximizing a

system capacity to meet the service demand

to drastically reduce the waiting time.

2.1.1 Queuing system

A queue system is a birth-death process

with a population consisting of customers

either waiting for service or currently in

service. A birth occurs when there is an

arrival at the service facility while a death

occurs when there is a departure from the

facility. A queuing system can best be

described by customer’s arrival pattern, the

service pattern (service mechanism), and

the queuing discipline as well as by the

customer’s behaviour. The assumptions of

the birth-and-death process indicate that

probabilities involving how the process will

evolve in the future depend only on the

current state of the process, and so are

independent of events in the past (Hillier

and Lieberman, 2015).

2.1.2 Little’s Queuing formula

It is impossible to deal with queuing

systems without mentioning and

introducing the Little’s law. In order to

determine the waiting time and the size of a

queue for a particular system, the Little’s

law is normally used. John D. C. Little

provided the first rigorous proof of

L  W, this equation sometimes is

referred to as Little’s formula. (Moshe,

2013), Consider a system to which

continuously and indefinitely arrivals

come, stay for a while, and then leave. In

particular, nobody gets stuck there for

good. Let

be the limit average rate of

arrivals (which of course coincides with the

limit departure rate), let

W

be the limit

average time spent in the system per arrival,

and let L be the limit average number in the

system in a steady state condition. Assume

that all these limits exist. Hence, the Little’s

equation can be written as

L  Ws

(System) (1)

Lq

 Wq

(Queue) (2)

2.1.3 Queuing Discipline

Queues are a part of everyday life events.

We all wait in lines or join a queue to buy a

movie ticket, make a bank deposit, pay for

groceries, mail a package, obtain food in a

cafeteria, and start a ride in an amusement

park. The order in which arrivals to these

queues are selected for service is what we

termed queuing discipline. The most

common queuing discipline is the first

come, first served (FCFS) as defined in this

study; other disciplines include last come,

first served (LCFS) and the service in

random order (SIRO). Individuals in the

queue may also be selected based on some

order of priority. It is important to express

that the queuing discipline chosen by the

service facility would invariably affect the

waiting time of customers in the system

(Hillier and Lieberman, 2015).

2.2 Queue Characteristics

Page 3 of 10

Journal for Studies in Management and Planning

Available at http://internationaljournalofresearch.org/index.php/JSMaP

e-ISSN: 2395-0463

Volume 01 Issue 09

October 2015

Available online: http://internationaljournalofresearch.org/ P a g e | 85

(Murthy, 2007) stated that queuing systems

can be described by four (4) basic elements.

These elements are: the arrival pattern,

queue discipline, capacity of the service

system and the customer’s behaviour.

According to (Taha, 2007), a queuing

system is characterized by five (5) basic

elements which includes: the customer’s

arrival pattern, the system service pattern,

the numbers of servers in the service

facility, capacity of the service system and

the queuing discipline.

2.2.1 Source Population

It represents the set of customers that are

expected to patronize a service facility. It is

from the source population that customers

are generated to join the queue. The source

is said to be finite, if it has a limit on the

number of customers it will accommodate

while it is infinite if there is no limit on the

number of customers. The number of

arrivals over a specified time interval

follows a Poisson distribution with mean

, that is

 



, , , ,...,

!

n 01 2

n

P

n

n

2.2.2 The Arrival Pattern

It represents the pattern in which customers

arrive and enter the system from a calling

population. It is most times referred to as

the input process of the system. The inter- arrival time is used most times to specify

the input process (which is the time

between consecutive arrivals to the service

facility). This can be deterministic or it may

be a random variable whose probability

distribution is assumed to be exponentially

distributed. The arrival process is also

known to follow the Poisson process,

specifically the Poisson distribution. It is

also of interest to know whether customers

arrive in a single form or in batches and

whether balking, reneging or jockeying is

permitted.

2.2.3 The Service Pattern

The service pattern is usually specified by

the service time of the system (time

required by a server to serve a customer).

The duration of service might depend on

the number of customers already in the

service facility or it might be independent

of the state of the system. The service time

may be deterministic or it may be a random

variable whose probability distribution is

assumed to be exponentially distributed or

not. It is also important to know whether

customers are attended to completely by

one server or by a sequence of servers. This

study assumes that customers in the defined

queuing system are completely serviced by

one single server.

2.2.4 Service Mechanism

This represents the configuration of the

service facility. The service mechanism

consists of one or more service facilities,

each of which contains one or more parallel

service channels, called servers. If there is

more than one service facility, the customer

may receive service from a sequence of

these service channels in series or enter one

of the parallel service channels and is

completely serviced by that server. A

queueing model must specify the

arrangement of the facilities and the

number of servers (parallel channels). The

time elapsed from the commencement of

service to its completion for a customer at a

service facility is referred to as the service

time (or holding time). The service time

distribution that is most frequently assumed

in practice is the exponential distribution

(Hillier and Lieberman, 2015). There are

five (5) basic service structures, which

includes:

1) Single server with a single queue.

2) Single server with multiple queues.

3) Multiple servers with a single queue.

4) Multiple servers with a multiple queues.

5) Multiple servers in series with a single

queue.

2.2.5 System Capacity