On the optimal solutions of the infinite-horizon linear sensor scheduling problem.
Wei ZhangMichael P. VitusJianghai HuAlessandro AbateClaire J. TomlinPublished in: CDC (2010)
Keyphrases
- infinite horizon
- scheduling problem
- optimal solution
- np hard
- optimal control
- finite horizon
- optimal policy
- long run
- dynamic programming
- stochastic demand
- production planning
- single machine
- single item
- markov decision processes
- tabu search
- lower bound
- flowshop
- branch and bound algorithm
- markov decision process
- lead time
- average cost
- linear programming
- state space
- partially observable
- fixed cost
- feasible solution
- inventory policy
- inventory control
- knapsack problem
- inventory models
- dec pomdps
- partially observable markov decision processes
- lot sizing
- learning algorithm
- linear program
- multistage
- upper bound
- objective function
- reinforcement learning