Goods picking task matching method and device, equipment and storage medium

Abstract

The embodiment of the invention discloses a goods picking task matching method and device, equipment and a storage medium, and relates to the technical field of computers, and the method can comprise the steps: obtaining the job configuration information of a target account for at least one candidate task type; wherein the job configuration information is used for representing the task level corresponding to each candidate task type; creating a task matching queue according to the job configuration information; the task matching queue is used for representing a matching sequence of the target account for each candidate task type; and based on the task matching queue, matching a target picking task for the target account from the at least one candidate picking task. By adopting the technical scheme of the embodiment of the invention, the receiving time length of the picking task receiving process of a picker can be reduced, and a large amount of candidate picking tasks in the task pool are prevented from being accumulated, so that the distribution efficiency of the candidate picking tasks in the task pool can be improved.

Description

Technical Field

[0001] Embodiments of the present invention relate to the field of computer technologies, and in particular, to a method, apparatus, device, and storage medium for matching picking tasks. Background Art

[0002] Currently, after a warehouse picking platform in a logistics system receives a picking order, it can generate a picking task corresponding to the picking order and add the generated picking task to a task pool for a picker to process. In the prior art, when a picker retrieves a picking task from the task pool, the picker can first search in the task pool for some picking tasks corresponding to the task types within his / her authority, and then retrieve a picking task from these retrieved picking tasks.

[0003] However, in the process of implementing the present invention, it is found that there are at least the following problems in the prior art: the process of a picker retrieving a picking task takes a long time, resulting in the continuous accumulation of picking tasks in the task pool, which affects the distribution efficiency of the picking tasks. Summary of the Invention

[0004] Embodiments of the present invention provide a method, apparatus, device, and storage medium for matching picking tasks, which can avoid the large accumulation of various candidate picking tasks in the task pool and improve the distribution efficiency of various candidate picking tasks in the task pool.

[0005] In a first aspect, an embodiment of the present invention provides a method for matching picking tasks. The method may include: obtaining job configuration information of a target account for at least one candidate task type; where the job configuration information is used to represent the task levels corresponding to the respective candidate task types; creating a task matching queue according to the job configuration information; the task matching queue is used to represent the matching order of the target account for the respective candidate task types; and matching a target picking task for the target account from at least one candidate picking task based on the task matching queue.

[0006] In a second aspect, an embodiment of the present invention further provides a device for matching picking tasks. The device may include: an obtaining module, a creating module, and a matching module;

[0007] Specifically, the obtaining module is configured to obtain job configuration information of a target account for at least one candidate task type; where the job configuration information is used to represent the task levels corresponding to the respective candidate task types;

[0008] The creating module is configured to create a task matching queue according to the job configuration information; the task matching queue is used to represent the matching order of the target account for the respective candidate task types;

[0009] The matching module is configured to match a target picking task for the target account from at least one candidate picking task based on the task matching queue.

[0010] In a third aspect, an embodiment of the present invention provides a matching device for picking tasks, and the matching device for picking tasks includes:

[0011] One or more processors;

[0012] A memory for storing one or more programs;

[0013] When the one or more programs are executed by the one or more processors, the one or more processors implement the matching method for picking tasks provided in any embodiment of the present invention.

[0014] In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, it implements the matching method for picking tasks provided in any embodiment of the present invention.

[0015] The embodiments in the above-mentioned invention have the following advantages or beneficial effects:

[0016] In the technical solution provided by the embodiment of the present invention, during the process of a picker receiving a picking task from a task pool, operation configuration information of a target account corresponding to the picker for at least one candidate task type can be obtained. Since the obtained operation configuration information can represent the task levels corresponding to the respective candidate task types, and the task level corresponding to a certain candidate task type can represent the processing priority of the picker corresponding to the target account for processing the candidate picking tasks under this candidate task type, therefore, in order to implement the automatic matching of the target account with each candidate picking task in the task pool, the embodiment of the present invention can first create a task matching queue for the target account based on the operation configuration information, and this task matching queue can represent the matching order of the target account for each candidate task type. After that, when allocating a target picking task for the target account from each candidate picking task, the automatic matching of each candidate picking task with the target account can be achieved through this task matching queue. In this way, it is not necessary for the picker to independently search for the picking tasks corresponding to the task types within his / her authority when receiving the picking task. It can be seen that in the technical solution provided by the embodiment of the present invention, by creating a task matching queue that can represent the matching order of the target account for each candidate task type, the automatic matching of the target picking task for the target account can be achieved from each candidate picking task in the task pool. Therefore, the receiving duration in the process of the picker receiving the picking task can be reduced, and a large accumulation of each candidate picking task in the task pool can be avoided, thereby improving the allocation efficiency of each candidate picking task in the task pool. Description of the Drawings

[0017] Figure 1 is a schematic flowchart of a matching method for picking tasks provided by an embodiment of the present invention;

[0018] Figure 2 It is a schematic diagram of a queue of a task matching queue provided by an embodiment of the present invention;

[0019] Figure 3 It is a schematic flowchart of another matching method for picking tasks provided by an embodiment of the present invention;

[0020] Figure 4 It is a schematic flowchart of yet another matching method for picking tasks provided by an embodiment of the present invention;

[0021] Figure 5 It is a schematic diagram of a queue of a wave queue provided by an embodiment of the present invention;

[0022] Figure 6 It is a schematic flowchart of yet another matching method for picking tasks provided by an embodiment of the present invention;

[0023] Figure 7 It is a schematic structural diagram of a matching device for picking tasks provided by an embodiment of the present invention;

[0024] Figure 8 It is a schematic structural diagram of a matching device for picking tasks provided by an embodiment of the present invention. Detailed implementation manners

[0025] The present invention will be further described in detail below with reference to the drawings and embodiments. It can be understood that the specific embodiments described herein are only used to explain the present invention, rather than limiting the present invention. Additionally, it should be noted that for the sake of description, only parts related to the present invention are shown in the drawings rather than all the structures.

[0026] The term "and / or" in this article is only a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist simultaneously, and B exists alone.

[0027] In addition, the terms "including" and "having" and any variations thereof mentioned in the description of the embodiments of the present invention are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but may alternatively include other unlisted steps or units, or may alternatively include other steps or units inherent to these processes, methods, products, or devices.

[0028] It should be noted that in the embodiments of the present invention, words such as "exemplary" or "for example" are used to represent examples, illustrations or explanations. Any embodiment or design solution described as "exemplary" or "for example" in the embodiments of the present invention should not be construed as being more preferred or having more advantages than other embodiments or design solutions. Rather, the use of words such as "exemplary" or "for example" is intended to present relevant concepts in a specific manner.

[0029] In the description of the embodiments of the present invention, unless otherwise specified, the meaning of "a plurality" or "each" refers to two or more.

[0030] Figure 1 It is a flowchart of a matching method for a picking task provided by an embodiment of the present invention. This method can be applied to the application scenario where a picker retrieves a picking task from a task pool. This method can be executed by a matching device for a picking task provided by an embodiment of the present invention. This device can be implemented in software and / or hardware and integrated in a matching device for a picking task.

[0031] In a possible implementation manner, the matching method for a picking task provided by an embodiment of the present invention can be applied to a matching system for a picking task including a first client, a second client, and a server. Specifically, the matching device for the picking task that executes this method can be configured in the server. Correspondingly, the matching device for the picking task integrated with the matching device for the picking task can be the corresponding device of the server, such as the corresponding server or server cluster of the server. Exemplarily, the first client can be a shopping APP client. The user can trigger the shopping APP client to send an order creation request to the server by placing an order operation in the shopping APP. After receiving the order creation request, the server can generate a candidate picking task according to the order information in the order creation request (for example, the order information can include information such as the ordered items, the order time, the order deadline, and the delivery address), and can add the generated candidate picking task to the task pool. The second client can be a task processing APP client. The picker can trigger the task processing APP client to send a task retrieval request to the server by performing a selection operation in the task processing APP client. The server can match a target picking task for the target account used by the picker in the task retrieval APP client from the task pool based on the received task retrieval request.

[0032] In the following description of the embodiments of the present invention, the matching system for picking tasks including a first client, a second client, and a server will be taken as an example for description. It can be understood that in practical applications, the matching method for picking tasks provided by the embodiments of the present invention can also be applied to other matching systems for picking tasks, and the embodiments of the present invention do not limit this. Exemplarily, the matching system for picking tasks may further include a third client and a server, where the third client may be a client shared by the order-placing user and the picker. As Figure 1 shown, the matching method for picking tasks provided by the embodiments of the present invention specifically includes the following steps:

[0033] S110. Obtain the job configuration information of the target account for at least one candidate task type.

[0034] Among them, the target account may be the account used by the picker in the second client, which is used to uniquely represent the identity of the picker.

[0035] In a possible implementation manner, when the picker has a need to receive a picking task, the picker can log in to the target account in the second client. After that, the picker can trigger the second client to send a task receiving request to the server by selecting the task receiving control in the application interface provided by the second client. The task receiving request may carry the job configuration information of the target account for each candidate task type.

[0036] In another possible implementation manner, the server may allocate a picking task to the target account at intervals of a preset duration. When the server needs to allocate a picking task to the target account, it can obtain the job configuration information of the target account stored in advance from the database. After that, it can match a target picking task for the target account based on the job configuration information, and can allocate the matched target picking task to the target account (for example, the target picking task can be allocated to the target account by establishing a corresponding relationship between the target picking task and the target account). Among them, the preset duration may be a previously determined duration, for example, it may be 24 hours.

[0037] In yet another possible implementation manner, the server may monitor the target account. When it monitors that the number of picking tasks corresponding to the target account is less than the previously determined number, it can obtain the job configuration information of the target account stored in advance from the database, and then allocate a picking task to the target account based on the obtained job configuration information.

[0038] It can be understood that in practical applications, the server can also obtain the job configuration information through other means, and the embodiments of the present invention do not limit this.

[0039] In addition, in the embodiments of the present invention, picking tasks can be divided into different task types based on the processing methods of the picking tasks. After the server generates candidate picking tasks based on the order creation request, it can determine the task type to which the candidate picking tasks belong according to the order information carried in the order creation request.

[0040] In a possible implementation manner, when the number of items in the order corresponding to the picking task is 1, when the picker processes this picking task, after finding the item from the storage location, the picker can directly place the item on the sorting machine, and the sorting machine transports the item to the verification table for label pasting operation; when the number of items in the order corresponding to the picking task is greater than 1, when the picker processes this picking task, the picker needs to find all the items in the order from the storage location, and then place all the items on the sorting machine together, and the sorting machine transports these items to the verification table. Based on this, the embodiments of the present invention can divide the picking tasks into two task types: single-item picking onto the machine and multi-item picking onto the machine.

[0041] In another possible implementation manner, the transportation process of some items (such as glass items) may have special requirements. After the picker finds such items from the storage location, the picker cannot place these items on the sorting machine, but needs to transport these items to the verification table by the picker himself or through other transportation devices. Based on this, the embodiments of the present invention can divide the picking tasks into two task types: non-machine picking and machine picking.

[0042] In yet another possible implementation manner, a Bluetooth printer may be deployed in the storage area where some items are located, and the Bluetooth printer can have the function of printing labels. After the picker finds these items from the storage location, the picker can directly paste the labels printed by the Bluetooth printer on the items, and there is no need to transport the items to the verification table through the sorting machine for label pasting operation. Based on this, the embodiments of the present invention can divide the picking tasks into two task types: label pasting at the verification table and label pasting at the storage location.

[0043] In addition, in the process of implementing the embodiments of the present invention, the above task division methods can also be combined. Exemplarily, the embodiments of the present invention can also divide the picking tasks into four task types: single-item picking onto the machine, single-item non-machine picking, multi-item non-machine picking, and multi-item picking onto the machine. Of course, in practical applications, the picking tasks can also be divided into task types based on other methods, and the embodiments of the present invention do not limit this.

[0044] In the embodiments of the present invention, each candidate task type can be all task types determined in advance; alternatively, each candidate task type can also be the task types corresponding to the receiving permissions of the target account to which the picker belongs among all task types determined in advance. Exemplarily, if the picker only has the permissions to handle two types of picking tasks, namely single-piece picking on the machine and multi-piece picking on the machine, then each candidate task type can include single-piece picking on the machine and multi-piece picking on the machine.

[0045] The job configuration information can be used to represent the task levels corresponding to each candidate task type. Exemplarily, the job configuration information can include keyword fields for representing the task levels corresponding to each candidate task type.

[0046] Taking the division of picking tasks into four task types: single-piece picking on the machine, single-piece picking not on the machine, multi-piece picking not on the machine, and multi-piece picking on the machine as an example, 1001, 1002, 1003, and 1004 can be determined as the task identifiers corresponding to the four task types of single-piece picking on the machine, single-piece picking not on the machine, multi-piece picking not on the machine, and multi-piece picking on the machine respectively. Exemplarily, in the case where each candidate task type includes the task types corresponding to the receiving permissions of the target account to which the picker belongs, the job configuration information can include the following fields: 1001-1; 1002-2; 1003-2. Taking 1001-1 as an example, the "-1" in 1001-1 represents the task level of single-piece picking on the machine. Then, according to this job configuration information, it can be determined that the task level of single-piece picking on the machine is the highest, the task levels of single-piece picking not on the machine and multi-piece picking not on the machine are the same, and both are lower than that of single-piece picking on the machine. In addition, it can be seen from the job configuration information that the field corresponding to the identifier of multi-piece picking on the machine is not included in the job configuration information, so it can be determined that the target account does not have the permission to handle the picking tasks of multi-piece picking on the machine.

[0047] Exemplarily, in the case where each candidate task type includes all task types determined in advance, the job configuration information can include the following fields: 1001-1; 1002-2; 1003-2; 1004-0. Similarly, according to this job configuration information, it can be determined that the task level of single-piece picking on the machine is the highest, the task levels of single-piece picking not on the machine and multi-piece picking not on the machine are the same, and both are lower than that of single-piece picking on the machine. In addition, the "-0" in 1004-0 can indicate that the target account does not have the permission to handle the picking tasks of multi-piece picking on the machine.

[0048] S120. Create a task matching queue according to the job configuration information.

[0049] Among them, the task matching queue is used to represent the matching order of the target account for each candidate task type.

[0050] Since the obtained job configuration information can represent the task levels corresponding to each candidate task type, and the task level corresponding to a certain candidate task type can represent the processing priority of the picker corresponding to the target account for processing the candidate picking tasks under this candidate task type. Therefore, in order to achieve the automatic matching of the target account and each candidate picking task in the task pool and reduce the time-consuming process of the picker receiving the picking tasks, the embodiments of the present invention can first create a task matching queue for the target account based on the job configuration information, and this task matching queue can represent the matching order of the target account for each candidate task type.

[0051] Optionally, creating a task matching queue according to the job configuration information may include: creating an initial matching queue based on the number of each candidate task type; sorting each candidate task type according to the task level corresponding to each candidate task type to obtain a sorting result; and inserting each candidate task type into the initial matching queue in sequence based on the sorting result to obtain the task matching queue.

[0052] Among them, the initial matching queue is an empty queue.

[0053] Exemplarily, taking 1001, 1002, and 1003 as the task identifiers corresponding to the three task types of single-piece picking on the machine, single-piece picking not on the machine, and multi-piece picking not on the machine respectively, in the case where each candidate task type includes the task type corresponding to the receiving permission of the target account of the picker, if the job configuration information includes the following fields 1001-3; 1002-2; 1003-1, it can be determined that the number of each candidate task type is 3, and an empty queue including 3 queue element positions can be created first. Then, each candidate task type can be sorted based on this job configuration information, and the sorting result is: multi-piece picking not on the machine, single-piece picking not on the machine, single-piece picking on the machine. Then, based on this sorting result, multi-piece picking not on the machine, single-piece picking not on the machine, and single-piece picking on the machine can be inserted into the empty queue in sequence to obtain Figure 2 the task matching queue as shown. Among them, the queue direction of the task matching queue is consistent with Figure 2 the arrow direction in, and the direction pointed by the arrow is the head direction of the task matching queue.

[0054] S130. Based on the task matching queue, match a target picking task for the target account from at least one candidate picking task.

[0055] Since the task matching queue can represent the matching order of the target account for each candidate task type, then, when allocating a target picking task for the target account from each candidate picking task, the automatic matching of each candidate picking task and the target account can be achieved through this task matching queue. In this way, it is not necessary for the picker to independently search for the picking task corresponding to the task type within his own permission when receiving the picking task.

[0056] In the matching method of picking tasks provided by the embodiments of the present invention, during the process of a picker receiving a picking task from a task pool, the operation configuration information of the target account corresponding to the picker for at least one candidate task type can be obtained. Since the obtained operation configuration information can represent the task levels corresponding to the respective candidate task types, and the task level corresponding to a certain candidate task type can represent the processing priority of the candidate picking task of the picker corresponding to the target account under this candidate task type, therefore, in order to achieve the automatic matching of the target account with each candidate picking task in the task pool, the embodiments of the present invention can first create a task matching queue for the target account based on the operation configuration information, and this task matching queue can represent the matching order of the target account for each candidate task type. After that, when allocating a target picking task for the target account from each candidate picking task, the automatic matching of each candidate picking task with the target account can be realized through this task matching queue. In this way, it is not necessary for the picker to independently search for the picking tasks corresponding to the task types within his / her authority when receiving the picking task. It can be seen that in the technical solution provided by the embodiments of the present invention, by creating a task matching queue that can represent the matching order of the target account for each candidate task type, the automatic matching of the target picking task for the target account from each candidate picking task in the task pool can be realized. Therefore, the receiving duration in the process of the picker receiving the picking task can be reduced, and a large accumulation of each candidate picking task in the task pool can be avoided, thereby improving the allocation efficiency of each candidate picking task in the task pool.

[0057] Refer to Figure 3 , which is a schematic flowchart of another matching method of picking tasks provided by the embodiments of the present invention. The method in this embodiment can be combined with each optional solution in the matching method of picking tasks provided by the foregoing embodiments to further optimize the matching method of picking tasks provided by the foregoing embodiments. As Figure 3 shown, it specifically includes the following steps:

[0058] S310. Obtain the operation configuration information of the target account for at least one candidate task type.

[0059] S320. Create a task matching queue according to the operation configuration information.

[0060] S330. Determine the current candidate task type according to the task matching queue.

[0061] In a possible implementation manner, the first queue element in the task matching queue can be determined as the current candidate task type. Taking the task matching queue shown in Figure 2 as an example, picking multiple items without putting them on the machine can be determined as the current candidate task type.

[0062] S340. Based on the current candidate task type, match a target picking task for the target account from each candidate picking task.

[0063] Optionally, based on the current candidate task type, matching a target picking task for the target account from each candidate picking task may include: based on a first preset matching rule, sequentially match the task types corresponding to each candidate picking task with the current candidate task type until the task type corresponding to the first candidate picking task among each candidate picking task matches the current candidate task type successfully; determine the first candidate picking task as the target picking task.

[0064] Among them, the first preset matching rule may be a pre-determined matching rule. Exemplarily, the first preset matching rule may be to sort each candidate picking task based on the order of the order creation time corresponding to each candidate picking task; then, traverse each candidate picking task according to the sorting result, sequentially match the task types corresponding to each candidate picking task with the current candidate task type, and stop traversing each candidate picking task when the matching is successful.

[0065] Exemplarily, if the current candidate task type is picking multiple items without putting them on the machine, and among each candidate picking task, there are candidate picking task A, candidate picking task B, candidate picking task C, and candidate picking task D. After sorting each candidate picking task, the sorting result is: candidate picking task C, candidate picking task A, candidate picking task B, and candidate picking task D. Among them, the task types corresponding to candidate picking task B and candidate picking task D are both picking multiple items without putting them on the machine. Then, after matching according to the matching order, candidate picking task B can be determined as the target picking task.

[0066] Exemplarily, the first preset matching rule may also be to sort each candidate picking task based on the order of the order deadline corresponding to each candidate picking task; then, traverse each candidate picking task according to the sorting result, sequentially match the task types corresponding to each candidate picking task with the current candidate task type, and stop traversing each candidate picking task when the matching is successful.

[0067] Among them, the order deadline may be the latest delivery time determined according to the address information in the order and the address information of the shipping place.

[0068] Optionally, after successively matching the task types corresponding to each candidate picking task with the current candidate task type, the picking task matching method provided by the embodiments of the present invention may further include: when it is determined that the task types corresponding to each candidate picking task fail to match the current candidate task type, re-determine the current candidate task type according to the task matching queue, and based on the first preset matching rule, successively match the task types corresponding to each candidate picking task with the re-determined current candidate task type until the task type corresponding to the second candidate picking task among each candidate picking task matches the re-determined current candidate task type successfully; determine the second candidate picking task as the target picking task.

[0069] Since the number of picking tasks corresponding to each candidate task type in the task pool is fixed, during the process of successively matching the task types corresponding to each candidate picking task with the current candidate task type, a situation of matching failure may occur. At this time, the current candidate task type can be deleted from the task matching queue, then the current candidate task type is re-determined, and then matching is performed according to the re-determined current candidate task type. In this way, after all candidate picking tasks are matched with the candidate task type with the highest priority, when there are still picking tasks within the authority of the picker in the task pool, it can be ensured that the target picking task can be successfully matched to the target account of the picker, thereby improving the matching success rate and further improving the allocation efficiency.

[0070] In the embodiments of the present invention, on the basis of the foregoing embodiments, the picking tasks under the candidate task type with the highest task level in the task pool can be preferentially assigned to the picker, and when there are picking tasks within the authority of the picker in the task pool, it can be ensured that the target picking task can be assigned to the picker. In this way, when the picker receives the picking task, there is no need to care about the receiving order of each candidate picking task in the task pool, which can further reduce the duration of the process of the picker receiving the picking task, thereby further improving the allocation efficiency of each candidate picking task in the task pool.

[0071] It should be noted that the picking task matching method provided by the embodiments of the present invention and the picking task matching method proposed in the foregoing embodiments belong to the same inventive concept. The technical details not described in detail in this embodiment can be referred to in the foregoing embodiments, and the beneficial effects of the foregoing embodiments are also applicable in this embodiment.

[0072] Refer to Figure 4 , which is a schematic flowchart of another picking task matching method provided by the embodiments of the present invention. The method in this embodiment can be combined with each optional solution in the picking task matching method provided by the foregoing embodiments to further optimize the picking task matching method provided by the foregoing embodiments. As Figure 4 shown, it specifically includes the following steps:

[0073] S410. Obtain the job configuration information of the target account for at least one candidate task type.

[0074] S420. Create a task matching queue according to the job configuration information.

[0075] S430. Determine the current candidate task type according to the task matching queue.

[0076] S440. Obtain the wave queue.

[0077] Wherein, the queue elements of the wave queue are candidate waves; the candidate waves are used to store the approaching-expiry tasks in each candidate picking task.

[0078] Refer to Figure 5 , a schematic diagram of the queue of the wave queue is provided. Among them, the queue direction of the wave queue is consistent with Figure 5 the arrow direction in, and the direction pointed by the arrow is the head direction of the wave queue. Moreover, the priority order of each candidate wave is consistent with the sorting of each candidate wave in the wave queue. As Figure 5 shown, the wave queue may include three queue elements: wave A, wave B, and wave C. Among them, the priority of wave A is higher than that of wave B, and the priority of wave B is higher than that of wave C. In wave A, wave B, and wave C, multiple approaching-expiry tasks are stored respectively.

[0079] Exemplarily, if the current time is time t, and the order deadline of a certain candidate picking task is the time corresponding to t + 24 hours, then this candidate picking task can be determined as an approaching-expiry task.

[0080] Optionally, the matching method for picking tasks provided in the embodiments of the present invention may further include: screening out each candidate approaching-expiry task from each candidate picking task based on the order deadline corresponding to each candidate picking task; inserting each candidate approaching-expiry task into the wave queue in sequence based on the order deadline corresponding to each candidate approaching-expiry task and the deadline time period corresponding to each candidate wave.

[0081] In a possible implementation, embodiments of the present invention may pre-determine three candidate waves and determine the cut-off time periods corresponding to these three candidate waves respectively. For example, the cut-off time period corresponding to wave A may be the time period between the time of T and the time corresponding to T + 24 hours, the cut-off time period corresponding to wave B may be the time period between the time of T and the time corresponding to T + 48 hours, and the cut-off time period corresponding to wave C may be the time period between the time of T and the time corresponding to T + 72 hours. In embodiments of the present invention, the wave queue may be updated at regular intervals, and the time of T is also the time when the wave queue needs to be updated each time. When the wave queue needs to be updated, first, based on the order cut-off time corresponding to each candidate picking task, the candidate picking tasks among the candidate picking tasks whose order cut-off time is before the time corresponding to T + 72 hours may be determined as candidate near-term tasks. Then, based on the order cut-off time corresponding to each candidate near-term task, the candidate wave to which each candidate near-term task belongs may be determined, and each candidate near-term task may be inserted into the position of the corresponding candidate wave in the wave queue. For example, if the order cut-off time of candidate near-term task A is the time corresponding to T + 36 hours, candidate near-term task A may be inserted into the position of wave B in the wave queue.

[0082] S450. Determine whether the wave queue is an empty queue.

[0083] S460. In the case where it is determined that the wave queue is an empty queue, match a target picking task for the target account from each candidate picking task based on the current candidate task type; in the case where it is determined that the wave queue is not an empty queue, match a target picking task for the target account from each candidate wave based on the current candidate task type.

[0084] Optionally, matching a target picking task for the target account from each candidate wave based on the current candidate task type may include: determining the current candidate wave according to the sorting of each candidate wave in the wave queue; based on the second preset matching rule, sequentially matching the task types corresponding to each near-term task in the current candidate wave with the current candidate task type until the task type corresponding to the first near-term task among each near-term task in the current candidate wave matches the current candidate task type successfully; and determining the first near-term task as the target picking task.

[0085] In a possible implementation, the first queue element in the wave queue may be determined as the current candidate wave. Taking Figure 5 the wave queue shown as an example, wave A may be determined as the current candidate wave.

[0086] Among them, the second preset matching rule can be a pre-determined matching rule. Exemplarily, the second preset matching rule can be to sort the current candidate wave's expiring tasks according to the order of the order creation times corresponding to the expiring tasks in the current candidate wave. After that, traverse the expiring tasks in the current candidate wave according to the sorting result, and sequentially match the task types corresponding to the expiring tasks in the current candidate wave with the current candidate task type. When the matching is successful, stop traversing the expiring tasks in the current candidate wave.

[0087] Exemplarily, if the current candidate task type is picking multiple items without putting them on the machine, and the expiring tasks in the current candidate wave include expiring task A, expiring task B, expiring task C, and expiring task D. After sorting the expiring tasks in the current candidate wave, the sorting result is: expiring task C, expiring task B, expiring task A, and expiring task D. Among them, the task types corresponding to expiring task C and expiring task B are both picking multiple items without putting them on the machine. Then, after matching according to the matching order, expiring task C can be determined as the target picking task.

[0088] Exemplarily, the second preset matching rule can also be to sort the expiring tasks in the current candidate wave according to the order of the order due times corresponding to the expiring tasks in the current candidate wave; after that, traverse the expiring tasks in the current candidate wave according to the sorting result, and sequentially match the task types corresponding to the expiring tasks in the current candidate wave with the current candidate task type. When the matching is successful, stop traversing the expiring tasks in the current candidate wave.

[0089] Optionally, after sequentially matching the task types corresponding to the expiring tasks in the current candidate wave with the current candidate task type, the matching method for picking tasks provided by the embodiments of the present invention may further include: in the case where it is determined that the task types corresponding to the expiring tasks in the current candidate wave all fail to match the current candidate task type, re-determine the current candidate wave according to the sorting of each candidate wave in the wave queue, and based on the second preset matching rule, sequentially match the task types corresponding to the expiring tasks in the re-determined current candidate wave with the current candidate task type until the task type corresponding to the second expiring task among the expiring tasks in the re-determined current candidate wave matches the current candidate task type successfully; determine the second expiring task as the target picking task.

[0090] Since the number of each near-term task in each candidate wave is fixed, during the process of sequentially matching the task types corresponding to the near-term tasks in the current candidate wave with the current candidate task type, a situation of matching failure may occur. At this time, the current candidate wave can be deleted from the wave queue, then the current candidate wave is re-determined, and then matching is performed according to the re-determined current candidate wave. In this way, after matching each candidate picking task with the near-term task with the highest priority is completed, when there are still picking tasks within the picker's authority in the wave queue, it can be ensured that the target account of the picker can be successfully matched with a near-term task, thereby improving the matching success rate and further improving the allocation efficiency.

[0091] Optionally, after sequentially matching the task types corresponding to the near-term tasks in the re-determined current candidate wave with the current candidate task type, the matching method of the picking task provided by the embodiment of the present invention may further include: in the case where it is determined that the task types corresponding to the near-term tasks in each candidate wave all fail to match the current candidate task type, re-determine the current candidate task type according to the task matching queue, and based on the second preset matching rule and the sorting of each candidate wave in the wave queue, sequentially match the task types corresponding to the near-term tasks in each candidate wave with the re-determined current candidate task type until the third near-term task among the near-term tasks in each candidate wave successfully matches the re-determined current candidate task type; determine the third near-term task as the target picking task.

[0092] Exemplarily, take Figure 5 the wave queue shown in Figure 2Take the task matching queue shown as an example. In the embodiment of the present invention, the wave A can be first determined as the current candidate wave, and picking multiple items without putting them on the machine can be determined as the current candidate task type. Then, based on the second preset matching rule, the task types corresponding to the expiration tasks in wave A can be sequentially matched with picking multiple items without putting them on the machine; if the match is successful, the matched expiration task is determined as the target picking task, and the matching stops; if the match fails, wave A can be deleted from the wave queue, and wave B is determined as the current candidate wave. After that, based on the second preset matching rule, the task types corresponding to the expiration tasks in wave B are matched with picking multiple items without putting them on the machine; if the match is successful, the matched expiration task is determined as the target picking task, and the matching stops; if the match fails, wave B can be deleted from the wave queue, and wave C is determined as the current candidate wave. Then, based on the second preset matching rule, the task types corresponding to the expiration tasks in wave C are matched with picking multiple items without putting them on the machine; if the match is successful, the matched expiration task is determined as the target picking task, and the matching stops; if the match fails, since there is only wave C left as a candidate wave in the wave queue, at this time, picking multiple items without putting them on the machine can be deleted from the task matching queue, and picking a single item without putting it on the machine is determined as the current candidate task type, and then the wave queue and the current candidate task type are retrieved again for matching until the match is successful. If the match still fails, picking a single item without putting it on the machine can be deleted from the task matching queue, and picking a single item and putting it on the machine is determined as the current candidate task type, and the above steps are repeated until the match is successful.

[0093] In the embodiment of the present invention, on the basis of the foregoing embodiment, a wave queue is created for the expiration tasks in the task pool. During the process of matching the target picking task for the target account, the expiration tasks in the wave queue can be preferentially matched with the target account. In this way, the allocation efficiency of the expiration tasks can be improved, and thus the order processing overdue can be avoided.

[0094] It should be noted that the matching method of the picking task proposed in the embodiment of the present invention and the foregoing embodiment belongs to the same inventive concept. The technical details not described in detail in this embodiment can be referred to the foregoing embodiment, and the beneficial effects of the foregoing embodiment are also applicable in this embodiment.

[0095] For a clearer description of the matching method of the picking task provided in the embodiment of the present invention, refer to Figure 6 , which is a schematic flowchart of another matching method of the picking task provided in the embodiment of the present invention. The method in this embodiment can be combined with each optional solution in the matching method of the picking task provided in the foregoing embodiment. As Figure 6 shown, it specifically includes the following steps:

[0096] S610. Obtain the job configuration information of the target account for each candidate task type, and create a task matching queue according to the job configuration information.

[0097] S620. Determine the current candidate task type according to the task matching queue, obtain the wave queue, and determine whether the wave queue is an empty queue.

[0098] If it is determined that the wave queue is an empty queue, execute step S630; if it is determined that the wave queue is not an empty queue, execute step S670.

[0099] S630. Based on the first preset matching rule, sequentially match the task types corresponding to each candidate picking task with the current candidate task type.

[0100] S640. Determine whether the matching is successful.

[0101] If it is determined that the matching fails, execute step S650; if it is determined that the matching is successful, execute step S6150.

[0102] S650. Determine whether the current candidate task type is the last candidate task type.

[0103] If it is determined that the current candidate task type is not the last candidate task type in the task matching queue, execute step S660; if it is determined that the current candidate task type is the last candidate task type in the task matching queue, execute step S6140.

[0104] S660. Delete the current candidate task type from the task matching queue.

[0105] After step S660, return to step S620 and execute it again.

[0106] S670. Determine the current candidate wave according to the sorting of each candidate wave in the wave queue, and based on the second preset matching rule, sequentially match the task types corresponding to each near-expiry task in the current candidate wave with the current candidate task type.

[0107] S680. Determine whether the matching is successful.

[0108] If it is determined that the matching fails, execute step S690; if it is determined that the matching is successful, execute step S6150.

[0109] S690. Determine whether the current candidate wave is the last candidate wave.

[0110] In the case where it is determined that the current candidate wave is not the last candidate wave in the wave queue, step S6110 is executed; in the case where it is determined that the current candidate wave is the last candidate wave in the wave queue, step S6120 is executed.

[0111] S6110. Delete the current candidate wave from the wave queue.

[0112] After step S6110, return to step S670 and execute it again.

[0113] S6120. Determine whether the current candidate task type is the last candidate task type.

[0114] In the case where it is determined that the current candidate task type is not the last candidate task type in the task matching queue, step S6130 is executed; in the case where it is determined that the current candidate task type is the last candidate task type in the task matching queue, step S6140 is executed.

[0115] S6130. Delete the current candidate task type from the task matching queue, and re-determine the current candidate task type according to the task matching queue.

[0116] After step S6130, return to step S670 and execute it again.

[0117] S6140. Determine that the task collection fails.

[0118] S6150. Determine the matched picking task as the target picking task.

[0119] It should be noted that the embodiment of the present invention and the method for matching picking tasks proposed in the foregoing embodiment belong to the same inventive concept. The technical details not described in detail in this embodiment can be referred to the foregoing embodiment, and the beneficial effects of the foregoing embodiment are also applicable in this embodiment.

[0120] Figure 7 FIG. is a schematic structural diagram of a matching device for picking tasks provided by an embodiment of the present invention. The device includes: an acquisition module 710, a creation module 720, and a matching module 730.

[0121] Exemplarily, the acquisition module 710 may execute S110 in the foregoing method embodiment, the creation module 720 may execute S120 in the foregoing method embodiment, and the matching module 730 may execute S130 in the foregoing method embodiment.

[0122] Specifically, the acquisition module 710 is configured to acquire job configuration information of a target account for at least one candidate task type; wherein, the job configuration information is used to characterize the task levels corresponding to the respective candidate task types.

[0123] A creation module 720 is used to create a task matching queue according to job configuration information; the task matching queue is used to represent the matching order of the target account for each candidate task type.

[0124] A matching module 730 is used to match a target picking task for the target account from at least one candidate picking task based on the task matching queue.

[0125] Optionally, in a possible implementation manner, the matching module 730 is specifically configured to:

[0126] Determine the current candidate task type according to the task matching queue; based on the current candidate task type, match a target picking task for the target account from each candidate picking task.

[0127] Optionally, in another possible implementation manner, the matching module 730 is further specifically configured to:

[0128] Based on a first preset matching rule, sequentially match the task types corresponding to each candidate picking task with the current candidate task type until the task type corresponding to the first candidate picking task among each candidate picking task matches the current candidate task type successfully; determine the first candidate picking task as the target picking task.

[0129] Optionally, in another possible implementation manner, the matching module 730 is further used to:

[0130] After sequentially matching the task types corresponding to each candidate picking task with the current candidate task type, in the case where it is determined that the task types corresponding to each candidate picking task all fail to match the current candidate task type, re-determine the current candidate task type according to the task matching queue, and based on the first preset matching rule, sequentially match the task types corresponding to each candidate picking task with the re-determined current candidate task type until the task type corresponding to the second candidate picking task among each candidate picking task matches the re-determined current candidate task type successfully; determine the second candidate picking task as the target picking task.

[0131] Optionally, in another possible implementation manner, the matching module 730 is further specifically configured to:

[0132] Obtain a wave queue; wherein, the queue elements of the wave queue are candidate waves; the candidate waves are used to store the overdue tasks among each candidate picking task; determine whether the wave queue is an empty queue; in the case where the wave queue is an empty queue, match a target picking task for the target account from each candidate picking task based on the current candidate task type; in the case where the wave queue is not an empty queue, match a target picking task for the target account from each candidate wave based on the current candidate task type.

[0133] Optionally, in another possible implementation, the matching module 730 is further configured to:

[0134] Determine the current candidate wave according to the sorting of each candidate wave in the wave queue; based on the second preset matching rule, sequentially match the task types corresponding to the upcoming tasks in the current candidate wave with the current candidate task type until the task type corresponding to the first upcoming task among the upcoming tasks in the current candidate wave matches the current candidate task type successfully; determine the first upcoming task as the target picking task.

[0135] Optionally, in another possible implementation, the matching module 730 is further configured to:

[0136] After sequentially matching the task types corresponding to the upcoming tasks in the current candidate wave with the current candidate task type, in the case where it is determined that the task types corresponding to the upcoming tasks in the current candidate wave all fail to match the current candidate task type, re-determine the current candidate wave according to the sorting of each candidate wave in the wave queue, and based on the second preset matching rule, sequentially match the task types corresponding to the upcoming tasks in the re-determined current candidate wave with the current candidate task type until the task type corresponding to the second upcoming task among the upcoming tasks in the re-determined current candidate wave matches the current candidate task type successfully; determine the second upcoming task as the target picking task.

[0137] Optionally, in another possible implementation, the matching module 730 is further configured to:

[0138] After sequentially matching the task types corresponding to the upcoming tasks in the re-determined current candidate wave with the current candidate task type, in the case where it is determined that the task types corresponding to the upcoming tasks in each candidate wave all fail to match the current candidate task type, re-determine the current candidate task type according to the task matching queue, and based on the second preset matching rule and the sorting of each candidate wave in the wave queue, sequentially match the task types corresponding to the upcoming tasks in each candidate wave with the re-determined current candidate task type until the task type corresponding to the third upcoming task among the upcoming tasks in each candidate wave matches the re-determined current candidate task type successfully; determine the third upcoming task as the target picking task.

[0139] Optionally, in another possible implementation, the matching device for picking tasks provided by the embodiments of the present invention may further include a screening module and an insertion module;

[0140] A screening module, configured to screen out each candidate near-expiry task from each candidate picking task based on the order deadline corresponding to each candidate picking task; an insertion module, configured to sequentially insert each candidate near-expiry task into a wave queue based on the order deadline corresponding to each candidate near-expiry task and the deadline time period corresponding to each candidate wave.

[0141] Optionally, in another possible implementation manner, the creation module 720 is specifically configured to:

[0142] Create an initial matching queue based on the quantities of each candidate task type; where the initial matching queue is an empty queue; sort each candidate task type according to the task level corresponding to each candidate task type to obtain a sorting result; based on the sorting result, sequentially insert each candidate task type into the initial matching queue to obtain a task matching queue.

[0143] The matching device for picking tasks provided by the embodiments of the present invention belongs to the same inventive concept as the matching methods for picking tasks provided by the foregoing embodiments. Details not described in detail in the embodiments of the matching device for picking tasks may refer to the relevant content of the foregoing method embodiments, and the corresponding beneficial effects may also be analyzed with reference to the beneficial effects of the foregoing method embodiments.

[0144] Figure 8 It is a schematic structural diagram of a matching device for picking tasks provided by an embodiment of the present invention. Figure 8 It shows a block diagram of an exemplary matching device 12 for picking tasks suitable for implementing the embodiments of the present invention.

[0145] Figure 8 The shown matching device 12 for picking tasks is only an example and should not impose any limitation on the functions and usage scope of the embodiments of the present invention.

[0146] Such as Figure 8 shown, the matching device 12 for picking tasks is presented in the form of a general computing device. The components of the matching device 12 for picking tasks may include but are not limited to: one or more processors or processing units 16, a system memory 28, and a bus 18 connecting different system components (including the system memory 28 and the processing unit 16).

[0147] The bus 18 represents one or more of several types of bus structures, including a memory bus or a memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus using any bus structure in a variety of bus structures. For example, these architectures include but are not limited to Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MAC) bus, Enhanced ISA bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.

[0148] The matching device 12 for picking tasks typically includes a variety of computer system-readable media. These media can be any available media accessible by the matching device 12 for picking tasks, including volatile and non-volatile media, removable and non-removable media.

[0149] System memory 28 may include computer system-readable media in the form of volatile memory, such as random access memory (RAM) 30 and / or cache memory (i.e., Figure 8 the cache in). The matching device 12 for picking tasks may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, storage system 34 can be used for reading and writing non-removable, non-volatile magnetic media ( Figure 8 not shown, commonly referred to as a "hard disk drive"). Although Figure 8 not shown in, a disk drive for reading and writing removable non-volatile disks (such as "floppy disks") and an optical disk drive for reading and writing removable non-volatile optical disks (such as CD-ROM, DVD-ROM or other optical media) can be provided. In these cases, each drive can be connected to bus 18 through one or more data media interfaces. System memory 28 may include at least one program product having a set (e.g., at least one) of program modules configured to perform the functions of the embodiments of the present invention.

[0150] A program / utility 40 having a set (at least one) of program modules 42 can be stored in, for example, system memory 28. Such program modules 42 include, but are not limited to, an operating system, one or more application programs, other program modules, and program data. Each or some combination of these examples may include the implementation of a network environment. Program modules 42 generally perform the functions and / or methods in the embodiments described in the present invention.

[0151] The matching device 12 for picking tasks can also communicate with one or more external devices 14 (such as a keyboard, a pointing device, a display 24, etc.), and can also communicate with one or more devices that enable a user to interact with the matching device 12 for picking tasks, and / or communicate with any device that enables the matching device 12 for picking tasks to communicate with one or more other computing devices (such as a network card, a modem, etc.). Such communication can be carried out through an input / output (I / O) interface 22. And, the matching device 12 for picking tasks can also communicate with one or more networks (such as a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter 20. As Figure 8 shown, network adapter 20 communicates with other modules of the matching device 12 for picking tasks through bus 18. It should be understood that althoughFigure 8 Not shown in the figure, other hardware and / or software modules can be used in combination with the matching device 12 of the picking task, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0152] The processing unit 16 executes various functional applications and data processing by running the programs stored in the system memory 28. For example, it implements the steps of the matching method for the picking task provided in the embodiments of the present invention. The method includes: obtaining the job configuration information of the target account for at least one candidate task type; wherein, the job configuration information is used to characterize the task levels corresponding to the respective candidate task types; creating a task matching queue according to the job configuration information; the task matching queue is used to characterize the matching order of the target account for the respective candidate task types; and based on the task matching queue, matching a target picking task for the target account from at least one candidate picking task.

[0153] Of course, those skilled in the art can understand that the processor can also implement the technical solutions of the matching method for the picking task provided in any embodiment of the present invention.

[0154] This embodiment provides a computer-readable storage medium, on which a computer program is stored. When the program is executed by a processor, it implements the steps of a matching method for a picking task as provided in the foregoing embodiments of the present invention. The method includes: obtaining the job configuration information of the target account for at least one candidate task type; wherein, the job configuration information is used to characterize the task levels corresponding to the respective candidate task types; creating a task matching queue according to the job configuration information; the task matching queue is used to characterize the matching order of the target account for the respective candidate task types; and based on the task matching queue, matching a target picking task for the target account from at least one candidate picking task.

[0155] The computer storage medium of an embodiment of the present invention may adopt any combination of one or more computer-readable media. The computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium may be, for example, but not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples (non-exhaustive list) of the computer-readable storage medium include: an electrical connection having one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this document, the computer-readable storage medium may be any tangible medium that contains or stores a program, and the program can be used by or in combination with an instruction execution system, apparatus, or device.

[0156] The computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries computer-readable program code. Such a propagated data signal may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer-readable signal medium may also be any computer-readable medium other than the computer-readable storage medium, and the computer-readable medium can send, propagate, or transmit a program for use by or in combination with an instruction execution system, apparatus, or device.

[0157] The program code contained on the computer-readable medium can be transmitted by any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0158] The computer program code for performing the operations of the present invention can be written in one or more programming languages or combinations thereof. The programming languages include object-oriented programming languages such as Java, Smalltalk, C++, and also include conventional procedural programming languages - such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, executed as an independent software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or a matching device for picking tasks. In the case of a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (for example, by using an Internet service provider to connect through the Internet).

[0159] Those of ordinary skill in the art should understand that the various modules or steps of the present invention described above can be implemented using a general-purpose computing device. They can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Optionally, they can be implemented using program code executable by a computer device, so that they can be stored in a storage device and executed by the computing device, or they can be separately fabricated into individual integrated circuit modules, or multiple modules or steps among them can be fabricated into a single integrated circuit module for implementation. Thus, the present invention is not limited to any specific combination of hardware and software.

[0160] Note that the above is only the preferred embodiment of the present invention and the technical principles applied. Those skilled in the art will understand that the present invention is not limited to the specific embodiments described herein, and various obvious changes, re-adjustments, and substitutions can be made by those skilled in the art without departing from the protection scope of the present invention. Therefore, although the present invention has been described in more detail through the above embodiments, the present invention is not limited to the above embodiments. Without departing from the concept of the present invention, more other equivalent embodiments can be included, and the scope of the present invention is determined by the scope of the appended claims.

Claims

1. A matching method for picking tasks, characterized in that, The method includes: Obtaining job configuration information of a target account for at least one candidate task type; wherein, the job configuration information is used to characterize the task levels corresponding to the respective candidate task types; Creating a task matching queue according to the job configuration information; the task matching queue is used to characterize the matching order of the target account for each candidate task type; Based on the task matching queue, matching a target picking task for the target account from at least one candidate picking task.

2. The matching method for picking tasks according to claim 1, characterized in that, The matching a target picking task for the target account from at least one candidate picking task based on the task matching queue includes: Determining the current candidate task type according to the task matching queue; Based on the current candidate task type, matching the target picking task for the target account from each of the candidate picking tasks.

3. The matching method for picking tasks according to claim 2, characterized in that, The matching the target picking task for the target account from each of the candidate picking tasks based on the current candidate task type includes: Based on a first preset matching rule, sequentially matching the task types corresponding to each candidate picking task with the current candidate task type until the task type corresponding to the first candidate picking task among each candidate picking task matches the current candidate task type successfully; Determining the first candidate picking task as the target picking task.

4. The matching method for picking tasks according to claim 3, characterized in that, After sequentially matching the task types corresponding to each candidate picking task with the current candidate task type, the method further includes: In the case where it is determined that the task types corresponding to each candidate picking task all fail to match the current candidate task type, re-determining the current candidate task type according to the task matching queue, and based on the first preset matching rule, sequentially matching the task types corresponding to each candidate picking task with the re-determined current candidate task type until the task type corresponding to the second candidate picking task among each candidate picking task matches the re-determined current candidate task type successfully; Determining the second candidate picking task as the target picking task.

5. The matching method for picking tasks according to claim 2, characterized in that, The matching the target picking task for the target account from each of the candidate picking tasks based on the current candidate task type includes: Obtaining a wave queue; wherein, the queue elements of the wave queue are candidate waves; the candidate waves are used to store the near-expiry tasks among each candidate picking task; Determining whether the wave queue is an empty queue; In the case where the wave queue is an empty queue, matching the target picking task for the target account from each of the candidate picking tasks based on the current candidate task type; In the case where the wave queue is not an empty queue, matching the target picking task for the target account from each of the candidate waves based on the current candidate task type.

6. The matching method for picking tasks according to claim 5, characterized in that, The matching the target picking task for the target account from each of the candidate waves based on the current candidate task type includes: Determining the current candidate wave according to the sorting of each candidate wave in the wave queue; Based on the second preset matching rule, the task types corresponding to each of the upcoming tasks in the current candidate wave are sequentially matched with the current candidate task type until the task type corresponding to the first upcoming task among each of the upcoming tasks in the current candidate wave is successfully matched with the current candidate task type; Determine the first upcoming task as the target picking task.

7. The matching method for picking tasks according to claim 6, characterized in that, After sequentially matching the task types corresponding to each of the upcoming tasks in the current candidate wave with the current candidate task type, the method further includes: In the case where it is determined that the task types corresponding to each of the upcoming tasks in the current candidate wave fail to match the current candidate task type, based on the sorting of each candidate wave in the wave queue, re-determine the current candidate wave, and based on the second preset matching rule, sequentially match the task types corresponding to each of the upcoming tasks in the re-determined current candidate wave with the current candidate task type until the task type corresponding to the second upcoming task among each of the upcoming tasks in the re-determined current candidate wave is successfully matched with the current candidate task type; Determine the second upcoming task as the target picking task.

8. The matching method for picking tasks according to claim 7, characterized in that, After sequentially matching the task types corresponding to each of the upcoming tasks in the re-determined current candidate wave with the current candidate task type, the method further includes: In the case where it is determined that the task types corresponding to each of the upcoming tasks in each candidate wave fail to match the current candidate task type, re-determine the current candidate task type according to the task matching queue, and based on the second preset matching rule and the sorting of each candidate wave in the wave queue, sequentially match the task types corresponding to each of the upcoming tasks in each candidate wave with the re-determined current candidate task type until the third upcoming task among each of the upcoming tasks in each candidate wave is successfully matched with the re-determined current candidate task type; Determine the third upcoming task as the target picking task.

9. The matching method for picking tasks according to claim 5, characterized in that, The method further includes: Based on the order due dates respectively corresponding to each of the candidate picking tasks, screen out each candidate upcoming task from each of the candidate picking tasks; Based on the order due dates respectively corresponding to each of the candidate upcoming tasks and the cut-off time periods respectively corresponding to each of the candidate waves, insert each of the candidate upcoming tasks into the wave queue in sequence.

10. The matching method for picking tasks according to any one of claims 1-9, characterized in that, The creating a task matching queue according to the operation configuration information includes: Based on the quantity of each candidate task type, create an initial matching queue; wherein, the initial matching queue is an empty queue; Sort each candidate task type according to the task level respectively corresponding to each candidate task type to obtain a sorting result; Based on the sorting result, sequentially insert each candidate task type into the initial matching queue to obtain the task matching queue.

11. A matching device for picking tasks, characterized in that, Including: An obtaining module, configured to obtain operation configuration information of a target account for at least one candidate task type; wherein, the operation configuration information is used to represent the task levels respectively corresponding to each candidate task type; A creation module, configured to create a task matching queue according to the job configuration information; the task matching queue is used to represent the matching order of the target account for each of the candidate task types; A matching module, configured to match a target picking task for the target account from at least one candidate picking task based on the task matching queue.

12. A matching device for picking tasks, characterized in that, The matching device for the picking task includes: One or more processors; A memory for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the matching method for the picking task according to any one of claims 1-10.

13. A computer-readable storage medium, on which a computer program is stored, characterized in that, When the program is executed by the processor, it implements the matching method for the picking task according to any one of claims 1-10.

Images