STEADY-STATE PROBABILITY ALGORITHM FOR A SINGLE-SERVER QUEUING SYSTEM

Abstract

A single-server queuing process is investigated.  Using the assumptions of exclusiveness of events, randomly-distributed task duration and independence of the task duration of the length of time a task takes, the characteristics of a single server queue with space limits are investigated.  An algorithm that uses the steady-state behaviours of a stochastic system is developed and implemented in Pascal language in this paper.