The long-run average cost per unit time of operating a finite dam controlled by a policy (Lam Yeh (1985)) is determined when the cumulative input process is the integral of a Markov chain. A penalty cost which accrues continuously at a rate g(X(t)), where g is a bounded measurable function of the content, is also introduced. An example where the input rate is a two-state Markov chain is considered in detail to illustrate the computations.

A model incorporating the effect of a common environment on several components (structurally independent) of a system is developed. A multivariate generalization of the Lomax (Pareto type 2) distribution is obtained by mixing exponential variables. Its relationship to other multivariate distributions is discussed. Several properties of this distribution are reported and their usefulness in reliability theory indicated. Finally, a further generalization of this multivariate Lomax distribution is presented.

For a GI/G/1 queue we derive new lower and uper bounds on the expected stationary waiting time which are a function of more than the first two moments of the inter-arrival and service times. When the probability for a delay is low, the bounds tend to be better than other bounds. This is illustrated in an example of a Uniform/Uniform/1 queue.

Suppose that pulses arrive according to a Poisson process of rate λ with the duration of each pulse independently chosen from a distribution F having finite mean. Let X(t) be the shot noise process formed by the superposition of these pulses. We consider functionals H(X) of the sample path of X(t). H is said to be L-superadditive if for all functions f and g. For any distribution F for the pulse durations, we define H(F) = EH(X). We prove that if H is L-superadditive and for all convex functions ϕ, then . Various consequences of this result are explored.

A class of M/G/1 time-sharing queues with a finite number of service positions and unlimited waiting space is described. The equilibrium distribution of symmetric queues belonging to this class is invariant under arbitrary service-independent reordering of the customers at instants of arrivals and departures. The delay time distribution, in the special case of one service position where preempted customers join the end of the line, is provided in terms of Laplace transforms and generating functions. It is shown that placing preempted customers at the end of the line rather than at the beginning of the line results in a reduction of the delay time variance. Comparisons with the delay time variance of the case of unlimited number of service positions (processor sharing system) are presented.

This paper studies the GI/G/1 queueing system assuming that customers have service times depending on the queue size and also that they are served in accordance with the preemptive-resume last-come–first-served queue discipline. Expressions are given for the limiting distribution of the queue size and the remaining durations of the corresponding services, when the system is considered at arrival epochs, at departure epochs and continuously in time. Also these results are applied to some particular cases of the above queueing system.

Multiple channel queues with Poisson arrivals, exponential service distributions, and finite capacity are studied. A customer who finds the system at capacity either leaves the system for ever or may return to try again after an exponentially distributed time. Steady state probabilities are approximated by assuming that the returning customers see time averages. The approximation is shown to result in an upper bound on system performance.

Some consequences of a modified repair system for Phillips' (1981a, b) model for a two-component system are discussed. In the original model, both components are repaired whenever a revealed fault occurs; in the modified model only faulty components are repaired. Specifically (i) the distribution of time from the initial state up to discovery of an unrevealed fault, (ii) the expected proportion of time during which there exists an unrepaired fault, and (iii) the distribution of number of revealed faults up to and including the one which leads to a discovery of an unrevealed fault, are obtained. The theory is illustrated by examples, based on specific distributions for the times between repairs and occurrences of the two types of faults. A characterization of the exponential distribution is indicated.

The problem of optimal control of a finite dam in the class of policies has been considered by Lam Yeh [6], [7]. In this paper, by using the first Dynkin formula, the same problems of specifying an optimal policy in the class of the policies to minimize the expected total discounted cost as well as the long-run average cost are considered. Both the expected total discounted cost and long-run average cost are determined explicitly, and then the optimal policy can be found numerically, Also, we obtain the transition density function and the resolvent operator of a reflecting Wiener process.

The questions of almost sure convergence of the sequence Xn defined below in (1) as well as that of to a finite limit are settled here. These sequences arise in a simple stochastic model for crop erosion considered by Todorovic and Gani (1987).

Let where {Zn, ℱn} is a non-negative submartingale satisfying Ei(Zn log Zn) →∞. It is shown that When {Zn} is a simple critical Galton–Watson process and is slowly varying at∞, conditions are given ensuring that This gives an alternative proof of a result recently established by Kammerle and Schuh.

In this paper we investigate the server's busy period in a single-server queueing situation in which the interarrival interval T preceding the arrival of a customer and his service time S are assumed correlated. A closed-form expression is obtained for the Laplace transform bn(z) of the joint probability and probability density function of the busy period duration and the number of customers served in it. Some numerical values are given showing the effect of correlation between T and S.

For optimal stopping problems in which the player is allowed to choose the order of the random variables as well as the stopping rule, a notion of order equivalence is introduced. It is shown that different (non-degenerate) distributions cannot be order-equivalent.

This result unifies and generalizes two theorems of a similar nature recently obtained by Hill and Hordijk (1985).

Our concern is with a particular problem which arises in connection with a discrete-time Markov chain model for a graded manpower system. In this model, the members of an organisation are classified into distinct classes. As time passes, they move from one class to another, or to the outside world, in a random way governed by fixed transition probabilities. In this paper, the emphasis is placed on evaluating exact values of the probabilities of attaining and maintaining a structure.

For a sequence ξ1, ξ2, · ·· of i.i.d. random variables let X0 = 0 and Xk = max(Xk–1 + ξ k, 0) for k = 1, 2, ···. Let . These stopping times are used in Page's (1954) one-sided cusum procedures and are also important in queueing theory. Various asymptotic properties of Nx are derived.

In this paper we study the M/M/2/2 queue with repeated attempts. It is shown that the part generating functions of the steady state probabilities can be expressed in of generalized hypergeometric unctions.

This paper is about representations for equilibrium sojourn time distributions in Jackson networks of queues. For a network with N single-server nodes let hi be the Laplace transform of the residual system sojourn time for a customer ‘arriving' to node i, ‘arrival' meaning external input or internal transfer. The transforms {hi : i = 1, ···, N} are shown to satisfy a system of equations we call the network flow equations. These equations lead to a general recursive representation for the higher moments of the sojourn time variables {Ti : i = 1, ···, N}. This recursion is discussed and then, by way of illustration, applied to the single-server Markovian queue with feedback.

A continuum structure function is a non-decreasing mapping from the unit hypercube to the unit interval. A definition of the reliability importance, ℛi(α) say, of component i at system level α(0 < α ≦ 1) is proposed. Some properties of this function are deduced, in particular conditions under which and conditions under which ℛi(α) is positive (0 < α < 1).

We consider GI/G/1 queues in an environment which is periodic in the sense that the service time of the nth customer and the next interarrival time depend on the phase θ n at the arrival instant. Assuming Harris ergodicity of {θ n} and a suitable condition on the traffic intensity, various Markov chains related to the queue are then again Harris ergodic and provide limit results for the standard customer- and time-dependent processes such as waiting times and queue lengths. As part of the analysis, a result of Nummelin (1979) concerning Lindley processes on a Markov chain is reconsidered.