Back to results

Virginia Polytechnic Institute and State University

Queues with a Markov renewal service process

Abstract

dc:description.abstract

In 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.

Degree

thesis:*
Name thesis:degree_name
Ph. D.
Level thesis:degree_level
doctoral
Discipline thesis:degree_discipline
Industrial Engineering and Operations Research
Department dc:contributor.department
Industrial Engineering and Operations Research
Grantor dc:publisher
Virginia Polytechnic Institute and State University
Year dc:date.issued
1988

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Magalhaes, Marcos N.
Chairs dc:contributor.committeechair
  • Disney, Ralph L.
  • TEW, JEFFREY D.
Committee members dc:contributor.committeemember
  • Nachlas, Joel A.
  • Besieris, Ioannis M.
  • Kiessler, Peter C.

Rights

dc:rights
Statement dc:rights
  • In Copyright
Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10919/53582
OAI identifier oai:identifier
oai:vtechworks.lib.vt.edu:10919/53582

Chain of custody

source
Harvested from
Virginia Tech
Base URL
vtechworks.lib.vt.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
related terms
citation

Magalhaes, Marcos N.. Queues with a Markov renewal service process. doctoral thesis, Virginia Polytechnic Institute and State University, 1988. http://hdl.handle.net/10919/53582