A Markov Chain Description of A Workstation with Infinite Capacity

From MaRDI portal





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.











This page was built for publication: A Markov Chain Description of A Workstation with Infinite Capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4430669)