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

Authors : Ural Gökay ÇİÇEKLİ

Pages : 147-0

View : 39 | Download : 12

Publication Date : 2016-05-25

Article Type : Other Papers

Abstract :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.
Keywords : Genetic algorithm, Parallel machine scheduling, tardy jobs

ORIGINAL ARTICLE URL