This paper studies the M/M/1 machine repair problem using a single service station subject to working breakdowns. This service station can be in working breakdown state only when at least one failed machine exists in the system. The matrix-analytic method is used to compute the steady-state probabilities for the number of failed machines in the system. A cost model is constructed to simultaneously determine the optimal values for the number of operating machines and two variable service rates to minimize the total expected cost per machine per unit time. The particle swarm optimization (PSO) algorithm is implemented to search for the optimal minimum value until the system availability constraint is satisfied.
CITATION STYLE
Wang, K. H., & Liou, C. D. (2017). Particle swarm optimization for the machine repair problem with working breakdowns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10385 LNCS, pp. 238–245). Springer Verlag. https://doi.org/10.1007/978-3-319-61824-1_26
Mendeley helps you to discover research relevant for your work.