We derive the stationary distribution of the regenerative process W(t), t ≥ 0, whose cycles behave like an M / G / 1 workload process terminating at the end of its first busy period or when it reaches or exceeds level 1, and restarting with some fixed workload $$a\in (0,1)$$ . The result is...

This paper analyzes numerically a long-term average stochastic control problem involving a controlled diffusion on a bounded region. The solution technique takes advantage of an infinite-dimensional linear programming formulation for the problem which relates the stationary measures to the...

An inventory system for perishable commodities (PIS) with finite shelf size and finite waiting room for demands is studied; the maximum shelf life and the maximum waiting time of a demand are assumed to be either constant or exponentially distributed, and the arrival rates for items and for...

We present models for inventory systems with perishable commodities (PISs) in which the items are not scrapped after reaching their maximum lifetime but are transferred to a second PIS where they are used to satisfy another random stream of demands. We determine the steady-state distribution of...

We consider a G / M / 1 queue with two-stage service policy. The server starts to serve with rate of μ 1 customers per unit time until the number of customers in the system reaches λ. At this moment, the service rate is changed to that of μ 2 customers per unit time and this rate continues...

The maximum packing (MP) policy for dynamic channel assignment in cellular radio communication systems specifies that a new call attempt is admitted whenever there is some way of rearranging channels so that every call can be carried. Otherwise the call is blocked and removed from the system. We...

<Para ID="Par1">A discrepancy function provides for an evaluation of a candidate model by quantifying the disparity between the candidate model and the true model that generated the observed data. The favored model from a candidate class is the one judged to have minimum discrepancy with the true model. The...</para>

<Para ID="Par1">We give sufficient conditions which the mutation rate must satisfy for the convergence of the genetic algorithm when that rate is allowed to change throughout iterations. The empirical performance of the algorithm with regards to changes in the mutation parameter is explored via test functions,...</para>