Entropy maximization for the busy period of a single server queue.

This article applies the maximum entropy principle to determine the probability density function of the delayed busy period in an M/G/1 type queueing system with setup time, two phases of service, Bernoulli vacation, N-policy, and server breakdowns. Numerical illustrations show that the accuracy of the estimated probability density function depends on the type of information fed to the method. [ABSTRACT FROM AUTHOR]