CN114662817A - Scheduling method and device - Google Patents
Scheduling method and device Download PDFInfo
- Publication number
- CN114662817A CN114662817A CN202011534059.0A CN202011534059A CN114662817A CN 114662817 A CN114662817 A CN 114662817A CN 202011534059 A CN202011534059 A CN 202011534059A CN 114662817 A CN114662817 A CN 114662817A
- Authority
- CN
- China
- Prior art keywords
- scheduling
- shift
- scheduled
- current
- objects
- 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 48
- 230000004044 response Effects 0.000 claims abstract description 20
- 238000004891 communication Methods 0.000 claims description 19
- 238000012216 screening Methods 0.000 claims description 17
- 238000004590 computer program Methods 0.000 claims description 14
- 238000010586 diagram Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 5
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 3
- 238000004519 manufacturing process Methods 0.000 description 2
- 241001522296 Erithacus rubecula Species 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Data Mining & Analysis (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a scheduling method and a scheduling device. The method comprises the steps of obtaining a scheduling request aiming at the current time period, wherein the scheduling request comprises attribute information, scheduling rules and shift configuration information of an object to be scheduled; the current time period comprises a plurality of shift scheduling cycles; acquiring historical scheduling information of a preset number of adjacent historical scheduling periods before the current scheduling period in the current time period, wherein the historical scheduling information comprises at least two categories of scheduling information corresponding to each target object, and the target object is at least one of objects to be scheduled; aiming at the current scheduling period, scheduling the objects to be scheduled according to the scheduling configuration information, the scheduling rules and the historical scheduling information to generate the scheduling information of the current scheduling period; and outputting a scheduling response comprising the scheduling information of the current time period based on the scheduling information of each scheduling period in the current time period. The method can automatically generate the scheduling information of the current time period according to the provided information, and improves the scheduling efficiency.
Description
Technical Field
The application relates to the technical field of computers, in particular to a scheduling method and device.
Background
In order to ensure normal and orderly daily life of people, related units in the industry fields of electric power, water power, traffic scheduling and the like need to have a work object to be monitored on a work post; in order to ensure the productivity, such as the normal operation of an enterprise system, or the realization of uninterrupted production, and ensure that products can be sufficiently supplied, a work object is also required to be monitored on a work post. Therefore, it is necessary to determine a shift schedule for a certain period of time according to the shift and the shift object, for example, a shift schedule for each week or each month, so as to reasonably schedule the shift for each shift object in the week or the month.
However, at present, the scheduling list can only be arranged manually by a specially-assigned person, the scheduling complexity greatly increases with the increase of objects and the number of shifts, and the scheduling efficiency is low.
Disclosure of Invention
The embodiment of the application provides a scheduling method and a scheduling device, which solve the problems in the prior art and improve the scheduling efficiency.
In a first aspect, a shift scheduling method is provided, which may include:
acquiring a scheduling request aiming at the current time period, wherein the scheduling request comprises attribute information, scheduling rules and shift configuration information of an object to be scheduled; the current time period comprises a plurality of shift cycles;
acquiring historical scheduling information of a preset number of adjacent historical scheduling periods before the current scheduling period in the current time period, wherein the historical scheduling information comprises at least two categories of scheduling information corresponding to each target object, and the target object is at least one of the objects to be scheduled;
aiming at the current scheduling period, scheduling the objects to be scheduled according to the shift configuration information, the scheduling rules and the historical scheduling information to generate the scheduling information of the current scheduling period;
outputting a scheduling response based on the scheduling information of each scheduling period in the current time period, wherein the scheduling response comprises the scheduling information of the current time period.
In one possible implementation, each scheduling period in the scheduling information includes at least one class of shift, and one object to be scheduled in each scheduling period corresponds to one shift.
In one possible implementation, the scheduling rules include a round-robin rule for each class shift and a rule that the number of consecutive rest days is not less than a preset threshold; the shift configuration information comprises the time of different classes of shifts and the number of objects corresponding to the corresponding classes;
aiming at the current scheduling period, scheduling the objects to be scheduled according to the shift configuration information, the scheduling rules and the historical scheduling information, and generating the scheduling information of the current scheduling period, wherein the scheduling information comprises:
determining the time of each class of shift and the number of objects of the corresponding shift according to the shift configuration information;
aiming at the current scheduling period, screening candidate objects to be scheduled which meet the scheduling rules from the objects to be scheduled according to the shift information of at least two categories in the historical scheduling information;
according to the time sequence of different classes of shifts, for the to-be-scheduled shifts of the current class, selecting a working object meeting the number of the objects of the current class from the candidate to-be-scheduled objects, and generating scheduling information of the current scheduling period; when the current to-be-scheduled work is the initial to-be-scheduled work, the candidate to-be-scheduled work is the to-be-scheduled work, and the previous to-be-scheduled work is empty.
In one possible implementation, the method further comprises:
acquiring an adjustment request of a first object to be scheduled; the adjustment request comprises a shift adjustment type and a corresponding adjustment time period; the first object to be scheduled is any one of the objects to be scheduled;
according to the time sequence of different classes of shifts, for the to-be-scheduled shifts of the current class, selecting the working objects meeting the number of the objects of the current class from the candidate to-be-scheduled objects, and generating the scheduling information of the current scheduling period, wherein the method comprises the following steps:
determining a first target category of the shift to be arranged corresponding to the adjusting time period;
determining the number of to-be-scheduled shifts corresponding to the first target category as the current number of to-be-scheduled shifts;
and according to the time sequence of different classes of shifts, for the current shift to be scheduled, screening out the working objects meeting the number of the objects of the current shift from the candidate shift to be scheduled objects of which the first shift to be scheduled object is deleted, and generating the shift scheduling information of the current shift period.
In one possible implementation, the shift schedule rules further include special shift rules; the special shift rule is a shift category of a second object to be shifted within a target time period, a shift category of the second object not to be shifted within the target time period, or a shift category of the second object not to receive an adjustment request within the target time period, and the second object to be shifted is at least one object to be shifted in the objects to be shifted; the target time period is less than the current time period;
according to the time sequence of different classes of shifts, for the to-be-scheduled shifts of the current class, selecting the working objects meeting the number of the objects of the current class from the candidate to-be-scheduled objects, and generating the scheduling information of the current scheduling period, wherein the method comprises the following steps:
determining a second target category of the shift to be arranged corresponding to the target time period;
determining the number of to-be-scheduled shifts corresponding to the second target category as the current number of to-be-scheduled shifts;
and according to the time sequence of the shifts of different classes, for the current shift to be scheduled, screening out the working objects meeting the number of the objects of the current class from the candidate shift to be scheduled objects of the second shift to be scheduled object, and generating the shift scheduling information of the current shift scheduling period.
In one possible implementation, the class of shift includes a shift class and a rest class;
wherein the scheduling category comprises at least one category of an early shift category, a middle shift category and a late shift category.
In one possible implementation, after outputting a shift scheduling response based on the shift scheduling information of each shift scheduling cycle in the current time period, the method further includes:
acquiring the total number of the different classes in the current time period;
determining the quotient of the total number of the shifts and the objects to be scheduled as the average shift value of each object to be scheduled;
if the total shift times of a third shift object in the shift scheduling information of the current time period is not less than the average shift time value, determining the obtained shift scheduling information as the target shift scheduling information of the current time period;
if the total number of the shifts of a third object to be scheduled in the scheduling information of the current time period is smaller than the average shift value, modifying the shifts of a preset number of rest categories of the third object to be scheduled in the acquired scheduling information into the shift of the scheduling category; determining the modified scheduling information as the target scheduling information of the current time period;
the third object to be scheduled is any one of the objects to be scheduled; the preset number is the difference value between the average shift number and the total shift number of the third object to be scheduled.
In a second aspect, a shift arrangement is provided, which may include: an acquisition unit, a generation unit and an output unit;
the acquiring unit is used for acquiring a scheduling request aiming at the current time period, wherein the scheduling request comprises attribute information, a scheduling rule and shift configuration information of an object to be scheduled; the current time period comprises a plurality of shift cycles;
acquiring historical scheduling information of a preset number of historical scheduling periods adjacent to the current scheduling period in the current time period, wherein the historical scheduling information comprises at least two categories of scheduling information corresponding to each target object, and the target object is at least one of the objects to be scheduled;
the generating unit is used for scheduling the objects to be scheduled according to the shift configuration information, the scheduling rules and the historical scheduling information aiming at the current scheduling period, and generating the scheduling information of the current scheduling period;
the output unit is used for outputting a scheduling response based on the scheduling information of each scheduling cycle in the current time period, and the scheduling response comprises the scheduling information of the current time period.
In a possible implementation, each shift cycle in the shift scheduling information includes at least one class of shift, and one object to be shifted in each shift cycle corresponds to one shift.
In one possible implementation, the apparatus further comprises a determining unit and a screening unit; the scheduling rules comprise a duty-change rule of each class of shift and a rule that the number of continuous rest days is not less than a preset threshold value; the shift configuration information comprises the time of different classes of shifts and the number of objects corresponding to the corresponding classes;
the determining unit is used for determining the time of each class of shift and the number of objects of the corresponding shift according to the shift configuration information;
the screening unit is used for screening candidate objects to be scheduled which meet the scheduling rules from the objects to be scheduled according to the shift information of at least two categories in the historical scheduling information aiming at the current scheduling period;
the generating unit is further configured to, according to the time sequence of the different classes of shifts, for the to-be-scheduled shifts of the current class, screen out a work object satisfying the number of objects of the current class from the candidate to-be-scheduled objects, and generate scheduling information of the current scheduling period; when the current to-be-scheduled shift is an initial to-be-scheduled shift, the candidate to-be-scheduled shift object is the to-be-scheduled shift object, and the previous to-be-scheduled shift is empty.
In a possible implementation, the obtaining unit is further configured to obtain an adjustment request of the first object to be scheduled; the adjustment request comprises a shift adjustment type and a corresponding adjustment time period; the first object to be scheduled is any one object to be scheduled in the objects to be scheduled;
the determining unit is further configured to determine a first target category of the to-be-scheduled shift corresponding to the adjustment time period;
determining the number of to-be-scheduled shifts corresponding to the first target category as the current number of to-be-scheduled shifts;
the generating unit is further configured to, for a current to-be-scheduled shift, screen out a work object satisfying the number of objects of the current shift from candidate to-be-scheduled objects from which the first to-be-scheduled object is deleted according to a time sequence of shifts of different categories, and generate the scheduling information of the current scheduling period.
In one possible implementation, the shift schedule rules further include special shift rules; the special shift rule is a shift category of a second object to be shifted within a target time period, a shift category of the second object not to be shifted within the target time period, or a shift category of the second object not to receive an adjustment request within the target time period, and the second object to be shifted is at least one object to be shifted in the objects to be shifted; the target time period is less than the current time period;
the determining unit is further configured to determine a second target category of the to-be-scheduled shift corresponding to the target time period;
determining the number of to-be-scheduled shifts corresponding to the second target category as the current number of to-be-scheduled shifts;
the generating unit is further configured to, according to the time sequence of the different classes of shifts, for the current to-be-scheduled shift, screen out a work object that meets the number of objects in the current shift class from the candidate to-be-scheduled objects from which the second to-be-scheduled object is deleted, and generate the scheduling information of the current scheduling period.
In one possible implementation, the class of shift includes a shift class and a rest class;
wherein the shift scheduling category comprises at least one of an early shift category, a middle shift category and a late shift category.
In a possible implementation, the obtaining unit is further configured to obtain total number of shifts of different shift categories in the current time period;
the determining unit is further configured to determine a quotient of the total number of shifts and the objects to be scheduled as an average shift value of each object to be scheduled;
if the total shift times of a third shift object in the shift information of the current time period is not less than the average shift time value, determining the obtained shift information as the target shift information of the current time period;
if the total number of the shifts of a third object to be scheduled in the scheduling information of the current time period is smaller than the average shift value, modifying the shifts of a preset number of rest categories of the third object to be scheduled in the acquired scheduling information into the shift of the scheduling category; determining the modified scheduling information as the target scheduling information of the current time period;
the third object to be scheduled is any one of the objects to be scheduled; the preset number is the difference value between the average shift number and the total shift number of the third object to be scheduled.
In a third aspect, an electronic device is provided, which includes a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory complete communication with each other through the communication bus;
a memory for storing a computer program;
a processor adapted to perform the method steps of any of the above first aspects when executing a program stored in the memory.
In a fourth aspect, a computer-readable storage medium is provided, having stored therein a computer program which, when executed by a processor, performs the method steps of any of the above first aspects.
The scheduling method provided by the embodiment of the invention obtains a scheduling request aiming at the current time period, wherein the scheduling request comprises attribute information, scheduling rules and shift configuration information of an object to be scheduled; the current time period comprises a plurality of shift scheduling cycles; acquiring historical scheduling information of a preset number of adjacent historical scheduling periods before the current scheduling period in the current time period, wherein the historical scheduling information comprises at least two categories of scheduling information corresponding to each target object, and the target object is at least one of objects to be scheduled; aiming at the current scheduling period, scheduling the objects to be scheduled according to the scheduling configuration information, the scheduling rules and the historical scheduling information to generate the scheduling information of the current scheduling period; and outputting a scheduling response based on the scheduling information of each scheduling period in the current time period, wherein the scheduling response comprises the scheduling information of the current time period. The method can automatically generate the scheduling information of the current time period according to the provided information, and improves the scheduling efficiency.
Drawings
Fig. 1 is a schematic flow chart of a scheduling method according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a shift scheduling device according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present application without any creative effort belong to the protection scope of the present application.
In the description of the present application, it is noted that the terms "first", "second", "third", and "fourth" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
The preferred embodiments of the present application will be described below with reference to the accompanying drawings of the specification, it being understood that the preferred embodiments described herein are merely for illustrating and explaining the present invention and are not intended to limit the present invention, and that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
Fig. 1 is a schematic flow chart of a scheduling method according to an embodiment of the present invention. As shown in fig. 1, the method may include:
and step 110, acquiring a scheduling request aiming at the current time period.
The scheduling request may include attribute information, scheduling rules, and shift configuration information of the object to be scheduled, and the current time period includes a plurality of scheduling cycles.
For example, the current time period may be one month, with each shift period being each day of the one month. Taking 12 months, for example, where the current time period may be 2020, a cycle list D of the current month is generated according to the yearly-monthly information, and the scheduling information of the current month is acquired based on the cycle list D.
The attribute information of the object to be scheduled may include an identity of the object to be scheduled. Specifically, the identification of the object to be scheduled may include, but is not limited to, a job number, an identification number, a name, and a telephone number of the object to be scheduled. The attribute information of the object to be scheduled may further include information of a department and the like to which the object belongs.
The shift configuration information may include the time of different classes of shifts and the number of objects corresponding to the respective classes.
The class of the shift can comprise a shift class and a rest class; the shift scheduling category may include at least one of an early shift category, a middle shift category, and a late shift category.
The scheduling rules may include a round robin rule for each class of shift. The duty-cycling rules for each class of shift may include a maximum number of consecutive work days and a minimum number of rest days for the corresponding class of shift, e.g., the duty-cycling rules for the early shift are a maximum of 3 consecutive work days and a minimum of 2 consecutive rest days.
In one example, the class of the shift includes an early shift class, a middle shift class, and a late shift class and a rest class, and the scheduling rules for the different classes of shifts are as follows:
for the early shift category, the scheduling rules include for each early shift, 5 consecutive days on duty and 2 consecutive days of rest for the subject.
For the middle shift category, the shift schedule rules include each middle shift, with subjects on 4 consecutive days to work and 2 consecutive days to rest.
For the class of the evening shifts, the scheduling rules include for each evening shift, 3 consecutive days to work and 3 consecutive days to rest for the subject.
For example, taking the current time period as a week and the number of people on duty per shift as 2, the above-mentioned scheduling rule can be shown in table 1:
TABLE 1
In Table 1, the morning shift time is t1-t2, and the subject family A1 and the subject A2 continuously go to work for 5 days and continuously rest for 2 days;
the shift time is t2-t3, and the subject A3 and the subject A4 continuously shift for 4 days and continuously rest for 2 days;
the evening hours are t3-t4, and subject A5 and subject A6 continuously work for 4 days and continuously rest for 2 days.
Wherein each subject has only one shift per day in order to have sufficient rest for the subject. That is, if one of the subjects is at rest on a certain day, then it is not participating in any shift on that day; meanwhile, if one of the objects has scheduled a shift on a certain day, it does not participate in the other shifts on the day.
It should be noted that in table 1, other subjects need to work during the rest period of the corresponding subject, and the middle and late shifts of the weekdays also need to be worked by other subjects. Wherein, other objects need to delay the shift of the next week according to the scheduling rule.
In some embodiments, the shift schedule rule further comprises: and (5) a rule that the continuous rest days of the objects to be scheduled are not less than a preset threshold value.
In some embodiments, the shift schedule rules may also include special shift rules.
The special shift rule may be a shift category in which the second object to be scheduled is scheduled within the target time period, a shift category in which the second object is not scheduled within the target time period, or a shift category in which the adjustment request is not received within the target time period.
The second object to be scheduled is at least one object to be scheduled in the objects to be scheduled, and the target time period is smaller than the current time period. The adjustment request may include shift adjustment types such as leave, call, leave, and enter, and corresponding adjustment time periods.
For example, if the special shift rule is a shift category in which the second object to be scheduled is not scheduled in the target time period, the second object to be scheduled is all the female objects in the object to be scheduled, and the target time period is a time period in which the night shift is located in the current time period, it indicates that all the female objects in the object to be scheduled are not scheduled in the current time period.
If the special shift rule is the shift category of the second object to be shifted in the target time period, the second object to be shifted is a certain specific object, and the target time period is the time period of the middle shift in the current time period, it indicates that the period of the middle shift of the specific object in the current time period is the middle shift.
If the special shift rule is a shift category that the second object to be scheduled does not receive the adjustment request in the target time period, the second object to be scheduled is a certain specific object, and the target time period is a time period in which the night shift of the current time period is located, it indicates that the adjustment request of the specific object to the night shift is not received in the current time period.
And step 120, acquiring historical scheduling information of a preset number of adjacent historical scheduling cycles before the current scheduling cycle in the current time period.
For the current shift scheduling period, since the shift scheduling is performed according to the shift scheduling rule, historical shift scheduling information before the current shift scheduling period needs to be acquired to determine the shift-capable objects in the current shift scheduling period.
The historical scheduling information may include shift information of at least two categories corresponding to each target object, where the target object is at least one of the objects to be scheduled. The history information may be KEY VALUE pair form information, and the identification information of the object, such as the object number is KEY and the class is VALUE.
With reference to table 1, if the current shift schedule period is friday, the historical shift schedule information may include:
object a1 and object a2 were in the morning shift on friday ago and had been on for 4 consecutive days, and if it is known that monday was at rest, two categories of shift information were obtained for object a1 and object a 2.
Object A3 and object a4 were on friday ago middle shifts and had been on 4 consecutive days, and if it is known that monday ago was a rest, two categories of shift information were obtained for object A3 and object a 4.
Object a5 and object a6 were at rest on thursday before friday, were continuously night shift before wednesday, and had been continuously for 3 days, i.e., shift information for both categories of object a5 and object a 6.
And 130, aiming at the current scheduling period, scheduling the objects to be scheduled according to the scheduling configuration information, the scheduling rules of the objects to be scheduled and the historical scheduling information, and generating the scheduling information of the current scheduling period.
Determining the time of each class of shift and the number of objects of the corresponding shift according to the shift configuration information;
aiming at the current scheduling period, according to the shift information of at least two categories in the historical scheduling information corresponding to the current scheduling period, candidate objects to be scheduled which meet the scheduling rules are screened from the objects to be scheduled, namely the objects which can participate in the scheduling in the current scheduling period.
The candidate objects to be scheduled meeting the scheduling rules comprise objects to be scheduled which are not scheduled and meet the continuous rest days not less than the preset threshold value rule, and scheduled objects meeting the duty rule.
For example, all the objects to be scheduled before the current time period are taken as rest.
When the current scheduling period is the first period of the current time period, all objects to be scheduled in the historical scheduling information are at rest, the candidate objects to be scheduled in the current scheduling period are all the objects to be scheduled, and the number of days of continuous rest of all the objects to be scheduled in the historical scheduling information is not less than a preset threshold value.
When the current scheduling cycle is the second cycle of the current time period, because the historical scheduling information includes two shift categories of scheduled objects in the first cycle (namely, the shift category of the first cycle and the shift category before the first cycle) and the shift category of non-scheduled to-be-scheduled objects (namely, rest), the candidate to-be-scheduled objects in the current scheduling cycle are the non-scheduled objects meeting the continuous rest days not less than the preset threshold rule and at least one scheduled object in the first cycle meeting the shift rule, if the shift rule is 3 days for continuous on-duty and 3 days for continuous rest in the early shift, the object in the early shift in the first cycle only goes one day, and therefore, the object in the early shift also belongs to the candidate to-be-scheduled objects in the current scheduling cycle.
For another example, taking the object a5 and the object a6 as an example, with reference to table 1, the obtained shift information of the two types of the object a5 and the object a6 is that the night shift is continuously on for 3 days and has been at rest for 1 day, and it is known from the shift scheduling rule that the object a5 and the object a6 should be at rest in friday shift, that is, the object a5 and the object a6 are objects that cannot be scheduled in friday shift scheduling.
Then, according to the time sequence of different classes of shifts, for the to-be-scheduled shifts of the current class, selecting the working objects meeting the number of the objects of the current class from the candidate to-be-scheduled objects, and generating the scheduling information of the current scheduling period; when the current shift to be scheduled is the initial shift to be scheduled, the current candidate shift object is a candidate shift object, and the previous shift to be scheduled is empty.
In one possible embodiment, to improve the flexibility of shift scheduling, an adjustment request of the first object to be shifted may be obtained before step 130;
the adjustment request can comprise adjustment types such as leave request, rest, leave job and enter job and corresponding adjustment time periods; the first object to be scheduled is any one object to be scheduled in the objects to be scheduled;
determining a first target category of the shift to be arranged corresponding to the adjustment time period;
determining the to-be-scheduled times corresponding to the first target category as the to-be-scheduled times of the current category;
and according to the time sequence of the different classes of the shift, screening out the working objects meeting the number of the objects in the current class from the candidate objects to be scheduled in which the first object to be scheduled is deleted, and generating the scheduling information of the current scheduling period.
In a possible embodiment, in the case that the scheduling rule includes a special shift rule, generating the scheduling information of the current scheduling period includes:
determining a second target category of the shift to be arranged corresponding to the target time period;
determining the number of to-be-scheduled shifts corresponding to the second target category as the number of to-be-scheduled shifts of the current shift category;
and according to the time sequence of the different classes of the shift, for the to-be-scheduled shift of the current class, screening out the working objects meeting the number of the objects of the current class from the candidate to-be-scheduled shift objects of the second to-be-scheduled shift object, and generating the scheduling information of the current scheduling period.
And 140, acquiring the scheduling information of the current time period based on the scheduling information of each scheduling period in the current time period.
Taking 12 months, which may be 2020 in the current time period, as an example, the scheduling information of each scheduling cycle is filled in the cycle list D of the current month, so as to obtain the scheduling information of the current month.
In a possible embodiment, in order to achieve balance of the number of times that the object is on duty and further achieve flexibility of scheduling, after the scheduling information of the current time period is obtained, the total number S of the different classes of the number of times in the current time period may be obtained;
the total number of shifts can be determined according to the maximum continuous working days and the minimum rest days of each class of shift in the duty-cycling rule, and can also be customized according to the actual situation, and the embodiment of the invention is not limited herein.
Then, determining the quotient of the total number of the shifts S and the object to be scheduled E as the average shift value A of each object to be scheduled; and if the product of the average shift value A and the object E to be scheduled is less than the total number of shifts S, determining the sum of the average shift value A and 1 as the target average shift value A.
If the total shift times s of a third object to be scheduled in the scheduling information of the current time period is not less than the average shift time value A, determining the obtained scheduling information as the target scheduling information of the current time period;
and if the total number s of the third to-be-scheduled objects in the scheduling information of the current time period is smaller than the average number A of the shifts, modifying the preset number of the rest classes of the third to-be-scheduled objects in the acquired scheduling information into the shifts of the scheduling class, and determining the modified scheduling information as the target scheduling information of the current time period.
The third object to be scheduled is any one of the objects to be scheduled;
the preset number is the difference value between the average shift value A and the total shift number s of the third object to be scheduled.
In one example, vacation settings: the object autonomously submits a leave asking period L of 9 months which have the event to ask for leave: { '5' [ { ' userid ':5, ' rest _ start _ date ': 2020-09-01', ' rest _ end _ date ': 2020-09-05', ' rest _ type ': Q ' }.
Setting a scheduling rule: round-robin rules for each class shift: maximum consecutive days on duty, minimum days to rest for each class shift.
Setting the shift configuration information: the time of different classes of shift, such as the time of the morning shift, the middle shift, the night shift and the rest, and the number of the objects corresponding to the corresponding classes, such as the number of the objects of the morning shift, the middle shift, the night shift and the rest
Special shift rule R sets: the object ID is No. 1-5, and the special shift rule of the object with the object ID of 2 is as follows: { '2' { 'userid':2, 'rule _ start _ date': 2020-09-01',' rule _ end _ date ': 2020-09-05', 'symbol': 0',' shift ': NS' }. NS denotes the class category, night class.
Then, a scheduling request for the current time slot is obtained, which includes all the participatable scheduling objects E, the scheduling rules and the shift configuration information. In which, the current time period is 2020, 9 months.
According to the period (year, month), a period list D of the month is generated, wherein the period list D comprises: ['2020-09-01','2020-09-02'...'2020-09-30'].
The IDs of all objects which can participate in the shift scheduling form a list [2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 19, 20, 21, 23, 24, 38, 40, 43 ];
backtracking to 8 months in 2020, searching scheduling information of each object E capable of participating in scheduling, and acquiring historical scheduling information of a preset number of historical scheduling periods, wherein the historical scheduling information comprises at least two classes of shift information corresponding to the target object, and the object ID is taken as KEY, and the corresponding class is stored in a preset storage area in a VALUE form.
Obtaining average shift: and calculating the total shift S in the month according to the time of different classes of shifts in the shift configuration information, then obtaining the average shift of each participatory shift object E in the month according to the absolute value of A | ═ S |/| E |. If the current average | a | E | < S is used, then the current average number is increased by 1.
The shift schedule for 9 months may be as follows:
firstly, according to the period list D, all objects E capable of participating in scheduling and historical scheduling information, all objects F [2, 3, 5, 6, 7] capable of participating in scheduling on the same day meeting the scheduling rule in all objects E capable of participating in scheduling are obtained, whether each object accords with the continuous shift time length and rest time length of the corresponding shift type is checked, for example, if the object ID is 6, the object is in the early shift queue at the moment, but the previous night shift reaches the set maximum value, so that the object needs to set rest, and the object ID needs to be removed from the objects F capable of participating in scheduling on the same day.
And thirdly, verifying whether the leave asking period L exists in each object on the day and whether the special shift rule R is met, and if so, removing the object ID from all the participatory shift scheduling objects E. For example, if there is an object in the NS shift on the day, the object ID needs to be removed from the object F that can participate in the shift on the day to generate the shift information on the day, which is the case when the userid is 2 and the NS shift cannot be executed in the special shift rule.
And finally, continuously executing the steps to generate the shift information of 9 months.
The scheduling method provided by the embodiment of the invention obtains a scheduling request aiming at the current time period, wherein the scheduling request comprises attribute information, scheduling rules and shift configuration information of an object to be scheduled; the current time period comprises a plurality of shift scheduling cycles; acquiring historical scheduling information of a preset number of adjacent historical scheduling periods before the current scheduling period in the current time period, wherein the historical scheduling information comprises at least two categories of scheduling information corresponding to each target object, and the target object is at least one of objects to be scheduled; aiming at the current scheduling period, scheduling the objects to be scheduled according to the scheduling configuration information, the scheduling rules and the historical scheduling information to generate the scheduling information of the current scheduling period; and outputting a scheduling response based on the scheduling information of each scheduling period in the current time period, wherein the scheduling response comprises the scheduling information of the current time period. The method can automatically generate the scheduling information of the current time period according to the provided information, and improves the scheduling efficiency.
Corresponding to the foregoing method, an embodiment of the present invention further provides a shift scheduling apparatus, as shown in fig. 2, the shift scheduling apparatus includes: an acquisition unit 210, a generation unit 220, and an output unit 230;
an obtaining unit 210, configured to obtain a scheduling request for a current time period, where the scheduling request includes attribute information of an object to be scheduled, a scheduling rule, and shift configuration information; the current time period comprises a plurality of shift cycles;
acquiring historical scheduling information of a preset number of adjacent historical scheduling cycles before the current scheduling cycle in the current time period, wherein the historical scheduling information comprises at least two categories of scheduling information corresponding to each target object, and the target object is at least one of the objects to be scheduled;
a generating unit 220, configured to, for a current scheduling period, perform scheduling on the object to be scheduled according to the shift configuration information, the scheduling rule, and the historical scheduling information, and generate scheduling information of the current scheduling period;
an output unit 230, configured to output a scheduling response based on the scheduling information of each scheduling cycle in the current time period, where the scheduling response includes the scheduling information of the current time period.
In one possible implementation, each scheduling period in the scheduling information includes at least one class of shift, and one object to be scheduled in each scheduling period corresponds to one shift.
In one possible implementation, the apparatus further comprises a determining unit 240 and a screening unit 250;
the scheduling rules comprise a duty-cycling rule of each class of shift and a rule that the number of continuous rest days is not less than a preset threshold value; the shift configuration information comprises the time of different classes of shifts and the number of objects corresponding to the corresponding classes;
a determining unit 240, configured to determine, according to the shift configuration information, a time of each class shift and a number of objects of a corresponding shift;
a screening unit 250, configured to screen, for the current scheduling period, a candidate object to be scheduled that meets the scheduling rule from the objects to be scheduled according to the shift information of at least two categories in the historical scheduling information;
the generating unit 220 is further configured to, according to the time sequence of the shift of different classes, for the to-be-scheduled shift of the current class, screen out a work object satisfying the number of objects of the current class from the candidate to-be-scheduled shift objects, and generate the scheduling information of the current scheduling period; when the current to-be-scheduled shift is an initial to-be-scheduled shift, the candidate to-be-scheduled shift object is the to-be-scheduled shift object, and the previous to-be-scheduled shift is empty.
In a possible implementation, the obtaining unit 210 is further configured to obtain an adjustment request of the first object to be scheduled; the adjustment request comprises a shift adjustment type and a corresponding adjustment time period; the first object to be scheduled is any one of the objects to be scheduled;
the determining unit 240 is further configured to determine a first target category of the to-be-scheduled shift corresponding to the adjustment time period;
determining the number of to-be-scheduled shifts corresponding to the first target category as the current number of to-be-scheduled shifts;
the generating unit 220 is further configured to, according to the time sequence of the different classes of shifts, for the current to-be-scheduled shift, screen out a work object meeting the number of objects of the current shift from the candidate to-be-scheduled shift objects from which the first to-be-scheduled shift object is deleted, and generate the scheduling information of the current scheduling period.
In one possible implementation, the shift schedule rules further include special shift rules; the special shift rule is a shift category of a second object to be shifted within a target time period, a shift category of the second object not to be shifted within the target time period, or a shift category of the second object not to receive an adjustment request within the target time period, and the second object to be shifted is at least one object to be shifted in the objects to be shifted; the target time period is less than the current time period;
the determining unit 240 is further configured to determine a second target category of the to-be-scheduled shift corresponding to the target time period;
determining the number of to-be-scheduled shifts corresponding to the second target category as the current number of to-be-scheduled shifts;
the generating unit 220 is further configured to, according to the time sequence of the shifts of different categories, for the current to-be-scheduled shift, screen out a work object that meets the number of objects of the current shift category from the candidate to-be-scheduled shift objects from which the second to-be-scheduled shift object is deleted, and generate the scheduling information of the current scheduling period.
In one possible implementation, the class of shift includes a shift class and a rest class;
wherein the scheduling category comprises at least one category of an early shift category, a middle shift category and a late shift category.
In a possible implementation, the obtaining unit 210 is further configured to obtain total number of shifts of different shift categories in the current time period;
the determining unit 240 is further configured to determine a quotient between the total number of shifts and the objects to be scheduled as an average shift value of each object to be scheduled;
if the total shift times of a third shift object in the shift information of the current time period is not less than the average shift time value, determining the obtained shift information as the target shift information of the current time period;
if the total number of the shifts of a third object to be scheduled in the scheduling information of the current time period is smaller than the average shift value, modifying the shifts of a preset number of rest categories of the third object to be scheduled in the acquired scheduling information into the shift of the scheduling category; determining the modified scheduling information as the target scheduling information of the current time period;
the third object to be scheduled is any one of the objects to be scheduled; the preset number is the difference value between the average shift number and the total shift number of the third object to be scheduled.
The functions of the functional units of the scheduling device provided in the above embodiment of the present invention can be implemented through the steps of the above method, and therefore, detailed working processes and beneficial effects of the units in the scheduling device provided in the embodiment of the present invention are not described herein again.
An embodiment of the present invention further provides an electronic device, as shown in fig. 3, including a processor 310, a communication interface 320, a memory 330, and a communication bus 340, where the processor 310, the communication interface 320, and the memory 330 complete mutual communication through the communication bus 340.
A memory 330 for storing a computer program;
the processor 310, when executing the program stored in the memory 330, implements the following steps:
acquiring a scheduling request aiming at the current time period, wherein the scheduling request comprises attribute information, scheduling rules and shift configuration information of an object to be scheduled; the current time period comprises a plurality of shift cycles;
acquiring historical scheduling information of a preset number of adjacent historical scheduling periods before the current scheduling period in the current time period, wherein the historical scheduling information comprises at least two categories of scheduling information corresponding to each target object, and the target object is at least one of the objects to be scheduled;
aiming at the current scheduling period, scheduling the objects to be scheduled according to the scheduling configuration information, the scheduling rules and the historical scheduling information to generate scheduling information of the current scheduling period;
outputting a scheduling response based on the scheduling information of each scheduling cycle in the current time period, wherein the scheduling response comprises the scheduling information of the current time period.
In one possible implementation, each scheduling period in the scheduling information includes at least one class of shift, and one object to be scheduled in each scheduling period corresponds to one shift.
In one possible implementation, the scheduling rules include a round-robin rule for each class shift and a rule that the number of consecutive rest days is not less than a preset threshold; the shift configuration information comprises the time of different classes of shifts and the number of objects corresponding to the corresponding classes;
aiming at the current scheduling period, scheduling the objects to be scheduled according to the shift configuration information, the scheduling rules and the historical scheduling information, and generating the scheduling information of the current scheduling period, wherein the scheduling information comprises:
determining the time of each class of shift and the number of objects of the corresponding shift according to the shift configuration information;
aiming at the current scheduling period, screening candidate objects to be scheduled which meet the scheduling rules from the objects to be scheduled according to the shift information of at least two categories in the historical scheduling information;
according to the time sequence of different classes of shifts, for the to-be-scheduled shifts of the current class, selecting a working object meeting the number of the objects of the current class from the candidate to-be-scheduled objects, and generating scheduling information of the current scheduling period; when the current to-be-scheduled shift is an initial to-be-scheduled shift, the candidate to-be-scheduled shift object is the to-be-scheduled shift object, and the previous to-be-scheduled shift is empty.
In one possible implementation, the method further comprises:
acquiring an adjustment request of a first object to be scheduled; the adjustment request comprises a shift adjustment type and a corresponding adjustment time period; the first object to be scheduled is any one of the objects to be scheduled;
according to the time sequence of different classes of shifts, for the to-be-scheduled shifts of the current class, selecting the working objects meeting the number of the objects of the current class from the candidate to-be-scheduled objects, and generating the scheduling information of the current scheduling period, wherein the method comprises the following steps:
determining a first target category of the shift to be arranged corresponding to the adjusting time period;
determining the number of to-be-scheduled shifts corresponding to the first target category as the current number of to-be-scheduled shifts;
and according to the time sequence of different classes of shifts, for the current shift to be scheduled, screening out the working objects meeting the number of the objects of the current shift from the candidate shift to be scheduled objects of which the first shift to be scheduled object is deleted, and generating the shift scheduling information of the current shift period.
In one possible implementation, the shift schedule rules further include special shift rules; the special shift rule is a shift category of a second object to be shifted within a target time period, a shift category of the second object not to be shifted within the target time period, or a shift category of the second object not to receive an adjustment request within the target time period, and the second object to be shifted is at least one object to be shifted in the objects to be shifted; the target time period is less than the current time period;
according to the time sequence of the different classes of the shift, for the to-be-scheduled shift of the current class, screening out the working objects meeting the number of the objects of the current class from the candidate to-be-scheduled objects, and generating the scheduling information of the current scheduling period, wherein the method comprises the following steps:
determining a second target category of the shift to be arranged corresponding to the target time period;
determining the number of to-be-scheduled shifts corresponding to the second target category as the current number of to-be-scheduled shifts;
and according to the time sequence of the shift of different classes, for the current shift to be scheduled, screening out the working objects meeting the number of the objects of the current class from the candidate shift objects for deleting the second shift object to be scheduled, and generating the scheduling information of the current scheduling period.
In one possible implementation, the class of shift includes a shift class and a rest class;
wherein the scheduling category comprises at least one category of an early shift category, a middle shift category and a late shift category.
In one possible implementation, after outputting a shift scheduling response based on the shift scheduling information of each shift scheduling cycle in the current time period, the method further includes:
acquiring the total number of the different classes in the current time period;
determining the quotient of the total number of the shifts and the objects to be scheduled as the average shift value of each object to be scheduled;
if the total shift times of a third shift object in the shift scheduling information of the current time period is not less than the average shift time value, determining the obtained shift scheduling information as the target shift scheduling information of the current time period;
if the total number of the shifts of a third object to be scheduled in the scheduling information of the current time period is smaller than the average shift value, modifying the shifts of a preset number of rest categories of the third object to be scheduled in the acquired scheduling information into the shift of the scheduling category; determining the modified scheduling information as the target scheduling information of the current time period;
the third object to be scheduled is any one of the objects to be scheduled; the preset number is the difference value between the average shift number and the total shift number of the third object to be scheduled.
The aforementioned communication bus may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
The communication interface is used for communication between the electronic equipment and other equipment.
The Memory may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components.
Since the implementation manner and the beneficial effects of the problem solving of each device of the electronic device in the foregoing embodiment can be implemented by referring to each step in the embodiment shown in fig. 1, detailed working processes and beneficial effects of the electronic device provided by the embodiment of the present invention are not described herein again.
In yet another embodiment of the present invention, a computer-readable storage medium is further provided, which has instructions stored therein, and when the computer-readable storage medium runs on a computer, the computer is caused to execute the scheduling method in any one of the above embodiments.
In a further embodiment of the present invention, there is also provided a computer program product containing instructions which, when run on a computer, cause the computer to perform the scheduling method of any of the above embodiments.
As will be appreciated by one of skill in the art, the embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, embodiments of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
Embodiments of the present application are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including the preferred embodiment and all changes and modifications that fall within the true scope of the embodiments of the present application.
It is apparent that those skilled in the art can make various changes and modifications to the embodiments of the present application without departing from the spirit and scope of the embodiments of the present application. Thus, if such modifications and variations of the embodiments of the present application fall within the scope of the claims of the embodiments of the present application and their equivalents, the embodiments of the present application are also intended to include such modifications and variations.
Claims (10)
1. A scheduling method, characterized in that the method comprises:
acquiring a scheduling request aiming at the current time period, wherein the scheduling request comprises attribute information, scheduling rules and shift configuration information of an object to be scheduled; the current time period comprises a plurality of shift cycles;
acquiring historical scheduling information of a preset number of adjacent historical scheduling periods before the current scheduling period in the current time period, wherein the historical scheduling information comprises at least two categories of scheduling information corresponding to each target object, and the target object is at least one of the objects to be scheduled;
aiming at the current scheduling period, scheduling the objects to be scheduled according to the shift configuration information, the scheduling rules and the historical scheduling information to generate the scheduling information of the current scheduling period;
outputting a scheduling response based on the scheduling information of each scheduling cycle in the current time period, wherein the scheduling response comprises the scheduling information of the current time period.
2. The method of claim 1, wherein each scheduling period in the scheduling information includes at least one class of shift, and one object to be scheduled in each scheduling period corresponds to one shift.
3. The method of claim 1, wherein the scheduling rules include a round-robin rule for each class shift and a rule that consecutive days of rest are not less than a preset threshold; the shift configuration information comprises the time of different classes of shifts and the number of objects corresponding to the corresponding classes;
aiming at the current scheduling period, scheduling the objects to be scheduled according to the shift configuration information, the scheduling rules and the historical scheduling information, and generating the scheduling information of the current scheduling period, wherein the scheduling information comprises:
determining the time of each class of shift and the number of objects of the corresponding shift according to the shift configuration information;
aiming at the current scheduling period, screening candidate objects to be scheduled which meet the scheduling rules from the objects to be scheduled according to the shift information of at least two categories in the historical scheduling information;
according to the time sequence of different classes of shifts, for the to-be-scheduled shifts of the current class, selecting a working object meeting the number of the objects of the current class from the candidate to-be-scheduled objects, and generating scheduling information of the current scheduling period; when the current to-be-scheduled shift is an initial to-be-scheduled shift, the candidate to-be-scheduled shift object is the to-be-scheduled shift object, and the previous to-be-scheduled shift is empty.
4. The method of claim 3, wherein the method further comprises:
acquiring an adjustment request of a first object to be scheduled; the adjustment request comprises a shift adjustment type and a corresponding adjustment time period; the first object to be scheduled is any one of the objects to be scheduled;
according to the time sequence of different classes of shifts, for the to-be-scheduled shifts of the current class, selecting the working objects meeting the number of the objects of the current class from the candidate to-be-scheduled objects, and generating the scheduling information of the current scheduling period, wherein the method comprises the following steps:
determining a first target category of the to-be-scheduled shift corresponding to the adjustment time period;
determining the number of to-be-scheduled shifts corresponding to the first target category as the current number of to-be-scheduled shifts;
and according to the time sequence of different classes of shifts, for the current shift to be scheduled, screening out the working objects meeting the number of the objects of the current shift from the candidate shift to be scheduled objects of which the first shift to be scheduled object is deleted, and generating the shift scheduling information of the current shift period.
5. The method of claim 3, wherein the scheduling rules further include special shift rules; the special shift rule is a shift category of a second object to be shifted within a target time period, a shift category of the second object not to be shifted within the target time period, or a shift category of the second object not to receive an adjustment request within the target time period, and the second object to be shifted is at least one object to be shifted in the objects to be shifted; the target time period is less than the current time period;
according to the time sequence of different classes of shifts, for the to-be-scheduled shifts of the current class, selecting the working objects meeting the number of the objects of the current class from the candidate to-be-scheduled objects, and generating the scheduling information of the current scheduling period, wherein the method comprises the following steps:
determining a second target category of the shift to be arranged corresponding to the target time period;
determining the number of to-be-scheduled shifts corresponding to the second target category as the current number of to-be-scheduled shifts;
and according to the time sequence of the shift of different classes, for the current shift to be scheduled, screening out the working objects meeting the number of the objects of the current class from the candidate shift objects for deleting the second shift object to be scheduled, and generating the scheduling information of the current scheduling period.
6. The method of any one of claims 1-5, wherein the class of shifts includes a shift class and a rest class;
wherein the scheduling category comprises at least one category of an early shift category, a middle shift category and a late shift category.
7. The method of claim 6, wherein after outputting a shift response based on the shift information for each shift cycle in the current time period, the method further comprises:
acquiring the total number of the different classes in the current time period;
determining the quotient of the total number of the shifts and the objects to be scheduled as the average shift value of each object to be scheduled;
if the total shift times of a third shift object in the shift scheduling information of the current time period is not less than the average shift time value, determining the obtained shift scheduling information as the target shift scheduling information of the current time period;
if the total number of the shifts of a third object to be scheduled in the scheduling information of the current time period is smaller than the average shift value, modifying the shifts of a preset number of rest categories of the third object to be scheduled in the acquired scheduling information into the shift of the scheduling category; determining the modified scheduling information as the target scheduling information of the current time period;
the third object to be scheduled is any one of the objects to be scheduled; the preset number is the difference value between the average shift number and the total shift number of the third object to be scheduled.
8. A shift arrangement device, the device comprising: an acquisition unit, a generation unit and an output unit;
the acquiring unit is used for acquiring a scheduling request aiming at the current time period, wherein the scheduling request comprises attribute information, a scheduling rule and scheduling configuration information of an object to be scheduled; the current time period comprises a plurality of shift cycles;
acquiring historical scheduling information of a preset number of historical scheduling periods adjacent to the current scheduling period in the current time period, wherein the historical scheduling information comprises at least two categories of scheduling information corresponding to each target object, and the target object is at least one of the objects to be scheduled;
the generating unit is used for scheduling the objects to be scheduled according to the shift configuration information, the scheduling rules and the historical scheduling information aiming at the current scheduling period, and generating the scheduling information of the current scheduling period;
the output unit is used for outputting a scheduling response based on the scheduling information of each scheduling cycle in the current time period, and the scheduling response comprises the scheduling information of the current time period.
9. The electronic equipment is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are used for completing mutual communication through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of any of claims 1-7 when executing a program stored on a memory.
10. A computer-readable storage medium, characterized in that a computer program is stored in the computer-readable storage medium, which computer program, when being executed by a processor, carries out the method steps of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011534059.0A CN114662817A (en) | 2020-12-23 | 2020-12-23 | Scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011534059.0A CN114662817A (en) | 2020-12-23 | 2020-12-23 | Scheduling method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114662817A true CN114662817A (en) | 2022-06-24 |
Family
ID=82024383
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011534059.0A Pending CN114662817A (en) | 2020-12-23 | 2020-12-23 | Scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114662817A (en) |
-
2020
- 2020-12-23 CN CN202011534059.0A patent/CN114662817A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Barad | Design of experiments (DOE)—a valuable multi-purpose methodology | |
| CN109284895A (en) | Project task distribution method, device, computer equipment and storage medium | |
| CN111858055B (en) | Task processing method, server and storage medium | |
| CN111142746B (en) | System quota calculation method and device | |
| CN110659137A (en) | Processing resource allocation method and system for offline tasks | |
| CN112199180A (en) | Multitask scheduling method and device, electronic equipment and readable storage medium | |
| CN111984426A (en) | Task scheduling method and device, electronic equipment and storage medium | |
| CN106874079A (en) | A kind of method and device of tasks carrying | |
| CN109447428B (en) | Method and device for determining sequence production of finished automobile production line and intelligent terminal | |
| CN110807618A (en) | Dynamic scheduling method, device and equipment | |
| CN114401158A (en) | Flow charging method and device, electronic equipment and storage medium | |
| CN114662817A (en) | Scheduling method and device | |
| CN110413393B (en) | Cluster resource management method and device, computer cluster and readable storage medium | |
| CN109829680B (en) | Scheduling method, scheduling device, computer device and storage medium | |
| CN111443999A (en) | Data parallel processing method, actuator, computer device and storage medium | |
| CN112966005B (en) | Timing message sending method, device, computer equipment and storage medium | |
| CN111045804B (en) | Task allocation method, device, medium and electronic equipment | |
| CN106920018B (en) | Operation strategy selection method and device for terminal | |
| CN114742521A (en) | Reminding method and device, computer equipment and computer readable storage medium | |
| CN114529262A (en) | Project development time calculation method, device, equipment and storage medium | |
| CN111767125A (en) | Task execution method and device, electronic equipment and storage medium | |
| CN112132612A (en) | Task processing method and device, electronic equipment and storage medium | |
| CN110647386B (en) | Data processing method and device, computer equipment and storage medium | |
| CN113709314B (en) | Intelligent seat outbound method and device, electronic equipment and computer storage medium | |
| CN112835931A (en) | Method and device for determining data acquisition frequency |
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 |