Using the characterization of point processes having the order statistic property we prove that the only renewal process that has the order statistic property is the Poisson process.

In this paper, we give some upper (lower) bounds on where the Xi's are real-valued random variables. Some applications are given.

The condition of strong mixing for triangular arrays of random variables is a common condition of weak dependence. In this note, it is shown that this condition is not as general as one might believe. In particular, it is shown that there exist triangular arrays of first-order autoregressive random variables which converge almost surely to an independent identically distributed sequence of random variables and for which the central limit theorem holds, but which are not strong mixing triangular arrays. Hence, the strong mixing condition is more restrictive than desired.

This paper is concerned with the determination of the optimal release rate for a continuous storage system. The input to the store is assumed to be a compound Poisson process (with non-negative jumps), and its content is released either at a constant rate or at a linear rate. Rewards are collected at an output-dependent rate and are continuously discounted at a constant rate. The problem consists in finding the optimal release rate which maximizes the infinite-horizon expected discounted return. This problem is solved by deriving an explicit solution for the expected discounted return, from which the optimal release rate can be found.

Consider n jobs and m machines. The m machines are identical and set up in parallel. All n jobs are available at t = 0 and each job has to be processed on one of the machines; any one can do. The processing time of job j is Xj, a random variable with distribution Fj. The sequence in which the jobs start with their processing is predetermined and preemptions are not allowed. We investigate the effect of the variability of the processing times on the expected makespan and the expected time to first idleness. Bounds are presented for these quantities in case the distributions of the processing times of the jobs are new better (worse) than used.