Optimal Control of Birth and Death Processes and Queues,

1977 ◽  
Author(s):  
Richard F. Serfozo
Keyword(s):  
Optimal Control ◽  
Birth And Death Processes

Optimal control of random walks, birth and death processes, and queues

1981 ◽  
Vol 13 (01) ◽  
pp. 61-83 ◽  
Author(s):  
Richard Serfozo
Keyword(s):  
Optimal Control ◽  
Random Walks ◽  
Queue Length ◽  
Transition Probabilities ◽  
Transition Rates ◽  
Average Reward ◽  
Birth And Death Processes ◽  
Optimal Policies ◽  
One Step ◽  
Increasing Functions

This is a study of simple random walks, birth and death processes, and M/M/s queues that have transition probabilities and rates that are sequentially controlled at jump times of the processes. Each control action yields a one-step reward depending on the chosen probabilities or transition rates and the state of the process. The aim is to find control policies that maximize the total discounted or average reward. Conditions are given for these processes to have certain natural monotone optimal policies. Under such a policy for the M/M/s queue, for example, the service and arrival rates are non-decreasing and non-increasing functions, respectively, of the queue length. Properties of these policies and a linear program for computing them are also discussed.

Optimal control of random walks, birth and death processes, and queues

1981 ◽  
Vol 13 (1) ◽  
pp. 61-83 ◽  
Author(s):  
Richard Serfozo
Keyword(s):  
Optimal Control ◽  
Random Walks ◽  
Queue Length ◽  
Transition Probabilities ◽  
Transition Rates ◽  
Average Reward ◽  
Birth And Death Processes ◽  
Optimal Policies ◽  
One Step ◽  
Increasing Functions

This is a study of simple random walks, birth and death processes, and M/M/s queues that have transition probabilities and rates that are sequentially controlled at jump times of the processes. Each control action yields a one-step reward depending on the chosen probabilities or transition rates and the state of the process. The aim is to find control policies that maximize the total discounted or average reward. Conditions are given for these processes to have certain natural monotone optimal policies. Under such a policy for the M/M/s queue, for example, the service and arrival rates are non-decreasing and non-increasing functions, respectively, of the queue length. Properties of these policies and a linear program for computing them are also discussed.

Sign in / Sign up

Export Citation Format

Share Document