OPTIMAL PRODUCTION POLICIES WITH MULTISTAGE STOCHASTIC DEMAND LEAD TIMES

2009 ◽  
Vol 23 (3) ◽  
pp. 515-543 ◽  
Author(s):  
Jung-Hyun Kim ◽  
Hyun-Soo Ahn ◽  
Rhonda Righter

We study the value of multistage advance demand information (MADI) in a production system in which customers place an order in advance of their actual need, and each order goes through multiple stages before it becomes due. Any order that is not immediately filled at its due date will be backordered. The producer must decide whether or not to produce based on real-time information regarding current and future orders. We formulate the problem as a Markov decision process and analyze the impact of the demand information on the production policy and the cost. We show that the optimal production policy is a state-dependent base-stock policy, and we show that it has certain monotonicity properties. We also introduce a simple heuristic policy that is significantly easier to compute and that inherits the structural properties of the optimal policy. In addition, we show that its base-stock levels bound those of the socially optimal policy. Numerical study identifies the conditions under which MADI is most beneficial and shows that the heuristic performs almost as well as the optimal policy when MADI is most beneficial.

2021 ◽  
Author(s):  
Alain Bensoussan ◽  
Suresh Sethi ◽  
Abdoulaye Thiam ◽  
Janos Turi

2013 ◽  
Vol 37 (6) ◽  
pp. 4464-4473 ◽  
Author(s):  
N. Anbazhagan ◽  
Jinting Wang ◽  
D. Gomathi

OPSEARCH ◽  
2002 ◽  
Vol 39 (3-4) ◽  
pp. 230-242
Author(s):  
Subrata Mitra ◽  
Ashis K. Chatterjee

2020 ◽  
Author(s):  
Linwei Xin

Single-sourcing lost-sales inventory systems with lead times are notoriously difficult to optimize. In this paper, we propose a new family of capped base-stock policies and provide a new perspective on constructing a practical hybrid policy combining two well-known heuristics: base-stock and constant-order policies. Each capped base-stock policy is associated with two parameters: a base-stock level and an order cap. We prove that for any fixed order cap, the capped base-stock policy converges exponentially fast in the base-stock level to a constant-order policy, providing a theoretical foundation for a phenomenon by which a capped dual-index policy converges numerically to a tailored base-surge policy recently observed in other work in a different but related dual-sourcing inventory model. As a consequence, there exists a sequence of capped base-stock policies that are asymptotically optimal as the lead time grows. We also numerically demonstrate its superior performance in general (including small lead times) by comparing it with otherwell-known heuristics.


2012 ◽  
Vol 29 (06) ◽  
pp. 1250039
Author(s):  
WEI GENG ◽  
JIANYONG LIU ◽  
XIAOBO ZHAO

For a periodic-review inventory system with stochastic and continuous demands and without setup costs, it is known that there exists a base-stock policy to be optimal. For a finite-horizon system with non-stationary parameters, it is essential to find approximate optimal policies because of the computational intractability of finding the optimal policy. This paper provides an approach, by which an analytical bound of the error between the costs of the approximate optimal policy and the optimal policy is given. It is shown that the approximate optimal policy converges to the optimal policy as the size of the computational grid decreases. Numerical results are presented to illustrate the methodology.


Sign in / Sign up

Export Citation Format

Share Document