Effective Scheduling Satisfying user Constraints using Genetic Algorithm
Scheduling consists of a broad class of problems and time table generation is one of them. Being a hard problem, many have tried to tackle the problem and have come up with almost optimal and efficient techniques to solve scheduling problems like Greedy, Heuristic, Evolutionary, etc. Being an NP-hard problem, A single technique is not enough to achieve efficiency, therefore a combination of two or more can be applied for optimize the procedure. In this research, we went through a number of ways others had tried for solving the problem and then finally implemented an algorithm for effective Timetable Generation using an Evolutionary Algorithm with a Greedy Approach, then implementing a real-world working web application, flexible enough to generate timetable for school and universities.
Authors
- Sumit Mishra (ORCID: https://orcid.org/0000-0002-8367-0135)
- Urvashi Sugandh (ORCID: https://orcid.org/0000-0003-3053-2721)
- Navdeep Singh (ORCID: https://orcid.org/0000-0003-0643-4558)
- Tara Chandra Joshi
Institutions
- Lovely Professional University (IN)
- Galgotias University (IN)
Publication Details
- Published
- 2025-04-04
- DOI
- https://doi.org/10.1109/iccsai64074.2025.11063732
- Primary Topic
- Scheduling and Timetabling Solutions
- Type
- article
- Field-Weighted Citation Impact
- 0.00