EN
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.
Anahtar Kelimeler
Ayrıntılar
Birincil Dil
Türkçe
Konular
-
Bölüm
-
Yazarlar
Yayımlanma Tarihi
25 Mayıs 2016
Gönderilme Tarihi
17 Aralık 2015
Kabul Tarihi
-
Yayımlandığı Sayı
Yıl 2016 Cilt: 9 Sayı: 2
APA
Çiçekli, U. G. (2016). A Genetic Algorithm To Minimize Makespan and Number of Tardy Jobs In Parallel Machine Scheduling Problems. Bilişim Teknolojileri Dergisi, 9(2), 147. https://izlik.org/JA86AE47UK
AMA
1.Çiçekli UG. A Genetic Algorithm To Minimize Makespan and Number of Tardy Jobs In Parallel Machine Scheduling Problems. Bilişim Teknolojileri Dergisi. 2016;9(2):147. https://izlik.org/JA86AE47UK
Chicago
Çiçekli, Ural Gökay. 2016. “A Genetic Algorithm To Minimize Makespan and Number of Tardy Jobs In Parallel Machine Scheduling Problems”. Bilişim Teknolojileri Dergisi 9 (2): 147. https://izlik.org/JA86AE47UK.
EndNote
Çiçekli UG (01 Haziran 2016) A Genetic Algorithm To Minimize Makespan and Number of Tardy Jobs In Parallel Machine Scheduling Problems. Bilişim Teknolojileri Dergisi 9 2 147.
IEEE
[1]U. G. Çiçekli, “A Genetic Algorithm To Minimize Makespan and Number of Tardy Jobs In Parallel Machine Scheduling Problems”, Bilişim Teknolojileri Dergisi, c. 9, sy 2, s. 147, Haz. 2016, [çevrimiçi]. Erişim adresi: https://izlik.org/JA86AE47UK
ISNAD
Çiçekli, Ural Gökay. “A Genetic Algorithm To Minimize Makespan and Number of Tardy Jobs In Parallel Machine Scheduling Problems”. Bilişim Teknolojileri Dergisi 9/2 (01 Haziran 2016): 147. https://izlik.org/JA86AE47UK.
JAMA
1.Çiçekli UG. A Genetic Algorithm To Minimize Makespan and Number of Tardy Jobs In Parallel Machine Scheduling Problems. Bilişim Teknolojileri Dergisi. 2016;9:147.
MLA
Çiçekli, Ural Gökay. “A Genetic Algorithm To Minimize Makespan and Number of Tardy Jobs In Parallel Machine Scheduling Problems”. Bilişim Teknolojileri Dergisi, c. 9, sy 2, Haziran 2016, s. 147, https://izlik.org/JA86AE47UK.
Vancouver
1.Ural Gökay Çiçekli. A Genetic Algorithm To Minimize Makespan and Number of Tardy Jobs In Parallel Machine Scheduling Problems. Bilişim Teknolojileri Dergisi [Internet]. 01 Haziran 2016;9(2):147. Erişim adresi: https://izlik.org/JA86AE47UK