Asset Details
Do you wish to reserve the book?
A simple heuristic policy for stochastic inventory systems with both minimum and maximum order quantity requirements
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A simple heuristic policy for stochastic inventory systems with both minimum and maximum order quantity requirements
Do you wish to request the book?
A simple heuristic policy for stochastic inventory systems with both minimum and maximum order quantity requirements
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
A simple heuristic policy for stochastic inventory systems with both minimum and maximum order quantity requirements
2022
Overview
In this paper, we consider a periodic-review stochastic inventory system with both minimum and maximum order quantity (MinOQ and MaxOQ, respectively) requirements. In each period, if an order is placed, the order quantity is bounded, at least at the MinOQ and at most the MaxOQ. The optimal policy of such a system is unknown, and even if it exists, it must be quite complicated. We propose a heuristic policy, called the modified (s, S) policy, under which whenever the inventory position drops to the reorder point s or below, an order is placed to raise the inventory position as close as possible to the order-up-to level S. Applying a discrete-time Markov chain approach, we are able to compute the system-wide long-run average cost. We provide bounds for the optimal values of s and S and design an efficient algorithm to optimize our proposed policy. In addition, the proposed heuristic policy has excellent performance in our numerical studies. We also measure the impact of some inventory parameters.
Publisher
Springer Nature B.V
Subject
