<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>04068019</id>
  <dt>j</dt>
  <an>04068019</an>
  <augroup>
    <au>Altiok, Tayfur</au>
  </augroup>
  <ti>Queues with group arrivals and exhaustive service discipline.</ti>
  <so>Queueing Syst. 2(1987), No.4, 307-320 (1988).</so>
  <py>1988</py>
  <pu>Springer, Dordrecht</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>compound Poisson arrivals</ut>
    <ut>phase-type service and exhaustive service discipline</ut>
    <ut>steady-state probability</ut>
    <ut>stochastic decomposition property</ut>
    <ut>queues with group arrivals</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/BF01150043</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Queues with compound Poisson arrivals, phase-type service and exhaustive service discipline are studied. An algorithmic method is developed to compute the steady-state probability distribution of the number of customers in the system with unlimited or limited queue capacities. Examples with different model parameters are given to show the computational efficiency of the method. In the Appendix, the stochastic decomposition property for the queues with single arrivals and with exhaustive service discipline is extended to queues with group arrivals.</ab>
    <rv></rv>
  </abgroup>
</item>