We consider control policies for perishable inventory systems with random input whose purpose is to mitigate the effects of unavailability. In the basic uncontrolled system, the arrival times of the items to be stored and the ones of the demands for those items form independent Poisson processes. The shelf lifetime of every item is finite and deterministic. Every demand is for a single item and is satisfied by the oldest item on the shelf, if available. The first controlled model excludes the possibility of unsatisfied demands by introducing a second source of fresh items that is completely reliable and delivers without delay whenever the system becomes empty. In the second model, there is no additional ordering option by outsourcing. However, to avoid the most adverse effects of unavailability, the demands are classified into different categories of urgency. An incoming demand is satisfied or not according to its category and the current state of the system. For both models, we determine the steady-state distribution of the virtual outdating process, which is then used to derive the relevant cost functionals: the steady-state distribution and expected value of the number of items in the system, the rate of outdatings, as well as, for model 1, the rate of special orders from the external source and, for model 2, the rate of unsatisfied demands.

Consider a single machine that can process multiple jobs in batch mode. We have n jobs and the processing time of job j is a random variable Xj with distribution Fj. Up to b jobs can be processed simultaneously by the machine. The jobs in a batch all have to start at the same time and the batch is completed when all jobs have finished their processing (i.e., at the maximum of the processing times of the jobs in that batch). We are interested in two objective functions, namely the minimization of the expected makespan and the minimization of the total expected completion time. We first show that under certain fairly general conditions, the minimization of the expected makespan is equivalent to specific deterministic combinatorial problems, namely the Weighted Matching problem and the Set Partitioning problem. We then consider the case when all jobs have the same mean processing time but different variances. We show that for certain special classes of processing time distributions the Smallest Variance First rule minimizes the expected makespan as well as the total expected completion time. In our conclusions we present various general rules that are suitable for the minimization of the expected makespan and the total expected completion time in batch scheduling.

Two different estimators of the failure rate of software are compared. It is shown that one tends to be better when the number of errors is small to moderate and the other when the number of errors is large.

A consecutive-2 graph is a graph where each vertex is associated with a failure probability and the graph is considered failed if any two adjacent vertices both fail. Recently, the problem of computing reliability for general consecutive-2 graph was shown to be #P-complete while polynomial algorithms exist for trees. In this paper, we give a linear time algorithm for a class of graphs including forests and cycles.

For a given set of failure probabilities qi, the assignment of qi to the vertices of a given graph is optimal if it maximizes the reliability of that graph. It is known that optimal assignments for trees require messy computations while linear algorithms exist for lines and stars. In this paper, we prove that the optimal reliability of any n−tree is bounded between those of an n−line and an n−star.

A new partial ordering generated by the set of star-shaped functions is introduced. This ordering is equivalent to the stochastic comparison of the length-biased distributions which are frequently appropriate for certain natural sampling plans in biometry, reliability, and survival analysis studies. It is shown that the length-biased ordering fits in the framework of stochastic and variatiility orderings. It enjoys many properties similar to those of the stochastic and variability orderings.

μ-Geometric ergodicity of two-dimensional versions of the ALOHA and coupled processors models is verified by checking μ-geometric recurrence. Ergodicity and convergence of the Laplace-Stieltjes transforms in a neighborhood of 0 are necessary and sufficient conditions for the first model. The second model is exponential, for which ergodicity suffices to establish the required results.

Suppose we have a single asset that we would like to sell. As time goes by, independent and identically distributed offers with a common known distribution F are given to us. At any given moment, we may either accept the current offer or reject it, thereby losing it forever. The rate at which offers arrive follows a nonhomogeneous Poisson process whose instantaneous intensity is under our control, using advertizing in a manner to be described. Our objective is, roughly, that of maximizing the total discounted expected reward composed of the offer we decide to accept, minus the total advertizing costs.

We consider the problem of dynamic multi-skill routing in call centers. Calls from different customer classes are offered to the call center according to a Poisson process. The agents are grouped into pools according to their heterogeneous skill sets that determine the calls that they can handle. Each pool of agents serves calls with independent exponentially distributed service times. Arriving calls that cannot be served directly are placed in a buffer that is dedicated to the customer class. We obtain nearly optimal dynamic routing policies that are scalable with the problem instance and can be computed online. The algorithm is based on approximate dynamic programming techniques. In particular, we perform one-step policy improvement using a polynomial approximation to relative value functions. We compare the performance of this method with decomposition techniques. Numerical experiments demonstrate that our method outperforms leading routing policies and has close to optimal performance.

We study an asymmetric cyclic polling system with Poisson arrivals, general service-time and switch-over time distributions, and so-called two-phase gated service at each queue, an interleaving scheme that aims to enforce some level of “fairness” among the different customer classes. For this model, we use the classical theory of multitype branching processes to derive closed-form expressions for the Laplace–Stieltjes transform of the waiting-time distributions when the load tends to 1, in a general parameter setting and under proper heavy-traffic scalings. This result is strikingly simple and provides new insights in the behavior of two-phase polling systems. In particular, the result provides insight in the waiting-time performance and the trade-off between efficiency and fairness of two-phase gated polling compared to the classical one-phase gated service policy.

This paper deals with stochastic comparisons of the largest order statistics arising from two sets of independent and heterogeneous gamma samples. It is shown that the weak supermajorization order between the vectors of scale parameters together with the weak submajorization order between the vectors of shape parameters imply the reversed hazard rate ordering between the corresponding maximum order statistics. We also establish sufficient conditions of the usual stochastic ordering in terms of the p-larger order between the vectors of scale parameters and the weak submajorization order between the vectors of shape parameters. Numerical examples and applications in auction theory and reliability engineering are provided to illustrate these results.

This article considers the asset price movements in a financial market when risky asset prices are modeled by marked point processes. Their dynamics depend on an underlying event arrivals process—a marked point process having common jump times with the risky asset price process. The problem of utility maximization of terminal wealth is dealt with when the underlying event arrivals process is assumed to be unobserved by the market agents using, as the main tool, backward stochastic differential equations. The dual problem is studied. Explicit solutions in a particular case are given.

We specify the smallest mode of the ordinary multinomials leading to the expression of the maximal probability of convolution powers of the discrete uniform distribution. The generating function for an extension of the maximal probability is given.

In a job-shop manufacturing environment, consider a model in which the “job” is processed at several stages with random yields. Nondefective items move through the stages to supply a possibly random demand. At each stage there are linear costs of processing and work-in-process inventories and there are convex costs of end-item inventory. Decisions specify the lot sizes that are processed at the various stages. Easy computations specify a simply structured decision rule that minimizes the expected total cost.

We consider a single-server queue with exponential service time and two types of arrivals: positive and negative. Positive customers are regular ones who form a queue and a negative arrival has the effect of removing a positive customer in the system. In many applications, it might be more appropriate to assume the dependence between positive arrival and negative arrival. In order to reflect the dependence, we assume that the positive arrivals and negative arrivals are governed by a finite-state Markov chain with two absorbing states, say 0 and 0′. The epoch of absorption to the states 0 and 0′ corresponds to an arrival of positive and negative customers, respectively. The Markov chain is then instantly restarted in a transient state, where the selection of the new state is allowed to depend on the state from which absorption occurred.

The Laplace–Stieltjes transforms (LSTs) of the sojourn time distribution of a customer, jointly with the probability that the customer completes his service without being removed, are derived under the combinations of service disciplines FCFS and LCFS and the removal strategies RCE and RCH. The service distribution of phase type is also considered.

We consider the problem of determining when to exit an investment whose cumulative return follows a Brownian motion with drift μ and volatility σ2. After an unobserved exponential amount of time, the drift drops from μH > 0 to μL < 0. Using results from stochastic differential equations, we are able to show that it is optimal to exit the first time the posterior probability of being in the low state falls to p*, where the value of p* is given implicitly. We effect a complete comparative statics analysis; one surprising result is that a decrease in μL is beneficial when |μL| is large.

The distribution of the linear combination αX + βY is derived when X and Y are independent Laplace random variables. Extensive tabulations of the associated percentage points are also given. The work is motivated by examples in automation, control, fuzzy sets, neurocomputing, and other areas of informational sciences.

In this paper, we investigate the degree profile and Gini index of random caterpillar trees (RCTs). We consider RCTs which evolve in two different manners: uniform and nonuniform. The degrees of the vertices on the central path (i.e., the degree profile) of a uniform RCT follows a multinomial distribution. For nonuniform RCTs, we focus on those growing in the fashion of preferential attachment. We develop methods based on stochastic recurrences to compute the exact expectations and the dispersion matrix of the degree variables. A generalized Pólya urn model is exploited to determine the exact joint distribution of these degree variables. We apply the methods from combinatorics to prove that the asymptotic distribution is Dirichlet. In addition, we propose a new type of Gini index to quantitatively distinguish the evolutionary characteristics of the two classes of RCTs. We present the results via several numerical experiments.

This article is concerned with a loading-dependent model of cascading failure proposed recently by Dobson, Carreras, and Newman [6]. The central problem is to determine the distribution of the total number of initial components that will have finally failed. A new approach based on a closed connection with epidemic modeling is developed. This allows us to consider a more general failure model in which the additional loads caused by successive failures are arbitrarily fixed (instead of being constant as in [6]). The key mathematical tool is provided by the partial joint distributions of order statistics for a sample of independent uniform (0,1) random variables.

We exploit a novel bounding argument to obtain sharp bounds for survival functions belonging to the Increasing initially then Decreasing Mean Residual Life (IDMRL) class introduced by Guess, Hollander and Proschan (1986) [8]. The bounds obtained are in terms of the mean, change point and pinnacle of the mean residual life function. The bounds for the monotonic ageing classes Decreasing Mean Residual Life (DMRL) and Increasing Mean Residual Life (IMRL) are obtained as special cases. Discussions on the bounds as well as two concrete illustrative examples are included.

Linear combinations of independent random variables have been extensively studied in the literature. Xu & Hu [21] and Pan, Xu, & Hu [16] unified the study of linear combinations of independent random variables under the general setup. This paper is a companion one of these two papers. In this paper, we will further study this topic. The results are further generalized to the cases of permutation invariant random variables and of independent but not necessarily identically distributed random variables which are ordered in the likelihood ratio or the hazard ratio order.