Composing approximated algorithms based on Hopfield neural network for building a resource-bounded scheduler

in previous work, we have studied the Hopfield Artificial Neural Network model and its use for solving a particular scheduling problem: non pre-emptive tasks with release times, deadlines and computation times to be scheduled on several uniform machines. We presented an iterative approach based on Hopfield Networks which enables resource-bounded reasoning. We have validated our approach on a great number of randomly generated examples. Results are better than an efficient scheduling heuristics when no timing constraint exists and our system is able to adapt its behavior when timing constraints are imposed by the application. In this paper we extend this work by studying the incidence of two kinds of approximations on the processing time and on the success rate, so as to decide what sequence of activations for the contract will be likely to give the best success rate.