Heuristic solution for the optimal thresholds in a controllable multi-server heterogeneous queueing system without preemption

Dmitry Efrosinin, Vladimir Rykov

Research output: Chapter in Book/Report/Conference proceedingConference proceedingspeer-review

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.
Original languageEnglish
Title of host publicationDistributed Computer and Communication Networks. 18th International Conference, DCCN 2015, Moscow, Russia, October 19-22, 2015, Revised Selected Papers
PublisherSpringer
Number of pages16
ISBN (Print)978-3-319-05208-3
DOIs
Publication statusPublished - 2015

Publication series

NameCommunications in Computer and Information Science
ISSN (Print)1865-0929

Fields of science

  • 101 Mathematics
  • 101014 Numerical mathematics
  • 101018 Statistics
  • 101019 Stochastics
  • 101024 Probability theory

JKU Focus areas

  • Computation in Informatics and Mathematics
  • Engineering and Natural Sciences (in general)

Cite this