Abstract
We consider an M/M/c queue with c = 2, in which the number of working servers can be adjusted one at a time at arrival epochs or at service completion epochs depending on the number of customers in the system. Analytic closed-form solutions of the infinite capacity M/M/2 queueing system operating under the triadic (0, Q, N, M) policy are derived. The total expected cost function per unit time is developed, to obtain the optimal operating (0, Q, N, M) policy and the optimal service rate, at minimum cost. Some illustrative examples are provided and the genetic algorithm is employed to search for the optimal management policy of the multi-server queueing system.
Sign-in/Register to access full text options 
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.
