Tandem behavior of a finite capacity G/M/1 queueing system: An algorithm

Tandem behavior of a finite capacity G/M/1 queueing system: An algorithm

0.00 Avg rating0 Votes
Article ID: iaor1992732
Country: Netherlands
Volume: 46
Issue: 3
Start Page Number: 380
End Page Number: 387
Publication Date: Jun 1990
Journal: European Journal of Operational Research
Authors:
Keywords: simulation
Abstract:

A heuristic algorithm is developed for approximating the tandem behavior of a finite capacity G/M/1 queueing system with generally distributed interarrival time, a single Markovian server, and the first come first served queueing discipline, in steady state. Furthermore, numerical results are provided and the approximation outcomes are compared against those from a simulation study.

Reviews

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