Abstract
AbstractConstrained Markov decision process (CMDP) is a methodology that has not seen wide applications in the literature, but is a more natural specification for modeling preferences in modern service systems. In this paper we present a general framework for solving two‐class CMDPs. In particular, we show that CMDPs can be solved by using the Lagrangian dual to specify a particular unconstrained problem. If an appropriate Lagrange multiplier can be discerned, structural results can be exploited to solve the original CMDP with the appropriate structure. We show that for two queues in parallel or two queues in series, the framework leads to simple threshold‐like optimal policies. The results in each case are used to develop heuristics for analogous problems with abandonments with applications to health care, call centers, and manufacturing systems. The efficacy of the heuristics is verified in each case via a detailed numerical study.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
