Please use this identifier to cite or link to this item:
Title: Busy period for the first subsystem in a matched queueing network
Authors: Cao, C. 
Ang, J.S.K. 
Keywords: Algorithm
Busy period
Matched queueing network
Issue Date: 2008
Citation: Cao, 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.
Abstract: We 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.
Source Title: European Journal of Operational Research
ISSN: 03772217
DOI: 10.1016/j.ejor.2007.03.005
Appears in Collections:Staff Publications

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

Page view(s)

checked on Sep 22, 2022

Google ScholarTM



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