Bu öğeden alıntı yapmak, öğeye bağlanmak için bu tanımlayıcıyı kullanınız: http://hdl.handle.net/11452/22480
Başlık: A multi-objective ant colony system algorithm for flow shop scheduling problem
Yazarlar: Yenisey, Mehmet Mutlu
Uludağ Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü.
0000-0003-1744-3062
Yağmahan, Betül
B-5557-2017
23487445600
Anahtar kelimeler: Flow shop scheduling
Multi-objective
Makespan
Flowtime
Heuristics
Ant colony optimization
Tabu search algorithm
Optimization algorithm
Genetic algorithms
M-machine
Minimize
Makespan
Time
Computer science
Engineering
Operations research & management science
Computational complexity
Computational efficiency
Heuristic methods
Machine shop practice
Multiobjective optimization
Scheduling algorithms
Ant-colony optimization
Flow-shop scheduling
Flow-time
Multi objective
Problem solving
Yayın Tarihi: Mar-2010
Yayıncı: Pergamon-Elsevier Science
Atıf: Yağmahan, B. ve Yenisey, M. M. (2010). "A multi-objective ant colony system algorithm for flow shop scheduling problem". Expert Systems with Applications, 378(2), 1361-1368.
Özet: In this paper, we consider the flow shop scheduling problem with respect to the both objectives of makespan and total flowtime. This problem is known to be NP-hard type in literature Several algorithms have been proposed to solve this problem We present a multi-objective ant colony system algorithm (MOACSA). which combines ant colony optimization approach and a local search strategy in order to solve this scheduling problem. The proposed algorithm is tested with well-known problems in literature Its solution performance was compared with the existing multi-objective heuristics. The Computational results show that proposed algorithm is more efficient and better than other methods compared.
URI: https://doi.org/10.1016/j.eswa.2009.06.105
https://www.sciencedirect.com/science/article/pii/S0957417409006605
http://hdl.handle.net/11452/22480
ISSN: 0957-4174
1873-6793
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.