Bu öğeden alıntı yapmak, öğeye bağlanmak için bu tanımlayıcıyı kullanınız:
http://hdl.handle.net/11452/28312
Başlık: | Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends |
Yazarlar: | Yenisey, Mehmet Mutlu Uludağ Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü. 0000-0002-4532-344X 0000-0003-1744-3062 Yağmahan, Betül J-2416-2015 B-5557-2017 23487445600 |
Anahtar kelimeler: | Flow shop Scheduling Multi-objective Literature review Research directions Ant colony optimization Genetic local search Particle swarm optimization Minimize makespan Maximum tardiness Bound approach N-job Algorithm Bicriteria 2-machine Business & economics Operations research & management science |
Yayın Tarihi: | Haz-2014 |
Yayıncı: | Pergamon-Elsevier |
Atıf: | Yenisey, M. M. ve Yağmahan, B. (2014). "Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends". Omega (United Kingdom), 45, 119-135. |
Özet: | The flow shop scheduling problem is finding a sequence given n jobs with same order at m machines according to certain performance measure(s). 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, many real-world scheduling problems are multi-objective by nature. Over the years there have been several approaches used to deal with the multi-objective flow shop scheduling problems (MOFSP). Hence, in this study, we provide a brief literature review of the contributions to MOFSP and identify areas of opportunity for future research. |
URI: | https://doi.org/10.1016/j.omega.2013.07.004 https://www.sciencedirect.com/science/article/pii/S0305048313000832 http://hdl.handle.net/11452/28312 |
ISSN: | 0305-0483 |
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.