IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v65y2018i8p638-659.html
   My bibliography  Save this article

A novel use of value iteration for deriving bounds for threshold and switching curve optimal policies

Author

Listed:
  • Dwi Ertiningsih
  • Sandjai Bhulai
  • Flora Spieksma

Abstract

In this article, we develop a novel role for the initial function v0 in the value iteration algorithm. In case the optimal policy of a countable state Markovian queueing control problem has a threshold or switching curve structure, we conjecture, that one can tune the choice of v0 to generate monotonic sequences of n‐stage threshold or switching curve optimal policies. We will show this for three queueing control models, the M/M/1 queue with admission and with service control, and the two‐competing queues model with quadratic holding cost. As a consequence, we obtain increasingly tighter upper and lower bounds. After a finite number of iterations, either the optimal threshold, or the optimal switching curve values in a finite number of states is available. This procedure can be used to increase numerical efficiency.

Suggested Citation

  • Dwi Ertiningsih & Sandjai Bhulai & Flora Spieksma, 2018. "A novel use of value iteration for deriving bounds for threshold and switching curve optimal policies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(8), pages 638-659, December.
    • Handle: RePEc:wly:navres:v:65:y:2018:i:8:p:638-659
    DOI: 10.1002/nav.21824
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21824
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21824?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
    ---><---

    References listed on IDEAS

    as
    1. E. Altman & A. Hordijk & F. M. Spieksma, 1997. "Contraction Conditions for Average and (alpha)-Discount Optimality in Countable State Markov Games with Unbounded Rewards," Mathematics of Operations Research, INFORMS, vol. 22(3), pages 588-618, August.
    2. Richard F. Serfozo, 1979. "Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes," Operations Research, INFORMS, vol. 27(3), pages 616-620, June.
    3. Rommert Dekker & Arie Hordijk, 1992. "Recurrence Conditions for Average and Blackwell Optimality in Denumerable State Markov Decision Chains," Mathematics of Operations Research, INFORMS, vol. 17(2), pages 271-289, May.
    4. H. Blok & F. M. Spieksma, 2017. "Structures of Optimal Policies in MDPs with Unbounded Jumps: The State of Our Art," International Series in Operations Research & Management Science, in: Richard J. Boucherie & Nico M. van Dijk (ed.), Markov Decision Processes in Practice, chapter 0, pages 131-186, Springer.
    5. R. Dekker & A. Hordijk & F. M. Spieksma, 1994. "On the Relation Between Recurrence and Ergodicity Properties in Denumerable Markov Decision Chains," Mathematics of Operations Research, INFORMS, vol. 19(3), pages 539-559, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nicole Leder & Bernd Heidergott & Arie Hordijk, 2010. "An Approximation Approach for the Deviation Matrix of Continuous-Time Markov Processes with Application to Markov Decision Theory," Operations Research, INFORMS, vol. 58(4-part-1), pages 918-932, August.
    2. Yu Zhang & Vidyadhar G. Kulkarni, 2017. "Two-day appointment scheduling with patient preferences and geometric arrivals," Queueing Systems: Theory and Applications, Springer, vol. 85(1), pages 173-209, February.
    3. Eugene A. Feinberg & Jefferson Huang, 2019. "On the reduction of total‐cost and average‐cost MDPs to discounted MDPs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(1), pages 38-56, February.
    4. Arnab Basu & Mrinal K. Ghosh, 2018. "Nonzero-Sum Risk-Sensitive Stochastic Games on a Countable State Space," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 516-532, May.
    5. S. Bhulai & H. Blok & F. M. Spieksma, 2022. "K competing queues with customer abandonment: optimality of a generalised $$c \mu $$ c μ -rule by the Smoothed Rate Truncation method," Annals of Operations Research, Springer, vol. 317(2), pages 387-416, October.
    6. F. M. Spieksma, 2016. "Kolmogorov forward equation and explosiveness in countable state Markov processes," Annals of Operations Research, Springer, vol. 241(1), pages 3-22, June.
    7. Xiuli Chao & Frank Y. Chen, 2005. "An Optimal Production and Shutdown Strategy when a Supplier Offers an Incentive Program," Manufacturing & Service Operations Management, INFORMS, vol. 7(2), pages 130-143, March.
    8. A. Jaśkiewicz & A. S. Nowak, 2006. "Approximation of Noncooperative Semi-Markov Games," Journal of Optimization Theory and Applications, Springer, vol. 131(1), pages 115-134, October.
    9. Bernd Heidergott & Arie Hordijk & Heinz Weisshaupt, 2006. "Measure-Valued Differentiation for Stationary Markov Chains," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 154-172, February.
    10. Dinard van der Laan, 2015. "Assigning Multiple Job Types to Parallel Specialized Servers," Tinbergen Institute Discussion Papers 15-102/III, Tinbergen Institute.
    11. Sergei V. Savin & Morris A. Cohen & Noah Gans & Ziv Katalan, 2005. "Capacity Management in Rental Businesses with Two Customer Bases," Operations Research, INFORMS, vol. 53(4), pages 617-631, August.
    12. Xufeng Yang & Juliang Zhang & Wen Jiao & Hong Yan, 2023. "Optimal Capacity Rationing Policy for a Container Leasing System with Multiple Kinds of Customers and Substitutable Containers," Management Science, INFORMS, vol. 69(3), pages 1468-1485, March.
    13. Jorge Alvarez-Mena & Onésimo Hernández-Lerma, 2006. "Existence of nash equilibria for constrained stochastic games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(2), pages 261-285, May.
    14. Han, Gain & Sohn, Keemin, 2016. "Activity imputation for trip-chains elicited from smart-card data using a continuous hidden Markov model," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 121-135.
    15. Xianping Guo & Yi Zhang, 2016. "Optimality of Mixed Policies for Average Continuous-Time Markov Decision Processes with Constraints," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1276-1296, November.
    16. Gregory Dobson & Hsiao-Hui Lee & Arvind Sainathan & Vera Tilson, 2012. "A Queueing Model to Evaluate the Impact of Patient "Batching" on Throughput and Flow Time in a Medical Teaching Facility," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 584-599, October.
    17. Yoon, Soovin & Albert, Laura A., 2020. "A dynamic ambulance routing model with multiple response," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    18. Tomás Prieto-Rumeau & Onésimo Hernández-Lerma, 2016. "Uniform ergodicity of continuous-time controlled Markov chains: A survey and new results," Annals of Operations Research, Springer, vol. 241(1), pages 249-293, June.
    19. Lode Li & Evan L. Porteus & Hongtao Zhang, 2001. "Optimal Operating Policies for Multiplant Stochastic Manufacturing Systems in a Changing Environment," Management Science, INFORMS, vol. 47(11), pages 1539-1551, November.
    20. Allahviranloo, Mahdieh & Recker, Will, 2013. "Daily activity pattern recognition by using support vector machines with multiple classes," Transportation Research Part B: Methodological, Elsevier, vol. 58(C), pages 16-43.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:65:y:2018:i:8:p:638-659. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.