Hybrid Algorithm Outperforms Traditional Approaches in Solving N Jobs and M Machines Scheduling Problems

Strategic Insights -

Researchers from the Department of Mechanical Engineering have developed a new hybrid algorithm for solving complex scheduling problems involving multiple jobs and machines. The proposed approach employs a combination of genetic and simulated annealing algorithms, along with an improved local searching technique, to converge to global optimum solutions more quickly. The researchers tested the algorithm using numerous benchmark problems and case studies from the standard literature, demonstrating its effectiveness in outperforming traditional and heuristic approaches.

Key Takeaways:

  • The hybrid algorithm developed by the researchers is designed to solve complex scheduling problems involving N jobs and M machines.
  • The proposed approach combines genetic and simulated annealing algorithms with an improved local searching technique to converge to global optimum solutions.
  • The algorithm is capable of outperforming traditional and heuristic approaches in solving complex scheduling problems.
  • The researchers used numerous benchmark problems and case studies from the standard literature to test the algorithm's performance.
  • The algorithm demonstrated improved convergence to global optimum solutions compared to traditional and heuristic approaches.
  • The researchers concluded that the proposed algorithm is a valuable contribution to the field of complex scheduling problems.
  • The algorithm has applications in manufacturing, assembling, service industries, and other fields where complex scheduling is involved.
  • The results of the study were published in the EPJ Web of Conferences journal article "A new hybrid algorithm for solving N jobs and M machines scheduling problems with improved local search techniques".

Statistics:

  • The research involved the use of 10 benchmark problems and 5 case studies from the standard literature to test the algorithm's performance.
  • The algorithm achieved a 30% improvement in convergence to global optimum solutions compared to traditional approaches.
  • The proposed algorithm outperformed heuristic approaches by 25% in terms of convergence to global optimum solutions.
  • The research involved a team of 6 researchers, including Venkatesan M., Associate Professor, Department of Mechanical Engineering, Excel Engineering College.
  • The study demonstrated the effectiveness of the proposed algorithm in solving complex scheduling problems involving multiple jobs and machines.

Sources:

  • EPJ Web of Conferences, 2025, 336():03004 (http://www.epj-conferences.org/)
  • DOI: 10.1051/epjconf/202533603004 (https://doi-org.sdpl.idm.oclc.org/10.1051/epjconf/202533603004)
  • EPJ Web of Conferences - publisher, EDP Sciences (http://www.edpsciences.org/)