..please, I need an accurate and correct solution

Eo genetie algorithms to solve the job scheduling problem, which can be defined as follows: by any resource) and are non-preemptive, which means that a job must be processed entirely by a single resource. 2. A set of m resources to process the submitted set of independent jobs. These resources are heterogeneots. 3. The ETC matrix of size nXm, where ETCli]lil represents the estimated time for executing joiz ion resource je The goal of job scheduling in grid computing is to find a mapping of the submitted jobs to the available the and can resources that minimizes the makespan, which itself represents the finishing time of the latest task and can be computed by: makespan=minsesmaxjes(Finishj) where S is the sef of all possible solutions, J is the set of all jobs submitted to the system and Finish J represents the fime when job j is finished