The most recent optimization algorithm for (s, S) order policies with continuous demand was developed byFedergruen and Zipkin (1985). This was also the first efficient algorithm, which uses policy iteration instead ofdiscretization. Zheng and Federgruen (1991) developed an even more efficient...

This paper extends a fundamental result about single-item inventory systems. This approach allows more general performance measures, demand processes and order policies, and leads to easier analysis and implementation, than prior research. We obtain closed form expressions for the Laplace...

The most recent optimization algorithm for (s, S) order policies with continuous demand was developed by Federgruen and Zipkin (1985). This was also the first efficient algorithm, which uses policy iteration instead of discretization. Zheng and Federgruen (1991) developed an even more efficient...

This paper extends a fundamental result about single-item inventory systems. This approachallows more general performance measures, demand processes and order policies, and leads toeasier analysis and implementation, than prior research. We obtain closed form expressions forthe Laplace...

In this paper, we introduce robust versions of the classical static and dynamic single-leg seat allocation models. These robust models take into account the inaccurate estimates of the underlying probability distributions. As observed by simulation experiments, it turns out that for these robust...