A Genetic Algorithm to Minimize Makespan and Number of Tardy Jobs in Parallel Machine Scheduling Problems

Küçük Resim Yok

Tarih

2016

Yazarlar

Ural Gökay Çiçekli

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Erişim Hakkı

info:eu-repo/semantics/openAccess

Özet

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

Açıklama

Anahtar Kelimeler

Bilgisayar Bilimleri, Bilgi Sistemleri

Kaynak

Bilişim Teknolojileri Dergisi

WoS Q Değeri

Scopus Q Değeri

Cilt

9

Sayı

2

Künye