Comparing with DMSCRO, TMSCRO applies constrained earliest finish time algorithm to data pretreatment to take the advantage of the super molecule and constrained critical paths , which is, as heuristic information, for accelerating convergence.
If task [v.sub.i] is mapped to the processor [p.sub.j] with nonpreemptive processing approach, the earliest finish time of task [v.sub.i], [T.sub.EFTime]([v.sub.j], [p.sub.j]), is formulated as
The time frames of each task in each individual, such as Earliest Start Time, Earliest Finish Time, and so on, can be changed to adjust those of its successive tasks.
Therefore, Earliest Finish Time (EFT) of the task vi is calculated as:
(11) end (12) end (13) Compute the earliest finish time by (5).
EST([t.sub.i],[r.sub.j]) and EFT([t.sub.i],[r.sub.j]) are the earliest start time and earliest finish time of a task [t.sub.i] on the resource [r.sub.j] and are defined by
Before computing earliest finish time of a task [t.sub.i], all the immediate predecessor tasks of tt must have been scheduled.