A conservation law for a wide class of queueing disciplines
From MaRDI portal
Publication:5517331
DOI10.1002/NAV.3800120206zbMATH Open0142.14503OpenAlexW2024210334MaRDI QIDQ5517331FDOQ5517331
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
Recommendations
- Publication:3029966
- A conservation law for single-server queues and its applications
- A Unifying Conservation Law for Single-Server Queues
- A general workload conservation law with applications to queueing systems
- Rate conservation principle for discrete-time queues
- The laws of conservation of flows in acyclic queueing networks
- A note on conservation laws for a multi-class service queueing system with setup times
- PSEUDO-CONSERVATION LAW FOR DISCRETE-TIME MULTI-QUEUE SYSTEMS WITH PRIORITY DISCIPLINES
Cited In (30)
- Title not available (Why is that?)
- Workloads and waiting times in single-server systems with multiple customer classes
- Some explicit formulas for mixed exponential service systems
- On the \(M^ X/G/1\) queue with vacation time
- Performance bounds for modeling NUMA architectures
- On the capacity assignment problem in packet-switching computer networks
- Analysis of the effects of system parameters on load balancing
- Heavy traffic response times for a priority queue with non-linear priorities.
- High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs
- Special products and uncertainty in production/inventory systems
- Optimal revenue management in two class pre-emptive delay dependent Markovian queues
- Analysis of an infinite buffer system with random server interruptions
- Multi-server accumulating priority queues with heterogeneous servers
- Decomposition of random variables with bounded hazard rates
- Newsvendor problems with demand forecast updating and supply constraints
- Pseudo conservation for partially fluid, partially lossy queueing systems
- On bounds of response time performance achievable by multiclass single- server queues
- Dynamic priority allocation via restless bandit marginal productivity indices
- Optimal policies for controlled Markov chains with a constraint
- A note on conservation laws for a multi-class service queueing system with setup times
- Pseudo-conservation laws in cyclic-service systems with a class of limited service policies
- The transient behaviour of the \(M/E_ k/2\) queue and steady-state simulation
- A survey on discriminatory processor sharing
- Min-max vs. max-min flow control algorithms for optimal computer network capacity assignment
- Uniqueness of the solution for optimal static routing in open BCMP queueing networks
- A general conservation law for queueing disciplines
- The laws of conservation of flows in acyclic queueing networks
- On the relationship between work load and waiting time in single server queues with batch inputs
- An analysis of queueing systems with multi-task servers.
- Stationary queuing systems with dependencies
This page was built for publication: A conservation law for a wide class of queueing disciplines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5517331)
