Some problems in queueing with dynamic priorities

Unknown author

59 citations0/0 files storedNaval Research Logistics Quarterly

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

Abstract This paper presents some mathematical and numerical results concerning certain one‐machine discrete‐time queueing models, subject to various queue disciplines. Interest is focused upon systems in which service order is governed by “dynamic priorities,” under which a customer's relative priority is in effect upgraded with the passage of waiting time, so that the proportion of newcomers who can “step in front of him” becomes smaller and smaller as he waits.

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 — 59 citations exist upstream.

Cited by

1966A Queueing Model of Many-Instrument Visual Sampling 1977Analysis of the Earliest Due Date Scheduling Rule in Queueing Systems 1990Optimal queueing discipline for real-time traffic at ATM switching nodes 1979A Dynamic Priority Queue with General Concave Priority Functions 1962Waiting‐time distributions for queues with dynamic priorities 1985Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function 2011Queues with waiting time dependent service 2015Waiting Time Distributions in the Preemptive Accumulating Priority Queue

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