On time-to-buffer overflow distribution in a single-machine discrete-time system with finite capacity

On time-to-buffer overflow distribution in a single-machine discrete-time system with finite capacity

Blog Article

A model of a single-machine production system with finite magazine capacity is investigated.The input flow of jobs is organized according to geometric distribution of interarrival times, while processing times are assumed to here be generally distributed.The closed-form formula for the generating function of the time to the first buffer overflow distribution conditioned by the initial buffer state is found.The analytical approach based on the idea of embedded Markov Long Sleeve chain, the formula of total probability and linear algebra is applied.The corresponding result for next buffer overflows is also given.

Numerical examples are attached as well.