Cost Analysis of FM /Fm/1 Queueing System

International Journal of Computer Application
Available online on http://www.rspublication.com/ijca/ijca_index.htm
Issue 4, Volume 1 (February 2014)

ISSN: 2250-1797
COST ANALYSIS OF FMX/FM/1 QUEUEING SYSTEM

Mrs.K.Julia Rose Mary
Assistant professor,
Department of Mathematics,
Nirmala College for women,
CBE-18.
Ms.T.Gokilavani
PG student,
Department of Mathematics,
Nirmala College for women,
CBE-18.
______________________________________________________
ABSTRACT
This paper deals with a mathematical mixed integer non-linear programming method to
find the membership function of the total expected cost (TEC) of a FMX/FM/1 bulk arrival
queueing model in which the arrival rate, service rate, batch size, service cost and holding cost
are taken as fuzzy numbers. The -cut approach is used to transform a fuzzy queue into a family
of conventional crisp queues. By means of membership function of the TEC, a set of parametric
non-linear program is developed to describe the family of crisp single server bulk arrival queues.
Further, numerical illustration is also given which helps to determine the validity of the proposed
approach.
KEYWORDS
Fuzzy sets, membership functions, -cut and Zadehs extension principles.
______________________________________________________
INTRODUCTION
Gaver [2] introduced bulk arrival queues, where the arrival could be in batches. There are
numerous literature available for bulk arrival with bulk service. Regarding the control policy of
service, Yadin and Naor [14] introduced an N-policy for M/M/1 queuing model, which turns on
the server whenever N or more customers present in the system and turns off the server when the
system becomes empty. Lee and Srinivasan [6] and later Lee et al [7] successively combined the
R S. Publication (rspublication.com), rspublicationhouse@gmail.com
Page 129


ISSN: 2250-1797
batch arrival queues with N-policy. Rue and Roshen shine [12], Neuts [10] and Stidham [13]
dealt with the control policy on arrivals, where not all arriving batches were allowed to join the
system at all times. Such restrictions may be necessary in many real life situations also.
In many practical applications, the statistical information may be obtained subjectively.
That is the arrival pattern and service pattern are more suitably described by linguistic
terms such as fast, slow rather than by probability distributions. Thus, the fuzzy queues are
much more realistic than the commonly used crisp queues. Li and Lee [8] investigated the
analytical results for two typical fuzzy queues, M/F/1, FM/FM/1 where F represents fuzzy time
and FM represents fuzzified exponential distribution using Zadehs extension priniciple. Negi
and Lee [9] proposed a procedure by using the -cut two variables simulation to analyze fuzzy
queue. By using the parametric programming Kao., et al [5] also constructed the membership
functions of the system characteristics for fuzzy queues and successively applied them to four
simple fuzzy queues namely, M/F/1, F/M/1, F/F/1 and FM/FM/1. Moreover by using the same
approach Chen [1] developed FM/FM/1 and FM/FM[k]/1 fuzzy system.
Later, a single server fuzzy queue with unrealiable server was introduced by
Kalayanaraman, Thilligovindan and Kannadhasan [4]. Further, Jeeva and Rathnakumari [3]
analyzed the bulk arrival single server Bernoulli feedback queue with fuzzy vacations and fuzzy
parameters. Recently Ritha and Lilly Robert [11] developed the profit analysis of fuzzy M/E K/1
queuing system by using non-linear programming techniques.
Thus in this paper we develop a method which is able to provide TEC for bulk arrival
queues with fuzzified exponential arrival rate, service time, batch size, service cost and holding
cost. The basic idea is to apply the -cuts and Zadehs extension principle to transform the
fuzzy bulk queues to a family of crisp bulk arrival queues. As the value varies, the crisp bulk
arrival queues are then described and solved by a pair mixed integer non-linear programming
(MINLP) technique. Thus the solution of MINLP successfully yield the membership function of
the TEC.
Page 130


ISSN: 2250-1797
FUZZY BULK ARRIVAL QUEUE WITH FUZZY SERVICE COST AND HOLDING
COST
In MX/M/1 queuing model, the customers arrive in batches in accordance with a time of
homogeneous poisson process with group arrival rate .The actual number of customers in any
module is considered to be a random variable X. By introducing, the fuzzy variables for arrival
rate , service rate , batch size x, service cost Cs, and the holding cost Ch are then represented
by the fuzzy sets as , , x, C s and Ch respectively. Let the membership function , , x, C s and
Ch are denoted by (x ), ( y ), x ( z ),C ( s) andC (t ) respectively. Then the fuzzy sets are
s
described as,
{x, ( x); x X } ; { y, ( y ); y Y } ; x {z,x ( z); z Z}

Cs {s,C ( s); s S} ; Ch {t,C (t ); t T }
s
where X,Y,Z,S and T are crisp universal sets of the arrival rate, service rate, expected batch size,
service cost and holding cost respectively.
Let us denote the characteristics of interest by f(x,y,z,s,t), then f ( , , x, Cs , Ch ) is a fuzzy
number since , , x, C s and Ch are fuzzy variables. Using Zadehs extension principle, the
membership function of the system characteristic f ( , , x,Cs , Ch ) is defined by
f ( , , x ,C , C ) ( z )
s
sup
xX , yY , zZ ,sS ,tT
min{ ( x), ( y),x ( z),C ( s),C (t ) / z}

s
where z=f(x,y,z,s,t).
Then, the total expected cost for FMX/FM/1 bulk arrival is given by
xE(z2 ) E(z)
2(y xE(z)
f(x,y,z,s,t)= s zt
-----------(1)
Thus, the membership function for the expected cost becomes,
TEC ( z)
sup
xX , yY , zZ ,sS ,tT
min{ ( x), ( y),x ( z),C (s),C (t ) / z} ------------(2)

s
xE( z 2 ) E ( z )
.
Where z= s zt
2( y XE ( z )
Page 131


ISSN: 2250-1797
Now, we approach the problem by using mixed integer non-linear programming technique.
These parametric non-linear programs are developed to find the -cuts of f ( , , x,Cs , Ch )
based on the extension principles.
THE MIXED INTEGER NON-LINEAR PROGRAM

To construct the membership function TEC (z) we have to derive the -cuts of TEC. Thus,
the -cuts of , , x, C s and Ch are defined as,
{x X / ( x) } ; { y Y / ( y ) } ; x {z Z / x ( z) }
C {s S / C ( s) } ; C {t T / C (t ) }
s
Here, , , x , C and C are crisp sets rather than fuzzy sets. Since , , x, C s and Ch
s
are assumed to be fuzzy numbers, -cuts are defined for the crisp intervals , their another
form as,
= [min {x X / ( x) } , max{x X / ( x) } ] = [ ( ) L , ( ) U ]
= [min {y Y / ( y ) } , max{y Y / ( y ) } ] = [ ( ) L , ( ) U ]
x = [min {z Z / x ( x) } , max {z Z / x ( x) } ] = [ ( s) L , ( s) U ]
C = [min {s S / C ( s) } , max{s S /C ( s) } ] = [ ( s) L , ( s) U ]
s
C = [min {t T / C (t ) } , max {t T / C (t ) } ] = [ (t ) L , (t ) U ]
h
As a result the bound of these intervals can be described as functions of and hence we
get
1
x max ( )
y max ( )
x min ( )
L
y min ( )
L
z minx ( )
L
s minC ( )
L
t minC ( )
L
z max x ( )
U
s max C ( )
U
t max C ( )
U
Page 132


ISSN: 2250-1797
Now, by making use of the -cuts for the total expected cost, we construct the
membership function of equation (1) which is parameterized by . Thus, to derive the
membership function of TEC, we have to find the left and right shape function of TEC (z) . By
using
extension
Zadehs
TEC (z)
principle
becomes
the
minimum
of
{ ( x), ( y),x ( z),C ( s),C (t )} .To derive the membership functionTEC (z) , we need at least
s
xE( z 2 ) E ( z )
satisfies TEC (z) = .
one of the following cases to hold such that z= s zt
2
(
y
XE
(
z
)
Case 1
( x) , ( y) ,x ( z) ,C ( z) ,C ( z)
s
Case 2
( x) , ( y) ,x ( z) ,C ( z) ,C ( z)
s
Case 3
( x) , ( y) ,x ( z) ,C ( z) ,C ( z)
s
Case 4
( x) , ( y) ,x ( z) ,C ( z) ,C ( z)
s
Case 5
( x) , ( y) ,x ( z) ,C ( z) ,C ( z)
s
This can be achieved by using the parametric non-linear programming technique. Hence,
the lower and upper bounds of the -cuts of case (1) are,
E( z 2 ) E( z)
E( z 2 ) E( z)
} ; (TEC )U1 max{s zt
}
(TEC )L1 min{s zt
2( y XE ( z )
2( y XE ( z )
For case (2) are,
E( z 2 ) E( z)
E( z 2 ) E( z)
} ; (TEC )U 2 min{s zt
}
(TEC )L2 min{s zt
2( y XE ( z )
2( y XE ( z )
Similarly we
( ),
( ),
can
x( ),
formulate
Cs ( )
the
and
other
Ch ( )
cases
also.
From
the
definition
of
we find that they are replaced by
Page 133


ISSN: 2250-1797
x [ xL , xU ], y [ yL , yU ], z [ zL , zU ], s [sL , sU ], t [tL , tU ] .Then, the -cuts of nested structures

are given by,
[ x1 , x1 ] [ x2 , x2 ] ; [ y1 , y1 ] [ y2 , y2 ] ; [ z1 , z1 ] [ z2 , z2 ]
L
[s1 , s1 ] [s2 , s2 ] ; [t1 , t1 ] [t2 , t2 ] Where 0 2 1 1.

L
Thus, the feasible region defined by 2 are larger than those defined by 1 . Then
L (TEC)L and (TEC)U (TEC)U . That is the left shape function is non-decreasing and
(TEC)
the right shape function is non-increasing and we can find the value of lower bound (TEC )L and
the upper bound (TEC )U which can be written as,
E ( z 2 ) E ( z )
E ( z 2 ) E ( z )
U
L
; (TEC ) max s zt
(TEC ) mins zt
2( y XE ( z ))
2( y XE ( z ))
If both (TEC )L and (TEC )U are invertible with respect to , then the left shape function
L( z) [(TEC )L ]1 and the right shape function R( z) [(TEC )U ]1 can be derived from which
the membership function TEC (z) can be constructed as,
L( z )
TEC ( z ) 1
R( z )
(TEC )L 0 z (TEC )L 1
(TEC )L 1 z (TEC )U 1
(TEC )U 1 z (TEC )U 1
In most cases, the values of (TEC) L and (TEC)U can be solved analytically. From the
above result the shape of TEC (z)
[(TEC) , (TEC)
L
can be estimated from the set of intervals
], [0,1] although the exact function is not known.
NUMERICAL RESULTS
In FMX/FM/1 queuing system, by letting , , x, C s and Ch as fuzzy variables, they are
described by
=[1,2,3,4],
=[2,3,4,5],
x = [5,6,7,8],
C s =[1000,2000,3000,4000],
and
Ch = [30,40,50,60].Then, their lower bound and upper bound are given by

Page 134


ISSN: 2250-1797
[ xL , xU ] [1 ,4 ]; [ yL , yU ] [2 ,5 ]
[ zL , zU ] [5 ,8 ]; [sL , sU ] [1000 1000,4000 1000 ]
[tL , tU ] [30 10 ,60 10 ]. Then, we have
[(5 )2 (5 )]
(TEC )L (1000 1000) [(5 )(30 10 )]

2((2 ) (1 )(5 ))
-----(3)
[(8 )2 (8 )]
(TEC )U (4000 1000 ) [(8 )(60 10 )]

2((5 ) (4 )(8 )) ----(4)
By substituting the values of , between [0, 1] in equations (3) and (4) the values of
TECL and TECU are found. The calculated values are tabulated and the graph is drawn.
The cuts for the performance
The membership function of
measure of TEC
(TEC) L
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
1750
1800.63
1863.95
1936.15
2014.84
2098.42
2185.78
2276.12
2368.88
2463.62
2560.00
TEC
(TEC)U
4640
4532.4101
4425.0551
4317.9468
4211.0988
4104.5259
3998.2451
3892.2757
3786.6395
3681.3616
3576.4706
1
0.8
0.6
TEC(L)
0.4
TEC (u)
0.2
0
1500 2000 2500 3000 3500 4000 4500 5000
With the help of the Excel, we perform cuts for batch arrival rate, service rate, batch
size, service cost and holding cost at eleven distinct levels of 0, .1 ,.2, 1. Crisp intervals for
fuzzy TEC at different levels of are tabulated in table. The graph depicts the rough shape of
TEC constructed from values. We note that the rough shape function turns out rather fine and
looks like a continuous function. Moreover the - cut determines that the TEC of the associate
range.
Page 135


ISSN: 2250-1797
CONCLUSION
This paper develops a method to find out the membership function of TEC, where in the
batch arrival size, arrival rate; service rate, service cost and the holding cost are fuzzy. The idea
is based on Zadehs extension principle to transform the bulk arrival crisp queues that can be
described by two pairs of MINLP models. Since the TEC is expressed by means of membership
function rather than by a crisp value, it maintains the fuzziness of input information and the
results can be used to represent the fuzzy system more accurately.
BIBLIOGRAPHY
[1].Chen,S.P. Parametric non-linear programming approach to fuzzy queues with bulk service,
European Journal of Operations research, volume.163,(2005), pp:434-444.
[2].Gaver,D.P. Imbedded Markov Chain Analysis of a waiting line process in continuous time,
Annals of Mathematical Statistics, volume.30,(1935), pp:698-720.
[3].Jeeva,M. and Rathnakumari,E. Bulk arrival single server, Bernoulli feedback queue with
fuzzy vacations and fuzzy parameters, ARPN, volume.2 No.5, June(2012), pp:492-499.
[4].Kalyanaraman,R., Thilligovidan,N., and Kannadasan,G. A single server fuzzy queue with
unrealiable server, IJCC, volume.8 No.1, March(2010), pp:1-4.
[5].Kao,C., Li,C., and Chen,S. Parametric programming to the analysis of fuzzy queues, Fuzzy
sets and system, 107,(1999), pp:93-100.
[6].Lee,H.S. and Srinivasan,M.M. Control policies for the MX/G/1 queueing system,
Management sciences, volume.35 No.6,(1989), pp:708-721.
[7].Lee,H.W., Lee,S.S., and Park,J.O. Operating characteristics of M X/G/1 queue with Npolicy, Queueing system, volume.15,(1994), pp:387-399.
[8].Li,R.J. and Lee,E.S. Analysis of fuzzy queues, Computers and Mathematics with
Applications, volume.17(7),(1989), pp:1143-1147.
[9].Nagi,D.S. and Lee,E.S. Analysis and simulation of fuzzy queues, Fuzzy sets and systems,
46,(1992), pp:321-330.
[10].Neuts,M.F. M/G/1 queue with the limited number of admission period during each service
time, Technical Report number 978,(1984), University of Delawara.
Page 136


ISSN: 2250-1797
[11].Ritha,W. and Lilly Robert, Profit analysis of fuzzy M/Ek/1 queueing system non-linear zero
one programming approach, IJAIR, volume.1,(2), July(2012), pp:1-14.
[12].Rue,R.C. and Roshen shine, Some properties of optimal control policies for entries to an
M/M/1 queue, Navel Research Logistic Quarterly 28,(1981), pp:520-532.
[13].Stidham,S.
Optimal
Control
of
admission
to
queueing
system,
IEEC,
Trans.Automat.Control 30,(1985), pp:705-713.

[14].Yadin,M. and Naor,P. Queueing systems with a removable service station, Journal
Operation Research.SOC,14(4),(1963), pp:393-405.
Page 137

Cost Analysis of FM /Fm/1 Queueing System

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cost Analysis of FM /Fm/1 Queueing System

Uploaded by

Copyright:

Available Formats

International Journal of Computer Application

Available online on http://www.rspublication.com/ijca/ijca_index.htm

Issue 4, Volume 1 (February 2014)

COST ANALYSIS OF FMX/FM/1 QUEUEING SYSTEM

International Journal of Computer Application

Issue 4, Volume 1 (February 2014)

R S. Publication (rspublication.com), rspublicationhouse@gmail.com

International Journal of Computer Application

Issue 4, Volume 1 (February 2014)

{x, ( x); x X } ; { y, ( y ); y Y } ; x {z,x ( z); z Z}

min{ ( x), ( y),x ( z),C ( s),C (t ) / z}

Thus, the membership function for the expected cost becomes,

min{ ( x), ( y),x ( z),C (s),C (t ) / z} ------------(2)

International Journal of Computer Application

Issue 4, Volume 1 (February 2014)

THE MIXED INTEGER NON-LINEAR PROGRAM

R S. Publication (rspublication.com), rspublicationhouse@gmail.com

International Journal of Computer Application

Issue 4, Volume 1 (February 2014)

we find that they are replaced by

R S. Publication (rspublication.com), rspublicationhouse@gmail.com

International Journal of Computer Application

Issue 4, Volume 1 (February 2014)

x [ xL , xU ], y [ yL , yU ], z [ zL , zU ], s [sL , sU ], t [tL , tU ] .Then, the -cuts of nested structures

[s1 , s1 ] [s2 , s2 ] ; [t1 , t1 ] [t2 , t2 ] Where 0 2 1 1.

can be estimated from the set of intervals

], [0,1] although the exact function is not known.

Ch = [30,40,50,60].Then, their lower bound and upper bound are given by

International Journal of Computer Application

Issue 4, Volume 1 (February 2014)

[tL , tU ] [30 10 ,60 10 ]. Then, we have

(TEC )L (1000 1000) [(5 )(30 10 )]

(TEC )U (4000 1000 ) [(8 )(60 10 )]

The cuts for the performance

The membership function of

International Journal of Computer Application

Issue 4, Volume 1 (February 2014)

R S. Publication (rspublication.com), rspublicationhouse@gmail.com

International Journal of Computer Application

Issue 4, Volume 1 (February 2014)

Trans.Automat.Control 30,(1985), pp:705-713.

R S. Publication (rspublication.com), rspublicationhouse@gmail.com

You might also like