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

Ö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.

Bilişim Teknolojileri Dergisi-Cover
  • ISSN: 1307-9697
  • Yayın Aralığı: Yılda 4 Sayı
  • Başlangıç: 2008
  • Yayıncı: Gazi Üniversitesi Bilişim Enstitüsü