Abstract
We consider a queueing system with two Poisson arrival queues and two batch servers with finite capacities within a pre-specified time horizon. The problem is to decide a switching time of the two servers in order to maximize the total expected number of customers served in the end. We propose an optimal time threshold-based switching policy and analyze the properties of the switching policy. We also study the asymptotic benefit of having the switching option. Finally, we show the superior performance of the switching policy by numerical experiments.
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.
