𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A continuous time markov-renewal replacement model for manpower systems

✍ Scribed by Gerontidis, Ioannis I.


Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
1023 KB
Volume
9
Category
Article
ISSN
8755-0024

No coin nor oath required. For personal study only.

✦ Synopsis


A continuous time Markov-renewal model is presented that generalizes the classical Young and Almond model for manpower systems with given size. The construction is based on the associated Markovrenewal replacement process and exploits the properties of the embedded replacement chain. The joint cumulant generating function of the grade sizes is derived and an asymptotic analysis provides conditions for these to converge in distribution to a multinominal random vector exponentially fast independently of the initial distribution, both for aperiodic and periodic embedded replacement chains. A regenerative approach to the wastage process is outlined and two numerical examples from the literature on manpower planning illustrate the theory.

KEY WORDS Convergence in distribution Exponential ergodicity

Generalized phase-type renewal process Quasi-periodic imbedded chain Rate of convergence Regeneration Stochastic population models Wastage process


πŸ“œ SIMILAR VOLUMES


A continuous time Markov chain model for
✍ J. Gani; L. Stals πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 157 KB

## Abstract This article examines a continuous time Markov chain model for a plantation‐nursery system in which diseased plantation trees are replaced at a daily rate Ξ» by nursery seedlings. There is a random infection rate Ξ± caused by insects, and the disease is also spread directly between the __

A compound measure of dependability for
✍ Attila Csenki πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 412 KB πŸ‘ 2 views

The Markov analysis of reliability models frequently involves a partitioning of the state space into two or more subsets, each corresponding to a given degree of functionality of the system. A common partitioning is G U B U { W ) , where G (good) and B (bad) stand, respectively, for fully and partia