gravitational search algorithm, each searching factor
should be contain information for solving problems. This information
says that for example each factor in any time might be aware that in
each point of searching space, which operation is implementing on
which machine. According to problem definition, we could consider
Table 2 because it shows that each operation is implementable on
a set of machines. But in any time, only one job is implemented on
each machine, and then next operation should be implemented.
With due consideration, it can be observed that Table 2 is similar
to the N-minister problem table which shows that each column has
just one minister (one job for each machine). The only difference is
that in new table maybe several jobs are implemented on each
machine