Artificial bee colony algorithm for solving multi-objective distributed fuzzy permutation flow shop problem
The distributed permutation flow shop scheduling (DPFSS) is a permutation flow shop
scheduling problem including the multi-factory environment. The processing times of the …
scheduling problem including the multi-factory environment. The processing times of the …
Çizelgeleme problemlerinin çözümünde hibrit biyocoğrafya tabanlı optimizasyon algoritmasının kullanımı
O Engin, A Özmete, S İpek… - Harran Üniversitesi …, 2023 - dergipark.org.tr
Biyocoğrafya Tabanlı Optimizasyon (BTO), habitat türlerinin göçünden esinlenerek
oluşturulan evrimsel bir algoritmadır. 2008 yılında Simon tarafından geliştirilen bu yöntem …
oluşturulan evrimsel bir algoritmadır. 2008 yılında Simon tarafından geliştirilen bu yöntem …
[PDF][PDF] List of references on evolutionary multiobjective optimization
CAC Coello - URL< http://www. lania. mx/~ ccoello/EMOO …, 2010 - delta.cs.cinvestav.mx
List of References on Evolutionary Multiobjective Optimization Page 1 List of References on
Evolutionary Multiobjective Optimization Carlos A. Coello Coello ccoello@cs.cinvestav.mx …
Evolutionary Multiobjective Optimization Carlos A. Coello Coello ccoello@cs.cinvestav.mx …
An efficient parallel greedy algorithm for fuzzy hybrid flow shop scheduling with setup time and lot size: a case study in apparel process
O Engin, M İşler - Journal of fuzzy extension and applications, 2022 - journal-fea.com
This paper deals with the Fuzzy Hybrid Flow Shop (FHFS) scheduling inspired by a real
apparel process. A Parallel Greedy (PG) algorithm is proposed to solve the FHFS problems …
apparel process. A Parallel Greedy (PG) algorithm is proposed to solve the FHFS problems …
A hybrid scatter search method for solving fuzzy no-wait flow-shop scheduling problems
The literature published since the year 2000 was reviewed regarding the no-wait flow-shop
scheduling (No-WFSS) problem. The No-WFSS problem with separate set-up times and …
scheduling (No-WFSS) problem. The No-WFSS problem with separate set-up times and …
[HTML][HTML] Bi-Objective, Dynamic, Multiprocessor Open-Shop Scheduling: A Hybrid Scatter Search–Tabu Search Approach
TF Abdelmaguid - Algorithms, 2024 - mdpi.com
This paper presents a novel, multi-objective scatter search algorithm (MOSS) for a bi-
objective, dynamic, multiprocessor open-shop scheduling problem (Bi-DMOSP). The …
objective, dynamic, multiprocessor open-shop scheduling problem (Bi-DMOSP). The …
Makine Çizelgeleme Problemlerinin Çözümünde Pekiştirmeli Öğrenme Etkisinin Analizi
B Sarıcan, O Engin - ALKÜ Fen Bilimleri Dergisi, 2024 - dergipark.org.tr
Pekiştirmeli öğrenme, günümüz dünyasında birçok gerçek hayat problemine çözüm
bulmada aktif bir şekilde kullanılmakta ve endüstri içerisinde de umut verici yöntemler …
bulmada aktif bir şekilde kullanılmakta ve endüstri içerisinde de umut verici yöntemler …
A fuzzy logic based methodology for multi-objective hybrid flow shop scheduling with multi-processor tasks problems and solving with an efficient genetic algorithm
In the conventional scheduling problem, the parameters such as the processing time for
each job and due dates are usually assumed to be known exactly, but in many real-world …
each job and due dates are usually assumed to be known exactly, but in many real-world …
Distributed fuzzy permutation flow shop scheduling problem: a bee colony algorithm
The distributed permutation flow shop scheduling problem is a subclass of the permutation
flow shop scheduling problem. Distributed scheduling adopts multi-factory with permutation …
flow shop scheduling problem. Distributed scheduling adopts multi-factory with permutation …
Solving Fuzzy Job Shop Scheduling Problems with Availability Constraints Using a Scatter Search Method.
In the last decade job shop scheduling problems have been subject to intensive research
due to their multiple applications. Job shop scheduling is known as a strongly NP-complete …
due to their multiple applications. Job shop scheduling is known as a strongly NP-complete …