Abstract
This paper examines an M/G/1 machine repair problem with multiple imperfect coverage. When an operating machine fails, it is immediately detected and located with coverage probability c. We first use a recursive method and supplementary variable technique to develop steady-state analytic solutions. Various system performance measures are developed based on the steady-state probability distributions. We then construct the expected cost function per machine per unit time and formulate an optimization problem to determine the minimum cost. Direct search and Quasi-Newton methods are implemented to search for the optimal number of operating machines, the optimal repair rate, and the optimal coverage factor. Sensitivity analysis and numerical illustrations are also provided.
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.
