CN111598432A - Task allocation method and device - Google Patents
Task allocation method and device Download PDFInfo
- Publication number
- CN111598432A CN111598432A CN202010400570.5A CN202010400570A CN111598432A CN 111598432 A CN111598432 A CN 111598432A CN 202010400570 A CN202010400570 A CN 202010400570A CN 111598432 A CN111598432 A CN 111598432A
- Authority
- CN
- China
- Prior art keywords
- task
- current
- determining
- distributed
- personnel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 239000002184 metal Substances 0.000 description 10
- 230000006870 function Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 2
- 229920006395 saturated elastomer Polymers 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063114—Status monitoring or status determination for a person or group
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a task allocation method and a device, comprising the following steps: acquiring at least one task to be allocated; determining the order dispatching time corresponding to at least one task to be distributed; determining whether to allocate at least one task to be allocated according to the order dispatching time; when determining to distribute at least one single task to be distributed, determining a distribution mode of the at least one single task to be distributed; when the distribution mode of at least one task to be distributed is according to the task of the business personnel in hand, determining the current number of the current tasks of at least one business personnel in hand; and determining at least one target service person from at least one service person according to the current number, and distributing at least one task to be distributed to the at least one target service person. The scheme can improve the rationality of task allocation.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a task allocation method and a task allocation device.
Background
Currently, as modern enterprise organizations tend to centralize services, multiple business personnel are typically scheduled to handle different tasks at the same time on the same post.
However, when multiple business persons with the same function process tasks at the same time, the problem of task allocation unevenness or mutual deniability of business persons during task allocation exists, and therefore the task allocation reasonableness is affected.
Disclosure of Invention
The embodiment of the invention provides a task allocation method and a task allocation device, which can improve the reasonability of task allocation.
In a first aspect, the present invention provides a task allocation method, including:
acquiring at least one task to be allocated;
determining the order dispatching time corresponding to the at least one task to be distributed;
determining whether to allocate the at least one task to be allocated according to the order dispatching time;
when the task to be allocated is determined to be allocated, determining an allocation mode of the task to be allocated;
when the distribution mode of the at least one task to be distributed is according to the task of the business personnel in hand, determining the current number of the current tasks of the business personnel in hand;
and determining at least one target service person from the at least one service person according to the current number, and distributing the at least one single task to be distributed to the at least one target service person.
Preferably, the first and second electrodes are formed of a metal,
the determining whether to allocate the at least one task to be allocated according to the scheduling time, and when determining to allocate the at least one task to be allocated, determining an allocation mode of the at least one task to be allocated includes:
determining whether the order date corresponding to the order time is the current date;
when the order dispatching date is the current date, determining whether a time point corresponding to the order dispatching time is the current time point;
and when the time point corresponding to the order dispatching time is the current time point, determining the distribution mode of the at least one order to-be-distributed task.
Preferably, the first and second electrodes are formed of a metal,
the determining at least one target service person from the at least one service person according to the current number and distributing the at least one single task to be distributed to the at least one target service person includes:
s1: creating a first set comprising the at least one task to be distributed, and creating a second set comprising the at least one business person;
s2: taking the service personnel with the minimum current number in the second set as target service personnel;
s3: determining a first current task from the first set;
s4: distributing the first current task to the target business personnel, and taking the target business personnel as business personnel;
s5: and when the number of the tasks to be distributed in the first set is larger than 0, determining the current number of the current tasks of the hands of the at least one business person, and returning to the step S2.
Preferably, the first and second electrodes are formed of a metal,
after the determining the current number of tasks currently performed by the at least one business person, before the creating in S1 the first set of tasks including the at least one task to be assigned, further comprising:
and determining whether the number of the at least one service person is greater than 1, if so, executing S1, otherwise, taking the at least one service person as a target service person, and allocating the at least one single task to be allocated to the target service person.
Preferably, the first and second electrodes are formed of a metal,
after the S2, before the S3, further comprising:
and determining whether the current number of the target service personnel is the preset maximum task amount corresponding to the target service personnel, if so, deleting the target service personnel from the second set, returning to S2, and otherwise, executing S3.
Preferably, the first and second electrodes are formed of a metal,
after the determining the allocation manner of the at least one task to be allocated, the method further includes:
d1: when the distribution mode of the at least one single task to be distributed indicates that the tasks are evenly distributed according to increment, a third set comprising the at least one single task to be distributed is created;
d2: determining the distribution sequence of the at least one service person, and taking the first service person in the distribution sequence as the current service person;
d3: determining whether the current number of the current tasks of the current service personnel is equal to the preset maximum task amount corresponding to the current service personnel, if so, executing D4, otherwise, executing D5;
d4: deleting the current service personnel from the distribution sequence, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to D3;
d5: determining a second current task from the third set, assigning the second current task to the current business personnel, deleting the second current task from the third set, and executing D6;
d6: and when the number of the tasks to be distributed in the third set is greater than 0, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to D3.
In a second aspect, the present invention provides a task assigning apparatus, comprising:
the task acquisition module is used for acquiring at least one single task to be allocated;
the time determining module is used for determining the order dispatching time corresponding to the at least one to-be-distributed task acquired by the task acquiring module;
the mode determining module is used for determining the distribution mode of the at least one task to be distributed when the time determining module determines to distribute the at least one task to be distributed;
the task allocation module is used for determining the current number of the current tasks of at least one service person on hand when the allocation mode of the at least one single task to be allocated determined by the mode determination module is according to the task of the service person on hand; and determining at least one target service person from the at least one service person according to the current number, and distributing the at least one single task to be distributed to the at least one target service person.
Preferably, the first and second electrodes are formed of a metal,
the time determining module is used for determining whether the order dispatching date corresponding to the order dispatching time is the current date; when the order dispatching date is the current date, determining whether a time point corresponding to the order dispatching time is the current time point; and when the time point corresponding to the order dispatching time is the current time point, triggering the mode determining module to determine the distribution mode of the at least one order to-be-distributed task.
Preferably, the first and second electrodes are formed of a metal,
the task allocation module is used for executing:
s1: creating a first set comprising the at least one task to be distributed, and creating a second set comprising the at least one business person;
s2: taking the service personnel with the minimum current number in the second set as target service personnel;
s3: determining a first current task from the first set;
s4: distributing the first current task to the target business personnel, and taking the target business personnel as business personnel;
s5: and when the number of the tasks to be distributed in the first set is larger than 0, determining the current number of the current tasks of the hands of the at least one business person, and returning to the step S2.
Preferably, the first and second electrodes are formed of a metal,
the task allocation module is further configured to determine whether the number of the at least one service person is greater than 1, if so, execute S1, otherwise, take the at least one service person as a target service person, and allocate the at least one task to be allocated to the target service person.
Preferably, the first and second electrodes are formed of a metal,
the task allocation module is further configured to determine whether the current number of the target service staff is a preset maximum task amount corresponding to the target service staff, delete the target service staff from the second set if the current number of the target service staff is the preset maximum task amount corresponding to the target service staff, return to S2, and otherwise, execute S3.
Preferably, the first and second electrodes are formed of a metal,
the task allocation module is further configured to perform:
d1: when the distribution mode of the at least one single task to be distributed indicates that the tasks are evenly distributed according to increment, a third set comprising the at least one single task to be distributed is created;
d2: determining the distribution sequence of the at least one service person, and taking the first service person in the distribution sequence as the current service person;
d3: determining whether the current number of the current tasks of the current service personnel is equal to the preset maximum task amount corresponding to the current service personnel, if so, executing D4, otherwise, executing D5;
d4: deleting the current service personnel from the distribution sequence, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to D3;
d5: determining a second current task from the third set, assigning the second current task to the current business personnel, deleting the second current task from the third set, and executing D6;
d6: and when the number of the tasks to be distributed in the third set is greater than 0, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to D3.
The embodiment of the invention provides a task allocation method and a task allocation device, and the order dispatching time during different task allocation can be different, so that after the task to be allocated is obtained, whether the task to be allocated is determined based on the corresponding order dispatching time, if the task to be allocated can be allocated, a target service person capable of receiving task allocation is determined based on the current number of the current tasks responsible for each service person, and then the task to be allocated is allocated to each target service person, so that the purpose of improving the reasonability of task allocation is realized.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a flowchart of a task allocation method according to an embodiment of the present invention;
FIG. 2 is a flowchart of a task allocation method according to another embodiment of the present invention;
FIG. 3 is a flowchart of a task allocation method according to another embodiment of the present invention;
fig. 4 is a schematic structural diagram of a task allocation apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer and more complete, the technical solutions in the embodiments of the present invention will be described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention, and based on the embodiments of the present invention, all other embodiments obtained by a person of ordinary skill in the art without creative efforts belong to the scope of the present invention.
As shown in fig. 1, an embodiment of the present invention provides a task allocation method, including:
step 101: acquiring at least one task to be allocated;
step 102: determining the order dispatching time corresponding to the at least one task to be distributed;
step 103: determining whether to allocate the at least one task to be allocated according to the order dispatching time;
step 104: when the task to be allocated is determined to be allocated, determining an allocation mode of the task to be allocated;
step 105: when the distribution mode of the at least one task to be distributed is according to the task of the business personnel in hand, determining the current number of the current tasks of the business personnel in hand;
step 106: and determining at least one target service person from the at least one service person according to the current number, and distributing the at least one single task to be distributed to the at least one target service person.
In the embodiment of the invention, the dispatching time during different task distribution may be different, so that after the task to be distributed is obtained, whether the task to be distributed is determined based on the corresponding dispatching time, if the task to be distributed can be distributed, the target service personnel capable of receiving task distribution is determined based on the current number of the current tasks in charge of each service personnel, and then the task to be distributed is distributed to each target service personnel, thereby realizing the purpose of improving the reasonability of task distribution.
Specifically, the scheme can be applied to an Enterprise Resource Planning (ERP) system.
In an embodiment of the present invention, the determining whether to allocate the at least one task to be allocated according to the scheduling time, and when determining to allocate the at least one task to be allocated, determining an allocation manner of the at least one task to be allocated includes:
determining whether the order date corresponding to the order time is the current date;
when the order dispatching date is the current date, determining whether a time point corresponding to the order dispatching time is the current time point;
and when the time point corresponding to the order dispatching time is the current time point, determining the distribution mode of the at least one order to-be-distributed task.
In the embodiment of the invention, when determining whether the task to be allocated can be subjected to the order dispatching operation, the judgment can be carried out based on the order dispatching date and the corresponding time point corresponding to the task to be allocated. If the order dispatching date corresponding to the order dispatching time of the task to be distributed is 10/9/2020/and the corresponding time point is 8 am, firstly, judging whether the current date is the order dispatching date of 10/9/2020/s, if so, continuously judging whether the current time point is 8 am, and if so, carrying out order dispatching operation. On the contrary, if the current date does not reach the date of the order, namely 2020, 10, month and 9 days, the order can be dispatched again when the date of the order is 2020, 10, month and 9 days.
In an embodiment of the present invention, the determining at least one target service person from the at least one service person according to the current number, and allocating the at least one task to be allocated to the at least one target service person includes:
s1: creating a first set comprising the at least one task to be distributed, and creating a second set comprising the at least one business person;
s2: taking the service personnel with the minimum current number in the second set as target service personnel;
s3: determining a first current task from the first set;
s4: distributing the first current task to the target business personnel, and taking the target business personnel as business personnel;
s5: and when the number of the tasks to be distributed in the first set is larger than 0, determining the current number of the current tasks of the hands of the at least one business person, and returning to the step S2.
In the embodiment of the invention, when the order dispatching mode of the tasks to be dispatched is hand-average distribution, a first set consisting of all the tasks to be dispatched and a second set consisting of all the business personnel can be created, when the tasks to be dispatched are distributed, the business personnel with the minimum current number of the current tasks on hand are determined from the business personnel and are taken as target business personnel, then the first current task is determined from the first set and is distributed to the target business personnel, if the tasks to be distributed which are not distributed exist in the first set at the moment, the target business personnel with the minimum current number of the tasks on hand are continuously searched and distributed with the tasks to be distributed until all the tasks to be distributed in the first set are distributed. By the method for distributing tasks, the tasks in the hands of each business worker can be close to the same, and the task distribution rationality is improved.
In an embodiment of the present invention, after the determining the current number of tasks currently performed by the at least one business person, before the creating in S1 the first set including the at least one task to be assigned, further includes:
and determining whether the number of the at least one service person is greater than 1, if so, executing S1, otherwise, taking the at least one service person as a target service person, and allocating the at least one single task to be allocated to the target service person.
In the embodiment of the invention, in the process of distributing tasks to be distributed to business personnel, if the number of the business personnel needing to distribute the tasks is only one, all the tasks to be distributed are directly distributed to the business personnel, and if the number of the business personnel needing to distribute the tasks is more than 1, the tasks are distributed to the business personnel based on the current number of the current tasks in the hands of each business personnel, and the tasks are distributed to the business personnel based on the number of the tasks in the hands of the business personnel, so that the number of the tasks in the hands of each business personnel approaches to the same, and the task distribution rationality is improved.
In an embodiment of the present invention, after the S2 and before the S3, the method further includes:
and determining whether the current number of the target service personnel is the preset maximum task amount corresponding to the target service personnel, if so, deleting the target service personnel from the second set, returning to S2, and otherwise, executing S3.
In the embodiment of the invention, after the target service personnel with the minimum current number of current hand tasks are determined from the service personnel, the current number of the current hand tasks of the target service personnel x is 5, and the maximum task amount corresponding to the target service personnel x is also 5, which indicates that the current hand tasks of the target service personnel x reach the saturation state, and tasks are not required to be allocated to the target service personnel x, so that the target service personnel x is required to be deleted from the first set, and the problem that the task allocation time is wasted by repeatedly searching the target service personnel x is avoided.
In an embodiment of the present invention, after determining the allocation manner of the at least one task to be allocated, the method further includes:
d1: when the distribution mode of the at least one single task to be distributed indicates that the tasks are evenly distributed according to increment, a third set comprising the at least one single task to be distributed is created;
d2: determining the distribution sequence of the at least one service person, and taking the first service person in the distribution sequence as the current service person;
d3: determining whether the current number of the current tasks of the current service personnel is equal to the preset maximum task amount corresponding to the current service personnel, if so, executing D4, otherwise, executing D5;
d4: deleting the current service personnel from the distribution sequence, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to D3;
d5: determining a second current task from the third set, assigning the second current task to the current business personnel, deleting the second current task from the third set, and executing D6;
d6: and when the number of the tasks to be distributed in the third set is greater than 0, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to D3.
In the embodiment of the invention, when the distribution mode of the tasks to be distributed is increment average distribution, the tasks to be distributed can be dispatched to each business worker according to the average distribution mode. In the process of assignment, in order to avoid the situation that after the tasks to be assigned are assigned to the hands of the service personnel, the service personnel have the current number of the hand tasks larger than the corresponding maximum task amount, which results in the overweight tasks, the assignment order of each service personnel can be determined first, the assignment order can be sorted according to the job numbers corresponding to the service personnel (for example, when the job numbers include numbers, the job numbers are sorted according to the sequence from large to small or from small to large, and when the job numbers include letters, the job numbers can be sorted according to the sequence from front to back or from back to front), or the assignment order can be sorted according to the mode that the difference between the current time and the time corresponding to the latest assignment task is the largest (for example, the time when the service personnel a assigned the task for the latest time is 4 months and 5 days, the current time is 4 months and 8 days, the difference between the two times is 3 days, and the time when the service personnel b assigned the task for the latest time is 4 months and 7, current time is 4 months and 8 days, the difference between the two times is 1 day, therefore, the business person a is arranged in front of the business person b according to the sorting mode with the largest difference value), or the two modes are combined for distribution. Firstly, determining a first service person as a current service person according to an allocation sequence, then judging whether the current number of the on-hand tasks reaches the corresponding maximum task amount to judge whether the on-hand tasks are in a saturated state, if the current number of the on-hand tasks does not reach the maximum task amount, determining a second current task from a third set formed by all tasks to be allocated to the current service person, and deleting the second current task from the second set to avoid allocating the same to-be-dispatched list service to a plurality of service persons. And if the current number of the on-hand tasks of the current service personnel reaches the corresponding maximum task amount, deleting the on-hand tasks from the distribution sequence, avoiding the condition that the service is overweight after the service is distributed to the current service personnel, and determining the on-hand task condition of the next service personnel until all the services to be distributed are dispatched.
The task allocation method provided by the invention has two allocation modes of the tasks to be allocated:
the first way of assignment is hand-averaged assignment, i.e., after each assignment, the number of hand tasks of each business person is close.
The second allocation method is incremental average allocation, that is, when allocating tasks to be allocated each time, the business persons are allocated approximately the same business quantity, so that the business quantities allocated to each business person are close to each other.
For the first service allocation manner, in order to more clearly illustrate the technical solution and advantages of the present invention, the task allocation method provided by the embodiment of the present invention is described in detail, as shown in fig. 2, and specifically includes the following steps:
step 201: and acquiring at least one single task to be allocated.
Step 202: and determining the order dispatching time corresponding to at least one task to be distributed.
Step 203: and determining whether the dispatching date corresponding to the dispatching time is the current date.
Step 204: and when the order dispatching date is the current date, determining whether the time point corresponding to the order dispatching time is the current time point.
Specifically, after the task to be allocated is acquired, because the different tasks may be allocated at different timings, it is necessary to determine whether the task to be allocated needs to be allocated immediately or at a specified time point. If the current time is 9 points of 5-month-11-day, the dispatching date corresponding to the dispatching time corresponding to the task to be distributed is 5-month-11-day, and the corresponding time point is 8 points to 10 points, the dispatching operation can be performed on the task to be distributed at the moment. And if the dispatching date corresponding to the task to be distributed does not accord with the current date or the corresponding time point does not accord with the current time point, the dispatching operation cannot be carried out until the current date and the current time point are matched with the dispatching date and the time point corresponding to the task to be distributed.
Specifically, the order date corresponding to the task to be assigned may be a daily order or an order by working calendar (e.g., a date other than a business provision vacation).
Step 205: and when the time point corresponding to the order dispatching time is the current time point, determining the distribution mode of at least one order to be distributed.
Step 206: and when the distribution mode of at least one task to be distributed is distributed according to the task of the business personnel at hand, determining the current number of the current tasks of at least one business personnel at hand.
Specifically, when tasks to be allocated can be allocated to business personnel at the current time point, since the tasks to be allocated need to be evenly allocated according to the on-hand tasks of the business personnel, so that the on-hand tasks of each hand of the business personnel are close to the same, the current number of the current on-hand tasks of each business personnel needs to be judged, so as to allocate the tasks based on the current number.
Step 207: it is determined whether the number of business people is greater than 1 and if so, step 209 is performed, otherwise, step 208 is performed.
Step 208: and taking at least one service person as a target service person, and distributing at least one task to be distributed to the target service person.
Specifically, if the number of the business persons needing to be assigned is only 1 person, all tasks to be assigned are assigned to the business persons.
Step 209: a first set including at least one task to be assigned is created and a second set including at least one business person is created, step 210 is performed.
Step 210: and taking the service personnel with the minimum current number in the second set as target service personnel.
Step 211: and determining whether the current number of the target service personnel is the preset maximum task amount corresponding to the target service personnel, if so, executing the step 212, otherwise, executing the step 213.
Step 212: the target business person is removed from the second set and the process returns to step 210.
Specifically, if the number of the service personnel is greater than 1, determining a target service personnel with the minimum current number of the current on-hand tasks in a second set formed by the service personnel, then judging whether the current number corresponding to the on-hand tasks of the target service personnel reaches the maximum task amount corresponding to the target service personnel, if so, representing that the on-hand tasks of the target service personnel reach a saturation state, and therefore, the target service personnel can be deleted from the second set without distributing tasks to the target service personnel.
Step 213: a first current task is determined from the first set.
Step 214: and allocating the first current task to the target business personnel, and taking the target business personnel as business personnel.
Step 215: and when the number of the tasks to be distributed in the first set is larger than 0, determining the current number of the current tasks of the hands of at least one business person, and returning to the step 210.
Specifically, when the current number of the tasks of the target service personnel in the hands does not reach the corresponding maximum task amount, it is indicated that the tasks of the service personnel in the hands are not saturated, and tasks can be allocated to the service personnel, therefore, the first current task can be determined from the tasks to be allocated to the target service personnel, the allocated first current task is deleted, the same task is prevented from being allocated to multiple people at the same time, and then the target service personnel with the fewest tasks in the hands are determined from all the service personnel to allocate the tasks to the target service personnel until all the tasks to be allocated are allocated.
For the second service allocation manner, in order to more clearly illustrate the technical solution and advantages of the present invention, the task allocation method provided by the embodiment of the present invention is described in detail, as shown in fig. 3, which specifically includes the following steps:
step 301: and obtaining at least one single task to be distributed, and determining the corresponding order dispatching time of the at least one single task to be distributed.
Step 302: and determining whether the dispatching date corresponding to the dispatching time is the current date.
Step 303: and when the order dispatching date is the current date, determining whether the time point corresponding to the order dispatching time is the current time point.
Step 304: and when the time point corresponding to the order dispatching time is the current time point, determining the distribution mode of at least one order to be distributed.
Specifically, after the task to be allocated is acquired, because the different tasks may be allocated at different timings, it is necessary to determine whether the task to be allocated needs to be allocated immediately or at a specified time point. If the current time is 8 o ' clock of 5 months and 12 days, the dispatching date corresponding to the dispatching time corresponding to the task to be distributed is 5 months and 12 days, and the corresponding time point is 8 o ' clock to 9 o ' clock, the dispatching operation can be carried out on the task to be distributed at the moment. And if the dispatching date corresponding to the task to be distributed does not accord with the current date or the corresponding time point does not accord with the current time point, the dispatching operation cannot be carried out until the current date and the current time point are matched with the dispatching date and the time point corresponding to the task to be distributed.
Specifically, the order date corresponding to the task to be assigned may be a daily order or an order by working calendar (e.g., a date other than a business provision vacation).
Step 305: when the distribution mode of at least one single task to be distributed indicates that the tasks are evenly distributed according to the increment, a third set comprising at least one single task to be distributed is created;
step 306: determining the distribution sequence of at least one service person, and taking the first service person in the distribution sequence as the current service person;
specifically, when the service staff can be assigned with the service at the current time point, the assignment sequence of the service staff when assigning the tasks can be determined according to the sequence of the work numbers of the service staff and the sequence of the time length from the time point of the last assignment task to the current time point from long to short.
Step 307: determining whether the current number of the current tasks of the current service personnel is equal to the preset maximum task number corresponding to the current service personnel, if so, executing a step 308, otherwise, executing a step 309;
step 308: deleting the current service personnel from the distribution sequence, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to the step 307;
specifically, when allocating tasks according to the allocation sequence, if the task of the current service person reaches the maximum task amount corresponding to the current service person, the task cannot be allocated to the current service person, so that the current service person reaching the maximum task amount can be deleted from the allocation sequence to avoid allocating tasks to the current service person and increase the workload of the current service person.
Step 309: determining a second current task from the third set, allocating the second current task to the current business personnel, deleting the second current task from the third set, and executing step 310;
step 310: and when the number of the tasks to be distributed in the third set is greater than 0, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to the step 307.
Specifically, if the current business personnel do not have the maximum task amount in the hand task, determining that a second current task is allocated to the current business personnel from the tasks to be allocated, then deleting the allocated second current business, avoiding allocating the same business to a plurality of business personnel, if no tasks to be allocated exist at the moment, completing the allocation operation of the tasks, and ending the current process. If the task to be distributed does not exist, the current business personnel needing to distribute the task are continuously determined according to the distribution sequence, and the task is distributed to the current business personnel.
As shown in fig. 4, an embodiment of the present invention provides a task allocation apparatus, including:
a task obtaining module 401, configured to obtain at least one task to be allocated;
a time determining module 402, configured to determine the order dispatching time corresponding to the at least one to-be-allocated task acquired by the task acquiring module 401;
a mode determining module 403, configured to determine, when the time determining module 402 determines to allocate the at least one task to be allocated, an allocation mode of the at least one task to be allocated;
a task allocation module 404, configured to determine, when the allocation manner of the at least one task to be allocated determined by the manner determination module 403 is according to the task of the business personnel at hand, a current number of current tasks of the at least one business personnel at hand; and determining at least one target service person from the at least one service person according to the current number, and distributing the at least one single task to be distributed to the at least one target service person.
In the embodiment of the invention, the dispatching time during different task distribution may be different, so that after the task to be distributed is obtained, whether the task to be distributed is determined based on the corresponding dispatching time, if the task to be distributed can be distributed, the target service personnel capable of receiving task distribution is determined based on the current number of the current tasks in charge of each service personnel, and then the task to be distributed is distributed to each target service personnel, thereby realizing the purpose of improving the reasonability of task distribution.
In an embodiment of the present invention, the time determining module is configured to determine whether a scheduling date corresponding to the scheduling time is a current date; when the order dispatching date is the current date, determining whether a time point corresponding to the order dispatching time is the current time point; and when the time point corresponding to the order dispatching time is the current time point, triggering the mode determining module to determine the distribution mode of the at least one order to-be-distributed task.
In an embodiment of the present invention, the task allocation module is configured to perform:
s1: creating a first set comprising the at least one task to be distributed, and creating a second set comprising the at least one business person;
s2: taking the service personnel with the minimum current number in the second set as target service personnel;
s3: determining a first current task from the first set;
s4: distributing the first current task to the target business personnel, and taking the target business personnel as business personnel;
s5: and when the number of the tasks to be distributed in the first set is larger than 0, determining the current number of the current tasks of the hands of the at least one business person, and returning to the step S2.
In an embodiment of the present invention, the task allocation module is further configured to determine whether the number of the at least one service person is greater than 1, if so, execute S1, otherwise, regard the at least one service person as a target service person, and allocate the at least one task to be allocated to the target service person.
In an embodiment of the present invention, the task allocation module is further configured to determine whether the current number of the target service staff is a preset maximum task amount corresponding to the target service staff, if so, delete the target service staff from the second set, and return to S2, otherwise, execute S3.
In an embodiment of the present invention, the task allocation module is further configured to execute:
d1: when the distribution mode of the at least one single task to be distributed indicates that the tasks are evenly distributed according to increment, a third set comprising the at least one single task to be distributed is created;
d2: determining the distribution sequence of the at least one service person, and taking the first service person in the distribution sequence as the current service person;
d3: determining whether the current number of the current tasks of the current service personnel is equal to the preset maximum task amount corresponding to the current service personnel, if so, executing D4, otherwise, executing D5;
d4: deleting the current service personnel from the distribution sequence, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to D3;
d5: determining a second current task from the third set, assigning the second current task to the current business personnel, deleting the second current task from the third set, and executing D6;
d6: and when the number of the tasks to be distributed in the third set is greater than 0, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to D3.
It is to be understood that the illustrated structure of the embodiments of the present invention does not constitute a specific limitation on the task assigning apparatus. In other embodiments of the invention, the task assigning means may comprise more or fewer components than those shown, or some components may be combined, some components may be split, or a different arrangement of components. The illustrated components may be implemented in hardware, software, or a combination of software and hardware.
Because the information interaction, execution process, and other contents between the units in the device are based on the same concept as the method embodiment of the present invention, specific contents may refer to the description in the method embodiment of the present invention, and are not described herein again.
It should be noted that, when any of the above embodiments of the present invention is applied to an enterprise resource planning, ERP, system, the task allocation device is an ERP system.
An embodiment of the present invention further provides a storage medium, including: at least one memory and at least one processor;
the at least one memory to store a machine readable program;
the at least one processor is configured to invoke the machine readable program to perform the task assignment method in any embodiment of the invention.
Embodiments of the present invention further provide a computer-readable medium, where computer instructions are stored, and when executed by a processor, cause the processor to execute the task allocation method in any embodiment of the present invention.
Specifically, a system or an apparatus equipped with a storage medium on which software program codes that realize the functions of any of the above-described embodiments are stored may be provided, and a computer (or a CPU or MPU) of the system or the apparatus is caused to read out and execute the program codes stored in the storage medium.
In this case, the program code itself read from the storage medium can realize the functions of any of the above-described embodiments, and thus the program code and the storage medium storing the program code constitute a part of the present invention.
Examples of the storage medium for supplying the program code include a floppy disk, a hard disk, a magneto-optical disk, an optical disk (e.g., CD-ROM, CD-R, CD-RW, DVD-ROM, DVD-RAM, DVD-RW, DVD + RW), a magnetic tape, a nonvolatile memory card, and a ROM. Alternatively, the program code may be downloaded from a server computer via a communications network.
Further, it should be clear that the functions of any one of the above-described embodiments may be implemented not only by executing the program code read out by the computer, but also by causing an operating system or the like operating on the computer to perform a part or all of the actual operations based on instructions of the program code.
Further, it is to be understood that the program code read out from the storage medium is written to a memory provided in an expansion board inserted into the computer or to a memory provided in an expansion unit connected to the computer, and then causes a CPU or the like mounted on the expansion board or the expansion unit to perform part or all of the actual operations based on instructions of the program code, thereby realizing the functions of any of the above-described embodiments. It should be noted that not all steps and modules in the above flows and system structure diagrams are necessary, and some steps or modules may be omitted according to actual needs. The execution order of the steps is not fixed and can be adjusted as required. The system structure described in the above embodiments may be a physical structure or a logical structure, that is, some modules may be implemented by the same physical entity, or some modules may be implemented by a plurality of physical entities, or some components in a plurality of independent devices may be implemented together.
In the above embodiments, the hardware unit may be implemented mechanically or electrically. For example, a hardware element may comprise permanently dedicated circuitry or logic (such as a dedicated processor, FPGA or ASIC) to perform the corresponding operations. The hardware elements may also comprise programmable logic or circuitry, such as a general purpose processor or other programmable processor, that may be temporarily configured by software to perform the corresponding operations. The specific implementation (mechanical, or dedicated permanent, or temporarily set) may be determined based on cost and time considerations.
While the invention has been shown and described in detail in the drawings and in the preferred embodiments, it is not intended to limit the invention to the embodiments disclosed, and it will be apparent to those skilled in the art that various combinations of the code auditing means in the various embodiments described above may be used to obtain further embodiments of the invention, which are also within the scope of the invention.
Claims (10)
1. The task allocation method is characterized by comprising the following steps:
acquiring at least one task to be allocated;
determining the order dispatching time corresponding to the at least one task to be distributed;
determining whether to allocate the at least one task to be allocated according to the order dispatching time;
when the task to be allocated is determined to be allocated, determining an allocation mode of the task to be allocated;
when the distribution mode of the at least one task to be distributed is according to the task of the business personnel in hand, determining the current number of the current tasks of the business personnel in hand;
and determining at least one target service person from the at least one service person according to the current number, and distributing the at least one single task to be distributed to the at least one target service person.
2. The task allocation method according to claim 1,
the determining whether to allocate the at least one task to be allocated according to the scheduling time, and when determining to allocate the at least one task to be allocated, determining an allocation mode of the at least one task to be allocated includes:
determining whether the order date corresponding to the order time is the current date;
when the order dispatching date is the current date, determining whether a time point corresponding to the order dispatching time is the current time point;
and when the time point corresponding to the order dispatching time is the current time point, determining the distribution mode of the at least one order to-be-distributed task.
3. The task allocation method according to claim 1,
the determining at least one target service person from the at least one service person according to the current number and distributing the at least one single task to be distributed to the at least one target service person includes:
s1: creating a first set comprising the at least one task to be distributed, and creating a second set comprising the at least one business person;
s2: taking the service personnel with the minimum current number in the second set as target service personnel;
s3: determining a first current task from the first set;
s4: distributing the first current task to the target business personnel, and taking the target business personnel as business personnel;
s5: and when the number of the tasks to be distributed in the first set is larger than 0, determining the current number of the current tasks of the hands of the at least one business person, and returning to the step S2.
4. The task allocation method according to claim 3,
after the determining the current number of tasks currently performed by the at least one business person, before the creating in S1 the first set of tasks including the at least one task to be assigned, further comprising:
determining whether the number of the at least one service person is greater than 1, if so, executing S1, otherwise, taking the at least one service person as a target service person, and allocating the at least one task to be allocated to the target service person;
and/or the presence of a gas in the gas,
after the S2, before the S3, further comprising:
and determining whether the current number of the target service personnel is the preset maximum task amount corresponding to the target service personnel, if so, deleting the target service personnel from the second set, returning to S2, and otherwise, executing S3.
5. Task allocation method according to any of claims 1 to 4,
after the determining the allocation manner of the at least one task to be allocated, the method further includes:
d1: when the distribution mode of the at least one single task to be distributed indicates that the tasks are evenly distributed according to increment, a third set comprising the at least one single task to be distributed is created;
d2: determining the distribution sequence of the at least one service person, and taking the first service person in the distribution sequence as the current service person;
d3: determining whether the current number of the current tasks of the current service personnel is equal to the preset maximum task amount corresponding to the current service personnel, if so, executing D4, otherwise, executing D5;
d4: deleting the current service personnel from the distribution sequence, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to D3;
d5: determining a second current task from the third set, assigning the second current task to the current business personnel, deleting the second current task from the third set, and executing D6;
d6: and when the number of the tasks to be distributed in the third set is greater than 0, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to D3.
6. A task assigning apparatus, comprising:
the task acquisition module is used for acquiring at least one single task to be allocated;
the time determining module is used for determining the order dispatching time corresponding to the at least one to-be-distributed task acquired by the task acquiring module;
the mode determining module is used for determining the distribution mode of the at least one task to be distributed when the time determining module determines to distribute the at least one task to be distributed;
the task allocation module is used for determining the current number of the current tasks of at least one service person on hand when the allocation mode of the at least one single task to be allocated determined by the mode determination module is according to the task of the service person on hand; and determining at least one target service person from the at least one service person according to the current number, and distributing the at least one single task to be distributed to the at least one target service person.
7. Task assignment device according to claim 6,
the time determining module is used for determining whether the order dispatching date corresponding to the order dispatching time is the current date; when the order dispatching date is the current date, determining whether a time point corresponding to the order dispatching time is the current time point; and when the time point corresponding to the order dispatching time is the current time point, triggering the mode determining module to determine the distribution mode of the at least one order to-be-distributed task.
8. Task assignment device according to claim 6,
the task allocation module is used for executing:
s1: creating a first set comprising the at least one task to be distributed, and creating a second set comprising the at least one business person;
s2: taking the service personnel with the minimum current number in the second set as target service personnel;
s3: determining a first current task from the first set;
s4: distributing the first current task to the target business personnel, and taking the target business personnel as business personnel;
s5: and when the number of the tasks to be distributed in the first set is larger than 0, determining the current number of the current tasks of the hands of the at least one business person, and returning to the step S2.
9. Task assignment device according to claim 8,
the task allocation module is further configured to determine whether the number of the at least one service person is greater than 1, if so, execute S1, otherwise, take the at least one service person as a target service person, and allocate the at least one task to be allocated to the target service person;
and/or the presence of a gas in the gas,
the task allocation module is further configured to determine whether the current number of the target service staff is a preset maximum task amount corresponding to the target service staff, delete the target service staff from the second set if the current number of the target service staff is the preset maximum task amount corresponding to the target service staff, return to S2, and otherwise, execute S3.
10. Task distribution device according to one of the claims 6 to 9,
the task allocation module is further configured to perform:
d1: when the distribution mode of the at least one single task to be distributed indicates that the tasks are evenly distributed according to increment, a third set comprising the at least one single task to be distributed is created;
d2: determining the distribution sequence of the at least one service person, and taking the first service person in the distribution sequence as the current service person;
d3: determining whether the current number of the current tasks of the current service personnel is equal to the preset maximum task amount corresponding to the current service personnel, if so, executing D4, otherwise, executing D5;
d4: deleting the current service personnel from the distribution sequence, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to D3;
d5: determining a second current task from the third set, assigning the second current task to the current business personnel, deleting the second current task from the third set, and executing D6;
d6: and when the number of the tasks to be distributed in the third set is greater than 0, taking the next service personnel of the current service personnel as the current service personnel according to the distribution sequence, and returning to D3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010400570.5A CN111598432A (en) | 2020-05-13 | 2020-05-13 | Task allocation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010400570.5A CN111598432A (en) | 2020-05-13 | 2020-05-13 | Task allocation method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111598432A true CN111598432A (en) | 2020-08-28 |
Family
ID=72192180
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010400570.5A Pending CN111598432A (en) | 2020-05-13 | 2020-05-13 | Task allocation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111598432A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112801509A (en) * | 2021-01-29 | 2021-05-14 | 山东浪潮通软信息科技有限公司 | Method and equipment for mixed dispatching in cross-time period |
| CN114172952A (en) * | 2021-11-12 | 2022-03-11 | 杭州房象网络科技有限公司 | Multi-site service data distribution method, system, equipment and medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103778005A (en) * | 2014-01-27 | 2014-05-07 | 北京网秦天下科技有限公司 | Automatic task allocation method and device |
| CN105868021A (en) * | 2016-03-23 | 2016-08-17 | 浪潮通信信息系统有限公司 | Task allocation method and apparatus |
| CN110348675A (en) * | 2019-05-28 | 2019-10-18 | 深圳壹账通智能科技有限公司 | Method for allocating tasks and device, electronic equipment based on the double recording systems of intelligence |
-
2020
- 2020-05-13 CN CN202010400570.5A patent/CN111598432A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103778005A (en) * | 2014-01-27 | 2014-05-07 | 北京网秦天下科技有限公司 | Automatic task allocation method and device |
| CN105868021A (en) * | 2016-03-23 | 2016-08-17 | 浪潮通信信息系统有限公司 | Task allocation method and apparatus |
| CN110348675A (en) * | 2019-05-28 | 2019-10-18 | 深圳壹账通智能科技有限公司 | Method for allocating tasks and device, electronic equipment based on the double recording systems of intelligence |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112801509A (en) * | 2021-01-29 | 2021-05-14 | 山东浪潮通软信息科技有限公司 | Method and equipment for mixed dispatching in cross-time period |
| CN114172952A (en) * | 2021-11-12 | 2022-03-11 | 杭州房象网络科技有限公司 | Multi-site service data distribution method, system, equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6571215B1 (en) | System and method for generating a schedule based on resource assignments | |
| US8121885B2 (en) | Plan solver | |
| US5848395A (en) | Appointment booking and scheduling system | |
| US8136114B1 (en) | Business process management system having dynamic task assignment | |
| US7660406B2 (en) | Systems and methods for integrating outsourcers | |
| US20230032331A1 (en) | Systems and methods for converting sales opportunities to service tickets, sales orders, and projects | |
| US20150134386A1 (en) | Collectively optimizing group schedules to minimize project completion time and cost | |
| EP0300456A2 (en) | Improved scheduling method and system | |
| CN111598432A (en) | Task allocation method and device | |
| JP2017220169A (en) | Production plan creation support device and production plan creation support method | |
| US20030171970A1 (en) | Project scheduler interface | |
| US20020069145A1 (en) | Software system providing time card reporting using a calendar system | |
| JP2018073092A (en) | Schedule managing device and method | |
| CN116151582A (en) | Automatic version scheduling method and device based on resource identification and storage medium | |
| US11775893B2 (en) | Method and apparatus for cell-based workforce scheduling | |
| CN113902350A (en) | Scheduling method and device and computer readable storage medium | |
| CN114625512A (en) | Task scheduling method and device, electronic equipment and storage medium | |
| JP2006146530A (en) | Scheduling support system | |
| US20090164288A1 (en) | Scheduling Apparatus, Scheduling Method and Recording Medium | |
| CN112363819A (en) | Big data task dynamic scheduling method and device and computing equipment | |
| CN111062792A (en) | Method, device, equipment and storage medium for regulating and controlling limit | |
| JP2001249960A (en) | Design plan making system | |
| AU782754B2 (en) | Improvements relating to customer billing | |
| CN112288227A (en) | Task management method, device and equipment | |
| US20050125415A1 (en) | Distribution computer system managing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200828 |