<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">OJOp</journal-id><journal-title-group><journal-title>Open Journal of Optimization</journal-title></journal-title-group><issn pub-type="epub">2325-7105</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/ojop.2015.43008</article-id><article-id pub-id-type="publisher-id">OJOp-59155</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject><subject> Engineering</subject><subject> Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  On Optimal Ordering of Service Parameters of a Coxian Queueing Model with Three Phases
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>edat</surname><given-names>Sağlam</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Murat</surname><given-names>Sağır</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Erdinç</surname><given-names>Yücesoy</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Müjgan</surname><given-names>Zobu</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff2"><addr-line>Department of Statistics, Amasya University, Amasya, Turkey</addr-line></aff><aff id="aff1"><addr-line>Department of Statistics, Ondokuz May?s University, Samsun, Turkey </addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>vsaglam@omu.edu.tr(ES)</email>;<email>istatistikci_murat@hotmail.com(MS)</email>;<email>erdincyucesoy@gmail.com(EY)</email>;<email>mujganzobu@hotmail.com(MZ)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>25</day><month>08</month><year>2015</year></pub-date><volume>04</volume><issue>03</issue><fpage>61</fpage><lpage>68</lpage><history><date date-type="received"><day>8</day>	<month>June</month>	<year>2015</year></date><date date-type="rev-recd"><day>accepted</day>	<month>23</month>	<year>August</year>	</date><date date-type="accepted"><day>26</day>	<month>August</month>	<year>2015</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p><html>
 <head></head>
 
  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.
  <img src="Edit_9e9b06b5-4e61-4264-93cf-809ee34b1fe8.bmp" alt="" /> is the transition probability from 
  <em>j</em>-
  <em>th</em> phase to 
  <img src="Edit_4efd6538-650f-4c95-9e14-27b86c3339bf.bmp" alt="" /> phase 
  <img src="Edit_642152e4-70ea-4ee7-a3b2-fcd738358aea.bmp" alt="" /> . In this manner while 
  <img src="Edit_d0f1d8fc-1852-420e-9657-c72a9ea4f28b.bmp" alt="" /> and 
  <img src="Edit_acc67247-8657-4e17-b35a-4b5fd0ea612a.bmp" alt="" /> this system turns into 
  <img src="Edit_60f5b19b-6539-4612-bd76-5ccfa37c3f38.bmp" alt="" /> queueing model and while 
  <img src="Edit_ee79da2e-6f5f-4c23-9426-5028d848f7d6.bmp" alt="" /> 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.
 
</html></p></abstract><kwd-group><kwd>Stochastic Coxian Queueing Model</kwd><kwd> Loss Probability</kwd><kwd> Limiting Distribution</kwd><kwd> Optimization</kwd><kwd>  Kolmogorov Equations</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Phase-type queueing models are one of the essential parts of the stochastic queueing models. There is an urgent need to construct phase-type distributions for complex representations of queueing models. The recent works being done in this field are: D. R. Cox shows how any distribution having a rational Laplace transform can be represented by a sequence of exponential phases [<xref ref-type="bibr" rid="scirp.59155-ref1">1</xref>] . S. Asmussen, O. Nerman and M. Olsson gave a paper on fitting phase-type distributions with the EM Algorithm [<xref ref-type="bibr" rid="scirp.59155-ref2">2</xref>] . Q. -M. He and H. Zhang presented an algorithm for computing minimal ordered Coxian representations of phase-type distributions whose Laplace-Stieltjes transform had only real poles [<xref ref-type="bibr" rid="scirp.59155-ref3">3</xref>] . The optimal ordering of the tandem server with two stages is given by [<xref ref-type="bibr" rid="scirp.59155-ref4">4</xref>] . R. Marie studied on calculating equilibrium probabilities for Coxian queueing systems in [<xref ref-type="bibr" rid="scirp.59155-ref5">5</xref>] . X. A. Papaconstantinou analyzed the stationary E<sub>k</sub>/C<sub>2</sub>/s queueing system in [<xref ref-type="bibr" rid="scirp.59155-ref6">6</xref>] . P. M. Snyder and W. J. Stewart considered two approaches to the numerical solution of single node queueing models with phase-type [<xref ref-type="bibr" rid="scirp.59155-ref7">7</xref>] . In [<xref ref-type="bibr" rid="scirp.59155-ref8">8</xref>] , an exact analysis of a fork/join station in a closed queueing network with inputs from servers with two-phase Coxian service distributions is represented. Q. -M. He and H. Zhang studied the approximation of matrix-exponential distributions by Coxian distributions in [<xref ref-type="bibr" rid="scirp.59155-ref9">9</xref>] . M. Fackrell gave a survey of where the phase-type distributions were used in the healthcare industry and purposed some ideas on how they were further utilized [<xref ref-type="bibr" rid="scirp.59155-ref10">10</xref>] . A. B. Zadeh studied a batch arrival queue system with Coxian-2 server vacations and admissibility restricted in [<xref ref-type="bibr" rid="scirp.59155-ref11">11</xref>] . V. Sağlam et al. give a paper on optimization of a Coxian queueing model with two phases in [<xref ref-type="bibr" rid="scirp.59155-ref12">12</xref>] .</p><p>There is not enough work on the studies of optimizing the orders of service parameters for Coxian queueing model so far. Considering this fact in this paper we analyze a Coxian stochastic queueing model with three phases, and the Kolmogorov equations of this model are constructed, 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 by a theorem by obtaining the loss probabilities of customers in the system. We also give the loss probability in terms of mean waiting time in the system. Finally it is shown with a numeric example that this theorem holds.</p></sec><sec id="s2"><title>2. Stochastic Model</title><p>We have obtained stochastic equation systems of a Coxian queueing model with three servers in which the stream is Poisson with λ parameter. The service time of any customer at server i <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x12.png" xlink:type="simple"/></inline-formula> is exponential with parameter<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x13.png" xlink:type="simple"/></inline-formula>. Two or more customers can not have service in the system at the same time. Let <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x14.png" xlink:type="simple"/></inline-formula> be the state of server 1, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x15.png" xlink:type="simple"/></inline-formula>be the state of server 2 and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x16.png" xlink:type="simple"/></inline-formula> be the state of server 3 at any t time. <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x17.png" xlink:type="simple"/></inline-formula>is the transition probability from <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x18.png" xlink:type="simple"/></inline-formula> phase to <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x19.png" xlink:type="simple"/></inline-formula> phase <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x20.png" xlink:type="simple"/></inline-formula><sup> </sup>and 1 − α<sub>i</sub> be the loss probability of the system. This stochastic queueing model is illustrated in <xref ref-type="fig" rid="fig1">Figure 1</xref>. Limit probabilities, differential and difference equations of this system given later.</p>Limit Probabilities<p>Here <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x21.png" xlink:type="simple"/></inline-formula> is a three-dimensional Markov chain with continuous parameter and state space is <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x22.png" xlink:type="simple"/></inline-formula></p><disp-formula id="scirp.59155-formula735"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x23.png"  xlink:type="simple"/></disp-formula><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> A three phase coxian queueing model</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/2-2730093x24.png"/></fig><p>Kolmogorov differential equation for these probabilities is obtained. The probabilities of the process <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x25.png" xlink:type="simple"/></inline-formula> will be found for<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x26.png" xlink:type="simple"/></inline-formula>, namely</p><disp-formula id="scirp.59155-formula736"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x27.png"  xlink:type="simple"/></disp-formula><p>We write Equation (2) as follows as <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x28.png" xlink:type="simple"/></inline-formula></p><disp-formula id="scirp.59155-formula737"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x29.png"  xlink:type="simple"/></disp-formula><p>Furthermore, it is supposed that limiting distribution of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x30.png" xlink:type="simple"/></inline-formula> are exist as follow:</p><disp-formula id="scirp.59155-formula738"><label>. (4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x31.png"  xlink:type="simple"/></disp-formula><p>Steady-state equations for <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x32.png" xlink:type="simple"/></inline-formula> are obtained as following:</p><disp-formula id="scirp.59155-formula739"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x33.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula740"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x34.png"  xlink:type="simple"/></disp-formula><p>We define <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x35.png" xlink:type="simple"/></inline-formula> If we solve Equation (5) under condition (6), we obtain the following three dimension probability function:</p><disp-formula id="scirp.59155-formula741"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x36.png"  xlink:type="simple"/></disp-formula></sec><sec id="s3"><title>3. Obtaining the Measures of Performance</title><p>Let be the random variable that describes the number of customers in the system. The mean number of costumers:</p><disp-formula id="scirp.59155-formula742"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x37.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula743"><label>. (9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x38.png"  xlink:type="simple"/></disp-formula><sec id="s3_1"><title>3.1. The Coxian Queue Using Laplace Transform</title><p>Let W be the random variable that describes waiting time of customers in the system. Laplace transform of W</p><disp-formula id="scirp.59155-formula744"><label>. (10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x39.png"  xlink:type="simple"/></disp-formula><p>Mean waiting time in system of a customer for Cox(3) is found by formula (10)</p><disp-formula id="scirp.59155-formula745"><label>(11)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x40.png"  xlink:type="simple"/></disp-formula></sec><sec id="s3_2"><title>3.2. The optimization of Measures of Performance</title><p>Loss probability</p><p>Let <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x41.png" xlink:type="simple"/></inline-formula> be the loss probability of customer in the system. In this regards, since there is no queue in the system, loss probability is calculated as following:</p><disp-formula id="scirp.59155-formula746"><label>. (12)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x42.png"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3"><title>3.3. Optimal Order of Servers</title><p>We can put three different service parameters to three stages in 3! different position. In this case there are 6 different loss probabilities.</p><p>The following theorem is given on minimization of loss probability.</p><p>Theorem 1. 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 minimum. That is,</p><disp-formula id="scirp.59155-formula747"><label>(13)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x43.png"  xlink:type="simple"/></disp-formula><p>Proof. Let’s suppose<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x44.png" xlink:type="simple"/></inline-formula>. In this case we have,</p><disp-formula id="scirp.59155-formula748"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x45.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula749"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x46.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula750"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x47.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula751"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x48.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula752"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x49.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula753"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x50.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula754"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x51.png"  xlink:type="simple"/></disp-formula><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x52.png" xlink:type="simple"/></inline-formula>.</p><p>Similarly,</p><disp-formula id="scirp.59155-formula755"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x53.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula756"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x54.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula757"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x55.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula758"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x56.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula759"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x57.png"  xlink:type="simple"/></disp-formula><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x58.png" xlink:type="simple"/></inline-formula>.</p><p>Since,</p><disp-formula id="scirp.59155-formula760"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x59.png"  xlink:type="simple"/></disp-formula><p>we obtain</p><disp-formula id="scirp.59155-formula761"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x60.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula762"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x61.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula763"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x62.png"  xlink:type="simple"/></disp-formula><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x63.png" xlink:type="simple"/></inline-formula>.</p><disp-formula id="scirp.59155-formula764"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x64.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula765"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x65.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula766"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x66.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula767"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x67.png"  xlink:type="simple"/></disp-formula><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x68.png" xlink:type="simple"/></inline-formula>.</p><p>Finally,</p><disp-formula id="scirp.59155-formula768"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x69.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula769"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x70.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula770"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x71.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula771"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x72.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59155-formula772"><graphic  xlink:href="http://html.scirp.org/file/2-2730093x73.png"  xlink:type="simple"/></disp-formula><p>Corollary. Since,</p><disp-formula id="scirp.59155-formula773"><label>(14)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-2730093x74.png"  xlink:type="simple"/></disp-formula><p>the minimum value which makes <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x75.png" xlink:type="simple"/></inline-formula> minimum also makes <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x75.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x76.png" xlink:type="simple"/></inline-formula> mininmum.</p></sec></sec><sec id="s4"><title>4. Numerical Example</title><p>In this section the loss probabilities are calculated for some values of system probabilities and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x77.png" xlink:type="simple"/></inline-formula> probabilities. The calculated loss probabilities are given in <xref ref-type="table" rid="table1">Table 1</xref>. For the values<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x78.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x79.png" xlink:type="simple"/></inline-formula>;<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x80.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x81.png" xlink:type="simple"/></inline-formula>and for various values of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x82.png" xlink:type="simple"/></inline-formula> it is seen in <xref ref-type="table" rid="table1">Table 1</xref> that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x82.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x83.png" xlink:type="simple"/></inline-formula> has its minimum value, this shows that Theorem1 holds.</p><p>Under condition given in Theorem1, for the values<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x84.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x85.png" xlink:type="simple"/></inline-formula>;<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x86.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x87.png" xlink:type="simple"/></inline-formula>and for all values of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x88.png" xlink:type="simple"/></inline-formula> in domain set, the loss probabilities are calculated in <xref ref-type="table" rid="table2">Table 2</xref> and graphically given in 3D <xref ref-type="fig" rid="fig2">Figure 2</xref> in two different view angle. <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x89.png" xlink:type="simple"/></inline-formula>is indicated by green surface in this figure. As it is seen in this graph, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x90.png" xlink:type="simple"/></inline-formula>is minimum for all values of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x91.png" xlink:type="simple"/></inline-formula>. For a customer to have service at each stage it must be <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x92.png" xlink:type="simple"/></inline-formula> or it must be <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x92.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x93.png" xlink:type="simple"/></inline-formula> for the customer to leave the system after first stage.</p></sec><sec id="s5"><title>5. Conclusion</title><p>By constructing this stochastic queueing model, transient probabilities are obtained. Depending on these probabilities, mean number of customer in the system, the mean waiting time in this system by Laplace transform and the loss probability of any customer are given. It is shown by Theorem 1 that 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 minimum. For the values<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x94.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x94.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x95.png" xlink:type="simple"/></inline-formula>;<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x94.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x95.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x96.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x94.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x95.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x96.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x97.png" xlink:type="simple"/></inline-formula>and</p><fig-group id="fig2"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> The loss probabilities for <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x101.png" xlink:type="simple"/></inline-formula> and system parameters.</title></caption><fig id ="fig2_1"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/2-2730093x98.png"/></fig><fig id ="fig2_2"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/2-2730093x99.png"/></fig><fig id ="fig2_3"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/2-2730093x100.png"/></fig></fig-group><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Placing the service parameters to phases and corresponding loss probabilities</title></caption><table><tbody><thead><tr><th align="center" valign="middle"  colspan="3"  >Placing service parameters to phases</th><th align="center" valign="middle"  rowspan="2"  >Loss probabilities</th></tr></thead><tr><td align="center" valign="middle" >Phase 1</td><td align="center" valign="middle" >Phase 2</td><td align="center" valign="middle" >Phase 3</td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x102.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x103.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x104.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x105.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x106.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x107.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x108.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x109.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x110.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x111.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x112.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x113.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x114.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x115.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x116.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x117.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x118.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x119.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x120.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x121.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x122.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x123.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x124.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x125.png" xlink:type="simple"/></inline-formula></td></tr></tbody></table></table-wrap><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> For<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x126.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x126.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x127.png" xlink:type="simple"/></inline-formula>;<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x126.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x127.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x128.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x126.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x127.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x128.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x129.png" xlink:type="simple"/></inline-formula></title></caption><table><tbody><thead><tr><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x130.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x131.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x132.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x133.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x134.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x135.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x136.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x137.png" xlink:type="simple"/></inline-formula></th></tr></thead><tr><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0.203703</td><td align="center" valign="middle" >0.203704</td><td align="center" valign="middle" >0.244444</td><td align="center" valign="middle" >0.24444444</td><td align="center" valign="middle" >0.33333333</td><td align="center" valign="middle" >0.33333333</td></tr><tr><td align="center" valign="middle" >0.2</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0.242722</td><td align="center" valign="middle" >0.262436</td><td align="center" valign="middle" >0.272564</td><td align="center" valign="middle" >0.29752066</td><td align="center" valign="middle" >0.35532233</td><td align="center" valign="middle" >0.36090225</td></tr><tr><td align="center" valign="middle" >0.4</td><td align="center" valign="middle" >0.8</td><td align="center" valign="middle" >0.352845</td><td align="center" valign="middle" >0.358704</td><td align="center" valign="middle" >0.369425</td><td align="center" valign="middle" >0.37709835</td><td align="center" valign="middle" >0.4137837</td><td align="center" valign="middle" >0.41563943</td></tr><tr><td align="center" valign="middle" >0.5</td><td align="center" valign="middle" >0.5</td><td align="center" valign="middle" >0.351734</td><td align="center" valign="middle" >0.36976</td><td align="center" valign="middle" >0.365658</td><td align="center" valign="middle" >0.3893066</td><td align="center" valign="middle" >0.41479035</td><td align="center" valign="middle" >0.42053111</td></tr><tr><td align="center" valign="middle" >0.8</td><td align="center" valign="middle" >0.4</td><td align="center" valign="middle" >0.402855</td><td align="center" valign="middle" >0.431606</td><td align="center" valign="middle" >0.407646</td><td align="center" valign="middle" >0.44610302</td><td align="center" valign="middle" >0.44695789</td><td align="center" valign="middle" >0.45672369</td></tr><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0.366825</td><td align="center" valign="middle" >0.430464</td><td align="center" valign="middle" >0.366825</td><td align="center" valign="middle" >0.4516129</td><td align="center" valign="middle" >0.43046357</td><td align="center" valign="middle" >0.4516129</td></tr><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0.519078</td><td align="center" valign="middle" >0.519079</td><td align="center" valign="middle" >0.519079</td><td align="center" valign="middle" >0.51907894</td><td align="center" valign="middle" >0.51907894</td><td align="center" valign="middle" >0.51907894</td></tr></tbody></table></table-wrap><p>for various values of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x138.png" xlink:type="simple"/></inline-formula> it is seen in <xref ref-type="table" rid="table1">Table 1</xref> that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x138.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x139.png" xlink:type="simple"/></inline-formula> has its minimum value, this shows that Theorem1 holds. In the case<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x138.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x139.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x140.png" xlink:type="simple"/></inline-formula>, the loss probabilities are all equal to each other. This is seen in both <xref ref-type="table" rid="table1">Table 1</xref> and Graph 1. While <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x138.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x139.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x140.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x141.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x138.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x139.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x140.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x141.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x142.png" xlink:type="simple"/></inline-formula> this system turns into <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x138.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x139.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x140.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x141.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x142.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x143.png" xlink:type="simple"/></inline-formula> queueing model and while <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x138.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x139.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x140.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x141.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x142.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x143.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-2730093x144.png" xlink:type="simple"/></inline-formula> the system turns into Cox(2) queueing model. For further studies, higher moments of meanwaiting time in the system can be obtained and by using these moments some various statistical measures can be calculated such as variance, skewness, kurtosis and coefficient of variation. Also this model can be expanded to k-phases.</p></sec><sec id="s6"><title>Cite this paper</title><p>VedatSağlam,MuratSağır,Erdin&#231;Y&#252;cesoy,M&#252;jganZobu, (2015) On Optimal Ordering of Service Parameters of a Coxian Queueing Model with Three Phases. Open Journal of Optimization,04,61-68. doi: 10.4236/ojop.2015.43008</p></sec></body><back><ref-list><title>References</title><ref id="scirp.59155-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">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</mixed-citation></ref><ref id="scirp.59155-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Asmussen, S., Nerman, O. and Olsson, M. (1996) Fitting Phase-Type Distributions via the EM Algorithm. Scandinavian Journal of Statistics, 23, 419-441.</mixed-citation></ref><ref id="scirp.59155-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">He, Q.M. and Zhang, H. (2007) An Algorithm for Computing Minimal Coxian Representations. INFORMS Journal on Computing, 20, 179-190.</mixed-citation></ref><ref id="scirp.59155-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Zobu, M., Saglam, V., Sagir, M., Y&amp;#252;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.</mixed-citation></ref><ref id="scirp.59155-ref5"><label>5</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Marie</surname><given-names> R. </given-names></name>,<etal>et al</etal>. (<year>1980</year>)<article-title>Calculating Equilibrim Probabilities for   Queues</article-title><source> ACM Sigmetrics Performance Evaluation Review</source><volume> 9</volume>,<fpage> 117</fpage>-<lpage>125</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.59155-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">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</mixed-citation></ref><ref id="scirp.59155-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">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</mixed-citation></ref><ref id="scirp.59155-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">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</mixed-citation></ref><ref id="scirp.59155-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">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</mixed-citation></ref><ref id="scirp.59155-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">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</mixed-citation></ref><ref id="scirp.59155-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">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.</mixed-citation></ref><ref id="scirp.59155-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Saglam, V., Ugurlu, M., Y&amp;#252;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.</mixed-citation></ref></ref-list></back></article>