A conservation law for a wide class of queueing disciplines
From MaRDI portal
Publication:5517331
DOI10.1002/nav.3800120206zbMath0142.14503OpenAlexW2024210334MaRDI QIDQ5517331
Publication date: 1965
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800120206
Related Items
On the \(M^ X/G/1\) queue with vacation time ⋮ High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs ⋮ Analysis of an infinite buffer system with random server interruptions ⋮ Decomposition of random variables with bounded hazard rates ⋮ Performance bounds for modeling NUMA architectures ⋮ On bounds of response time performance achievable by multiclass single- server queues ⋮ Analysis of the effects of system parameters on load balancing ⋮ On the capacity assignment problem in packet-switching computer networks ⋮ Multi-server accumulating priority queues with heterogeneous servers ⋮ The transient behaviour of the \(M/E_ k/2\) queue and steady-state simulation ⋮ On the relationship between work load and waiting time in single server queues with batch inputs ⋮ Uniqueness of the solution for optimal static routing in open BCMP queueing networks ⋮ Newsvendor problems with demand forecast updating and supply constraints ⋮ Some explicit formulas for mixed exponential service systems ⋮ Special products and uncertainty in production/inventory systems ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ An analysis of queueing systems with multi-task servers. ⋮ Heavy traffic response times for a priority queue with non-linear priorities. ⋮ Pseudo-conservation laws in cyclic-service systems with a class of limited service policies ⋮ A survey on discriminatory processor sharing ⋮ Pseudo conservation for partially fluid, partially lossy queueing systems ⋮ Optimal revenue management in two class pre-emptive delay dependent Markovian queues ⋮ Workloads and waiting times in single-server systems with multiple customer classes ⋮ A general conservation law for queueing disciplines ⋮ Stationary queuing systems with dependencies ⋮ Unnamed Item ⋮ Min-max vs. max-min flow control algorithms for optimal computer network capacity assignment ⋮ Optimal policies for controlled Markov chains with a constraint
