Abstract
As it known the optimal policy which minimizes the long-run average cost per unit of time in a multi-server queueing system with heterogeneous servers without preemption has a threshold structure. It means that the slower server must be activated whenever all faster servers are busy and the number of customers in the queue exceeds some specified for this server threshold level. The optimal thresholds can be evaluated using the Howard iteration algorithm or by minimizing the function of the average cost which can be obtained in closed form as a function of unknown threshold levels. The both cases have sufficient restrictions on dimensionality of the model. In present paper we provide a heuristic method to derive expressions for the optimal threshold levels in explicit form as functions of system parameters like service intensities, usage and holding costs for an arbitrary number of servers. The proposed method is based on the fitting of the boundary planes between the areas where the optimal threshold takes a certain value.
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.
