CN108764855A - Schedule generation method and device, storage medium and electronic equipment - Google Patents
Schedule generation method and device, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN108764855A CN108764855A CN201810570415.0A CN201810570415A CN108764855A CN 108764855 A CN108764855 A CN 108764855A CN 201810570415 A CN201810570415 A CN 201810570415A CN 108764855 A CN108764855 A CN 108764855A
- Authority
- CN
- China
- Prior art keywords
- schedule
- initial schedule
- class
- preset
- preset rule
- 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
- 238000000034 method Methods 0.000 title claims abstract description 43
- 238000013507 mapping Methods 0.000 claims abstract description 142
- 239000011159 matrix material Substances 0.000 claims abstract description 93
- 230000008878 coupling Effects 0.000 claims description 9
- 238000010168 coupling process Methods 0.000 claims description 9
- 238000005859 coupling reaction Methods 0.000 claims description 9
- 238000012545 processing Methods 0.000 claims description 8
- 238000001514 detection method Methods 0.000 claims description 3
- 230000000694 effects Effects 0.000 abstract description 14
- 238000010586 diagram Methods 0.000 description 6
- 238000002474 experimental method Methods 0.000 description 6
- 238000002922 simulated annealing Methods 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 3
- 230000007717 exclusion Effects 0.000 description 3
- 230000002354 daily effect Effects 0.000 description 2
- 230000003203 everyday effect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 235000019580 granularity Nutrition 0.000 description 1
- 238000012549 training Methods 0.000 description 1
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/10—Office automation; Time management
- G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
- G06Q10/1093—Calendar-based scheduling for persons or groups
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Economics (AREA)
- Marketing (AREA)
- Data Mining & Analysis (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The disclosure provides a schedule generation method and device, a storage medium and an electronic device. The method comprises the following steps: acquiring an initial schedule of a to-be-processed event, wherein the initial schedule is used for recording local mapping relations of personnel, places and contents corresponding to the to-be-processed event in at least two time units; obtaining a cost matrix of the initial schedule corresponding to a preset rule, wherein a cost value of an element in the cost matrix is used for indicating whether a local mapping relation in a time unit corresponding to the element meets the preset rule or not; and adjusting the local mapping relation in the initial schedule until the cost matrix corresponding to the adjusted schedule meets the preset condition to be used as a new schedule. According to the scheme, the influence of schedule complexity and human experience is small, and the generation efficiency and the generation effect of the schedule are improved.
Description
Technical Field
The present disclosure relates to the field of intelligent technologies, and in particular, to a method and an apparatus for generating a schedule, a storage medium, and an electronic device.
Background
A calendar refers to a table in which the activity sequence and contents are arranged according to dates. In daily life, the time and the process flow of work can be planned through a calendar.
At present, schedules are mostly manually generated, so that the generation efficiency, the generation effect and the like of the schedules are greatly influenced by schedule complexity and human experience. Especially for complex calendars, multiple persons may be required to participate in the arrangement, which is time-consuming and labor-consuming.
Disclosure of Invention
The main purpose of the present disclosure is to provide a method and an apparatus for generating a schedule, a storage medium, and an electronic device, which can generate a schedule more meeting the requirements of practical applications according to preset rules, and are helpful to improve the generation efficiency and the generation effect of the schedule.
In order to achieve the above object, the present disclosure provides a schedule generation method, including:
acquiring an initial schedule of a to-be-processed event, wherein the initial schedule is used for recording local mapping relations of personnel, places and contents corresponding to the to-be-processed event in at least two time units;
obtaining a cost matrix of the initial schedule corresponding to a preset rule, wherein a cost value of an element in the cost matrix is used for indicating whether a local mapping relation in a time unit corresponding to the element meets the preset rule or not;
and adjusting the local mapping relation in the initial schedule until the cost matrix corresponding to the adjusted schedule meets the preset condition to be used as a new schedule.
Optionally, the obtaining an initial schedule of the event to be processed includes:
acquiring a global mapping relation among personnel, places and contents corresponding to the event to be processed;
according to the global mapping relation and the priority of the content, dividing the content corresponding to each person into a specified time period, wherein the specified time period comprises at least one time unit;
and dividing the content corresponding to each person in the specified time period into each time unit according to the priority of the person or the priority of the content to obtain the initial schedule.
Optionally, the manner of obtaining the priority of the content is:
acquiring a preset rule corresponding to the content;
and determining the priority of the content based on the preset rules corresponding to the content and the weight of each preset rule.
Optionally, the manner of obtaining the priority of the person is:
acquiring content having a global mapping relation with the personnel, and determining the priority of the personnel according to the priority of the content;
or,
and if the arranged personnel with the determined local mapping relation exist, determining the priority of the personnel according to the coupling degree between the personnel and the arranged personnel.
Optionally, the obtaining a cost matrix of the initial schedule corresponding to a preset rule includes:
if the preset rule is set to be N-1, determining the cost value of each element according to whether the local mapping relation in the time unit corresponding to the element meets the preset rule or not, and obtaining a cost matrix of the initial schedule corresponding to the N preset rules;
if N is more than or equal to 2 preset rules, obtaining a sub price matrix of the initial schedule corresponding to the current preset rule according to whether the local mapping relation in the time unit corresponding to the element meets the current preset rule; and obtaining a cost matrix of the initial schedule corresponding to the N preset rules based on the sub-cost matrixes and the weight of each preset rule.
Optionally, if the place is used as a row or a column of the cost matrix, the adjusting the local mapping relationship in the initial calendar includes:
and keeping the location unchanged, and adjusting the local mapping relation corresponding to the element in the row or the column where the location is located.
Optionally, if at least two preset rules are set, before the obtaining of the initial schedule of the event to be processed, the method further includes:
detecting whether a rule conflict exists between the at least two preset rules;
and if no rule conflict exists, acquiring the initial schedule of the event to be processed.
The present disclosure provides a schedule generation apparatus, the apparatus comprising:
the system comprises an initial schedule acquisition module, a processing module and a processing module, wherein the initial schedule acquisition module is used for acquiring an initial schedule of a to-be-processed event, and the initial schedule is used for recording the local mapping relations of personnel, places and contents corresponding to the to-be-processed event in at least two time units;
a cost matrix obtaining module, configured to obtain a cost matrix corresponding to a preset rule to the initial schedule, where a cost value of an element in the cost matrix is used to indicate whether a local mapping relationship in a time unit corresponding to the element meets the preset rule;
and the schedule adjusting module is used for adjusting the local mapping relation in the initial schedule until the cost matrix corresponding to the adjusted schedule meets the preset condition and is used as a new schedule.
Optionally, the initial schedule obtaining module includes:
the global mapping relation acquisition module is used for acquiring a global mapping relation among personnel, places and contents corresponding to the event to be processed;
the mapping relation dividing module is used for dividing the content corresponding to each person into a specified time period according to the global mapping relation and the priority of the content, and the specified time period comprises at least one time unit; and dividing the content corresponding to each person in the specified time period into each time unit according to the priority of the person or the priority of the content to obtain the initial schedule.
Optionally, the initial schedule obtaining module further includes:
the content priority determining module is used for acquiring a preset rule corresponding to the content; and determining the priority of the content based on the preset rules corresponding to the content and the weight of each preset rule.
Optionally, the initial schedule obtaining module further includes:
the personnel priority determining module is used for acquiring the content having the global mapping relation with the personnel and determining the priority of the personnel according to the priority of the content;
or,
and the personnel priority determining module is used for determining the priority of the personnel according to the coupling degree between the personnel and the arranged personnel when the arranged personnel with the determined local mapping relation exist.
Optionally, if N is 1 preset rule, the cost matrix obtaining module is configured to determine a cost value of each element according to whether a local mapping relationship in a time unit corresponding to the element satisfies the preset rule, and obtain a cost matrix of the initial schedule corresponding to the N preset rules;
if N is more than or equal to 2 preset rules, the cost matrix obtaining module is used for obtaining a sub-cost matrix of the initial schedule corresponding to the current preset rule according to whether the local mapping relation in the time unit corresponding to the element meets the current preset rule; and obtaining a cost matrix of the initial schedule corresponding to the N preset rules based on the sub-cost matrixes and the weight of each preset rule.
Optionally, the place is used as a row or a column of the cost matrix, then
And the schedule adjusting module is used for keeping the place unchanged and adjusting the local mapping relation corresponding to the element in the row or the column where the place is located.
Optionally, if at least two preset rules are set, the apparatus further includes:
the rule conflict detection module is used for detecting whether a rule conflict exists between the at least two preset rules;
the initial schedule obtaining module is used for obtaining the initial schedule of the event to be processed when no rule conflict exists.
The present disclosure provides a storage medium having stored therein a plurality of instructions, which are loaded by a processor, for performing the steps of the above-described schedule generation method.
The present disclosure provides an electronic device, comprising;
the storage medium described above; and
a processor to execute the instructions in the storage medium.
According to the scheme, after the initial schedule of the time to be processed is obtained, the initial schedule can be adjusted by combining the preset rule, and a new schedule which is more in line with the actual application requirement is obtained. In the schedule generation process, the influence of schedule complexity and human experience is small, and the generation efficiency and the generation effect of the schedule are improved.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description serve to explain the disclosure without limiting the disclosure. In the drawings:
FIG. 1 is a schematic flow chart diagram of a method for generating a calendar according to the disclosed aspects;
FIG. 2 is a schematic diagram of a cost matrix in the disclosed solution;
FIG. 3 is a schematic flow chart illustrating the process of obtaining an initial calendar according to the present disclosure;
FIG. 4 is a schematic diagram of a calendar generation apparatus according to the present disclosure;
fig. 5 is a schematic structural diagram of an electronic device for calendar generation according to the present disclosure.
Detailed Description
The following detailed description of specific embodiments of the present disclosure is provided in connection with the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating the present disclosure, are given by way of illustration and explanation only, not limitation.
Referring to fig. 1, a flowchart of the disclosed calendar generation method is shown. May include the steps of:
s101, an initial schedule of an event to be processed is obtained, and the initial schedule is used for recording local mapping relations of personnel, places and contents corresponding to the event to be processed in at least two time units.
As an example, the pending events in the disclosed solution may be embodied as a course arrangement. Correspondingly, the staff corresponding to the event to be processed may include a teacher and a class of the student, for example, teacher a, class one class; the location corresponding to the pending event may include a classroom, for example, the 201 classroom; the content corresponding to the event to be processed may include a course name, for example, a math course, a Chinese course, and the like. Alternatively, the person corresponding to the pending event may include a teacher, for example, teacher a; the location corresponding to the pending event may include a classroom, for example, the 201 classroom; the content corresponding to the event to be processed may include a course name, such as a grade-by-grade mathematical course, a grade-by-grade linguistic course, and the like. The specific representation form of the personnel, the place and the content when the events to be processed are class scheduling can be not limited by the scheme.
As an example, the pending event in the disclosed aspects may be embodied as scheduling a meeting. Correspondingly, the person corresponding to the pending event may include a participant, the location corresponding to the pending event may include a meeting room, and the content corresponding to the pending event may include a meeting theme. The specific representation form of the personnel, the place and the content when the meeting is scheduled can be the event to be processed by the scheme of the disclosure without limitation.
The disclosed solution may not be limited to a specific application scenario.
It is understood that before the calendar generation, the global mapping relationship between the people, the places, and the contents corresponding to the pending events is usually preset. Taking course arrangement as an example, in order to ensure normal progress of daily teaching, the global mapping relationship of teachers, classes, classrooms and courses in the whole period can be preset. Taking teacher a as an example, the global mapping relationship in the whole period can be embodied as that teacher a needs to give class, class and class in the whole period. It is understood that the global mapping refers to the mapping of people, places, and contents in a longer time period, and in general, the longer time period can be divided into at least two time units. In the example given above, the whole term is a longer period of time.
Based on the global mapping, an initial schedule of the event to be processed may be obtained first, i.e., the global mapping is divided into local mappings in at least two time units. Taking course arrangement as an example, the time unit can be embodied as a class, and the local mapping relationship can be understood as the mapping relationship of a teacher, a class, a classroom and a course in each class. Still taking teacher a as an example, the local mapping relationship in a certain class can be embodied as that teacher a gives class to which class, class in which class, and class in which class. It is to be understood that the global mapping should be satisfied by the collection of all local mappings. In addition, it should be noted that the time unit may also be embodied as other time granularities determined according to actual application requirements, for example, half a day, class and the like, and this may not be specifically limited in the present disclosure.
As an example, when the pending event is a scheduled meeting, the time unit may be embodied as the duration of a single session. For the explanation of global mapping, local mapping, and time unit in other application scenarios such as scheduling a meeting, reference may be made to the above description, and no further explanation is given here.
As an example, the present disclosure may obtain an initial schedule of pending events at least in one of the following ways:
in the first mode, the initial schedule is manually generated based on the global mapping relation.
Therefore, the process of manually generating the initial schedule does not need to be time-consuming and labor-consuming as in the prior art, and the overall generation efficiency of the schedule of the scheme is still improved compared with the prior art.
And secondly, randomly generating an initial schedule based on the global mapping relation, so that the aggregate of all local mapping relations meets the global mapping relation.
Third, the initial schedule is generated as shown in fig. 3, which is described in detail below and will not be described in detail here.
S102, obtaining a cost matrix of the initial schedule corresponding to a preset rule, wherein a cost value of an element in the cost matrix is used for indicating whether a local mapping relation in a time unit corresponding to the element meets the preset rule or not.
As an example, in the scheme of the present disclosure, a simulated annealing algorithm may be used to adjust an initial schedule, a specific adjustment basis may depend on a cost matrix of a preset rule corresponding to the initial schedule, and if the cost matrix tends to meet a preset condition more and more after adjustment, it is indicated that a current adjustment behavior is reasonable, and schedule adjustment may be continued until the preset condition is met.
In an actual application process, S101 may obtain at least one initial schedule, where the at least one initial schedule may be obtained in the same manner or in different manners, and this may not be specifically limited in the present disclosure. For each initial schedule, a cost matrix corresponding to the initial schedule and a preset rule can be obtained. That is, when there are a plurality of initial schedules, each initial schedule can be adjusted to obtain a new schedule corresponding to each initial schedule, and then an optimal new schedule is selected from the new schedules to be used as the schedule finally generated by the scheme disclosed by the disclosure.
Taking the initial schedule 1 as an example, if N preset rules are set, and N is greater than or equal to 1, the initial schedule 1 may correspond to 1 cost matrix generated based on the N preset rules. It can be understood that the cost value of an element in the cost matrix may indicate whether the local mapping relationship in the time unit corresponding to the element meets the requirement of the preset rule.
For example, if N is 1, that is, there are 1 preset rule, the cost value of an element in the cost matrix indicates whether the local mapping relationship satisfies the requirement of the preset rule.
For example, if there are 1 preset lessonsRule 1, the cost matrix of the initial schedule 1 corresponding to the preset rule can be as shown in fig. 2, the cost matrix takes classroom as row, classroom as column and element a11The cost value can indicate whether the local mapping relation of the classroom 1 in class 1 meets a preset rule 1, if so, a11The cost value of (a) may be 0; if not, can be based on element a11The number of times of not meeting the preset rule 1 is calculated11The cost value of (2).
For example, the preset rule is that the courses are mutually exclusive on the same day, i.e. different courses cannot be arranged on the same day, for example, the preset rule 1 in this example is that a physical course, a physical experiment course, a math course cannot be arranged on the same day. When a is11When the content in the corresponding local mapping relation is a physical class, if no physical experiment class or mathematic class is arranged in the same day, the local mapping relation is shown to meet the preset rule 1, a11The cost value of (a) may be 0; if a physical experiment course or a mathematic course is arranged on the same day, the number of times that the local mapping relation does not meet the preset rule 1 is 1, and if the reference cost value of the local mapping relation does not meet the preset rule is 1, a11The cost value of (a) may be 1 x 1; if a physical experiment course and a mathematic course are arranged on the same day, the number of times that the local mapping relation does not meet the preset rule 1 is 2, and then a11The cost value of (a) may be 1 x 2.
The scheme disclosed by the invention has no specific limitation on the calculation modes of the information and the cost values represented by the rows and the columns of the cost matrix, the value of the cost value meeting the preset rule, the value of the reference cost value not meeting the preset rule and the like, and can be determined by combining with the actual application requirements.
For example, if N ≧ 2, that is, there are at least 2 preset rules, the cost value of the element in the cost matrix indicates whether the local mapping relationship satisfies the requirements of the at least 2 preset rules.
Taking course arrangement as an example, if 3 preset rules are set: if rule 1, rule 2, and rule 3 are preset, the cost matrix of the initial schedule 1 corresponding to the preset rule may be as shown in fig. 2, which represents the generationThe price matrix takes classroom as row and class hour as column, and element a11The cost value of (1) can indicate whether the local mapping relation of the classroom 1 in class 1 meets 3 preset rules. As an example, the cost value of an element may be calculated as follows:
first, according to the above description, a descendant price matrix 1 of the initial schedule 1 corresponding to the preset rule 1, a descendant price matrix 2 of the initial schedule 1 corresponding to the preset rule 2, and a descendant price matrix 3 of the initial schedule 1 corresponding to the preset rule 3 can be obtained respectively.
As an example, in an actual application process, the cost value of each element in the sub-cost matrix may also be calculated by combining with the weight corresponding to the preset rule. Taking the above preset rule 1 as an example, if the content in the local mapping relationship of the classroom 1 in the class 1 in the sub-pricing matrix 1 is a physical class, a physical experiment class and a mathematical class are arranged on the same day, that is, the number of times that the local mapping relationship does not satisfy the preset rule 1 is 2, and if the weight corresponding to the preset rule 1 is w1Then element a111Can be embodied as w1*1*2。
Then, based on the 3 sub-cost matrices and the weight corresponding to each preset rule, a cost matrix of the 3 preset rules corresponding to the initial schedule 1 is calculated.
To calculate the element a11For example, if the local mapping relationship of classroom 1 in class 1 meets 3 preset rules, the sub-pricing matrix 1 has the corresponding element a111The cost value of A and the weight corresponding to the preset rule 1 is w1Element a corresponding to the local mapping relationship in the sub-price matrix 2211The cost value of B and the weight corresponding to the preset rule 2 is w2Element a corresponding to the local mapping relationship in the sub-price matrix 3311The cost value of C and the weight corresponding to the preset rule 3 is w3Taking the calculation of a weighted sum as an example, a11The cost value of (A) may be (A w)1+B*w2+C*w3)。
It will be appreciated that in the cost matrix shown in fig. 2, the number of rows may be embodied as the total number of classrooms; the number of columns may be embodied as the total number of hours, e.g., may be the number of days in class per day for the entire school period; alternatively, it may be days of the week by hours of the day, which the present disclosure is not particularly limited.
It can be understood that the preset rule can reflect the generation effect of the schedule to a certain extent, and generally, the more the schedule meets the preset rule, the better the generation effect is. For example, for the same preset rule, the generation effect of the schedule meeting the preset rule is better than that of the schedule not meeting the preset rule; or, in quantity, the generation effect of the schedule meeting more preset rules is better than that of the schedule meeting less preset rules; or, in the priority, the generation effect of the schedule meeting the high-priority preset rule is better than that of the schedule meeting the low-priority preset rule. The expression form of the schedule meeting the preset rule can not be specifically limited by the scheme of the disclosure.
In the practical application process, the preset rule can be set in combination with the use requirement, and the expression form of the preset rule in the scheme of the disclosure is not particularly limited. The following takes lessons as an example to illustrate the preset rules.
1. Preset rules may be set that must be satisfied, which may be referred to collectively below as hard rules.
(1) The teacher conflicts. That is, the same teacher cannot schedule two different courses in the same class.
(2) In a classroom conflict. That is, the same classroom cannot schedule two different courses in the same class.
(3) The classes conflict. That is, the same class cannot schedule two different courses in the same class.
2. Preset rules, hereinafter collectively referred to as soft rules, may be set to be satisfied as much as possible.
(1) Time conflict
As an example, a time conflict may be embodied as a teacher, class, classroom, class, etc. being unable to schedule a class at some particular time.
For example, teacher a needs to attend training at a certain time, so teacher a cannot be scheduled at that time; one class and one shift need to be scheduled at a certain time, so that the class cannot be scheduled for one class and one shift at the time; the 201 classroom has activity at a certain time, so the classroom can not be scheduled for 201 in the time; some classes, such as physical classes, cannot be scheduled for the first class in the morning, so classes cannot be scheduled for physical classes at that time. The presentation form of the time conflict in the scheme of the disclosure is not particularly limited, and can be set by combining with the actual application requirement.
(2) Course conflict
As an example, course conflicts may be embodied as course on-day mutual exclusions. That is, different courses cannot be scheduled on the same day, for example, a physical course, a physical experiment course cannot be scheduled on the same day.
As an example, course conflicts may be embodied as mutual exclusions before and after a course. That is, different courses cannot be linked together, for example, a math course and a physical course cannot be linked together.
The presentation form of the course conflict in the scheme of the disclosure is not particularly limited, and can be set by combining with the actual application requirement.
(3) Special course
As an example, a particular course may be embodied as a course having a requirement for a scheduling time. For example, some courses require scheduling in the morning.
As an example, a special course may be embodied as a continuous course. For example, there are 2 classes in a week.
As an example, a special course may be embodied as a one or two week course. For example, a single week may have a fine art class and a double week may have a music class.
As an example, a special course may be embodied as a joint course. For example, class one and class two may be attended together in a physical class.
The presentation form of the special course can be set by combining the actual application requirement without specific limitation.
(4) Other rules
As an example, other rules may be embodied as teacher timekeeping limits. For example, teacher A cannot go beyond 3 in class one day. The upper limit value of the class time can not be specifically limited by the scheme disclosed by the invention.
As an example, other rules may be embodied as teacher mutual exclusion. That is, multiple teachers cannot schedule courses in the same class, for example, if teacher B goes to listen to teacher A's course, it is necessary to ensure that two teachers do not schedule courses in the same class.
As an example, other rules may be embodied as a teacher composing a course across school zones. I.e. the same teacher schedules courses in different school districts.
The expression form of other rules in the scheme of the disclosure may not be specifically limited, and may be set in combination with the actual application requirements.
For the preset rules, in the actual application process, the priority of each preset rule may also be set, for example, the priority of the hard rule is higher than the priority of the soft rule. In addition, different priorities may be set among a plurality of hard rules and among a plurality of software rules according to actual use requirements, which is not specifically limited in the present disclosure.
As an example, if at least two preset rules are set, the present disclosure may also detect in advance whether a rule conflict exists between the at least two preset rules; if no rule conflict exists, acquiring an initial schedule of the event to be processed; if a rule conflict exists, the user may be prompted to view.
S103, adjusting the local mapping relation in the initial schedule until the cost matrix corresponding to the adjusted schedule meets a preset condition to be used as a new schedule.
As an example, it may be that the cost values of the cost matrix satisfy a preset condition. For example, a value "0" is used to indicate that the local mapping relationship satisfies a preset rule, and the preset condition in the present disclosure may be embodied as that the cost value of the cost matrix is minimum, or that the cost value of the cost matrix is not greater than a preset value. For another example, a numerical value "1" indicates that the local mapping relationship satisfies a preset rule, and the preset condition in the scheme of the present disclosure may be embodied as that the cost value of the cost matrix is the maximum, or the cost value of the cost matrix is not less than a specified value.
As an example, it may be that the number of times of adjustment of the initial schedule satisfies a preset condition. For example, the preset condition may be embodied that the number of times of adjustment per row or per column does not exceed a specified number of times; or the total adjusting times do not exceed the preset times.
The expression form satisfying the preset condition in the present disclosure may not be specifically limited.
In the actual application process, when the initial schedule is adjusted, the local mapping relation to be exchanged can be randomly selected; or, the local mapping relationship having a large influence on the cost value of the matrix may be exchanged preferentially, for example, when the local mapping relationship satisfies the preset rule by using a value "0", if the local mapping relationship corresponding to the element having a large cost value is selected for performing the position exchange, it may be more beneficial to reduce the cost value of the matrix, so that the adjusted cost matrix satisfies the preset condition as soon as possible.
It is understood that, in the practical application process, the rows and columns of the cost matrix may be embodied as different information, which may not be specifically limited by the present disclosure. If the cost matrix shown in fig. 2 is taken as an example, that is, rows of the cost matrix represent different classrooms, and columns of the cost matrix represent different classes, in the present disclosure, adjusting the local mapping relationship in the initial schedule may be embodied as keeping the classrooms unchanged, and adjusting the positions of the elements in the row corresponding to the classrooms, that is, the local mapping relationship corresponding to the elements in the different rows and the different columns may be exchanged once.
Or, if the columns of the cost matrix represent different classrooms and the rows of the cost matrix represent different classes, in the present disclosure, adjusting the local mapping relationship in the initial schedule may be embodied as keeping the classrooms unchanged and adjusting the positions of the elements in the columns corresponding to the classrooms, that is, the local mapping relationship corresponding to the elements in different columns and different rows may be exchanged once.
The following explains the adjustment process of the present disclosure, in which a value "0" indicates that the local mapping relationship satisfies the preset rule.
First, the row to be adjusted is determined. For example, the row to be adjusted may be randomly selected. Or, a row having a large influence on the cost value of the matrix may be preferentially selected as the row to be adjusted. Specifically, the sum of the cost values of the rows may be calculated, and if the sum of the cost values of the row 3, i.e., the row corresponding to the classroom 3, is the largest, the row may be determined as the row to be adjusted.
Secondly, the local mapping relation to be adjusted is determined. For example, the cost values of the elements in row 3 are compared to determine a31、a33And determining the local mapping relationship corresponding to the element with the largest cost value and the second largest cost value as the local mapping relationship to be adjusted.
Then, exchange a31、a33And (4) corresponding local mapping relation. Specifically, a can be31The corresponding local mapping relation 31 is adjusted to the 3 rd class time of the classroom 3, namely the local mapping relation of the 3 rd class time of the classroom 3 is changed and changed into the local mapping relation 31; a is to33The corresponding local mapping 33 is adjusted to the class 1 in classroom 3, that is, the local mapping in class 1 in classroom 3 is changed to the local mapping 33. Thus, element a can be recalculated based on whether the predetermined rule is satisfied31、a33If adjusted, the adjusted offspring value ofIf the sum of the cost values of the elements in the 3 rd row is smaller or the simulated annealing probability is within the preset range, the current adjustment behavior is reasonable, the adjustment can be accepted, and the adjusted local mapping relationship is stored; otherwise, the current adjusting behavior is unreasonable, and a can be restored31、a33And re-determining the next local mapping relationship to be adjusted according to the corresponding local mapping relationship, for example, the next local mapping relationship to be adjusted may be the local mapping relationship corresponding to the element with the largest cost value in the row 3 and the largest cost value in the third row.
Understandably, if the adjustment is accepted, the position of the local mapping relationship in the 3 rd row can be continuously adjusted; or, the sum of the cost values of each row may be recalculated, a new row to be adjusted is determined, and the local mapping relationship is adjusted. The present disclosure may not be particularly limited thereto.
And repeating the steps until the preset conditions are met, so that a new schedule in the scheme disclosed by the invention can be obtained.
For the simulated annealing probability in the disclosed solution, the following explanation can be made:
according to the thermodynamic principle, at a temperature T, the probability of the occurrence of a drop in energy with a difference of dE is P (dE), which can be expressed as: p (dE) ═ exp (dE/(kT)), where k is a constant, exp denotes a natural exponent, and dE < 0. From the above formula, the higher the temperature T is, the greater the probability of the occurrence of temperature decrease with an energy difference of dE is; the lower the temperature T, the lower the probability of a drop in temperature with an energy difference dE. In addition, dE is less than 0, so dE/kT is less than 0, and the value range of the simulated annealing probability P (dE) is (0, 1).
Corresponding to the scheme, T can represent the cost value of the cost matrix, after the local mapping relation is adjusted every time, the current simulated annealing probability can be calculated according to the cost value of the cost matrix corresponding to the schedule obtained through adjustment, and if the current simulated annealing probability is within the preset range, the adjustment can be accepted.
In conclusion, the schedule which meets the requirements of practical application can be generated by combining the preset rules, the generation process is less influenced by the schedule complexity and the human experience, and the generation efficiency and the generation effect of the schedule are improved.
As introduced above, when there are a plurality of initial schedules, a plurality of new schedules can be obtained, and as an example, an optimal new schedule can be selected from the plurality of new schedules as a schedule finally generated by the present disclosure at least in the following manner: calculating the cost value of the cost matrix corresponding to each new schedule, and if the local mapping relation is represented by a numerical value of 0 to meet a preset rule, determining the new schedule corresponding to the cost matrix with the minimum cost value as the finally generated schedule; calculating the number of preset rules which are met in each new schedule, and determining the new schedule which meets the preset rules with the largest number as a finally generated schedule; or, the rule satisfaction rate may be calculated by using the number of the preset rules that have been satisfied and the total number of the preset rules, and the new schedule with the highest satisfaction rate is determined as the schedule that is finally generated.
As an example, the present disclosure further provides a method for generating an initial schedule, and the specific process can refer to the flowchart shown in fig. 3. May include the steps of:
s201, acquiring a global mapping relation among the personnel, the places and the contents corresponding to the event to be processed.
S202, dividing the content corresponding to each person into a specified time period according to the global mapping relation and the priority of the content, wherein the specified time period comprises at least one time unit.
S203, dividing the content corresponding to each person in the specified time period into each time unit according to the priority of the person or the priority of the content to obtain the initial schedule. As an example, the priority of the content may be set manually. Alternatively, the priority of the content may be determined as follows: acquiring a preset rule corresponding to the content; and determining the priority of the content based on the preset rules corresponding to the content and the weight of each preset rule.
It can be understood that the preset rule corresponding to the content may include a preset rule corresponding to the content itself; or, the content may further include a preset rule corresponding to a person and a place having a mapping relationship with the content in the global mapping relationship. Taking a course arrangement as an example, if the content is a mathematical course, in the global mapping relationship, the personnel having a mapping relationship with the content are teacher a and class one by class, and the location is 201 classrooms, if the mathematical course itself corresponds to 2 preset rules, the teacher a corresponds to 3 preset rules, the class one by class one corresponds to 1 preset rule, and the 201 classrooms correspond to 1 preset rule, in the actual application process, the priority of the mathematical course can be determined based on the 2 preset rules corresponding to the mathematical course itself; or, the priority of the mathematical class may also be determined based on the 7 preset rules, which may not be specifically limited by the present disclosure.
As an example, a corresponding weight may be set in advance for each preset rule, and the priority of the content may be obtained by calculating a weighted sum. In general, the greater the value of the weighted sum corresponding to a content, the greater the difficulty of course arrangement, and thus the higher the priority of the content. For example, the number of the preset rules to be satisfied and the weight of the preset rules may be used for weighting and calculating, for example, the preset rule 1 corresponding to the mathematical class is a class, the number to be satisfied is 2 classes in one week, and the weight is q1(ii) a The preset rule 2 corresponding to the math class is a class-on class, the number required to be met is that no class-on class exists in one week, and the corresponding weight is q2Then the priority of the math lesson can be embodied as (2 x q)1+0*q2)。
As an example, the priority of the person may be set manually. Alternatively, the priority of the person may be determined in the following manner: and acquiring content having a global mapping relation with the personnel, and determining the priority of the personnel according to the priority of the content. Or if the arranged personnel with the determined local mapping relation exist, determining the priority of the personnel according to the coupling degree between the personnel and the arranged personnel.
Taking class arrangement as an example, if the personnel is the class of the student, all the classes corresponding to each class can be determined based on the global mapping relationship, and then the priority of each class is obtained based on the determined classes. For example, if the person is a class and a class, and the contents of the mapping relationship with the person in the global mapping relationship are a math class and a Chinese class, the class and class can be determined according to the priorities of the 2 classes.
As an example, the priority of a course may be embodied as a value of the weighted sum of the courses, and the specific calculation process may be described above. For example, the priority of a class can be calculated by using the number of classes, the value of the weighted sum of the classes, for example, the number of math classes corresponding to one class in a year is m1The value of the weighted sum is s1(ii) a The number of the Chinese lessons corresponding to one grade and one shift is m2The value of the weighted sum is s2Then the priority of class one to class one can be embodied as (m)1*s1+m2*s2)。
Taking class scheduling as an example, if the person is embodied as the class of the student, if there is a scheduled class of which the local mapping relationship has been determined, that is, the class is scheduled completely, the priority of each non-scheduled class may be determined based on the coupling degree between the scheduled class and the non-scheduled class. Generally, the higher the coupling degree between the scheduled class and the unscheduled class, the higher the possibility of the clashing of the scheduled class and the unscheduled class, the more difficult the scheduling of the unscheduled class, and therefore, the higher the priority of the unscheduled class. For example, if the class one-year-one class is a scheduled class, the class two-year-one class and the class three-year-one class are not scheduled classes, and if the class one-year-one class and the class two-year need to occupy the same classroom and the class one-year-one class and the class three-year need to occupy different classrooms, the degree of coupling between the class one-year-one class and the class two-year is higher than that between the class one-year-one class and the class three-year, that is, the class scheduling difficulty of the class two-year is higher than that of the class three-year in terms of classroom occupancy, so that the class two-year priority can be determined to be higher than that of the class one-year-one class. It is understood that the information for determining the degree of coupling between the classes may be determined according to practical application requirements, which may not be specifically limited by the present disclosure.
In combination with the practical application, the specified time period in the present disclosure may be embodied as one day, one week, and the like, and this may not be specifically limited in the present disclosure. Taking course arrangement as an example, if the designated time period is one day, dividing the content corresponding to each person into the designated time periods can be understood as determining what class each day needs to be taken by each class, i.e., performing course division processing. Generally, the higher the priority of the course is, the more difficult the course arrangement is, and the course division processing can be performed on the course with the high priority first.
For example, if the priority of a mathematical class is higher than that of a Chinese class, the global mapping relationship can be combined to determine the mathematical class required by each class every day; and then, determining the Chinese lessons of each class which are required every day by combining the global mapping relation. By analogy, all courses are distributed to each day, and finally the required courses of each class on each day can be obtained.
As an example, when the course division processing is performed, besides the priority of the course, the preset rule may be considered appropriately, so that the initial schedule satisfies the preset rule as much as possible, which is helpful to improve the adjustment efficiency of the subsequent initial schedule.
As an example, in order to optimize the effect of generating the schedule, when the class division processing is performed, the principles of class hour distribution average, classroom distribution average, teacher distribution average, and the like may be satisfied as much as possible. For example, the class hour distribution average can be understood as that, if there are 5 class hours of mathematics in each week in a class-one class, the mathematical classes can be distributed to each day as evenly as possible; classroom distribution averaging it can be understood that 201 classroom with 30 class courses per week can be equally distributed to each day as much as possible; teacher A may be assigned as evenly as possible to each day if teacher A has 5 sessions per week.
After the course dividing treatment is finished, the courses can be arranged for each class in turn according to the priority of the class based on the course dividing result. In the practical application process, courses can be arranged randomly as long as the requirement of course division results is met; or, lessons can be arranged by combining with preset rules, generally, the more the lessons are arranged, the better the generation effect of the obtained initial schedule is, and the higher the adjustment efficiency of the subsequent initial schedule is.
For example, a teacher a attends a math class in 201 classrooms, one class and two classes, and if the preset rules corresponding to the math class are that the class is scheduled in the morning, the preset rules corresponding to the teacher a are that the class cannot attend the second class in monday. If the priority of the class one at one grade is higher than that of the class two at one grade, the mathematical classes can be arranged at the first class time, the third class time and the fourth class time of the week according to the class dividing result of the class one at one grade, for example, the mathematical classes are arranged at the first class time of the week, the class is arranged at the second class time of the year, and the mathematical classes can be arranged at the third class time and the fourth class time of the week, for example, the mathematical classes are arranged at the fourth class time of the week. Thus, the local mapping relationship in two time units in the initial calendar can be embodied as:
the local mapping relationship of the first class of Monday is as follows: teacher A, class one, mathematics class, 201 classroom;
the local mapping relationship of the fourth session of Monday is as follows: teacher A, class one and class two, mathematics class, 201 classroom.
In conclusion, the initial schedule can be obtained after the course arrangement is completed according to the course division results of all classes.
It is understood that, after completing the course dividing process, the method can also be based on the course dividing result and the priority of the teacher; or the lessons are arranged for each class in turn based on the lesson division result and the class priority, and the specific process can be described by referring to the above and is not illustrated here.
Referring to fig. 4, a schematic diagram of the composition of the calendar generation apparatus of the present disclosure is shown. The apparatus may include:
an initial schedule obtaining module 301, configured to obtain an initial schedule of an event to be processed, where the initial schedule is used to record local mapping relationships of people, places, and contents corresponding to the event to be processed in at least two time units;
a cost matrix obtaining module 302, configured to obtain a cost matrix corresponding to a preset rule to the initial schedule, where a cost value of an element in the cost matrix is used to indicate whether a local mapping relationship in a time unit corresponding to the element meets the preset rule;
and a schedule adjusting module 303, configured to adjust the local mapping relationship in the initial schedule until a cost matrix corresponding to the adjusted schedule meets a preset condition, and use the adjusted schedule as a new schedule.
Optionally, the initial schedule obtaining module includes:
the global mapping relation acquisition module is used for acquiring a global mapping relation among personnel, places and contents corresponding to the event to be processed;
the mapping relation dividing module is used for dividing the content corresponding to each person into a specified time period according to the global mapping relation and the priority of the content, and the specified time period comprises at least one time unit; and dividing the content corresponding to each person in the specified time period into each time unit according to the priority of the person or the priority of the content to obtain the initial schedule.
Optionally, the initial schedule obtaining module further includes:
the content priority determining module is used for acquiring a preset rule corresponding to the content; and determining the priority of the content based on the preset rules corresponding to the content and the weight of each preset rule.
Optionally, the initial schedule obtaining module further includes:
the personnel priority determining module is used for acquiring the content having the global mapping relation with the personnel and determining the priority of the personnel according to the priority of the content;
or,
and the personnel priority determining module is used for determining the priority of the personnel according to the coupling degree between the personnel and the arranged personnel when the arranged personnel with the determined local mapping relation exist.
Optionally, if N is 1 preset rule, the cost matrix obtaining module is configured to determine a cost value of each element according to whether a local mapping relationship in a time unit corresponding to the element satisfies the preset rule, and obtain a cost matrix of the initial schedule corresponding to the N preset rules;
if N is more than or equal to 2 preset rules, the cost matrix obtaining module is used for obtaining a sub-cost matrix of the initial schedule corresponding to the current preset rule according to whether the local mapping relation in the time unit corresponding to the element meets the current preset rule; and obtaining a cost matrix of the initial schedule corresponding to the N preset rules based on the sub-cost matrixes and the weight of each preset rule.
Optionally, the place is used as a row or a column of the cost matrix, then
And the schedule adjusting module is used for keeping the place unchanged and adjusting the local mapping relation corresponding to the element in the row or the column where the place is located.
Optionally, if at least two preset rules are set, the apparatus further includes:
the rule conflict detection module is used for detecting whether a rule conflict exists between the at least two preset rules;
the initial schedule obtaining module is used for obtaining the initial schedule of the event to be processed when no rule conflict exists.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
Referring to fig. 5, a schematic diagram of an electronic device 400 for calendar generation according to the present disclosure is shown. The electronic device 400 may include at least a processor 401 and a storage medium 402, and as an example, the processor 401 and the storage medium 402 may be connected by a bus or other means, and the connection by the bus is illustrated in fig. 5 as an example. The number of the processors 401 may be one or more, and one processor is illustrated in fig. 5 as an example. The storage medium 402 represents a storage device resource for storing instructions, such as application programs, that are executable by the processor 401. Further, the processor 401 may be configured to load instructions in a storage medium to perform the above-described calendar generation method.
The preferred embodiments of the present disclosure are described in detail with reference to the accompanying drawings, however, the present disclosure is not limited to the specific details of the above embodiments, and various simple modifications may be made to the technical solution of the present disclosure within the technical idea of the present disclosure, and these simple modifications all belong to the protection scope of the present disclosure.
It should be noted that, in the foregoing embodiments, various features described in the above embodiments may be combined in any suitable manner, and in order to avoid unnecessary repetition, various combinations that are possible in the present disclosure are not described again.
In addition, any combination of various embodiments of the present disclosure may be made, and the same should be considered as the disclosure of the present disclosure, as long as it does not depart from the spirit of the present disclosure.
Claims (13)
1. A method of generating a calendar, the method comprising:
acquiring an initial schedule of a to-be-processed event, wherein the initial schedule is used for recording local mapping relations of personnel, places and contents corresponding to the to-be-processed event in at least two time units;
obtaining a cost matrix of the initial schedule corresponding to a preset rule, wherein a cost value of an element in the cost matrix is used for indicating whether a local mapping relation in a time unit corresponding to the element meets the preset rule or not;
and adjusting the local mapping relation in the initial schedule until the cost matrix corresponding to the adjusted schedule meets the preset condition to be used as a new schedule.
2. The method of claim 1, wherein obtaining an initial schedule of pending events comprises:
acquiring a global mapping relation among personnel, places and contents corresponding to the event to be processed;
according to the global mapping relation and the priority of the content, dividing the content corresponding to each person into a specified time period, wherein the specified time period comprises at least one time unit;
and dividing the content corresponding to each person in the specified time period into each time unit according to the priority of the person or the priority of the content to obtain the initial schedule.
3. The method of claim 2, wherein the priority of the content is obtained by:
acquiring a preset rule corresponding to the content;
and determining the priority of the content based on the preset rules corresponding to the content and the weight of each preset rule.
4. The method of claim 2, wherein the priority of the person is obtained by:
acquiring content having a global mapping relation with the personnel, and determining the priority of the personnel according to the priority of the content;
or,
and if the arranged personnel with the determined local mapping relation exist, determining the priority of the personnel according to the coupling degree between the personnel and the arranged personnel.
5. The method according to claim 1, wherein the obtaining a cost matrix of the initial schedule corresponding to a preset rule comprises:
if the preset rule is set to be N-1, determining the cost value of each element according to whether the local mapping relation in the time unit corresponding to the element meets the preset rule or not, and obtaining a cost matrix of the initial schedule corresponding to the N preset rules;
if N is more than or equal to 2 preset rules, obtaining a sub price matrix of the initial schedule corresponding to the current preset rule according to whether the local mapping relation in the time unit corresponding to the element meets the current preset rule; and obtaining a cost matrix of the initial schedule corresponding to the N preset rules based on the sub-cost matrixes and the weight of each preset rule.
6. The method according to claim 1, wherein the adjusting the local mapping relationship in the initial calendar with the place as a row or a column of the cost matrix comprises:
and keeping the location unchanged, and adjusting the local mapping relation corresponding to the element in the row or the column where the location is located.
7. The method according to any one of claims 1 to 6, wherein if at least two preset rules are set, before the obtaining of the initial schedule of pending events, the method further comprises:
detecting whether a rule conflict exists between the at least two preset rules;
and if no rule conflict exists, acquiring the initial schedule of the event to be processed.
8. A calendar generation apparatus, the apparatus comprising:
the system comprises an initial schedule acquisition module, a processing module and a processing module, wherein the initial schedule acquisition module is used for acquiring an initial schedule of a to-be-processed event, and the initial schedule is used for recording the local mapping relations of personnel, places and contents corresponding to the to-be-processed event in at least two time units;
a cost matrix obtaining module, configured to obtain a cost matrix corresponding to a preset rule to the initial schedule, where a cost value of an element in the cost matrix is used to indicate whether a local mapping relationship in a time unit corresponding to the element meets the preset rule;
and the schedule adjusting module is used for adjusting the local mapping relation in the initial schedule until the cost matrix corresponding to the adjusted schedule meets the preset condition and is used as a new schedule.
9. The apparatus of claim 8, wherein the initial calendar acquisition module comprises:
the global mapping relation acquisition module is used for acquiring a global mapping relation among personnel, places and contents corresponding to the event to be processed;
the mapping relation dividing module is used for dividing the content corresponding to each person into a specified time period according to the global mapping relation and the priority of the content, and the specified time period comprises at least one time unit; and dividing the content corresponding to each person in the specified time period into each time unit according to the priority of the person or the priority of the content to obtain the initial schedule.
10. The apparatus of claim 8,
if the preset rule is set to be 1, the cost matrix obtaining module is used for determining the cost value of each element according to whether the local mapping relation in the time unit corresponding to the element meets the preset rule or not, and obtaining a cost matrix of the initial schedule corresponding to the N preset rules;
if N is more than or equal to 2 preset rules, the cost matrix obtaining module is used for obtaining a sub-cost matrix of the initial schedule corresponding to the current preset rule according to whether the local mapping relation in the time unit corresponding to the element meets the current preset rule; and obtaining a cost matrix of the initial schedule corresponding to the N preset rules based on the sub-cost matrixes and the weight of each preset rule.
11. The apparatus according to any one of claims 8 to 10, wherein if at least two preset rules are set, the apparatus further comprises:
the rule conflict detection module is used for detecting whether a rule conflict exists between the at least two preset rules;
the initial schedule obtaining module is used for obtaining the initial schedule of the event to be processed when no rule conflict exists.
12. A storage medium having stored thereon a plurality of instructions, wherein the instructions are loadable by a processor and adapted to cause execution of the steps of the method according to any of claims 1 to 7.
13. An electronic device, characterized in that the electronic device comprises;
the storage medium of claim 12; and
a processor to execute the instructions in the storage medium.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810570415.0A CN108764855A (en) | 2018-06-05 | 2018-06-05 | Schedule generation method and device, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810570415.0A CN108764855A (en) | 2018-06-05 | 2018-06-05 | Schedule generation method and device, storage medium and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108764855A true CN108764855A (en) | 2018-11-06 |
Family
ID=64000094
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810570415.0A Pending CN108764855A (en) | 2018-06-05 | 2018-06-05 | Schedule generation method and device, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108764855A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112418793A (en) * | 2020-11-19 | 2021-02-26 | 维沃移动通信有限公司 | Schedule management method and device and electronic equipment |
| TWI721434B (en) * | 2019-04-30 | 2021-03-11 | 新加坡商鴻運科股份有限公司 | System and method of arranging meeting agenda items, computer device, and storage device |
| CN114330990A (en) * | 2021-11-16 | 2022-04-12 | 国网江苏省电力有限公司管理培训中心 | Class scheduling method and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN204347918U (en) * | 2014-10-16 | 2015-05-20 | 正方软件股份有限公司 | A kind of Course Arrangement device |
| CN104794666A (en) * | 2015-04-30 | 2015-07-22 | 重庆大学 | Courses arrangement algorithm |
| CN106203712A (en) * | 2016-07-12 | 2016-12-07 | 杭州源中通信技术有限公司 | Optimal Decision-making guide systems based on big data |
| CN107610012A (en) * | 2017-09-22 | 2018-01-19 | 皇晓琳 | A kind of curricula-variable and Course Arrangement and its curricula-variable and cource arrangement method |
-
2018
- 2018-06-05 CN CN201810570415.0A patent/CN108764855A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN204347918U (en) * | 2014-10-16 | 2015-05-20 | 正方软件股份有限公司 | A kind of Course Arrangement device |
| CN104794666A (en) * | 2015-04-30 | 2015-07-22 | 重庆大学 | Courses arrangement algorithm |
| CN106203712A (en) * | 2016-07-12 | 2016-12-07 | 杭州源中通信技术有限公司 | Optimal Decision-making guide systems based on big data |
| CN107610012A (en) * | 2017-09-22 | 2018-01-19 | 皇晓琳 | A kind of curricula-variable and Course Arrangement and its curricula-variable and cource arrangement method |
Non-Patent Citations (1)
| Title |
|---|
| 唐环等: ""在中学排课问题中实用的模拟退火算法应用"", 《计算机系统应用》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI721434B (en) * | 2019-04-30 | 2021-03-11 | 新加坡商鴻運科股份有限公司 | System and method of arranging meeting agenda items, computer device, and storage device |
| CN112418793A (en) * | 2020-11-19 | 2021-02-26 | 维沃移动通信有限公司 | Schedule management method and device and electronic equipment |
| CN114330990A (en) * | 2021-11-16 | 2022-04-12 | 国网江苏省电力有限公司管理培训中心 | Class scheduling method and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Nagel et al. | The ABCs of managing teacher stress | |
| Thompson et al. | Counselor-in-Training Perceptions of Supervision Practices Related to Self-Care and Burnout. | |
| Finn et al. | Using WatchMinder to increase the on-task behavior of students with autism spectrum disorder | |
| CN108764855A (en) | Schedule generation method and device, storage medium and electronic equipment | |
| Gould et al. | The evolution of peer education: Where do we go from here? | |
| Jackson et al. | Self‐directed digital learning: when do dental students study? | |
| Shi et al. | Beyond business as usual: radiology residency educational response to the COVID-2019 pandemic | |
| Navabi-Shirazi et al. | Multicriteria course mode selection and classroom assignment under sudden space scarcity | |
| Laguador et al. | Time Management and Teaching Performance among Maritime and Engineering Faculty Members: Basis for an Intervention Plan | |
| JP5843902B2 (en) | Care staff career path formation device | |
| WO2018029642A1 (en) | Scenario based scheduling system with predictive intelligence | |
| Ezhovkina et al. | Psychological and Pedagogic Support of Children with Health Limitations. | |
| Parente et al. | Development of a cognitive strategies group for vocational training after traumatic brain injury | |
| Licari et al. | Developing a group practice comprehensive care education curriculum | |
| Smojver Ažić et al. | Adjustment to college and the student mentoring programme | |
| JP6395159B2 (en) | Education plan creation support apparatus and education plan creation method | |
| Bowers et al. | Concentration and the variability of orthopaedic demand | |
| Cherry et al. | A Plan for Academic Success: Helping Academically Dismissed Students Achieve Their Goals. | |
| Corriere et al. | Overnight call: a survey of medical student experiences, attitudes, and skills | |
| JP6661139B1 (en) | Information processing apparatus and information processing method | |
| Abdelfattah et al. | Automated academic schedule builder for University’s faculties | |
| JP2021026215A (en) | Information processor and information processing method | |
| Gancheva et al. | Self-care and self-compassion education for undergraduate nursing students: An innovative approach | |
| Flanagan et al. | A facility-wide consultation and training team as a catalyst in promoting institutional change | |
| JP7458123B1 (en) | Learning Support System |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181106 |