Job-shop scheduling is an important task for manufacturing industries. We are interested in the particular task of scheduling payload processing for NASA's space shuttle program. This paper summarizes our previous work on formulating this task for solution by the reinforcement learning algorithm T D(). A shortcoming of this previous work was its reliance on hand-engineered input features. This paper shows how to extend the time-delay neural network (TDNN) architecture to apply it to irregular-length schedules. Experimental tests show that this TDNN-TD() network can match the performance of our previous hand-engineered system. The tests also show that both neural network approaches signiicantly out-perform the best previous (non-learning) solution to this problem in terms of the quality of the resulting schedules and the number of search steps required to construct them.
[1]
Lawrence D. Jackel,et al.
Backpropagation Applied to Handwritten Zip Code Recognition
,
1989,
Neural Computation.
[2]
D. Pomerleau.
Eecient T Raining of Artiicial Neural Networks for Autonomous Navigation
,
1991
.
[3]
G. Tesauro.
Practical Issues in Temporal Difference Learning
,
1992
.
[4]
Monte Zweben,et al.
Scheduling and rescheduling with iterative repair
,
1993,
IEEE Trans. Syst. Man Cybern..
[5]
Wei Zhang,et al.
A Reinforcement Learning Approach to job-shop Scheduling
,
1995,
IJCAI.