Enhanced dynamic programming algorithms for series line optimization

Author

Veatch, Michael H.

Author_Institution

Dept. of Math., Gordon Coll., Wenham, MA, USA

Volume

51

Issue

1

fYear

2006

Firstpage

159

Lastpage

164

Abstract

Dynamic programming value iteration is made more efficient on a five-machine unreliable series line by characterizing the transient and "insensitive" states. Holding costs are minimized subject to a service level constraint in a make-to-stock system with backordering. State-space truncations are chosen by checking the recurrent class in previous runs. An approximate model is developed that reduces the number of machine states. Monotone control theory is used to restrict the search for a control switching surface. Numerical optimal policies are compared with the heuristic control point policy and several characteristics of optimal policies are identified.

Keywords

dynamic programming; optimal control; optimisation; production control; state-space methods; dynamic programming algorithm; five-machine unreliable series line; make-to-stock system; monotone control theory; production line; series line optimization; state-space truncations; Computer networks; Control systems; Control theory; Costs; Dynamic programming; Heuristic algorithms; Optimal control; Production; State-space methods; Traffic control; Control point policy; dynamic programming; make-to-stock; production line;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/TAC.2005.861693

Filename

1576870