Abstract
Abstract In this paper, we present an analysis of a machine repair problem with M operating machines and S standbys, in which c repairmen are responsible for supervising these machines and follow a multi-threshold, synchronous vacation policy. With such a policy, at a repair completion instant, if the number of the failed machines in the system is less than a preset threshold value, partial idle servers together take a single vacation (or leave for a random amount of time doing other secondary job). At the end of a vacation, they return to repair the failed machines (or waits for the arrival). The steady-state probabilities are solved by using the matrix-analytic method, and formulae of system performance measures are thereby obtained. A cost model is then developed to formulate an optimization problem to find the minimum cost. The direct search and quasi-Newton methods are implemented to determine the optimal number of servers, the optimal threshold policy and the optimal repair rate.
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.
