CN116562759A - Task list generation method, device, electronic equipment and computer readable medium - Google Patents

Abstract

The embodiment of the disclosure discloses a task sheet generation method, a device, an electronic device and a computer readable medium. One embodiment of the generating method comprises the following steps: determining whether the offer-back task contains specified information or not in response to receiving the offer-back task, wherein the specified information is used for representing that the offer-back article is delivered according to the target attribute; responding to the determination that the specified information is contained, and grouping the various back-supplied articles in the same inventory area according to the target attribute of the various back-supplied articles to obtain a plurality of task items; for each of the plurality of task items, a task sheet corresponding to the offer-back task is generated based on inventory information of the offer-back item indicated by the task item. The embodiment relates to warehouse management technology, and can group, pick and leave the articles to be returned according to the target attribute in the task to be returned. Thus, the processing of returned articles by the suppliers is facilitated, and the receiving efficiency of the suppliers is improved.

Description

Task list generation method, device, electronic equipment and computer readable medium

Technical Field

The embodiment of the disclosure relates to the technical field of warehouse management, in particular to a task sheet generation method, a task sheet generation device, electronic equipment and a computer readable medium.

Background

In warehouse production, products purchased from suppliers may generally occupy warehouse resources due to product quality problems, poor sales, etc., and need to be returned to the suppliers, and the delivery order of such a business scenario is generally called a return order. The feature of the offer return is that a provider often issues an offer return only once in a period of time. In general, the order of withdrawal involves a large number of items, and the amount of goods required is also large.

However, the inventors have found that when task allocation is performed based on the offer list, an offer list is typically a collection list. In a collection sheet, all items will typically be positioned according to inventory, determining the order of the pick path. And then according to the order, a plurality of task sheets are built for picking, rechecking, packaging, ex-warehouse and the like. When the suppliers receive the returned articles, the suppliers often need to perform treatment such as classification again according to actual requirements. This can affect the shipping efficiency of the supplier.

The above information disclosed in this background section is only for enhancement of understanding of the background of the inventive concept and, therefore, may contain information that does not form the prior art that is already known to those of ordinary skill in the art in this country.

Disclosure of Invention

The disclosure is in part intended to introduce concepts in a simplified form that are further described below in the detailed description. The disclosure is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.

Some embodiments of the present disclosure propose a task sheet generation method, apparatus, electronic device, computer readable medium and computer program product to solve one or more of the technical problems mentioned in the background section above.

In a first aspect, some embodiments of the present disclosure provide a task sheet generating method, including: determining whether the offer-back task contains specified information or not in response to receiving the offer-back task, wherein the specified information is used for representing that the offer-back article is delivered according to the target attribute; responding to the determination that the specified information is contained, and grouping the various articles for withdrawal in the same inventory area according to the target attribute of the various articles for withdrawal to obtain a plurality of task items, wherein each target attribute corresponds to one task item; for each of the plurality of task items, a task sheet corresponding to the offer-back task is generated based on inventory information of the offer-back item indicated by the task item.

In some embodiments, generating a task sheet corresponding to the offer-back task based on inventory information of the offer-back items in the task item includes: determining whether inventory information of the back-supplied articles indicated by the task item meets a first back-supply condition of the back-supply task; in response to determining that the first decompensation condition is satisfied, a single task sheet for the task item is generated.

In some embodiments, generating a task sheet corresponding to the offer-back task based on inventory information of the offer-back items in the task item further includes: in response to determining that the first decompensation condition is not satisfied, the task item is determined to be a candidate group list task item.

In some embodiments, the method further comprises: in response to determining that a plurality of candidate group single task items exist, determining a channel in which each candidate back-fed item is located according to the inventory position of each candidate back-fed item, wherein the candidate back-fed item is the back-fed item indicated by the candidate group single task item; and combining the plurality of candidate group list task items based on the inventory information of each candidate offer item and the channel where each candidate offer item is located, and generating a cross-item task list.

In some embodiments, combining a plurality of candidate group list task items based on inventory information of each candidate offer item and a channel, generating a cross-item task list, including: selecting a seed channel from each channel based on the stock information of each candidate offer-back article and the channel where the candidate offer-back article is located; selecting seed task items from the candidate stock withdrawal items in the seed channel and the corresponding candidate group single task items; determining a target task item according to a channel identification range of a channel in which a candidate back supply item indicated by the seed task item is located, wherein the target task item is a candidate group list task item of which the corresponding channel identification is located in the channel identification range except the seed task item in a plurality of candidate group list task items; and generating a cross-item task list based on the seed task item and the target task item.

In some embodiments, generating the cross-term task sheet based on the seed task item and the target task item includes: determining inventory information of candidate offer-back items indicated by the seed task item and the target task item, and whether a second offer-back condition of the offer-back task is met; in response to determining that the second decompensation condition is not met, expanding a channel identification range corresponding to the seed task item according to a preset value; and determining a new target task item according to the extended channel identification range until the inventory information meets a second outage condition, or the extended channel identification range reaches a maximum channel identification range, wherein the maximum channel identification range is a channel identification range formed by a plurality of candidate group single task items, corresponding to the maximum channel identification and the minimum channel identification.

In some embodiments, generating the cross-term task sheet based on the seed task item and the target task item includes: in response to determining that the second decompensation condition is met, generating a cross-item task list including the seed task item and the target task item, and removing the seed task item and the target task item from the plurality of candidate group list task items.

In some embodiments, selecting a seed lane from among the lanes based on inventory information of each candidate offer, the lane in which it is located, comprises: counting the total number of the candidate back-feeding articles in the channels where the candidate back-feeding articles are located; and selecting the channel with the largest total number from all channels as a seed channel according to the order of the total number from large to small.

In some embodiments, selecting a channel with the largest total number from the channels as a seed channel in order of the largest total number, including: in response to determining that there are at least two lanes with the same total number, determining a first candidate set of single task items corresponding to a maximum number of candidate stock items in each lane of the at least two lanes; and determining the sequence of at least two channels according to the sequence of the difference from small to large based on the difference between the maximum channel identifier and the minimum channel identifier corresponding to the single task item of the first candidate group.

In some embodiments, selecting, from among the channels, the channel with the largest total number as the seed channel in order of the total number from the largest to the smallest, further includes: in response to determining that at least two channels with the same difference exist, determining a first candidate group single task item corresponding to the largest number of candidate stock withdrawal items in each of the at least two channels; the order of the at least two lanes is determined in an order of the number of pieces from large to small based on the number of pieces of the candidate stock removal indicated by the first candidate set of single task items.

In some embodiments, the target attribute is a bin attribute, wherein like items of the same gauge size have the same bin attribute identification.

In a second aspect, some embodiments of the present disclosure provide a task sheet generating device, including: the information determining unit is configured to determine whether the offer-back task contains specified information or not in response to receiving the offer-back task, wherein the specified information is used for representing that the offer-back article is delivered according to the target attribute; the grouping unit is configured to group the articles for withdrawal in the same inventory area according to the target attribute of the articles for withdrawal in response to the determination that the specified information is contained, so as to obtain a plurality of task items, wherein each target attribute corresponds to one task item; and a generation unit configured to generate, for each of the plurality of task items, a task sheet corresponding to the offer-back task based on inventory information of the offer-back article indicated by the task item.

In some embodiments, the generating unit comprises: a condition determination subunit configured to determine whether inventory information of the offer-back item indicated by the task item satisfies a first offer-back condition of the offer-back task; and a single task sheet generation subunit configured to generate a single task sheet for the task item in response to determining that the first decompensation condition is satisfied.

In some embodiments, the generating unit further comprises a group list task item determining subunit configured to determine the task item as a candidate group list task item in response to determining that the first decompensation condition is not satisfied.

In some embodiments, the apparatus further comprises: a channel determining unit configured to determine, in response to determining that there are a plurality of candidate group single task items, a channel in which each candidate item is located according to an inventory position of each candidate item, wherein the candidate item is an item indicated by the candidate group single task item; and the cross-item task list generation unit is configured to combine a plurality of candidate group list task items based on the inventory information of each candidate offer-back item and the channel where each candidate offer-back item is located, so as to generate a cross-item task list.

In some embodiments, the cross-item task sheet generation unit includes: a seed channel selecting subunit configured to select a seed channel from each channel based on inventory information of each candidate offer-back item and the channel in which the candidate offer-back item is located; a seed task item selecting subunit configured to select a seed task item from each candidate group of single task items corresponding to each candidate offer item located in the seed channel; the target task item determining subunit is configured to determine a target task item according to a channel identification range of a channel in which the candidate offer item indicated by the seed task item is located, wherein the target task item is a candidate group list task item in which a corresponding channel identification is located in the channel identification range except the seed task item in a plurality of candidate group list task items; and a generation subunit configured to generate a cross-item task list based on the seed task item and the target task item.

In some embodiments, the generating subunit is further configured to determine whether the inventory information of the candidate decommissioned item indicated by the seed task item and the target task item meets a second decommissioned condition for the decommissioned task; in response to determining that the second decompensation condition is not met, expanding a channel identification range corresponding to the seed task item according to a preset value; and determining a new target task item according to the extended channel identification range until the inventory information meets a second outage condition, or the extended channel identification range reaches a maximum channel identification range, wherein the maximum channel identification range is a channel identification range formed by a plurality of candidate group single task items, corresponding to the maximum channel identification and the minimum channel identification.

In some embodiments, the generating subunit is further configured to generate a cross-item task list including the seed task item and the target task item, and remove the seed task item and the target task item from the plurality of candidate group list task items, in response to determining that the second decompensation condition is satisfied.

In some embodiments, the seed lane selection subunit is further configured to count the total number of candidate destaged articles in lanes in which each candidate destaged article is located; and selecting the channel with the largest total number from all channels as a seed channel according to the order of the total number from large to small.

In some embodiments, the seed lane selection subunit is further configured to determine, in response to determining that there are at least two lanes having the same total number of lanes, a first candidate set of single task items corresponding to a largest number of candidate stock items in each lane of the at least two lanes; and determining the sequence of at least two channels according to the sequence of the difference from small to large based on the difference between the maximum channel identifier and the minimum channel identifier corresponding to the single task item of the first candidate group.

In some embodiments, the seed lane selection subunit is further configured to determine, in response to determining that there are at least two lanes with the same difference, a first candidate set of single task items corresponding to a maximum number of candidate stock items in each of the at least two lanes; the order of the at least two lanes is determined in an order of the number of pieces from large to small based on the number of pieces of the candidate stock removal indicated by the first candidate set of single task items.

In some embodiments, the target attribute is a bin attribute, wherein like items of the same gauge size have the same bin attribute identification.

In a third aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; a storage device having one or more programs stored thereon, which when executed by one or more processors causes the one or more processors to implement the method described in any of the implementations of the first aspect above.

In a fourth aspect, some embodiments of the present disclosure provide a computer readable medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the method described in any of the implementations of the first aspect.

In a fifth aspect, some embodiments of the present disclosure provide a computer program product comprising a computer program which, when executed by a processor, implements the method described in any of the implementations of the first aspect above.

The above embodiments of the present disclosure have the following advantageous effects: the task sheet generation method of some embodiments of the present disclosure helps to improve the receiving efficiency of suppliers. Specifically, in general, a task sheet is built according to a back-up task, and the ex-warehouse side often takes the self-management into consideration. I.e., the order of picking and the path of picking is generally determined based on inventory information of the offered items. This can improve the delivery efficiency. However, this way of leaving a warehouse often occurs when there are multiple articles to be returned from one package. In this case, after receiving the returned articles, the suppliers often need to perform a secondary sorting process, which may affect the receiving efficiency.

Based on this, the task sheet generation method of some embodiments of the present disclosure may group the offer items within the same inventory area according to the target attribute indicated in the offer task. Thereby generating a plurality of task sheets in combination with the grouping situation of the various offered items and the inventory information. The resulting pick path and order take into account not only inventory information of the items, but also target attribute groupings of the items. Therefore, the method can realize the boxing of the returned articles according to the target attribute, and the delivery efficiency is not affected too much, so that both the delivery party and the supplier are considered. In addition, the target attribute requirements set forth by the suppliers are considered when the articles are returned to the warehouse. In this way, the suppliers typically do not need to perform secondary treatment after receiving the return goods, thereby improving the receiving efficiency.

Drawings

The above and other features, advantages, and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. The same or similar reference numbers will be used throughout the drawings to refer to the same or like elements. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale.

FIG. 1 is a flow chart of some embodiments of a task sheet generation method of the present disclosure;

FIG. 2 is a flow chart of other embodiments of a task sheet generation method of the present disclosure;

FIG. 3 is a schematic view of some embodiments of a lane in which candidate stock items are located;

FIG. 4 is a flow chart of yet other embodiments of a task sheet generation method of the present disclosure;

FIG. 5 is a schematic diagram of the architecture of some embodiments of a task sheet generation device of the present disclosure;

fig. 6 is a schematic structural diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.

Detailed Description

Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.

It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings. Embodiments of the present disclosure and features of embodiments may be combined with each other without conflict.

It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.

It should be noted that references to "one", "a plurality" and "a plurality" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be understood as "one or more" unless the context clearly indicates otherwise.

The names of messages or information interacted between the various devices in the embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.

The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.

FIG. 1 illustrates a flow 100 of some embodiments of a task sheet generation method according to the present disclosure. The method comprises the following steps:

step 101, in response to receiving the decommissioning task, determining whether the decommissioning task contains specified information.

In some embodiments, the execution body (e.g., server) of the task sheet generation method may receive information of the decommissioned task through a wired connection or a wireless connection. Here, refund generally refers to refunding items purchased from the provider to the provider. The inventory may generally take up warehouse resources due to quality problems or poor sales, and thus be returned to the suppliers. The delivery task of such a business scenario is generally referred to as a decommissioning task. The resulting delivery order is the return order. The decommissioning task may include at least one of the following information: vendor identification, task identification, a list of details of the offered items (e.g., item identification, number of pieces, etc.), etc.

In some embodiments, the executing body may determine whether the decommissioning task includes the specified information if the decommissioning task is received. The specified information can be used for representing that the offer-back article is delivered according to the target attribute. The target attribute here may be set according to actual conditions. As an example, the target attribute may be a category of the item, a date of manufacture, and the like.

Alternatively, the target attribute may be a bin attribute. It should be noted that similar articles of the same size and specification generally have the same box attribute identifier. For example, for 3C (short for three types of electronic products, namely computer, communication and consumer electronics) suppliers, a mobile phone with the same specification and size is generally a box attribute number; the keyboard of the same size is typically a box attribute number or the like. For this case, a field may be added to the decommissioned task to indicate that the task is to be out of stock according to the bin property. And a specific bin attribute identification for each item may be specified in the list of details.

It will be appreciated that the supplier may record the correspondence of the item to the bin attribute identifier. In addition, when the articles are put in storage, the warehouse manager can record and store the corresponding relation.

Step 102, in response to determining that the specified information is included, grouping each offer-backed item in the same inventory area according to the target attribute of each offer-backed item to obtain a plurality of task items.

In some embodiments, if it is determined that the offer task includes the specified information, the execution body may group the offered items in the same inventory area according to the target attribute of the offered items, so as to obtain a plurality of task items. Wherein each target attribute corresponds to a task item. That is, the items for withdrawal of the same target attribute are grouped together, thereby generating and obtaining a task item.

It is understood that the same inventory area may be the same storage location area. For another example, the same inventory area may be the same picking job area for improved picking delivery efficiency. Typically, each warehouse picker is responsible for a fixed area. As an example, as shown in the inventory schematic of fig. 3, lanes 0 through 10 may be the same inventory area. For the offerings a, b, c, and d stored in the inventory area, a task item may be generated based on the respective bin attribute identifications. It can be seen that four task items are available for the inventory area shown in FIG. 3.

Step 103, for each task item in the plurality of task items, generating a task list corresponding to the back-supply task based on the stock information of the back-supply item indicated by the task item.

In some embodiments, for each of the plurality of task items obtained in step 102, the execution subject may generate a task sheet corresponding to the above-mentioned offer task based on the inventory information of the offer item indicated by the task item, and then perform the delivery of the offer item. For example, a task sheet may be generated from each task item. In this way, after receiving the return goods, the suppliers usually do not need to perform sorting and other treatments, or the treatment flow can be simplified, thereby contributing to improving the goods receiving efficiency of the suppliers.

It should be noted that when the container is packed and taken out of the warehouse, a case often needs to be removed from the container, or a case is not fully packed. Therefore, the space of the carton is wasted, and the consumable cost is increased. In some embodiments, to reduce resource waste, for each of a plurality of task items, an executing subject may determine, for the task item, inventory information of the offer-back item indicated by the task item, whether a first offer-back condition for the offer-back task is satisfied. The first decommissioning condition may be set according to actual situations, and may include at least one of the following: upper limit values of the number of articles, the volume, and the like. Here, the inventory information (item count, number of pieces, volume, etc.) of each task item is typically the sum of all the inventories of the corresponding stock-backed item in the same inventory area.

Here, if the inventory information of a certain task item satisfies any one of the first out-supply conditions, the execution subject may determine that it satisfies the condition. At this time, the execution subject may generate a single task sheet of the task item. That is, a single task sheet typically contains only one task item. Alternatively, it may be that the inventory information satisfies all items in the first out-supply condition, i.e., the task satisfies the condition.

Further, if it is determined that the inventory information of a task item does not satisfy the first decommissioning condition, the execution subject may determine the task item as a candidate group list task item. At this time, the task item may be continuously judged without processing it. Until all task items in the same inventory area are judged. Here, if all task items are judged to be completed and then a single task item is generated, the execution subject is completed. Otherwise, the execution body may continue to execute the cross-item group single flow as shown in FIG. 2.

With the above description, the task sheet generating method according to some embodiments of the present disclosure may group the offer items in the same inventory area according to the target attribute indicated in the offer task. Thereby generating a plurality of task sheets in combination with the grouping situation of the various offered items and the inventory information. The resulting pick path and order take into account not only inventory information of the items, but also target attribute groupings of the items. Therefore, the method can realize the boxing of the returned articles according to the target attribute, and the delivery efficiency is not affected too much, so that both the delivery party and the supplier are considered. In addition, the target attribute requirements set forth by the suppliers are considered when the articles are returned to the warehouse. In this way, the suppliers typically do not need to perform secondary treatment after receiving the return goods, thereby improving the receiving efficiency.

With continued reference to FIG. 2, a flow 200 of further embodiments of a task sheet generation method according to the present disclosure is shown. The method comprises the following steps:

step 201, selecting a seed channel from all channels based on inventory information of all candidate back-supplied articles and the channel where the candidate back-supplied articles are located.

In some embodiments, the execution body of the task list generating method may determine, when it is determined that there are a plurality of (at least two) candidate group single task items, a channel where each candidate for the item is located according to an inventory location of each candidate for the item. The candidate offer item may be an offer item indicated by the candidate group single task item. The plurality of candidate group list task items are typically task items of the same inventory area. That is, the executing body may locate the inventory position of each candidate for-feeding item, and assign the candidate for-feeding item to the corresponding channel according to the located channel identifier. Typically, the offer-backed item indicated by a task item may be distributed to multiple lanes for storage. And one channel may have stored therein an offer-back item indicated by a plurality of task items.

Here, based on inventory information of each candidate offer item and the channel where the candidate offer item is located, the execution subject may combine a plurality of candidate group list task items to generate a cross-item task list. As an example, the execution body may combine the plurality of candidate group single task items according to inventory information of each candidate offer item to satisfy the second offer condition of the offer task. The second decommissioning condition may also be set according to actual requirements, for example, may include at least one of the following: the upper limit values of the number of items, the number of pieces, the volume, the number of target attributes, and the like.

In this case, the execution entity may combine the candidate group list task items based on the number of the candidate items to be returned, thereby satisfying the upper limit value of the number. For example, the execution entity may combine the number of items or the volume of the item to be returned according to the candidate, so as to satisfy the upper limit value of the number of items or the upper limit value of the volume. Wherein the upper limit of the volume may be an integer multiple of the package. Therefore, the utilization rate of the packaging box can be improved, the resource waste is reduced, and the consumable cost is reduced.

In some embodiments, the execution body may also generate the cross-item task sheet as described in steps 202 through 204 below. Therefore, the assembled cross-item task list is ensured to be centralized in order picking, and the order picking efficiency is improved. And the picking amount is large each time, so that the picking times can be reduced.

Step 202, selecting a seed channel from all channels based on inventory information of all candidate offer-back items and the channel where the candidate offer-back items are located.

In some embodiments, the executing entity may select a seed lane from among the lanes based on inventory information of each candidate offer, the lane in which it is located. As an example, the execution body may choose any channel from among them as a seed channel. For another example, the execution body may select a channel with a largest or smallest channel identifier as a seed channel.

Alternatively, first, the executing entity may count the total number of candidate items to be returned in each lane in which each candidate item is located. Then, the channel with the largest total number may be selected from the channels in order of the total number from the largest to the smallest as the seed channel.

In some embodiments, if there are at least two channels with the same total number, the execution body may determine, in each of the at least two channels, a first candidate group list task item corresponding to the largest number of candidate for-supply items. Based on the difference value between the maximum channel identifier and the minimum channel identifier corresponding to the first candidate group single task item, namely the difference value between the maximum value and the minimum value of the channel identifiers of the channels where the candidate refund articles are located indicated by the first candidate group single task item. At this time, the execution body may determine the order of at least two channels in order of the difference from small to large. It will be appreciated that the channel identification may generally characterize the order of placement locations of the channels.

In some embodiments, if there are at least two channels with the same difference, the execution body may determine, in each of the at least two channels, a first candidate group single task item corresponding to a largest number of candidate for-supply items. The order of the at least two lanes is determined in an order of the number of pieces from large to small based on the number of pieces of the candidate stock removal indicated by the first candidate set of single task items.

As an example, if the total number of items in lane 1 (i.e., the number of items a) and the total number of items in lane 2 (i.e., the sum of the numbers of items a and b) are as shown in fig. 3. At this time, the first candidate group list task item in the channels 1 and 2 may be determined to be the candidate group list task item corresponding to the item a and the candidate group list task item corresponding to the item b. As can be seen from the figure, the difference in lane identifications of article a is 8 (9-1); the difference in lane identification of article b is 6 (8-2). Since 6 is smaller than 8, the channel 2 is arranged in front of the channel 1. Here, if the differences of the channel identifications are the same, the arrangement order of the channels 1 and 2 can be determined based on the number of the articles a and b.

Step 203, selecting a seed task item from the candidate stock items in the seed channel and the corresponding candidate group single task items.

In some embodiments, the execution body may select a candidate group of single task items from the candidate group of single task items corresponding to the seed channel as the seed task item. The manner of selection herein is likewise not limiting. As an example, to improve the picking efficiency, a candidate group list task item corresponding to the candidate stock item with the largest number of pieces may be selected from the candidate stock items located in the seed channel as the seed task item.

Step 204, determining a target task item according to the channel identification range of the channel where the candidate offer item is located, which is indicated by the seed task item.

In some embodiments, the executing entity may determine the target task item based on the candidate offer indicated by the seed task item, the lane identification range of the lane in which the candidate offer is located. The target task item may be a candidate group single task item in which the corresponding channel identifier is located within the channel identifier range, except for the seed task item in the plurality of candidate group single task items.

As an example, if the candidate group list task item corresponding to the item a in the lane 1 in fig. 3 is a seed task item, it may be determined that the lane identification range thereof is [1,9]. At this time, the candidate group list task items in the channel identification range are task items corresponding to the items a and b. Then the target task item may be determined to be the task item corresponding to item b.

Step 205, generating a cross-item task list based on the seed task item and the target task item.

In some embodiments, the execution body may generate the cross-item task sheet based on the seed task item and the target task item. A cross-task sheet herein is typically a task sheet that contains at least two task items. For example, the execution body may generate a cross-item task sheet based on the seed task item and the target task item.

In some embodiments, to further increase the resource utilization and pick efficiency, the execution body may further determine whether the inventory information of the candidate offer items indicated by the seed task item and the target task item satisfies the second offer condition. If it is determined that the second decompensation condition is satisfied, the execution body may generate a cross-item task sheet including the seed task item and the target task item. Alternatively, for multiple target task items, the execution bodies may be ordered in order of the number of items from large to small. At this time, the execution body may gradually accumulate the target task items in this order to determine whether the second decommissioning condition is satisfied.

In addition, in the case of generating a cross-item task sheet, the execution body may remove the composed seed task item and target task item from the plurality of candidate group-sheet task items. That is, the task item of the current construction is removed from the candidate group list task items corresponding to the channels. After the removal, if the channel has no corresponding candidate group list task item, i.e. no task item to be built, the channel identification of the channel can be removed. I.e., from the channel identifications corresponding to the plurality of candidate group single task items. If there are still candidate single task items (or channel identifiers, i.e., channels to be built), the execution subject may continue to step 201.

Optionally, if it is determined that the second offer-withdrawal condition is not satisfied, the execution body may expand the channel identifier range corresponding to the seed task item according to a preset value. The execution body may then loop through step 204 described above. That is, according to the extended channel identification range, a new target task item can be determined. As an example, as shown in fig. 3, for item a indicated by the seed task item, its extended lane identification range may be [0, 10]. At this time, it may be determined that the new target task item is a candidate group list task item indicating items b, c, d.

Further, the execution body may determine whether the new target task item satisfies the second decompensation condition. And ending the whole flow until the inventory information meets a second off-supply condition or the extended channel identification range reaches the maximum channel identification range. It will be appreciated that if the second offer rejection condition is not satisfied after all of the remaining candidate group list task items are accumulated, the execution body may construct a cross-task list as a whole. The specific flow can be seen in fig. 4.

Here, the maximum channel identification range may be the channel identification range within the same inventory area as described above. This may avoid cross-zone picking. Optionally, in order to improve the efficiency of generating the task list, the maximum channel identifier range may be a channel identifier range formed by a plurality of candidate group list task items and a corresponding maximum channel identifier and a minimum channel identifier. This avoids screening the aisle where no candidate stock items are stored. It will be appreciated that an out-of-supply task often corresponds to a vendor. And the different suppliers' offerings are also typically not able to sort.

The task list generation method further enriches and perfects the flow of generating the task list. That is, for task items that do not satisfy the first decompensation condition, a cross-item group order may be performed, thereby generating a cross-item task order. The number of target attributes and the number of channels expanded each time for constructing the cross task list can be flexibly controlled. Therefore, the single picking amount can be improved, the integral picking times can be reduced, and the picking efficiency can be improved. That is, embodiments of the present disclosure provide a strategy for building a job ticket based on a target attribute (e.g., a box attribute). After the positioning details of all the articles are grouped according to the stock area, the articles are grouped according to the target attribute identification in each group. And then, firstly constructing a task list according to the same target attribute. The target attribute groups of less than one task list can be flexibly controlled by adding parameter configuration to build the task list across other target attributes. Thereby achieving the purposes of saving the consumable cost, improving the efficiency of picking and delivering the goods for the back-supply list and improving the receiving efficiency of suppliers.

It should be noted that, when only one candidate group list task item exists in one inventory area, the execution subject may generate a task list according to the candidate group list task item. Or, at least one task list can be selected from the generated single task list according to the second offer-withdrawal condition, so that the task list is matched with the candidate list task list to generate the cross-item task list.

With further reference to fig. 5, as an implementation of the methods illustrated in fig. 1, 2, and 4 described above, the present disclosure provides some embodiments of a task sheet generation device. These apparatus embodiments correspond to those method embodiments shown in fig. 1, 2 and 4. The device can be applied to various electronic equipment.

As shown in fig. 5, the task sheet generation device 500 of some embodiments may include: an information determining unit 501 configured to determine, in response to receiving the offer-back task, whether the offer-back task includes specified information, where the specified information is used to characterize that the offer-back article is to be delivered according to the target attribute; a grouping unit 502 configured to group each offered item in the same inventory area according to the target attribute of each offered item in response to determining that the specified information is included, to obtain a plurality of task items, wherein each target attribute corresponds to one task item; the generating unit 503 is configured to generate, for each of the plurality of task items, a task sheet corresponding to the offer-back task based on inventory information of the offer-back article indicated by the task item.

In some embodiments, the generating unit 503 may include: a condition determining subunit (not shown in the figure) configured to determine whether the inventory information of the offer-back items indicated by the task item satisfies a first offer-back condition of the offer-back task; a single task sheet generation subunit (not shown in the figure) configured to generate a single task sheet for the task item in response to determining that the first decompensation condition is satisfied.

In some embodiments, the generating unit 503 may further include a group list task item determining subunit (not shown in the figure) configured to determine the task item as a candidate group list task item in response to determining that the first decommissioning condition is not satisfied.

In some embodiments, the task sheet generating device 500 may further include: a channel determining unit (not shown in the figure) configured to determine, in response to determining that there are a plurality of candidate group single task items, a channel in which each candidate item is located according to an inventory position of each candidate item, wherein the candidate item is an item indicated by the candidate group single task item; and a cross-item task list generating unit (not shown in the figure) configured to combine the plurality of candidate group list task items based on inventory information of each candidate offer item and the channel where each candidate offer item is located, and generate a cross-item task list.

In some embodiments, the cross-item task sheet generation unit may include: a seed channel selecting subunit configured to select a seed channel from each channel based on inventory information of each candidate offer-back item and the channel in which the candidate offer-back item is located; a seed task item selecting subunit configured to select a seed task item from each candidate group of single task items corresponding to each candidate offer item located in the seed channel; the target task item determining subunit is configured to determine a target task item according to a channel identification range of a channel in which the candidate offer item indicated by the seed task item is located, wherein the target task item is a candidate group list task item in which a corresponding channel identification is located in the channel identification range except the seed task item in a plurality of candidate group list task items; and a generation subunit configured to generate a cross-item task list based on the seed task item and the target task item.

In some embodiments, the generating subunit may be further configured to determine whether the inventory information of the candidate decommissioned item indicated by the seed task item and the target task item meets a second decommissioned condition of the decommissioned task; in response to determining that the second decompensation condition is not met, expanding a channel identification range corresponding to the seed task item according to a preset value; and determining a new target task item according to the extended channel identification range until the inventory information meets a second outage condition, or the extended channel identification range reaches a maximum channel identification range, wherein the maximum channel identification range is a channel identification range formed by a plurality of candidate group single task items, corresponding to the maximum channel identification and the minimum channel identification.

In some embodiments, the generating subunit may be further configured to generate a cross-item task list including the seed task item and the target task item, and remove the seed task item and the target task item from the plurality of candidate group list task items, in response to determining that the second decompensation condition is satisfied.

In some embodiments, the seed lane selection subunit may be further configured to count the total number of candidate destaged articles in lanes in which each candidate destaged article is located; and selecting the channel with the largest total number from all channels as a seed channel according to the order of the total number from large to small.

In some embodiments, the seed lane selection subunit may be further configured to determine, in response to determining that there are at least two lanes having the same total number of lanes, a first candidate set of single task items corresponding to a maximum number of candidate stock items in each of the at least two lanes; and determining the sequence of at least two channels according to the sequence of the difference from small to large based on the difference between the maximum channel identifier and the minimum channel identifier corresponding to the single task item of the first candidate group.

In some embodiments, the seed lane selection subunit may be further configured to determine, in response to determining that there are at least two lanes with the same difference, a first candidate set of single task items corresponding to a maximum number of candidate stock items in each of the at least two lanes; the order of the at least two lanes is determined in an order of the number of pieces from large to small based on the number of pieces of the candidate stock removal indicated by the first candidate set of single task items.

In some embodiments, the target attribute is a bin attribute, wherein like items of the same gauge size have the same bin attribute identification.

It will be appreciated that the elements described in the task sheet generation device 500 correspond to the respective steps in the methods described with reference to fig. 1, 2 and 4. Thus, the operations, features and advantages described above with respect to the method are equally applicable to the task sheet generating device 500 and the units contained therein, and are not described herein again.

Referring now to fig. 6, a schematic diagram of an electronic device 600 (e.g., a server) suitable for use in implementing some embodiments of the present disclosure is shown. The electronic device shown in fig. 6 is merely an example and should not impose any limitations on the functionality and scope of use of embodiments of the present disclosure.

As shown in fig. 6, the electronic device 600 may include a processing means 601 (e.g., a central processor, a graphics processor, etc.) that may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 602 or a program loaded from a storage means 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the electronic apparatus 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other through a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.

In general, the following devices may be connected to the I/O interface 605: input devices 606 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, and the like; output devices 607 including, for example, speakers, vibrators, etc.; storage 608 including, for example, magnetic tape, hard disk, etc.; and a communication device 609. The communication means 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. While fig. 6 shows an electronic device 600 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead. Each block shown in fig. 6 may represent one device or a plurality of devices as needed.

In particular, according to some embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such embodiments, the computer program may be downloaded and installed from a network via communications device 609, or from storage device 608, or from ROM 602. The above-described functions defined in the methods of some embodiments of the present disclosure are performed when the computer program is executed by the processing device 601.

It should be noted that, the computer readable medium described in some embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In some embodiments of the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, however, the computer-readable signal medium may comprise a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.

In some implementations, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.

The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: determining whether the offer-back task contains specified information or not in response to receiving the offer-back task, wherein the specified information is used for representing that the offer-back article is delivered according to the target attribute; responding to the determination that the specified information is contained, and grouping the various articles for withdrawal in the same inventory area according to the target attribute of the various articles for withdrawal to obtain a plurality of task items, wherein each target attribute corresponds to one task item; for each of the plurality of task items, a task sheet corresponding to the offer-back task is generated based on inventory information of the offer-back item indicated by the task item.

Furthermore, computer program code for carrying out operations of some embodiments of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units described in some embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. The described units may also be provided in a processor, for example, described as: a processor includes an information determination unit, a grouping unit, and a generation unit. The names of these units do not constitute a limitation on the unit itself in some cases, and for example, the information determination unit may also be described as "a unit that determines whether or not specified information is included in the decommissioning task".

The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.

Some embodiments of the present disclosure also provide a computer program product comprising a computer program which, when executed by a processor, implements any of the task sheet generation methods described above.

The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above technical features, but encompasses other technical features formed by any combination of the above technical features or their equivalents without departing from the spirit of the invention. Such as the above-described features, are mutually substituted with (but not limited to) the features having similar functions disclosed in the embodiments of the present disclosure.

Claims (15)

1. A task list generation method comprises the following steps:

determining whether the offer-back task contains specified information or not in response to receiving the offer-back task, wherein the specified information is used for representing the offer-back article to be delivered according to the target attribute;

responding to the determination that the specified information is contained, and grouping the various back-supplied articles in the same inventory area according to the target attribute of the various back-supplied articles to obtain a plurality of task items, wherein each target attribute corresponds to one task item;

for each task item in the plurality of task items, generating a task list corresponding to the offer-back task based on inventory information of the offer-back items indicated by the task item.

2. The method of claim 1, wherein the generating a task sheet corresponding to the decommissioning task based on inventory information of decommissioning items in the task item comprises:

determining whether inventory information of the back-off items indicated by the task item meets a first back-off condition of the back-off task;

in response to determining that the first decompensation condition is met, a single task sheet for the task item is generated.

3. The method of claim 2, wherein the generating a task sheet corresponding to the decommissioning task based on inventory information of decommissioning items in the task item further comprises:

In response to determining that the first decompensation condition is not satisfied, the task item is determined to be a candidate group list task item.

4. A method according to claim 3, wherein the method further comprises:

responsive to determining that a plurality of candidate group single task items exist, determining a channel in which each candidate item is located according to the inventory position of each candidate item, wherein the candidate item is indicated by the candidate group single task item;

and combining the plurality of candidate group list task items based on the inventory information of each candidate offer item and the channel where each candidate offer item is located, and generating a cross-item task list.

5. The method of claim 4, wherein the combining the plurality of candidate group order task items based on inventory information of each candidate offer item, a channel of the candidate offer item, and generating a cross-item task order comprises:

selecting a seed channel from all channels based on inventory information and channels of all candidate offer-back articles;

selecting seed task items from the candidate stock withdrawal items in the seed channel and the corresponding candidate group single task items;

determining a target task item according to a channel identification range of a channel in which the candidate offer item indicated by the seed task item is located, wherein the target task item is a candidate group single task item in the plurality of candidate group single task items except the seed task item, and the corresponding channel identification is positioned in the channel identification range;

And generating a cross-item task list based on the seed task item and the target task item.

6. The method of claim 5, wherein the generating a cross-item task sheet based on the seed task item and the target task item comprises:

determining whether inventory information of candidate offer-back items indicated by the seed task item and the target task item meets a second offer-back condition of the offer-back task;

in response to determining that the second decompensation condition is not met, expanding a channel identification range corresponding to the seed task item according to a preset value;

and determining a new target task item according to the extended channel identification range until the inventory information meets the second outage condition or the extended channel identification range reaches a maximum channel identification range, wherein the maximum channel identification range is a channel identification range formed by the plurality of candidate group single task items, corresponding to the maximum channel identification and the minimum channel identification.

7. The method of claim 6, wherein the generating a cross-item task sheet based on the seed task item and the target task item comprises:

in response to determining that the second decompensation condition is met, generating a cross-item task sheet including the seed task item and the target task item, and removing the seed task item and the target task item from the plurality of candidate group single task items.

8. The method of claim 5, wherein selecting a seed lane from each lane based on inventory information of each candidate offer, a lane in which each candidate offer is located, comprises:

counting the total number of the candidate back-feeding articles in each channel in which the candidate back-feeding articles are positioned;

and selecting the channel with the largest total number from the channels as a seed channel according to the order of the total number from large to small.

9. The method of claim 8, wherein selecting the channel with the largest total number from the channels as the seed channel in the order of the largest total number comprises:

in response to determining that at least two channels with the same total number exist, determining a first candidate group single task item corresponding to a maximum number of candidate for-supply items in each of the at least two channels;

and determining the sequence of at least two channels according to the sequence from small difference to large difference based on the difference between the maximum channel identifier and the minimum channel identifier corresponding to the single task item of the first candidate group.

10. The method of claim 9, wherein the selecting, from the channels, the channel with the largest total number as the seed channel in the order of the largest total number, further comprises:

In response to determining that at least two channels with the same difference exist, determining a first candidate group single task item corresponding to the largest number of candidate for-supply items in each channel of the at least two channels;

and determining the sequence of at least two channels according to the sequence from the large number to the small number based on the number of the candidate back-off items indicated by the first candidate group single task item.

11. The method of one of claims 1 to 10, wherein the target property is a bin property, wherein like items of the same gauge size have the same bin property identification.

12. A task sheet generating device comprising:

the information determining unit is configured to determine whether the offer-back task contains specified information or not in response to receiving the offer-back task, wherein the specified information is used for representing the offer-back article to be delivered according to the target attribute;

the grouping unit is configured to group the articles for withdrawal in the same inventory area according to the target attribute of the articles for withdrawal in response to the determination that the specified information is contained, so as to obtain a plurality of task items, wherein each target attribute corresponds to one task item;

and a generation unit configured to generate, for each of the plurality of task items, a task sheet corresponding to the offer-back task based on inventory information of the offer-back article indicated by the task item.

13. An electronic device, comprising:

a storage device having one or more programs stored thereon,

when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-11.

14. A computer readable medium having stored thereon a computer program, wherein the computer program, when executed by a processor, implements the method of any of claims 1-11.

15. A computer program product comprising a computer program which, when executed by a processor, implements the method according to any of claims 1-11.