Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Memetic chicken swarm algorithm for job shop scheduling problem

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 9 No. 3 (2019)

DOI
10.11591/ijece.v9i3.pp2075-2082
ISSN
2088-8708, 2088-8708
Published
2019-06-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-nc/4.0

Abstract

This paper presents a Memetic Chicken swarm optimization (MeCSO) to solve job shop scheduling problem (JSSP). The aim is to find a better solution which minimizes the maximum of the completion time also called Makespan. In this paper, we adapt the chicken swarm algorithm which take into consideration the hierarchical order of chicken swarm while seeking for food. Moreover, we integrate 2-opt method to improve the movement of the rooster. The new algorithm is applied on some instances of ORLibrary. The empirical results show the forcefulness of MeCSO comparing to other metaheuristics from literature in term of run time and quality of solution.

Collaboration network of the authors

3 authors · 3 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Chouaib Doukkali University
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Memetic chicken swarm algorithm for job shop scheduling problem</dc:title><dc:creator>Semlali, Soukaina cherif bourki</dc:creator><dc:creator>Riffi, Mohammed Essaid</dc:creator><dc:creator>Chebihi, Fayçal</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;p&amp;gt;This paper presents a Memetic Chicken swarm optimization (MeCSO) to solve job shop scheduling problem (JSSP). The aim is to find a better solution which minimizes the maximum of the completion time also called Makespan. In this paper, we adapt the chicken swarm algorithm which take into consideration the hierarchical order of chicken swarm while seeking for food. Moreover, we integrate 2-opt method to improve the movement of the rooster. The new algorithm is applied on some instances of ORLibrary. The empirical results show the forcefulness of MeCSO comparing to other metaheuristics from literature in term of run time and quality of solution.&amp;lt;/p&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2019-06-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v9i3.pp2075-2082</dc:identifier><dc:identifier>10.11591/ijece.v9i3.pp2075-2082</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 9 No 3 (2019); 2075</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/14966/12872</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>