<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
	<front>
		<journal-meta>
			<journal-id journal-id-type="publisher-id">INFORMATICA</journal-id>
			<journal-title-group>
				<journal-title>Informatica</journal-title>
			</journal-title-group>
			<issn pub-type="epub">0868-4952</issn>
			<issn pub-type="ppub">0868-4952</issn>
			<publisher>
				<publisher-name>VU</publisher-name>
			</publisher>
		</journal-meta>
		<article-meta>
			<article-id pub-id-type="publisher-id">INF7306</article-id>
			<article-id pub-id-type="doi">10.3233/INF-1996-7306</article-id>
			<article-categories>
				<subj-group subj-group-type="heading">
					<subject>Research article</subject>
				</subj-group>
			</article-categories>
			<title-group>
				<article-title>On estimates of the loss probability for an M/M/n queueing system with channels of different service productivity</article-title>
			</title-group>
			<contrib-group>
				<contrib contrib-type="Author">
					<name>
						<surname>Puškorius</surname>
						<given-names>Stasys</given-names>
					</name>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_000"/>
				</contrib>
				<contrib contrib-type="Author">
					<name>
						<surname>Minkevičius</surname>
						<given-names>Saulius</given-names>
					</name>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_001"/>
				</contrib>
				<aff id="j_INFORMATICA_aff_000">Lithuanian Military Academy, Šilo 5a, 2055 Vilnius, Lithuania</aff>
				<aff id="j_INFORMATICA_aff_001">Institute of Mathematics and Informatics, Akademijos 4, 2600 Vilnius, Lithuania. E-mail: mathematica.ktl.mii.lt</aff>
			</contrib-group>
			<pub-date pub-type="epub">
				<day>01</day>
				<month>01</month>
				<year>1996</year>
			</pub-date>
			<volume>7</volume>
			<issue>3</issue>
			<fpage>361</fpage>
			<lpage>370</lpage>
			<abstract>
				<p>The queueing system theory is well developed. Such an important problem as the efficient of customer service in efficiency a multichannel queueing system with different productivity of service channels is well developed, too. Exact formulas are obtained from which the loss probability can be computed (if the input stream of customers distributed as Poisson and service time of the customer is the exponential service time). However, these formulas are very complex. So, in this paper, two theorems are proved, in which upper and lower estimates of the loss probability are presented. These estimates are simple formulas that don't become more complex with the growing number of service channels in the queueing system.</p>
			</abstract>
			<kwd-group>
				<label>Keywords</label>
				<kwd>M/M/n queueing system</kwd>
				<kwd>output stream of customers</kwd>
				<kwd>the loss probability</kwd>
				<kwd>upper and lower estimates of the loss probability</kwd>
			</kwd-group>
		</article-meta>
	</front>
</article>