Heuristic Solution for the Optimal Thresholds in a Controllable Multi-server Heterogeneous Queueing System Without Preemption
| Autor: | Dmitry Efrosinin, Vladimir Rykov |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Mathematical optimization
021103 operations research Computer science Heuristic Real-time computing 0211 other engineering and technologies Holding cost Preemption Boundary (topology) 02 engineering and technology Function (mathematics) Server 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Queue Average cost |
| Zdroj: | Communications in Computer and Information Science ISBN: 9783319308425 |
| DOI: | 10.1007/978-3-319-30843-2_25 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|