CN111461469A

CN111461469A - Personnel scheduling method and computer equipment

Info

Publication number: CN111461469A
Application number: CN201910048889.3A
Authority: CN
Inventors: 向柳; 杨森; 朱胜火
Original assignee: Alibaba Group Holding Ltd
Current assignee: Alibaba Group Holding Ltd
Priority date: 2019-01-18
Filing date: 2019-01-18
Publication date: 2020-07-28
Anticipated expiration: 2039-01-18
Also published as: CN111461469B

Abstract

The invention discloses a personnel scheduling method and computer equipment, wherein the method comprises the following steps: acquiring personnel information and task information of a target scheduling cycle from an information base, wherein the personnel information at least comprises the skill attribute of personnel, the task information at least comprises the skill requirement, the working hour and the task address of a task, and the target scheduling cycle at least comprises a scheduling time period; and determining a task scheduling table of each scheduling time segment of the target scheduling period according to the personnel information and the task information of the target scheduling period, wherein the task scheduling table comprises tasks allocated to the scheduling time segments, executors of the tasks, and task sequences and path plans of the tasks required to be executed by the executors in the scheduling time segments.

Description

Personnel scheduling method and computer equipment

Technical Field

The invention relates to the technical field of personnel scheduling, in particular to a personnel scheduling method and computer equipment.

Background

At present, personnel scheduling problems are involved in the operation of more and more projects. For example, home services (e.g., reserved pick-up services, delivery home services, home services), cargo operations, and the like.

Taking the above-mentioned service as an example, the time consumed by the worker includes not only the time to complete the task but also the transit time to the task site. Thus, task allocation to workers and path planning to a task place become important factors influencing the time consumption of the workers.

At present, task allocation is usually performed on workers only through a manual or traditional scheduling system, and path planning to a task site is not considered. This makes the task assignment to the staff finally unreasonable, resulting in an increased time-consuming task completion for the staff.

Disclosure of Invention

The invention aims to provide a personnel scheduling scheme.

According to a first aspect of the present invention, there is provided a method for scheduling people, comprising:

acquiring personnel information and task information of a target scheduling cycle from an information base, wherein the personnel information at least comprises the skill attribute of personnel, the task information at least comprises the skill requirement, the labor hour and the task address of a task, and the target scheduling cycle at least comprises a scheduling time period;

and determining a task scheduling table of each scheduling time segment of the target scheduling period according to the personnel information and the task information of the target scheduling period, wherein the task scheduling table comprises tasks allocated to the scheduling time segments, executors of the tasks, and task sequences and path plans of the tasks required to be executed by the executors in the scheduling time segments.

Optionally, the determining a task schedule of each scheduling time segment of the target scheduling cycle according to the staff information and the task information of the target scheduling cycle includes:

classifying the tasks of the target scheduling period according to the skill requirements of the tasks;

determining personnel corresponding to each type of tasks in the target scheduling period from the personnel in the target scheduling period according to the skill attributes of the personnel;

acquiring the traffic time cost between any two tasks in each class of tasks of the target scheduling period;

and for each type of task in the target scheduling period, selecting executive personnel from the personnel corresponding to the type of task according to the working hour, the task address and the traffic time cost of the task, and determining the task scheduling table, so that the total traffic time cost spent for completing the type of task is the lowest.

Optionally, the obtaining of the traffic time cost between any two tasks in each class of tasks of the target scheduling period includes:

determining a transit time cost between any two tasks based on a travel time algorithm based at least on the task addresses of the any two tasks.

Optionally, for each type of task in the target scheduling period, based on at least one of a genetic algorithm, a local area search algorithm, a lagrangian relaxation algorithm, or a column generation algorithm, an executive person is selected from the persons corresponding to the type of task and the task scheduling table is determined, so that the total traffic time cost for completing the type of task is the lowest.

Optionally, the method further includes:

the task scheduling table of a first scheduling time period is issued to a relevant executive terminal, wherein the first scheduling time period is the first scheduling time period of a target scheduling cycle;

and acquiring the completion condition of the task in the first scheduling time period, and marking the completed task in the information base.

Optionally, the method further includes:

and taking the time length of the scheduling time period as the window length of a sliding time window, and performing sliding updating on the target scheduling period and the task scheduling table of the target scheduling period.

Optionally, the information of the person further includes a working time range of the person; before the step of acquiring the personnel information and the task information of the target scheduling period from the information base, the method further comprises the following steps:

acquiring personnel information and task information in a prearranged scheduling period from an information base; the time range of the pre-scheduling period covers the time range of the target scheduling period;

classifying the tasks in the prearranged scheduling period according to the skill requirements of the tasks;

determining personnel corresponding to each type of tasks in the pre-scheduling period from the personnel in the pre-scheduling period according to the skill attributes of the personnel;

determining the total working time of the personnel corresponding to each type of task of the pre-scheduling period according to the working time range of the personnel;

determining the time consumption of each type of task in a pre-scheduling period, wherein the time consumption of the task is the sum of the working hour and the working gap time of the task;

and for each type of task in the pre-scheduling period, if the total consumed time of the type of task is longer than the total working time of the personnel corresponding to the type of task, adding the type of task and the personnel supplemented corresponding to the type of task to the information base.

Optionally, wherein the method further comprises:

and if the total consumed time of the tasks is longer than the total working time of the personnel corresponding to the tasks, generating early warning information of personnel shortage so as to prompt the supplement of the personnel corresponding to the tasks.

Optionally, the method further includes:

if the total consumed time of the task is longer than the total working time of the personnel corresponding to the task, acquiring the number of the personnel needing to be supplemented for the task;

and calling the number of the personnel from the spare personnel warehouse for supplement according to the number of the personnel needing to be supplemented.

Optionally, the method further includes:

and when a new task which needs to be executed in a second scheduling time period is received, inserting the new task into a task scheduling table of the second scheduling time period based on a cost function algorithm, wherein the second scheduling time period is one scheduling time period of the target scheduling cycle.

Optionally, the inserting the new task into the task scheduling table of the first scheduling time period based on the cost function algorithm includes:

screening out executives matched with the skill requirements of the new task from the executives in the first scheduling time period according to the skill requirements of the new task;

for any screened executive personnel, determining the minimum insertion cost and the optimal insertion position for inserting a new task into the work sequence of the executive personnel, wherein the optimal insertion position is the insertion position corresponding to the minimum insertion cost;

sequencing all the screened executive personnel according to the minimum insertion cost, and determining the executive personnel with the minimum insertion cost as the optimal executive personnel;

and inserting the new task into the task sequence of the optimal executive personnel according to the optimal insertion position of the optimal executive personnel and regenerating the path plan.

Optionally, the minimum insertion cost and the optimal insertion position are determined by:

for any one screened executive staff, inserting the new task into each position of the work sequence of the executive staff and calculating the insertion cost corresponding to each insertion position so as to determine the minimum insertion cost and the optimal insertion position for inserting the new task into the work sequence of the executive staff;

the insertion cost corresponding to the insertion position is the difference value of the efficiency when no new task is inserted and the efficiency when the new task is inserted into the insertion position, and the efficiency is the sum of the total working hours of the tasks of the executive in the first scheduling time period/the total working hours of the tasks of the executive in the first scheduling time period and the total traffic time cost.

Optionally, the person information further includes any combination of the following information: salary cost, working time range, working address range, residence, skill level and task taboo of personnel; the task information further includes any combination of the following information: price, execution time range, skill level requirements of the task.

According to a second aspect of the present invention, there is provided a method for scheduling people, comprising:

for each type of task in the pre-scheduling period, if the total consumed time of the type of task is longer than the total working time of the personnel corresponding to the type of task, adding the type of task and the personnel supplemented corresponding to the type of task to the information base;

determining a task scheduling table of each scheduling time segment of the target scheduling period according to the personnel information and the task information of the target scheduling period, wherein the task scheduling table comprises tasks allocated to the scheduling time segments, executors of the tasks, and task sequences and path plans of the tasks required to be executed by the executors in the scheduling time segments;

According to a third aspect of the present invention, there is provided a computer apparatus comprising a memory for storing computer instructions and a processor for invoking the computer instructions from the memory to perform the people scheduling method as any one of the first aspect of the present invention provides.

According to a fourth aspect of the present invention, there is provided a computer apparatus comprising a memory for storing computer instructions and a processor for calling the computer instructions from the memory to perform the people scheduling method as any one of the second aspect of the present invention provides.

According to the personnel scheduling method, the multi-dimensional personnel information and the multi-dimensional task information of the target scheduling period are obtained from the information base, and the task scheduling list of each scheduling time period of the first period is determined. The method of the embodiment comprehensively considers the task addresses among different tasks while performing task arrangement, so that the path planning among the tasks is considered when determining the task arrangement table of the target scheduling period, and the path planning and the task arrangement among the tasks are not separately considered, that is, the personnel scheduling method provided by the invention can reasonably perform task arrangement on personnel, thereby reducing the working time of the personnel. Meanwhile, the task scheduling table of the target scheduling period also gives a task sequence and path planning of tasks required to be executed by the executive in the scheduling time period.

Other features of the present invention and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the embodiments will be briefly described below. It is appreciated that the following drawings depict only certain embodiments of the invention and are therefore not to be considered limiting of its scope. For a person skilled in the art, it is possible to derive other relevant figures from these figures without inventive effort.

FIG. 1 is a schematic structural diagram of a computer device according to an embodiment of the present invention;

FIG. 2 is a schematic diagram of another computer device according to an embodiment of the present invention;

fig. 3 is a schematic flowchart of a personnel scheduling method according to an embodiment of the present invention;

fig. 4 is a flowchart illustrating a task scheduling method for determining each scheduling time segment of a target scheduling cycle according to an embodiment of the present invention;

FIG. 5 is a schematic diagram of a sliding time window according to an embodiment of the present invention;

fig. 6 is a schematic structural diagram of a scheduling system according to an embodiment of the present invention;

fig. 7 is a schematic flow chart of an early warning method according to an embodiment of the present invention;

fig. 8 is a schematic structural diagram of another computer device according to an embodiment of the present invention.

Detailed Description

Various exemplary embodiments of the present invention will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention unless specifically stated otherwise.

The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the invention, its application, or uses.

Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.

In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.

It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.

< hardware configuration >

The execution main body of the personnel scheduling method provided by the embodiment of the invention can be computer equipment, and can also be a hardware module and/or a software module in the computer equipment. Fig. 1 and 2 show block diagrams of hardware configurations of computer apparatuses implementing an embodiment of the present invention.

In one embodiment, as shown in FIG. 1, the computer device may be a server 1100.

The server 1100 provides a service point for processes, databases, and communications facilities. The server 1100 can be a unitary server or a distributed server across multiple computers or computer data centers. The server may be of various types, such as, but not limited to, a web server, a news server, a mail server, a message server, an advertisement server, a file server, an application server, an interaction server, a database server, or a proxy server. In some embodiments, each server may include hardware, software, or embedded logic components or a combination of two or more such components for performing the appropriate functions supported or implemented by the server. For example, a server, such as a blade server, a cloud server, etc., or may be a server group consisting of a plurality of servers, which may include one or more of the above types of servers, etc.

In this embodiment, the server 1100 may include a processor 1110, a memory 1120, an interface device 1130, a communication device 1140, a display device 1150, and an input device 1160, as shown in fig. 1.

In this embodiment, the server 1100 may also include a speaker, a microphone, and the like, which are not limited herein.

The processor 1110 may be a dedicated server processor, or may be a desktop processor, a mobile processor, etc. that meets performance requirements, without limitation, the memory 1120 includes, for example, ROM (read only memory), RAM (random access memory), a non-volatile memory such as a hard disk, etc., the interface device 1130 includes, for example, various bus interfaces such as a serial bus interface (including a USB interface), a parallel bus interface, etc., the communication device 1140 is capable of wired or wireless communication, the display device 1150 is, for example, a liquid crystal display, L ED display touch screen, etc., the input device 1160 may include, for example, a touch screen, a keyboard, etc.

In this embodiment, the memory 1120 of the server 1100 is configured to store instructions for controlling the processor 1110 to operate at least to perform the method of person scheduling according to any embodiment of the present invention. The skilled person can design the instructions according to the disclosed solution. How the instructions control the operation of the processor is well known in the art and will not be described in detail herein.

Although shown as multiple devices in fig. 1, the present invention may relate to only some of the devices, e.g., server 1100 may relate to only memory 1120 and processor 1110.

In one embodiment, the computer device may be a terminal device 1200 such as a PC, a notebook computer, or the like used by an operator, which is not limited herein.

In this embodiment, referring to fig. 2, the terminal apparatus 1200 may include a processor 1210, a memory 1220, an interface device 1230, a communication device 1240, a display device 1250, an input device 1260, a speaker 1270, a microphone 1280, and the like.

The processor 1210 may be a mobile version processor, the memory 1220 may include, for example, a ROM (read only memory), a RAM (random access memory), a non-volatile memory such as a hard disk, etc., the interface device 1230 may include, for example, a USB interface, a headset interface, etc., the communication device 1240 may, for example, be capable of wired or wireless communication, the communication device 1240 may include a short-range communication device, for example, any device capable of short-range wireless communication based on a short-range wireless communication protocol such as Hilink protocol, WiFi (IEEE 802.11 protocol), Mesh, bluetooth, ZigBee, Thread, Z-Wave, NFC, UWB, L iFi, etc., the communication device 1240 may also include a remote communication device, for example, any device capable of W L AN, GPRS, 2G/3G/4G/5G remote communication, the display device 1250, for example, a liquid crystal display, touch display, etc., the input device 1260 may include, for example, a touch screen, keyboard, etc., the user may input/output voice information through the speaker 1270 and the microphone 1280.

In this embodiment, the memory 1220 of the terminal device 1200 is used to store instructions for controlling the processor 1210 to operate at least to perform the method of person scheduling according to any of the embodiments of the present invention. The skilled person can design the instructions according to the disclosed solution. How the instructions control the operation of the processor is well known in the art and will not be described in detail herein.

Although a plurality of devices of the terminal apparatus 1200 are shown in fig. 2, the present invention may relate only to some of the devices, for example, the terminal apparatus 1200 relates only to the memory 1220 and the processor 1210 and the display device 1250.

< first method embodiment >

The following embodiments will describe the personnel scheduling method provided by the embodiments of the present invention, with a server as an execution subject.

The personnel scheduling method provided by the embodiment of the invention, as shown in fig. 3, includes the following steps S101 and S102:

s101, acquiring the personnel information and the task information of the target scheduling period from the information base.

Specifically, the person of the target scheduling period refers to a person who can perform a task at least for a part of the time within the target scheduling period.

Wherein the personnel information at least comprises: the skill attributes of the person. Optionally, the personnel information further comprises any combination of the following: salary cost of personnel, working time range, working address range, residence, skill level, and task contraindications. Of course, the person information may also include other information, such as contact details of the person, the person role, assigned tasks, gender, number, and the like.

For example, the skill attributes of a person may be: care, maintenance, housekeeping, handling, etc.; the salary cost of personnel can be 3000 yuan/month, 4000 yuan/month and the like, 80 yuan/hour and the like; the operating time range may be: 09:00-18:00 on Monday through Friday, 10:00-20:00 on Saturday and weekend, etc.; the working address range may be: zone A, zone B, city, etc.; the addresses can be as follows: home address, current temporary address; the skill level may be: high-grade, medium-grade, normal; the task taboos may be: tasks rejected by personnel; the contact ways of the persons may be: telephone, mailbox, WeChat, etc.; the human role can be: official staffs and temporary staffs.

In one example, one person information is: the skill attribute is housekeeping, the salary cost is 3000 yuan/month, the working time range is 09:00-18:00 from Monday to Friday, the working address range is A area, and the skill level is as follows: the senior, personnel role is formal personnel, and the phone number is 180 x 1234.

It should be noted that, some parameters may be configured in advance in the information base, for example, the working time range of each person is configured uniformly as follows: 09:00-18:00 on Monday to Saturday.

For example, when the personnel information of the target scheduling period is acquired from the information base, a scheduling time range can be determined according to the time starting point and the time ending point of the target scheduling period. And determining the personnel information within the scheduling time range according to the preset working time range of each personnel. And taking the determined personnel information located in the scheduling time range as the personnel information in the target scheduling period.

Specifically, the task of the target scheduling period refers to a task that has not been completed yet and needs to be completed within the target scheduling period.

Wherein, the task information at least comprises: skill requirements of the task, man-hours, and task address. Optionally, the task information further includes any combination of the following information: price of task, skill level requirements, execution time range. Of course, the task information may also include other information, such as personnel preferences, and the like.

For example, the skill requirements of a task may be: the working hours of nursing, maintenance, housekeeping, carrying and the like can be as follows: 1 hour, 2 hours, etc.; the execution range may be: number 10 of 12 months in 2018, number 10 of 12 months in 2018-number 12 months in 2018, and the like; the price of the task may be: 100 Yuan or less, 100-200 Yuan, etc.; the skill level requirement may be: high, medium, normal, arbitrary, at least medium, etc.; the person preferences may be: sheet three is designated.

In one example, one task information may be: the skill requirement is housekeeping, the price of the task is between 100 and 200 yuan, the working hours are 2 hours, the skill requirement is of any level, and the execution range is between 14:00 and 17:00 in 12 months and 12 months in 2018.

For example, the task information in the information base may identify the scheduling period in advance. For example, when a user submits a task to the information base, a scheduling period corresponding to an execution time range of the task to be executed is selected, and the information base identifies the scheduling period selected by the user.

For example, the time range corresponding to the target scheduling period is a future time range, and may be 5 days, 7 days, or the like. The target scheduling period includes at least one scheduling period, and the one scheduling period may be 1 day. For example, the target scheduling cycle is 11 days in 12 months in 2018 to 17 days in 12 months in 2018, the target scheduling cycle includes 7 scheduling time periods, and each scheduling time period sequentially includes: 11 days in 12 months in 2018, 12 days in 12 months in 2018, 13 days in 12 months in 2018, 14 days in 12 months in 2018, 15 days in 12 months in 2018, 16 days in 12 months in 2018 and 17 days in 12 months in 2018.

S102, determining a task scheduling table of each scheduling time segment of the target scheduling cycle according to the personnel information and the task information of the target scheduling cycle.

The task scheduling list comprises task information and executive personnel allocated to the scheduling time period, and task sequences and path plans which need to be executed by the executive personnel in the scheduling time period. Further, the task sequence refers to an execution order of the tasks. The path planning can include a specific path between two adjacent tasks, a riding route and the like.

Optionally, when the above S102 is executed, one or more constraints may be set by using one or more specific information of the staff information and the task information of the target scheduling period, and under the constraints of the constraints, the task scheduling table of each scheduling time period of the target scheduling period is determined. The constraint condition may be, for example: arranging the personnel to tasks corresponding to the skill requirements matched with the skill attributes of the personnel; the work time of the task arrangement for the executive must be within the execution time range of the task; the work time that the task is scheduled for the executive must be within the range of the work time of the executive; the task addresses of the tasks distributed to the same executive are concentrated in one area, or the distance between the task address of the task distributed to the same executive and the address of the executive is within a preset distance range; the sum of the total working hours of the tasks distributed to the same executive personnel and the total traffic time between the tasks does not exceed a preset value; the total traffic time of tasks assigned to the same executive is shortest; prioritizing executive with a high skill level; tasks that have been historically rejected by an executive are no longer assigned to that executive; the personnel of regular staff are prioritized, or the personnel of temporary staff are prioritized, etc. The above constraints may be combined.

Optionally, as shown in fig. 4, the above S102 may also be implemented by the following S1021 to S1024:

and S1021, classifying the tasks in the target scheduling period according to the skill requirements of the tasks.

For example, when the skill requirements of a task are care, maintenance and housekeeping, the skill requirements are classified as care and are denoted as care. The skill requirement is classified as maintenance and is marked as maintenance. The skill requirements are classified as household and are recorded as household.

And S1022, determining the personnel corresponding to each type of task in the target scheduling period from the personnel in the target scheduling period according to the skill attributes of the personnel.

In one example, when tasks of a target scheduling period are divided according to their skill requirements: and when the personnel in the first period are nursing, maintenance and household, determining the personnel skill attributes as the personnel in the nursing, maintenance and household.

And S1023, acquiring the traffic time cost between any two tasks in each class of tasks of the target scheduling period.

Alternatively, in performing the above S1023, the travel time cost between any two tasks in each kind of task may be estimated based on the straight-line distance between the task addresses of the two tasks and the travel speed of the public transportation.

Optionally, when the above S1023 is executed, the traffic time cost between any two tasks in each type of task may also be calculated by using the existing map technology according to the task addresses of any two tasks.

Optionally, when the above S1023 is executed, the traffic time cost between any two tasks in each type of task may also be calculated by using the historical traffic record data according to the task addresses of any two tasks.

Optionally, when the above S103 is executed, the travel time cost between any two tasks may be determined based on the travel time algorithm according to at least the task addresses of any two tasks. Specifically, the method comprises the following steps: inputting the task addresses of any two tasks into a travel matrix; and calculating through the travel matrix, and finally outputting the traffic time cost between the two tasks.

It should be noted that, when the above-mentioned S103 is executed, the traffic time cost between any two tasks may also be determined based on the travel time algorithm according to the task addresses of any two tasks and the traffic situation between the task addresses of any two tasks. Specifically, the task addresses of any two tasks and the weights of different traffic conditions between the task addresses of any two tasks are given, and then the traffic time cost between any two tasks is determined based on a travel time algorithm.

And S1024, for each type of task in the target scheduling period, selecting executive personnel from the personnel corresponding to the type of task according to the working hour, the task address and the traffic time cost of the task, and determining a task scheduling table so that the total traffic time cost spent for completing the type of task is the lowest.

That is, when determining the task schedule for each type of task, the total transit time cost spent completing that type of task is the lowest as a constraint. Under the condition that other constraint conditions exist, on the premise that other constraint conditions are met, executive personnel are selected from the personnel corresponding to the tasks and the task scheduling list is determined, so that the total traffic time cost for completing the tasks is the lowest.

Optionally, when the foregoing S1024 is executed, on the premise that other constraint conditions are satisfied, for each class of tasks of the target scheduling period, the personnel arrangement condition of each class of tasks of the target scheduling period is enumerated according to the working hours, the task addresses, and the traffic time cost of the tasks. And selecting the personnel arrangement condition meeting the constraint condition that the total traffic time cost spent for completing the tasks is the lowest from the personnel arrangement conditions corresponding to the enumerated tasks. And determining a task scheduling table according to the personnel scheduling conditions meeting the constraint conditions.

Optionally, the S1024 may also be implemented by:

for each type of task in the target scheduling period, selecting executive personnel from the personnel corresponding to the type of task and determining a task scheduling table based on at least one of a genetic algorithm, a local area search algorithm, a Lagrange relaxation algorithm or a column generation algorithm, so that the total traffic time cost for completing the type of task is the lowest.

Specifically, based on the constraint condition that the total traffic time cost spent for completing the task is the lowest, at least one of a genetic algorithm, a local search algorithm, a Lagrangian relaxation algorithm or a column generation algorithm is utilized, executive personnel are selected from the personnel corresponding to the task, and a task scheduling table is determined. It should be noted that the task scheduling table can be determined quickly based on the method.

It should be noted that the genetic algorithm, the local area search algorithm, the lagrangian relaxation algorithm, or the column generation algorithm is easy to implement by those skilled in the art, and is not described herein again.

In an example, after determining the task scheduling table of each scheduling time segment of the target scheduling cycle, the administrator may read the task scheduling table of each scheduling time segment of the target scheduling cycle from the server and notify the task scheduling table to the relevant executive personnel. The relevant executive personnel can know which tasks are executed by the executive personnel, what the sequence of executing the tasks is and what the path to the next task is according to the task scheduling table of each scheduling time segment of the target scheduling cycle.

In an optional first embodiment, on the basis of any one of the above embodiments, the personnel scheduling method provided by the present invention further includes the following steps S103 and S104:

s103, issuing the task scheduling table of the first scheduling time period to the relevant executive personnel terminal, wherein the first scheduling time period is the first scheduling time period of the target scheduling cycle.

Specifically, the target scheduling cycle includes 5 days of 12 months and 11 days of 2018 to 12 months and 15 days of 2018, one scheduling time period is 1 day, and the first scheduling time period is 12 months and 11 days of 2018. When the above S103 is executed, optionally, the server may issue the task scheduling table corresponding to 12, month and 11 days in 2018 to the relevant executive person terminal. The server can also send the task arrangement (including task sequence and path planning) of the same executive in the task arrangement table corresponding to 12, 11 and 2018 to the corresponding executive terminal.

S104, acquiring the completion condition of the task in the first scheduling time period, and marking the completed task in the information base.

Specifically, the executive performs the task according to the received task schedule. In the execution process, the completion condition of the task can be fed back to the server through the executive personnel terminal at any time. Taking as an example that one executive needs to execute tasks as task 1, task 2, and task 3 in sequence, the completion condition of the tasks may be: all tasks are completed, task 1 and task 2 are completed, but task 3 cannot be completed due to traffic congestion and the like.

The server receives the task completion condition fed back by the executive through the terminal, can redistribute the incomplete task to another person, and informs the other person of new task arrangement. In addition, the server needs to mark the completed tasks to avoid the server from rearranging the completed tasks.

Based on the embodiment, the personnel scheduling method provided by the invention can issue the task scheduling list of the first scheduling time period to the relevant executive personnel terminal, so that the executive personnel can timely know the tasks scheduled to the executive personnel. In addition, only the task scheduling table of the first scheduling time period is issued to the relevant executive personnel terminal, and the task scheduling tables of all scheduling time periods in the target scheduling period are not issued to the relevant executive personnel terminal, so that the situation that the server issues the task scheduling tables to the executive personnel terminal for many times when tasks such as new task addition or task cancellation are changed after the first scheduling time period can be avoided.

In an optional embodiment two, on the basis of the optional embodiment one, the method for scheduling people further includes the following step S105:

and S105, taking the time length of the scheduling time period as the window length of the sliding time window, and performing sliding updating on the target scheduling period and the task scheduling table of the target scheduling period.

Specifically, as shown in fig. 5, taking an example that the target scheduling period is from date D to date D + T (T is an integer greater than or equal to 1), and one scheduling time period is 1 day, the specific implementation manner of S105 is:

and at the date D-1, after a task scheduling table of a target scheduling period (from the date D to the date D + T) is obtained, the task scheduling table corresponding to the date D is issued to the relevant executive personnel terminal.

And then, at the date D, updating the target scheduling period to the date D +1 to the date D + T +1, and finishing the sliding updating of the target scheduling period. The personnel scheduling method in the embodiment shown in fig. 3 is executed to obtain the task scheduling table from the date D +1 to the date D + T +1, and the sliding update of the task scheduling table of the target scheduling period is completed. And (4) optional. The task scheduling table corresponding to the date D +1 can be issued to the relevant executive personnel terminal.

……

And at the date D + D-1, updating the target scheduling period from the date D + D to the date D + T + D, and finishing the sliding update of the target scheduling period. The personnel scheduling method in the embodiment shown in fig. 3 is executed to obtain the task scheduling table from the date D + D to the date D + T + D, and the sliding update of the task scheduling table of the target scheduling period is completed. Optionally, the task scheduling table corresponding to the date D + D may be issued to the relevant executive terminal.

The staff scheduling method provided by the embodiment can perform sliding update on the target scheduling period and the task scheduling table of the target scheduling period, so that the problem that when a task changes in the target scheduling period, for example, the task is cancelled or a new task is added, the changed task cannot be scheduled is avoided. Therefore, the finally determined task scheduling list is more accurate and reasonable.

Optionally, on the basis of the foregoing embodiment, when the executive person terminal receives the task scheduling table of the first scheduling time period issued by the server, the executive person may select to accept all of the tasks scheduled for himself or select not to accept part or all of the tasks scheduled for himself. When the executive personnel selects to accept all tasks arranged for the executive personnel, the executive personnel feeds back the completion condition of the tasks to the server through the executive personnel terminal. When the executive personnel does not accept part or all of the tasks arranged for the executive personnel, the executive personnel informs the server of the tasks which are not accepted through the executive personnel terminal. The unaccepted task is reassigned by the server to another person and the other person is notified of a new task schedule.

Based on the above, the personnel scheduling method provided by the embodiment can be implemented by the framework of the scheduling system 10 shown in fig. 6. Specifically, the scheduling system 10 includes: a server 11 and a plurality of executive terminals 12.

The server 11 stores an information base, and the server 11 is configured to execute the method shown in the above-mentioned alternative embodiment.

The executive terminal 12 is used for receiving the task scheduling table of the first scheduling time period issued by the server 11; the system is further configured to feed back the completion condition of the task of the first scheduling time period to the server 11; and is also used for sending information for rejecting part or all of the tasks allocated to the server.

Correspondingly, the server 11 is further configured to receive a task completion condition of the first scheduling time period fed back by the executive terminal 12; and is also used for receiving the information of rejecting part or all of the tasks distributed to the terminal 12 and rearranging the rejected tasks.

The server 11 may be the server 1100 shown in fig. 1.

In an optional third embodiment, on the basis of any of the above embodiments, as shown in fig. 7, the personnel scheduling method provided by the present invention further includes, before S101, the following S111-S116. Wherein, S111-S116 are respectively:

s111, acquiring personnel information and task information in a pre-scheduling period from an information base; the time range of the pre-scheduled scheduling period covers the time range of the target scheduling period.

Specifically, a person who schedules a scheduling period refers to a person who can perform a task for at least a portion of the time within the scheduling period. The task of the pre-scheduling period means that the task is not completed yet and needs to be completed in the pre-scheduling period. Further, the person information in S111 further includes: the operating time range.

In one example, when the target scheduling period is 5 days from 12/11/2018/12/15/2018, the pre-scheduled scheduling period is 10 days from 12/06/2018/12/15/2018. Of course, the pre-scheduled scheduling period may also be 5 days, i.e., 11 days 12 and 12 months in 2018 and 15 days 12 and 12 months in 2018.

It should be noted that the specific description of S111 is similar to that of S101, and is not repeated here.

And S112, classifying the tasks in the pre-scheduling period according to the skill requirements of the tasks.

And S113, determining personnel corresponding to each type of task in the pre-scheduling period from the personnel in the pre-scheduling period according to the skill attribute of the personnel.

It should be noted that the specific descriptions of S112 and S113 are similar to the descriptions of S1021 and S1022, respectively, and are not repeated here.

And S114, determining the total working time of the personnel corresponding to each type of task in the pre-scheduling period according to the working time range of the personnel.

Specifically, the time lengths corresponding to the working time ranges of the personnel corresponding to each type of task of the pre-scheduling period are summed, i.e., the total working time in S114 is obtained.

And S115, determining the time consumption of each type of task in the pre-scheduling period, wherein the time consumption of the task is the sum of the working hour and the working gap time of the task.

Specifically, the above-mentioned working gap time is used to replace the traffic time to each task. For example, the working gap time may be a default time period, such as 45 min.

Of course, the working gap may also be a value set according to actual requirements. Specifically, an interface for the manager to input a specific value of the working gap is set on the terminal device or the server executing the personnel scheduling method provided in this embodiment. After a manager inputs a working gap through the interface, the terminal device or the server responds to the input operation to update the working time gap, so that the working gap is set according to actual requirements.

Specifically, for each type of task in the pre-scheduling period, the working hours corresponding to each task in each type of task are determined first. The sum of the man-hours and the preset working time gap is then taken as the elapsed time for each task in each category of tasks. And finally, traversing all tasks in each class of tasks, and taking the sum of the time consumption of all tasks in each class of tasks as the time consumption of each class of tasks in the pre-scheduling period.

And S116, for each type of task in the pre-scheduling period, if the total consumed time of the type of task is longer than the total working time of the personnel corresponding to the type of task, adding the type of task and the personnel supplemented by the corresponding type of task to an information base.

Specifically, if the total consumed time of the type of task is longer than the total working time of the personnel corresponding to the type of task, it indicates that the personnel corresponding to the type of task cannot complete the type of task. At this time, the server needs to supplement the personnel of the tasks and add the personnel information of the supplemented personnel to the information base. Optionally, taking the above-mentioned portal service as an example, a specific implementation manner of the server for supplementing the staff of the task may be: and generating personnel requesting the tasks to a certain administrative company, and acquiring the personnel information sent by the administrative company.

Correspondingly, if the total consumed time of the type of task is not more than the total working time of the personnel corresponding to the type of task, the personnel corresponding to the type of task are enough to complete the type of task. At this time, the server executes S101 described above.

In the method for scheduling staff according to this embodiment, before determining the task scheduling table of each scheduling time segment of the target scheduling cycle, it may be determined whether the staff is enough to complete the task of the target scheduling cycle. And to supplement the personnel in case of shortage of personnel. This provides sufficient personnel support for determining the task schedule for each scheduling time segment of the target scheduling cycle.

Optionally, on the basis of the above embodiment shown in fig. 7, the personnel scheduling method provided by the present invention further includes the following step S117:

and S117, if the total consumed time of the tasks is longer than the total working time of the personnel corresponding to the tasks, generating early warning information of personnel shortage so as to prompt the supplement of the personnel corresponding to the tasks.

Specifically, if the total consumed time of the type of task is longer than the total working time of the personnel corresponding to the type of task, it indicates that the personnel corresponding to the type of task cannot complete the type of task. At this time, the server generates warning information of shortage of staff. The manager can recruit temporary personnel in advance or arrange outsourcing personnel in advance according to the early warning information so that the target scheduling period has enough personnel to use.

Optionally, on the basis of the above embodiment shown in fig. 7, the personnel scheduling method provided by the present invention further includes the following steps S118 and S119:

and S118, if the total consumed time of the tasks is longer than the total working time of the personnel corresponding to the tasks, acquiring the number of the personnel required to be supplemented by the tasks.

And S119, calling the number of the persons from the spare person library for supplement according to the number of the persons needing to be supplemented.

Wherein, a plurality of personnel information are stored in the spare personnel database.

Specifically, if the total consumed time of the type of task is longer than the total working time of the personnel corresponding to the type of task, it indicates that the personnel corresponding to the type of task cannot complete the type of task. At the moment, the server determines the number of the persons needing to be supplemented for the task according to the difference value between the total consumed time of the task and the total working time of the persons corresponding to the task. And according to the number of the persons needing to be supplemented, the person information of the corresponding number of persons is called from the standby person library.

In an optional fourth embodiment, on the basis of any of the above embodiments, the method for scheduling people provided by the present invention further includes the following step S107.

S107, when a new task which needs to be executed in a second scheduling time period is received, inserting the new task into a task scheduling table of the second scheduling time period based on a cost function algorithm, wherein the second scheduling time period is one scheduling time period of the target scheduling cycle.

Specifically, the new task that needs to be executed in the second scheduling time period refers to a task that is received after the task schedule in the first scheduling time period has been generated at least once, and the execution time range of the task is within the second scheduling time period.

In an optional implementation manner, the inserting of the new task into the task scheduling table of the first scheduling time period based on the cost function algorithm in S107 may be specifically implemented by the following steps S1071 to S1074:

s1071, according to the skill requirement of the new task, selecting executive persons matched with the skill requirement of the new task from the executive persons in the first scheduling time period.

Illustratively, if the skill requirement of the new task is care, all executives with skill attributes of care are screened from the executives during the first time period.

S1072, for any one screened executive staff, determining the minimum insertion cost and the optimal insertion position for inserting the new task into the work sequence of the executive staff, wherein the optimal insertion position is the insertion position corresponding to the minimum insertion cost.

Optionally, the minimum insertion cost and the optimal insertion position are determined through the following steps:

and for any screened executive personnel, inserting the new task into each position of the work sequence of the executive personnel and calculating the insertion cost corresponding to each insertion position so as to determine the minimum insertion cost and the optimal insertion position for inserting the new task into the work sequence of the executive personnel.

The insertion cost corresponding to the insertion position is the difference between the efficiency when no new task is inserted and the efficiency when a new task is inserted into the insertion position.

The efficiency is the sum of the total working hours of the tasks of the executive personnel in the first scheduling time period and the total traffic time cost.

Specifically, based on the above, the efficiency e(s) of each performer can be calculated by the following formula:

wherein, servicetime(s) represents the total man-hour of the task in the work sequence of the executive; TravelTime (S)) represents the total transit time cost for the tasks in the executive's work sequence.

Based on the above formula, the efficiency E1(s) of the performer corresponding to the work sequence without the new task inserted and the efficiency E2(s) of the performer corresponding to the work sequence with the new task inserted can be calculated.

Further, the insertion cost Q described above can be calculated by the following formula:

Q＝E1(s)-E2(s)。

s1073, sequencing all the screened executive personnel according to the minimum insertion cost, and determining the executive personnel with the minimum insertion cost as the optimal executive personnel.

S1074, inserting the new task into the task sequence of the optimal executive staff according to the optimal insertion position of the optimal executive staff and regenerating the path plan.

Based on the embodiment, the personnel scheduling method provided by the invention can determine the optimal task adding mode of the temporarily received emergent new tasks, thereby realizing the reasonable arrangement of the new tasks.

< second method embodiment >

The embodiment of the invention also provides a personnel scheduling method, which comprises the following steps of S201-S209:

s201, acquiring the personnel information and the task information in the prearranged scheduling period from the information base.

S202, classifying the tasks in the pre-scheduling period according to the skill requirements of the tasks.

And S203, determining the personnel corresponding to each type of task in the pre-scheduling period from the personnel in the pre-scheduling period according to the skill attribute of the personnel.

And S204, determining the total working time of the personnel corresponding to each type of task in the pre-scheduling period according to the working time range of the personnel.

S205, determining the time consumption of each type of task in the pre-scheduling period, wherein the time consumption of the task is the sum of the working hour and the working gap time of the task.

S206, for each type of task in the pre-scheduling period, if the total consumed time of the type of task is longer than the total working time of the personnel corresponding to the type of task, adding the type of task and the personnel supplemented corresponding to the type of task to the information base.

And S207, acquiring personnel information and task information of the target scheduling cycle from the information base supplemented according to the step S206, wherein the personnel information at least comprises the skill attribute of personnel, the task information at least comprises the skill requirement, the labor hour and the task address of a task, and the target scheduling cycle at least comprises one scheduling time period, wherein the time range of the pre-scheduled scheduling cycle covers the time range of the target scheduling cycle.

S208, determining a task scheduling table of each scheduling time segment of the target scheduling period according to the personnel information and the task information of the target scheduling period, wherein the task scheduling table comprises tasks allocated to the scheduling time segments, executors of the tasks, and task sequences and path planning of the tasks required to be executed by the executors in the scheduling time segments.

S209, when a new task which needs to be executed in a second scheduling time period is received, inserting the new task into a task scheduling table of the second scheduling time period based on a cost function algorithm, wherein the second scheduling time period is one scheduling time period of a target scheduling cycle.

On one hand, the personnel scheduling method provided by the invention can supplement the tasks and the corresponding tasks with personnel information if the total consumed time of the tasks is longer than the total working time of the personnel corresponding to the tasks for each type of tasks in the pre-scheduled scheduling period, so that the personnel in the pre-scheduled scheduling period can sufficiently complete the tasks in the pre-scheduled scheduling period. Because the pre-scheduling period covers the target scheduling period, the personnel scheduling method provided by the invention can provide enough personnel support for the task scheduling table of each scheduling time segment of the target scheduling period.

According to the other scheme, the task scheduling table of each scheduling time segment of the first cycle is determined by acquiring the multidimensional personnel information and the multidimensional task information of the target scheduling cycle from the information base. Therefore, when the task arrangement is carried out, the task addresses among different tasks are comprehensively considered, so that when the task arrangement table of the target scheduling period is determined, the path planning among the tasks is considered, and meanwhile, the path planning and the task arrangement among the tasks are not separately considered, namely, the personnel scheduling method provided by the invention can reasonably carry out the task arrangement on personnel, thereby reducing the working time of the personnel. Meanwhile, the task scheduling table of the target scheduling period also gives a task sequence and path planning of tasks required to be executed by the executive in the scheduling time period.

On the other hand, the received new tasks which need to be executed in the second scheduling time period are inserted into the task scheduling table of the second scheduling time period based on the cost function algorithm, so that the optimal task adding mode can be determined for the temporarily received emergent new tasks, and the reasonable arrangement of the new tasks is realized.

Optionally, the step S208 may be implemented by the following steps S2081 to S2084:

s2081, classifying the tasks in the target scheduling period according to the skill requirements of the tasks.

S2082, determining the personnel corresponding to each type of task in the target scheduling period from the personnel in the target scheduling period according to the skill attributes of the personnel.

S2083, traffic time cost between any two tasks in each type of tasks of the target scheduling period is obtained.

S2084, for each type of task in the target scheduling period, according to the working hours, the task addresses and the traffic time cost of the task, selecting executive personnel from the personnel corresponding to the type of task and determining a task scheduling table, so that the total traffic time cost spent for completing the type of task is the lowest.

Optionally, the step S209 may be implemented by the following steps S2091 to S2094:

s2091, screening out executives matched with the skill requirements of the new task from the executives in the first scheduling time period according to the skill requirements of the new task;

s2092, for any one screened executive personnel, determining the minimum insertion cost and the optimal insertion position for inserting the new task into the work sequence of the executive personnel, wherein the optimal insertion position is the insertion position corresponding to the minimum insertion cost;

s2093, sequencing all the screened executive personnel according to the minimum insertion cost, and determining the executive personnel with the minimum insertion cost as the optimal executive personnel;

s2094, inserting the new task into the task sequence of the optimal executive staff according to the optimal insertion position of the optimal executive staff and regenerating the path plan.

It should be noted that the specific implementation manners of the above S201-S209, S2081-S2084, and S2091-S2094 are the same as the implementation manners of the related steps in the first method embodiment, and are not described herein again.

< first computer device >

In this embodiment, a computer device 20 is further provided, which is configured to implement any one of the first method embodiments of the present invention to provide a method for scheduling people, as shown in fig. 8, and includes:

a memory 21 for storing computer instructions.

A processor 22 for calling computer instructions from the memory 11 to execute any one of the person scheduling methods provided by the first method embodiment described above.

< second computer device >

In this embodiment, a computer device is further provided, which is configured to implement any one of the second method embodiments of the present invention to provide a method for scheduling people, and includes:

a memory for storing computer instructions.

A processor for calling computer instructions from the memory to execute any one of the people scheduling methods provided by the second method embodiment described above.

The present invention may be a computer program product designed separately according to the functions of the server and the terminal device described above. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied therewith for causing a processor to implement various aspects of the present invention.

The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium include 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), a static random access memory (SRAM, a portable compact disc read-only memory (CD-ROM), a digital versatile disc (DVD, a memory stick, a floppy disk, a mechanical coding device, a punch card or an in-groove protrusion structure having instructions stored thereon, for example, and any suitable combination of the foregoing.

The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device via a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.

Computer program instructions for carrying out operations of the present invention may be assembler instructions, instruction set architecture (ISA instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including AN object oriented programming language such as Smalltalk, C + +, or the like, as well as conventional procedural programming languages, such as the "C" language or similar programming languages.

It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

These computer-readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer-readable medium storing the instructions comprises an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

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 instructions, which comprises one or more executable instructions for implementing the specified logical function(s). 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 and/or flowchart illustration, and combinations of blocks in the block diagrams and/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. It is well known to those skilled in the art that implementation by hardware, by software, and by a combination of software and hardware are equivalent.

Having described embodiments of the present invention, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein is chosen in order to best explain the principles of the embodiments, the practical application, or improvements made to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. The scope of the invention is defined by the appended claims.

Claims

1. A method of personnel scheduling, comprising:

2. The method of claim 1, wherein determining the task schedule for each scheduling time segment of the target scheduling cycle according to the staff information and the task information of the target scheduling cycle comprises:

3. The method of claim 2, the obtaining a transit time cost between any two tasks of each class of tasks of a target scheduling period, comprising:

4. The method of claim 2, wherein for each type of task of the target scheduling period, selecting executive persons from the persons corresponding to the type of task and determining the task schedule based on at least one of a genetic algorithm, a local search algorithm, a lagrangian relaxation algorithm, or a column generation algorithm such that a total traffic time cost spent completing the type of task is minimized.

5. The method of claim 1, further comprising:

6. The method of claim 1, further comprising:

7. The method of claim 1, wherein the staff information further comprises a work time range of staff; before the step of acquiring the personnel information and the task information of the target scheduling period from the information base, the method further comprises the following steps:

8. The method of claim 7, wherein the method further comprises:

9. The method of claim 7, wherein the method further comprises:

10. The method of claim 1, further comprising:

11. The method of claim 10, the inserting a new task into the task schedule for the first scheduling time period based on the cost function algorithm, comprising:

12. The method of claim 11, the minimum insertion cost and optimal insertion location determined via:

13. The method of claim 1, wherein the people information further comprises any combination of: salary cost, working time range, working address range, residence, skill level and task taboo of personnel; the task information further includes any combination of the following information: price, execution time range, skill level requirements of the task.

14. A method of personnel scheduling, comprising:

acquiring personnel information and task information in a prearranged scheduling period from an information base;

acquiring personnel information and task information of a target scheduling cycle from a supplemented information base, wherein the personnel information at least comprises a personnel skill attribute, the task information at least comprises a task skill requirement, working hours and a task address, the target scheduling cycle at least comprises a scheduling time period, and the time range of the pre-scheduled scheduling cycle covers the time range of the target scheduling cycle;

15. The method of claim 14, wherein determining the task schedule for each scheduling time segment of the target scheduling cycle according to the staff information and the task information of the target scheduling cycle comprises:

16. The method of claim 14, the inserting a new task into the task schedule for the first scheduling time period based on the cost function algorithm, comprising:

17. A computer device comprising a memory for storing computer instructions and a processor for invoking the computer instructions from the memory to perform the people scheduling method of claims 1-13.

18. A computer device comprising a memory for storing computer instructions and a processor for invoking the computer instructions from the memory to perform the people scheduling method of claims 14-16.