Timetable problem In a parallel form

In this paper, I present a powerful hybrid genetic algorithm based around a heuristic timetabling. Parallel have been applied to a number of optimization problems with some success as well as the speedup attained from the parallel solution. Annealing is then applied to the timetabling problem. A parallel algorithm, can be implemented on a multiprocessor is presented. I present the results from applying the algorithm to a particularly difficult problem, and demonstrate the variety of possible timetables depending upon the requirements