I need an exact mathematical solution, not an explanation

Q3: Use genetic algorithms to solve the job scheduling problem in grid computing, which can be defined as follows: 1. A set of n jobs that have to be scheduled. These jobs are independent to each other (i.e., any job ean be processed 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 heterogeneous. 3. The ETC matrix of size am, where ETC[i][j] represents the estimated time for executing job i on resource j. The goal of job scheduling in grid computing is to find a mapping of the submitted jobs to the available resources that minimizes the makespan, which itself represents the finishing time of the latest task and can be computed by: where S is the set of all possible solutions, J is the set of all jobs sabmes represents the time when job j is finished