Abstract
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.
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.
