Analysis of the stationary Ek/C2/s queueing system

Bertsimas, DJ; Papaconstantinou, XA

dc.contributor.author	Bertsimas, DJ	en
dc.contributor.author	Papaconstantinou, XA	en
dc.date.accessioned	2014-03-01T01:07:05Z
dc.date.available	2014-03-01T01:07:05Z
dc.date.issued	1988	en
dc.identifier.issn	0377-2217	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9778
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0024108471&partnerID=40&md5=c92c6610ce0968d5e137a72a1d167899	en
dc.subject	Coxian service distributions	en
dc.subject	method of	en
dc.subject	Multiserver queues	en
dc.subject.classification	Management	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	Mathematical Programming	en
dc.subject.other	Mathematical Techniques - Numerical Methods	en
dc.subject.other	Coxian Service Distributions	en
dc.subject.other	Multiserver Queues	en
dc.subject.other	Stationary Queueing System	en
dc.subject.other	Probability	en
dc.title	Analysis of the stationary Ek/C2/s queueing system	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1988	en
heal.abstract	Erlang's method of stages is exploited to solve the queue Ek/C2/s, i.e. with service-time pdf of the versatile Coxian type of order 2. The general solution strategy is purely real arithmetic, leading first to explicit forms (for the probabilities of states with all servers busy) and then, through an algorithmic scheme, to an easily solved linear system of only s + 1 equations. In comparison to other established methods, the present approach (a) seems simpler to grasp and easier to implement, (b) provides closed form expressions offering more qualitative insight, (c) has a much lower order of computational complexity, (d) has the potential to lead to an exact FCFS waiting-time analysis and (e) can be extended to even more general systems. © 1988.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	European Journal of Operational Research	en
dc.identifier.isi	ISI:A1988Q630500013	en
dc.identifier.volume	37	en
dc.identifier.issue	2	en
dc.identifier.spage	272	en
dc.identifier.epage	287	en