Index heuristics for multiclass \(M/G/1\) systems with nonpreemptive service and convex holding costs
From MaRDI portal
Publication:1413735
DOI10.1023/A:1026060405346zbMath1036.90030OpenAlexW2009883375MaRDI QIDQ1413735
P. S. Ansell, R. R. Lumley, Kevin D. Glazebrook
Publication date: 17 November 2003
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026060405346
Stochastic programming (90C15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Dynamic programming (90C39)
Related Items (5)
Minimizing the mean slowdown in the M/G/1 queue ⋮ The single-server scheduling problem with convex costs ⋮ Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule ⋮ Spinning plates and squad systems: policies for bi-directional restless bandits ⋮ DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
This page was built for publication: Index heuristics for multiclass \(M/G/1\) systems with nonpreemptive service and convex holding costs
