Business processing method and device, electronic equipment and computer readable medium

Abstract

The invention discloses a business processing method and device, electronic equipment and a computer readable medium, and relates to the technical field of computers, one specific implementation mode comprises the steps that a business processing task is acquired, and a corresponding order identifier is pulled; obtaining a commodity identifier pre-matched with the order identifier, and distributing a corresponding commodity to a target storage location based on the commodity identifier; determining a target slideway, and distributing each commodity corresponding to the same order identifier in the target storage location to the same target slideway; scanning the distribution tool code to determine a bound target slideway, and determining a target recheck order grid according to the commodity identifier of the commodity in the bound target slideway; and calling a distribution tool corresponding to the distribution tool code to transport each commodity corresponding to the same order identifier in the bound target slideway to the target re-check order grid. Storage flow sorting, distribution and re-checking decoupling are achieved, and the storage service processing efficiency is improved.

Description

Technical Field

[0001] This application relates to the field of computer technology, and in particular, to a business processing method, apparatus, electronic device, and computer-readable medium. Background Art

[0002] Currently, flow picking (a picking mode based on the commodity dimension) relies on the release of downstream bins. When the downstream bins are full, multi-item orders in the picking area are intercepted at the task allocation stage and cannot be issued. Therefore, in the prior art, picking, sorting, verification, and packing in flow picking affect and restrict each other, and the efficiency of warehousing business processing is low. Summary of the Invention

[0003] In view of this, embodiments of the present application provide a business processing method, apparatus, electronic device, and computer-readable medium, which can solve the problems of low efficiency and accuracy in the existing flow picking warehousing business processing.

[0004] To achieve the above object, according to one aspect of the embodiments of the present application, a business processing method is provided, including:

[0005] Obtain a business processing task and pull the corresponding order identifier;

[0006] Obtain a commodity identifier pre-matched with the order identifier, and allocate the corresponding commodity to a target storage location based on the commodity identifier;

[0007] Determine a target chute, and allocate each commodity corresponding to the same order identifier in the target storage location to the same target chute;

[0008] Scan the sorting tool code to determine the bound target chute, and determine the target verification order bin according to the commodity identifier of the commodity in the bound target chute;

[0009] Call the sorting tool corresponding to the sorting tool code to transport each commodity corresponding to the same order identifier in the bound target chute to the target verification order bin.

[0010] Optionally, allocating the corresponding commodity to the target storage location based on the commodity identifier includes:

[0011] Allocate the commodities corresponding to the same commodity identifier to the same target storage location.

[0012] Optionally, determining the target chute includes:

[0013] Obtain the attribute data of the commodities in the target storage location and the status data of each candidate chute;

[0014] Determine the target chute according to the attribute data and the status data.

[0015] Optionally, allocating each commodity corresponding to the same order identifier in the target storage location to the same target chute includes:

[0016] Taking the order identifier corresponding to the commodity to be allocated currently in the target storage location as the target order identifier;

[0017] If there is an allocated commodity corresponding to the target order identifier in a target chute, allocating the currently to-be-allocated commodity to the target chute;

[0018] If there is no allocated commodity corresponding to the target order identifier in any target chute, allocating the currently to-be-allocated commodity to any target chute.

[0019] Optionally, before calling the sorting tool corresponding to the sorting tool code to transport each commodity corresponding to the same order identifier in the bound target chute to the target verification order cell, the method further includes:

[0020] Verifying whether all commodities corresponding to the same order identifier in the bound target chute are collected. If the verification result is that they are not collected, prompting an error message.

[0021] Optionally, the method further includes:

[0022] In response to the commodities in the bound target chute being empty, unbinding the corresponding target chute and sorting tool, and updating the status of the corresponding target chute.

[0023] In addition, the present application also provides a service processing device, including:

[0024] An acquisition unit configured to acquire a service processing task and pull the corresponding order identifier;

[0025] A first allocation unit configured to acquire a commodity identifier pre-matched with the order identifier and allocate the corresponding commodity to a target storage location based on the commodity identifier;

[0026] A second allocation unit configured to determine a target chute and allocate each commodity corresponding to the same order identifier in the target storage location to the same target chute;

[0027] A scanning unit configured to scan a sorting tool code to determine the bound target chute and determine a target verification order cell according to the commodity identifier of the commodities in the bound target chute;

[0028] A calling unit configured to call the sorting tool corresponding to the sorting tool code to transport each commodity corresponding to the same order identifier in the bound target chute to the target verification order cell.

[0029] Optionally, the first allocation unit is further configured to:

[0030] Allocate the commodities corresponding to the same commodity identifier to the same target storage location.

[0031] Optionally, the second allocation unit is further configured to:

[0032] Obtain the attribute data of the commodities in the target storage location and the status data of each candidate chute;

[0033] Determine the target chute according to the attribute data and the status data.

[0034] Optionally, the second allocation unit is further configured to:

[0035] Use the order identifier corresponding to the commodity to be currently allocated in the target storage location as the target order identifier;

[0036] If there is an allocated commodity corresponding to the target order identifier in one of the target chutes, allocate the currently to-be-allocated commodity to this target chute;

[0037] If there is no allocated commodity corresponding to the target order identifier in any of the target chutes, allocate the currently to-be-allocated commodity to any one of the target chutes.

[0038] Optionally, the service processing device further includes a verification unit configured to:

[0039] Verify whether all the commodities corresponding to the same order identifier in the bound target chute are collected. If the verification result is that they are not collected, prompt an error message.

[0040] Optionally, the service processing device further includes an unbinding unit configured to:

[0041] In response to the commodities in the bound target chute being empty, unbind the corresponding target chute and the sorting tool, and update the status of the corresponding target chute.

[0042] In addition, the present application also provides a service processing electronic device, including: one or more processors; a storage device for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors implement the service processing method as described above.

[0043] In addition, the present application also provides a computer-readable medium, on which a computer program is stored, and when the program is executed by a processor, the service processing method as described above is implemented.

[0044] To achieve the above object, according to another aspect of the embodiments of the present application, a computer program product is provided.

[0045] A computer program product of the embodiments of the present application includes a computer program, and when the program is executed by a processor, the service processing method provided by the embodiments of the present application is implemented.

[0046] One embodiment of the above invention has the following advantages or beneficial effects: By obtaining a business processing task, pulling the corresponding order identifier; obtaining a product identifier pre-matched with the order identifier, and allocating the corresponding product to a target storage location based on the product identifier; determining a target chute, and allocating each product corresponding to the same order identifier in the target storage location to the same target chute; scanning the sorting tool code to determine the bound target chute, and determining the target verification order compartment according to the product identifiers of the products in the bound target chute; calling the sorting tool corresponding to the sorting tool code to transport each product corresponding to the same order identifier in the bound target chute to the target verification order compartment. It realizes the decoupling of warehousing flow picking, sorting, and verification, and improves the efficiency of warehousing business processing.

[0047] The further effects of the above non-conventional optional methods will be described below in conjunction with specific embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] The drawings are used to better understand the present application and do not constitute an improper limitation to the present application. Among them:

[0049] Figure 1 is a schematic diagram of the main process of a business processing method according to an embodiment of the present application;

[0050] Figure 2 is a schematic diagram of the main process of a business processing method according to an embodiment of the present application;

[0051] Figure 3 is a schematic diagram of the main process of a business processing method according to an embodiment of the present application;

[0052] Figure 4 is a schematic diagram of the main process of a business processing method according to an embodiment of the present application;

[0053] Figure 5 is a schematic diagram of the main process of task allocation and picking of a business processing method according to an embodiment of the present application;

[0054] Figure 6 is a schematic diagram of the main process of the sorting link of a business processing method according to an embodiment of the present application;

[0055] Figure 7 is a schematic diagram of the main process of the sorting and verification links of a business processing method according to an embodiment of the present application;

[0056] Figure 8 is a schematic diagram of the main process of binding / unbinding a transfer cart in the sorting link of a business processing method according to an embodiment of the present application;

[0057] Figure 9 It is a schematic diagram of the main unit of the service processing device according to an embodiment of the present application;

[0058] Figure 10 It is an exemplary system architecture diagram to which the embodiments of the present application can be applied;

[0059] Figure 11 It is a schematic structural diagram of a computer system of a terminal device or a server suitable for implementing the embodiments of the present application. Detailed implementation manners

[0060] The following describes exemplary embodiments of the present application with reference to the accompanying drawings. Various details of the embodiments of the present application are included to facilitate understanding, and they should be considered merely exemplary. Therefore, those of ordinary skill in the art should recognize that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of the present application. Similarly, for the sake of clarity and conciseness, the description of well-known functions and structures is omitted below. It should be noted that in the technical solutions of the present application, the acquisition, transmission, storage, use, processing, etc. of data all comply with the relevant regulations of national laws and regulations. It should be noted that in the embodiments of the present application, certain industry-existing solutions such as software, components, models, etc. may be mentioned, and they should be considered exemplary. The purpose is only to illustrate the feasibility in the implementation of the technical solutions of the present application, but it does not mean that the applicant has already or necessarily used this solution. In the technical solutions of the present application, in terms of the collection, collection, update, analysis, processing, use, transmission, storage, etc. of the user's personal information, they all comply with the relevant laws and regulations, are used for legal and reasonable purposes, do not violate public order and good customs, are not shared, leaked or sold outside these legal uses, etc., and are subject to the supervision and management of the regulatory authorities. Necessary measures are taken for the user's personal information to prevent illegal access to such user personal information data, maintain the security of user personal information, network security and national security, ensure that the personnel authorized to access the personal information data comply with the relevant laws and regulations, and ensure the security of user personal information. Once these user personal information data are no longer needed, the risk should be minimized by restricting or even prohibiting data collection and / or deleting the data.

[0061] When in use, including in certain related application programs, user privacy is protected by de-identifying data, such as by removing specific identifiers, controlling the amount or specificity of the stored data, controlling how the data is stored, and / or other methods of de-identifying when in use.

[0062] Figure 1 It is a schematic diagram of the main process of a service processing method according to an embodiment of the present application. As Figure 1 shown, the service processing method mainly includes the following steps S101-step S105.

[0063] Step S101: Obtain a business processing task and pull the corresponding order identifier.

[0064] In this embodiment, the execution entity of the business processing method (for example, it can be a server) can obtain the business processing task through a wired connection or a wireless connection. For example, the business processing task can be a flow picking task in a warehousing flow picking scenario. The order identifier to be pulled can be included in the business processing task, such as an order number or an order merchant name.

[0065] Step S102: Obtain the product identifier pre-matched with the order identifier, and allocate the corresponding product to the target storage location based on the product identifier.

[0066] SKU, or denoted as sku, Stock Keeping Unit, is the abbreviation of "stock keeping unit", which refers to the basic unit for measuring inventory in and out, usually in units such as pieces, boxes, pallets, etc. SKU, or denoted as sku, Stock Keeping Unit, is a unique identifier used to identify each product or material.

[0067] In the flow picking process, the product identifier, such as the product sku, and the order identifier are pre-matched in the product import link to obtain the product identifier pre-matched with the order identifier corresponding to the business processing task, specifically, it can be the product sku.

[0068] Specifically, allocating the corresponding product to the target storage location based on the product identifier includes: allocating the products corresponding to the same product identifier to the same target storage location.

[0069] For example, it can be to allocate the products corresponding to the sku1 product identifier in the order corresponding to the order identifier of the business processing task to the same storage location, such as storage location X, and allocate the products corresponding to the sku2 product identifier to the same storage location, such as storage location Y, to achieve batch picking and improve the picking efficiency.

[0070] Step S103: Determine the target chute and allocate each product corresponding to the same order identifier in the target storage location to the same target chute.

[0071] The target chute can be the chute where the order products to be sorted are located.

[0072] Specifically, allocating each commodity corresponding to the same order identifier in the target storage location to the same target chute includes: taking the order identifier corresponding to the commodity to be allocated currently in the target storage location as the target order identifier; if there is an allocated commodity corresponding to the target order identifier in a target chute, allocating the currently to-be-allocated commodity to this target chute; if there is no allocated commodity corresponding to the target order identifier in any target chute, allocating the currently to-be-allocated commodity to any target chute.

[0073] Exemplarily, it can be to gather the commodities corresponding to the same order identifier (such as the order number) in each target storage location storing commodities into the same available target chute. Specifically, it can be: taking the order identifier (such as M) corresponding to the commodity (such as sku1) to be allocated currently in the target storage location (there can be multiple, such as storage location X, storage location Y) as the target order identifier; if there is an allocated commodity (such as sku2) corresponding to the target order identifier (such as M) in a target chute among all candidate target chutes (such as chute 1), allocating the currently to-be-allocated commodity (such as sku1) to this target chute (such as chute 1), so as to allocate all the commodities corresponding to the target order identifier (such as M) to this target chute (such as chute 1), for the sorting tool to sort the gathered order commodities at one time, improving the sorting efficiency and the corresponding business processing efficiency.

[0074] If there is no allocated commodity corresponding to the target order identifier in any target chute, taking the currently to-be-allocated commodity as the first to-be-allocated commodity in the target order identifier (such as M) and allocating it to any target chute, and allocating the non-first to-be-allocated commodities in the subsequent target order identifier (such as M) to the chute in the following way: if there is an allocated commodity (such as sku2) corresponding to the target order identifier (such as M) in a target chute among all candidate target chutes (such as chute 1), allocating the currently to-be-allocated commodity (such as sku1) to this target chute (such as chute 1), so as to allocate all the commodities corresponding to the target order identifier (such as M) to this target chute (such as chute 1). For the sorting tool to sort the gathered order commodities at one time, improving the sorting efficiency and the corresponding business processing efficiency.

[0075] Step S104, scanning the sorting tool code to determine the bound target chute, and determining the target verification order compartment according to the commodity identifier of the commodities in the bound target chute.

[0076] The sorting tool can be, for example, a sorting vehicle, on which an identification code, such as a QR code or a bar code, is pasted, called the sorting vehicle code, that is, the sorting tool code. The sorting tool code can be scanned to determine whether there is a bound target chute. If there is a bound target chute, the commodity type, size, storage conditions, etc. of the commodity can be determined according to the commodity identification of the commodity in the target chute, and then the target review order cell suitable for review can be determined according to the commodity type, size, storage conditions, etc. of the commodity, so as to reasonably arrange the review order cell and reduce the damage to the commodities to be reviewed.

[0077] Step S105: Call the sorting tool corresponding to the sorting tool code to transport each commodity corresponding to the same order identification in the bound target chute to the target review order cell.

[0078] Specifically, before calling the sorting tool corresponding to the sorting tool code to transport each commodity corresponding to the same order identification in the bound target chute to the target review order cell, the method further includes: verifying whether all the commodities corresponding to the same order identification in the bound target chute are collected. For example, the first quantity of the commodities pre-matched with the order identification (such as K) and the second quantity of the commodities corresponding to the order identification (such as K) in the target chute can be verified. If the first quantity is not equal to the second quantity, the verification result is that they are not all collected. If the verification result is that they are not all collected, an error message is prompted. For example, the error message can be "Order XX is not fully collected. Please verify the details of the uncollected commodities". Call the sorting tool corresponding to the sorting tool code to transport all the collected commodities corresponding to the same order identification in the bound target chute to the target review order cell at one time for review. The sorting tool sorts all the collected order commodities at one time, improving the sorting efficiency and the corresponding business processing efficiency.

[0079] In this embodiment, by obtaining a business processing task, pulling the corresponding order identification; obtaining the commodity identification pre-matched with the order identification, and allocating the corresponding commodity to the target storage location based on the commodity identification; determining the target chute, and allocating each commodity corresponding to the same order identification in the target storage location to the same target chute; scanning the sorting tool code to determine the bound target chute, and determining the target review order cell according to the commodity identification of the commodity in the bound target chute; calling the sorting tool corresponding to the sorting tool code to transport each commodity corresponding to the same order identification in the bound target chute to the target review order cell. It realizes the decoupling of warehousing flow picking, sorting, and review, and improves the warehousing business processing efficiency.

[0080] Figure 2 It is a schematic diagram of the main process of the business processing method according to an embodiment of the present application. As Figure 2 shown, the business processing method mainly includes the following steps S201 - step S207.

[0081] Step S201: Obtain a business processing task and pull the corresponding order identifier.

[0082] The business processing task can be a flow picking task in a warehousing flow picking scenario. The order identifier to be pulled can be included in the business processing task, such as an order number or an order merchant name.

[0083] Step S202: Obtain the product identifiers pre-matched with the order identifier, and allocate the corresponding products to the target storage locations based on the product identifiers.

[0084] The products corresponding to the order identifier can be classified based on the product identifiers. Products belonging to the same product identifier, for example, products belonging to sku1 are allocated to the target storage location X, and products belonging to the same product identifier, for example, products belonging to sku2 are allocated to the target storage location Y. The specific allocation method can be to open the baffle leading to the target storage location X for the products corresponding to sku1, so that the corresponding products automatically flow into the target storage location X, and open the baffle leading to the target storage location Y for the products corresponding to sku2, so that the corresponding products automatically flow into the target storage location Y. To achieve automatic picking and improve the picking efficiency and the processing efficiency of related operations.

[0085] Step S203: Obtain the attribute data of the products in the target storage location and the status data of each candidate chute.

[0086] The attribute data of the products in the target storage location can include data such as the type, shape, volume, and storage conditions of the products. The embodiments of the present application do not make specific limitations on the attribute data of the products. The status data of each candidate chute can include, for example, the used ratio of each candidate chute, and the status data such as the storage conditions that each candidate chute can provide, the shape, size, and the maximum volume of the products that each candidate chute can accommodate.

[0087] Step S204: Determine the target chute according to the attribute data and the status data.

[0088] By matching the attribute data (such as the type, shape, volume, and storage conditions of the products) of each product corresponding to an order (such as order L) in the target storage location with the status data of each candidate chute (such as the used ratio of each candidate chute, and the status data such as the storage conditions that each candidate chute can provide, the shape, size, and the maximum volume of the products that each candidate chute can accommodate), the most matching candidate chute is used as the target chute where each product corresponding to the order (such as order L) will be stored. The method for determining the target chute for other orders in the target storage location is similar and will not be elaborated here. To achieve a reasonable arrangement of the target chutes corresponding to the products in the order and reduce the damage to the products in the order during the distribution process.

[0089] Step S205: Allocate the various commodities corresponding to the same order identifier in the target storage location to the same target chute.

[0090] Exemplarily, it can be to gather the commodities corresponding to the same order identifier (such as the order number) in the various target storage locations storing commodities to the same available target chute (when the target chute is in an idle state or the number of order commodities backlogged in the target chute has not reached half of the set threshold of the number of backlogged commodities in the target chute, then the target chute is available). Specifically, it can be: taking the order identifier corresponding to the commodity to be currently allocated (such as sku1) in the target storage location (there can be multiple, such as storage location X, storage location Y) as the target order identifier (such as M); if there is a target chute (such as chute 1) among the various candidate target chutes that contains the allocated commodity (such as sku2) corresponding to the target order identifier (such as M), allocate the commodity to be currently allocated (such as sku1) to this target chute (such as chute 1), so as to allocate all the commodities corresponding to the target order identifier (such as M) to this target chute (such as chute 1), for the sorting tool to perform a one-time sorting of the gathered order commodities, improving the sorting efficiency and the corresponding business processing efficiency.

[0091] If there is no target chute that contains the allocated commodity corresponding to the target order identifier, allocate the commodity to be currently allocated as the first commodity to be allocated in the target order identifier (such as M) to any target chute, and allocate the non-first commodities to be allocated in the subsequent target order identifier (such as M) to the chute in the following manner: if there is a target chute (such as chute 1) among the various candidate target chutes that contains the allocated commodity (such as sku2) corresponding to the target order identifier (such as M), allocate the commodity to be currently allocated (such as sku1) to this target chute (such as chute 1), so as to allocate all the commodities corresponding to the target order identifier (such as M) to this target chute (such as chute 1). For the sorting tool to perform a one-time sorting of the gathered order commodities, improving the sorting efficiency and the corresponding business processing efficiency.

[0092] Step S206: Scan the sorting tool code to determine the bound target chute, and determine the target verification order grid according to the commodity identifiers of the commodities in the bound target chute.

[0093] By scanning the sorting tool code to determine whether the scanned sorting tool has a bound target chute. If there is a bound target chute, the commodity type, size, storage conditions, etc. can be determined according to the commodity identifiers of the commodities in this target chute, and then the target verification order grid suitable for verification can be determined according to the commodity type, size, storage conditions, etc. of this commodity, so as to reasonably arrange the verification order grid and reduce the damage to the commodities during the verification process.

[0094] Step S207, calling the distribution tool corresponding to the distribution tool code to transport each commodity corresponding to the same order identifier in the bound target slide to the target review order slot.

[0095] By dynamically adjusting the number of order review slots based on the number of distributed orders, efficient warehousing business processing can be achieved.

[0096] The distribution tool corresponding to the distribution tool code is called to transport all the collected goods corresponding to the same order ID in the bound target slide to the target review order grid for review at one time. The distribution tool distributes the collected order goods at one time to improve the distribution efficiency and corresponding business processing efficiency.

[0097] Specifically, the method further includes: in response to the commodity in the bound target slide being empty, unbinding the corresponding target slide and the distribution tool, and updating the status of the corresponding target slide.

[0098] When the distribution tool transports all the goods in the bound target slide to the target review order slot corresponding to the goods, you can unbind the distribution tool and the bound target slide, and update the status of the target slide to be unusable by the distribution tool. This removes the restrictions on the target slide and distribution tool, realizes the decoupling of warehouse flow picking, distribution, and review, and improves the efficiency of warehouse business processing.

[0099] Figure 3 FIG. 1 is a schematic diagram of the main flow of a business processing method according to an embodiment of the present application. Figure 3 As shown, the warehousing business processing flow is as follows: initialization: personalized configuration determines whether the order supports flow picking; task allocation: allocation condition change (grid threshold - order backlog * n>0, when n = 3, grid threshold - order backlog * 3>0, which means that the number of orders that can be efficiently processed at one time is increased by 3 times, and n = 3 here is only an example without specific limitation); picking: picking task pulling is no longer restricted by the grid threshold; import distribution: release the binding relationship between the review station and the slide (also called the slide), establish the distribution domain (also called the distribution domain) and the review domain are not affected by each other, and realize the decoupling of distribution and review; review: the distribution vehicle (that is, the distribution tool, also called the distribution vehicle) chooses the nearest review station for review, or chooses any review station for review; packaging: the grid is released after packaging is completed.

[0100] Figure 4 1 is a schematic diagram of the main flow of a business processing method according to an embodiment of the present application. In the embodiment of the present application, SKU can also be recorded as sku, and the chute is the same as the slideway. Figure 4As shown, screen the orders in the issued orders that support flow picking, such as order A (including sku1 + sku2), order B (including sku1 + sku2), and order C (including sku1 + sku2). Pick goods based on the product sku dimension. Gather all the skus in order A, order B, and order C into the picking pool. By executing a task 1 (i.e., a business processing task, specifically a flow picking task), pick the products belonging to the same sku to the same storage location. For example, place the products belonging to the same SKU1 in storage location X and the products belonging to the same SKU2 in storage location Y. Then, based on the attribute data of the products stored in storage location X and storage location Y (such as product type, product shape, product storage conditions, etc.) and the status data of each chute (such as chute 1, chute 2, chute 3, also known as slideway 1, slideway 2, slideway 3) belonging to the recheck backlog pool, select available target chutes (also known as target slideways, with the same meaning and function, such as chute 1, chute 2, chute 3, also known as slideway 1, slideway 2, slideway 3) for the products of each order stored in storage location X and storage location Y. Then, determine the recheck table identifier based on the product identifier of the products in the target chute (also known as the target slideway, with the same meaning and function, such as chute 1, chute 2, chute 3, also known as slideway 1, slideway 2, slideway 3). For example, chute 1 (i.e., slideway 1) contains the products in order B, corresponding to recheck table 2. Push the products of order B that are matched to chute 1 (i.e., slideway 1) after sorting to the specific recheck table (such as recheck table 2) with a sorting tool (such as a sorting cart) to perform the recheck work; chute 2 contains the products in order A, corresponding to recheck table 1. Push the products of order A that are matched to chute 2 (i.e., slideway 2) after sorting to the specific recheck table (such as recheck table 1) with a sorting tool (such as a sorting cart) to perform the recheck work; chute 3 contains the products in order C, corresponding to recheck table 3. Push the products of order C that are matched to chute 3 (i.e., slideway 3) after sorting to the specific recheck table (such as recheck table 3) with a sorting tool (such as a sorting cart) to perform the recheck work. Disconnect the binding relationship between the chute and the recheck table to decouple them.

[0101] Figure 5 It is a schematic diagram of the main process of task assignment and picking in the business processing method according to an embodiment of the present application. As Figure 5As shown, in the task allocation link, the automatic pull flow picking task, that is, the business processing task, triggers picking, queries the unfinished pull task, determines whether to generate a pull task, if a pull task is generated, clears the cache, issues a review, issues the picking, determines whether it is a machine area order (that is, an automatic picking order), if it is a machine area order, determines whether the machine area order is issued to the device that delivers goods to the person, issues the picking location machine area order notification warehouse management software wcs, and issues a wcs notification; if no pull task is generated, then the non-machine order pull, the machine order pull, and the specified order pull are performed. Specifically, for the non-machine order pull, determine whether to turn on the single-piece pull switch, if the single-piece pull switch is turned on, end, if the single-piece pull switch is not turned on, query the cache, for the machine order pull, determine whether it exceeds the limit, if it exceeds the limit, end, if it does not exceed the limit, query the cache, if the query cache result is empty, perform the first pull, incremental pull, or pull by storage location. The first order is selected according to the channel density sorting. The incremental order is selected after removing the occupied channel. The order pulled by the storage location obtains the storage location information according to the storage location number, selects the channel storage location after removing the occupied channel, filters the positioning details, and transmits it back to the transportation management system OTM to modify the positioning status, clears the cache, sends it for review, sends it for picking, determines whether it is a machine area order (that is, an order for automatic picking), and if it is a machine area order, determines whether the machine area order is sent to the automatic picking goods-to-person equipment, sends the picking and locating machine area order to notify the warehouse management software WCS, and sends a WCS notification. For the specified order pulling, query the order information, clear the cache, send it for review, send it for picking, determine whether it is a machine area order (that is, an order for automatic picking), and if it is a machine area order, determine whether the machine area order is sent to the goods-to-person equipment, send the picking and locating machine area order to notify the warehouse management software WCS, and send a WCS notification. The task allocation link releases the restriction on issuing multiple orders, and sets the grid threshold (system configuration) - order backlog * n (configuration) > 0. The embodiment of the present application can adjust the grid threshold according to the order backlog, so that when the downstream packaging grid is full, the multiple orders in the picking area will not be blocked in the task allocation link and cannot be issued. The picking, distribution, review, and packaging of the decoupled flow picking are achieved. Grid threshold (system configuration) - order backlog * n (configuration) > 0 means: there are more orders backlogged on the slide. In the past, it could only store twice the amount, but now it can store n times the amount. By adjusting the downstream review order grid threshold to be larger and increasing the number of downstream review order grids, the goods in the orders assigned to the grids can be reviewed in time, thereby improving business processing efficiency.

[0102] Figure 6 The following is a schematic diagram of the main flow of the distribution link of the business processing method according to an embodiment of the present application. The order matching review station is abstracted to the matching chute dimension, such as Figure 6As shown, the goods in the picking pool storage location are identified manually by scanning or automatically by a device, orders and chutes are matched for the scanned goods (for example, matched to chute 1, chute 2, or chute 3), and the goods are sorted based on the assigned chute.

[0103] Figure 7 It is a schematic diagram of the main process of the sorting and rechecking links of the business processing method according to an embodiment of the present application. The orders matched to a certain chute after sorting are pushed to a specific rechecking table by a sorting tool to perform the rechecking work. First, scan the sorting tool code and then scan the goods for sorting. The original rechecking link is split into two parts: the first is to scan the sorting tool code to determine the rechecking backlog range, and the second is to scan the goods code to determine the target rechecking order cell. This can simplify the sorting and rechecking processes and improve the processing efficiency of related sorting and rechecking operations. As Figure 7 shown, the sorting tool can be, for example, a sorting cart. An identification code, such as a QR code or a barcode, is pasted on the sorting cart, which is called the sorting cart code (that is, the sorting tool code). Scanning the sorting cart code determines the target chute bound to the sorting cart to determine the rechecking backlog range corresponding to the target chute. Scanning the goods in the target chute determines the actual sorting cell occupied, that is, the target rechecking order cell for rechecking. The goods collected in the target chute bound to the same order are transported to the target rechecking order cell by the sorting tool (such as a sorting cart) for rechecking, and then the rechecking backlog in the target chute is deducted, and the rechecking result data of the goods of the rechecked order is generated.

[0104] Figure 8 It is a schematic diagram of the main process of binding / unbinding a transfer cart in the sorting link of the business processing method according to an embodiment of the present application. This process involves checking the chute opening, obtaining the list of orders bound to the chute container, binding the transfer container, unbinding the transfer container (that is, the sorting tool container), and obtaining the order detail list.

[0105] Specifically, as Figure 8 shown, checking the chute opening: Scanning the chute opening with a scanning tool to obtain the available status of the chute opening from the warehouse management system wms. Wms returns the available status and direction of the chute opening. If it is determined that the chute opening is available, scan the sorting tool container number to obtain whether the sorting tool container number exists and its status from wms. Wms queries the master of the sorting tool controller to obtain whether the sorting tool container exists and its status. The master returns to wms whether the container exists and its status, and wms returns to the scanning tool whether the sorting tool container exists.

[0106] Get the list of slide container binding orders: If the distribution tool container number exists, get the bound slide container backlog from wms, that is, the list of slide container binding orders, that is, determine the bound slide review backlog range. Case 1: There is a slide container backlog, wms returns the pre-occupied order, collection order, order number, collection mark, and production end time; Case 2: There is no slide container backlog, wms returns null. If it is case 1, perform action 1: Get the bound slide container backlog order product details from wms, wms returns the bound slide container backlog order number, sku code, sku distributed quantity, and sku total quantity.

[0107] Unbinding the turnover container (i.e., distribution tool container): The scanning tool requests WMS to unbind the distribution tool container from the gate (i.e., slide gate). WMS determines whether the distribution tool container and the slide gate have a binding relationship. If there is no binding relationship, it prompts an error message "The slide gate container number is not bound yet, no need to unbind". WMS determines whether all orders under the slide gate bound to the distribution tool container have been collected. If there are uncollected orders, it prompts an error message "The orders have not been collected in full, please verify the details of the uncollected goods". WMS determines whether the number of pre-occupied orders for the slide gate is equal to the configuration parameter. If the number of pre-occupied orders for the slide gate is less than or equal to the configuration parameter, the user needs to select "The number of orders in the turnover vehicle is less than XX (the order value of the configuration parameter). Do you want to unbind directly?" When it is detected that the user clicks "OK", the unbinding is successful at WMS, the slide gate status is updated to unavailable, and the relationship between the slide gate and the distribution tool container is updated. WMS notifies the device that the slide gate status is unavailable, and the device returns a successful slide gate status update message to WMS.

[0108] Binding turnover container: The scanning tool requests wms to bind the distribution tool container and the slide port. wms determines whether the distribution tool container is idle. If not, it prompts an error message "The container is occupied and cannot be bound again". wms determines whether the slide port has been bound to other distribution tool containers. If so, it prompts an error message "The slide port has been bound to the distribution tool container XXXXXXX, please unbind it first". wms successfully binds the slide port and the distribution tool container, updates the slide port status to available, updates the relationship between the slide port and the distribution tool container, and wms returns success to the scanning tool, "binding successful". wms notifies the device that the slide port status is available, and the device returns a successful status update message to wms.

[0109] Get order detail list: Get the order item detail list of the chute that has been distributed through the distribution tool container.

[0110] Rebinwall Recheck: After the order goods at the chute entrance have been sorted, perform the recheck. Set the number of bins in the rebinwall, that is, the number of bins for rechecking orders. The number of orders in the consolidation order should not exceed the number of bins in the rebinwall. For example, if the number of orders in the consolidation order is 20, the number of bins in the rebinwall must be ≥ the number of orders, and enable individual scanning.

[0111] Packing Link: After packing the order goods that have passed the recheck, release the recheck order bins. To improve the business processing efficiency and overall enhance the production efficiency of flow picking. Release and improve the picking, sorting, rechecking, and packing production capacity of multi-piece orders in flow picking production.

[0112] Figure 9 It is a schematic diagram of the main units of the business processing device according to an embodiment of the present application. As Figure 9 shown, the business processing device 900 includes an acquisition unit 901, a first distribution unit 902, a second distribution unit 903, a scanning unit 904, and a calling unit 905.

[0113] The acquisition unit 901 is configured to acquire a business processing task and pull the corresponding order identifier.

[0114] The first distribution unit 902 is configured to acquire the product identifier pre-matched with the order identifier and allocate the corresponding product to the target storage location based on the product identifier.

[0115] The second distribution unit 903 is configured to determine the target chute and allocate each product corresponding to the same order identifier in the target storage location to the same target chute.

[0116] The scanning unit 904 is configured to scan the sorting tool code to determine the bound target chute, and determine the target recheck order bin according to the product identifier of the product in the bound target chute.

[0117] The calling unit 905 is configured to call the sorting tool corresponding to the sorting tool code to transport each product corresponding to the same order identifier in the bound target chute to the target recheck order bin.

[0118] In some embodiments, the first distribution unit 902 is further configured to: allocate the products corresponding to the same product identifier to the same target storage location.

[0119] In some embodiments, the second distribution unit 903 is further configured to: acquire the attribute data of the products in the target storage location and the status data of each candidate chute; determine the target chute according to the attribute data and the status data.

[0120] In some embodiments, the second distribution unit 903 is further configured to: use the order identifier corresponding to the product to be currently distributed in the target storage location as the target order identifier; if there is an assigned product corresponding to the target order identifier in one of the target chutes, distribute the currently to-be-distributed product to the target chute; if there is no assigned product corresponding to the target order identifier in any of the target chutes, distribute the currently to-be-distributed product to any one of the target chutes.

[0121] In some embodiments, the service processing device further includes Figure 9 a verification unit (not shown in the figure), configured to verify whether all products corresponding to the same order identifier in the bound target chute are collected, and if the verification result is not collected, prompt an error message.

[0122] In some embodiments, the service processing device further includes Figure 9 an unbinding unit (not shown in the figure), configured to: in response to the products in the bound target chute being empty, unbind the corresponding target chute and the sorting tool, and update the status of the corresponding target chute.

[0123] It should be noted that the service processing method and the service processing device of the present application have corresponding relationships in specific implementation contents, so the repeated contents will not be described again.

[0124] Figure 10 An exemplary system architecture 1000 to which the service processing method or the service processing device of the embodiments of the present application can be applied is shown.

[0125] As Figure 10 shown, the system architecture 1000 may include terminal devices 1001, 1002, 1003, a network 1004, and a server 1005. The network 1004 is used to provide a medium for communication links between the terminal devices 1001, 1002, 1003 and the server 1005. The network 1004 may include various connection types, such as wired, wireless communication links, or fiber optic cables, etc.

[0126] Users can use the terminal devices 1001, 1002, 1003 to interact with the server 1005 through the network 1004 to receive or send messages, etc. Various communication client applications may be installed on the terminal devices 1001, 1002, 1003, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only as examples).

[0127] The terminal devices 1001, 1002, 1003 may be various electronic devices with a service processing screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, and desktop computers, etc.

[0128] The server 1005 may be a server that provides various services. For example, it may be a background management server (only an example) that supports the business processing tasks obtained by the user using the terminal devices 1001, 1002, and 1003. The background management server may obtain the business processing tasks, pull the corresponding order identifiers; obtain the product identifiers pre-matched with the order identifiers, and allocate the corresponding products to the target storage locations based on the product identifiers; determine the target chute, and allocate each product corresponding to the same order identifier in the target storage location to the same target chute; scan the sorting tool code to determine the bound target chute, and determine the target verification order grid according to the product identifiers of the products in the bound target chute; call the sorting tool corresponding to the sorting tool code to transport each product corresponding to the same order identifier in the bound target chute to the target verification order grid. This realizes the decoupling of warehousing flow picking, sorting, and verification, and improves the efficiency of warehousing business processing.

[0129] It should be noted that the business processing method provided by the embodiments of the present application is generally executed by the server 1005. Correspondingly, the business processing device is generally set in the server 1005.

[0130] It should be understood that Figure 10 the numbers of the terminal devices, networks, and servers in

[0131] are merely illustrative. According to the implementation requirements, there may be any number of terminal devices, networks, and servers. Figure 11 is a schematic structural diagram of a computer system 1100 of a terminal device suitable for implementing the embodiments of the present application. Figure 11 The terminal device shown is only an example and should not impose any limitations on the functions and usage scope of the embodiments of the present application.

[0132] As Figure 11 shown, the computer system 1100 includes a central processing unit (CPU) 1101, which can perform various appropriate actions and processes according to the programs stored in the read-only memory (ROM) 1102 or the programs loaded from the storage section 1108 into the random access memory (RAM) 1103. In the RAM 1103, various programs and data required for the operation of the computer system 1100 are also stored. The CPU 1101, ROM 1102, and RAM 1103 are connected to each other through a bus 1104. The input / output (I / O) interface 1105 is also connected to the bus 1104.

[0133] The following components are connected to the I / O interface 1105: an input section 1106 including a keyboard, a mouse, etc.; an output section 1107 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc. and a speaker, etc.; a storage section 1108 including a hard disk, etc.; and a communication section 1109 including a network interface card such as a LAN card, a modem, etc. The communication section 1109 performs communication processing via a network such as the Internet. A drive 1110 is also connected to the I / O interface 1105 as required. A removable medium 1111, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is mounted on the drive 1110 as required so that a computer program read therefrom is installed into the storage section 1108 as required.

[0134] Specifically, according to the embodiments disclosed in the present application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, the embodiments disclosed in the present application include a computer program product that includes a computer program carried on a computer-readable medium, and the computer program includes program codes for performing the methods shown in the flowcharts. In such an embodiment, the computer program can be downloaded and installed from a network via the communication section 1109, and / or installed from the removable medium 1111. When the computer program is executed by a central processing unit (CPU) 1101, the above-described functions defined in the system of the present application are performed.

[0135] It should be noted that the computer-readable medium shown in this application can be a computer-readable signal medium, a computer-readable storage medium, or any combination of the above two. A computer-readable storage medium can include, for example, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of a computer-readable storage medium can include, but are not limited to: an electrical connection with 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 application, a computer-readable storage medium can be any tangible medium that contains or stores a program, which can be used by or in conjunction with an instruction execution system, apparatus, or device. And in this application, a computer-readable signal medium can include a data signal propagated in a baseband or as part of a carrier wave, in which the computer-readable program code is carried. Such a propagated data signal can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device. The program code contained on a computer-readable medium can be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0136] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram can represent a module, a program segment, or a part of code, and the above module, program segment, or part of code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks can occur in a different order than marked in the accompanying drawings. For example, two consecutive blocks shown can actually be executed substantially in parallel, and they can sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram or flowchart, as well as the combination of blocks in the block diagram or flowchart, can be implemented by a dedicated hardware-based system for performing the specified functions or operations, or can be implemented by a combination of dedicated hardware and computer instructions.

[0137] The units involved in the embodiments of the present application can be implemented in software or in hardware. The described units can also be provided in a processor. For example, it can be described as: a processor includes an acquisition unit, a first allocation unit, a second allocation unit, a scanning unit, and a calling unit. Among them, the names of these units do not constitute a limitation on the unit itself in some cases.

[0138] As another aspect, the present application also provides a computer-readable medium. The computer-readable medium can be included in the device described in the above embodiments; or it can exist alone without being assembled into the device. The above computer-readable medium carries one or more programs. When the above one or more programs are executed by the device, the device acquires a business processing task, pulls the corresponding order identifier; acquires a product identifier pre-matched with the order identifier, and allocates the corresponding product to a target storage location based on the product identifier; determines a target chute, and allocates each product corresponding to the same order identifier in the target storage location to the same target chute; scans the sorting tool code to determine the bound target chute, and determines the target verification order compartment according to the product identifiers of the products in the bound target chute; calls the sorting tool corresponding to the sorting tool code to transport each product corresponding to the same order identifier in the bound target chute to the target verification order compartment.

[0139] The computer program product of the present application includes a computer program, and the computer program implements the business processing method in the embodiments of the present application when executed by a processor.

[0140] According to the technical solution of the embodiments of the present application, it is possible to decouple the picking, sorting, and verification of the warehousing process, and improve the efficiency of warehousing business processing.

[0141] The above specific implementation manners do not constitute a limitation on the protection scope of the present application. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can occur depending on design requirements and other factors. Any modifications, equivalent replacements, and improvements made within the spirit and principles of the present application shall be included within the protection scope of the present application.

Claims

1. A service processing method, characterized in that, including: Obtain a business processing task and pull the corresponding order identifier; Obtain a product identifier pre-matched with the order identifier, and allocate the corresponding product to a target storage location based on the product identifier; Determine a target chute, and allocate each product corresponding to the same order identifier in the target storage location to the same target chute; Scan the sorting tool code to determine the bound target chute, and determine the target verification order slot according to the product identifier of the product in the bound target chute; Call the sorting tool corresponding to the sorting tool code to transport each product corresponding to the same order identifier in the bound target chute to the target verification order slot.

2. The method according to claim 1, wherein The allocating the corresponding product to the target storage location based on the product identifier includes: Allocating the products corresponding to the same product identifier to the same target storage location.

3. The method according to claim 1, wherein The determining the target chute includes: Obtain the attribute data of the products in the target storage location and the status data of each candidate chute; Determine the target chute according to the attribute data and the status data.

4. The method according to claim 1, wherein The allocating each product corresponding to the same order identifier in the target storage location to the same target chute includes: Taking the order identifier corresponding to the product to be allocated currently in the target storage location as the target order identifier; If there is an allocated product corresponding to the target order identifier in a target chute, allocate the currently to-be-allocated product to this target chute; If there is no allocated product corresponding to the target order identifier in any target chute, allocate the currently to-be-allocated product to any target chute.

5. The method according to claim 1, wherein Before the calling the sorting tool corresponding to the sorting tool code to transport each product corresponding to the same order identifier in the bound target chute to the target verification order slot, the method further includes: Verify whether all the products corresponding to the same order identifier in the bound target chute are collected. If the verification result is not collected, prompt an error message.

6. The method according to claim 1, characterized in that, The method further includes: In response to the products in the bound target chute being empty, unbind the corresponding target chute and sorting tool, and update the status of the corresponding target chute.

7. A service processing device, characterized in that, including: An obtaining unit configured to obtain a business processing task and pull the corresponding order identifier; A first allocation unit configured to obtain a product identifier pre-matched with the order identifier, and allocate the corresponding product to a target storage location based on the product identifier; A second allocation unit configured to determine a target chute, and allocate each product corresponding to the same order identifier in the target storage location to the same target chute; A scanning unit configured to scan the sorting tool code to determine the bound target chute, and determine the target verification order slot according to the product identifier of the product in the bound target chute; A calling unit configured to call the sorting tool corresponding to the sorting tool code to transport each product corresponding to the same order identifier in the bound target chute to the target verification order slot.

8. An electronic device for business processing, characterized in that, including: One or more processors; A storage device 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 method according to any one of claims 1-6.

9. A computer-readable medium having a computer program stored thereon, characterized in that, When the program is executed by a processor, the method according to any one of claims 1-6 is implemented.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, the method according to any one of claims 1-6 is implemented.

Images