Bu öğeden alıntı yapmak, öğeye bağlanmak için bu tanımlayıcıyı kullanınız: http://hdl.handle.net/11452/22517
Başlık: Ant colony optimization for multi-objective flow shop scheduling problem
Yazarlar: Yenisey, Mehmet Mutlu
Uludağ Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü.
0000-0002-4532-344X
Yağmahan, Betül
J-2416-2015
23487445600
Anahtar kelimeler: Flow shop
Scheduling
Multi-objective
Ant colony optimization
M-machine
N-job
Algorithm
Search
System
Computational efficiency
Problem solving
Optimization
Algorithms
Computer science
Engineering
Yayın Tarihi: Nis-2008
Yayıncı: Pergamon-Elsevier Science
Atıf: Yağmahan, B. ve Yenisey, M.M. (2008). ''Ant colony optimization for multi-objective flow shop scheduling problem''. Computers & Industrial Engineering, 54(3), 411-420.
Özet: Flow shop scheduling problem consists of scheduling given jobs with same order at all machines. The job can be processed on at most one machine; meanwhile one machine can process at most one job. The most common objective for this problem is makespan. However, multi-objective approach for scheduling to reduce the total scheduling cost is important. Hence, in this study, we consider the flow shop scheduling problem with multi-objectives of makespan, total flow time and total machine idle time. Ant colony optimization (ACO) algorithm is proposed to solve this problem which is known as NP-hard type. The proposed algorithm is compared with solution performance obtained by the existing multi-objective heuristics. As a result, computational results show that proposed algorithm is more effective and better than other methods compared.
URI: https://doi.org/10.1016/j.cie.2007.08.003
https://www.sciencedirect.com/science/article/pii/S0360835207001933
http://hdl.handle.net/11452/22517
ISSN: 0360-8352
1879-0550
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.