Optimization analysis for an infinite capacity queueing system with multiple queue-dependent servers: genetic algorithm

This paper considers an M/M/r queueing system with infinite capacity, in which the number of working servers changes depending on the queue length. The steady-state probability distributions and the expected number of customers in the system are derived, which are used to construct a cost function. In order to minimize the expected cost of the system, we use the genetic algorithm to find the best thresholds of queue length in activating servers and their corresponding service rate. Some illustrative examples are provided to demonstrate how the process of this algorithm works for the optimal management policy of the multi-server queueing system.