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...

In this note we develop a framework for computing upper and lower bounds of an exponential form for a class of stochastic recursive equations with uniformly recurrent Markov modulated inputs. These bounds generalize Kingman's bounds for queues with renewal inputs. Copyright Springer-Verlag...

This paper is the first part of a study of Blackwell optimal policies in Markov decision chains with a Borel state space and unbounded rewards. We prove here the existence of deterministic stationary policies which are Blackwell optimal in the class of all, in general randomized, stationary...

We investigate the general multi-armed bandit problem with multiple servers. We determine a condition on the reward processes sufficient to guarantee the optimality of the strategy that operates at each instant of time the projects with the highest Gittins indices. We call this strategy the...

This paper deals with transportation problems whose demand vectors can be permuted. This additional freedom makes these problems ??-hard, even in the case that the cost matrix fulfills a Monge property. We outline some solution procedures based on good lower and upper bounds. Copyright...

We extend a result by Cavazos-Cadena and Lasserre on the existence of strong 1-optimal stationary policies in Markov decision chains with countable state spaces, uniformly ergodic transition probabilities and bounded costs to a larger class of models with unbounded costs and the so-called...

We show that the lexicographic maximin solution is the only solution that satisfies the axioms of Pareto optimality, comprehensive hull axiom and duplicated individual monotonicity. Copyright Springer-Verlag Berlin Heidelberg 1999

The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is shown that the corresponding makespan problem can be solved in linear time. Copyright Springer-Verlag Berlin Heidelberg 1999

In this paper we study zero-sum stochastic games with Borel state spaces. We make some stochastic stability assumptions on the transition structure of the game which imply the so-called w-uniform geometric ergodicity of Markov chains induced by stationary strategies of the players. Under such...

We study a generalization of the Merton's original problem of optimal consumption and portfolio choice for a single investor in an intertemporal economy. The agent trades between a bond and a stock account and he may consume out of his bond holdings. The price of the bond is deterministic as...