Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{183648,
        author = {ROSELIN ANTONY},
        title = {Heuristic and Metaheuristic Algorithms for solving Scheduling Problems},
        journal = {International Journal of Innovative Research in Technology},
        year = {2025},
        volume = {12},
        number = {3},
        pages = {2552-2565},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=183648},
        abstract = {The current work offers a comprehensive review of advancements in solving sequencing problems, which are critical optimization challenges across fields such as manufacturing, logistics, and healthcare. The evolution of solution methodologies starting with Johnson’s method proposed in 1954, is examined, from classical dispatching rules and exact algorithms like Branch and Bound to advanced heuristic and metaheuristic approaches. These approaches address various sequencing environments, including single machine, flow shop, job shop, and mixed shop settings. The review categorizes existing literature by problem type and solution technique. Promising research directions are identified, including integrating machine learning techniques, and exploring ways to bridge the gap between theoretical models and real-world applications.},
        keywords = {Flow shop problem, Idle time, sequencing problems, total elapsed time},
        month = {December},
        }