In this article we investigate conditions on the underlying distribution functions on which the sequential order statistics are based, to obtain stochastic comparisons of sequential order statistics in the multivariate likelihood ratio, the multivariate hazard rate, and the usual multivariate stochastic orders. Some applications of the main results are also given.

In this paper, we carry out stochastic comparisons of largest order statistics from multiple-outlier exponential models according to the likelihood ratio order (reversed hazard rate order) and the hazard rate order (usual stochastic order). It is proved, among others, that the weak majorization order between the two hazard rate vectors is equivalent to the likelihood ratio order (reversed hazard rate order) between largest order statistics, and that the p-larger order between the two hazard rate vectors is equivalent to the hazard rate order (usual stochastic order) between largest order statistics. We also extend these results to the proportional hazard rate models. The results established here strengthen and generalize some of the results known in the literature.

In this paper we consider a fluid model of a single buffer in a random external environment modeled by an Ornstein-Uhlenbeck process. Such a model appears as the limiting case of the multiplexing model of Anick, Mitra, and Sondhi [2] in a heavy traffic environment. We use the change of measure technique to derive an exponential upper bound on the tail probabilities of the steady-state buffer content. We also establish an asymptotic upper and lower exponential bounds on the tail probabilities.

A Markov decision chain with countable state space incurs two types of costs: an operating cost and a holding cost. The objective is to minimize the expected discounted operating cost, subject to a constraint on the expected discounted holding cost. The existence of an optimal randomized simple policy is proved. This is a policy that randomizes between two stationary policies, that differ in at most one state. Several examples from the control of discrete time queueing systems are discussed.

We consider a finite capacity queueing system in which each arriving customer offers a reward. A gatekeeper decides based on the reward offered and the space remaining whether each arriving customer should be accepted or rejected. The gatekeeper only receives the offered reward if the customer is accepted. A traditional objective function is to maximize the gain, that is, the long-run average reward. It is quite possible, however, to have several different gain optimal policies that behave quite differently. Bias and Blackwell optimality are more refined objective functions that can distinguish among multiple stationary, deterministic gain optimal policies. This paper focuses on describing the structure of stationary, deterministic, optimal policies and extending this optimality to distinguish between multiple gain optimal policies. We show that these policies are of trunk reservation form and must occur consecutively. We then prove that we can distinguish among these gain optimal policies using the bias or transient reward and extend to Blackwell optimality.

We study the effects of different pricing strategies available to a production–inventory system with capacitated supply, which operates in a fluctuating demand environment. The demand depends on the environment and on the offered price. For such systems, three plausible pricing strategies are investigated: static pricing, for which only one price is used at all times, environment-dependent pricing, for which price changes with the environment, and dynamic pricing, for which price depends on both the current environment and the stock level. The objective is to find an optimal replenishment and pricing policy under each of these strategies. This article presents some structural properties of optimal replenishment policies and a numerical study that compares the performances of these three pricing strategies.

The approximation of the loss probability in finite-buffer queues is a practical problem of considerable interest. A new heuristic is given. This heuristic is based on the equilibrium distribution of the corresponding infinite-buffer queue. Numerical results show an excellent performance of the heuristic.

This paper is concerned with the problem of optimally scheduling a multiclass open queueing network with four single-server stations in which dynamic control policies are permitted. Under the assumption that the system is heavily loaded, the original scheduling problem can be approximated by a dynamic control problem involving Brownian motion. We reformulate and solve this problem and, from the interpretation of the solution, we obtain two dynamic scheduling policies for our queueing network. We compare the performance of these policies with two static scheduling policies and a lower bound via simulation. Our results suggest that under either dynamic policy the system, at least when heavily loaded, exhibits the form of resource pooling given by the solution to the approximating control problem. Furthermore, even when lightly loaded the system performs better under the dynamic policies than under either static policy.

In this article we present a sequence of random variables with weighted tail distribution functions, constructed based on the relevation transform. For this sequence, we prove several recursive formulas and connections to the residual entropy through the unifying framework of the Dickson–Hipp operator. We also give some numerical examples to evaluate our results.

Several models of maintenance of repairable multicomponent systems, subjected to a random environment, are introduced in this paper. For each model, it is shown how various probabilistic quantities of interest are “monotone” as a function of the probability law of the environment or as a function of other parameters of the model. Also, conditions are given which imply the positive dependence of the failure times, or of the counters of the number of failures, in these models.

In the present paper, we introduce a generalization of the cumulative entropy proposed by Di Crescenzo and Longobardi [8]. This new notion is related to the lower records and the reversed relevation transform. Dynamic version of the newly proposed measure is considered. Several properties including the effect of linear transformations, a two-dimensional version, a normalized version, bounds, stochastic ordering, etc. are studied for the generalized cumulative entropy (GCE). Similar results are obtained for the dynamic GCE. Various relationships with other functions are derived. A class of distributions is introduced and several properties are studied. Finally, empirical GCE is proposed to estimate the newly proposed information measure.

We discuss socially optimal and equilibrium retrial rates in a single-server queueing model. We extend known results, compare the two rates, and suggest ways to impose tolls on retrials (or rebates for waiting) in order to equate the equilibrium rate with the socially optimal one.

Resources are to be allocated sequentially to activities to maximize the total expected return, where the return from an allocation is the product of the value of the resource and the value of the activity. The set of activities and their values are given ahead of time, but the resources arrive according to a Poisson process and their values are independent random variables that are observed upon arrival. It is assumed that either there is a single random deadline for all activities, which is the same as discounting the returns, or the activities have independent random deadlines. The model has applications machine scheduling, packet switching, and kidney allocation for transplant. It is known that the optimal policy in the discounted case has a very simple form that does not depend on the activity values. We show that this is also true when the deadlines are independent and in this case the solution can expressed in terms of solutions to single activity models. These results also hold when there are batch arrivals of resources. The effects of pooling separate identical systems with a single activity into a combined system is investigated for both models. When activities have independent deadlines it is optimal to reject a resource in the combined system if and only if it is optimal to reject it in the single activity system. However, when returns are discounted, it is sometimes optimal to accept a resource in the combined system that would be rejected in the single activity system.

This paper studies bicriterion optimization of an M/G/1 queue with a server that can be switched on and off. One criterion is an average number of customers in the system, and another criterion is an average operating cost per unit time. Operating costs consist of switching and running costs. We describe the structure of Pareto optimal policies for a bicriterion problem and solve problems of optimization of one of these criteria under a constraint for another one.

We consider the optimal scheduling problem for a single-server queue without arrivals. We allow preemptions, and our purpose is to minimize the expected flow time. The optimal nonanticipating discipline is known to be the Gittins index policy, which, however, is defined in an implicit way. Until now, its general behavior in this specific problem has been characterized only in a few special cases. In this article, we give as complete a characterization as possible. It turns out that the optimal policy always belongs to the family of multilevel processor sharing disciplines.

This paper considers scheduling n jobs on one machine to minimize the expected weighted flowtime and the number of late jobs. The processing times of the jobs are independent random variables. The machine is subject to failure and repair where the uptimes are exponentially distributed. We find the optimal policies for the preemptive repeat model.

We develop a general framework for understanding the nonparametric (aging) properties of nonnegative random variables through the notion of intrinsic aging. We also introduce some new notions of aging. Many classical and more recent results are special cases of our general results. Our general framework also leads to new results for existing notions of aging, as well as many results for our new notions of aging.

We consider a stochastic input–output system with additional total clearings at certain random times determined by its own evolution (and specified by a controller). Between two clearings, the stock level process is a superposition of a Brownian motion with drift and a compound Poisson process with positive jumps, reflected at zero. We introduce meaningful cost functionals for this system and determine them explicitly under several (classical and new) clearing policies.

We consider the problem of optimally allocating one/two active spares in series systems. Lifetimes of different configurations are compared with respect to the reversed failure rate order, the failure rate order, the increasing concave order, and the stochastic precedence order.

We consider a memoryless single-server queue in which users can purchase relative priority so as to reduce their expected waiting costs, which are linear with time. Relative priority is given in proportion to a price paid by customers present in the system. For two service disciplines, (weighted) processor sharing and (weighted) random entrance, we find the unique pure and symmetric Nash equilibrium price paid by the customers.