This paper demonstrates an optimal control solution to change of machine set-up schedulmg based on dynamic programming average cost per stage value iteration as set forth by Cararnanis et. a!. [2] for the 2D case. The difficulty with the optimal approach lies in the explosive computational growth of the resulting solution. A method of reducing the… (More)

Development of a. Science Base for Planning and Scheduling Manufacturing Systems," Research S1tmmary for NSF/SMI grant No. DDM-89142111991

M. Ca.ramanis, A. Sharifnia, J. Hu, S. a.nd Gershwin

1991

1 Excerpt

Computational Neuroscience,

E. Schwartz

1990

1 Excerpt

Anal

D. J. White, J. Math

Appl., 6

1963

1 Excerpt

Adaptive Switching Circuits," IRE WESCON Conv

B. Widrow, M. Hoff

RecoTd, Part 4, 96-104, August

1960

1 Excerpt

Similar Papers

Loading similar papers…

Cite this paper

@inproceedings{Bradski1991DynamicPF,
title={Dynamic Programming for Optimal Control of Set-Up Scheduling with Neural Network Modifications},
author={Gary R. Bradski},
year={1991}
}