Fitting the Ph-t/M-t/s/c Time-Dependent Departure Process for Use in Tandem Queueing Networks
dc.contributor.author | Nasr, W. W. | en |
dc.contributor.author | Taaffe, Michael R. | en |
dc.contributor.department | Industrial and Systems Engineering | en |
dc.date.accessed | 2014-02-05 | en |
dc.date.accessioned | 2014-03-05T14:00:22Z | en |
dc.date.available | 2014-03-05T14:00:22Z | en |
dc.date.issued | 2013 | en |
dc.description.abstract | This paper considers time-dependent Ph-t/M-t/s/c queueing nodes and small tandem networks of such nodes. We examine characteristics of the departure processes from a multiserver queueing node; in particular, we focus on solving for the first two time-dependent moments of the departure-count process. A finite set of partial moment differential equations is developed to numerically solve for the departure-count moments over specified intervals of time [t(i), t(i) + tau(i)). We also present a distribution fitting algorithm to match these key characteristics with a (Ph-t) over tilde process serving as the approximate departure process. A distribution fitting algorithm is presented for time-dependent point processes where a two-level balanced mixture of Erlang distribution is used to serve as the approximating process. We then use the (Ph-t) over tilde approximating departure process as the approximate composite arrival process to downstream node(s) in a network of tandem queues. | en |
dc.format.mimetype | application/pdf | en |
dc.identifier.citation | Walid W. Nasr and Michael R. Taaffe. Fitting the Pht/Mt/s/c Time-Dependent Departure Process for Use in Tandem Queueing Networks. INFORMS Journal on Computing 2013 25:4, 758-773. doi: 10.1287/ijoc.1120.0538 | en |
dc.identifier.doi | https://doi.org/10.1287/ijoc.1120.0538 | en |
dc.identifier.issn | 1091-9856 | en |
dc.identifier.uri | http://hdl.handle.net/10919/25827 | en |
dc.identifier.url | http://pubsonline.informs.org/doi/pdf/10.1287/ijoc.1120.0538 | en |
dc.language.iso | en | en |
dc.publisher | INFORMS | en |
dc.rights | In Copyright | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.subject | Queues | en |
dc.subject | Queueing | en |
dc.subject | Tandem queues | en |
dc.subject | Algorithms | en |
dc.subject | Phase-type distribution | en |
dc.subject | Nonstationary processes | en |
dc.subject | Queueing networks | en |
dc.subject | Time dependent | en |
dc.subject | Transient | en |
dc.subject | Mixture of erlangs | en |
dc.subject | Count process | en |
dc.subject | Moment matching | en |
dc.subject | Arrival processes | en |
dc.subject | Varying demand | en |
dc.subject | Service | en |
dc.subject | Systems | en |
dc.title | Fitting the Ph-t/M-t/s/c Time-Dependent Departure Process for Use in Tandem Queueing Networks | en |
dc.title.serial | Informs Journal on Computing | en |
dc.type | Article - Refereed | en |
dc.type.dcmitype | Text | en |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- ijoc%2E1120%2E0538.pdf
- Size:
- 636.7 KB
- Format:
- Adobe Portable Document Format
- Description:
- Main article