An analysis of Klimov's problem with parallel servers
type: Item
instance of: scholarly article
title: An analysis of Klimov's problem with parallel servers
zbMATH Open document ID: 1061.60094
published in: Mathematical Methods of Operations Research
publication date: 2004-03-07T00:00:00Z
review text: The author introduces a family of undiscounted bandits on parallel servers under controls. This family is helpful to model a variety of multi-class queueing systems including semi-Markov generalizations, machine breakdowns, priority complex patterns, etc. An index policy (called Klimov's rule) is developed. This policy is optimal for the single-server case and under some conditions, it is shown to be asymptotically optimal in a heavy traffic regime.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B15
zbMATH DE Number: 2051528
zbMATH Keywords: multi-class queueing system
zbMATH Keywords: parallel servers
author: Kevin D. Glazebrook
reviewed by: Jesus R. Artalejo
MaRDI profile type: Publication
full work available at URL: s001860300278
OpenAlex ID: W2046969557
DOI: 10.1007/S001860300278
Recommended article: A \(k\)-server problem with parallel requests and unit distances
Recommended article: A scheduling problem for several parallel servers
Recommended article: Analysis of 1-server n-unit parallel system
Recommended article: Complexity results for parallel machine problems with a single server
Recommended article: The \(k\)-server problem
Recommended article: Using Parallel Iteration for Approximate Analysis of a Multiple Server Queueing System
Recommended article: Parallel load balancing on constrained client-server topologies
Recommended article: Scheduling parallel servers in the nondegenerate slowdown diffusion regime: asymptotic optimality results
Recommended article: Q3651008
description: scientific article; zbMATH DE number 2051528