Timetable scheduling problem is a constraint satisfaction problem around scheduling resources. It can be a tedious and frustrating job due to the NP-hard nature of the problem. This repository contains an implementation of a solution to the problem using genetic algorithms in R.
The timetable satisfies the following conditions:
- All lectures should take place exactly once
- Group g can attend only one class at one time
- Instructor i can teach only one class at one time
- In room r only one class can be taught at one time
-
- Create
csvfiles for each of the following- Available time slots
- Available rooms
- Requirements of the form (Course, Professor, Room1, Room2, Slot1, Slot2) including the header (refer this)
- Create
-
- Modify the code in the method
mainby commenting and uncommenting the necessary lines to read input from the terminal
- Modify the code in the method