Abstract

This paper investigates the M/M/1 warm-standby machine repair problem with multiple vacations and working breakdowns. We first apply a matrix-analytic method to obtain the steady-state probabilities. Next, we construct the total expected profit per unit time and formulate an optimization problem to find the maximum profit. The particle swarm optimization (PSO) algorithm is implemented to determine the optimal number of warm standbys and two variable service rates simultaneously at the optimal maximum profit. We compare the searching results of the PSO algorithm with those of Genetic algorithm (GA) and Exhaustive Search Method (ESM) to ensure the superior searching quality of the PSO algorithm. Sensitivity analysis with numerical illustrations is also provided to improve the design quality of system engineers.

Full Text
Paper version not known

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 call

Disclaimer: 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.