Fitting the Ph-t/M-t/s/c Time-Dependent Departure Process for Use in Tandem Queueing Networks

dc.contributor.authorNasr, W. W.en
dc.contributor.authorTaaffe, Michael R.en
dc.contributor.departmentIndustrial and Systems Engineeringen
dc.date.accessed2014-02-05en
dc.date.accessioned2014-03-05T14:00:22Zen
dc.date.available2014-03-05T14:00:22Zen
dc.date.issued2013en
dc.description.abstractThis 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.mimetypeapplication/pdfen
dc.identifier.citationWalid 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.0538en
dc.identifier.doihttps://doi.org/10.1287/ijoc.1120.0538en
dc.identifier.issn1091-9856en
dc.identifier.urihttp://hdl.handle.net/10919/25827en
dc.identifier.urlhttp://pubsonline.informs.org/doi/pdf/10.1287/ijoc.1120.0538en
dc.language.isoenen
dc.publisherINFORMSen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectQueuesen
dc.subjectQueueingen
dc.subjectTandem queuesen
dc.subjectAlgorithmsen
dc.subjectPhase-type distributionen
dc.subjectNonstationary processesen
dc.subjectQueueing networksen
dc.subjectTime dependenten
dc.subjectTransienten
dc.subjectMixture of erlangsen
dc.subjectCount processen
dc.subjectMoment matchingen
dc.subjectArrival processesen
dc.subjectVarying demanden
dc.subjectServiceen
dc.subjectSystemsen
dc.titleFitting the Ph-t/M-t/s/c Time-Dependent Departure Process for Use in Tandem Queueing Networksen
dc.title.serialInforms Journal on Computingen
dc.typeArticle - Refereeden
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
ijoc%2E1120%2E0538.pdf
Size:
636.7 KB
Format:
Adobe Portable Document Format
Description:
Main article