A Markov Chain Description of A Workstation with Infinite Capacity (Q4430669)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1990057
Language Label Description Also known as
default for all languages
No label defined
    English
    A Markov Chain Description of A Workstation with Infinite Capacity
    scientific article; zbMATH DE number 1990057

      Statements

      A Markov Chain Description of A Workstation with Infinite Capacity (English)
      0 references
      0 references
      12 October 2003
      0 references
      0 references
      The paper considers a workstation with infinite operating capacity in which at any time instant \(n=0,1,2,\dots\) a new job arrives. Each of these jobs takes a truncated geometric time to be completed (independently of the others). The objective is to provide a comprehensive analysis of the evolution of this system in terms of the joint occupation states of all servers. The author introduces a Markov chain whose state space consists of some dyadic numbers in \((0,1]\) and gives its stationary distribution explicitly. A first-entrance problem of this Markov chain is also studied.
      0 references

      Identifiers