Name
Abstract | ||
|---|---|---|
We formulate the busy period for the first subsystem in the matched queueing network PH/M/c→∘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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.ejor.2007.03.005 | European Journal of Operational Research |
Keywords | Field | DocType |
Matched queueing network,Busy period,Algorithm | Mathematical optimization,Markov process,Layered queueing network,Queueing theory,First-hitting-time model,Mathematics,Operations management | Journal |
Volume | Issue | ISSN |
187 | 1 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chengxuan Cao | 1 | 10 | 2.57 |
| JAMES S. K. ANG | 2 | 150 | 12.04 |