18 research outputs found

    Sojourn-time distribution of the G I/M S P/1 queueing system

    No full text

    Methods of limiting decomposition and Markovian summation in queueing system with infinite number of servers

    No full text
    In this paper, we study the process generated by the customers which are serviced in a queueing system with an infinite number of servers. Two methods referred to as the method of limiting decomposition and the method of Markovian summation are proposed, implemented and compared. The characteristic function of the probability distribution for the studied process is obtained. The numerical examples are performed for different values of queueing system characteristics
    corecore