Time-Sharing Policies for Controlled Markov Chains

DOI10.1287/OPRE.41.6.1116MaRDI QIDQ4285168zbMATH OpenOpenAlexFDO

Authors Adam Shwartz, Eitan Altman

Publication date 13 March 1994

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/9190896cda511fe39fc9d75a968fc506726c0ded

zbMATH Keywords

compact action spaceconstrained optimizationcontrolled Markov chainscountable state spacenonstationary policiespolicy time sharing

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Recommendations

• Action time sharing policies for ergodic control of Markov chains
• Optimality of Piecewise-Constant Policies in Semi-Markov Decision Chains
• Optimal priority assignment: a time sharing approach
• A time aggregation approach to Markov decision processes
• Constrained Discounted Dynamic Programming

Cited in

(5)

• Optimal balanced control for call centers
• Action time sharing policies for ergodic control of Markov chains
• Steering policies for controlled Markov chains under a recurrence condition
• A genetic algorithm for finding good balanced sequences in a customer assignment problem with no state information
• Bicriterion Optimization of an M/G/1 Queue with A Removable Server

This page was built for publication: Time-Sharing Policies for Controlled Markov Chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285168)