A stochastic model is developed to describe the operation in time of the following maintained system setting. A piece of equipment is put in operation at time 0. Each time it fails, a maintenance action is taken which, with probability p(t), is a complete repair or, with probability q(t)=1– p(t), is a minimal repair, where t is the age of the equipment in use at the failure time. It is assumed that complete repair restores the equipment to its good as new condition, that minimal repair restores the equipment to its condition just prior to failure and that both maintenance actions take negligible time.

If the equipment's life distribution F is a continuous function, the successive complete repair times are shown to be a renewal process with interarrival distribution for t ≧ 0. Preservation and monotone properties of the model extending the results of Brown and Proschan (1983) are obtained.

This note gives a method of finding an upper bound for the mean of the maximum of n identically distributed non-negative random variables. The bound is explicitly given and numerically compared with the exact value of the mean of the maximum for some classical distributions (geometric, Poisson, Erlang, hyperexponential).

Variability orderings indicate that one probability distribution is more spread out or dispersed than another. Here variability orderings are considered that are preserved under conditioning on a common subset. One density f on the real line is said to be less than or equal to another, g, in uniform conditional variability order (UCVO) if the ratio f(x)/g(x) is unimodal with the model yielding a supremum, but f and g are not stochastically ordered. Since the unimodality is preserved under scalar multiplication, the associated conditional densities are ordered either by UCVO or by ordinary stochastic order. If f and g have equal means, then UCVO implies the standard variability ordering determined by the expectation of all convex functions. The UCVO property often can be easily checked by seeing if f(x)/g(x) is log-concave. This is illustrated in a comparison of open and closed queueing network models.

Some sufficient conditions for non-ergodicity are given for a Markov chain with denumerable state space. These conditions generalize Foster's results, in that unbounded Lyapunov functions are considered. Our criteria directly extend the conditions obtained in Kaplan (1979), in the sense that a class of Lyapunov functions is studied. Applications are presented through some examples; in particular, sufficient conditions for non-ergodicity of a multidimensional Markov chain are given.

A necessary and sufficient set of conditions is given for the finiteness of a general moment of the R -invariant measure of an R -recurrent substochastic matrix. The conditions are conceptually related to Foster's theorem. The result extends that of [8], and is illustratively applied to the single and multitype subcritical Galton–Watson process to find conditions for Yaglom-type conditional limit distributions to have finite moments.

The total gain, SN, in N successive Petersburg games is considered, and a limit theorem for SN/N – n when N = 2n and n → ∞is proved. The limit distribution can be determined numerically with good accuracy, and this fact provides a simple rule of thumb for determining a premium for the game, which is safe from the point of view of the casino.

The study of simple solar energy storage models leads to the question of analyzing the equilibrium distribution of Markov chains (Harris chains), for which the state at epoch (n + 1) (i.e. the temperature of the storage tank) depends on the state at epoch n and on a controlled input, acceptance of which entails a further decrease of the temperature level. Here we study the model where the input is exponentially distributed. For all values of the parameters involved an explicit expression for the equilibrium distribution of the Markov chain is derived, and from this we calculate, as one of the possible applications, the exact values of the mean of this equilibrium distribution.

Let Xl, · ··, Χ n be independent binary variables with parameters θl, · ··, θ n respectively, and let R denote the length of the longest run of 1's. This note concerns a new expression for and a rearrangement inequality. The inequality is applied to solve an optimal permutation problem for consecutive-k-out-of-n: F networks, and its implications on a recent conjecture of Derman et al. (1982) are discussed.

A Poisson stream of customers arrives at a service center which consists of two single-server queues in parallel. The service times of the customers are exponentially distributed, and both servers serve at the same rate. Arriving customers join the shortest of the two queues, with ties broken in any plausible manner. No jockeying between the queues is allowed. Employing linear programming techniques, we calculate bounds for the probability distribution of the number of customers in the system, and its expected value in equilibrium. The bounds are asymptotically tight in heavy traffic.

This paper describes the operator mapping a renewal-interval distribution into its associated stationary-excess distribution. This operator is monotone for some kinds of stochastic order, but not for the usual stochastic order determined by the expected value of all non-decreasing functions. Conditions for a renewal-interval distribution to be larger or smaller than its associated stationary-excess distribution for several kinds of stochastic order are determined in terms of familiar notions of ageing. Convergence results are also obtained for successive iterates of the operator, which supplement Harkness and Shantaram (1969), (1972) and van Beek and Braat (1973).

A class of two-node queueing networks with general stationary ergodic governing sequence is considered. This means that, in particular, a non-Poissonian arrival process and dependent service times, as well as a non-Bernoulli feedback mechanism are admitted. A mixing condition ensures that the limiting distributions of the number of customers in the nodes observed in continuous time as well as at certain embedded epochs can be expressed by the Palm distributions of appropriately chosen marked point processes. This gives the possibility of connecting the classical concept of embedding with a general point-process approach. Furthermore, it leads to simple proofs of relationships between the limiting distributions. An example is given to illustrate how these relationships can be used to derive explicit formulas for various stationary queueing characteristics.

This paper mainly considers the adaptive version of two typical stopping problems, i.e., the parking problem and the secretary problem with refusal. In the first problem, while driving towards a destination, we observe the successive parking places and note whether or not they are occupied. Unoccupied spaces are assumed to occur independently, with probability p. The second problem is to select the best applicant from a population, where each applicant refuses an offer with probability 1 – p. We assume beta prior for p in advance. As time progresses, we update our belief for p in a Bayesian manner based on the observed states of the process. We derive several monotonicity properties of the value function and characterize the optimal strategy in either problem. We also attempt to relax the same probability condition in the classical parking problem.

König et al. (1978) have derived the so-called intensity conservation law in a stationary process connected with a marked point process (PMP). That law has been shown to be useful in obtaining invariance relations in queues (cf. Franken et al. (1981)). In this paper, somewhat different versions of the intensity conservation laws are derived for a stationary process with jump points. These laws are applied to queues with randomly changed service rate. As special cases, most of equations obtained by König et al.'s law can be derived from this law. Also, we derive some inequalities between characteristic quantities in a queue with a simple type of randomly changed service rate.

We consider a production–inventory problem in which the production rate can be dynamically adjusted to cope with random fluctuations in demand. Customers arrive according to a renewal process, and the customer's demand is assumed to be exponentially distributed. Excess demand is backlogged. The production is controlled by a two-critical-number rule that prescribes which one of the two possible production rates must be used. Tractable expressions are given for several services measures including the fraction of demand backlogged. The analysis is based on the results for hitting probabilities in random walks, where the jump distribution has an exponential right or left tail.

A queue with Poisson arrivals and two different exponential servers is considered. It is assumed that customers are allowed to stall, i.e., to wait for a busy fast server at times when the slow server is free. A stochastic analysis of the queue is given, steady-state probabilities are computed, and policies for overall optimization are characterized and computed. The issue of individual customer's optimization versus overall optimization is also discussed.

A direct and general proof is given of the equivalence of partial balance and insensitivity.

In this note we prove some stochastic decomposition results for variations of the GI/G/1 queue. Our main model is a GI/G/1 queue in which the server, when it becomes idle, goes on a vacation for a random length of time. On return from vacation, if it finds customers waiting, then it starts serving the first customer in the queue. Otherwise it takes another vacation and so on. Under fairly general conditions the waiting time of an arbitrary customer, in steady state, is distributed as the sum of two independent random variables: one corresponding to the waiting time without vacations and the other to the stationary forward recurrence time of the vacation. This extends the decomposition result of Gelenbe and Iasnogorodski [5]. We use sample path arguments, which are also used to prove stochastic decomposition in a GI/G/1 queue with set-up time.

We consider the stable k-server queue with non-stationary Poisson arrivals and i.i.d. service times and show that the non-time-homogeneous Markov process Zt = (the queue length and residual service times at time t) can be subordinated to a stable time-homogeneous regenerative process. As an application we show that if the system starts from given conditions at time s then the distribution of Zt stabilizes (but depends on t) as s tends backwards to –∞. Also moment and stochastic domination results are established for the delay and recurrence times of the regenerative process leading to results on uniform rates of convergence.

This paper considers a single-server queueing system with Markov-dependent interarrival times, with special reference to the serial correlation coefficient of the arrival process. The queue size and waiting-time processes are investigated. Both transient and limiting results are given.

In optimal stopping problems in which the player is free to choose the order of observation of the random variables as well as the stopping rule, it is shown that in general there is no function of all the moments of individual integrable random variables, nor any function of the first n moments of uniformly bounded random variables, which can determine the optimal ordering. On the other hand, several fairly general rules for identification of the optimal ordering based on individual distributions are given, and applications are made to several special classes of distributions.