The Design And Implementation Of Computer Room Schedule Algorithm With Redundancy

Course scheduling is always a very important work of college teaching affairs management.In recent years,due to the rapid development of information technology,computer has begun to penetrate into various courses in university.So how to use the computer laboratory,improve the utilization rate of computer room,has become the focus of computer laboratory arrangement of curriculum schedule.Arrangement of computer laboratory and traditional classroom curriculum schedule are significantly different.Because computer is such a highly sophisticated equipment,in the arrangement of curriculum schedule,the factor of failure rate must be considered and a certain amount of spare computers are prepared to ensure each students have machines available.When the number of students is remarkable,factors in addition to redundancy,but also the size of the experimental room,time synchronization of theory courses of various natural classes,the balance number of people in each machine room effected teaching efficiency are needed to be considered.In the existing design of the lesson,mostly are for ordinary classroom,without considering the laboratory equipment redundancy scenarios.With the expansion of college enrollment,the need to use the computer experiment course becomes more and more popular,the algorithm for course scheduling of such room required redundant amount has more important theoretical value and practical significance.In this paper,according to the situation and problems of room on the schedule arrangement,we analyzed and summarized the essential requirements of room course scheduling process.In order to meet the need of algorithm design,we gives the concept of relevant requirements the mathematical description,such as machine redundancy in computer room,failure rate of computer room,difference etc.In order to efficiently obtain room course scheduling scheme,network flow theory of graph theory,fuzzy clustering analysis and fuzzy evaluation method are comprehensive used for designing algorithm of course scheduling.The specific process is as follows:Firstly,according to the demand and the number of courses,course arrangement is divided into several layers.In every layer,using the network flow models obtained all the possible courses which meet the needs of each layer.And then use the fuzzy clustering method to classify the courses.Most representative plan of each class is selected to enter thenext layer.After all layer traversal is completed,calculate of the evaluation function value of redundancy and other evaluation index using the fuzzy comprehensive evaluation method.When the evaluation function value to meet the requirements,income schemes are considered the approximate optimal course scheduling scheme.Otherwise one supreme layer is backtracked to reselect a scheme of other classes.But if all similar schemes in a layer are not completed to acquire optimal scheme,continuing to backtrack supreme layer to re select the other class.Taken Harbin Engineering University 2012 linear algebra classes schedule as the experimental object,realized the automatic generation of computer classes schedule,and the resulting solution was compared with the original manual Course Scheduling scheme.The results showed that,compared with the original course scheduling scheme,the evaluation function values of the course scheduling generated from the algorithm was significantly higher.