Takács has shown that, in the M/G/1 queue, the probability P(k | i) that the maximum number of customers present simultaneously during a busy period that begins with i customers present is P(k | i) = Qk–i/Qk, where the Q's are easily calculated by recurrence in terms of an arbitrary Q0 ≠ 0. We augment Takács's theorem by showing that P(k | i) = bk–i/bk, where bn is the mean busy period in the M/G/1 queue with finite waiting room of size n; that is, if we take Q0 equal to the mean service time, then Qn =bn.

This note draws attention to a practical problem of interest to physicists, namely the distribution of the inter-arrival times of those customers accepted by the M/D/1/K + 1 queue. The form of the distribution is found for all K and the generalisation to M/G/1/K + 1 is discussed. The approach follows the contour integral method described by Cohen.

A finite-state semi-Markov process (SMP) with penalties is considered. A property which is similar to an increasing-hazard-rate property for a Markov chain is defined for an SMP. The SMP is controlled by shifts from the state Ei to immediately after a transition has occurred. Conditions are given which guarantee that the optimal stationary Markovian policy belongs to a subclass of control-limit policies.

A parallel reliability system is subject to shocks which are generated by a renewal point process. The shocks cause the components to fail with certain probabilities. First we study the case when the components fail independently of each other with the same probability. For this case simple closed expressions for the Laplace-Stieltjes transform and expectation of time to system failure are derived. Then a case of dependent components is studied: the probability of failure of a component depends on the number of functioning components. Some extensions are mentioned.

Exponential bounds for the stationary waiting-time distribution of the type ae–θt are considered. These bounds are obtained by the use of Kingman's method of ‘integral inequalities’. Approximations of Θ and a are given which are useful especially if the service and/or inter-arrival time distribution functions are NBUE or NWUE.

The average number of vehicles being able to enter an intersection per time unit from a minor road with a stop or yield sign — the capacity of the intersection — depends on the density of the traffic stream on the major road. In case the time-process of the major road traffic at the intersection is a non-homogeneous Poisson process with a periodic intensity function the capacity is calculated and compared with the capacity in the homogeneous case.

For a single-server queue with one waiting place and increasing arrival rate some necessary and sufficient conditions for infinitely many returns to emptiness with probability one are given.