IDENTICAL PARALLEL MACHINES SCHEDULING USING GENETIC ALGORITHM

• Published in: The Iraqi journal for mechanical and materials engineering. Vol. 18; no. 2; pp. 321 - 330
• Main Author: Haleel, Aseel J
• Format: Journal Article
• Language: Arabic; English
• Published: University of Babylon, Iraq Babil Engineering Collage 04-08-2018
• Subjects: Genetic algorithm; Job schedule; Makespan; Parallel machine; Setup time
• DOI: 10.32852/iqjfmme.Vol18.Iss2.96
• EISSN: 2313-3783
• ISSN: 1819-2076

Minimizing the scheduling production time consider one of the most important factors forcompanies which their objectives is achieve the maximum profits. This paper studies theidentical parallel machine scheduling problem which involves the assignment numbers ofjob (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 largesize of “parallel machine scheduling” problem with an excessive jobs and machines, sothe genetic algorithm was proposed in this paper which is consider an efficient algorithmthat fits larger size of identical “parallel machine scheduling” for minimizing themakespan. Most studies in the scheduling field suppose setup time is insignificant orincluded in the processing time, in this paper both the sequence independent setup timesand processing time were considered. The solutions of algorithms are coding in(MATLAB). A numerical example of (11) jobs are schedule on (3) machines todemonstrative the effectiveness of algorithm solution. The result show the algorithm caneffectively solve large size of scheduling problem and given the best schedule withminimum makespan.