الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 32 |  |  |
| | | from | 32 | | |
Abstract
Timetabling problem is a special case of the overall scheduling problems. The learning institutions such as schools and universities are using timetables for the purpose of scheduling of quotas and academic lectures. Universities in particular must deal with a large number of subjects. That is the appropriate schedules appointments learning institution does not fit, but they are very expensive in terms of loss of time and money and human effort.Considerations could be given to the process of scheduling appointments as a search for good solutions in a certain space of possible timetables process. So formulated liquefied schedule appointments either Search Problem in which case the search for a table to achieve all restrictions or Optimization Problem and here requires a schedule that meets all the difficult constraints and reduces the excesses of flexible restrictions. The thesis proposes to address the problem of scheduling dates of university courses through the use of cat swarm optimization Algorithm, where lies the strength of this algorithm in the ease of dealing with the possibility of random types of restrictions and targets, and so the algorithm is characterized by simplicity and flexibility and speed, making it compete with other algorithms in this area and especially in dealing with the restrictions required by the scheduling undergraduate courses process. For the purpose of ascertaining the efficiency of the proposed system, it was tested on a set of tables of the Department of Mathematics at the University of Mansoura, and the system has proven its efficiency in dealing with the restrictions required for the completion of the scheduling process.