Adaptive scheduling utilizing a neural network structure

Adaptive scheduling for flexible manufacturing systems using a neural network structure is described. Adaptive scheduling consists of three parts: features representation of the job orders and the factory environment, a set of fixed scheduling algorithms, and an algorithm selector. The statistics on orders is represented by a small number of feature parameters. Each of the algorithms included in the algorithm set is most suitable for a specific set of orders and factory status, but no single algorithm is best under all conditions. The algorithm selector chooses one of the algorithms to optimize some scheduling performance measure, for given values of the feature parameters. To illustrate the performance of the adaptive scheduling process, 10,000 different order cases were taken from uniformly distributed data. For the simulation, the algorithm selector was implemented using a backpropagation neural network structure. The results of the computer experiments demonstrated the superiority of adaptive scheduling over all of the seven fixed scheduling strategies.<<ETX>>

[1]  Pitu B. Mirchandani,et al.  Concurrent routing, sequencing, and setups for a two-machine flexible manufacturing cell , 1988, IEEE J. Robotics Autom..

[2]  Elsayed A. Elsayed,et al.  Job shop scheduling with alternative machines , 1990 .

[3]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

[4]  Changshui Zhang,et al.  Solving job-shop scheduling problem with priority using neural network , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[5]  Ali S. Kiran,et al.  Simulation studies in job shop sheduling—I a survey , 1984 .

[6]  Larry R. Taube,et al.  Time completion for various dispatching rules in job shops , 1983 .

[7]  Pius J. Egbelu,et al.  Route selection and flow control in a multi-stage manufacturing system with heterogeneous machines within stages , 1990 .

[8]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

[9]  Alessandro Agnetis,et al.  Part routing in flexible assembly systems , 1990, IEEE Trans. Robotics Autom..

[10]  Andrew Kusiak.  Aggregate scheduling of a flexible machining and assembly system , 1989, IEEE Trans. Robotics Autom..

[11]  Milton L. Smith,et al.  Simulation studies in job shop scheduling—II: Performance of priority rules , 1984 .

[12]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[13]  P. Werbos,et al.  Beyond Regression : "New Tools for Prediction and Analysis in the Behavioral Sciences , 1974 .