Queues with a Markov renewal service process

dc.contributor.authorMagalhaes, Marcos N.en
dc.contributor.committeecochairDisney, Ralph L.en
dc.contributor.committeecochairTEW, JEFFREY D.en
dc.contributor.committeememberNachlas, Joel A.en
dc.contributor.committeememberBesieris, Ioannis M.en
dc.contributor.committeememberKiessler, Peter C.en
dc.contributor.departmentIndustrial Engineering and Operations Researchen
dc.date.accessioned2015-06-24T13:35:16Zen
dc.date.available2015-06-24T13:35:16Zen
dc.date.issued1988en
dc.description.abstractIn the present work, we study a queue with a Markov renewal service process. The objective is to model systems where different customers request different services and there is a setup time required to adjust from one type of service to the next. The arrival is a Poisson process independent of the service. After arrival, all the customers will be attended in order of arrival. Immediately before a service starts, the type of next customer is chosen using a finite, irreducible and aperiodic Markov chain P. There is only one server and the service time has a distribution function F<sub>ij</sub>, where i and j are the types of the previous and current customer in service, respectively. This model will be called M/MR/l. Embedding at departure epochs, we characterize the queue length and the type of customer as a Markov renewal process. We study a special case where F<sub>ij</sub>, is exponential with parameter μ<sub>ij</sub>. We prove that the departure is a renewal process if and only if μ<sub>ij</sub> = μ , A i j ε E. Furthermore, we show that this renewal is a Poisson process. The type-departure process is extensively studied through the respective counting processes. The crosscovariance and the crosscorrelation are computed and numerical results are shown. Finally, we introduce several expressions to study the interdependence among the type·departure processes in the general case, i.e. the distribution function F<sub>ij</sub>, does not have any special form.en
dc.description.degreePh. D.en
dc.format.extentvii, 120 leavesen
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttp://hdl.handle.net/10919/53582en
dc.language.isoen_USen
dc.publisherVirginia Polytechnic Institute and State Universityen
dc.relation.isformatofOCLC# 18884978en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V856 1988.M233en
dc.subject.lcshMarkov processesen
dc.subject.lcshQueuing theoryen
dc.titleQueues with a Markov renewal service processen
dc.typeDissertationen
dc.type.dcmitypeTexten
thesis.degree.disciplineIndustrial Engineering and Operations Researchen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.leveldoctoralen
thesis.degree.namePh. D.en

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
LD5655.V856_1988.M233.pdf
Size:
3.08 MB
Format:
Adobe Portable Document Format