Identical parallel machines scheduling using genetic algorithm

Abstract EN

Minimizing the scheduling production time consider one of the most important factors for companies which their objectives is achieve the maximum profits.

This paper studies the identical parallel machine scheduling problem which involves the assignment numbers of job (N) to set of identical parallel machine (M) in order to minimize the makespan (maximum completion time of all job).

There are numerous troubles in solving the large size of “parallel machine scheduling” problem with an excessive jobs and machines, so the genetic algorithm was proposed in this paper which is consider an efficient algorithm that fits larger size of identical “parallel machine scheduling” for minimizing the makespan.

Most studies in the scheduling field suppose setup time is insignificant or included in the processing time, in this paper both the sequence independent setup times and processing time were considered.

The solutions of algorithms are coding in (MATLAB).

A numerical example of (11) jobs are schedule on (3) machines to demonstrative the effectiveness of algorithm solution.

The result show the algorithm can effectively solve large size of scheduling problem and given the best schedule with minimum makespan