Genetic algorithm to the machine repair problem with two removable servers operating under the triadic \((0, {Q}, {N}, {M})\) policy

DOI10.1016/j.apm.2013.03.036zbMath1426.90090OpenAlexW2054500705WikidataQ115102089 ScholiaQ115102089MaRDI QIDQ1791488

Meng-Wei Liou, Kuo-Hsiung Wang, Cheng-Dar Liou

Publication date: 10 October 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2013.03.036

zbMATH Keywords

optimizationsensitivity analysisgenetic algorithmcosttriadic \((0, Q, N, M)\) policy

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27)

Related Items

Analysis of Markovian queueing system with second optional service operating under the triadic policy ⋮ Multi-attribute Bayesian fault prediction for hidden-state systems under condition monitoring

Uses Software

• Genocop
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal control of an \(M/M/2\) queueing system with finite capacity operating under the triadic \((0,Q,N,M)\) policy
• Optimization analysis for an infinite capacity queueing system with multiple queue-dependent servers: genetic algorithm
• Distribution of the busy period in a controllable M/M/2 queue operating under the triadic (0, K, N, M) policy
• Particle Swarm Optimization
• Optimal Operation of an M/M/2 Queue with Removable Servers
• Tabu Search—Part I
• Tabu Search—Part II