CN112749942A

CN112749942A - Scheduling method, device, equipment and storage medium

Info

Publication number: CN112749942A
Application number: CN201911045902.6A
Authority: CN
Inventors: 刘凇瑞; 陈秋丽; 陈晖�; 朱彬林; 王晶
Original assignee: SF Technology Co Ltd
Current assignee: SF Technology Co Ltd; SF Tech Co Ltd
Priority date: 2019-10-30
Filing date: 2019-10-30
Publication date: 2021-05-04

Abstract

The application discloses a scheduling method, a scheduling device, a scheduling equipment and a storage medium. The method comprises the following steps: based on configuration information of a time period to be scheduled, solving optimal shift information meeting constraint conditions by a mixed integer programming method, wherein the configuration information comprises service demand information, shift types, time slices, time of going to and going from the shift and employee information, and the shift information comprises dates, shift numbers and the number of employees in each shift; and based on the optimal shift information, the group information and the scheduling rule, solving the scheduling information meeting the group consistency requirement by a mixed integer programming method. According to the technical scheme provided by the embodiment of the application, the scheduling method can adapt to different management requirements, is wide in application range, improves the convenience of scheduling, and can also improve the convenience of management as scheduling information meets the group consistency requirement.

Description

Scheduling method, device, equipment and storage medium

Technical Field

The present application relates to the field of data processing, and in particular, to the field of human resource allocation, and more particularly, to a scheduling method, apparatus, device, and storage medium.

Background

Each enterprise needs to schedule according to the requirement of the enterprise on the staff and the current staff condition.

The current scheduling method comprises the following steps: the enterprise human resource manager calculates the current human demand according to the historical human demand condition of the enterprise, and then carries out scheduling according to the current human demand.

Firstly, depending on history too much, change of current enterprises and change of staff can be ignored, so that the shift is not suitable for the current state; in addition, the manpower resource managers have different styles and different abilities, so that management risks are easily caused; in addition, the scheduling rules of each enterprise are different, and when a human resource manager enters a new enterprise each time, the human resource manager needs to learn a new scheduling method again, so that inconvenience is brought to both the human resource manager and the enterprise.

Disclosure of Invention

In view of the problems that the conventional scheduling method is too dependent on history, easily causes management risks and is inconvenient to use, the application provides a scheduling method, a device, equipment and a storage medium, and the convenience of scheduling can be improved.

In a first aspect, an embodiment of the present application provides a scheduling method, including:

based on configuration information of a time period to be scheduled, solving optimal shift information meeting constraint conditions by a mixed integer programming method, wherein the configuration information comprises service demand information, shift types, time slices, time of going to and going from the shift and employee information, and the shift information comprises dates, shift numbers and the number of employees in each shift;

and based on the optimal shift information, the group information and the scheduling rule, solving the scheduling information meeting the group consistency requirement by a mixed integer programming method.

Optionally, the employee information includes an employee total number and an employee number;

the service demand information comprises the number of staff required by each time slice in the period of waiting for scheduling;

the group information comprises group number information and member information;

a shift comprises a plurality of time slices that are consecutive in time;

the scheduling information includes date, employee number and shift number.

Optionally, the group consistency requirements include:

in the time period to be scheduled by taking days as a unit, aiming at a first group and the first shift, the proportion of the number of employees of the first shift in the first group is greater than the consistency proportion, and the proportion of the number of employees of other shifts except the first shift is less than the non-consistency proportion, so that the employees of the first group with the consistency proportion are arranged in the same shift, and the first group meets the consistency requirement;

the first group is any one group, the first shift is any one shift, the consistency ratio is greater than the non-consistency ratio, and the sum of the consistency ratio and the non-consistency ratio is 1.

Optionally, the group consistency requirement further comprises:

in any group, the proportion of the number of workers on duty is greater than the consistency proportion or less than the non-consistency proportion;

the number of workers on duty is the number of workers in any group in all shifts.

Optionally, the shift schedule rules include at least one of:

the number of the employees scheduled in each shift is more than or equal to the number of the employees scheduled in the lowest scheduling proportion in the shift every day;

each employee cannot be assigned more than one shift a day;

the working days of each employee per week is greater than the lower limit value of the working days of each employee per week;

the working days per week of each employee is less than or equal to the upper limit value of the working days per week of each employee;

the continuous working days of each employee are less than or equal to the upper limit value of the continuous working days;

in one month, the number of days for each employee to schedule the night shift is less than or equal to the upper limit value of the number of days for each employee to schedule the night shift in one month;

for each employee, if the first day is the night shift, the next day is not to be arranged in the early shift;

for each employee, the number of days for which the night class is continuously scheduled is less than or equal to the upper limit value of the number of days for which the night class is continuously scheduled;

within one month, the number of times of rest of each employee on weekends is greater than or equal to a third preset value;

when the time to be scheduled is a holiday day, acquiring the shift and employee information which are arranged for the holiday day in advance, and scheduling according to the acquired shift and employee information;

pregnant women do not schedule the night shift;

the single-skill staff does not arrange the night class;

within one month, the number of night shift days of one employee is more than the minimum number of night shift days required on one employee within one month;

in one month, the number of night shift days of an employee is less than or equal to the maximum number of night shift days required on the employee in one month;

in one month, the difference value between the maximum number of night shift days and the minimum number of night shift days of one employee is less than or equal to a fourth preset value;

within one month, the number of days on weekend night shift of one employee is more than the minimum number of days on weekend night shift of one employee required within one month;

the number of days of night shift on weekend of one employee in one month is less than or equal to the maximum number of days of night shift on weekend of one employee in one month;

in one month, the difference value between the maximum number of night shift days and the minimum number of night shift days of one employee weekend is less than or equal to a fifth preset value;

in one month, the total working days of the employees who are not scheduled to work on holidays are the same;

the total working days of the staff working on holidays are the same within one month;

within one month, the working days of each employee are less than or equal to the maximum working days;

within one month, weekend working days of employees who do not schedule work on holidays are the same;

within one month, the weekend working days of the staffs working on holidays are the same;

according to the employee number and the leave asking date of the leave asking employee, the employee corresponding to the employee number is not arranged to work in the leave asking date.

Optionally, based on the optimal shift information, the group information, and the scheduling rule, solving the scheduling information meeting the group consistency requirement by using a mixed integer programming method includes:

and when the plurality of alternative scheduling information appears in the mixed integer programming method solution, calculating the number of the staff in the plurality of alternative scheduling information, and taking the scheduling information with the minimum number of the staff as the optimal scheduling information.

In a second aspect, an embodiment of the present application provides a shift scheduling apparatus, including:

the first solving module is used for solving the optimal shift information meeting the constraint condition through a mixed integer programming method based on the configuration information of the time period to be scheduled, wherein the configuration information comprises service demand information, shift types, time slices, the time of going to and going from the shift and employee information, and the shift information comprises dates, shift numbers and the number of employees in each shift;

and the second solving module is used for solving the scheduling information meeting the group consistency requirement by a mixed integer programming method based on the optimal shift information, the group information and the scheduling rule.

Optionally, the group consistency requirements include:

In a third aspect, an embodiment of the present application provides a shift scheduling apparatus, including:

one or more processors;

a memory for storing one or more programs;

the one or more programs, when executed by the one or more processors, cause the one or more processors to perform a method that implements the first aspect described above.

In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, the computer program being configured to implement the method of the first aspect.

To sum up, in the scheduling method provided in the embodiment of the present application, first, according to the acquired configuration information, the optimal shift information satisfying the constraint condition is solved by a mixed integer programming method; and finally, based on the optimal shift information, the group information and the scheduling rules, solving the scheduling information meeting the group consistency by a mixed integer programming method. Therefore, the scheduling method provided by the embodiment of the application can solve the corresponding scheduling information by only determining the configuration information, such as the service requirement information, the employee information, the group consistency, the scheduling rule and other limiting conditions, and using a specific solution; therefore, the scheduling method does not need to depend on history too much, the scheduling result is more in line with the current requirement, excessive scheduling experience accumulation of a human resource manager is not required, management risks are not easy to cause, in addition, the scheduling method can be suitable for different management occasions, the application range is wide, and the convenience of scheduling is improved; moreover, the scheduling method is based on team scheduling, and management convenience is improved.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments or the prior art are briefly introduced below, and it is apparent that the drawings are only for the purpose of illustrating a preferred implementation method and are not to be considered as limiting the present invention. It should be further noted that, for the convenience of description, only some but not all of the relevant portions of the present invention are shown in the drawings.

FIG. 1 is a flow chart illustrating a scheduling method according to an embodiment of the present application;

FIG. 2 is a flow chart illustrating a method for solving for optimal shift information according to an embodiment of the present application;

FIG. 3 is a flow chart illustrating a method for generating available shifts according to an embodiment of the present application;

FIG. 4 is a flow chart illustrating another scheduling method according to an embodiment of the present application;

FIG. 5 is a block diagram of a shift arrangement shown in accordance with an embodiment of the present application;

fig. 6 is a schematic structural diagram of a computer system according to an embodiment of the present application.

Detailed Description

The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.

It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.

Fig. 1 is a flowchart illustrating a scheduling method according to an embodiment of the present application. The method shown in fig. 1 may be performed by various devices having data processing, as shown in fig. 1, the method comprising the steps of:

and step 101, solving the optimal shift information meeting the constraint condition by a mixed integer programming method based on the configuration information of the time period to be scheduled.

The configuration information includes service requirement information, shift type, time slice, time on/off duty, employee information, and the like.

The mixed integer programming method may specifically be a branch-and-bound method. Further, the solution can be solved by a branch-and-bound method using a commercial solver as a tool.

Alternatively, referring to fig. 2, step 101 may be implemented by steps 1011 and 1012:

and step 1011, determining the available shift according to the acquired configuration information through a preset algorithm.

The configuration information in step 1011 includes the shift type, the time slice, and the time of going to and going to work. Optionally, the configuration information may further include a dining time, a working time, and a rest time. In addition, the configuration information may be set in advance and stored in the device so as to be available at any time when used.

Further, the class types may include an early class, a middle class, a late class and a special class, wherein the special class may be divided into a half-day early class and a half-day late class. Of course the shift type may also include other shifts as desired, such as a night shift.

Wherein the special shift can be a shift arranged for pregnant women, lactating women, new staff or disabled people.

Further, time slices are the basic units that make up a shift. In particular, a shift contains a plurality of time slices that are consecutive in time. The time slice length can be determined according to the requirement, for example, if the waiting period includes a day that can be obviously divided into a peak period and a general period, the time slice length can be determined as 2 hours, but if the waiting period includes a day that can not be obviously divided into a peak period and a general period, one time slice length can be determined as 30 minutes or 40 minutes.

Alternatively, the plurality of time slices may be a plurality of time slices with equal time duration, or a plurality of time slices with unequal time duration may be set as required. Illustratively, when there are significant peak periods and low peak periods in the time to be scheduled, the time to be scheduled may be divided using the peak periods and the low peak periods.

In addition, the embodiments of the present application take the case where the time slice lengths are equal.

Further, the on-off hours include a start-up available time and a start-up available time.

Further, the meal time may include a meal start time and a meal end time,

further, the working duration may include a minimum daily working duration value and a maximum daily working duration value, and may further include a minimum continuous working duration value and a maximum continuous working duration value.

Further, the rest period may include a continuous rest period minimum and a continuous rest period maximum.

Optionally, the configuration information may further include a maximum time length for card punching, a minimum value of the number of continuously operable sections, a maximum value of the number of continuously operable sections, and the like.

The maximum card punching time length is the time length between the on-duty card punching time and the off-duty card punching time. For example, the maximum time length for punching the card is 12, the time for punching the card on duty is 08:00, and the latest time for punching the card off duty is 20: 00.

The number of work segments is the number of work segments included in one shift, for example, the work segments include 08:00-12:00, 14:00-17:00, and 16:00-20:00, that is, one shift includes three work segments. The number of the continuous operation sections is 2, which means that the continuous operation can be performed only for two of the operation sections.

For example, the configuration information may be referred to as each content shown in table 1 below.

TABLE 1

The preset algorithm comprises a violent search algorithm, a heuristic search algorithm or a global search algorithm and the like. Of course, other algorithms may be used, as desired and limited herein. The violent search algorithm, the heuristic search algorithm or the global search algorithm are prior art, and are not described herein.

Further, when the available shift is solved, the format and the field shown in table 1 above may be used as input data of the preset algorithm, and an output result is obtained through one of the preset algorithms, that is, the available shift.

Further, the available shifts may include the shift type, shift number, and time slice each shift includes for the shift. For example, see table 2 below for one available shift.

TABLE 2

As can be seen from Table 2, the time slice covered by the available shift is 8: 29 time slices of 00 to 22:30, one time slice being 30 minutes. 0 in the table indicates that employees are not scheduled in the time slice corresponding to the shift, and 1 indicates that employees are scheduled in the time slice corresponding to the shift. The available shifts include a morning shift 1, a middle shift 2, an evening shift 3, an evening shift 4, and an evening shift 5. Wherein, the early shift, the middle shift and the late shift are of shift types, the working time of the early shift is 08:00, the working time of the middle shift is 08: 30, the working time of the evening is 09: 00.

In addition, it should be noted that only the time slices included in 08:00-22:30 are shown in table 1, which indicates that the shift is required only in this time period, but it is also possible to increase the number of time slices according to the requirement, for example, a factory needs to have a person to watch the shift all day of each day, and modify the time nodes of the time slices covered by the shift by adjusting the relevant contents in table 1.

In addition, it should be noted that the above table is merely an illustration of a portion of the shifts obtained from table 1, and that in practice the available shifts include all the shifts generated from the configuration information.

Alternatively, step 1011 may also be implemented by a process as shown in fig. 3. Compared with the implementation process, the process shown in fig. 3 increases the verification on the configuration information, so as to avoid time waste caused by executing the process of generating the available shift when the configuration information itself has an error, and thus, the success rate of generating the available shift can be improved by increasing the verification on the configuration information. Specifically, referring to fig. 3, first setting configuration information, then checking the set configuration information, modifying the configuration information when the configuration information does not pass the checking, re-checking the configuration information after modification, and if the configuration information does not pass the checking, continuing to modify the configuration information until the configuration information passes the checking; after the verification is passed, the available shift is solved by using a preset algorithm, if no solution exists, the configuration information is modified until the modified configuration information passes the verification and the solution exists when the modified configuration information passes the preset algorithm; and finally, outputting the available shift obtained by solving.

In addition, it should be noted that the check mentioned above may be a check on configuration information logic or the like. For example, whether the work-on-duty time and the meal time are contradictory or not is checked, and whether the time duration of the time slice is equal or not is checked.

And 1012, based on the service demand information, the employee information and the available shift of the period to be scheduled, solving the optimal shift information meeting the constraint conditions by a mixed integer programming method.

The business requirement information and the employee information are also the configuration information described in step 101.

The employee information includes the total number of employees, the serial number of employees, the name of employees, the group of employees, the special employees and the identification number, and also includes any other information related to the employees, such as a study calendar, an identification number, age, gender, and the like.

The business requirement information comprises the number of staff required by each time slice in the period of waiting for scheduling.

The shift information comprises dates, shift numbers and the number of employees in each shift.

The special employee may include a pregnant woman, a lactating woman, a disabled person, etc., and the special employee identification number may include 11, 22, 33, etc., wherein 11 represents the pregnant woman, 22 represents the lactating woman, 33 represents the disabled person, etc. So as to conveniently arrange a certain amount of special shifts for special staff.

The time period to be scheduled can include any time length of time needing scheduling. Further, the period of time to be scheduled can be divided into a plurality of scheduling cycles according to requirements. For example, if the period to be scheduled is one month, the period to be scheduled may be divided into a plurality of shift cycles with one shift cycle being a week. Furthermore, a week can be further divided into a working day and a rest day according to the actual working conditions, for example, monday to friday are working days, and saturday and sunday are rest days, which may be changed according to the actual requirements, and is not limited herein.

In addition, it should be noted that, in accordance with the available shift, the period to be scheduled needs to be divided into a plurality of time slices. Specifically, the time required to be scheduled in each day may be divided into a plurality of time slices in units of days.

Optionally, wherein the constraint comprises at least one of:

the number of staff arranged in each time slice in the peak period is less than that of staff with the highest satisfaction rate in the peak period, and the time period to be scheduled comprises the peak period and the general period;

the number of staff arranged in each time slice in the peak time period is more than or equal to the number of staff with the lowest satisfaction rate in the peak time period;

the number of the employees arranged in each time slice in the general time period is less than that of the employees with the highest satisfaction rate in the general time period;

the number of the staff arranged in each time slice in the general time period is more than or equal to the number of the staff with the lowest satisfaction rate in the general time period;

the number of the staff scheduled on the working day of each scheduling period in the period to be scheduled is less than the number of the staff available for working on the working day;

the number of the staff scheduled on the rest day of each shift cycle in the period to be scheduled is less than the number of the staff available for working on the working day;

the number of the staff arranged in each time slice in the period of waiting for scheduling is less than the number of the staff available for working in each time slice in the period of waiting for scheduling;

the sum of the number of the staff scheduled in each shift in the period of waiting for the shift is smaller than the upper limit value of the number of the staff scheduled in each shift in the period of waiting for the shift;

the sum of the number of the staff scheduled in each shift in the period of waiting for the shift is more than or equal to the lower limit value of the number of the staff scheduled in each shift in the period of waiting for the shift;

the number of the staff scheduled in each working day is smaller than the upper limit value of the number of the staff allowed to be scheduled in a single working day;

the number of the staff scheduled in each working day is more than or equal to the lower limit value of the number of the staff allowed to be scheduled in a single working day;

the number of the staff scheduled on each holiday is smaller than the upper limit value of the number of the staff allowed to be scheduled on a single holiday;

the number of the staff scheduled on each holiday is more than or equal to the lower limit value of the number of the staff allowed to be scheduled on a single holiday;

the number of the employees who take a rest in each working day is smaller than the upper limit value of the number of the employees who are allowed to take a rest in a single working day;

the number of the staff who take a rest in each working day is more than or equal to the lower limit value of the number of the staff who are allowed to take a rest in a single working day;

the number of the employees who take a rest on each rest day is smaller than the upper limit value of the number of the employees who are allowed to take a rest on a single rest day;

the number of the employees who take a rest on each rest day is more than or equal to the lower limit value of the number of the employees who are allowed to take a rest on a single rest day;

the number of the shifts arranged in one shift arrangement period is smaller than the upper limit value of the number of the shifts allowed to be arranged in one shift arrangement period;

the number of the employees in the special shift in the preset time period is less than a first preset value and is more than or equal to a second preset value;

the number of shifts in a day is less than the upper limit value of the number of shifts in a day;

the number of shifts in a day is more than or equal to the lower limit value of the number of shifts in a day;

the number of the shifts in the period to be scheduled is less than the upper limit value of the number of the shifts in the period to be scheduled;

the number of the shifts in the period to be scheduled is more than or equal to the lower limit value of the number of the shifts in the period to be scheduled.

When the shift schedule needs to be explained, other constraint conditions can be added according to actual needs, for example, when the period to be shifted includes night, the number of employees who schedule night shifts can be limited.

Optionally, the solving of the optimal shift information satisfying the constraint condition by the mixed integer programming method in step 1012 includes the following method M:

and when a plurality of candidate shift information appears in the mixed integer programming method, calculating the sum of absolute values of differences between the number of employees in each time slice in the plurality of candidate shift information and the number of employees needed by the corresponding time slice in the service demand information, and taking the shift information with the minimum sum of absolute values as the optimal shift information.

In addition, the optimal shift information may be calculated by the following formula (1):

wherein DL represents a period of time to be scheduled; p represents all possible time slices; t represents all available shifts that satisfy the configuration information; x is the number of_tpRepresenting the status of the shift T at time slice P, including that the shift T schedules employees at time slice P (the status is represented by 1), or that the shift T does not schedule employees at time slice P (the status is represented by 0), T ∈ T, P ∈ P; z is a radical of_tdThe number of the employees arranged in each time slice of the day d and the shift T is represented, wherein T belongs to T, and d belongs to DL; d_dpIndicating the number of employees that the time slice needs to schedule at P days d, d ∈ DL, P ∈ P.

Optionally, the solving of the optimal shift information satisfying the constraint condition by the mixed integer programming method in step 1012 may further include the following method N:

when a plurality of candidate shift information appears in the mixed integer programming method solution, calculating the sum of absolute values of differences between the number of staff of each time slice in the candidate shift information of the period to be scheduled and the number of staff required by the corresponding time slice in the service demand information, comparing the sum of the absolute values of the differences with a set value, and taking the candidate shift information of which the sum of the absolute values of the differences is less than the set value as preferred shift information;

and when the preferred shift information is a plurality of, calculating the total number of the employees of each preferred shift information, and taking the preferred shift information with the minimum total number of the employees as the optimal shift information.

The method N for determining the optimal shift in this embodiment is a method that is adopted when the number of employees in the optimal shift obtained in the method M exceeds the total number of actual employees that can participate in the shift. The method considers the requirement of meeting the required number of the employees in each time slice and the requirement of the actual total number of the employees.

In addition, according to the scheduling method provided by the embodiment, the time period to be scheduled is divided into a plurality of time slices, and the number of the staff required to be scheduled in each time slice is set, so that the number of the staff required to be scheduled in each time slice is as close as possible in the scheduling process, the staff demand is met to the maximum extent, and the effect of no manpower waste is achieved.

In addition, the period to be scheduled is illustratively 2018, 5/month 1/2018, 5/month 7/2018, the available shifts include 5, the shift numbers of which are 1, 2, 3, 4 and 5, respectively, and the finally determined use shift information is as shown in table 3 below.

TABLE 3

In the table, 0 indicates that the shift is not used, a value other than 0 indicates that the shift is used, and the number of employees scheduled is the value other than 0.

Further, the number of staff scheduled for each time slice included in the period to be scheduled may be determined according to tables 2 and 3. Illustratively, taking the period to be scheduled as 2018, 5, month and 1 as an example, the number of employees scheduled in each time slice of 2018, 5, month and 1 is shown in table 4 below.

TABLE 4

And 102, based on the optimal shift information, the group information and the scheduling rules, solving the scheduling information meeting the group consistency requirement by a mixed integer programming method.

Wherein the group information includes group number information and panelist information.

Optionally, the group consistency requirements include:

in the time period to be scheduled by taking days as a unit, aiming at a first group and the first shift, the proportion of the number of employees of the first shift in the first group is greater than the consistency proportion, and the proportion of the number of employees of other shifts except the first shift is less than the non-consistency proportion, so that the employees of the first group with the consistency proportion are arranged in the same shift, and the first group meets the consistency requirement; the first group is any one group, the first shift is any one shift, the consistency ratio is greater than the non-consistency ratio, and the sum of the consistency ratio and the non-consistency ratio is 1.

Further, the above-mentioned group consistency requirement can be embodied by the following two formulas:

wherein, I: an employee number set;

t: a shift set;

w: the number of the monthly inner circles is a set of labels;

d: day of week designations including [1, 2, 3, 4, 5, 6, 7 ];

g: a set comprising group numbers and staff numbers within the group;

g∈G，t∈T，w∈W，d∈D，i∈I；

if the employee is assigned to t shifts of w weeks for d days, then Z_itwd1, if the employee is not assigned to t shifts of d days of w weeks, then Z_itwdIs 0, T belongs to T, W belongs to W, and d belongs to DL;

m is an infinite number;

acco: consistency ratio of shifts within a group;

len_g: the number of persons comprised by the group g;

w weeks d days t shift group g virtual variable, when the proportion of the number of employees in the first shift arranged in the first group is greater than the consistency proportion, V_gtwdWhen equation (3) holds true, only equation (2) actually works, which is equal to 1Defining a small group g to be larger than the consistency ratio in the number of the employees at the working time t within d days of the week W by the formula (2); when the proportion of the number of employees of the other shifts except the first shift is smaller than the non-uniformity proportion, V_gtwdWhen the formula (2) is always satisfied and only the formula (3) actually works, the proportion of the number of employees in the group g in d days of the week W defined by the formula (3) should be smaller than the non-uniformity proportion.

In addition, it should be noted that the group consistency is for the case where most employees in a group are scheduled to work in the same shift on the same day. At the moment, the value range of the consistency ratio is recommended to be 60-100%; if only a single employee of a team is scheduled on the same day, the team does not need to meet the team consistency, for example, if most employees in the team have reached vacation time or most employees have vacation, and only a small number of employees in the team are on duty, the team cannot be scheduled any more.

Illustratively, the shifts include three shifts a, b, and c, and the subgroups include five subgroups numbered 1, 2, 3, 4, and 5, respectively; and 5, 2018, month 1 and 1 are one day of the to-be-scheduled date, the scheduled groups on the day comprise a group 1 and a group 2, most of the staff of the group 1 need to be on duty and meet the group consistency, and most of the staff of the group 2 do not need to be on duty and do not need to meet the group consistency. Further, the group 1 had 10 employees, all of which were scheduled on the day and were scheduled in three shifts a, b and c, wherein the proportion of the number of employees scheduled on the a shift was 80%, the proportion of the number of employees scheduled on the b shift was 10%, and the proportion of the number of employees scheduled on the c shift was 10%, i.e., 8 employees on the a shift, 1 employee on the b shift, and 1 employee on the c shift; for group 2, however, group 2 also had 10 employees, but only 2 employees were scheduled to work on the day and were scheduled to be in shift a.

Optionally, the group consistency requirement further comprises:

in any group, the proportion of the number of workers on duty is greater than the consistency proportion or less than the non-consistency proportion; the number of workers on duty is the number of workers in any group in all shifts.

Alternatively, the group consistency requirement may be embodied by the following formula:

wherein formula (3) indicates that the proportion of the number of employees on duty is greater than the consistency proportion, i.e. most employees in the group are scheduled to be on duty; equation (4) indicates that the proportion of the number of employees on duty is less than the non-uniformity proportion, i.e., most employees in the group are not scheduled for duty, on vacation.

In addition, the meanings of the related letters in the formulas (4) and (5) are the same as those in the formulas (2) and (3), and are not described herein again.

The scheduling rule is a limiting condition for each condition encountered in the scheduling. For example, the shift schedule rules may include at least one of:

each employee cannot be assigned more than one shift a day;

pregnant women do not schedule the night shift;

the single-skill staff does not arrange the night class;

Optionally, step 102 further comprises the following process:

Through this process, the number of employees can be minimized to reduce payroll costs, management costs, and the like.

The scheduling information comprises a date, an employee number, a shift number and the like, namely the scheduling information provides the shift number of a certain employee in the waiting scheduling time, and the employee can work according to the date and the shift number.

Optionally, the shift information may further include information such as employee name, employee group, and the like.

Illustratively, referring to table 5, table 5 shows a shift schedule information.

Staff name	Employee number	Group of	05-01	05-02	05-03	05-04	05-05
								Witch Jiali	01190613	Happy house	rest	rest	2	3	4
Liao winter shade	40043679	Happy house	rest	rest	2	3	4
								Liyaghun	40074111	Happy house	rest	1	5	3	rest
Tanshi rain	40232063	Happy house	rest	1	2	rest	4
								Aged sweet night	40065226	Happy house	rest	rest	2	5	1
Roof beam top construction	40288005	Happy house	1	1	2	5	rest
								Huang Cheng (Chinese character of 'Huang Cheng')	303856	Free flight	rest	1	2	rest	2
Liu Meijing	305721	Free flight	rest	1	2	5	rest
								Wu Shanshan	30546	Free flight	rest	rest	2	3	4

TABLE 5

In table 5, rest represents rest and the numbers represent shift numbers scheduled within the corresponding dates.

In addition, it should be noted that the scheduling information is the final scheduling result, and each employee can search the on-duty information from the scheduling information and go on-duty according to the on-duty information. For example, an employee with an employee name of witch has a rest on days 1 and 2 at 5 months, a shift numbered 2 on day 3 at 5 months, a shift numbered 3 on day 4 at 5 months, and a shift numbered 4 on day 5 at 5 months.

In addition, referring to fig. 4, the scheduling method shown in fig. 4 can also be used to implement scheduling, compared with the scheduling method of step 101-102, the scheduling method shown in fig. 4 is added with a step of a dashed box, and the step of the dashed box mainly includes evaluation, optimization, adjustment, and the like to optimize the scheduling method and improve the scheduling efficiency.

Whether the evaluation is passed or not is used for evaluating the shift information obtained by the mixed integer programming method according to the evaluation index and giving a result; when the evaluation is not passed, performing an adjustment step, and performing scheduling again by adjusting constraint conditions and/or solving methods; when the optimization is passed through the evaluation, whether the optimization is available is judged, if the optimization is available, the adjustment constraint condition and/or the solving method are adjusted, and the shift is rearranged to optimize the shift information; and if the optimization is not possible, outputting shift information and index evaluation.

The evaluation index may be used to evaluate whether each constraint condition is satisfied, for example, whether the on-duty will of each employee is satisfied, whether the on-duty will of each employee is consistent with the scheduling rule, whether the employee information is wrong, and the like.

Whether optimization is available or not can be judged through the service demand satisfaction rate, for example, when the service demand satisfaction rate is lower than a preset value, optimization is determined to be available, and if the service demand satisfaction rate is higher than the preset value, optimization is determined not to be needed.

The index analysis can display various index results through a graphical user interface so as to conveniently and comprehensively know the scheduling information. For example, the service demand satisfaction rate, the employee usage rate, the average value of the employee working hours, the average value of the employee rest times, and the like.

The solving method can be a data splitting solution, for example, when the period to be scheduled is long or the data used for scheduling is large, the period to be scheduled can be divided into multiple groups according to the date for scheduling, or the data used for scheduling can be divided into multiple groups for scheduling; so as to reduce the solving time and improve the solving efficiency.

In addition, according to the scheduling method provided by the embodiment of the application, when configuration information such as service requirement information and the like changes, new scheduling information can be regenerated only by correspondingly modifying the changed information, so that the scheduling method is more convenient, flexible and efficient.

In addition, the scheduling method provided by the embodiment of the application limits the situation of staff waste caused by meeting business requirements by increasing the constraint condition of the using number of the staff, and achieves the effect of saving manpower and wasting under the situation of meeting the business requirements.

The embodiments in this specification are described in a progressive manner, and similar parts between the various embodiments are referred to each other. The examples below each step focus on the specific method below that step. The above-described embodiments are merely illustrative, the specific examples are merely illustrative of the present invention, and those skilled in the art can make various modifications and enhancements without departing from the principles of the examples described herein, which should be construed as within the scope of the present invention.

Fig. 5 is a block diagram of a shift arrangement device according to an embodiment of the present application. As shown in fig. 5, the apparatus includes:

the first solving module 401 is configured to solve, by using a mixed integer programming method, optimal shift information that meets constraint conditions based on configuration information of a time period to be scheduled, where the configuration information includes service demand information, shift types, time slices, time of going to and going from a shift, and employee information, and the shift information includes dates, shift numbers, and employee numbers of each shift;

and the second solving module 402 is configured to solve the scheduling information meeting the group consistency requirement by using a mixed integer programming method based on the optimal shift information, the group information and the scheduling rule.

Optionally, the employee information includes an employee total number and an employee number; the service demand information comprises the number of staff required by each time slice in the period of waiting for scheduling; the group information comprises group number information and member information; a shift comprises a plurality of time slices that are consecutive in time; the scheduling information includes date, employee number and shift number.

Optionally, the group consistency requirements include:

Optionally, the group consistency requirement further comprises:

Optionally, the shift schedule rules include at least one of:

each employee cannot be assigned more than one shift a day;

pregnant women do not schedule the night shift;

the single-skill staff does not arrange the night class;

Optionally, the second solving module 402 is further configured to:

In addition, please refer to the method embodiment for related contents in the device embodiment, which are not described herein again.

To sum up, in the scheduling device provided in the embodiment of the present application, first, according to the acquired configuration information, the optimal shift information satisfying the constraint condition is solved by a mixed integer programming method; and finally, based on the optimal shift information, the group information and the scheduling rules, solving the scheduling information meeting the group consistency by a mixed integer programming method. Therefore, the scheduling method provided by the embodiment of the application can solve the corresponding scheduling information by only determining the configuration information, such as the service requirement information, the employee information, the group consistency, the scheduling rule and other limiting conditions, and using a specific solution; therefore, the scheduling method does not need to depend on history too much, the scheduling result is more in line with the current requirement, excessive scheduling experience accumulation of a human resource manager is not required, management risks are not easy to cause, in addition, the scheduling method can be suitable for different management occasions, the application range is wide, and the convenience of scheduling is improved; moreover, the scheduling method is based on team scheduling, and management convenience is improved.

In addition, according to the scheduling device provided by the embodiment of the application, when the configuration information, the service requirement information and the like are changed, new scheduling information can be generated again only by correspondingly modifying the changed information, so that the scheduling device is more convenient, flexible and efficient.

In addition, the scheduling device provided by the embodiment of the application limits the waste condition of the staff caused by meeting the business requirement by increasing the constraint condition of the using number of the staff, and achieves the effect of saving manpower and wasting under the condition of meeting the business requirement.

Fig. 6 is a schematic structural diagram of a computer system according to an embodiment of the present application, and the computer system includes a Central Processing Unit (CPU)501, which can execute various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section into a Random Access Memory (RAM) 503. In the RAM503, various programs and data necessary for system operation are also stored. The CPU 501, ROM 502, and RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.

The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output section including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The drives are also connected to the I/O interface 505 as needed. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.

In particular, the processes described above with reference to flowcharts 1-3 may be implemented as computer software programs, according to embodiments of the present invention. For example, embodiments 1-3 of the present invention include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication section, and/or installed from a removable medium. The above-described functions defined in the system of the present application are executed when the computer program is executed by the Central Processing Unit (CPU) 501.

It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units described in the embodiments of the present invention may be implemented by software, or may be implemented by hardware, and the described units may also be disposed in a processor. Wherein the names of the elements do not in some way constitute a limitation on the elements themselves. The described units or modules may also be provided in a processor, and may be described as: a processor includes a first solving module and a second solving module. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.

As another aspect, the present application also provides a computer-readable medium, which may be contained in the electronic device described in the above embodiments; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs, which when executed by the electronic device, cause the electronic device to implement the scheduling method as described in the above embodiments.

For example, the electronic device may implement the following as shown in fig. 1: and step 101, solving the optimal shift information meeting the constraint condition by a mixed integer programming method based on the configuration information of the time period to be scheduled. And 102, based on the optimal shift information, the group information and the scheduling rules, solving the scheduling information meeting the group consistency requirement by a mixed integer programming method. As another example, the electronic device may implement the various steps shown in fig. 2-4. It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.

Moreover, although the steps of the methods of the present disclosure are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware.

To sum up, in the scheduling computer system provided in the embodiment of the present application, first, according to the acquired configuration information, the optimal shift information satisfying the constraint condition is solved by a mixed integer programming method; and finally, based on the optimal shift information, the group information and the scheduling rules, solving the scheduling information meeting the group consistency by a mixed integer programming method. Therefore, the scheduling method provided by the embodiment of the application can solve the corresponding scheduling information by only determining the configuration information, such as the service requirement information, the employee information, the group consistency, the scheduling rule and other limiting conditions, and using a specific solution; therefore, the scheduling method does not need to depend on history too much, the scheduling result is more in line with the current requirement, excessive scheduling experience accumulation of a human resource manager is not required, management risks are not easy to cause, in addition, the scheduling method can be suitable for different management occasions, the application range is wide, and the convenience of scheduling is improved; moreover, the scheduling method is based on team scheduling, and management convenience is improved.

In addition, the scheduling computer system provided by the embodiment of the application can regenerate new scheduling information only by correspondingly modifying the changed information when the configuration information, the service requirement information and the like are changed, so that the scheduling method is more convenient, flexible and efficient.

In addition, the shift scheduling computer system provided by the embodiment of the application limits the situation of staff waste caused by meeting business requirements by increasing the constraint condition of the using number of the staff, and achieves the effect of saving manpower and wasting under the situation of meeting the business requirements.

The foregoing is considered as illustrative only of the preferred embodiments of the invention and illustrative only of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the invention. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.

Claims

1. A scheduling method, characterized in that the method comprises:

2. The scheduling method according to claim 1,

the employee information comprises the total number of the employees and the serial numbers of the employees;

the service demand information comprises the number of staff required by each time slice in the period to be scheduled;

a shift comprises a plurality of time slices that are consecutive in time;

the scheduling information comprises a date, the employee number and the shift number.

3. The scheduling method of claim 1 wherein the team consistency requirement comprises:

in the time period to be scheduled by taking days as a unit, aiming at a first group and a first shift, the proportion of the number of employees of the first shift in the first group is greater than a consistency proportion, and the proportion of the number of employees of other shifts except the first shift is less than a non-consistency proportion, so that the employees of the first group with the consistency proportion are arranged in the same shift, and the first group meets the consistency requirement;

the first group is any group, the first shift is any shift, the consistency ratio is greater than the non-consistency ratio, and the sum of the consistency ratio and the non-consistency ratio is 1.

4. The scheduling method of claim 3 wherein the team consistency requirement further comprises:

the number of the staff working is the number of the staff in any group in all the shifts.

5. The scheduling method of claim 1 wherein the scheduling rules include at least one of:

each employee cannot be assigned more than one shift a day;

pregnant women do not schedule the night shift;

the single-skill staff does not arrange the night class;

and according to the employee number and the leave asking date of the leave asking employee, not arranging the employee corresponding to the employee number to work in the leave asking date.

6. The scheduling method of claim 1, wherein solving scheduling information satisfying a group consistency requirement by a mixed integer programming method based on the optimal shift information, group information and scheduling rules comprises:

and when a plurality of candidate scheduling information appears in the mixed integer programming method solution, calculating the number of staff in the plurality of candidate scheduling information, and taking the scheduling information with the minimum number of staff as the optimal scheduling information.

7. A shift arrangement device, the device comprising:

the system comprises a first solving module, a second solving module and a third solving module, wherein the first solving module is used for solving optimal shift information meeting constraint conditions by a mixed integer programming method based on configuration information of a time period to be scheduled, the configuration information comprises service demand information, shift types, time slices, time of going to and going from the shift and employee information, and the shift information comprises dates, shift numbers and the number of employees in each shift;

8. The scheduling apparatus of claim 7 wherein the team consistency requirement comprises:

9. A computer apparatus, characterized in that the apparatus comprises:

one or more processors;

a memory for storing one or more programs;

the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-6.

10. A computer-readable storage medium, having stored thereon a computer program for:

the computer program, when executed by a processor, implements the method of any one of claims 1-6.