CN112288178A - Intelligent shift distributing method - Google Patents
Intelligent shift distributing method Download PDFInfo
- Publication number
- CN112288178A CN112288178A CN202011221224.7A CN202011221224A CN112288178A CN 112288178 A CN112288178 A CN 112288178A CN 202011221224 A CN202011221224 A CN 202011221224A CN 112288178 A CN112288178 A CN 112288178A
- Authority
- CN
- China
- Prior art keywords
- class
- groups
- student
- students
- days
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/20—Education
- G06Q50/205—Education administration or guidance
Abstract
The invention provides an intelligent shift distributing method, which comprises the following steps of S1: counting student data, wherein the student data comprises class time and the number of people corresponding to the class time; s2: calculating the total number of students, S3: setting the minimum number and the maximum number of people in the shift; s4: establishing a class time array according to the class time of students, establishing student groups and establishing class groups; s5: constructing an array associated with the number of days in class and the number of class time arrays, and arranging according to the number of days and the number of people to generate a global non-class-division grouping pool; s6: obtaining student groups from a global group pool which is not divided according to the same or overlapping principle of the days in class; s7: putting the student groups obtained from the global non-group pool into class groups; s8: adding the class groups into a class group list; s9: grouping the rest students in the global non-class group pool group into class groups, and adding the class groups into a class group list; s10: all class groups are output.
Description
Technical Field
The invention relates to a shift distribution method, in particular to an intelligent shift distribution method.
Background
With the continuous development of custodial education, more and more students report custodial shifts, but because custodial courses of each student are different, the arrangement scheme of the custodial student shifts is greatly increased, and according to the setting of the number of custodial shifts, a teacher needs to be configured for management.
Disclosure of Invention
The invention provides an intelligent work-dividing method, which takes the principle that students in the same grade are divided into one work class, and students with the same or overlapped class time are divided into one work class, and realizes the optimal work-dividing solution aiming at saving teachers and reducing the number of managed work-starting days.
The invention provides an intelligent shift distributing method, which comprises the following steps of S1: counting student data, wherein the student data comprises class time and the number of people corresponding to the class time; s2: calculating the total number of students, S3: setting the minimum number and the maximum number of people in the shift; s4: establishing a class time array according to class times of students, and establishing student groups: { number of students, time of class array }, construct class group: { student number, student grouping array }; s5: constructing an array (the number of days in class and the array of the time in class) associated with the number of days in class, and arranging the array according to the number of days and the number of people to generate a global non-class grouping pool;
s6: obtaining student groups from a global group pool which is not divided according to the same or overlapping principle of the days in class;
s7: putting the student groups obtained from the global non-group pool into class groups;
s8: adding the class groups into a class group list;
s9: grouping the rest students in the global non-class group pool group into class groups, and adding the class groups into a class group list;
s10: all class groups are output.
Preferably, the step S6 includes the steps of, S61: acquiring a list of all days in class; s62: taking out the current days i from the list of the days in class in sequence; s63: taking out the class time array from the class time array according to the current class days i in sequence; s64: matching all class time array subsets of the current class time array from the global non-group pool; s65: and outputting the student groups.
Preferably, S65 further includes the following step, S641: when the number of students corresponding to all the class time array subsets does not meet the minimum number of the class-dividing students, the students are not output to the student group; s642: when the number of students corresponding to all the class time array subsets meets the minimum number of the class divisions, putting the student groups corresponding to the class time array subsets into class groups in sequence until the number of the class groups is met; s643: the remaining student groupings are placed back into the global unpartitioned group pool in order of days in class, and the student groupings that have been placed into class groupings are removed from the global unpartitioned group pool.
Preferably, step S642 is specifically as follows: and calculating the maximum shift number and the minimum shift number according to the minimum shift number and the maximum shift number, and performing shift according to the maximum shift number when the maximum shift number is the same as the minimum shift number.
Preferably, step S62 further includes the following step, S621: when the current day i <3, i + +, loop through step S621.
Preferably, the maximum number of days in class in the list of days in class is 5.
Preferably, the maximum number of people in a shift is less than or equal to 2 times of the minimum number of people.
Preferably, the student data further includes a grade size, a hosting course ID, and a quality course ID.
Preferably, the students are grouped by grade, and the students are sorted in the order of grade from small to large > hosting class ID from small to large > prime class ID from small to large.
Preferably, students are taken out from front to back in order to be separated.
According to the intelligent work-sharing method provided by the invention, students in each grade operate the work-sharing method once, and work-sharing is carried out according to the principle that students in the same grade have the same or overlapped class time and work-sharing time, so that the optimal work-sharing solution for saving teachers and reducing the number of managed work-starting days is obtained.
Drawings
FIG. 1 is a diagram of the method steps for intelligent shift distribution provided by the present invention;
fig. 2 is a diagram showing a specific execution procedure of step S6.
Detailed Description
The intelligent shift distributing method provided by the invention is further described below with reference to the accompanying drawings, and it should be noted that the technical scheme and the design principle of the invention are described in detail below only with an optimized technical scheme.
Referring to fig. 1, a step diagram of the shift-dividing method provided in the present embodiment includes
S1: counting student data, wherein the student data comprises class time and the number of people corresponding to the class time;
s2: calculating the total number of students;
s3: setting the minimum number and the maximum number of people in the shift;
s4: establishing a class time array according to class times of students, and establishing student groups: { number of students, time of class array }, construct class group: { student number, student grouping array };
s5: constructing an array (the number of days in class and the array of the time in class) associated with the number of days in class, and arranging the array according to the number of days and the number of people to generate a global non-class grouping pool;
s6: obtaining student groups from a global group pool which is not divided according to the same or overlapping principle of the days in class;
s7: putting the student groups obtained from the global non-group pool into class groups;
s8: adding the class groups into a class group list;
s9: grouping the rest students in the global non-class group pool group into class groups, and adding the class groups into a class group list;
s10: all class groups are output.
Referring to fig. 2, a specific step diagram of step S6 provided in the present embodiment includes
S61: acquiring a list of all days in class;
s62: taking out the current days i from the list of the days in class in sequence;
s621: when the current day i <3, i + +, loop through step S621
S63: taking out the class time array from the class time array according to the current class days i in sequence;
s64: matching all class time array subsets of the current class time array from the global non-group pool;
s641: when the number of students corresponding to all the class time array subsets does not meet the minimum number of the class-dividing students, the students are not output to the student group;
s642: when the number of students corresponding to all the class time array subsets meets the minimum number of the class divisions, putting the student groups corresponding to the class time array subsets into class groups in sequence until the number of the class groups is met; calculating the maximum number of shifts and the minimum number of shifts according to the minimum number of people in shifts and the maximum number of people in shifts, and performing shifts according to the maximum number of shifts when the maximum number of shifts and the minimum number of shifts are the same;
s643: putting the rest student groups back into the global unpartitioned group pool in the order of the days of class, and removing the student groups which are already put into the class groups from the global unpartitioned group pool;
s65: and outputting the student groups.
Preferably, in the list of the number of days in class, the maximum number of days in class is 5, the maximum number of people in class is less than or equal to 2 times of the minimum number of people in class, the student data further comprises grade size, hosting class ID and quality class ID, students are grouped according to grade, students are sorted in the order of grade from small to large > hosting class ID from small to large > quality class ID from small to large, and students are taken out from front to back in the order of sorting.
The shift-dividing method provided in this example is explained in detail below with reference to table 1:
s1: counting student data, wherein six-grade students are taken as an example, the number of students in class in week 1, week 2, week 3, week 4, week 5, week 2, week 3, week 4, week 5, week 3, week 4, and week 5 is 16, 32, 4, 1, and 19 respectively;
s2: counting the total number of students by 72 persons;
s3: the minimum number of people in the shift is set to be 36, and the maximum number of people in the shift is set to be 40;
s4: constructing a class time array, such as [1,2,3,4,5], [1,2,4,5], constructing student groups, such as {16, [1,2,3,4,5] }, {32, [1,2,4,5] }; a class group is constructed, such as class 1: { number of people, class hours array, number of people, class hours array … … }
S5: constructing an array of the association of the groups of the class days and the class time as shown in the table II, and grouping the students according to the class days and the number of the students to generate a global group pool which is not divided into classes;
s6: obtaining student groups from a global group pool which is not divided according to the same or overlapping principle of the days in class;
s61: and acquiring a list of all days in class, wherein if [1,2,3,4,5] is 5 days in class, the list of days in class contains {3, 4,5 }.
S62: in this embodiment, the number of days in class is not calculated to be less than 3, so the initial value of the current number of days in class i is set to 3, and the number of days in class i is obtained to correspond to the time of class array, for example, when i is 3, we obtain [2,4,5] and [3,4,5], when i is 4, we obtain [1,2,4,5], [2,3,4,5 ];
s63: acquiring an mth class time array, wherein the default m is 1, such as when m is 1, acquiring [2,4,5 ];
s64: matching all subsets of the current class time array, wherein the array matched with [2,4,5] is [2], [4], [5], [2, 4], [2, 5], [4, 5 ];
s641: when the total number of the students in the current class time array and the subset of the current class time array does not meet the minimum number of the class-dividing people, m + +, and only step S63, when the value of m is larger than the number of the current class time array, i + +, and the process is circulated to step S62;
s642: when the number of students corresponding to all the class time array subsets meets the minimum number of the class divisions, putting the student groups corresponding to the class time array subsets into class groups in sequence until the number of the class groups is met; calculating the maximum number of shifts and the minimum number of shifts according to the minimum number of people in shifts and the maximum number of people in shifts, and performing shifts according to the maximum number of shifts when the maximum number of shifts and the minimum number of shifts are the same; if the class time is [1,2,3, 5], the corresponding subset is [2,4,5], the total number of people is 36, and the class-dividing condition is met;
s643: putting the rest student groups back into the global unpartitioned group pool in the order of the days of class, and removing the student groups which are already put into the class groups from the global unpartitioned group pool;
s65: outputting the student groups;
s7: the student groups obtained from the global group of unpartitioned pools are put into class groups, such as class 1: the number of people is 36; class hours [1,2,4,5], class contains groups: people group 4, class time [2,4,5], group number of people 32, class time [1,2,4,5 ];
s8: adding the class groups into a class group list;
s9, grouping the rest students in the global unpartitioned group pool into a class group, and adding the class group into a class group list;
s10, outputting all the class groups, such as the list of class groups in table 1.
Class 1: the number of people is 36; class hours [1,2,4,5]
The class contains the groups:
the number of the groups: 4; class time: [2,4,5]
The number of the groups: 32, a first step of removing the first layer; class time: [1,2,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
Class 2: the number of people is 36; class hours [1,2,3,4,5]
The class contains the groups:
the number of the groups: 19; class time: [3,4,5]
The number of the groups: 1; class time: [2,3,4,5]
The number of the groups: 16; class time: [1,2,3,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
TABLE 1
TABLE 2
Wherein, the segment code implemented in relation to step S63 is as follows:
the fragment code implemented in connection with step S64 is as follows:
next, referring to tables 3,4,5, and 6, a class grouping list of other class sample outputs realized by the intelligent shift method is shown;
class 1: the number of people 37; class hours [1,2,4,5]
The class contains the groups:
the number of the groups: 37; class time: [1,2,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
Class 2: the number of people 39; class hours [2,3,4,5]
The class contains the groups:
the number of the groups: 17; class time: [2,4,5]
The number of the groups: 22; class time: [2,3,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
Class 3: the number of people 38; class hours [2,3,4,5]
The class contains the groups:
the number of the groups: 38; class time: [2,3,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
Class 4: the number of people 38; class hours [1,2,3,4,5]
The class contains the groups:
the number of the groups: 38; class time: [1,2,3,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
Class 5: the number of people 31; class hours [1,2,3,4,5]
The class contains the groups:
the number of the groups: 24; class time: [3,4,5]
The number of the groups: 7; class time: [1,2,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
TABLE 3
Class 1: the number of people 39; class hours [2,3,4,5]
The class contains the groups:
the number of the groups: 20; class time: [2,3,4,5]
The number of the groups: 19; class time: [3,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
Class 2: the number of people 39; class hours [1,2,3,4,5]
The class contains the groups:
the number of the groups: 33; class time: [1,2,3,4,5]
The number of the groups: 6; class time: [1,2,4,5]
Twenty-Twenty: the number of people 37; class hours [1,2,3,4,5]
The class contains the groups:
the number of the groups: 12; class time: [2,4,5]
The number of the groups: 10; class time: [3,4,5]
The number of the groups: 15; class time: [1,2,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
TABLE 4
Class 1: the number of people 43; class hours [2,3,4,5]
The class contains the groups:
the number of the groups: 28; class time: [3,4,5]
The number of the groups: 14; class time: [2,3,4,5]
The number of the groups: 1; class time: [2,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
Class 2: the number of people 43; class hours [1,2,3,4,5]
The class contains the groups:
the number of the groups: 9; class time: [2,4,5]
The number of the groups: 5; class time: [1,2,4,5]
The number of the groups: 29; class time: [1,2,3,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
TABLE 5
Class 1: the number of people is 32; class hours [1,2,4,5]
The class contains the groups:
the number of the groups: 1; class time: [2,4,5]
The number of the groups: 31; class time: [1,2,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
Class 2: the number of people is 30; class hours [1,2,3,4,5]
The class contains the groups:
the number of the groups: 6; class time: [3,4,5]
The number of the groups: 24; class time: [1,2,3,4,5]
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
TABLE 6
According to the intelligent work-sharing method provided by the invention, students in each grade operate the work-sharing method once, and work-sharing is carried out according to the principle that students in the same grade have the same or overlapped class time and work-sharing time, so that the optimal work-sharing solution for saving teachers and reducing the number of managed work-starting days is obtained.
The above is only a preferred embodiment of the present invention, and it should be noted that the above preferred embodiment should not be considered as limiting the present invention, and the protection scope of the present invention should be subject to the scope defined by the claims. It will be apparent to those skilled in the art that various modifications and adaptations can be made without departing from the spirit and scope of the invention, and these modifications and adaptations should be considered within the scope of the invention.
Claims (10)
1. An intelligent work-sharing method is characterized by comprising the following steps,
s1: counting student data, wherein the student data comprises class time and the number of people corresponding to the class time;
s2: calculating the total number of students;
s3: setting the minimum number and the maximum number of people in the shift;
s4: establishing a class time array according to class times of students, and establishing student groups: { number of students, time of class array }, construct class group: { student number, student grouping array };
s5: constructing an array (the number of days in class and the array of the time in class) associated with the number of days in class, and arranging the array according to the number of days and the number of people to generate a global non-class grouping pool;
s6: obtaining student groups from a global group pool which is not divided according to the same or overlapping principle of the days in class;
s7: putting the student groups obtained from the global non-group pool into class groups;
s8: adding the class groups into a class group list;
s9: grouping the rest students in the global non-class group pool group into class groups, and adding the class groups into a class group list;
s10: all class groups are output.
2. The intelligent shift distributing method according to claim 1, wherein the step S6 includes the steps of,
s61: acquiring a list of all days in class;
s62: taking out the current days i from the list of the days in class in sequence;
s63: taking out the class time array from the class time array according to the current class days i in sequence;
s64: matching all class time array subsets of the current class time array from the global non-group pool;
s65: and outputting the student groups.
3. The intelligent shift distributing method according to claim 2, wherein the step S65 further comprises the steps of,
s641: when the number of students corresponding to all the class time array subsets does not meet the minimum number of the class-dividing students, the students are not output to the student group;
s642: when the number of students corresponding to all the class time array subsets meets the minimum number of the class divisions, putting the student groups corresponding to the class time array subsets into class groups in sequence until the number of the class groups is met;
s643: the remaining student groupings are placed back into the global unpartitioned group pool in order of days in class, and the student groupings that have been placed into class groupings are removed from the global unpartitioned group pool.
4. An intelligent shift distributing method according to claim 3, wherein the step S642 is as follows: and calculating the maximum shift number and the minimum shift number according to the minimum shift number and the maximum shift number, and performing shift according to the maximum shift number when the maximum shift number is the same as the minimum shift number.
5. The intelligent shift distributing method according to claim 2, wherein the step S62 further comprises the steps of, S621: when the current day i <3, i + +, loop through step S621.
6. The intelligent work-sharing method of claim 2, wherein the maximum number of days in class in the list of days in class is 5.
7. The intelligent work-sharing method of claim 1, wherein the maximum number of people in work-sharing is less than or equal to 2 times the minimum number of people.
8. The intelligent work-sharing method of claim 1, wherein the student data further comprises a grade size, a trusteeship class ID, and a quality class ID.
9. The intelligent work-sharing method of claim 8, wherein the students are grouped by grade, and the students are sorted in order of grade from small to large > hosting class ID from small to large > prime class ID from small to large.
10. The intelligent work-sharing method of claim 9, wherein the students take out j from front to back for work-sharing according to the sequence of the grade from small to large > hosting class ID from small to large > quality class ID from small to large.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011221224.7A CN112288178A (en) | 2020-11-05 | 2020-11-05 | Intelligent shift distributing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011221224.7A CN112288178A (en) | 2020-11-05 | 2020-11-05 | Intelligent shift distributing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112288178A true CN112288178A (en) | 2021-01-29 |
Family
ID=74351614
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011221224.7A Pending CN112288178A (en) | 2020-11-05 | 2020-11-05 | Intelligent shift distributing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112288178A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050255440A1 (en) * | 2004-05-12 | 2005-11-17 | Downing Linda P | System and method of integrating levels of educational programs |
| CN109472410A (en) * | 2018-11-07 | 2019-03-15 | 成都鲸成科技有限公司 | A kind of dynamic and intelligent is put into several classes cource arrangement method |
| CN109978738A (en) * | 2019-03-21 | 2019-07-05 | 深圳市倍思教育科技有限公司 | Put into several classes method, apparatus, computer equipment and storage medium |
| CN111539581A (en) * | 2020-05-07 | 2020-08-14 | 浙江蓝鸽科技有限公司 | Intelligent class scheduling method and system for different shifts |
-
2020
- 2020-11-05 CN CN202011221224.7A patent/CN112288178A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050255440A1 (en) * | 2004-05-12 | 2005-11-17 | Downing Linda P | System and method of integrating levels of educational programs |
| CN109472410A (en) * | 2018-11-07 | 2019-03-15 | 成都鲸成科技有限公司 | A kind of dynamic and intelligent is put into several classes cource arrangement method |
| CN109978738A (en) * | 2019-03-21 | 2019-07-05 | 深圳市倍思教育科技有限公司 | Put into several classes method, apparatus, computer equipment and storage medium |
| CN111539581A (en) * | 2020-05-07 | 2020-08-14 | 浙江蓝鸽科技有限公司 | Intelligent class scheduling method and system for different shifts |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108846782A (en) | Schedule aranging generation method and device, storage medium, electronic equipment | |
| CN109472410B (en) | Dynamic intelligent class scheduling method in shifts | |
| CN112288178A (en) | Intelligent shift distributing method | |
| CN113269532A (en) | College course arrangement method based on urgency and backtracking algorithm | |
| Moss et al. | Numerical taxonomy | |
| Rummel | Some attributes and behavioral patterns of nations | |
| Amoth et al. | Exact learning of unordered tree patterns from queries | |
| Holder | A modified Karnaugh map technique | |
| GB2605082A (en) | Curriculum management and enrolment system | |
| Hilton | School timetables | |
| Aljohani et al. | Synchronization and separation in the Johnson schemes | |
| Hocking et al. | An extension of the birthday problem to exactly k matches | |
| CN115564401B (en) | Course arrangement method, device, medium and electronic equipment | |
| Le Page | Optimized schedule for large crystallography meetings | |
| Singh | The Constitution of India: A Contextual Analysis | |
| Williams | A graph theory model for the computer solution of university time-tables and related problems | |
| Köpke | Paul Chambers and Napisa Waitoolkiat (eds.): Khaki Capital. The Political Economy of the Military in Southeast Asia | |
| Pal et al. | CCTP, Graph Coloring Algorithms-Soft Computing Solutions | |
| CN112906350A (en) | Coding method for uniform identity identification | |
| Paredes et al. | Dispa tch: Anthropology and multiculturalism in a university curriculum: a case study | |
| Dhlamini | PROFICIENT DEVELOPING, A SIGNIFICANT STRATEGY FOR ADVANCED EDUCATION UNDERSTUDY ACHIEVEMENT | |
| Wu | The state of US physics—1976 | |
| Bakwesegha | Patterns and processes of spatial development; the case of Uganda | |
| Jerman | Promising Developments in Computer‐Assisted Instruction | |
| CN114139029A (en) | Intelligent volume-combining system based on big data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |