Nelson, B. L.Taaffe, Michael R.2014-03-052014-03-052004Barry L. Nelson and Michael R. Taaffe. The Pht/Pht/∞ Queueing System: Part I—The Single Node. INFORMS Journal on Computing 2004 16:3, 266-274. doi: 10.1287/ijoc.1040.00701091-9856http://hdl.handle.net/10919/25828We develop a numerically exact method for evaluating the time-dependent mean, variance, and higher-order moments of the number of entities in a Ph-t/Ph-t/infinity queueing system. We also develop a numerically exact method for evaluating the distribution function and moments of the virtual sojourn time for any time t; in our setting, the virtual sojourn time is equivalent to the service time for virtual entities arriving to the system at that time t. We include several examples using software that we have developed and have put in downloadable form in the Online Supplement to this paper on the journal's website.application/pdfenIn CopyrightQueuesAlgorithmsPhase-type distributionNonstationary processesInfinite serverInfinite-server queuesTraffic limit-theoremArrivalRatesArticle - Refereedhttp://pubsonline.informs.org/doi/pdf/10.1287/ijoc.1040.0070https://doi.org/10.1287/ijoc.1040.0070