Time-dependent queueing models are important since most of real-life problems are time-dependent. We develop a numerical approximation algorithm for the mean, variance and higher-order moments of the number of entities in the system at time t for the Ph(t)/Ph(t)/s/c queueing model. This model can be thought as a reparameterization to the G(t)/GI(t)/s. Our approach is to partition the state space into known and identifiable structures, such as the M(t)/M(t)/s/c or M(t)/M(t)/1 queueing models. We then use the Polya-Eggenberger distribution to approximate certain unknown probabilities via a two-moment matching algorithm. We describe the necessary steps to validate the approximation and measure the accuracy of the model. / Master of Science
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/9637 |
| Date | 16 December 2003 |
| Creators | Rueda, Javier Eduardo |
| Contributors | Industrial and Systems Engineering, Taaffe, Michael R., Castagliola, Philippe, Lin, Kyle Y. |
| Publisher | Virginia Tech |
| Source Sets | Virginia Tech Theses and Dissertation |
| Detected Language | English |
| Type | Thesis |
| Format | ETD, application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | PhtPhtscThesisR1.pdf |
Page generated in 0.0022 seconds