Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Comparative Analysis of Metaheuristic Approaches for Makespan Minimization for No Wait Flow Shop Scheduling Problem

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 7 No. 1 (2017)

DOI
10.11591/ijece.v7i1.pp417-423
ISSN
2088-8708, 2088-8708
Published
2017-02-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-nc/4.0

Abstract

This paper provides comparative analysis of various metaheuristic approaches for m-machine no wait flow shop scheduling (NWFSS) problem with makespan as an optimality criterion. NWFSS problem is NP hard and brute force method unable to find the solutions so approximate solutions are found with metaheuristic algorithms. The objective is to find out the scheduling sequence of jobs to minimize total completion time. In order to meet the objective criterion, existing metaheuristic techniques viz. Tabu Search (TS), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are implemented for small and large sized problems and effectiveness of these techniques are measured with statistical metric.

Collaboration network of the authors

5 authors · 6 co-authorship links · 2 across different organisations

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

  • Koneru Lakshmaiah Education Foundation
  • Shivaji University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Abhay R. GotmareAffiliation unknown1
Gandharva ThiteAffiliation unknown1

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>Comparative Analysis of  Metaheuristic Approaches for Makespan Minimization for No Wait Flow Shop Scheduling Problem</dc:title><dc:creator>A. Bewoor, Laxmi</dc:creator><dc:creator>Chandra Prakash, V.</dc:creator><dc:creator>U. Sapkal, Sagar</dc:creator><dc:description>&lt;jats:p&gt;This paper provides comparative analysis of various metaheuristic approaches for m-machine no wait flow shop scheduling (NWFSS) problem with makespan as an optimality criterion. NWFSS problem is NP hard and brute force method unable to find the solutions so approximate solutions are found with metaheuristic algorithms. The objective is to find out the scheduling sequence of jobs to minimize total completion time. In order to meet the objective criterion, existing metaheuristic techniques viz. Tabu Search (TS), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are implemented for small and large sized problems and effectiveness of these techniques are measured with statistical metric.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2017-02-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.v7i1.pp417-423</dc:identifier><dc:identifier>10.11591/ijece.v7i1.pp417-423</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 7 No 1 (2017); 417</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/6295/6041</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>