1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.ejor.2007.03.005
DC FieldValue
dc.titleBusy period for the first subsystem in a matched queueing network
dc.contributor.authorCao, C.
dc.contributor.authorAng, J.S.K.
dc.date.accessioned2013-10-09T03:26:30Z
dc.date.available2013-10-09T03:26:30Z
dc.date.issued2008
dc.identifier.citationCao, C., Ang, J.S.K. (2008). Busy period for the first subsystem in a matched queueing network. European Journal of Operational Research 187 (1) : 327-334. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2007.03.005
dc.identifier.issn03772217
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/44086
dc.description.abstractWe formulate the busy period for the first subsystem in the matched queueing network PH/M/c→{ring operator}PH/PH/1 as the first passage time of a Markov process and then present an approximate algorithm with uniform error for it. A numerical example is presented to illustrate the algorithm. © 2007 Elsevier B.V. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.ejor.2007.03.005
dc.sourceScopus
dc.subjectAlgorithm
dc.subjectBusy period
dc.subjectMatched queueing network
dc.typeArticle
dc.contributor.departmentDECISION SCIENCES
dc.description.doi10.1016/j.ejor.2007.03.005
dc.description.sourcetitleEuropean Journal of Operational Research
dc.description.volume187
dc.description.issue1
dc.description.page327-334
dc.description.codenEJORD
dc.identifier.isiut000251891000022
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.