Journal of Japan Industrial Management Association
Online ISSN : 2432-9983
Print ISSN : 0386-4812
Scheduling for Minimizing the Total Actual Flow Time with Preceding Relations by Neural Networks
Akio YAMAMOTOIkuo ARIZONOHiroshi OHTA
Author information
JOURNAL FREE ACCESS

1992 Volume 43 Issue 5 Pages 334-340

Details
Abstract
In the previous paper, we attempted to solve the scheduling problem for minimizing the total actual flow time by using a stochastic neural network model, and confirmed applicability of the neural network model for this problem. In this paper we propose a method for using the neural network model for a sampling scheme. Furthermore, we apply this method to solve the scheduling problem for minimizing the total actual flow time with direct and indirect preceding relations.
Content from these authors
© 1992 Japan Industrial Management Association
Previous article Next article
feedback
Top