A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS

Yukio Takahashi

65 citations0/0 files storedJournal of the Operations Research Society of Japan

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 Probability and Risk Models

Abstract

A numerical method is proposed for solving the balance equations of the steady-state probabilities of a GI/G/c queueing system in a general class. The method is based on an iterative calculation of conditional probabilities, instead of absolute probabilities, conditioned by the number of customers in the system. By skillfully exploiting a convergence property of the conditional probabilities, it provides a fairly accurate solution of the balance equations with relatively little computational burden.

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

Cited by

1995Approximation of the Mean Queue Length of an M/G/c Queueing System 1977AN APPROXIMATION FORMULA FOR THE MEAN WAITING TIME OF AN M/G/c QUEUE 1983A numerical solution for the multi-server queue with hyper-exponential service times 1983Comparison conjectures about the M/G/s queue 1989Maximum Entropy Analysis of Multiple-server Queueing Systems 1982Approximations for the waiting time distribution of the M/G/c queue 1990Chapter 10 Queueing theory 1984Approximations for the conditional waiting times in the GI/G/c queue

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