Note—Note on a Control Problem of Balachandran and Tijms

Onno Boxma

40 citations0/0 files storedManagement Science

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

In this note a conjecture of Balachandran and Tijms [Balachandran, K. R., H. C. Tijms. 1975. On the D-policy for the M/G/1 queue. Management Sci. 21 1073–1076.] concerning the optimality of the D-policy over the N-policy in an M/G/1 queueing system is proved, using an inequality for renewal functions. This inequality seems to have some importance of its own.

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

References

1973Control Policies for a Single Server System

Cited by

1998Queueing processes in bulk systems under the D-policy 1996Bicriterion Optimization of an M/G/1 Queue with A Removable Server 1998An exhaustive lĕvy storage process with intermittent output 1992The Waiting-Time Distribution for the GI/G/1 Queue under the D-Policy 2002A note on the optimality of the N- and D-policies for the M/G/1 queue 2004Workload and Waiting Time Analyses of MAP/G/1 Queue under D-policy 2004Queue Length Analysis of MAP/G/1 Queue UnderD-Policy 2000On optimal exhaustive policies for the M/G/1-queue

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.