-As institutes get larger in size and complexity, administrators face the problem of timetabling for their respective staff. The growing number of constraints involved due to expansion of the activities, make it difficult to produce a simple hand written timetable for the smooth running of a given institute. While a perfect solution is often not tractable, there are many techniques available to find optimal solutions to such problems. Among them, genetic algorithms (GA) seem to play a key role in many instances. A considerable amount of GA work has been carried out involving two parent populations. The present work which takes a multi-parent approach to the problem, seems to address the timetabling problem effectively.