Abstract
We consider a machine interference problem with several types of machines attended by a single repairman. Assuming exponentially distributed time to failures, generally distributed repair times arid head of the line non-preemptive priority repair discipline, an imbedded Markov chain model is formulated. Using this Markov chain model and a discrete state level crossing analysis the steady state probability distribution of the number of machines in failed state at an arbitrary time epoch is derived. An algorithm is developed to compute these probabilities and some numerical results illustrating some basic features of this machine interference problem is also presented
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
