Application of Hopfield Network for Solving Machine Loading Problem

In order to resolve the constrained optimization machine that loading problem, this is first transformed into an equivalent not constrained optimization problem by utilizing penalty function technique. The machine assignment's energy function is as given:

Here, APT is the average processing time A, B, C, and D are weighting parameters and all are positive.

The first term is the same to minimization of objective function and the second term is constraint to equalize the utilization of each of m machines. b_i in Eq (2) is replaced along with average processing time. The third term, that moves values of neurons toward zero or one that is to a vertex of the hypercube, is termed as a binary value constraint since it consumes minimum value while all the neurons consider the value zero or one. Final term ensures that merely one part is processed on one machine.