Genetic Algorithm-Based Optimization for Scheduling Problems

Authors

  • Pritam Warke Assistant Professor, MCA Department Deccan Education Society’s, Navinchandra Mehata Institute of Technology and Development

DOI:

https://doi.org/10.53032/tvcr/2025.v7n2.46

Keywords:

Genetic Algorithms (GAs), Dynamic Scheduling, Hybrid AI Models, Adaptive Genetic Algorithms

Abstract

Scheduling problems are critical in various domains, including manufacturing, cloud computing, and transportation. Traditional scheduling techniques often struggle to achieve optimal solutions due to computational complexity. Genetic Algorithms (GAs), inspired by natural selection, offer an effective soft computing approach for optimizing scheduling problems. This paper explores how GAs can improve scheduling efficiency, discusses real-world applications, and identifies challenges in implementing GA-based scheduling. Future research directions in hybrid AI models and adaptive GAs for dynamic scheduling environments are also highlighted.

References

• Goldberg, D. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley.

• Holland, J. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.

• IEEE Transactions on Evolutionary Computation. (2023). Latest Advances in Genetic Algorithm Optimization.

• Springer Journal of Scheduling. (2023). Genetic Algorithm-Based Scheduling Approaches.

• Elsevier Journal on Cloud Computing. (2023). Genetic Algorithm Applications in Cloud Task Scheduling.

Downloads

Published

2025-04-30

How to Cite

Pritam Warke. (2025). Genetic Algorithm-Based Optimization for Scheduling Problems. The Voice of Creative Research, 7(2), 379–383. https://doi.org/10.53032/tvcr/2025.v7n2.46