A Genetic Algorithm To Minimize Makespan and Number of Tardy Jobs In Parallel Machine Scheduling Problems

Yıl 2016, Cilt: 9 Sayı: 2, 147 - 0, 25.05.2016

Ural Gökay Çiçekli

Öz

This paper presents a genetic algorithm solution for parallel machine scheduling problems with a real factory case. Various genetic components and operators were examined to design a genetic algorithm for a parallel machine scheduling problem with an objective of minimizing makespan and the number of tardy jobs. A production schedule was optimized using a genetic algorithm and results were compared. The experimental results demonstrated that a genetic algorithm encoding method performed successfully to achieve a solution for parallel machine problems.

Anahtar Kelimeler

Genetic algorithm, Parallel machine scheduling; tardy jobs