Dynamic scheduling in single-server multiclass service systems with unit buffers

Sid Browne · Uri Yechiali

14 citations0/0 files storedNaval Research Logistics (NRL)

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

The problem of optimal dynamic sequencing for a single-server multiclass service system with only unit storage (buffer) space at each queue is considered. The model is applicable to many computer operating and telecommunicating systems (e.g., polling systems). Index policies to minimize costs for the special case of symmetric arrival rates are derived. Simulations suggest that using these indices provides a substantial improvement over cyclic schedules.

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

References

1979Bandit Processes and Dynamic Allocation Indices 1985Analysis of polling systems 1988Queuing analysis of polling models 1975Dynamic Scheduling of a Multiclass Queue: Discount Optimality 1989Dynamic priority rules for cyclic-type queues 1987Polling with a General-Service Order Table 1988Exact analysis of asymmetric polling systems with single buffers 1987Polling and greedy servers on a line

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.