M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
From MaRDI portal
Publication:3796947
DOI10.1287/MNSC.34.9.1121zbMath0651.90033OpenAlexW2079191980MaRDI QIDQ3796947
Publication date: 1988
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.34.9.1121
heavy trafficmultiple customer classespriority disciplinegeneralized dynamic priority ruleM/G/c queueing systemnonpreemptive priority rules
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (20)
On bounds of response time performance achievable by multiclass single- server queues ⋮ Invariance of workload in queueing systems ⋮ On the optimization of two-class work-conserving parameterized scheduling policies ⋮ Calculation of the performance region of an easy-to-optimize alternative for generalized processor sharing ⋮ Optimal static distribution of prioritized customers to heterogeneous parallel servers ⋮ A general workload conservation law with applications to queueing systems ⋮ The archievable region method in the optimal control of queueing systems; formulations, bounds and policies ⋮ Computational geometric approach to submodular function minimization for multiclass queueing systems ⋮ Assignment of a job load in a distributed system: A multicriteria design method ⋮ On the modelling and performance measurement of service networks with heterogeneous customers ⋮ A polynomial algorithm for resourse allocation problems with polymatroid constrains1 ⋮ Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule ⋮ Two algorithms for maximizing a separable concave function over a polymatroid feasible region ⋮ A review of open queueing network models of manufacturing systems ⋮ Average waiting time of customers in a priority M/D/k queue with finite buffers ⋮ Pseudo conservation for partially fluid, partially lossy queueing systems ⋮ Workloads and waiting times in single-server systems with multiple customer classes ⋮ A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions ⋮ Optimal pricing and scheduling control of product shipping ⋮ Dynamic routing in large-scale service systems with heterogeneous servers
This page was built for publication: M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
