Course Optimizing And Grading Of Institutions Of Higher Learning

Among institutions of higher learning, because its heavy scale, more subjects , more courses , higher proportion between teachers and students , urgent school building resources , close connection characteristic between courses, and so on, makes teaching dispatcher work, namely implementation of teaching plan and management, becomes one very complicated and careful work, more outstanding with the establishment work of the curriculum particularly. In recent years, because of the amalgamation between universities, the enlargement of the students scale of the university, and such factors as constant specializing of subjects, makes the contention of teaching resources in short constantly, so how to grade one reasonable, effective curriculum, becomes one very meaningful research.Timetabling is also called the scheduling problem. Timetabling is to solve the conflict between time and space resource on the premise of meeting various kinds of demands and restrictions. This is a multifactor optimization decision question, and it is a typical problem in combinatorial optimization. In the middle period of the seventies, S.Even etc. issued the article of" On the Complexity of Timetable and Multiconndity Flow Problems " in SIAMJ.COMPUTE, proved that timetabling is a NP-complete problem for the first time, arranged the problem of timetabling to theorize. A lot of people later tried many kinds of method to solve it. But because of the much information involved in timetabling, and the time-complexity to get the optimal solution of timetabling is the index magnitude of the scale of timetabling, so for the problem of timetabling of certain scale, the ones that were generally adopted are the algorithms that got the better solutions.In timetabling problem, such these five factors of restricting as classes, teachers, class periods, courses and classrooms are involved. The process of solving timetabling problem is to find one suitable teacher and time-classroom group for each course. When arranging it, conflicts are forbidden, at the same time we should try our best to meet the general knowledge of experience. In the book of J.A.Bondy's ' Graph theorywith applications ', the situation when there is only two restrain factors of teachers and classes were discussed, and it was solved using the coloring theory. In this paper, we will discuss the situation when there is three restrain factors of teachers, classes and classrooms. We set up a model of a special three-parted graph (no line between some two parts), and popularize the matching of bipartite to the independent typical path group of the special three-parted graph, then solve the timetabling model that we set up.This paper is divided into three chapters altogether. The main content of every chapter is as follows:Chapter one is the foreword. We introduced the research background, development overview and current research situation of timetabling problem.Chapter two is the set up and solving for the model. Because a lot of factors of restricting are involved in timetabling problem, in chapter two; we first explained that timetabling problem can be sum up in relation issue among teachers, classes and classrooms. The we set up a model of a special three-parted graph, and popularize the matching of bipartite to the independent typical path group of the special three-parted graph, then solve the timetabling model that we set up.Chapter three is the algorithm and an example. At first according to the identification of upper chapter, we designed an algorithm to solve the timetabling problem. Then we demonstrated the course of the algorithm with a simple example.