Open access
Journal
SINTA 1
Solving flexible job-shop scheduling problem using harmony search-based meerkat clan algorithm
IAES International Journal of Artificial Intelligence · Vol. 11 No. 2 (2022) · pp. 423–431
ISSN 2252-8938, 2089-4872
Published 2022-06-01
Publisher Institute of Advanced Engineering and Science
Language eng
Abstract
The classical job shop scheduling (JSS) problem can be extended by allowing processing of an operation by any machine from a given set. This type of scheduling is known as flexible job shop scheduling (FJSS) problem. It incorporates all the difficulties and complexities of its predecessor classical problem. However, it is more complex as it is required to determine the assignment of operations to the machine. Swarm intelligence techniques proved their effectiveness in solving a wide range of complex NP-Hard real world problems. One of these techniques is the meerkat clan algorithm (MCA) that has been successfully applied to various optimization problems. This paper presents a modified MCA for solving the FJSS problem. The modification is based on using harmony search (HS). The introduction of HS provides more exploitation and intensification. HS generates various solutions, which are provided to the MCA. As a result, the exploitation of the local optimum is increased, which in turn increases the convergence rate. The experimental results show that the improved method achieves higher quality schedules. Additionally, the convergence rate is speeded up compared with the standalone algorithm. This gives the proposed method the superiority over the original algorithm.
Collaboration network of the authors
14 authors ·
25 co-authorship links
· 20 across different organisations
Hover or tap a name to highlight its co-authors. Double-click to open the author's page.
Mustansiriyah University University of Technology - Iraq Baghdad College of Economic Sciences University University of Al Maarif University of Technology Imam Ja’afar Al-Sadiq University University of Diyala Other organisations Affiliation unknown
Different organisations
Same organisation
Affiliation unknown
Thicker line = more joint articles · bigger circle = more articles
Show as table
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.
Metadata source: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, first harvested 8 Nov 2026, last seen 16 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en-US">Solving flexible job-shop scheduling problem using harmony search-based meerkat clan algorithm</dc:title>
<dc:creator>Jawad, Muna Mohammed</dc:creator>
<dc:creator>Younis, Muhanad Tahrir</dc:creator>
<dc:creator>Sadiq, Ahmed T.</dc:creator>
<dc:subject xml:lang="en-US"></dc:subject>
<dc:subject xml:lang="en-US">flexible job shop scheduling problem; harmony search; meerkat clan algorithm</dc:subject>
<dc:description xml:lang="en-US">The classical job shop scheduling (JSS) problem can be extended by allowing processing of an operation by any machine from a given set. This type of scheduling is known as flexible job shop scheduling (FJSS) problem. It incorporates all the difficulties and complexities of its predecessor classical problem. However, it is more complex as it is required to determine the assignment of operations to the machine. Swarm intelligence techniques proved their effectiveness in solving a wide range of complex NP-Hard real world problems. One of these techniques is the meerkat clan algorithm (MCA) that has been successfully applied to various optimization problems. This paper presents a modified MCA for solving the FJSS problem. The modification is based on using harmony search (HS). The introduction of HS provides more exploitation and intensification. HS generates various solutions, which are provided to the MCA. As a result, the exploitation of the local optimum is increased, which in turn increases the convergence rate. The experimental results show that the improved method achieves higher quality schedules. Additionally, the convergence rate is speeded up compared with the standalone algorithm. This gives the proposed method the superiority over the original algorithm.</dc:description>
<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
<dc:contributor xml:lang="en-US"></dc:contributor>
<dc:date>2022-06-01</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:type xml:lang="en-US"></dc:type>
<dc:format>application/pdf</dc:format>
<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/21418</dc:identifier>
<dc:identifier>10.11591/ijai.v11.i2.pp423-431</dc:identifier>
<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 11, No 2: June 2022; 423-431</dc:source>
<dc:source>2252-8938</dc:source>
<dc:source>2089-4872</dc:source>
<dc:source>10.11591/ijai.v11.i2</dc:source>
<dc:language>eng</dc:language>
<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/21418/13346</dc:relation>
<dc:rights xml:lang="en-US">Copyright (c) 2021 Institute of Advanced Engineering and Science</dc:rights>
<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>
Citations and indexing
OpenAlex
Indexed
via DOI
4 citations
Crossref
Indexed
via DOI
2 citations
Counts as reported by each index on 13 Nov 2026; indexes count citations differently.
OpenAlex also lists this work in: crossref.
Cite this article
APA 7
Jawad, M. M., Younis, M. T., & Sadiq, A. T. (2022). Solving flexible job-shop scheduling problem using harmony search-based meerkat clan algorithm. IAES International Journal of Artificial Intelligence, 11(2), 423–431. https://doi.org/10.11591/ijai.v11.i2.pp423-431
Copy
IEEE
M. M. Jawad, M. T. Younis, and A. T. Sadiq, “Solving flexible job-shop scheduling problem using harmony search-based meerkat clan algorithm,” IAES International Journal of Artificial Intelligence, vol. 11, no. 2, pp. 423–431, 2022, doi: 10.11591/ijai.v11.i2.pp423-431.
Copy
Generated from the journal's metadata; check author names before use.