Bu öğeden alıntı yapmak, öğeye bağlanmak için bu tanımlayıcıyı kullanınız:
http://hdl.handle.net/11452/34617
Başlık: | A genetic algorithm for scheduling of jobs on lines of press machines |
Yazarlar: | Lirkov, I. Margenov, S. Wasniewski, J. Uludağ Üniversitesi/Mühendislik Mimarlık Fakültesi/Endüstri Mühendisliği Bölümü. 0000-0001-9201-6349 Özalp, Selma Ayşe G-1584-2018 I-9828-2018 6603978393 |
Anahtar kelimeler: | Computer science Parallel machines Scheduling Program processors Problem solving Mutagens Chromosomes Press machines Longest processing time (LPT) rule Chromosome evaluation Genetic algorithms |
Yayın Tarihi: | 2006 |
Yayıncı: | Springer |
Atıf: | Özalp, S. A. (2006). ''A genetic algorithm for scheduling of jobs on lines of press machines''. ed. İ. Lirkov, S. Margenov, J. Wasniewski. Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence, 3743, 535-543. |
Özet: | This paper introduces a Genetic Algorithm (GA) based solution technique for press machines scheduling problem of a car manufacturing factory. Firstly, the problem at hand, and the application of the CA in terms of coding, chromosome evaluation, crossover and Mutation operators, are described in detail. After that, the CA is experimentally evaluated through some test problems. As the objective of the problem is the minimization of the completion time of the jobs, the CA based solution is compared with the Longest Processing Time (LPT) rule, and it is observed that the CA always produces better schedules than the LPT rule in a reasonably short amount of CPU time. |
Açıklama: | Bu çalışma, 06-10, Haziran 2005 tarihlerinde Sozopol[Bulgaristan]’da düzenlenen 5. International Conference on Large-Scale Scientific Computing (LSSC 2005) Kongresi‘nde bildiri olarak sunulmuştur. |
URI: | https://doi.org/10.1007/11666806_61 https://link.springer.com/chapter/10.1007%2F11666806_61 http://hdl.handle.net/11452/34617 |
ISBN: | 3-540-31994-8 |
ISSN: | 0302-9743 |
Koleksiyonlarda Görünür: | Scopus Web of Science |
Bu öğenin dosyaları:
Bu öğeyle ilişkili dosya bulunmamaktadır.
DSpace'deki bütün öğeler, aksi belirtilmedikçe, tüm hakları saklı tutulmak şartıyla telif hakkı ile korunmaktadır.