Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance
We address the problem of scheduling a multiclass M/M/m queue with Bernoulli feedback on m parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers se...
| Veröffentlicht in: | Operations Research. - Institute for Operations Research and the Management Sciences, 1956. - 49(2001), 4, Seite 609-623 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2001
|
| Zugriff auf das übergeordnete Werk: | Operations Research |
| Schlagworte: | Queues/Optimization: Multiclass Queues, Parallel Servers Dynamic Programming: Performance Guarantees for Heuristic Policies Stochastic Models Business Applied sciences Behavioral sciences Mathematics |
| Online verfügbar |
Volltext |