Beyond the \(c\mu\) rule: Dynamic scheduling of a two-class loss queue
type: Item
instance of: scholarly article
title: Beyond the \(c\mu\) rule: Dynamic scheduling of a two-class loss queue
zbMATH Open document ID: 0947.90027
DOI: 10.1007/PL00003992
author: Eungab Kim
author: Mark P. Van Oyen
published in: Mathematical Methods of Operations Research
publication date: 1999-10-05T00:00:00Z
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 1326491
zbMATH Keywords: polling system
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: finite buffer
zbMATH Keywords: loss penalty
zbMATH Keywords: threshold policy
zbMATH Keywords: \(c\mu\) rule
MaRDI profile type: Publication
full work available at URL: pl00003992
OpenAlex ID: W2088833086
Recommended article: Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ/h Rule
Recommended article: Dynamic scheduling of a two-class queue with setups
Recommended article: Dynamic scheduling of a single-server two-class queue with constant retrial policy
Recommended article: Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime
Recommended article: Performance Bounds and Suboptimal Policies for Multi-Class Queue
Recommended article: Further results for dynamic scheduling of multiclass G/G/1 queues
description: scientific article; zbMATH DE number 1326491