CN102222155A - Method for high-efficiency class grouping and course scheduling in multi-restraint condition - Google Patents
Method for high-efficiency class grouping and course scheduling in multi-restraint condition Download PDFInfo
- Publication number
- CN102222155A CN102222155A CN2010105943780A CN201010594378A CN102222155A CN 102222155 A CN102222155 A CN 102222155A CN 2010105943780 A CN2010105943780 A CN 2010105943780A CN 201010594378 A CN201010594378 A CN 201010594378A CN 102222155 A CN102222155 A CN 102222155A
- Authority
- CN
- China
- Prior art keywords
- class
- row
- student
- course
- curricula
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
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
The present invention relates to that school utilizes that computing machine is put into several classes, the method for row's class, be specially a kind ofly under multi-constraint condition, efficiently put into several classes, the method for row's class.
Background technology
1975, it was NP complete class problem that people such as S.Even have proved the curriculum schedule problem.Because the related information of curriculum schedule problem is more, and the time complexity of finding the solution curriculum schedule problem optimum solution is the exponential of curriculum schedule scale, so the general algorithm of asking approximate optimal solution that adopts.In actual life, people generally also just want an approximate optimal solution that satisfies various conditions, and satisfactory solution in other words can not and not necessarily leave no choice but optimum solution.Therefore, for the curriculum schedule problem, key is not how to find optimum solution, but how to improve the satisfaction of separating.
Traditional class of manually arranging, the most worrying problem is exactly the situation that teacher resource conflict or place resource contention occur, and it is loaded down with trivial details to work, and workload is huge, and it is more that the problem that occurs class hour is arranged in especially larger middle school.The method that existing solution row levies problem mainly is backtracking method and genetic algorithm, wherein back-track algorithm is a kind of algorithm the most basic in all searching algorithms, it has adopted a kind of passless thought of just returning as its control structure, it has been equivalent to adopt method of first root traversal to construct solution tree, can be used for looking for separating or all are separated and optimum solution; Back-track algorithm is less to the consumption in space, when it uses with branch and bound method, in the middle-level darker problem of solution tree effect is preferably arranged for find the solution, but its descendant node may be identical with the node that preceding continues problem in use, can produce circulation.Back-track algorithm is applied in row's class problem, row does not pass by to levy with regard to accent exactly, can not just fall back by the accent class, and remember the road of passing by, save time with this, but because backtracking method is a kind of exhaustive way, though space consuming is little, time overhead is but very big, and the time convergence is slow, good school timetable may be missed sometimes.Genetic algorithm then is to begin from the population that the representative problem may potential disaggregation, in each generation, select individuality according to fitness size individual in the Problem Areas, and make up intersection and variation, produce the population of the new disaggregation of representative by representing in the genetic operator of natural genetics.It is the same that this process causes kind of images of a group of characters to be evolved naturally, and the back is given birth to and is adapted to environment for population more than former generation, and optimum individual can be used as the approximate optimal solution of problem through decoding in the last reign of a dynasty population.Genetic algorithm is applied in row's class problem, be progressively near target setting, by starting condition course be drained in the school timetable earlier, progressively reaches target according to condition subsequent after row is full by the accent class, carry out evolution progressively, it is big to levy space consuming with genetic algorithm row, and it is to produce a lot of school timetables at random afterwards according to the condition inspection, and ineligible abandons, the heredity of imitation again that stays is done at random and is changed, form a lot of new sub-school timetables, ineligible abandons, up to finishing the work; Its simulating nature is selected and heredity, i.e. the survival of the fittest, the survival of the fittest initiatively do not generate school timetable according to condition, has certain blindness, and this also must cause the waste of plenty of time.
Summary of the invention
The objective of the invention is to,, provide a kind of and can under a plurality of constraint conditions, can save room and time, have a definite purpose at the technological deficiency that exists in the prior art, can initiatively rationally finish fast put into several classes, method that row levies task.
For reaching above purpose, the technical solution used in the present invention is: a kind ofly efficiently put into several classes under multi-constraint condition, the method for row's class, may further comprise the steps:
(1) assignment: formulate and announce term course tabulation, set place scope, row's class hour section that class hour in week measures and course allows of every subject, total power branch of distributing 100 minutes selection teacher for each student provides mark for during student's curricula-variable every the teacher that teaches;
(2) put into several classes: statistics student curricula-variable information, put into several classes by following provisions: the student that the curricula-variable of the same administrative class of a. is identical divides in a teaching class as far as possible, and the administrative class number of taking into account a teaching class source simultaneously is the least possible; B. under place and the actual requirement of section's purpose, every elective course absorbs the curricula-variable student from high to low by the power branch, forms new teaching class; C. in each teaching class a certain proportion of planned number is set and implements by the b regulation, remaining proportion is pressed a regulation way and is implemented;
(3) convert: according to setting data and statistics, the set course that converts is arranged the degree-of-difficulty factor z of class, and is its ordering by order from big to small, wherein z=(s/t)+(k/w); K be coefficient, w be place scope, s be one week class hour amount, t be row's class hour section that course allows;
(4) row's class: begin to arrange class,, look for the position that to arrange from the initial position that meets the period of teaching in the place of teaching appointment.Can not sequence, in the time of a setting, look for suitable position repeatedly; Still can not sequence, be a small amount of accent class row again; Then skip this row if can't satisfy condition and levy task, then arrange next course; Check whether used course has been arranged after finishing last row's class task; The row's of benefit class do not have the course arranged to levy automatically one by one row's class in order by mending row again, if repeatedly still can not sequence; At last by the intact all classes of artificial semi-automatic auxiliary row.
Furthermore, the setting data of step (1) to the step (4), the statistical treatment of the information of putting into several classes are finished by database, and it comprises the table of following content at least: 1. Basic Information Table, the basic parameter data that record is crucial; 2. fixing school timetable writes down a phase with temporal identical class; 3. subject joint limit table writes down each course window of opportunity of giving a lesson; 4. Operating Chart of Accounts writes down each grade of school, and each section goes up several joints weekly; 5. the table of teaching, record teacher correspondence teach class and relevant information; 6. student's student status table, record curricula-variable student's information such as student status; 7. student's curricula-variable table writes down the situation that the student takes as an elective course; 8. the student divides shift report, and record is according to student's curricula-variable number information such as put into several classes; 9. the elective course table of teaching is awarded elective course according to give a course plan and the situation arrangement teacher that puts into several classes of school; 10. school timetable writes down place on class, total school timetable of lesson;
Teacher's school timetable, record teacher's name, lesson and class period;
The place table, the relevant information in each teaching place of record school;
Module table, the relevant information of each module that record school offers.
Further, the module of levying the algorithm concrete grammar of the row described in the step (4) is provided with as follows:
A, in the period that course limits, the unduplicated from front to back time of changing is carried out B then;
Whether correspondence position has class in B, the school timetable, and the nothing class is carried out C; If being arranged, class carries out E;
C, whether also have other place, have and then carry out B; If there is not other place, carry out D;
Whether correspondence position has class in D, the teacher's school timetable, has class then to carry out A; Class is not just represented energy row class;
Whether E, current place specify the place for teaching, and are then to carry out G; Just do not carry out F;
F, test whether and the class that will arrange conflict is arranged, have conflict then to carry out G; C is not just carried out in conflict;
The class that G, accent class is promptly transferred is row's class again, and is successful then carry out C; The unsuccessful A that just carries out.
Wherein step D also can be placed on before step B or the C, the also commutative sequencing of step F and step G.
Again furthermore, carry out better invention effect for making the present invention, the concrete steps of module F are as follows:
1) in student's the curricula-variable and the record of putting into several classes, the class unit of student front is made as i, the class in back unit is made as j, and i value is initially 1, and the j initial value is bigger by 1 than i, and wherein class unit is exactly corresponding curricula-variable and its combination of putting into several classes;
2) whether i of student class unit and j class unit have conflict, having conflict to illustrate that this position can not row levy; Not conflicting then, j carries out 3 then from increasing by 1);
3) whether j exceeds actual range n, and wherein n represents the maximum quantity of 1 student's curricula-variable, does not exceed execution in step 2); Exceed then execution in step 4);
4) i is from increasing by 1, and the value with i adds 1 assignment again to j then, and whether j exceeds actual range, does not exceed then execution in step 2); Exceed with regard to execution in step 5);
5) the student's curricula-variable and the record of putting into several classes move down a record, detect whether such record is arranged, and then execution in step 1 is arranged), not just not conflict of expression.
Again furthermore, method of the present invention also can be used for arrangement of the tests, put aside the factor of putting into several classes when arranging examination, after sequencing by the step of the method for the invention, the student of examination is simultaneously inserted to separate and gets final product by the identical principle that then can not be adjacent of curricula-variable.
Beneficial effect of the present invention is, adopt method of the present invention, can effectively solve putting into several classes under the multi-constraint condition, row levies problem, significantly reduced and put into several classes, row levies the needed time, the time convergence is good, especially on the more problem of processing number and class, demonstrate its superiority more, experiment shows that it adopts algorithm of the present invention than at least 20 times soon of other algorithms under the same conditions, has improved work efficiency greatly, reduced artificial, be convenient to add up teacher workload, student's task amount, the trend of student's curricula-variable, conveniently check the teacher, student's school timetable is for interim the adjustment offers convenience; The present invention also can be used for the arrangement that takes an exam.
Why the present invention has above beneficial effect, be because the present invention has following characteristics: the present invention proposes a kind ofly brand-new to put into several classes, the method for row's class, this method is bound to task is sorted by complexity row before the class, and difficulty row's course is preposition, the time that row levies the accent class after reducing; And every arrangement one class all is qualified fully, back row's class is looked for correct position row, if there is not correct position, will transfer the class that has originally sequenced, but the class that prerequisite is called away is bound on the position that meets its condition fully, if there is not suitable position, will select new course to be called away, finish up to row's class; Have good purpose, not only space consuming is little, and the time convergence is good.
Description of drawings
Fig. 1 is the process flow diagram of the method for the invention
Fig. 2 is the process flow diagram of module in the step of the present invention (4)
Fig. 3 is the process flow diagram of module F operation in the step of the present invention (4)
Fig. 4 is for using the synoptic diagram of the method for the invention
Embodiment
Example 1
Utilizing the present invention to put into several classes, arrange class hour, as described in Fig. 1, Fig. 2, Fig. 3, Fig. 4, a kind ofly under multi-constraint condition, efficiently put into several classes, the method for row's class comprises the steps:
(1) assignment: formulate and announce that term course tabulation is the module table in the database, set place scope, row's class hour section that class hour in week measures and course allows of every subject, show accordingly in the correspondence database respectively, total power branch of distributing 100 minutes selection teacher for each student provides mark for during student's curricula-variable every the teacher that teaches;
(2) put into several classes: statistics student curricula-variable information, promptly the student divides shift report, puts into several classes by following provisions: the student that the curricula-variable of the same administrative class of a. is identical divides in a teaching class as far as possible, and the administrative class number of taking into account a teaching class source simultaneously is the least possible; B. under place and the actual requirement of section's purpose, divide every elective course to absorb the curricula-variable student from high to low, form new teaching class by power; C. in each teaching class a certain proportion of planned number is set and implements by the b regulation, remaining proportion is pressed a regulation way and is implemented;
(3) convert: according to setting data and statistics, the set course that converts is arranged the degree-of-difficulty factor z of class, and is its ordering by order from big to small, wherein z=(s/t)+(k/w); K be coefficient, w be place scope, s be one week class hour amount, t be row's class hour section that course allows; Respectively to its assignment, drawing the most difficult is mathematics 2, and the place scope is former classroom, and a week is 5 class, and row's class hour section of permission is to save the 3rd joint the morning the 1st, and K is tentative to be 1, Z=5/2+1/1=3.5; The simplest is historical 3, and the place scope is that being assumed to be for 8, one weeks is 2 class arbitrarily, and row's class hour section of permission is the 4th to save the 7th joint, and K is tentative to be 1, Z=2/3+1/8=0.785.
(4) row's class: begin to arrange class,, look for the position that to arrange from the initial position that meets the period of teaching in the place of teaching appointment.Can not sequence, in the time of a setting, look for suitable position repeatedly; Still can not sequence, be a small amount of accent class row again; Then skip this row if can't satisfy condition and levy task, then arrange next course; Check whether used course has been arranged after finishing last row's class task; The row's of benefit class do not have the course arranged to levy automatically one by one row's class in order by mending row again, if repeatedly still can not sequence; At last by the intact all classes of artificial semi-automatic auxiliary row.
The teacher power of throwing of selected module correspondence is divided, system is according to power branch principle from high to low, absorb the student and form new teaching class, teach the ordering after, mathematics 2 is arranged at first, in 9. elective course is taught table, extract the 1st teacher name Zhang Shi of teaching class of mathematics 2, teach the place that requires tentative be 6 to 8, simultaneously extracting row's class hour section of mathematics correspondence tentative at 3. subject joint limit table is that 1 joint is to 3 joints, the 6th position in 10. school timetable, carry out the A step, from first day was Monday, the 1st joint beginning, carry out B, whether correspondence position has class in 10. school timetable, because begin row's class, suppose the nothing class, the nothing class is carried out C, from the 1st is joint correspondence position on Monday the 1st, carry out B, supposing has class, carry out E, it is the class of music 1 the 1st teaching class, naturally not current appointment place, just carry out F, at this moment just to 7. student's curricula-variable table and 8. the student divide in the shift report, first position is that high roc begins, carry out 2), i class unit be the 1st class of Chinese language 1 module and j class unit be the 1st class of mathematics 2 module be more just the 1st class of mathematics 2 with the 1st class of music 1, obviously be not execution 3), j is 3 now, do not exceed actual n, n is 20, carries out 2 so), i class unit is that the 1st class of Chinese language 1 module and j class unit are English 2, whether 1 class be a pair of class unit that will look for, is not to become 4 after then j adds 1, carries out 3), up to j is to carry out 3 at 21 o'clock) exceed n, carry out 4), i becomes 2, and j is 3, i is mathematics 2,1 class and j is whether 2,1 classes of English are that a pair of class that will look for is first, is not, j is 4, greater than n, i is from increasing 1, when i is n up to j, j goes beyond the scope, execution in step 5), the student's curricula-variable and the record of putting into several classes move down a record, continue to carry out 1), find a pair of class that to look for first, then jump out, carry out the G step, the accent class, promptly be exactly with in the 1st Monday the 1st joint music 1 teach for the 1st class and adjust to other and be fit to its position, be exactly to its row class more in fact, specifically just do not described in detail, suppose that the accent class gets nowhere, carry out A, from the 2nd joint on Monday, carry out B, correspondence position does not have class execution C in the school timetable; Other place is arranged, carry out B from the 1st place, correspondence position does not have class and carries out C; Other place is arranged, and B is carried out in the 2nd place, and correspondence position does not have class and carries out C, up to the 6th place, the 7th, the 8th until all places are all empty, and promptly carrying out among the C has not had other place, carry out D, whether Mr. Zhang's correspondence position has class in teacher's school timetable, and just expression can row's class for class.
According to the above steps in sequence each row's class task is arranged class, at last until the auxiliary manual row of finishing of computer class, whole putting into several classes under multi-constraint condition, row levy task termination.
Example 2
Use the inventive method to carry out the test of different condition same steps as, its testing procedure is described with example 1, the test of being done and the results are shown in Table.
Table one
Method of the present invention is not limited in the embodiment described in the embodiment, and those skilled in the art's technical scheme according to the present invention draws other embodiment, belongs to technological innovation scope of the present invention equally.
Claims (6)
- One kind under multi-constraint condition, efficiently put into several classes, the method for row class, may further comprise the steps:(1) assignment: formulate and announce term course tabulation, set place scope, row's class hour section that class hour in week measures and course allows of every subject, total power branch of distributing 100 minutes selection teacher for each student provides mark for during student's curricula-variable every the teacher that teaches;(2) put into several classes: statistics student curricula-variable information, put into several classes by following provisions: the student that the curricula-variable of the same administrative class of a. is identical divides in a teaching class as far as possible, and the administrative class number of taking into account a teaching class source simultaneously is the least possible; B. under place and the actual requirement of section's purpose, every elective course absorbs the curricula-variable student from high to low by the power branch, forms new teaching class; C. in each teaching class a certain proportion of planned number is set and implements by the b regulation, remaining proportion is pressed a regulation way and is implemented;(3) convert: according to setting data and statistics, the set course that converts is arranged the degree-of-difficulty factor z of class, and is its ordering by order from big to small, wherein z=(s/t)+(k/w); K be coefficient, w be place scope, s be one week class hour amount, t be row's class hour section that course allows;(4) row's class: begin to arrange class,, look for the position that to arrange from the initial position that meets the period of teaching in the place of teaching appointment; Can not sequence, in the time of a setting, look for suitable position repeatedly; Still can not sequence, be a small amount of accent class row again; Then skip this row if can't satisfy condition and levy task, then arrange next course; Check whether used course has been arranged after finishing last row's class task; The row's of benefit class do not have the course arranged to levy automatically one by one row's class in order by mending row again, if repeatedly still can not sequence; At last by the intact all classes of artificial semi-automatic auxiliary row.
- 2. as claimed in claim 1ly a kind ofly under multi-constraint condition, efficiently put into several classes, the method for row's class, it is characterized in that, the setting data of described step (1) to the step (4), the statistical treatment of the information of putting into several classes are finished by database, it comprises the table of following content at least: 1. Basic Information Table, the basic parameter data that record is crucial; 2. fixing school timetable writes down a phase with temporal identical class; 3. subject joint limit table writes down each course window of opportunity of giving a lesson; 4. Operating Chart of Accounts writes down each grade of school, and each section goes up several joints weekly; 5. the table of teaching, record teacher correspondence teach class and relevant information; 6. student's student status table, record curricula-variable student's information such as student status; 7. student's curricula-variable table writes down the situation that the student takes as an elective course; 8. the student divides shift report, and record is according to student's curricula-variable number information such as put into several classes; 9. the elective course table of teaching is awarded elective course according to give a course plan and the situation arrangement teacher that puts into several classes of school; 10. school timetable writes down place on class, total school timetable of lesson;Teacher's school timetable, record teacher's name, lesson and class period;
The place table, the relevant information in each teaching place of record school;
Module table, the relevant information of each module that record school offers.
- 3. as claimed in claim 1ly a kind ofly under multi-constraint condition, efficiently put into several classes, the method for row's class, it is characterized in that the module that the row described in the described step (4) levies the algorithm concrete grammar is provided with as follows:A, in the period that course limits, the unduplicated from front to back time of changing is carried out B then;Whether correspondence position has class in B, the school timetable, and the nothing class is carried out C; If being arranged, class carries out E;C, whether also have other place, have and then carry out B; If there is not other place, carry out D;Whether correspondence position has class in D, the teacher's school timetable, has class then to carry out A; Class is not just represented energy row class;Whether E, current place specify the place for teaching, and are then to carry out G; Just do not carry out F;F, test whether and the class that will arrange conflict is arranged, have conflict then to carry out G; C is not just carried out in conflict;The class that G, accent class is promptly transferred is row's class again, and is successful then carry out C; The unsuccessful A that just carries out.
- 4. as claimed in claim 3ly a kind ofly under multi-constraint condition, efficiently put into several classes, the method for row's class, it is characterized in that described step D also can be placed on before step B or the C, the also commutative sequencing of step F and step G.
- 5. as claimed in claim 3ly a kind ofly under multi-constraint condition, efficiently put into several classes, the method for row's class, it is characterized in that the concrete steps of described module F are as follows:1) in student's the curricula-variable and the record of putting into several classes, the class unit of student front is made as i, the class in back unit is made as j, and i value is initially 1, and the j initial value is bigger by 1 than i, and wherein class unit is exactly corresponding curricula-variable and its combination of putting into several classes;2) whether i of student class unit and j class unit have conflict, having conflict to illustrate that this position can not row levy; Not conflicting then, j carries out 3 then from increasing by 1);3) whether j exceeds actual range n, and wherein n represents the maximum quantity of 1 student's curricula-variable, does not exceed execution in step 2); Exceed then execution in step 4);4) i is from increasing by 1, and the value with i adds 1 assignment again to j then, and whether j exceeds actual range, does not exceed then execution in step 2); Exceed with regard to execution in step 5);5) the student's curricula-variable and the record of putting into several classes move down a record, detect whether such record is arranged, and then execution in step 1 is arranged), not just not conflict of expression.
- A kind of described in any one of claim 1 to 5 under multi-constraint condition, efficiently put into several classes, the method for row's class, it is characterized in that, described method also can be used for arrangement of the tests, put aside the factor of putting into several classes when arranging examination, after sequencing set by step, the student who takes an examination was simultaneously got final product by identical slotting separating of principle that then can not be adjacent of curricula-variable.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105943780A CN102222155A (en) | 2010-12-14 | 2010-12-14 | Method for high-efficiency class grouping and course scheduling in multi-restraint condition |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105943780A CN102222155A (en) | 2010-12-14 | 2010-12-14 | Method for high-efficiency class grouping and course scheduling in multi-restraint condition |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102222155A true CN102222155A (en) | 2011-10-19 |
Family
ID=44778705
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105943780A Pending CN102222155A (en) | 2010-12-14 | 2010-12-14 | Method for high-efficiency class grouping and course scheduling in multi-restraint condition |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102222155A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103268536A (en) * | 2013-06-09 | 2013-08-28 | 青岛农业大学 | Course selection system for institutions of higher learning |
| CN103996154A (en) * | 2014-06-06 | 2014-08-20 | 大连海事大学 | Human-computer coordination heuristic course arrangement system orientated toward unified teaching resources |
| CN104751388A (en) * | 2015-03-01 | 2015-07-01 | 江西科技学院 | Genetic algorithm based college course arranging method |
| CN106846193A (en) * | 2016-12-26 | 2017-06-13 | 河南工业大学 | The controllable cource arrangement method of constraint granularity and system |
| CN108122179A (en) * | 2016-11-30 | 2018-06-05 | 北京王府学校 | Delamination Teaching cource arrangement method and device, delamination Teaching curricula-variable method and system |
| CN108846782A (en) * | 2018-06-05 | 2018-11-20 | 科大讯飞股份有限公司 | Schedule list generation method and device, storage medium and electronic equipment |
| CN108961117A (en) * | 2018-07-03 | 2018-12-07 | 陈上仁 | A kind of student's elective course registration grouping into classes method and system |
| CN109190980A (en) * | 2018-09-04 | 2019-01-11 | 安徽皖新金智教育科技有限公司 | A kind of campus course arrangement management system and course management method |
| CN109615569A (en) * | 2018-12-12 | 2019-04-12 | 六选三科技(北京)有限公司 | A kind of automatic curriculum scheduling method and system |
| CN109615571A (en) * | 2018-12-17 | 2019-04-12 | 北京竞业达数码科技股份有限公司 | A kind of Course Arrangement |
| CN109961189A (en) * | 2019-03-29 | 2019-07-02 | 北京工业大学 | New college entrance examination timetabling algorithm based on genetic algorithm |
| CN109978738A (en) * | 2019-03-21 | 2019-07-05 | 深圳市倍思教育科技有限公司 | Put into several classes method, apparatus, computer equipment and storage medium |
| CN110503269A (en) * | 2019-08-29 | 2019-11-26 | 华中师范大学 | Put into several classes cource arrangement method and device under the class's of walking teaching |
| TWI698814B (en) * | 2018-12-24 | 2020-07-11 | 英業達股份有限公司 | Intelligent course establishment system and method thereof |
| CN111898988A (en) * | 2020-07-31 | 2020-11-06 | 四川千百年科技有限公司 | Seven-line course arrangement method based on NP complete problem extension |
| CN117132092A (en) * | 2023-10-27 | 2023-11-28 | 深圳市倍思教育科技有限公司 | Automatic course adjustment method and device and computer storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN2172896Y (en) * | 1993-12-11 | 1994-07-27 | 冶金工业部钢铁研究总院 | Variable information indicating board |
| CN1598839A (en) * | 2004-09-23 | 2005-03-23 | 罗星凯 | School class managing system and operation method |
| CN101772792A (en) * | 2007-08-01 | 2010-07-07 | 认知建立时机公司 | A system for adaptive teaching and learning |
-
2010
- 2010-12-14 CN CN2010105943780A patent/CN102222155A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN2172896Y (en) * | 1993-12-11 | 1994-07-27 | 冶金工业部钢铁研究总院 | Variable information indicating board |
| CN1598839A (en) * | 2004-09-23 | 2005-03-23 | 罗星凯 | School class managing system and operation method |
| CN101772792A (en) * | 2007-08-01 | 2010-07-07 | 认知建立时机公司 | A system for adaptive teaching and learning |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103268536A (en) * | 2013-06-09 | 2013-08-28 | 青岛农业大学 | Course selection system for institutions of higher learning |
| CN103996154A (en) * | 2014-06-06 | 2014-08-20 | 大连海事大学 | Human-computer coordination heuristic course arrangement system orientated toward unified teaching resources |
| CN104751388A (en) * | 2015-03-01 | 2015-07-01 | 江西科技学院 | Genetic algorithm based college course arranging method |
| CN108122179A (en) * | 2016-11-30 | 2018-06-05 | 北京王府学校 | Delamination Teaching cource arrangement method and device, delamination Teaching curricula-variable method and system |
| CN106846193A (en) * | 2016-12-26 | 2017-06-13 | 河南工业大学 | The controllable cource arrangement method of constraint granularity and system |
| CN108846782A (en) * | 2018-06-05 | 2018-11-20 | 科大讯飞股份有限公司 | Schedule list generation method and device, storage medium and electronic equipment |
| CN108961117A (en) * | 2018-07-03 | 2018-12-07 | 陈上仁 | A kind of student's elective course registration grouping into classes method and system |
| CN109190980A (en) * | 2018-09-04 | 2019-01-11 | 安徽皖新金智教育科技有限公司 | A kind of campus course arrangement management system and course management method |
| CN109615569A (en) * | 2018-12-12 | 2019-04-12 | 六选三科技(北京)有限公司 | A kind of automatic curriculum scheduling method and system |
| CN109615571A (en) * | 2018-12-17 | 2019-04-12 | 北京竞业达数码科技股份有限公司 | A kind of Course Arrangement |
| TWI698814B (en) * | 2018-12-24 | 2020-07-11 | 英業達股份有限公司 | Intelligent course establishment system and method thereof |
| CN109978738A (en) * | 2019-03-21 | 2019-07-05 | 深圳市倍思教育科技有限公司 | Put into several classes method, apparatus, computer equipment and storage medium |
| CN109978738B (en) * | 2019-03-21 | 2021-07-20 | 深圳市倍思教育科技有限公司 | Class-dividing method and device, computer equipment and storage medium |
| CN109961189A (en) * | 2019-03-29 | 2019-07-02 | 北京工业大学 | New college entrance examination timetabling algorithm based on genetic algorithm |
| CN110503269A (en) * | 2019-08-29 | 2019-11-26 | 华中师范大学 | Put into several classes cource arrangement method and device under the class's of walking teaching |
| CN111898988A (en) * | 2020-07-31 | 2020-11-06 | 四川千百年科技有限公司 | Seven-line course arrangement method based on NP complete problem extension |
| CN117132092A (en) * | 2023-10-27 | 2023-11-28 | 深圳市倍思教育科技有限公司 | Automatic course adjustment method and device and computer storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102222155A (en) | Method for high-efficiency class grouping and course scheduling in multi-restraint condition | |
| CN104462079A (en) | Method of informationized class-grouping and course-arranging based on weighted optimization algorithm | |
| Prahmana et al. | The hypothetical learning trajectory on research in mathematics education using research-based learning | |
| RU2442222C2 (en) | The system of adaptive teaching and education | |
| CN110020831B (en) | Novel college entrance examination course arrangement method based on particle swarm optimization | |
| CN110047023B (en) | Novel college entrance examination course arrangement algorithm based on simulated annealing algorithm | |
| CN106203811A (en) | A kind of Evaluation Method of Teaching Quality | |
| CN109903617A (en) | Individualized exercise method and system | |
| CN105447793A (en) | Teaching system for generating customized teaching resource | |
| CN109325696A (en) | A kind of course management system and its method | |
| CN109961189A (en) | New college entrance examination timetabling algorithm based on genetic algorithm | |
| CN104063759A (en) | B/S-based power business application operation examination system | |
| CN105488614A (en) | Accounting teaching demonstration system for practical simulation module | |
| Astuti et al. | Integrating Ethnomathematics in Mathematical Learning Design for Elementary Schools | |
| CN115658928A (en) | Method and device for assembling test paper, computer equipment and storage medium | |
| Sardag et al. | The integration of nature of science in the new secondary physics, chemistry, and biology curricula | |
| Verspoor et al. | Improving Teaching: A Key fo Successful Educational Change | |
| Yong et al. | Students' perception of non-placement work-integrated learning in chemical engineering: Work-related skills towards the post-pandemic future | |
| Tang | A Cultural Framework of" Chinese Learn English": a critical review of and reflections on research. | |
| Ernanda et al. | Developing an English Text book for Students of Computer Science | |
| Anufri et al. | Issues of Using Lesson Study at English Department of Universitas Negeri Padang | |
| Ratycz | Model-Based Comparison of Biological Organism and Electro-Mechanical System Resiliency Strategies | |
| Khan et al. | Kolb’s experiential learning cycle: A new approach for performing any creative task | |
| Glaspie et al. | A discrete system simulation study in scheduling and resource allocation for the John A. Burns School of Medicine Clinical Skills Center | |
| Herath et al. | An active learning environment for intermediate computer architecture courses |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C05 | Deemed withdrawal (patent law before 1993) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20111019 |