CN113822509B - Method and device for grouping sheets - Google Patents

Method and device for grouping sheets Download PDF

Info

Publication number
CN113822509B
CN113822509B CN202011240368.7A CN202011240368A CN113822509B CN 113822509 B CN113822509 B CN 113822509B CN 202011240368 A CN202011240368 A CN 202011240368A CN 113822509 B CN113822509 B CN 113822509B
Authority
CN
China
Prior art keywords
list
group
value
task
subtask
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011240368.7A
Other languages
Chinese (zh)
Other versions
CN113822509A (en
Inventor
陈辉宗
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jingdong Zhenshi Information Technology Co Ltd
Original Assignee
Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jingdong Zhenshi Information Technology Co Ltd filed Critical Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority to CN202011240368.7A priority Critical patent/CN113822509B/en
Publication of CN113822509A publication Critical patent/CN113822509A/en
Application granted granted Critical
Publication of CN113822509B publication Critical patent/CN113822509B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation; Time management
    • G06Q10/101—Collaborative creation, e.g. joint development of products or services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635—Processing of requisition or of purchase orders

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Finance (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Accounting & Taxation (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Data Mining & Analysis (AREA)

Abstract

The invention discloses a method and a device for grouping sheets, and relates to the technical field of computers. One embodiment of the method comprises the following steps: receiving a group list instruction, wherein the group list instruction comprises group list parameters and group list parameter limit values; acquiring a group list parameter value corresponding to each subtask list; for the first sub-task list set with the group list parameter value not larger than the group list parameter limit value, carrying out group list according to the group list parameter value and the group list parameter limit value corresponding to each first sub-task list; and for each second subtask list in the second subtask list set with the group list parameter value larger than the group list parameter limit value, acquiring the group list parameter value of the storage bit corresponding to the second subtask list, and carrying out group list according to the group list parameter value of the storage bit and the group list parameter limit value. The embodiment realizes that the goods can be checked and accepted according to money when the goods are finally received in a store. The optimal goods picking efficiency is ensured, the operation time is shortened, the operation efficiency is improved, and the aim of enabling clothing goods to quickly turn around is fulfilled.

Description

Method and device for grouping sheets
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method and an apparatus for grouping sheets.
Background
In the apparel industry, there are various types of orders, and warehouse management systems are required to support diverse functions. For a B2B (Business-to-Business, which refers to a Business model of conducting a transaction activity between businesses), the store receiving requirements are checked and accepted according to the money, which requires the warehouse management system to perform a money-based group order, i.e., the same money of articles under an order can be placed in the same picking task list. At present, warehouse management systems on the market have no function of grouping according to money, namely, the system combines single or multiple orders according to money into different order picking task sheets according to a certain rule.
In the process of implementing the present invention, the inventor finds that at least the following problems exist in the prior art:
the store hopes to receive goods according to the money, the warehouse needs to be packaged and shipped according to the money, and in the face of a large number of clothing orders, if the orders are removed according to the dimension of the orders, after goods are picked and rechecked, the goods need to be manually packaged according to the money, so that the operation efficiency is greatly influenced.
Disclosure of Invention
In view of the above, the embodiment of the invention provides a method and a device for grouping orders, which adds a policy according to the money grouping when a task of a warehouse management system distributes link orders, can group orders into different order picking tasks according to money, and is convenient for checking and packing according to money after picking, thereby realizing that the goods can be checked and accepted according to money when finally being received in a store, ensuring optimal order picking efficiency, shortening operation time, improving operation efficiency and achieving the goal of quick turnover.
To achieve the above object, according to one aspect of an embodiment of the present invention, there is provided a group singulation method.
A method of singulating, comprising: receiving a group list instruction, wherein the group list instruction comprises a group list parameter and a group list parameter limit value; acquiring a group list parameter value corresponding to each subtask list; for the first sub-task list set with the group list parameter value not larger than the group list parameter limit value, carrying out group list according to the group list parameter value corresponding to each first sub-task list and the group list parameter limit value; and for each second subtask list in the second subtask list set with the group list parameter value larger than the group list parameter limit value, acquiring the group list parameter value of the storage bit corresponding to the second subtask list, and carrying out group list according to the group list parameter value of the storage bit and the group list parameter limit value.
Optionally, performing group list according to the group list parameter value corresponding to each first subtask list and the group list parameter limit value includes: the first maximum value is taken out from the group list parameter value corresponding to each first subtask list; taking out group list parameter values from group list parameter values corresponding to a first sub-task list left after taking out a first maximum value one by one according to the sequence from small to large, and accumulating and summing the taken out group list parameter values and the first maximum value to obtain a first sum value until the first sum value is larger than the group list parameter limit value; combining the first subtask list except the first subtask list corresponding to the finally extracted group list parameter value in the first subtask list corresponding to the first sum value into a task list; deleting the first subtask list combined into the task list from the first subtask list set to update the first subtask list set, and repeatedly executing the steps until each first subtask list is combined into the task list.
Optionally, performing group list according to the group list parameter value corresponding to each first subtask list and the group list parameter limit value includes: first sorting is carried out according to the group list parameter values corresponding to each first subtask list from big to small; taking out a first maximum value and a first minimum value from the first sequencing result, summing to obtain a second sum value, updating the first sequencing result, and then executing judgment according to the second sum value; if the second sum value is larger than the group list parameter limit value, taking the first sub-task list corresponding to the first maximum value as a combined task list; if the second sum value is not greater than the group list parameter limit value, the group list parameter values are taken out from the updated first sorting result one by one according to the sequence from small to large, each group list parameter value is taken out, the taken out group list parameter values and the second sum value are accumulated and summed to obtain a third sum value, until the third sum value is greater than the group list parameter limit value, and the first sub-task list except the first sub-task list corresponding to the finally taken out group list parameter value is combined into a task list; deleting the first subtask list combined into the task list from the first subtask list set to update the first subtask list set, and repeatedly executing the steps until each first subtask list is combined into the task list.
Optionally, grouping according to the group list parameter value corresponding to the storage bit and the group list parameter limit value comprises: taking out a second maximum value from the group single parameter values corresponding to each storage bit; taking out the group single parameter values from the group single parameter values which remain after taking out the second maximum value one by one according to the sequence from small to large, and accumulating and summing the taken out group single parameter values and the second maximum value to obtain a fourth sum value until the fourth sum value is larger than the group single parameter limit value; combining the order picking tasks of the storage positions except for the storage position corresponding to the finally extracted group list parameter value in the storage positions corresponding to the fourth sum value into a task list; deleting the storage bit corresponding to the order picking task combined into the task list from the storage bit corresponding to the second subtask list to update the storage bit corresponding to the second subtask list, and repeatedly executing the steps until the order picking task of each storage bit is combined into the task list.
Optionally, grouping according to the group list parameter value corresponding to the storage bit and the group list parameter limit value comprises: performing second sorting according to the group single parameter values corresponding to each storage bit from big to small; taking out a second maximum value and a second minimum value from the second sorting result, summing to obtain a fifth sum value, updating the second sorting result, and then executing judgment according to the fifth sum value; if the fifth sum value is larger than the group list parameter limit value, combining the order picking task of the storage position corresponding to the second maximum value into a task list; if the fifth sum value is not greater than the group order parameter limit value, group order parameter values are taken out from the updated second sorting result one by one according to the order from small to large, each group order parameter value is taken out, the taken out group order parameter values and the fifth sum value are accumulated and summed to obtain a sixth sum value, and the order picking tasks of the storage positions except for the storage position corresponding to the finally taken group order parameter value are combined into a task list until the sixth sum value is greater than the group order parameter limit value; deleting the storage bit corresponding to the order picking task combined into the task list from the storage bit corresponding to the second subtask list to update the storage bit corresponding to the second subtask list, and repeatedly executing the steps until the order picking task of each storage bit is combined into the task list.
Optionally, before the grouping according to the stored group list parameter value and the group list parameter limit value, the method further comprises: judging whether the group single parameter value of the storage bit is larger than the group single parameter limit value, and if so, adjusting the group single parameter limit value.
Optionally, the group list parameter includes: commodity volume, commodity weight, and commodity number; and each subtask list corresponds to a task of a commodity.
According to another aspect of an embodiment of the present invention, a group bill apparatus is provided.
A group singulation apparatus comprising: the instruction receiving module is used for receiving a group list instruction, wherein the group list instruction comprises group list parameters and group list parameter limit values; the parameter acquisition module is used for acquiring a group list parameter value corresponding to each subtask list; the first group list module is used for carrying out group list according to the group list parameter value corresponding to each first subtask list and the group list parameter limit value for the first subtask list set with the group list parameter value not larger than the group list parameter limit value; and the second group list module is used for acquiring the group list parameter value of the storage bit corresponding to each second subtask list in the second subtask list set with the group list parameter value larger than the group list parameter limit value, and carrying out group list according to the group list parameter value of the storage bit and the group list parameter limit value.
Optionally, the first set of single modules is further configured to: the first maximum value is taken out from the group list parameter value corresponding to each first subtask list; taking out group list parameter values from group list parameter values corresponding to a first sub-task list left after taking out a first maximum value one by one according to the sequence from small to large, and accumulating and summing the taken out group list parameter values and the first maximum value to obtain a first sum value until the first sum value is larger than the group list parameter limit value; combining the first subtask list except the first subtask list corresponding to the finally extracted group list parameter value in the first subtask list corresponding to the first sum value into a task list; deleting the first subtask list combined into the task list from the first subtask list set to update the first subtask list set, and repeatedly executing the steps until each first subtask list is combined into the task list.
Optionally, the first set of single modules is further configured to: first sorting is carried out according to the group list parameter values corresponding to each first subtask list from big to small; taking out a first maximum value and a first minimum value from the first sequencing result, summing to obtain a second sum value, updating the first sequencing result, and then executing judgment according to the second sum value; if the second sum value is larger than the group list parameter limit value, taking the first sub-task list corresponding to the first maximum value as a combined task list; if the second sum value is not greater than the group list parameter limit value, the group list parameter values are taken out from the updated first sorting result one by one according to the sequence from small to large, each group list parameter value is taken out, the taken out group list parameter values and the second sum value are accumulated and summed to obtain a third sum value, until the third sum value is greater than the group list parameter limit value, and the first sub-task list except the first sub-task list corresponding to the finally taken out group list parameter value is combined into a task list; deleting the first subtask list combined into the task list from the first subtask list set to update the first subtask list set, and repeatedly executing the steps until each first subtask list is combined into the task list.
Optionally, the second set of single modules is further configured to: taking out a second maximum value from the group single parameter values corresponding to each storage bit; taking out the group single parameter values from the group single parameter values which remain after taking out the second maximum value one by one according to the sequence from small to large, and accumulating and summing the taken out group single parameter values and the second maximum value to obtain a fourth sum value until the fourth sum value is larger than the group single parameter limit value; combining the order picking tasks of the storage positions except for the storage position corresponding to the finally extracted group list parameter value in the storage positions corresponding to the fourth sum value into a task list; deleting the storage bit corresponding to the order picking task combined into the task list from the storage bit corresponding to the second subtask list to update the storage bit corresponding to the second subtask list, and repeatedly executing the steps until the order picking task of each storage bit is combined into the task list.
Optionally, the second set of single modules is further configured to: performing second sorting according to the group single parameter values corresponding to each storage bit from big to small; taking out a second maximum value and a second minimum value from the second sorting result, summing to obtain a fifth sum value, updating the second sorting result, and then executing judgment according to the fifth sum value; if the fifth sum value is larger than the group list parameter limit value, combining the order picking task of the storage position corresponding to the second maximum value into a task list; if the fifth sum value is not greater than the group order parameter limit value, group order parameter values are taken out from the updated second sorting result one by one according to the order from small to large, each group order parameter value is taken out, the taken out group order parameter values and the fifth sum value are accumulated and summed to obtain a sixth sum value, and the order picking tasks of the storage positions except for the storage position corresponding to the finally taken group order parameter value are combined into a task list until the sixth sum value is greater than the group order parameter limit value; deleting the storage bit corresponding to the order picking task combined into the task list from the storage bit corresponding to the second subtask list to update the storage bit corresponding to the second subtask list, and repeatedly executing the steps until the order picking task of each storage bit is combined into the task list.
Optionally, the apparatus further comprises a parameter limit adjustment module for: before grouping according to the group list parameter value of the storage bit and the group list parameter limit value, judging whether the group list parameter value of the storage bit is larger than the group list parameter limit value, and if so, adjusting the group list parameter limit value.
Optionally, the group list parameter includes: commodity volume, commodity weight, and commodity number; and each subtask list corresponds to a task of a commodity.
According to yet another aspect of an embodiment of the present invention, a group list electronic device is provided.
A group-singulated electronic device, comprising: one or more processors; and the storage device is used 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 are enabled to realize the group list method provided by the embodiment of the invention.
According to yet another aspect of an embodiment of the present invention, a computer-readable medium is provided.
A computer readable medium having stored thereon a computer program which when executed by a processor implements a group ordering method provided by an embodiment of the invention.
One embodiment of the above invention has the following advantages or benefits: by receiving a group order instruction, the group order instruction comprises a group order parameter and a group order parameter limit value; acquiring a group list parameter value corresponding to each subtask list; for the first sub-task list set with the group list parameter value not larger than the group list parameter limit value, carrying out group list according to the group list parameter value and the group list parameter limit value corresponding to each first sub-task list; for each second subtask list in the second subtask list set with the group list parameter value larger than the group list parameter limit value, the group list parameter value of the storage position corresponding to the second subtask list is obtained, and the group list is carried out according to the group list parameter value of the storage position and the group list parameter limit value.
Further effects of the above-described non-conventional alternatives are described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic diagram of the main steps of a singulation method in accordance with an embodiment of the present invention;
FIG. 2 is a schematic diagram of a first sub-task sheet one-time singulation process of a singulation method in accordance with an embodiment of the present invention;
FIG. 3 is a schematic diagram of a first sub-task sheet secondary grouping process of a grouping method in accordance with an embodiment of the invention;
FIG. 4 is a schematic diagram of a first sub-task sheet three-time sheet grouping process of a sheet grouping method in accordance with an embodiment of the invention;
FIG. 5 is a schematic diagram of a second sub-task sheet one-time singulation process of a singulation method in accordance with an embodiment of the present invention;
FIG. 6 is a schematic diagram of a second sub-task sheet secondary grouping process of a grouping method in accordance with an embodiment of the invention;
FIG. 7 is a schematic diagram of a second sub-task sheet three-time singulation process of a singulation method in accordance with an embodiment of the present invention;
FIG. 8 is a schematic diagram of the main modules of a group singulation apparatus in accordance with an embodiment of the present invention;
FIG. 9 is an exemplary system architecture diagram in which embodiments of the present invention may be applied;
Fig. 10 is a schematic diagram of a computer system for implementing a terminal device or a server according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present invention are included to facilitate understanding, and are to be considered merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
In the apparel industry, there are often B2B orders from large bins to stores. When operating both B2C orders and B2B orders in one warehouse, it is necessary for the warehouse management system to support diversified functions. The clothing orders (such as clothing, accessories, bags and the like) of the B2B have remarkable characteristics: the stock keeping units (Stock keeping Unit) are more in sku, more in number and high in order aging requirement, and the order needs to be packaged according to money when packaged, so that the order can be checked and accepted according to money when received by a store. Boxing according to money is a special operation requirement of the clothing industry. The relation between money and sku is as follows, for example, a shoe is named as "summer net face heightening thick bottom male money", but only the "money" is not used for uniquely determining a pair of shoes, and when the "red and white" and the "41 codes" are added, the sole of a pair of shoes can be uniquely determined. Therefore, a combination of 3 elements, namely money, color and code, can determine a sku. Thus, a money corresponds to multiple skus, and a single sku can only correspond to a single money.
In order to enable an operator to box according to money when the operator boxes, the operator needs to request for 'order picking according to money' on an upstream ring node of the warehouse management system, and the operator needs to request for 'order picking according to money' to necessarily request for 'order grouping' so that the warehouse management system can place the same item under one order under the same order picking task list (simply called 'task list'), and the sub task list corresponds to the order of one commodity. The reason for separating the items of an order into different task orders is that the B2B orders of the clothing industry have more skus and more pieces, if placed in one task order, a picking frame (or a picking trolley) of a person may not be placed, so that a plurality of persons are required to pick according to the multiple task orders, and the efficiency can be improved. In addition, if there are the same money in multiple orders, the system can combine multiple orders into one aggregate sheet, which is then split into different task sheets by the system according to various rules. As shown in table 1 below, the correspondence between orders, aggregate sheets, money numbers, job sheets, and the like is shown. There are 6 orders (involving 8 skus, 5 money numbers) placed on one aggregate list JHD1, which is then split into 4 task lists. The task list is assembled according to the money, and as shown in table 1, the subtask list corresponding to the money number KH1 is composed of the picking task corresponding to the money number KH1 in the order 1 and the picking task corresponding to the money number KH1 in the order 4. Of course, 1 order may be simply processed by 1 aggregate sheet, and then split into different task sheets by the system according to various rules.
TABLE 1
In the description of the embodiments of the present invention, the technical terms involved are as follows:
order form: i.e., sales orders, instructions for ex-warehouse in a warehouse management system;
collection sheet: summarizing single or multiple orders with commonalities (such as the same sku) together to form a aggregate sheet;
task sheet: warehouse pickers are used to refer to a task detail of picking;
subtask sheet: each subtask list corresponds to a task of a commodity;
sku: a number in the warehouse for uniquely identifying an item;
money number: the clothing industry is used for describing one dimension of the characteristics of the articles, and a plurality of colors can be distinguished under one money number, and a plurality of sizes can be distinguished;
storing: the minimum space unit is used for storing articles in the warehouse management system, and each storage position is provided with a corresponding number;
number of positioning: the number of the orders positioned on the storage positions is not greater than the total number of the storage positions;
the amount of the article: the number of the articles can be simply the number of the articles, the volume, the weight and the like.
The parameters involved are explained as follows:
V T : an upper limit of volume allowed in the task sheet;
W T : an upper limit on the weight allowed in the job ticket;
Q T : an upper limit on the number of pieces allowed in a job ticket;
sum (v_ KHi): summing all of the item volumes of the located cash number KHi;
sum (w_ KHi): summing all of the item weights of the located money numbers KHi;
sum (q_ KHi): summing all item numbers of the located money number KHi;
v_ KHi _m: the article corresponding to the money number KHi is positioned to a plurality of storage positions, and the volume corresponding to the positioned article in each storage position;
the relationship between money and a job ticket allowed by money packing (packing items of a job ticket into a box by default) includes:
the same article is placed in a task list, namely a single task;
the same article is placed in a plurality of task sheets, and only one article is placed in the plurality of task sheets, namely 'single article multitasking';
the articles of a plurality of money are placed in the same task list, but the money placed in the same task is not displayed in other tasks, namely a plurality of money list task;
items of multiple money are not allowed to be placed in multiple task sheets, namely, money a and money b are placed in a task sheet X, and meanwhile, money b and money c are placed in a task sheet Y, namely, multiple-money multitasking is shortened, because an operator does not know that the items of the same money are still present in other task sheets when the operator is in a box, and a picking error can be caused. The combination of money and task sheets can be simplified as shown in table 2 below.
TABLE 2
Single pattern Multiple types
Single task √ √
Multitasking √ ×
In order to achieve the purpose that the goods can be checked and accepted according to the money when finally received in a store and the delivery efficiency of the warehouse can be improved, the invention provides a bill assembling method and device. Meanwhile, other limiting factors are considered, so that the optimal goods picking efficiency of the warehouse is ensured, the delivery speed of the warehouse is improved, and the characteristic of rapid turnover of clothing goods is met.
Fig. 1 is a schematic diagram of main steps of a grouping method according to an embodiment of the present invention, where a scene targeted by the embodiment of the present invention is a scene that a store such as a clothing industry requires acceptance according to money. In the embodiment of the invention, a policy of grouping according to the money is used, so that the warehouse order is subjected to grouping, picking and boxing according to the money under the condition of ensuring the efficiency, and the requirement that a final store can receive goods according to the money is met. As shown in fig. 1, the grouping method in the embodiment of the invention mainly includes the following steps S101 to S104.
Step S101: receiving a group list instruction, wherein the group list instruction comprises group list parameters and group list parameter limit values;
step S102: acquiring a group list parameter value corresponding to each subtask list;
step S103: for the first sub-task list set with the group list parameter value not larger than the group list parameter limit value, carrying out group list according to the group list parameter value and the group list parameter limit value corresponding to each first sub-task list;
step S104: and for each second subtask list in the second subtask list set with the group list parameter value larger than the group list parameter limit value, acquiring the group list parameter value of the storage bit corresponding to the second subtask list, and carrying out group list according to the group list parameter value of the storage bit and the group list parameter limit value.
According to the steps S101 to S104, when the group bill is required, 4 different service scenarios are abstracted for the relation between the money number and the task bill. And according to different relations between the total article quantity of a certain money number and the upper limit of the task list, adopting different dimensions to calculate the group list. According to the principle that the maximum article quantity is taken from the task list, the mode that the maximum value and the minimum value are matched in sequence is adopted for grouping the list, the group list algorithm can be parallel to other group list algorithms, the flexibility of a warehouse management system is not reduced, the goods are picked according to the money in a warehouse, the goods can be checked and accepted according to the money when the goods are received in a store, the goods picking efficiency is improved, and the rapid turnover of clothing goods is met.
According to one embodiment of the present invention, grouping according to the group list parameter value and the group list parameter limit value corresponding to each first subtask list includes: the first maximum value is taken out from the group list parameter value corresponding to each first subtask list; taking out group list parameter values from group list parameter values corresponding to the first subtask list left after taking out the first maximum value one by one according to the sequence from small to large, accumulating and summing the taken out group list parameter values and the first maximum value to obtain a first sum value until the first sum value is larger than a group list parameter limit value; combining the first subtask list except the first subtask list corresponding to the finally extracted group list parameter value in the first subtask list corresponding to the first sum value into a task list; deleting the first subtask list combined into the task list from the first subtask list set to update the first subtask list set, and repeatedly executing the steps until each first subtask list is combined into the task list.
According to another embodiment of the present invention, grouping according to the group list parameter value and the group list parameter limit value corresponding to each first subtask list further includes: first sorting is carried out according to the group list parameter values corresponding to each first subtask list from big to small; taking out the first maximum value and the first minimum value from the first sequencing result, summing to obtain a second sum value, updating the first sequencing result, and then executing judgment according to the second sum value; if the second sum value is larger than the group list parameter limit value, taking the first sub-task list corresponding to the first maximum value as a combined task list; if the second sum value is not greater than the group list parameter limit value, the group list parameter values are taken out from the updated first sorting result one by one according to the order from small to large, each group list parameter value is taken out, the taken out group list parameter values and the second sum value are accumulated and summed to obtain a third sum value, until the third sum value is greater than the group list parameter limit value, and the first sub-task list except the first sub-task list corresponding to the last taken out group list parameter value is combined into a task list; deleting the first subtask list combined into the task list from the first subtask list set to update the first subtask list set, and repeatedly executing the steps until each first subtask list is combined into the task list.
In an embodiment of the present invention, the group list parameters include: commodity volume, commodity weight, and commodity number; and each subtask list corresponds to a task of a commodity.
Factors influencing the upper limit of the task list, such as volume, weight, number of pieces, etc., are usually included, and clothing items are packed in boxes, and the volume factor is prioritized, so that the volume is taken as an example. According to the technical scheme of the invention, if one task list is combined, the number of the task lists is very large, some task lists have few articles, and the amount of the articles in the task list is unsaturated. The principle of taking the maximum amount of articles from a task list is adopted, so that the optimal picking efficiency is ensured. It is also ensured that one money number does not appear in a plurality of job tickets (a plurality of money numbers are allowed in one job ticket). At this time, the solution is carried out by matching and combining, and the judgment is based on the Sum Sum (V_ KHi) of the volumes of all the objects under the same type number and the upper limit V of the volumes of the objects of one task list T . When Sum (V_ KHi) is less than or equal to V T When the grouping process comprises the following steps:
1. assuming n credit numbers, the volumes of all items for each credit number are summed together, for a total of n Sum (V KHi), 0<i n. Sequentially ordering the n values Sum (v_ KHi) from large to small as Sum (v_kh1), sum (v_kh2), … …, sum (v_kh (n-1)), sum (v_ KHn);
2. It is determined whether the Sum of the volume maximum Sum (v_kh1) and the volume minimum Sum (v_ KHn) of the money numbers exceeds the maximum volume of the job ticket. Specifically:
if the task number exceeds the minimum volume, the task corresponding to the minimum volume money number is not combined with the task of the minimum volume money number, and a task list is formed, namely: if Sum (V_KH1) +Sum (V_ KHn)>V T The task corresponding to KH1 is the group single result ("single type single task");
if not, continuing to combine with the money number with the second smallest volume until the sum valueBeyond V T I.e. if Sum (V_KH1) +Sum (V_ KHn). Ltoreq.V T Continuing to determine whether Sum (V_KH1) +sum (V_ KHn) +sum (V_KH (n-1)) is less than V T Until Sum (V_KH1) +sum (V_ KHn) + … … +sum (V_KH (n-i+1)) +sum (V_KH (n-i))>V T At this time, the task group sheets corresponding to KH1, KHn, … … and KH (n-i+1) are selected ("multiple single task" type);
3. after the first task list is combined, continuously sequencing the volume values of the money numbers which are not combined yet from big to small, taking the remaining current maximum volume value, combining the remaining current maximum volume value with the remaining current minimum volume value, and judging whether the volume value exceeds V T . And the logic is the same as that of the above, and the tasks of all money numbers are sequentially circulated until the tasks are combined and singly completed.
FIG. 2 is a schematic diagram of a first sub-task sheet one-time grouping process of a grouping method according to an embodiment of the invention, as shown in FIG. 2, when Sum (V_ KHi) <V T When there are 11 total money numbers, the volume values of the commodity of the 11 money numbers are sorted from big to small to form V_KH1 to V_KH11. The Sum of the maximum volume value Sum (V_KH1) and the minimum volume value Sum (V_KH11) exceeds V for subgroup 1 T At this time, the first subtask list corresponding to the money number KH1 is combined into a task list, i.e. a "single money list task" type.
FIG. 3 is a schematic diagram of a first sub-task single two-shot process of the group list method according to an embodiment of the present invention, as shown in FIG. 3, when the second group list is performed, sum (V_KH2) +Sum (V_KH11) +Sum (V_KH10) +Sum (V_KH9)>V T The 3 first sub-task orders corresponding to the pattern numbers KH2, KH11 and KH10 may form one task order, i.e. a "multiple-pattern task" type.
FIG. 4 is a schematic diagram of a first sub-task list three times group list process of the group list method according to an embodiment of the present invention, as shown in FIG. 4, when the third group list is performed, sum (V_KH3) +Sum (V_KH9) +Sum (V_KH8)>V T The 2 first sub-task sheets corresponding to the money numbers KH3 and KH9 may form one task sheet, i.e. "multi-money single task" type.
According to one embodiment of the present invention, performing group bill according to the group bill parameter value and the group bill parameter limit value corresponding to the storage bit includes: taking out a second maximum value from the group single parameter values corresponding to each storage bit; taking out the group single parameter values from the group single parameter values which remain after the second maximum value is taken out one by one according to the sequence from small to large, and accumulating and summing the taken out group single parameter values and the second maximum value to obtain a fourth sum value every time when the fourth sum value is larger than the group single parameter limit value; combining the order picking tasks of the storage positions except for the storage position corresponding to the finally-taken group list parameter value in the fourth storage position corresponding to the value into a task list; deleting the storage bit corresponding to the order picking task combined into the task list from the storage bit corresponding to the second subtask list to update the storage bit corresponding to the second subtask list, and repeating the steps until the order picking task of each storage bit is combined into the task list.
In an embodiment of the present invention, performing group bill according to the group bill parameter value and the group bill parameter limit value corresponding to the storage location further includes: performing second sorting according to the group single parameter values corresponding to each storage bit from big to small; taking out the second maximum value and the second minimum value from the second sequencing result, summing to obtain a fifth sum value, updating the second sequencing result of the group list, and then executing judgment according to the fifth sum value of the group list; if the fifth sum of the group list is larger than the group list single parameter limit value, combining the order picking task of the storage position corresponding to the second maximum value of the group list into a task list; if the fifth sum value of the group list is not larger than the limit value of the group list single parameter, the group list parameter values are taken out from the updated second sorting result one by one according to the sequence from small to large, each group list parameter value is taken out, the taken out group list parameter values and the fifth sum value of the group list are accumulated and summed to obtain a sixth sum value, until the sixth sum value of the group list is larger than the limit value of the group list single parameter, and the order picking tasks of the storage positions except the storage position corresponding to the finally taken group list parameter value are combined into a task list; deleting the storage bit corresponding to the order picking task combined into the task list from the storage bit corresponding to the second subtask list of the group list to update the storage bit corresponding to the second subtask list of the group list, and repeating the steps until the order picking task of each storage bit is combined into the task list.
According to still another embodiment of the present invention, before the grouping according to the group list parameter value and the group list parameter limit value of the storage location, the method further includes: and judging whether the group single parameter value of the storage bit is larger than the group single parameter limit value, and if so, adjusting the group single parameter limit value.
When Sum (V_ KHi)>V T When the total volume of the articles of a money number exceeds the upper volume limit V of the task list T One job ticket cannot complete the picking (putting down) of all the items of the money, and the picking job of the items of the money has to be split into job tickets. Likewise, the principle of taking the maximum amount of articles from one task list is adopted, so that the optimal picking efficiency is ensured, and the fewer split task lists are, the better. At this time, one money number may be divided into a plurality of task sheets, but a plurality of money numbers are not allowed to enter into a plurality of tasks. At this time, the solution is continuously carried out by adopting a collocation combination mode, but the basis of judgment is changed into the volume value of each positioning detail below the money number, and the group list process comprises the following steps:
1. the article corresponding to the money number KHi is positioned to obtain the volume V_ KHi _m of the articles placed on n storage positions, the volume V_ KHi _m is 0<m is less than or equal to n, and the n volume values are sequenced from large to small: v_ KHi _1, v_khi_2, … …, v_ KHi _ (n-1), v_ KHi _n;
2. Determining whether the sum of the maximum value V_ KHi _1 and the minimum value V_ KHi _n exceeds V T If the order is exceeded, the order picking task of the storage position corresponding to the current maximum value is not combined with the minimum value any more, and a task list is formed. I.e. if V_ KHi _1+V_KHi_n>V T The pick job for the storage location corresponding to v_ KHi _1 constitutes a job ticket ("single multitask" type). It should be noted that the maximum value v_ KHi _1>V T Will not be present in actual operating situations. Because the total volume of the commodities positioned on one storage position exceeds the upper limit of the volume of the task list, namely, the pickers cannot finish picking of one storage position by using one task, and the upper limit of the volume of the task list needs to be enlarged at the moment;
3. if not exceed V T Then continue to combine with the next smallest volume of money number until V is exceeded T I.e. if V_ KHi _1+V_KHi_n.ltoreq.V T Then continue to judge whether V_ KHi _1+V_KHi_n+V_KHi_ (n-1) is smaller than V T Until V_ KHi _1+V_KHi_n+ … … +V_ KHi _ (n-m+1) +V_ KHi _ (n-m)>V T V_ KHi _1, V/u at this timeThe order picking task combination of the storage positions corresponding to KHi _n, … … and V_ KHi _ (n-m+1) is a task list (single multitask type);
4. after the first task list combination, continuing to sort the volume values of the articles placed on the remaining storage positions of the money number from large to small, taking the combination of the remaining current maximum volume value and the remaining current minimum volume value, and judging whether the volume value exceeds V T . And the logic is the same as that of the logic, and the process is circularly executed until the order picking task of the articles placed on all the storage positions is completed.
Fig. 5 is a schematic diagram of a second sub-task sheet single grouping process of the grouping method according to an embodiment of the present invention, as shown in fig. 5, when there are 9 positioning details (i.e., storage positions) related to the money number KHi, the volume values of the articles placed on the 9 storage positions are sorted from large to small to form v_ KHi _1 to v_ KHi _9. The sum of the maximum volume value V_ KHi _1 and the minimum volume value V_ KHi _9 exceeds V for subgroup 1 T The pick task of the storage corresponding to v_ KHi _1 is individually formed into a task sheet ("single multitask" type).
FIG. 6 is a schematic diagram of a second sub-task single secondary group list process of the group list method according to an embodiment of the invention, as shown in FIG. 6, V_ KHi _2+V_KHi_9+V_KHi_8>V T The order picking tasks of the storage locations where v_ KHi _2 and v_ KHi _9 are located form a task sheet ("single multitask" type).
FIG. 7 is a schematic diagram of a second sub-task list three-time list process of the list method according to an embodiment of the present invention, as shown in FIG. 7, V_ KHi _3+V_KHi_8>V T The pick task of the storage location where v_ KHi _3 is located constitutes a single task sheet (the "single multitask" type) alone.
Fig. 8 is a schematic block diagram of an apparatus for intercepting a mobile terminal request according to an embodiment of the present invention, and as shown in fig. 8, a group list apparatus 800 according to an embodiment of the present invention mainly includes an instruction receiving module 801, a parameter obtaining module 802, a first group list module 803, and a second group list module 804.
The instruction receiving module 801 is configured to receive a group list instruction, where the group list instruction includes a group list parameter and a group list parameter limit value;
a parameter obtaining module 802, configured to obtain a group list parameter value corresponding to each subtask list;
a first grouping module 803, configured to perform grouping on the first sub-task list sets with the grouping parameter values not greater than the grouping parameter limit value according to the grouping parameter values and the grouping parameter limit value corresponding to each first sub-task list;
the second group list module 804 is configured to, for each second subtask list in the second subtask list set with a group list parameter value greater than the group list parameter limit value, obtain a group list parameter value of a storage location corresponding to the second subtask list, and perform group list according to the group list parameter value of the storage location and the group list parameter limit value.
According to one embodiment of the invention, the first set of single modules 803 may also be used to: the first maximum value is taken out from the group list parameter value corresponding to each first subtask list; taking out group list parameter values from group list parameter values corresponding to a first sub-task list left after taking out a first maximum value one by one according to the sequence from small to large, and accumulating and summing the taken out group list parameter values and the first maximum value to obtain a first sum value until the first sum value is larger than the group list parameter limit value; combining the first subtask list except the first subtask list corresponding to the finally extracted group list parameter value in the first subtask list corresponding to the first sum value into a task list; deleting the first subtask list combined into the task list from the first subtask list set to update the first subtask list set, and repeatedly executing the steps until each first subtask list is combined into the task list.
According to another embodiment of the invention, the first set of single modules 803 may also be used to: first sorting is carried out according to the group list parameter values corresponding to each first subtask list from big to small; taking out the first maximum value and the first minimum value from the first sequencing result, summing to obtain a second sum value, updating the first sequencing result, and then executing judgment according to the second sum value; if the second sum is larger than the group list parameter limit value, taking the first sub-task list corresponding to the first maximum value as a combined task list; if the second sum value is not greater than the group list parameter limit value, the group list parameter values are taken out from the updated first sorting result one by one according to the order from small to large, each group list parameter value is taken out, the taken out group list parameter values and the second sum value are accumulated and summed to obtain a third sum value, until the third sum value is greater than the group list parameter limit value, and the first sub-task list except the first sub-task list corresponding to the last taken out group list parameter value is combined into a task list; deleting the first subtask list combined into the task list from the first subtask list set to update the first subtask list set, and repeatedly executing the steps until each first subtask list is combined into the task list.
According to yet another embodiment of the invention, the second set of single modules 804 may also be used to: taking out a second maximum value from the group single parameter values corresponding to each storage bit; taking out the group single parameter values from the group single parameter values which remain after the second maximum value is taken out one by one according to the sequence from small to large, and accumulating and summing the taken out group single parameter values and the second maximum value to obtain a fourth sum value every time when the fourth sum value is larger than the group single parameter limit value; combining the order picking tasks of the storage positions except for the storage position corresponding to the finally-taken group list parameter value in the fourth storage position corresponding to the value into a task list; deleting the storage bit corresponding to the order picking task combined into the task list from the storage bit corresponding to the second subtask list to update the storage bit corresponding to the second subtask list, and repeating the steps until the order picking task of each storage bit is combined into the task list.
According to yet another embodiment of the present invention, the second set of single modules 804 may also be used to: performing second sorting according to the group single parameter values corresponding to each storage bit from big to small; taking out the second maximum value and the second minimum value from the second sorting result, summing to obtain a fifth sum value, updating the second sorting result, and then executing judgment according to the fifth sum value; if the fifth sum value is larger than the group list parameter limit value, combining the order picking task of the storage position corresponding to the second maximum value into a task list; if the fifth sum value is not greater than the group order parameter limit value, the group order parameter values are taken out from the updated second sorting result one by one according to the order from small to large, each group order parameter value is taken out, the taken out group order parameter values and the fifth sum value are accumulated and summed to obtain a sixth sum value, and the order picking tasks of the storage positions except for the storage position corresponding to the last taken group order parameter value are combined into a task list until the sixth sum value is greater than the group order parameter limit value; deleting the storage bit corresponding to the order picking task combined into the task list from the storage bit corresponding to the second subtask list to update the storage bit corresponding to the second subtask list, and repeating the steps until the order picking task of each storage bit is combined into the task list.
In an embodiment of the present invention, the apparatus 800 further includes a parameter limit adjustment module (not shown in the figure) for: before grouping according to the group list parameter value of the storage bit and the group list parameter limit value, judging whether the group list parameter value of the storage bit is larger than the group list parameter limit value, and if so, adjusting the group list parameter limit value.
According to an embodiment of the invention, the set of single parameters comprises: commodity volume, commodity weight, and commodity number; and each subtask list corresponds to a task of a commodity.
Fig. 9 illustrates an exemplary system architecture 900 in which the group singulation method or group singulation device may be employed in accordance with embodiments of the present invention.
As shown in fig. 9, system architecture 900 may include terminal devices 901, 902, 903, a network 904, and a server 905. The network 904 is the medium used to provide communications links between the terminal devices 901, 902, 903 and the server 905. The network 904 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
A user may interact with the server 905 over the network 904 using the terminal devices 901, 902, 903 to receive or send messages, etc. Various client applications, such as a warehouse management class system, an e-commerce class application, an allocation combination class application, etc. (by way of example only) may be installed on the terminal devices 901, 902, 903.
Terminal devices 901, 902, 903 may be a variety of electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.
The server 905 may be a server providing various services, such as a background management server (by way of example only) providing support for warehouse management type websites browsed by users using the terminal devices 901, 902, 903. The background management server may analyze and process the received data such as the order instruction, and feed back the processing result (e.g., the allocated order form—only an example) to the terminal device.
It should be noted that, in the embodiment of the present invention, the grouping method is generally executed by the server 905, and accordingly, the grouping device is generally disposed in the server 905.
It should be understood that the number of terminal devices, networks and servers in fig. 9 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 10, there is illustrated a schematic diagram of a computer system 1000 suitable for use in implementing a terminal device or server in accordance with an embodiment of the present invention. The terminal device or server shown in fig. 10 is only an example, and should not impose any limitation on the functions and scope of use of the embodiments of the present invention.
As shown in fig. 10, the computer system 1000 includes a Central Processing Unit (CPU) 1001, which can execute various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 1002 or a program loaded from a storage section 1008 into a Random Access Memory (RAM) 1003. In the RAM 1003, various programs and data required for the operation of the system 1000 are also stored. The CPU 1001, ROM 1002, and RAM 1003 are connected to each other by a bus 1004. An input/output (I/O) interface 1005 is also connected to bus 1004.
The following components are connected to the I/O interface 1005: an input section 1006 including a keyboard, a mouse, and the like; an output portion 1007 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), etc., and a speaker, etc.; a storage portion 1008 including a hard disk or the like; and a communication section 1009 including a network interface card such as a LAN card, a modem, or the like. The communication section 1009 performs communication processing via a network such as the internet. The drive 1010 is also connected to the I/O interface 1005 as needed. A removable medium 1011, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is installed as needed in the drive 1010, so that a computer program read out therefrom is installed as needed in the storage section 1008.
In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, 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 an embodiment, the computer program may be downloaded and installed from a network via the communication portion 1009, and/or installed from the removable medium 1011. The above-described functions defined in the system of the present invention are performed when the computer program is executed by a Central Processing Unit (CPU) 1001.
The computer readable medium shown in the present invention 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 the context of this document, 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 the present invention, however, the computer-readable signal medium may include 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: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
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 invention. 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 method functions. 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 or flowchart illustration, and combinations of blocks in the block diagrams 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 or modules involved in the embodiments of the present invention may be implemented in software or in hardware. The described units or modules may also be provided in a processor, for example, as: a processor includes an instruction receiving module, a parameter acquisition module, a first set of single modules, a second set of single modules. Where the names of the units or modules do not in some way constitute a limitation of the unit or module itself, for example, the instruction receiving module may also be described as "a module for receiving group order instructions comprising group order parameters and group order parameter limits".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be present alone without being fitted into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to include: receiving a group list instruction, wherein the group list instruction comprises group list parameters and group list parameter limit values; acquiring a group list parameter value corresponding to each subtask list; for the first sub-task list set with the group list parameter value not larger than the group list parameter limit value, carrying out group list according to the group list parameter value and the group list parameter limit value corresponding to each first sub-task list; and for each second subtask list in the second subtask list set with the group list parameter value larger than the group list parameter limit value, acquiring the group list parameter value of the storage bit corresponding to the second subtask list, and carrying out group list according to the group list parameter value of the storage bit and the group list parameter limit value.
According to the technical scheme of the embodiment of the invention, the group list instruction is received, and comprises group list parameters and group list parameter limit values; acquiring a group list parameter value corresponding to each subtask list; for the first sub-task list set with the group list parameter value not larger than the group list parameter limit value, carrying out group list according to the group list parameter value and the group list parameter limit value corresponding to each first sub-task list; for each second subtask list in the second subtask list set with the group list parameter value larger than the group list parameter limit value, the group list parameter value of the storage position corresponding to the second subtask list is obtained, and the group list is carried out according to the group list parameter value of the storage position and the group list parameter limit value.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.

Claims (9)

1. A method of singulating, comprising:
receiving a group order instruction, wherein the group order instruction comprises a group order parameter and a group order parameter limit value, and the group order parameter comprises: commodity volume, commodity weight, and commodity number; and each subtask list corresponds to a task of a commodity;
acquiring a group list parameter value corresponding to each subtask list;
for the first sub-task list set with the group list parameter value not larger than the group list parameter limit value, carrying out group list according to the group list parameter value corresponding to each first sub-task list and the group list parameter limit value;
for each second subtask list in a second subtask list set with the group list parameter value larger than the group list parameter limit value, acquiring the group list parameter value of a storage bit corresponding to the second subtask list, and carrying out group list according to the group list parameter value of the storage bit and the group list parameter limit value;
Wherein, group list type includes: the subtask sheets of the same commodity are combined into one task sheet, the subtask sheets of the same commodity are combined into a plurality of task sheets, only the subtask sheets of the commodity in each task sheet, the subtask sheets of the commodity in a plurality of commodities are combined into one task sheet, and the subtask sheets of the commodity in a plurality of commodities are not found in other task sheets.
2. The method of claim 1, wherein grouping according to the group list parameter value and the group list parameter limit value corresponding to each first subtask list comprises:
the first maximum value is taken out from the group list parameter value corresponding to each first subtask list;
taking out group list parameter values from group list parameter values corresponding to a first sub-task list left after taking out a first maximum value one by one according to the sequence from small to large, and accumulating and summing the taken out group list parameter values and the first maximum value to obtain a first sum value until the first sum value is larger than the group list parameter limit value;
combining the first subtask list except the first subtask list corresponding to the finally extracted group list parameter value in the first subtask list corresponding to the first sum value into a task list;
Deleting the first subtask list combined into the task list from the first subtask list set to update the first subtask list set, and repeatedly executing the steps until each first subtask list is combined into the task list.
3. The method according to claim 1 or 2, wherein grouping according to the group list parameter value and the group list parameter limit value corresponding to each first subtask list comprises:
first sorting is carried out according to the group list parameter values corresponding to each first subtask list from big to small;
taking out a first maximum value and a first minimum value from the first sequencing result, summing to obtain a second sum value, updating the first sequencing result, and then executing judgment according to the second sum value;
if the second sum value is larger than the group list parameter limit value, taking the first sub-task list corresponding to the first maximum value as a combined task list;
if the second sum value is not greater than the group list parameter limit value, the group list parameter values are taken out from the updated first sorting result one by one according to the sequence from small to large, each group list parameter value is taken out, the taken out group list parameter values and the second sum value are accumulated and summed to obtain a third sum value, until the third sum value is greater than the group list parameter limit value, and the first sub-task list except the first sub-task list corresponding to the finally taken out group list parameter value is combined into a task list;
Deleting the first subtask list combined into the task list from the first subtask list set to update the first subtask list set, and repeatedly executing the steps until each first subtask list is combined into the task list.
4. The method of claim 1, wherein grouping according to the group list parameter value and the group list parameter limit corresponding to the storage location comprises:
taking out a second maximum value from the group single parameter values corresponding to each storage bit;
taking out the group single parameter values from the group single parameter values which remain after taking out the second maximum value one by one according to the sequence from small to large, and accumulating and summing the taken out group single parameter values and the second maximum value to obtain a fourth sum value until the fourth sum value is larger than the group single parameter limit value;
combining the order picking tasks of the storage positions except for the storage position corresponding to the finally extracted group list parameter value in the storage positions corresponding to the fourth sum value into a task list;
deleting the storage bit corresponding to the order picking task combined into the task list from the storage bit corresponding to the second subtask list to update the storage bit corresponding to the second subtask list, and repeatedly executing the steps until the order picking task of each storage bit is combined into the task list.
5. The method of claim 1 or 4, wherein grouping according to the group list parameter value corresponding to the storage location and the group list parameter limit value comprises:
performing second sorting according to the group single parameter values corresponding to each storage bit from big to small;
taking out a second maximum value and a second minimum value from the second sorting result, summing to obtain a fifth sum value, updating the second sorting result, and then executing judgment according to the fifth sum value;
if the fifth sum value is larger than the group list parameter limit value, combining the order picking task of the storage position corresponding to the second maximum value into a task list;
if the fifth sum value is not greater than the group order parameter limit value, group order parameter values are taken out from the updated second sorting result one by one according to the order from small to large, each group order parameter value is taken out, the taken out group order parameter values and the fifth sum value are accumulated and summed to obtain a sixth sum value, and the order picking tasks of the storage positions except for the storage position corresponding to the finally taken group order parameter value are combined into a task list until the sixth sum value is greater than the group order parameter limit value;
deleting the storage bit corresponding to the order picking task combined into the task list from the storage bit corresponding to the second subtask list to update the storage bit corresponding to the second subtask list, and repeatedly executing the steps until the order picking task of each storage bit is combined into the task list.
6. The method of claim 1, further comprising, prior to the grouping based on the stored group list parameter value and the group list parameter limit value:
judging whether the group single parameter value of the storage bit is larger than the group single parameter limit value, and if so, adjusting the group single parameter limit value.
7. A singulation apparatus, comprising:
the instruction receiving module is used for receiving a group list instruction, wherein the group list instruction comprises group list parameters and group list parameter limit values, and the group list parameters comprise: commodity volume, commodity weight, and commodity number; and each subtask list corresponds to a task of a commodity;
the parameter acquisition module is used for acquiring a group list parameter value corresponding to each subtask list;
the first group list module is used for carrying out group list according to the group list parameter value corresponding to each first subtask list and the group list parameter limit value for the first subtask list set with the group list parameter value not larger than the group list parameter limit value;
the second group list module is used for acquiring the group list parameter value of the storage bit corresponding to each second subtask list in a second subtask list set with the group list parameter value larger than the group list parameter limit value, and carrying out group list according to the group list parameter value of the storage bit and the group list parameter limit value; wherein, group list type includes: the subtask sheets of the same commodity are combined into one task sheet, the subtask sheets of the same commodity are combined into a plurality of task sheets, only the subtask sheets of the commodity in each task sheet, the subtask sheets of the commodity in a plurality of commodities are combined into one task sheet, and the subtask sheets of the commodity in a plurality of commodities are not found in other task sheets.
8. A group-wise electronic device, comprising:
one or more processors;
storage means for storing one or more programs,
when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-6.
9. A computer readable medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-6.
CN202011240368.7A 2020-11-09 2020-11-09 Method and device for grouping sheets Active CN113822509B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011240368.7A CN113822509B (en) 2020-11-09 2020-11-09 Method and device for grouping sheets

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011240368.7A CN113822509B (en) 2020-11-09 2020-11-09 Method and device for grouping sheets

Publications (2)

Publication Number Publication Date
CN113822509A CN113822509A (en) 2021-12-21
CN113822509B true CN113822509B (en) 2023-11-03

Family

ID=78924797

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011240368.7A Active CN113822509B (en) 2020-11-09 2020-11-09 Method and device for grouping sheets

Country Status (1)

Country Link
CN (1) CN113822509B (en)

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105469201A (en) * 2015-07-20 2016-04-06 浙江工业大学 Method for logistics dispensing center work task processing and scheduling
CN106956883A (en) * 2017-04-14 2017-07-18 北京极智嘉科技有限公司 Goods picking method, system, computing device and the storage medium of involving explosives money product
CN107944663A (en) * 2017-10-30 2018-04-20 浙江智尚实业有限公司广州分公司 A kind of on-line off-line synchronization process product deposits into the management method of pin
CN109726971A (en) * 2019-03-13 2019-05-07 广州南信信息科技有限公司 A kind of yarn picking stock preparation system and yarn picking are got ready the goods method
CN109754203A (en) * 2018-12-08 2019-05-14 武汉普罗格集成科技有限公司 A kind of Intelligent logistics LK algorithm combined method
CN109767151A (en) * 2017-11-09 2019-05-17 北京京东尚科信息技术有限公司 Storage management method, device, medium and electronic equipment
CN110070312A (en) * 2018-01-24 2019-07-30 北京京东尚科信息技术有限公司 Order processing method and apparatus
CA3100279A1 (en) * 2018-05-21 2019-11-28 Beijing Geekplus Technology Co., Ltd. Order processing method and device, server, and storage medium
CN110826960A (en) * 2019-10-14 2020-02-21 北京京东尚科信息技术有限公司 Order picking method, device, equipment and computer readable medium
CN110880057A (en) * 2018-09-05 2020-03-13 北京京东振世信息技术有限公司 Order combining method and device
CN111260270A (en) * 2018-12-03 2020-06-09 北京京东尚科信息技术有限公司 Method and device for improving order processing efficiency of store
CN111553548A (en) * 2019-02-12 2020-08-18 北京京东尚科信息技术有限公司 Goods picking method and device
US10817839B1 (en) * 2017-05-08 2020-10-27 Stamps.Com Inc. Systems and methods providing virtual distribution center inventory for localized fulfilment

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105469201A (en) * 2015-07-20 2016-04-06 浙江工业大学 Method for logistics dispensing center work task processing and scheduling
CN106956883A (en) * 2017-04-14 2017-07-18 北京极智嘉科技有限公司 Goods picking method, system, computing device and the storage medium of involving explosives money product
US10817839B1 (en) * 2017-05-08 2020-10-27 Stamps.Com Inc. Systems and methods providing virtual distribution center inventory for localized fulfilment
CN107944663A (en) * 2017-10-30 2018-04-20 浙江智尚实业有限公司广州分公司 A kind of on-line off-line synchronization process product deposits into the management method of pin
CN109767151A (en) * 2017-11-09 2019-05-17 北京京东尚科信息技术有限公司 Storage management method, device, medium and electronic equipment
CN110070312A (en) * 2018-01-24 2019-07-30 北京京东尚科信息技术有限公司 Order processing method and apparatus
CA3100279A1 (en) * 2018-05-21 2019-11-28 Beijing Geekplus Technology Co., Ltd. Order processing method and device, server, and storage medium
CN110880057A (en) * 2018-09-05 2020-03-13 北京京东振世信息技术有限公司 Order combining method and device
CN111260270A (en) * 2018-12-03 2020-06-09 北京京东尚科信息技术有限公司 Method and device for improving order processing efficiency of store
CN109754203A (en) * 2018-12-08 2019-05-14 武汉普罗格集成科技有限公司 A kind of Intelligent logistics LK algorithm combined method
CN111553548A (en) * 2019-02-12 2020-08-18 北京京东尚科信息技术有限公司 Goods picking method and device
CN109726971A (en) * 2019-03-13 2019-05-07 广州南信信息科技有限公司 A kind of yarn picking stock preparation system and yarn picking are got ready the goods method
CN110826960A (en) * 2019-10-14 2020-02-21 北京京东尚科信息技术有限公司 Order picking method, device, equipment and computer readable medium

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
A公司南京配送中心仓储管理优化研究;熊少杰;《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》;第2019年卷(第9期);第C035-48页 *
Packaged gas supply chain planning with network-wide SKU rationalization;Ethan Malinowski 等;《International Journal of Production Economics》;第204卷;第346-357页 *
基于学习效果的蔬菜电商成组拣货排序方法;冯晓春 等;《系统工程理论与实践》;第40卷(第2期);第449-461页 *

Also Published As

Publication number Publication date
CN113822509A (en) 2021-12-21

Similar Documents

Publication Publication Date Title
CN110197350B (en) Article delivery method and device
CN107845012B (en) Order processing method and device
CN110363456B (en) Method and device for putting articles on shelves
CN106875148B (en) Method and device for determining a storage position for an item
CN110348771B (en) Method and device for order grouping of orders
CN108694637A (en) Order processing method, apparatus, server and storage medium
CN109961306B (en) Method and device for distributing inventory of articles
CN110197351A (en) A kind of article warehouse-out method and device
CN107038166A (en) Inquiry can preengage warehouse capacity, reservation and cancel reservation storage method and device
CN110880057B (en) Grouping method and device
CN113259144A (en) Storage network planning method and device
CN112884405A (en) Inquiry system and scheduling method thereof
CN110826953B (en) Warehouse storage equipment planning method and device
CN114118888A (en) Order ex-warehouse method and device
CN111950830B (en) Task allocation method and device
CN112446652B (en) Method and device for processing task set
CN111612385A (en) Method and device for clustering to-be-delivered articles
CN113822509B (en) Method and device for grouping sheets
CN113762664A (en) Method and device for distributing picking task and computer readable medium
CN113762854B (en) Order processing method and device
CN110659916A (en) Order amount splitting method and device
CN114997779A (en) Storage processing method and device, electronic equipment and computer readable medium
CN113762876A (en) Information generation method and device, electronic equipment and computer readable medium
CN112926907A (en) Warehouse inventory layout method and device
CN113762822B (en) Method and device for processing order

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant