A Modified Elephant Herd Optimization Algorithm to Solve the Single Machine Scheduling Problems
M. K. Marichelvam1, M. Geetha2
1M. K. Marichelvam, Department of Mechanical Engineering, Mepco Schlenk Engineering College, Sivakasi (Tamil Nadu), India.
2M. Geetha, Department of Mathematics, Kamaraj College of Engineering & Technology, Virudhunagar (Tamil Nadu), India.
Manuscript received on 23 November 2019 | Revised Manuscript received on 17 December 2019 | Manuscript Published on 30 December 2019 | PP: 23-29 | Volume-9 Issue-1S4 December 2019 | Retrieval Number: A10801291S419/19©BEIESP | DOI: 10.35940/ijeat.A1080.1291S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: This study reports the single machine scheduling problem for finding the minimum the total weighted tardiness. As the problem is non-deterministic polynomial-time hard (NP-hard), the problem might not be answered by the exact solution techniques. Henceforth, different heuristics and meta-heuristics were recommended by different practitioners to tackle the problem. A modified elephant herd optimization algorithm (MEHOA) is investigated in the present work to solve the single machine total weighted tardiness scheduling problem (SMTWTSP). The performance of the anticipated approach is studied with the test instances available in the OR library. The outcomes are compared with several different algorithms offered in the literature and indicate the efficacy of the developed methodology.
Keywords: Scheduling, Modified Elephant Herd Optimization Algorithm (MEHOA), Single Machine, NP-Hard, Tardiness.
Scope of the Article: Machine Design