##
**Peeling layers of an onion: Inventory model with multiple delivery modes and forecast updates.**
*(English)*
Zbl 1033.90005

Summary: This paper is concerned with a periodic review inventory system with fast and slow delivery modes and regular demand forecast updates. At the beginning of each period, on-hand inventory and demand information are updated. At the same time, decisions on how much to order using fast and slow delivery modes are made. Fast and slow orders are delivered at the end of the current and the next periods, respectively. It is shown that there exists an optimal Markov policy and that it is a modified base-stock policy.

### Keywords:

forecast revisions; multiple delivery modes; stochastic optimization; periodic review inventory system; regular demand forecast updates; optimal Markov policy; modified base-stock policy
PDFBibTeX
XMLCite

\textit{S. P. Sethi} et al., J. Optim. Theory Appl. 108, No. 2, 253--281 (2001; Zbl 1033.90005)

Full Text:
DOI

### References:

[1] | Fisher, M., Hammond, J. M., Obermeyer, W. R., and Raman, A., Making Supply Meet Demand in an Uncertain World, Harvard Business Review, Vol. 72, May–June, pp. 83–93, 1994. |

[2] | Iyer, A. V., and Bergen, M. E., Quick Response in Manufacturing Retail Channels, Management Science, Vol. 43, pp. 559–570, 1997. · Zbl 0888.90046 |

[3] | Barnes-Schuster, D., Bassok, Y., and Anupindi, R., Coordination and Flexibility in Supply Contracts with Options, Working Paper, Graduate School of Business, University of Chicago, Chicago, Illinois, 1999. · Zbl 1103.90344 |

[4] | Tsay, A., and Lovejoy, W. S., Supply Chain Control with Quantity Flexibility, Manufacturing and Service Operations Management, Vol. 1, pp. 89–111, 1999. |

[5] | Brown, A. O., and Lee. H. L., Optimal Pay-to-Delay Capacity Reservation with Application to the Semiconductor Industry, Working Paper, Department of Industrial Engineering and Engineering Management, Stanford University, Stanford, California, 1997. |

[6] | Yan, H., Liu, K., and Hsu, A., Order Quantity in Dual Supply Model with Updating Forecast,Working Paper, Department of Systems Engineering and Engineering Management, Chinese University of Hong Kong, Hong Kong, 1998. |

[7] | Dvoretzky, A., Keifer, J., and Wolfowitz, J., The Inventory Problem: II: Case of Unknown Distribution Demand, Econometrica, Vol. 20, pp. 450–466, 1956. · Zbl 0048.37101 |

[8] | Eppen, G. D., and Iyer, A. V., Improved Fashion Buying with Bayesian Updates, Operations Research, Vol. 45, pp. 805–819, 1997. · Zbl 0895.90104 |

[9] | Johnson, O., and Thompson, H., Optimality of Myopic Inventory Policies for Certain Depended Processes, Management Science, Vol. 21, pp. 1303–1307, 1975. · Zbl 0307.90019 |

[10] | Lovejoy, W. S., Myopic Policies for Some Inventory Models with Uncertain Demand Distributions, Management Science, Vol. 36, pp. 724–738, 1990. · Zbl 0704.90019 |

[11] | Hausmann, W. H., Sequential Decision Problems: A Model to Exploit Existing Forecast, Management Science, Vol. 16, pp. B93–B111, 1969. |

[12] | Sethi, S., and Sorger, G., A Theory of Rolling Horizon Decision Making, Annals of Operations Research, Vol. 29, pp. 387–416, 1991. · Zbl 0732.93084 |

[13] | Heath, D., and Jackson, P., Modeling the Evolution of Demand Forecast with Application to Safety Stock Analysis in Production / Distribution Systems, IIE Transactions, Vol. 26, pp. 17–30, 1994. |

[14] | Donohue, K. L., Efficient Supply Contracts for Fashion Goods with Forecast Updating and two Production Modes, Working Paper, Wharton School, University of Pennsylvania, Pennsylvania, 1998. · Zbl 1232.90177 |

[15] | Gurnani, H., and Tang, C. S., Note: Optimal Ordering Decisions with Uncertain Cost and Demand Forecast Updating, Management Science, Vol. 45, pp. 1456–1462, 1999. · Zbl 1231.90029 |

[16] | Huang, Y., Yan, H., and Sethi, S., Purchase Contract Management with Demand Forecast Updates, Part 1: High Holding Cost, Working Paper, Department of Systems Engineering and Engineering Management, Chinese University of Hong Kong, Hong Kong, 1999. |

[17] | Gallego, G., and Özer, Ö., Integrating Replenishment Decisions with Advance Demand Information,Working Paper, Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, 1999. · Zbl 1232.90047 |

[18] | Bensoussan, A., Crouhy, M., and Proth, J. M., Mathematical Theory of Production Planning, North-Holland, New York, NY, 1983. · Zbl 0564.90010 |

[19] | Hausmann, W. H., Lee, H. L., and Zhang, V. L., Optimal Ordering for an Inventory System with Dual Lead Times, Working Paper, Department of Industrial Engineering and Engineering Management, Stanford University, Stanford, California, 1993. |

[20] | Zhang, V. L., Ordering Policies for an Inventory System with Three Supply Modes, Naval Research Logistics, Vol. 43, pp. 691–708, 1996. · Zbl 0868.90034 |

[21] | Scheller-Wolf, A., and Tayur, S., A Markovian Dual-Source Production-Inventory Model with Order Bands, GSIA Working Paper No. 1998–E200, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1998. |

[22] | Song, J., and Zipkin, P., Inventory Control in a Fluctuating Demand Environment, Operations Research, Vol. 41, pp. 351–370, 1993. · Zbl 0798.90035 |

[23] | Sethi, S., and Cheng, F., Optimality of (s, S) Policies in Inventory Models with Markovian Demand, Operations Research, Vol. 45, pp. 931–939, 1997. · Zbl 0895.90079 |

[24] | Beyer, D., Sethi, S., and Taksar, M., Inventory Models with Markovian Demands and Cost Functions of Polynomial Growth, Journal of Optimization Theory and Applications, Vol. 98, pp. 281–323, 1998. · Zbl 0908.90108 |

[25] | Fukuda, Y., Optimal Policies for the Inventory Problem with Negotiable Leadtime, Management Science, Vol. 10, pp. 690–708, 1964. |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.