A method of scheduling classes

Abstract

The present invention discloses a course scheduling method, which relates to the technical field of school course scheduling, and includes the following steps: Step 1, establishing a two-dimensional course scheduling matrix for each scheduled class based on the daily course time period of the entire school; Step 2, establishing a two-dimensional course scheduling configuration matrix for all courses based on the number of class days per week and the maximum number of classes per day. The course scheduling method provided by the present invention can meet the course scheduling needs of the new curriculum and new system, support the establishment of a separate course scheduling strategy for each course of each teacher, and can better meet the individual needs of teachers and the course scheduling needs of the school at the same time; at the same time, special configuration items are managed for equipment, which helps schools with limited sports equipment, scientific experimental equipment, etc. to better allocate teaching resources; equipment configuration can also be combined with configuration items such as venues and combined class teaching to support schools' special course scheduling needs such as "large classes", "experimental classes", and "grade-level teaching".

Description

Technical Field

[0001] The present invention relates to the technical field of school course scheduling, and in particular to a course scheduling method. Background Art

[0002] Every new semester, the dean of studies often worries about class scheduling. With the advancement of the times, education has entered an era of comprehensive development, focusing on moral, intellectual, physical, aesthetic, and labor. In addition to traditional courses such as Chinese, mathematics, English, music, physical education, art, and information technology, general courses such as classic recitation, morality and the rule of law, morality and society, and craftsmanship have been added, along with a series of school-based courses tailored to local cultural education.

[0003] The teaching methods of these new types of courses are different from traditional courses, and often require separate equipment, venues, and teachers during class.

[0004] Existing general scheduling methods are based on traditional curriculum scheduling, with teachers and classrooms as the primary factors. This method cannot meet the new demands brought about by the new curriculum and new system, such as combined classes, odd-week and even-week teaching, or after-school care. Summary of the Invention

[0005] The main purpose of the present invention is to provide a course scheduling method that can adapt to the new demands brought about by the new curriculum and new system.

[0006] The purpose of the present invention can be achieved by adopting the following technical solutions:

[0007] A method for arranging classes, comprising the following steps

[0008] Step 1: Create a two-dimensional schedule matrix for each class based on the daily course period of the entire school.

[0009]

[0010] Where d is the number of days of classes per week, t is the maximum number of classes per day, and ts is the number of courses per period;

[0011] Step 2: Create a two-dimensional scheduling matrix for all courses based on the number of weekly class days and the maximum number of daily class periods.

[0012]

[0013] In the Matrix Represents the set of configurations C and weights W established for the course;

[0014] CW is the executable course scheduling status of the current position, including five categories: required / recommended / not required / not recommended / prohibited. Among them, required and prohibited are strong types, covering other types and mutually exclusive;

[0015] Step 3: Verify the rationality of the course scheduling plan and check whether there are any unscheduled courses for each course;

[0016] If any course cannot meet the requirements of the course scheduling due to its own conditions or other course conditions, an explanation will be given for the inability to schedule the course and a prompt will be given to adjust the course scheduling plan;

[0017] Step 4: Calculate the value of all courses based on the weights set for the course scheduling configuration items and the number of contents configured for each course;

[0018] The specific value assessment method in step 4 is:

[0019] Calculate the difference between the feasible time slot for the course under the class schedule without the influence of other courses and the feasible time slot with the influence of other courses, and perform a graded calculation based on the difference and the weight of the subject to which the course belongs;

[0020] Establish a double-condition sequence table for all courses, prioritize courses with fewer available time slots and courses with higher subject weights, and schedule courses in accordance with the course scheduling requirements;

[0021] The calculation method for the feasible time period of the course in step 4 without the influence of other courses under the course scheduling plan is as follows:

[0022] The two-dimensional course scheduling configuration matrix course d×t Courseschedule with the current course schedule matrix d×t Do the superposition and calculate the number of time periods D that can be arranged in the superposition matrix.

[0023] course=[C i W i ] m×n coureschedule=[C i W i ] m×n

[0024] D ij =course ij +courseschedule ij ;

[0025] The calculation method for the feasible time period of the course under the class schedule in step 4, which is affected by other courses, is as follows:

[0026] The current course schedule matrix courseschedule d×t An array of courses S that may conflict with this course (courses in the same class, with the same teacher, at the same venue, with the same equipment, or in combined classes) n=[course i ]After superposition, it is combined with the two-dimensional course scheduling matrix course d×t Superposition, calculate the number of time periods d' that can be arranged in the superposition matrix,

[0027] course=[C i W i ] m×n ,courseschedule=[C i W i ] m×n ;

[0028]

[0029] Then the course priority is calculated based on the subject weight P.

[0030] R(i)=(D i -d i ')×P i ;

[0031] Prioritize classes according to the order of R(i);

[0032] Step 5. After each course is scheduled, the current schedule mirror is first recorded for later review. Then, for the remaining courses, it is calculated whether it is possible to complete the schedule. Then, a hierarchical calculation based on feasible time periods and subject weights is performed to find the next priority course and start scheduling until the scheduling is completed.

[0033] Preferably, the verification method in step 3 is specifically as follows:

[0034] Configure the two-dimensional schedule matrix for all classes d×t and the two-dimensional course scheduling matrix course d×t Overlay to generate the current course schedule matrix courseschedule d×t ,

[0035] For each position, determine whether at least one class can be arranged and whether there is a configuration where no two classes must be placed in that position.

[0036] Preferably, the course scheduling mirror in step 5 includes not only the course scheduling results of the current course scheduling, but also a sequence table of double conditions for all courses in the current course scheduling round, the latter of which is used to calculate the impact of unsuccessfully scheduled courses on other courses during retrospective calculation.

[0037] Preferably, the course scheduling method further includes the following steps:

[0038] When scheduling a single course, the course will be scheduled according to the priority of the configuration items and the course scheduling requirements;

[0039] After removing the required classes, the value weights of the remaining available time slots are calculated based on the priority requirements of other unscheduled courses. Based on the weight of the course itself, time slots that have less impact on other scheduled classes or that better meet the needs of the course are selected for random class scheduling.

[0040] Preferably, the steps for random class scheduling in the class scheduling method are as follows:

[0041] First, superimpose the current course schedule matrix courseschedule d×t The two-dimensional course configuration matrix of this course d×t , first configure the time periods of required and prohibited positions according to the priority, and the remaining time periods are not recommended according to W n -Recommended W p -No requirement for W n' The weighted order cumulative random domain, according to the random results, the result of this random class arrangement is obtained.

[0042] For each position, the time period is Where Pm represents the W of the period n 、W p 、W n' of and;

[0043] For all time

[0044] Then use the random function to get a random number from ScheduleTS, calculate the time period where the random number result is located, set the time period as the class schedule, and delete the interval from ScheduleTS and get a random number again until the class schedule is completed.

[0045] Preferably, in the step of randomly arranging classes:

[0046] If it is found that the course cannot be scheduled during the cyclic scheduling check, the conflicting course will be recorded in the conflicting time period, and the historical course mirror will be checked to see if there is a course that can replace the course in the unscheduled time period.

[0047] If yes, replace it and modify the image to continue scheduling.

[0048] If not, go back to the earliest mirror that caused the course conflict and calculate the courses with the greatest impact on the course value from the conflicting mirror to the current course mirror.

[0049] After setting the conflicting courses' weights for the conflicting time periods to low recommended weights, reschedule classes from the conflicting mirror locations until all courses are successfully scheduled.

[0050] Preferably, if the course scheduling process fails to complete the course scheduling within the specified number of times, the remaining courses each time that caused the course scheduling failure will be collected, and the course with the highest frequency will be found as the possible reason for the failure of the current course scheduling and submitted to the user to prompt him to adjust the course scheduling plan;

[0051] At the same time, the course mirror is queried to find out the courses whose priorities change significantly during the course scheduling process and are also submitted to the user as courses that may affect the course scheduling results.

[0052] Preferably, the course scheduling method further includes the following steps:

[0053] After the course scheduling is completed, the deviation between the course scheduling results and the requirements of all courses in the course scheduling plan is calculated, and the course scheduling quality of each course and the entire school courses is calculated based on the course weights.

[0054] Preferably, the method for calculating the deviation between the course scheduling result and the course demand of all courses in the course scheduling plan is as follows:

[0055] The two-dimensional course configuration matrix course for each class or teacher d×t Course matrix with course scheduling results courseschedule d×t Do a superposition calculation to calculate the proportion of satisfaction, and add the subject weight P as the factor of influence, calculate the deviation value and all the course scheduling results as the overall plan deviation O,

[0056] Beneficial technical effects of the present invention:

[0057] 1. The course scheduling method provided by the present invention can meet the course scheduling needs of the new curriculum and new system, and supports the establishment of a separate course scheduling strategy for each teacher's each course, which can better meet the individual needs of teachers and the course scheduling needs of the school at the same time;

[0058] At the same time, special configuration items are managed for equipment, which helps schools with limited sports equipment, scientific experimental equipment, etc. to better allocate teaching resources;

[0059] Equipment configuration can also be effective together with configuration items such as venue and combined class teaching to support the school's special scheduling needs such as "large classes", "experimental classes", and "grade teaching".

[0060] 2. The scheduling method provided by the present invention supports querying the list of teachers who need to be adjusted when the class needs to be adjusted after the class is scheduled. It also provides the priority of the teachers who can be adjusted (low priority will be given to those who may have consecutive classes with the same teacher, inconsistent teaching progress, or increased class time). This provides data support for the reasonable class adjustment and substitution of the Academic Affairs Office to avoid conflicts among teachers.

[0061] 3. In addition, after the class scheduling is completed, the class scheduling results and the matching degree of the class scheduling plan for each teacher and the overall school will be automatically calculated, which will help the Academic Affairs Office to better adjust the class scheduling plan and formulate a class scheduling plan that better meets the needs of teachers and teaching requirements. DETAILED DESCRIPTION

[0062] In order to make the technical solution of the present invention more clear and specific to those skilled in the art, the present invention is further described in detail below with reference to examples, but the embodiments of the present invention are not limited thereto.

[0063] In this embodiment, the course scheduling plan includes the following configuration options:

[0064] For a single course: required / recommended / not required / not recommended / prohibited scheduling time slots, combined classes, number of sessions, number of consecutive classes, and teachers (supports multiple teachers teaching the same course at the same time);

[0065] For a single subject: required / recommended / not required / not recommended / prohibited scheduling of class time, venue, equipment (number of items can be set), and weight;

[0066] For the same type of subjects (science, liberal arts, minor departments, mobile classrooms): required / recommended / not required / not recommended / prohibited to schedule class time, venue, equipment (number of items can be set);

[0067] For the entire school: class schedules for odd and even weeks, number of class days per week, daily class periods (morning reading, morning, afternoon, after-school care, evening self-study), public classes (class meetings, large breaks), and course scheduling requirements.

[0068] A method for arranging classes includes the following steps:

[0069] Step 1: Create a two-dimensional schedule matrix for each class based on the daily course period of the entire school.

[0070]

[0071] Where d is the number of days of classes per week, t is the maximum number of classes per day, and ts is the number of courses per period;

[0072] Step 2: Create a two-dimensional scheduling matrix for all courses based on the number of weekly class days and the maximum number of daily class periods.

[0073]

[0074] In the Matrix Represents the set of configurations C and weights W established for the course;

[0075] CW is the executable course scheduling status of the current position, including five categories: required / recommended / not required / not recommended / prohibited. Among them, required and prohibited are strong types, covering other types and mutually exclusive;

[0076] Step 3: Verify the rationality of the course scheduling plan and check whether there are any unscheduled courses for each course;

[0077] If any course cannot meet the requirements of the course scheduling due to its own conditions or other course conditions, an explanation will be given for the inability to schedule the course and a prompt will be given to adjust the course scheduling plan;

[0078] The verification method in step 3 is as follows:

[0079] Configure the two-dimensional schedule matrix for all classes d×t and the two-dimensional course scheduling matrix course d×t Overlay to generate the current course schedule matrix courseschedule d×t ,

[0080] For each position, determine whether at least one class can be arranged and whether no two classes must be placed in the position;

[0081] Step 4: Calculate the value of all courses based on the weights set for the course scheduling configuration items and the number of contents configured for each course;

[0082] The weight can be configured according to the needs of the school. For example, you can set Chinese to 1.3, English to 1, and Physical Education to 0.8. The coefficient will be multiplied in the subsequent grading calculation.

[0083] The content can be all the content configured in the previous steps, such as the configuration rules for each time period, teacher rules, and continuous class rules of the course;

[0084] The specific value assessment method in step 4 is:

[0085] Calculate the difference between the feasible time period of the course under the scheduling plan without the influence of other courses and the feasible time period with the influence of other courses. For example, a mathematics class without the influence of other courses supports 1-4 periods on Monday morning, but after calculating other courses, it can only be in the fourth period. The difference is the first three periods. The weight of the positions of these three periods will be considered in the actual scheduling. For example, the first period often has the highest weight. The above calculated difference and the weight of the subject to which the course belongs are used for grading calculation. After calculating the grade of all courses, they are classified according to the distribution of extreme differences. Courses with more extreme differences are considered to have fewer available time periods and are given priority. Grading is based on the product of the difference and the weight, which should be more accurately described as sorting.

[0086] Establish a two-condition sequence table for all courses, prioritize courses with fewer available time slots and courses with higher subject weights, prioritize courses according to course scheduling requirements (such as spreading classes as far as possible or connecting classes as much as possible), and calculate the product of the difference and weight to generate the sequence table;

[0087] For example, if physical education classes can only be scheduled for 3-4 classes in the afternoon, taking into account other course rules, they can only be scheduled on Tuesday or Thursday afternoons, which means that there are fewer available class times.

[0088] The calculation method for the feasible time period of the course in step 4 without the influence of other courses under the course scheduling plan is as follows:

[0089] The two-dimensional course scheduling configuration matrix course d×t Courseschedule with the current course timetable matrix d×t Do the superposition and calculate the number of time periods D that can be arranged in the superposition matrix.

[0090] course=[C i W i ] m×n ,courstschedule=[C i W i ] m×n

[0091] D ij =course ij +courseschedule ij ;

[0092] In this formula, m is the number of classes, n is the number of days, and the set is the actual time period of the daily class schedule. ij is the rule superposition. For example, for the third class on Tuesday morning, m = 3 and n = 2. Here, all courses are configured with i rules, each with its own weight j, which is used to calculate the conflict degree of each class time point.

[0093] The calculation method for the feasible time period of the course under the class schedule in step 4, which is affected by other courses, is as follows:

[0094] The current course schedule matrix courseschedule d×t An array of courses S that may conflict with this course (courses in the same class, with the same teacher, at the same venue, with the same equipment, or in combined classes) n =[course i ]After superposition, it is combined with the two-dimensional course scheduling matrix course d×t Superposition, calculate the number of time periods d' that can be arranged in the superposition matrix,

[0095] course=[C i Wi ] m×n ,courseschedule=[C i W i ] m×n ;

[0096]

[0097] Then the course priority is calculated based on the subject weight P.

[0098] R(i)=(D i -d' i )×P i ;

[0099] Prioritize classes according to the order of R(i);

[0100] Step 5: After each course is scheduled, the current course schedule is first recorded for future reference. The remaining courses are then calculated (repeating step 3) to determine if they are incomplete. A hierarchical calculation based on feasible time periods and subject weights is then performed to find the next priority course and start scheduling until the course schedule is complete.

[0101] The course scheduling mirror in step 5 contains not only the course scheduling results of the current course, but also the sequence table of the two conditions of all courses in the current course scheduling round. The latter is used to calculate the impact of unsuccessfully scheduled courses on other courses during retrospective calculation.

[0102] The course scheduling method also includes the following steps:

[0103] When scheduling a single course, the course is scheduled according to the priority of the established configuration items and the course scheduling requirements.

[0104] The course scheduling method also includes the following steps:

[0105] After removing the required classes, the value weights of the remaining available time slots are calculated based on the priority requirements of other unscheduled courses. Based on the weight of the course itself, time slots that have less impact on other scheduled classes or that better meet the needs of the course are selected for random class scheduling.

[0106] The course scheduling method also includes the following steps for random course scheduling:

[0107] First, superimpose the current course schedule matrix courseschedule d×t The two-dimensional course configuration matrix of this course d×t , first configure the time periods of required and prohibited positions according to the priority, and the remaining time periods are not recommended according to W n -Recommended W p -No requirement for W n'The weighted order cumulative random domain, according to the random results, the result of this random class arrangement is obtained.

[0108] For each position, the time period is Where Pm represents the W of the period n 、W p 、W n' of and;

[0109] For all time

[0110] Then use the random function to get a random number from ScheduleTS, calculate the time interval where the random number result is, set the time interval as the class schedule, and delete the interval from ScheduleTS to get a random number again until the class schedule is completed;

[0111] In the steps of random class scheduling:

[0112] If it is found that the course cannot be scheduled during the cyclic scheduling check, the conflicting course will be recorded in the conflicting time period, and the historical course mirror will be checked to see if there is a course that can replace the course in the unscheduled time period.

[0113] If yes, replace it and modify the image to continue scheduling.

[0114] If not, go back to the earliest mirror that caused the course conflict and calculate the courses with the greatest impact on the course value from the conflicting mirror to the current course mirror.

[0115] After setting the conflicting courses' weights for the conflicting time periods to low recommended weights, reschedule classes from the conflicting mirror locations until all courses are successfully scheduled.

[0116] If the course scheduling process fails to complete the course scheduling within the specified number of times, the remaining courses will be collected each time that the course scheduling failed. The course with the highest frequency will be found as the possible reason for the failure of the course scheduling and submitted to the user to prompt him to adjust the course scheduling plan.

[0117] At the same time, we query the course mirror to find courses whose priorities have changed significantly during the scheduling process and submit them to the user as courses that may affect the scheduling results. For example, after the first PE class is scheduled, the second PE class taught by the same teacher has a lot less available class hours, which is a significant change.

[0118] The course scheduling method includes the following steps:

[0119] After the class scheduling is completed, the deviation between the class scheduling result and the requirements of all courses in the class scheduling plan is calculated. The class scheduling quality of each course and the entire school is calculated based on the course weight. If the user is not satisfied with the class scheduling, the class scheduling weight and random time period rules can be automatically adjusted to reschedule the class.

[0120] The specific method for calculating the course scheduling results and the deviation of all course demand in the course scheduling plan is as follows:

[0121] The two-dimensional course configuration matrix course for each class or teacher d×t Course matrix with course scheduling results courseschedule d×t Do a superposition calculation to calculate the proportion of satisfaction, and add the subject weight P as the factor of influence, calculate the deviation value and all the course scheduling results as the overall plan deviation O,

[0122] Basic scheduling principles do not need to be entered as they are already recorded in the system, including synchronizing the course progress of teachers in multiple classes, giving priority to offering key courses every day, and making the teaching time of the same teacher as continuous as possible on a single day.

[0123] If you have set up odd-week and even-week courses, you can indicate the courses that will be replaced by odd-week and even-week courses when scheduling. When scheduling, the courses will be scheduled separately for the odd-week and even-week tasks, generating an odd-week timetable and a two-week timetable.

[0124] To sum up, in this embodiment, the scheduling method provided in this embodiment can meet the scheduling needs of the new curriculum and new system, support the establishment of a separate scheduling strategy for each course of each teacher, and can better meet the personal needs of teachers and the scheduling needs of the school at the same time; at the same time, special configuration items are managed for equipment, which helps schools with limited sports equipment, scientific experimental equipment, etc. to better allocate teaching resources; equipment configuration can also be effective together with configuration items such as venues and combined class teaching, supporting the school's special scheduling needs such as "large classes", "experimental classes", and "grade teaching".

[0125] The above is only a further embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any technician familiar with the technical field can make equivalent replacements or changes based on the technical solutions and concepts of the present invention within the scope disclosed by the present invention, which fall within the scope of protection of the present invention.

Claims

1. A course scheduling method, characterized by: The following steps are included Step 1: Create a two-dimensional schedule matrix for each class based on the daily course period of the entire school. Where d is the number of days of classes per week, t is the maximum number of classes per day, and ts is the number of courses per period; Step 2: Create a two-dimensional scheduling matrix for all courses based on the number of weekly class days and the maximum number of daily class periods. In the Matrix Represents the set of configurations C and weights W established for the course; CW is the executable course scheduling status of the current location, including five categories: required / recommended / not required / not recommended / prohibited. Among them, required and prohibited are strong types, covering other types and mutually exclusive; Step 3: Verify the rationality of the course scheduling plan and check whether there are any unscheduled courses for each course; If any course cannot meet the requirements of the course scheduling requirements due to its own conditions or other course conditions, an explanation will be given for the inability to schedule the course and a prompt will be given to adjust the course scheduling plan; Step 4: Calculate the value of all courses based on the weights set for the course scheduling configuration items and the number of contents configured for each course; The specific value assessment method in step 4 is: Calculate the difference between the feasible time slot for the course under the class schedule without the influence of other courses and the feasible time slot with the influence of other courses, and perform a graded calculation based on the difference and the weight of the subject to which the course belongs; Establish a double-condition sequence table for all courses, prioritize courses with fewer available time slots and courses with higher subject weights, and schedule courses in accordance with the course scheduling requirements; The calculation method for the feasible time period of the course in step 4 without the influence of other courses under the course scheduling plan is as follows: The two-dimensional course scheduling configuration matrix course d×t Courseschedule with the current course timetable matrix d×t Do the superposition and calculate the number of time periods D that can be arranged in the superposition matrix. The calculation method for the feasible time period of the course under the class schedule in step 4, which is affected by other courses, is as follows: The current course schedule matrix courseschedule d×t An array of courses in the same class, with the same teacher, at the same venue, with the same equipment, or in combined classes that may conflict with this course. n =[course i ]After superposition, it is combined with the two-dimensional course scheduling matrix course d×t Superposition, calculate the number of time periods d' that can be arranged in the superposition matrix, course=[C i W i ] m×n ,courseschedule=[C i W i ] m×n ; Then the course priority is calculated based on the subject weight P. R(i)=(D i -d i ')×P i ; Prioritize classes according to the order of R(i); Step 5. After each course is scheduled, the current schedule mirror is first recorded for later review. Then, for the remaining courses, it is calculated whether it is possible to complete the schedule. Then, a hierarchical calculation based on feasible time periods and subject weights is performed to find the next priority course and start scheduling until the scheduling is completed.

2. The course scheduling method according to claim 1, wherein: The verification method in step 3 is as follows: Configure the two-dimensional schedule matrix for all classes d×t and the two-dimensional course scheduling matrix course d×t Overlay to generate the current course schedule matrix courseschedule d×t , For each position, determine whether at least one class can be arranged and whether there is a configuration where no two classes must be placed in that position.

3. The course scheduling method according to claim 1, wherein: The course scheduling mirror in step 5 not only includes the course scheduling results of the current course scheduling, but also includes the sequence table of the two conditions of all courses in the current course scheduling round. The latter is used to calculate the impact of unsuccessfully scheduled courses on other courses during retrospective calculation.

4. The course scheduling method according to claim 1, wherein: The course scheduling method also includes the following steps: When scheduling a single course, the course will be scheduled according to the priority of the configuration items and the course scheduling requirements; After removing the required classes, the value weights of the remaining available time slots are calculated based on the priority requirements of other unscheduled courses. Based on the weight of the course itself, time slots that have less impact on other scheduled classes or that better meet the needs of the course are selected for random class scheduling.

5. The course scheduling method according to claim 4, characterized in that: The steps for random scheduling in the scheduling method are as follows: First, superimpose the current course schedule matrix courseschedule d×t The two-dimensional course scheduling matrix of this course d×t , first configure the time periods of required and prohibited positions according to the priority, and the remaining time periods are not recommended according to W n -Recommended W p -No requirement for W n' The weighted order cumulative random domain, according to the random results, the result of this random class arrangement is obtained. For each position, the time period is Where Pm represents the W of the period n 、W p 、W n' of and; For all time Then use the random function to get a random number from ScheduleTS, calculate the time period where the random number result is located, set the time period as the class schedule, and delete the interval from ScheduleTS and get a random number again until the class schedule is completed.

6. The course scheduling method according to claim 4, characterized in that: In the steps of random class scheduling: If it is found that the course cannot be scheduled during the cyclic scheduling check, the conflicting course will be recorded in the conflicting time period, and the historical course mirror will be checked to see if there is a course that can replace the course in the unscheduled time period. If yes, replace it and modify the image to continue scheduling. If not, go back to the earliest mirror that caused the course conflict and calculate the courses with the greatest impact on the course value from the conflicting mirror to the current course mirror. After setting the conflicting courses' weights for the conflicting time periods to low recommended weights, reschedule classes from the conflicting mirror locations until all courses are successfully scheduled.

7. The course scheduling method according to any one of claims 1 to 6, characterized in that: If the course scheduling process fails to complete the course scheduling within the specified number of times, the remaining courses will be collected each time that the course scheduling failed. The course with the highest frequency will be found as the possible reason for the failure of the course scheduling and submitted to the user to prompt him to adjust the course scheduling plan. At the same time, the course mirror is queried to find out the courses whose priorities change significantly during the course scheduling process and are also submitted to the user as courses that may affect the course scheduling results.

8. The course scheduling method according to claim 1, wherein: The course scheduling method also includes the following steps: After the course scheduling is completed, the deviation between the course scheduling results and the requirements of all courses in the course scheduling plan is calculated, and the course scheduling quality of each course and the entire school courses is calculated based on the course weights.

9. The course scheduling method according to claim 1, wherein: The specific method for calculating the course scheduling results and the deviation of all course demand in the course scheduling plan is as follows: The two-dimensional course configuration matrix course for each class or teacher d×t Course matrix with course scheduling results courseschedule d×t Do a superposition calculation to calculate the proportion of satisfaction, and add the subject weight P as the factor of influence, calculate the deviation value and all the course scheduling results as the overall plan deviation O,

Images