CN112749944A

CN112749944A - Scheduling method, device, equipment and storage medium

Info

Publication number: CN112749944A
Application number: CN201911047519.4A
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: determining available shifts through a preset algorithm according to the acquired configuration information; 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 condition by a mixed integer programming method; and solving the scheduling information by a mixed integer programming method based on the optimal shift information and the scheduling rule. 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, and improves the convenience of scheduling.

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:

determining an available shift through a preset algorithm according to acquired configuration information, wherein the configuration information comprises a shift type, time slices and time of getting on and off the shift, and one shift comprises a plurality of time slices which are continuous in time;

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 condition by a mixed integer programming method, wherein the shift information comprises date, shift number and the number of employees in each shift;

and solving the scheduling information by a mixed integer programming method based on the optimal shift 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 scheduling information includes date, employee number and shift number.

Optionally, the constraints comprise 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 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.

Optionally, solving the optimal shift information satisfying the constraint condition by a mixed integer programming method includes:

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.

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.

Optionally, the preset algorithm comprises a brute force search algorithm, a heuristic search algorithm or a global search algorithm.

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

the determining module is used for determining an available shift through a preset algorithm according to the acquired configuration information, wherein the configuration information comprises a shift type, time slices and time of going to and going from the shift, and one shift comprises a plurality of time slices which are continuous in time;

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 service demand information, the employee information and the available shift of the period to be scheduled, wherein 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 by a mixed integer programming method based on the optimal shift information and the scheduling rule.

Optionally, the constraints comprise at least one of:

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, an available shift is determined according to the acquired configuration information; then, 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 condition by a mixed integer programming method; and finally, based on the optimal shift information and the shift scheduling rule, solving the shift scheduling information 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, the service requirement information, the employee information, the scheduling rule and other limiting conditions and using a specific solution method; 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 adapt to different management occasions, the application range is wide, and the scheduling 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 generating available shifts according to an embodiment of the present application;

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

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

fig. 5 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 101, determining available shifts according to the acquired configuration information through a preset algorithm.

The configuration information comprises a shift type, a time slice and the time of going to and going from 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 101 may also be implemented by a process as shown in fig. 2. Compared with the implementation process, the process shown in fig. 2 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. 2, 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 102, solving the optimal shift information meeting the constraint condition by a mixed integer programming method based on the service requirement information, the employee information and the available shift of the period to be scheduled.

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.

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.

Optionally, wherein the constraint comprises at least one of:

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;

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 102 includes the following method M:

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

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 102 may further include the following method N:

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 103, solving the scheduling information by a mixed integer programming method based on the optimal shift information and the scheduling rule.

The scheduling rule is a limiting condition for each condition encountered in the scheduling. For example, the shift schedule rules include maximum number of consecutive work days per employee, maximum number of night shifts per employee per month, no night shifts for pregnant women, no night shifts for single-skill employees, etc. Optionally, when the scheduling information is solved by the mixed integer programming method, the employee attendance willingness information including the employee number and the corresponding attendance date may also be considered. 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. 3, the scheduling method shown in fig. 3 can also be used to implement scheduling, compared with the scheduling method of step 101-103, the scheduling method shown in fig. 3 adds 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 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 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. 4 is a block diagram of a shift arrangement device according to an embodiment of the present application. As shown in fig. 4, the apparatus includes:

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

Optionally, the constraints comprise at least one of:

Optionally, the first solving module is further configured to, when multiple candidate shift information occurs in the mixed integer programming method solving, calculate a sum of absolute values of differences between the number of employees in each time slice in the multiple candidate shift information and the number of employees required by a corresponding time slice in the service demand information, and take shift information with the smallest sum of absolute values as the optimal shift information.

Optionally, the first solving module is further configured to, when multiple candidate shift information appears in the mixed integer programming method solution, calculate a sum of absolute values of differences between the number of employees in each time slice in the candidate shift information at the time period to be shifted and the number of employees needed by the corresponding time slice in the service demand information, compare the sum of absolute values of the differences with a set value, and use the candidate shift information of which the sum of absolute values of the differences is smaller than the set value as the preferred shift information;

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, an available shift is determined according to the acquired configuration information; then, 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 condition by a mixed integer programming method; and finally, based on the optimal shift information and the shift scheduling rule, solving the shift scheduling information by a mixed integer programming method. Therefore, the scheduling device provided by the embodiment of the application can solve the corresponding scheduling information by only determining the configuration information, the service requirement information, the staff information, the scheduling rule and other limiting conditions and using a specific solution method; therefore, the scheduling device does not need to rely too much on history, 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, the scheduling device can adapt to different management occasions, the application range is wide, and the scheduling 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. 5 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 determination module, 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: step 101, determining available shifts through a preset algorithm according to acquired configuration information; 102, solving the optimal shift information meeting the constraint condition by a mixed integer programming method based on the service demand information, the employee information and the available shift of the period to be scheduled; and 103, solving the scheduling information by a mixed integer programming method based on the optimal shift information and the scheduling rule. As another example, the electronic device may implement the various steps shown in fig. 2 and 3. 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 shift scheduling computer system provided in the embodiment of the present application, first, an available shift is determined according to the acquired configuration information; then, 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 condition by a mixed integer programming method; and finally, based on the optimal shift information and the shift scheduling rule, solving the shift scheduling information by a mixed integer programming method. Therefore, the scheduling computer system provided by the embodiment of the application can solve the corresponding scheduling information by only determining the configuration information, the service requirement information, the employee information, the scheduling rule and other limiting conditions and using a specific solution method; therefore, the scheduling computer system does not need to rely too much on history, 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 computer system can adapt to different management occasions, the application range is wide, and the scheduling 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:

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 condition by a mixed integer programming method, wherein the shift information comprises dates, shift numbers and the number of employees in each shift;

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;

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

3. The scheduling method of claim 1, wherein the constraint condition comprises at least one of:

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

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

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

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

the number of the staff scheduled on the working day of each scheduling 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 staff arranged in each time slice in the period to be scheduled is less than the number of staff available for working in each time slice in the period to be scheduled;

the sum of the number of the staff scheduled in each shift in the period to be scheduled is less than the upper limit value of the number of the staff scheduled in each shift in the period to be scheduled;

the sum of the number of the staff scheduled in each shift in the period to be scheduled is greater than or equal to the lower limit value of the number of the staff scheduled in each shift in the period to be scheduled;

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

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

4. The scheduling method of claim 1, wherein solving the optimal shift information satisfying the constraint condition by a mixed integer programming method comprises:

and 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 plurality of candidate shift information and the number of staff required 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.

5. The scheduling method of claim 1, wherein solving the optimal shift information satisfying the constraint condition by a mixed integer programming method comprises:

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 in each time slice in the candidate shift information and the number of staff required by the corresponding time slice in the service demand information in the period to be scheduled, 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 smaller than the set value as preferred shift information;

and when the preferred shift information is multiple, 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.

6. The scheduling method of claim 1 wherein the predetermined algorithm comprises a brute force search algorithm, a heuristic search algorithm, or a global search algorithm.

7. A shift arrangement device, the device comprising:

the determining module is used for determining an available shift through a preset algorithm according to acquired configuration information, wherein the configuration information comprises a shift type, time slices and time of going to and going from the shift, and one shift comprises a plurality of time slices which are continuous in time;

8. The scheduling apparatus of claim 7 wherein the constraints comprise at least one of:

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 of 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.