A relaxation time heuristic for exponential-Erlang queueing systems

A relaxation time heuristic for exponential-Erlang queueing systems

0.00 Avg rating0 Votes
Article ID: iaor1994356
Country: United Kingdom
Volume: 20
Issue: 3
Start Page Number: 293
End Page Number: 301
Publication Date: Apr 1993
Journal: Computers and Operations Research
Authors: ,
Keywords: queues: theory, heuristics
Abstract:

The relaxation time heuristic is a technique for reducing initialization bias in the simulation of stationary, infinite-capacity, Markovian queueing systems. It differs from many existing methods in that no preliminary simulation runs are required; it is based on characteristics of the underlying theoretical model. The authors apply and evaluate the relaxation time heuristic for estimation of the steady-state expected number of customers in M/Ek/1 and Ek/M/1 queueing systems.

Reviews

Required fields are marked *. Your email address will not be published.