Abstract
This paper presents the modelling and analysis of the M/G/1 machine repairman problem consisting of K working machines, Y spare machines and single repairman. Spare machines are considered to be either cold-standby, warm-standby or hot-standby. Using supplementary variable technique, an efficient recursive algorithm has been developed to obtain the distributions of the number of down machines at arbitrary, departure and pre-arrival epochs. The relations among the distributions at various epochs and some performance measures are also discussed. In addition, the waiting time analysis has been carried out. Finally, some numerical results have been presented.
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.
