A Time-Sharing Queue with a Finite Number of Customers

Igal Adiri · Benjamin Avi-Itzhak

31 citations0/0 files storedJournal of the ACM

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 Probability and Statistical Research Optimization and Search Problems

Abstract

A time-sharing queue serving a finite number of customers is described. It is assumed that both the service time and the time elapsing between termination of service and the next arrival of the same customer at the queue (service station) are exponential. The model was studied by Krishnamoorthi and Wood, but their results are not in complete agreement with the results of this paper. In addition, some new results are presented in terms of steady-state expectations.

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

References

1966Time-Shared Computer Operations With Both Interarrival and Service Times Exponential

Cited by

1989Random Initialization Methods in Simulation 1981Control of initialization bias in multivariate simulation response 1977Statistical analysis of simulation output data

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.