Country not found in response Rate the Article: Enhancing Evolutionary Solver Efficiency for NP-Hard Single Machine Scheduling Problems, IJSR, Call for Papers, Online Journal
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 3 | Views: 341 | Weekly Hits: ⮙1 | Monthly Hits: ⮙2

Research Paper | Industrial Engineering | Saudi Arabia | Volume 12 Issue 11, November 2023 | Rating: 4.8 / 10


Enhancing Evolutionary Solver Efficiency for NP-Hard Single Machine Scheduling Problems

Mohammed Al-Romema, Mohammed A. Makarem


Abstract: The study explores the optimization of evolutionary solver parameters for minimizing total tardiness in single machine scheduling, an NP-hard problem with zero ready times included. It investigates various parameter combinations, including population sizes, mutation rates, and a constant convergence rate, both above and below default values. The aim is to enhance the solver's effectiveness in addressing this complex challenge. The findings contribute to improving scheduling efficiency in manufacturing and operations management contexts.


Keywords: Total Tardiness, Np Hard, Single Machine, Scheduling, Evolutionary Solver Parameters


Edition: Volume 12 Issue 11, November 2023,


Pages: 2015 - 2025



Rate this Article


Select Rating (Lowest: 1, Highest: 10)

5

Your Comments (Only high quality comments will be accepted.)

Characters: 0

Your Full Name:


Your Valid Email Address:


Verification Code will appear in 2 Seconds ... Wait

Top