Representation
This is very important step for enhancing the CLONALG since this influences all its subsequent steps. A candidate solution is shown by one string. Such type of string can be represented by regular or usual binary coding or integer coding. Suppose that, hereby, integer coding along with dynamic array. The string length is not explained at the initial stage. The length of string is remained dynamic to take care of each constraint. All string shows the set of rules that are applied in the earlier scheduling periods. In all strings, each bit shows the dynamic dispatching rule. The dimension of all string depends upon the number of dispatching rules.
In the problem, the dynamic dispatching rules such are considered as consideration, are seven. For illustration, let the rules are R1, R2, R3, R4, R5, R6, R7. Thus the string is shown as [R4 R3 R1 R2 R7 R5 R6]. Rests of the steps continue as explained above.
An AIS-CLONALG based heuristic is utilized to finding the best scheduling rule for next scheduling period. In this resolved instances two goals are achieved. First to represent that the chosen system attributes are more efficient for generalization and second to represent that utilizing the selected attributes can offer the better result than while all the system attributes are consider. Hence here two types of heuristics are employed for achieving both of the goals.