Creating the search space for a timetabling problem
 

I plan to develop a timetabling software for student class schedules. To do this, I intend to use a local search algorithm. What could be the most efficient way to implement the search space? Should I represent each schedule as a solution?