A genetic algorithm to minimize the makespan on two dedicated processors

The studied problem is to optimize a production system where these systems have two dedicated processors. The assignment of tasks to these processors is fixed. For this problem, we have three types of tasks. Some tasks must be processed only by the first processor, a few others by the second processor and the remaining tasks need simultaneously both processors. This NP-hard problem requires the use of well-adapted methods. We have studied the design of genetic algorithms which have been very successful in solving optimization problems. This can be justified by the quality of the solution obtained by such methods and the efficiency in terms of computation time.