Professional Documents
Culture Documents
Queuing Theory Diagnostic With Fuzzy Approach
Queuing Theory Diagnostic With Fuzzy Approach
Queuing Theory Diagnostic With Fuzzy Approach
ISSN No:-2456-2165
Abstract:- Queuing theory is a classical mathematical According to Zadeh [16] crisp queues are not more
method to analyze the congestions and delays of waiting realistic as compare to fuzzy queues. These queueing models
in line. It deals with number of customers waiting in line are most suitable in case of multiple servers when crisp
and many other aspects of queues. Our objective of the queues are extended into fuzzy queues. Queueing theory is
study has to develop a new fuzzy queuing model. The used to develop the mathematical models for customer
study intends to examine the long-run behavior and services. The main uniqueness of system can characterize by
determination of the steadiness of queuing system. For customers and servers. Queue is basically a line where people
this purpose the Buckley method has been applied. In this wait and served. Arrival rate follows Poisson distribution at
study Buckley method has extended using the trapezoidal a given time, whereas classical queueing models follow
shaped fuzzy numbers which are introduced to find the discrete distributions with continuous distribution of service
explicit formula for membership function of the fuzzy time.There is some time needed to wait and served. So, time
estimation to develop a new fuzzy queuing model. Fuzzy between service and arrival rates depends on probability
approach has been applied for measuring different distribution.
linguistic factors in queuing systems. The results
concluded that fuzzy queueing model is stable and bounds Fuzzy queueing method is a more realistic approach
obtained by Buckley estimates are at least good as than classical queueing theory methods if service time
compare to bounds obtained by membership function. explained in possibilistic way. Fuzzy approach is quite
different from crisp set approach because its boundary is
Keywords:- Fuzzy Queuing, Steady State, Trapezoidal defined with a limited membership degree. In steady-state
Technique. behavior of the model, its parameters are not time-varying. In
case of steady state ρ < 1 means that arrival rate is lower than
I. INTRODUCTION the service rate and steady state occurs and queue size is
small. On contrary, when ρ > 1 steady state solution does not
Queueing theory is a probabilistic approach to deal with exist for queue size and service rate is slower than arrival rate.
the queuing system. Queuing theory was first introduced by The queue will become longer and longer with time and
Calls and Erlang [8] by keeping the congestion problem in system will explode. When ρ = 1 steady state condition do
telephone exchange and introduced the basis for exponential not hold because of random nature of queue. In addition,
and Poisson distribution in queuing theory. queue will infinitely increase. The state of statistical
equilibrium is reached from any starting state. The process
Queue is actually a row where people wait for their turn remains in statistical equilibrium once it has reached. In real
to get the services. Queuing theory deals with one of the most world situations queueing behavior is finite. There is strong
unpleasant experiences of life i.e. waiting. Queues problem is effect of more than one customer on future arrival distribution
commonly found in banks, airport hubs, blood bank, when size of customers is small. When size of population is
telecommunications and emergency medical services. finite then ending time of one service and time of next call
People face cost of long queues in term of money and service follow exponential distribution. Likewise, service
resources. Due to congestion it is difficult to facilitate each time follows exponential distribution. Theoretically system
and every person to fulfill their heavy demands. It deals with reaches to steady state as time changes. Steady-state
number of customers waiting in line and many other aspects performance refers to the performance of a system with time-
of queue. Queueing theory is helpful to develop efficient stationary parameters that has been in operation for a
queuing systems which at one hand reduce customer wait sufficiently long time which have no longer affects the
times and in contrast the number of customers will increase distributions of number in system, number in different
that can be served. A queuing system is therefore, queues, waiting times, and total delay. In contrast, transient
characterized by three components which are Arrival process, queues arise when either system parameters are not time-
Service mechanism and Queue discipline. Queues are stationary or the queueing system does not remain in
classified by crisp queues and fuzzy queues. Crisp queue operation long enough to reach a steady state. The steady
deals with probabilistic approach for performance measures. state performance of queue is referred the negligible effect of
The “service time” and “interarrival time” follow Poisson starting position of server where no one is in the queue or
distribution. In real world cases both the service and arrival plenty of customers reaching before the server is started. The
rates described subjectively. In fuzzy approach service and steady state condition can be achieved in different ways for
arrival rates are described in possibilistic way because most different situations. For example, car is needed four vehicles
statistical data is gathered subjectively. to reach at steady state. On the other hand, momentary
behavior will take place in absence of steady state. This short
In this study, membership function is constructed using The primary objective of research is to analyze the
trapezoidal fuzzy numbers i.e. service rate and arrival rate fuzzy approach on multiple server queuing models. Study
and alpha-cut approach is useful to find the higher and lesser area is major hospital of Islamabad where the service quality
bounds of function. Robert (2010) has used α-cut method of services is evaluated and also user satisfaction of patients
used to explain the performance and fuzzy priority discipline in a queue and the evolution of the queuing system. If the
queuing system. Likewise, for fuzzy queue system Negi and arrival and service rate is inexact the performance measures
Lee [13] have employed alpha-cut and two-variable will also be inexact.
simulation. The main drawback in their study is that their
approach provides an only crisp solution and cannot explain We are intended here to develop a new fuzzy queuing
the queueing system. In addition, Li and Lee [12] have used model. We have considered the fuzzy queuing model in
general approach of Zadeh principle for fuzzy model. different systems.
Another study has done by Jau-Chuan et al [2006] in which
membership function for crisp queues have been constructed Multiple Servers Fuzzy Queuing Models
in non linear parametric models. The multiple servers multiple queues system is basic
queuing model observed in counter when there is two or more
The alpha-cuts method has used by many researchers than two servers to dealing with customers and this model is
which is the most used on fuzzy queueing theory. notified as FM/FM/c, where FM/FM represents the fuzzy
Unfortunately, this method is manually difficult and arrivals and departures of customers and c denote number of
inappropriate because it will require for each station, to solve servers in the system. Queuing models would have wider
two mathematical programs called PNLP (Parametric Non appliance when the crisp queueing system with many
Linear Programming). To solve this problem our study is attendants are expanded to many attendants of fuzzy
used to compute the steady state behavior which allows us to queueing system.
compute these performance measures separately.
General Procedure
There are few studies done on the determination of The ‘membership function’ of different ‘performance
steadiness of queuing system. measures’ are,
v u v u
found at steady state. ,vR k 1 k 1 (2)
shape function R z WS can be attained if ‘ WSL ’ and
U 1
The Parametric Non Linear Program
‘ WSU ’are invariable with respect to ‘ ’ and help to make In FM/FM/1 queue, both the arrival and service rate are
fuzzy numbers and is represented by = [4, 5, 6, 7] and
membership function ‘ ws ’.
= [35, 37, 40, 42], per hour assumed the arrivals are served as
L(z), z1 ≤ z ≤ z2 FCFS basis in the system. At possibility level the
confidence of interval as [ 4 ,7 ] and [2 + 35, 42
ws z = 1, z2 ≤ z ≤ z3
– 2 ].
{R(z), z3 ≤ z ≤ z4
The Parametric Non Linear Program for the
Membership Function of
Membership Function for ‘ LS ’
‘Ws’
The performance measure in which we are interested is In multiple queuing model both incoming and utility
u rates fuzzy numbers are shown by
Ls i.e Pu, v Ls . = [4, 5, 6, 7] and = [35, 37, 40, 42]. At possibility level
v
1 k 1 k k k 1
the confidence interval are shown below
Ls
1 k 1 1
(3)
[uL , uU ] [min -1 , max 1 ] 4 ,7
Following the membership function for ‘ LS ’ is written as [vL , vU ] [min -1 , max 1 ] 2 35,42 2 (7)
~ u , ~ v
(4) WS
v 2uv u 2
2
LS z
SUP
min (v u)(v 2 u 2 )
z 1 k 1 k
X x.Y y k k 1
1 1
k 1
As a result the smallest ‘ Ws ’ occurs when ‘ u ’ is at its
The lower bounds ‘ L ’ and upper bounds ‘ L ’of the α-cuts
L
S
U
S
lower bound 4 and ‘ v ’ is its upper bound
of LS are given below 42 2 , therefore by using equation (1) we obtained
Ls
L min
1 k 1 k k k 1 WSL = 38 3 (8)
1 k 1 1
u ,vR (5) (3 2 176 1748)
By solving these equations we get the limit values of z
L
Where in (5) ‘ Ls ’represents the average mean length of 1 1
z 0, z .021 and z 0, z .022
lower bound of the system. 46 45
1 k 1 k k k 1 In contrast, for maximization, the largest values of ‘ u ’ and
Ls umax
U
1 k 1 1
,vR (6)
smallest values of ‘ v ’ are required, therefore by using
equation (2) we obtained,
Where in (6) ‘ LS U ’ represents the average mean length
(3 28)
of upper bound of the system. Left shape function W (9)
(3 154 1176)
U
2
S
L z Ls and a right shape function L z Ls
L 1 U 1
can
be attained If ‘ LS L ’ and ‘ LS ’are invariable with respect to ‘
U
l ( )
a ua ( ) l ( )
b ub ( ) lws ( ) uws ( )
ub ( ) lLs ( ) uLs ( )
l ( )
a ua ( ) l ( )
b