The Infinitely Many Server Queue with Semi-Markovian Arrivals and Customer Dependent Exponential Service Times,

Abstract

An infinitely many server queue with N types of customers arriving according to a semi-Markov process is studied. The service times are independent exponential random variables with means 1/mu sub i where i is the type of customer being served. The stationary distribution of the embedded Markov chain and the limiting distribution of the continuous time process are obtained. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1971
Accession Number
AD0725049

Entities

People

  • Woollcott Smith

Organizations

  • University of North Carolina at Chapel Hill

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Markov Chains
  • Markov Processes
  • Mathematics
  • Probability
  • Random Variables

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.