research centers


Search results: Found 2

Listing 1 - 2 of 2
Sort by

Article
Solving Job Scheduling Problem Using Fireworks Algorithm

Authors: Rehab Hassan --- Jamal N. Hasoon
Journal: Journal of Al-Qadisiyah for Computer Science and Mathematics مجلة القادسية لعلوم الحاسوب والرياضيات ISSN: 20740204 / 25213504 Year: 2019 Volume: 11 Issue: 2 Pages: Comp Page 1-8
Publisher: Al-Qadisiyah University جامعة القادسية

Loading...
Loading...
Abstract

Scheduling is critical part in most creation frameworks and information processing as sequencing of tasks or jobs framework executed on a grouping of processors. One of the NP-hard problem is “Job Shop Scheduling Problem”. In this work, a method of optimization proposed called “Fireworks Algorithm”. The solutions divided into fireworks and each one applied sparks to find the best solution. For some selected spark applied Gaussian mutation to find enhanced solution and find optimum solution. FWA tested on dataset to improve performance and it do well with respect to some other algorithm like Meerkat Clan Algorithm (MCA), Camel Herds Algorithm) CHA (, and Cukoo Search Algorithm (CSA).


Article
Solving Flexible Job Shop Scheduling Problem Using Meerkat Clan Algorithm

Authors: Ahmed T. Sadiq Al-Obaidi --- Hasanen S. Abdullah --- Zied O. Ahmed
Journal: Iraqi Journal of Science المجلة العراقية للعلوم ISSN: 00672904/23121637 Year: 2018 Volume: 59 Issue: 2A Pages: 754-761
Publisher: Baghdad University جامعة بغداد

Loading...
Loading...
Abstract

Meerkat Clan Algorithm (MCA) that is a swarm intelligence algorithm resulting from watchful observation of the Meerkat (Suricata suricatta) in the Kalahari Desert in southern Africa. Meerkat has some behaviour. Sentry, foraging, and baby-sitter are the behaviour used to build this algorithm through dividing the solution sets into two sets, all the operations are performed on the foraging set. The sentry presents the best solution. The Flexible Job Shop Scheduling Problem (FJSSP) is vital in the two fields of generation administration and combinatorial advancement. In any case, it is very hard to accomplish an ideal answer for this problem with customary streamlining approaches attributable to the high computational unpredictability. Most scheduling problem are mind boggling combinatorial problem and exceptionally hard to settle. The experimental result that compare with Cuckoo Search algorithm, Artificial Fish Search Algorithm, and Camel Herd Algorithm show that the MCA can find optimal solution because it provides a good strategy.

Listing 1 - 2 of 2
Sort by
Narrow your search

Resource type

article (2)


Language

English (2)


Year
From To Submit

2019 (1)

2018 (1)