Font Size: a A A

Priority-based Human-computer Interaction Universities Scheduling System

Posted on:2010-05-23Degree:MasterType:Thesis
Country:ChinaCandidate:C L HeFull Text:PDF
GTID:2208360275483839Subject:Software engineering
Abstract/Summary:PDF Full Text Request
Arranging school timetable is an important and complicated job in school management. It's core task is to arrange the suitable time and place for each class. By this way, classroom teaching can run orderly and designedly. Timetable problem is a multi-object optimization decision problem. And it is also a typical problem of combination-program. During the course of course arranging, massive data and many complex constrained conditions should be considered, so we hardly can get a reasonable result of course arranging in manual way. With the quick development of computer technique and the deepening of the high-education reform, how to use computer to assist course scheduling becomes an urgent problem. However, because of different management and resources occupation of each school, there is no universal course arranging system up to now. The thesis focuses on the design and realization of an automatic course arranging system based on the teaching practice of Yibin University.The main outcomes are as follows:1. It analyzes the present situation of courses scheduling in universities and common timetable algorithms.2. Basing on the teaching practice of Yibin University, it analyzes the demands of courses arrangement system. In the thesis, the system is composed of five modules. We hold detailed discussion on the design and realization of automatic course arranging.3. Priority algorithm is used in computer automatic arranging course module. With the question of which teaching-class first to be arranged, we gave priority to the following situations: the teaching-class with more of student or the teacher who has special request etc. In order to reduce the possibility of dead lock, we have done a series of processing such as establishment of batch series number, establishment of priority and establishment of time pattern. Retrospective algorithm is also used to solve the problem of dead lock.4. It designs a time model database and gives the idea of how to calculate the priority of time model. We choose the best time model for teaching-class to have class. In order to reduce the classroom deadlock, we always choose the classroom which capacity is only a little more than the population of students.5. In order to avoid all kinds of conflictions during automatic course arranging, we designed available time array for each teacher, classroom and major.6. In order to solve the dead lock which automatic course arranging module can not process, the system provides a manual course arranging module. It has a friendly interface and is easy to interactive with.7. For the users of teachers and students, the system provided online timetable query.
Keywords/Search Tags:course arranging, algorithm of arranging course, priority, time pattern
PDF Full Text Request
Related items