Share This Article:

On Optimal Ordering of Service Parameters of a Coxian Queueing Model with Three Phases

Abstract Full-Text HTML XML Download as PDF (Size:671KB) PP. 61-68
DOI: 10.4236/ojop.2015.43008    2,480 Downloads   2,847 Views
Author(s)    Leave a comment
We analyze a Coxian stochastic queueing model with three phases. The Kolmogorov equations of this model are constructed, and limit probabilities and the stationary probabilities of customer numbers in the system are found. The performance measures of this model are obtained and in addition the optimal order of service parameters is given with a theorem by obtaining the loss probabilities of customers in the system. That is, putting the greatest service parameter at first phase and the second greatest service parameter at second phase and the smallest service parameter at third phase makes the loss probability and means waiting time minimum. We also give the loss probability in terms of mean waiting time in the system. is the transition probability from j-th phase to  phase . In this manner while and this system turns into queueing model and while the system turns into Cox(2) queueing model. In addition, loss probabilities are graphically given in a 3D graph for corresponding system parameters and phase transient probabilities. Finally it is shown with a numeric example that this theorem holds.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

Sağlam, V. , Sağır, M. , Yücesoy, E. and Zobu, M. (2015) On Optimal Ordering of Service Parameters of a Coxian Queueing Model with Three Phases. Open Journal of Optimization, 4, 61-68. doi: 10.4236/ojop.2015.43008.

 [1] Cox, D.R. (1955) A Use of Complex Probabilities in the Theory of Stochastic Processes. Mathematical Proceedings of the Cambridge Philosophical Society, 51, 313-319. http://dx.doi.org/10.1017/S0305004100030231 [2] Asmussen, S., Nerman, O. and Olsson, M. (1996) Fitting Phase-Type Distributions via the EM Algorithm. Scandinavian Journal of Statistics, 23, 419-441. [3] He, Q.M. and Zhang, H. (2007) An Algorithm for Computing Minimal Coxian Representations. INFORMS Journal on Computing, 20, 179-190. [4] Zobu, M., Saglam, V., Sagir, M., Yücesoy, E. and Zaman, T. (2013) The Simulation and Minimization of Loss Probability in the Tandem Queueing with Two Heterogeneous Channels. Mathematical Problems in Engineering, 2013, Article ID: 529010. [5] Marie, R. (1980) Calculating Equilibrim Probabilities for Queues. ACM Sigmetrics Performance Evaluation Review, 9, 117-125. [6] Bertsimas, D.J. and Papaconstantinou, X.A. (1988) Analysis of the Stationary Queueing System. European Journal of Operational Research, 37, 272-287. http://dx.doi.org/10.1016/0377-2217(88)90336-0 [7] Snyder, P.M. and Stewart, W.J. (1985) Explicit and Iterative Numerical Approaches to Solving Queueing Models. Operations Research, 33, 183-202. http://dx.doi.org/10.1287/opre.33.1.183 [8] Krishnamurthy, A., Suri, R. and Vernon, M. (2004) Analysis of a Fork/Join Synchronization Station with Inputs from Coxian Servers in a Closed Queueing Network. Annals of Operations Research, 125, 69-94. http://dx.doi.org/10.1023/B:ANOR.0000011186.14865.19 [9] He, Q.M. and Zhang, H. (2007) Coxian Approximations of Matrix-Exponential Distributions. Calcolo, 44, 235-264. http://dx.doi.org/10.1007/s10092-007-0139-7 [10] Fackrell, M. (2009) Modelling Healthcare Systems with Phase-Type Distributions. Health Care Management Science, 12, 11-26. http://dx.doi.org/10.1007/s10729-008-9070-y [11] Zadeh, A.B. (2012) A Batch Arrival Queue System with Coxian-2 Server Vacations and Admissibility Restricted. American Journal of Industrial and Business Management, 2, Article ID: 18843. [12] Saglam, V., Ugurlu, M., Yücesoy, E., Zobu, M. and Sagir, M. (2014) On Optimization of a Coxian Queueing Model with Two Phases. Applied and Computational Mathematics, 3, 43-47.

comments powered by Disqus

Copyright © 2018 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.