### Abstract

The motivation for our study comes from some production and inventory systems in which ordering/producing quantities that exceed certain thresholds in a given period might eliminate some setup activities in the next period. Many examples of such systems have been discussed in prior research but the analysis has been limited to production settings under deterministic demand. In this paper, we consider a periodic-review production-inventory model under stochastic demand and incorporate the following fixed-cost structure into our analysis. When the order quantity in a given period exceeds a specified threshold value, the system is assumed to be in a "warm" state and no fixed cost is incurred in the next period regardless of the order quantity; otherwise the system state is considered "cold" and a positive fixed cost is required to place an order. Assuming that the unsatisfied demand is lost, we develop a dynamic programming formulation of the problem and utilize the concepts of quasi-K-convexity and non-K-decreasing to show some structural results on the optimal cost-to-go functions. This analysis enables us to derive a partial characterization of the optimal policy under the assumption that the demands follow a Pólya or uniform distribution. The optimal policy is defined over multiple decision regions for each system state. We develop heuristic policies that are aimed to address the partially characterized decisions, simplify the ordering policy, and save computational efforts in implementation. The numerical experiments conducted on a large set of test instances including uniform, normal and Poisson demand distributions show that a heuristic policy that is inspired by the optimal policy is able to find the optimal solution in almost all instances, and that a so-called generalized base-stock policy provides quite satisfactory results under reasonable computational efforts. We use our numerical examples to generate insights on the impact of problem parameters. Finally, we extend our analysis into the infinite horizon setting and show that the structure of the optimal policy remains similar.

Original language | English (US) |
---|---|

Pages (from-to) | 531-556 |

Number of pages | 26 |

Journal | Annals of Operations Research |

Volume | 208 |

Issue number | 1 |

DOIs | |

State | Published - Jan 1 2013 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Decision Sciences(all)
- Management Science and Operations Research

### Cite this

}

*Annals of Operations Research*, vol. 208, no. 1, pp. 531-556. https://doi.org/10.1007/s10479-012-1187-1

**Production-inventory control policy under warm/cold state-dependent fixed costs and stochastic demand : Partial characterization and heuristics.** / Caliskan Demirag, Ozgun; Chen, Youhua Frank; Yang, Yi.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Production-inventory control policy under warm/cold state-dependent fixed costs and stochastic demand

T2 - Partial characterization and heuristics

AU - Caliskan Demirag, Ozgun

AU - Chen, Youhua Frank

AU - Yang, Yi

PY - 2013/1/1

Y1 - 2013/1/1

N2 - The motivation for our study comes from some production and inventory systems in which ordering/producing quantities that exceed certain thresholds in a given period might eliminate some setup activities in the next period. Many examples of such systems have been discussed in prior research but the analysis has been limited to production settings under deterministic demand. In this paper, we consider a periodic-review production-inventory model under stochastic demand and incorporate the following fixed-cost structure into our analysis. When the order quantity in a given period exceeds a specified threshold value, the system is assumed to be in a "warm" state and no fixed cost is incurred in the next period regardless of the order quantity; otherwise the system state is considered "cold" and a positive fixed cost is required to place an order. Assuming that the unsatisfied demand is lost, we develop a dynamic programming formulation of the problem and utilize the concepts of quasi-K-convexity and non-K-decreasing to show some structural results on the optimal cost-to-go functions. This analysis enables us to derive a partial characterization of the optimal policy under the assumption that the demands follow a Pólya or uniform distribution. The optimal policy is defined over multiple decision regions for each system state. We develop heuristic policies that are aimed to address the partially characterized decisions, simplify the ordering policy, and save computational efforts in implementation. The numerical experiments conducted on a large set of test instances including uniform, normal and Poisson demand distributions show that a heuristic policy that is inspired by the optimal policy is able to find the optimal solution in almost all instances, and that a so-called generalized base-stock policy provides quite satisfactory results under reasonable computational efforts. We use our numerical examples to generate insights on the impact of problem parameters. Finally, we extend our analysis into the infinite horizon setting and show that the structure of the optimal policy remains similar.

AB - The motivation for our study comes from some production and inventory systems in which ordering/producing quantities that exceed certain thresholds in a given period might eliminate some setup activities in the next period. Many examples of such systems have been discussed in prior research but the analysis has been limited to production settings under deterministic demand. In this paper, we consider a periodic-review production-inventory model under stochastic demand and incorporate the following fixed-cost structure into our analysis. When the order quantity in a given period exceeds a specified threshold value, the system is assumed to be in a "warm" state and no fixed cost is incurred in the next period regardless of the order quantity; otherwise the system state is considered "cold" and a positive fixed cost is required to place an order. Assuming that the unsatisfied demand is lost, we develop a dynamic programming formulation of the problem and utilize the concepts of quasi-K-convexity and non-K-decreasing to show some structural results on the optimal cost-to-go functions. This analysis enables us to derive a partial characterization of the optimal policy under the assumption that the demands follow a Pólya or uniform distribution. The optimal policy is defined over multiple decision regions for each system state. We develop heuristic policies that are aimed to address the partially characterized decisions, simplify the ordering policy, and save computational efforts in implementation. The numerical experiments conducted on a large set of test instances including uniform, normal and Poisson demand distributions show that a heuristic policy that is inspired by the optimal policy is able to find the optimal solution in almost all instances, and that a so-called generalized base-stock policy provides quite satisfactory results under reasonable computational efforts. We use our numerical examples to generate insights on the impact of problem parameters. Finally, we extend our analysis into the infinite horizon setting and show that the structure of the optimal policy remains similar.

UR - http://www.scopus.com/inward/record.url?scp=84883055455&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883055455&partnerID=8YFLogxK

U2 - 10.1007/s10479-012-1187-1

DO - 10.1007/s10479-012-1187-1

M3 - Article

VL - 208

SP - 531

EP - 556

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1

ER -