A Genetic Algorithm To Minimize Makespan and Number of Tardy Jobs In Parallel Machine Scheduling Problems
Makaleler > Tam Makale · 2016
Yazarlar: Ural Gökay ÇİÇEKLİ
\n Volume: 9, Issue: 2\n \n, Uluslararası, 2016, cilt 9, ss 147-
DOI: 10.17671/btd.99806
Özet
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.