IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v337y2024i1d10.1007_s10479-023-05716-5.html
   My bibliography  Save this article

Optimal control of a dynamic production-inventory system with various cost criteria

Author

Listed:
  • Subrata Golui

    (Indian Institute of Technology Guwahati)

  • Chandan Pal

    (Indian Institute of Technology Guwahati)

  • R. Manikandan

    (Central University of Kerala)

  • Abhay Sobhanan

    (University of South Florida)

Abstract

In this article, we investigate the dynamic control problem of a production-inventory system. Here, demands arrive at the production unit according to a Poisson process and are processed in an FCFS manner. The processing time of the customer’s demand is exponentially distributed. Production manufacturers produce items on a make-to-order basis to meet customer demands. The production is run until the inventory level becomes sufficiently large. We assume that the production time of an item follows an exponential distribution and that the amount of time for the produced item to reach the retail shop is negligible. In addition, we assume that no new customer joins the queue when there is void inventory. Moreover, when a customer is waiting in an infinite FIFO queue for service, he/she does not leave the queue even if the inventory is exhausted. This yields an explicit product-form solution for the steady-state probability vector of the system. The optimal policy that minimizes the discounted/average/pathwise average total cost per production is derived using a Markov decision process approach. We find an optimal policy using value/policy iteration algorithms. Numerical examples are discussed to verify the proposed algorithms.

Suggested Citation

  • Subrata Golui & Chandan Pal & R. Manikandan & Abhay Sobhanan, 2024. "Optimal control of a dynamic production-inventory system with various cost criteria," Annals of Operations Research, Springer, vol. 337(1), pages 75-103, June.
  • Handle: RePEc:spr:annopr:v:337:y:2024:i:1:d:10.1007_s10479-023-05716-5
    DOI: 10.1007/s10479-023-05716-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05716-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-023-05716-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:337:y:2024:i:1:d:10.1007_s10479-023-05716-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.