-
Statistical Analysis Of The Queuing System In A Bus Terminal
[A CASE STUDY OF NEKEDE BUS TERMINAL]
CHAPTER ONE -- [Total Page(s) 5]
Page 2 of 5
-
-
-
It
is the fluctuation in arrival and service patterns that causes wait in
queuing system. Waiting line models assume that customers arrive
according to a Poisson probability distribution, and service times are
described by an exponential distribution. The poisson distribution
specifics the probability that a certain number of customers will arrive
in a given time period. The exponential distribution described the
service times as the probability that a particular service time will be
less than or equal to a given amount of time. A waiting line priority
rule determines which customer is served next. A frequently used
priority rule is first come first served. Other rules include best
customers first, high-test profit customer first, emergencies first,
relatives and friends first, closest units first, last in first served,
quickest to service first, Elderly people, women and children first,
random order, very important person (VIPS) first and so on. Although
each priority rule has merit, it is important t use the priority rule
that best supports the overall organization strategy. The priority rule
used affects the performance of waiting line system.
ASSUMPTION INHERENT IN QUEUING SYSTEM
Basic single server model assumes customers are arriving at poisson
arrival rate with exponential service times and first come, first
services queue discipline, and infinite queue length, and infinite
calling population. By adding additional resources to single server
system either service rate can be decreased with additional cost
overhead. In single server single-phase system, customer is served once
completed.
Common examples of single server singe-phase are teller
counter in a bank, a cashier counter in super, market, automated
ticketing machine at rain station. In single server queuing system wait
time or performance of system depend on efficiency of serving person or
service machine. Single server single-phase queuing system is most
commonly automated system found in our regular life. For examples many
superstores have replaced manual counters with automated machines.
Single server multiple-phase incorporates division of work into phase to
keep waiting line moving as completion of whole complete operation
might increase wait in a line. Common examples of the these systems are
automatic or manual car wash drive through restaurants.
QUEUING THEORY
Queuing Theory is the mathematical study of waiting lines (or queues).
The theory enables mathematical analysis of several related processes
including arriving at the (back of the) queue, waiting in the queue
(essentially a storage process), and being served by the servers at the
front of the queue. Theory permits the derivation and calculation of
several performance measures including the average waiting time in the
queue or the system, the expected number waiting or receiving and the
probability of encountering the system in certain states, such as empty
full, having an available server or having to wait a certain time to be
served.
CHAPTER ONE -- [Total Page(s) 5]
Page 2 of 5
-
-
ABSRACT - [ Total Page(s): 1 ]The need to reduce the length of queue (waiting time) forms the basis of this research. This project work centers on the queuing system witnessed at the Nekede bus terminal; and a single serve queuing system was adopted in the analysis. The basic aim and objectives of this research is to identify the distribution of the arrival and service and finding out if increasing the number services (terminal) would tend to reduce the waiting time in the system. Different probability distribution where use ... Continue reading---
