Bounds for a Dynamic-Priority Queue

J.M. Holtzman

20 citations0/0 files storedOperations Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Optimization and Search Problems Age of Information Optimization

Abstract

This paper obtains upper and lower bounds on equilibrium mean waiting times for a Poisson-input queue with the nonpreemptive dynamic-priority service discipline studied by Jackson.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 20 citations exist upstream.

References

1961A Proof for the Queuing Formula: L = λ W 1954Priority Assignment in Waiting Line Problems 1963Stochastic Service Systems.1965A conservation law for a wide class of queueing disciplines 1964Priority Queues 1967Time Dependent Priority Queues 1970Letter to the Editor—An Alternative Proof of a Conservation Law for the Queue G / G /1 1962Waiting‐time distributions for queues with dynamic priorities

Cited by

1979Approximation techniques in the solution of queueing problems 1982Performance evaluation studies for time-sharing computer systems

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.