Method for high-efficiency class grouping and course scheduling in multi-restraint condition

A multi-constraint and class division technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problems of generating timetables, large space consumption and time waste of genetic algorithm scheduling, so as to facilitate statistics and view , reduce artificial effects

Inactive Publication Date: 2011-10-19
贾永鑫
View PDF3 Cites 17 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The genetic algorithm is applied to the problem of scheduling courses, which is to gradually approach the set goal. First, the courses are arranged in the schedule according to the initial conditions. Class space consumption is large, especially after randomly generating a lot of timetables and checking according to the conditions, those that do not meet the conditions are discarded, and the remaining ones are randomly modified by imitating genetics to form many new sub-timetables, and those that do not meet the conditions are abandoned until the task is completed; other Simulating natural selection and genetics, that is, survival of the fittest and survival of the fittest, does not actively generate curriculum according to conditions, and there is a certain degree of blindness, which will inevitably lead to a lot of waste of time

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for high-efficiency class grouping and course scheduling in multi-restraint condition
  • Method for high-efficiency class grouping and course scheduling in multi-restraint condition
  • Method for high-efficiency class grouping and course scheduling in multi-restraint condition

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0034] When using the present invention to divide and arrange classes, such as figure 1 , figure 2 , image 3 , Figure 4 Said, a method for efficiently dividing and arranging classes under multiple constraints includes the following steps:

[0035] (1) Assignment: formulate and publish the semester course list, which is the module table in the database, and set the venue range, weekly class hours and allowable course schedule for each course, corresponding to the corresponding table in the database, for each student Allocate 100 points for the total power of selecting teachers, and students will give scores to each teacher when selecting courses;

[0036] (2) Class classification: Statistics on student selection information, that is, the student classification table, and classify according to the following regulations: a. Students with the same class selection in the same administrative class should be divided into one teaching class as much as possible, while taking into account...

example 2

[0042] The method of the present invention is used to carry out tests under different conditions and the same steps. The test steps are the same as those described in Example 1. The tests and results are shown in Table 1.

[0043] Table I

[0044]

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a method for class grouping and course scheduling by using a computer in schools, and specifically relates to a method for high-efficiency class grouping and course scheduling in a multi-restraint condition. The invention aims to overcome the technical shortcomings in the prior art so as to provide a space-saving and time-saving method to purposely, positively, promptly and reasonably complete the class grouping and course scheduling in a multi-restraint condition. For achieving the target, the technical scheme provided by the invention comprises such four steps as assignment, class grouping, conversion and course scheduling. The method has the advantage of largely reducing the time needed by class grouping and course scheduling, thus having a good time flexibility. In particular, when handling multiple students and classes, the method has more advantages of greatly improving the work efficiency, reducing the manpower, facilitating the workload statistics on teachers and students and curricula-variable trend of students and facilitating check on timetables of teacher and student, thus brining convenience for interim class adjustments. In addition, the method can be used to schedule examinations.

Description

Technical field [0001] The invention relates to a method for schools to classify and arrange classes by using computers, in particular to a method for efficiently classifying and arranging classes under multiple constraints. Background technique [0002] In 1975, S. Even et al. demonstrated that the curriculum problem is NP-complete. Since the timetable problem involves more information, and the time complexity of solving the optimal solution of the timetable problem is exponential in the scale of the timetable, the algorithm for finding the approximate optimal solution is generally used. In real life, people generally only want an approximate optimal solution that satisfies various conditions, or a satisfactory solution, not necessarily the optimal solution. Therefore, for the curriculum problem, the key is not how to find the optimal solution, but how to improve the satisfaction of the solution. [0003] The most worrying problem of traditional manual scheduling is the occurren...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F19/00G06F9/44
Inventor 贾永鑫祁秀花
Owner 贾永鑫
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap