M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules

DOI10.1287/mnsc.34.9.1121zbMath0651.90033MaRDI QIDQ3796947

Awi Federgruen, H. Groenevelt

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

zbMATH Keywords

heavy traffic; multiple customer classes; priority discipline; generalized dynamic priority rule; M/G/c queueing system; nonpreemptive priority rules

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

Related Items

A polynomial algorithm for resourse allocation problems with polymatroid constrains¹, Average waiting time of customers in a priority M/D/k queue with finite buffers, Two algorithms for maximizing a separable concave function over a polymatroid feasible region, A review of open queueing network models of manufacturing systems, On bounds of response time performance achievable by multiclass single- server queues, Assignment of a job load in a distributed system: A multicriteria design method, Optimal static distribution of prioritized customers to heterogeneous parallel servers, The archievable region method in the optimal control of queueing systems; formulations, bounds and policies