The aim of this paper is to solve the basic stochastic shortest-path problem (SSPP) for Markov chains (MCs) with countable state space and then apply the results to a class of nearest-neighbor MCs on the lattice state space <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$\mathbb Z \times \mathbb Z $$</EquationSource> </InlineEquation> whose only moves are one step up,...</equationsource></inlineequation>

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 <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$a\in (0,1)$$</EquationSource> </InlineEquation>. The result is...</equationsource></inlineequation>

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 certain class of perishable inventory systems with items and demands arriving at random times. 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. Generalizing previous work,...

The following variant of a classical selection problem is considered. Offers of random size are successively available to a decision-maker at discrete time instants, and he has to select one without having the possibility of recall. At any time he can accept or reject the current offer based on...