CN113822509A - Order combining method and device - Google Patents

Order combining method and device Download PDF

Info

Publication number
CN113822509A
CN113822509A CN202011240368.7A CN202011240368A CN113822509A CN 113822509 A CN113822509 A CN 113822509A CN 202011240368 A CN202011240368 A CN 202011240368A CN 113822509 A CN113822509 A CN 113822509A
Authority
CN
China
Prior art keywords
group
value
list
subtask
parameter
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.)
Granted
Application number
CN202011240368.7A
Other languages
Chinese (zh)
Other versions
CN113822509B (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

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • 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 organizing orders, and relates to the technical field of computers. One embodiment of the method comprises: receiving a group order instruction, wherein 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 a first subtask list set with a group list parameter value not greater than a group list parameter limit value, performing group list according to the group list parameter value and the group list parameter limit value corresponding to each first subtask list; and for each second subtask sheet in the second subtask sheet set with the group single parameter value larger than the group single parameter limit value, acquiring the group single parameter value of the storage position corresponding to the second subtask sheet, and performing group sheet according to the group single parameter value of the storage position and the group single parameter limit value. This embodiment enables the item to be checked for acceptance by money when it is finally received at the store. The optimal goods sorting efficiency is ensured, the operation time is shortened, the operation efficiency is improved, and the goal that the clothing goods can be rapidly circulated is achieved.

Description

Order combining method and device
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for organizing orders.
Background
In the apparel industry, there are many types of orders and warehouse management systems need to support diversified functions. For a B2B (Business-to-Business, which refers to a Business model for Business activities between businesses) order, the store delivery requires to check the order according to the money, so that the warehouse management system needs to group the order according to the money, that is, the items of the same money under an order can be put into the same picking task order. Currently, warehouse management systems on the market do not have the function of organizing orders by money, that is, the system combines single or multiple orders into different picking task orders by money according to certain rules.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
if the store hopes to receive goods according to the money, the warehouse needs to pack and deliver goods according to the money, and in the face of large-batch dress orders, if the order is formed according to the common order dimension, the goods need to be manually arranged and packaged according to the money after picking and rechecking, and the operation efficiency is greatly influenced.
Disclosure of Invention
In view of this, the embodiments of the present invention provide an order combining method and apparatus, which add a policy of order combining according to money when a warehouse management system task allocation link is used for order combining, so that orders can be combined into different picking tasks according to money, and the picking tasks are convenient for rechecking and packaging according to money after picking, thereby achieving checking and accepting according to money when an article is finally received in a store, ensuring the optimal picking efficiency, shortening the operation time, improving the operation efficiency, and achieving the goal of fast turnaround.
To achieve the above object, according to an aspect of an embodiment of the present invention, a singleton method is provided.
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; acquiring a group list parameter value corresponding to each subtask list; for a first subtask list set with a group list parameter value not greater than the group list parameter limit, performing group list according to the group list parameter value corresponding to each first subtask list and the group list parameter limit; and for each second subtask sheet in the second subtask sheet set with the group single parameter value larger than the group single parameter limit value, acquiring the group single parameter value of the storage position corresponding to the second subtask sheet, and performing group ordering according to the group single parameter value of the storage position and the group single parameter limit value.
Optionally, performing a form combination according to a form combination parameter value corresponding to each first subtask form and the form combination parameter limit includes: taking out a first maximum value from the group list parameter value corresponding to each first subtask list; taking out group single parameter values from group single parameter values corresponding to the first subtask single remaining after the first 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 first maximum value to obtain a first sum value when taking out one group single parameter value until the first sum value is larger than the group single parameter limit value; combining first subtask units except the first subtask unit corresponding to the last taken unit parameter value in the first subtask unit corresponding to the first sum value into a task list; and deleting the first subtask sheets combined into the task sheet from the first subtask sheet set to update the first subtask sheet set, and repeatedly executing the steps until each first subtask sheet is combined into the task sheet.
Optionally, performing a form combination according to a form combination parameter value corresponding to each first subtask form and the form combination parameter limit includes: performing first sequencing according to the size of the group list parameter value corresponding to each first subtask list; 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 performing judgment according to the second sum value; if the second sum is larger than the group list parameter limit value, taking the first subtask list corresponding to the first maximum value as a combined task list; if the second sum value is not greater than the group single parameter limit value, taking out the group single parameter values from the updated first sequencing result one by one according to the sequence from small to large, accumulating and summing the taken out group single parameter values and the second sum value to obtain a third sum value when taking out one group single parameter value, and combining the first subtasks except the first subtask corresponding to the finally taken out group single parameter value in the subtask corresponding to the third sum value into the task list until the third sum value is greater than the group single parameter limit value; and deleting the first subtask sheets combined into the task sheet from the first subtask sheet set to update the first subtask sheet set, and repeatedly executing the steps until each first subtask sheet is combined into the task sheet.
Optionally, performing a grouping according to a grouping parameter value corresponding to the storage location and the grouping parameter limit value includes: taking out a second maximum value from the group single parameter value corresponding to each storage position; taking out the group single parameter values from the group single parameter values left 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 when taking out one group single parameter value until the fourth sum value is larger than the group single parameter limit value; combining the picking tasks of the storage positions except the storage position corresponding to the last taken out group order parameter value in the storage positions corresponding to the fourth sum value into a task order; and deleting the storage positions corresponding to the picking tasks combined into the task list from the storage positions corresponding to the second subtask list to update the storage positions corresponding to the second subtask list, and repeatedly executing the steps until the picking tasks of each storage position are combined into the task list.
Optionally, performing a grouping according to a grouping parameter value corresponding to the storage location and the grouping parameter limit value includes: performing second sorting according to the size of the single group parameter value corresponding to each storage position; taking out a second maximum value and a second minimum value from a second sorting result, summing the second maximum value and the second minimum value 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 is larger than the group order parameter limit value, combining the picking tasks of the storage positions corresponding to the second maximum value into a task order; if the fifth sum value is not larger than the group order parameter limit value, taking out the group order parameter values from the updated second sequencing result one by one according to the sequence from small to large, accumulating and summing the taken out group order parameter values and the fifth sum value to obtain a sixth sum value when taking out one group order parameter value until the sixth sum value is larger than the group order parameter limit value, and combining picking tasks of storage positions except the storage position corresponding to the last taken out group order parameter value in the storage positions corresponding to the sixth sum value into a task order; and deleting the storage positions corresponding to the picking tasks combined into the task list from the storage positions corresponding to the second subtask list to update the storage positions corresponding to the second subtask list, and repeatedly executing the steps until the picking tasks of each storage position are combined into the task list.
Optionally, before performing the grouping according to the group single parameter value of the storage location and the group single parameter limit value, the method further includes: and judging whether the group single parameter value of the storage position is greater than the group single parameter limit value, and if so, adjusting the group single parameter limit value.
Optionally, the set of singleton parameters includes: commodity volume, commodity weight and commodity quantity; and each subtask list corresponds to a task of a commodity.
According to another aspect of the embodiments of the present invention, there is provided a singulation apparatus.
A singulation engine comprising: the instruction receiving module is used for receiving a group order instruction, and the group order instruction comprises a group order parameter and a group order parameter limit value; 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 grouping a first subtask list set of which the group list parameter value is not larger than the group list parameter limit value according to the group list parameter value corresponding to each first subtask list and the group list parameter limit value; and the second group list module is used for acquiring a group list parameter value of a storage position corresponding to the second subtask 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, and performing group list according to the group list parameter value of the storage position and the group list parameter limit value.
Optionally, the first set of single modules is further configured to: taking out a first maximum value from the group list parameter value corresponding to each first subtask list; taking out group single parameter values from group single parameter values corresponding to the first subtask single remaining after the first 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 first maximum value to obtain a first sum value when taking out one group single parameter value until the first sum value is larger than the group single parameter limit value; combining first subtask units except the first subtask unit corresponding to the last taken unit parameter value in the first subtask unit corresponding to the first sum value into a task list; and deleting the first subtask sheets combined into the task sheet from the first subtask sheet set to update the first subtask sheet set, and repeatedly executing the steps until each first subtask sheet is combined into the task sheet.
Optionally, the first set of single modules is further configured to: performing first sequencing according to the size of the group list parameter value corresponding to each first subtask list; 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 performing judgment according to the second sum value; if the second sum is larger than the group list parameter limit value, taking the first subtask list corresponding to the first maximum value as a combined task list; if the second sum value is not greater than the group single parameter limit value, taking out the group single parameter values from the updated first sequencing result one by one according to the sequence from small to large, accumulating and summing the taken out group single parameter values and the second sum value to obtain a third sum value when taking out one group single parameter value, and combining the first subtasks except the first subtask corresponding to the finally taken out group single parameter value in the subtask corresponding to the third sum value into the task list until the third sum value is greater than the group single parameter limit value; and deleting the first subtask sheets combined into the task sheet from the first subtask sheet set to update the first subtask sheet set, and repeatedly executing the steps until each first subtask sheet is combined into the task sheet.
Optionally, the second set of single modules is further configured to: taking out a second maximum value from the group single parameter value corresponding to each storage position; taking out the group single parameter values from the group single parameter values left 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 when taking out one group single parameter value until the fourth sum value is larger than the group single parameter limit value; combining the picking tasks of the storage positions except the storage position corresponding to the last taken out group order parameter value in the storage positions corresponding to the fourth sum value into a task order; and deleting the storage positions corresponding to the picking tasks combined into the task list from the storage positions corresponding to the second subtask list to update the storage positions corresponding to the second subtask list, and repeatedly executing the steps until the picking tasks of each storage position are combined into the task list.
Optionally, the second set of single modules is further configured to: performing second sorting according to the size of the single group parameter value corresponding to each storage position; taking out a second maximum value and a second minimum value from a second sorting result, summing the second maximum value and the second minimum value 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 is larger than the group order parameter limit value, combining the picking tasks of the storage positions corresponding to the second maximum value into a task order; if the fifth sum value is not larger than the group order parameter limit value, taking out the group order parameter values from the updated second sequencing result one by one according to the sequence from small to large, accumulating and summing the taken out group order parameter values and the fifth sum value to obtain a sixth sum value when taking out one group order parameter value until the sixth sum value is larger than the group order parameter limit value, and combining picking tasks of storage positions except the storage position corresponding to the last taken out group order parameter value in the storage positions corresponding to the sixth sum value into a task order; and deleting the storage positions corresponding to the picking tasks combined into the task list from the storage positions corresponding to the second subtask list to update the storage positions corresponding to the second subtask list, and repeatedly executing the steps until the picking tasks of each storage position are combined into the task list.
Optionally, the apparatus further comprises a parameter limit adjustment module, configured to: before performing the grouping according to the grouping parameter value of the storage location and the grouping parameter limit value, judging whether the grouping parameter value of the storage location is larger than the grouping parameter limit value, and if so, adjusting the grouping parameter limit value.
Optionally, the set of singleton parameters includes: commodity volume, commodity weight and commodity quantity; and each subtask list corresponds to a task of a commodity.
According to yet another aspect of an embodiment of the present invention, an electronic device for organizing a list is provided.
An electronic device for organizing, comprising: one or more processors; a storage device, configured to store one or more programs, which when executed by the one or more processors, cause the one or more processors to implement the group list method provided by the embodiments of the present invention.
According to yet another aspect of embodiments of the present invention, a computer-readable medium is provided.
A computer-readable medium, on which a computer program is stored, which, when executed by a processor, implements the singleton method provided by embodiments of the invention.
One embodiment of the above invention has the following advantages or benefits: receiving a group order instruction, wherein 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 a first subtask list set with a group list parameter value not greater than a group list parameter limit value, performing group list according to the group list parameter value and the group list parameter limit value corresponding to each first subtask list; for each second subtask sheet in the second subtask sheet set with the group sheet parameter value larger than the group sheet parameter limit value, the group sheet parameter value of the storage position corresponding to the second subtask sheet is obtained, and the technical means of grouping is carried out according to the group sheet parameter value of the storage position and the group sheet parameter limit value, orders can be combined into different picking tasks according to money, and rechecking and packaging according to money after picking are facilitated, so that the purpose that when the goods are finally received in a store, the goods can be checked according to money is achieved, the goods picking efficiency is optimal, the operation time is shortened, the operation efficiency is improved, and the purpose of rapid turnover is achieved.
Further effects of the above-mentioned non-conventional alternatives will be 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 group singles method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a first sub-task single-time singulating process of a singulating method according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a first subtask list secondary grouping process of a grouping method according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a first subtask list three-time grouping process of a grouping method according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a second sub-task single-time singulating process of a singulating method according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of a second subtask list secondary grouping process of a grouping method according to an embodiment of the present invention;
FIG. 7 is a schematic diagram of a second subtask-to-three-time grouping process of a grouping method according to an embodiment of the present invention;
FIG. 8 is a schematic diagram of the main modules of a singulation apparatus according to an embodiment of the present invention;
FIG. 9 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 10 is a schematic structural diagram of a computer system of a terminal device or a server for implementing an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as 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 going from large warehouses to stores. When operating both B2C and B2B orders in a warehouse, it is desirable for the warehouse management system to support a wide variety of functions. The order of B2B for costumes (such as costume, accessory, case and bag) has the remarkable characteristics: sku (Stock keeping Unit) is many, and the piece number is many, and order time efficiency requires highly, still need pack according to the money when the vanning, and the convenience is accepted according to the money when the store receives the goods. Boxing according to style is a special operation requirement in the clothing industry. The relationship between the money and the sku is as follows, for example, a pair of shoes can be uniquely determined by adding red and white and 41 yards if the money is named as 'men with thick bottom and high net side in summer'. Therefore, the combination of the 3 elements of money, color and code can determine a sku. Thus, one pattern corresponds to multiple skus, and one sku can only correspond to one pattern.
In order to enable an operator to pack the goods according to the money when the goods are packed, the operator needs to request 'picking the goods according to the money' in an upstream link, and to realize 'picking the goods according to the money', the operator inevitably needs to request 'grouping the goods according to the money', and the warehouse management system is required to put the goods of the same money under an order into the same goods picking task sheet (called as a 'task sheet' for short), and the subtask sheet corresponds to the order of the goods of the money. The reason for separating the items of one order into different task orders is that the B2B in the clothing industry has more orders sku and pieces, if the items are placed in one task order, the picking box (or the picking trolley) of the order picking person can not be placed, and a plurality of persons are required to pick the items according to a plurality of task orders, so that the efficiency can be improved. In addition, if multiple orders have the same money, the system can combine the orders into a collection list and then split the collection list into different task lists according to various rules. As shown in table 1 below, in which the correspondence between orders, collection sheets, money numbers, job orders, and the like is shown. There are 6 orders (involving 8 sku, 5 money numbers) placed in a collection JHD1, which is then divided into 4 task sheets. The task sheets are grouped by money, and as shown in table 1, the subtask sheet corresponding to the money number KH1 is composed of the order picking task corresponding to the money number KH1 in order 1 and the order picking task corresponding to the money number KH1 in order 4. Of course, it is also possible to simply process 1 order as 1 aggregated sheet and then split the sheet into different job orders by the system according to various rules.
TABLE 1
Figure BDA0002768168950000091
In the description of the embodiments of the present invention, the terms are as follows:
order form: sales orders, instructions for ex-warehouse in the warehouse management system;
collection list: gathering single or multiple orders with common properties (such as the same sku) to form a collection list;
a task list: the warehouse picker is used for referring to a task detail of picking;
a subtask list: each subtask list corresponds to a task of a commodity;
sku: a number in the warehouse for uniquely identifying an item;
the model number is: the clothing industry is used for describing one dimension of the characteristics of an article, and a plurality of color divisions and a plurality of size divisions can be arranged under one style number;
storing the position: the warehouse management system is used for storing the minimum space units of the articles, and each storage position is provided with a corresponding number;
positioning quantity: the number of the storage positions located by the orders is not more than the total number of the storage positions;
quantity of articles: the number of articles may be simply the number, volume, weight, etc. of the articles.
The parameters involved are explained as follows:
VT: an upper volume limit allowed in one order;
WT: an upper weight limit allowed in a job ticket;
QT: the upper limit of the allowed pieces in one task list;
sum (V _ KHi): summing all item volumes for located item number KHi;
sum (W _ KHi): summing all item weights for located item number KHi;
sum (Q _ KHi): summing all item numbers for the located part number KHi;
v _ KHi _ m: positioning a plurality of storage positions for the article corresponding to the style number KHi, wherein each storage position is positioned corresponding to the volume of the article;
the relationship between money and the task order allowed by money packing (default item to one task order packing) includes:
articles of the same style are placed in a task list, which is called a single style list task for short;
the same type of articles are placed in a plurality of task lists, and each task list is only one type, which is called single type and multiple tasks for short;
a plurality of items are put in the same task list, but the items put in the same task do not appear in other tasks, which are called 'multi-item list task' for short;
items of multiple money are not allowed to be placed in multiple task lists, namely money a and money b are placed in a task list X, and money b and money c are placed in a task list Y, which is called 'multiple money and multiple tasks' for short, because an operator does not know that the items of different money are still present in other task lists when boxing, and the picking error can be caused. The combination of the money and the task sheet can be simplified as shown in the following table 2.
TABLE 2
Single money Multiple versions
Single task √ √
Multitasking √ ×
In order to achieve the purpose that the goods can be finally checked and accepted according to the money when the goods are finally received in the store, and the delivery efficiency of the warehouse can be improved, the invention provides a method and a device for organizing orders. Meanwhile, other limiting factors are considered, the optimal goods picking efficiency of the warehouse is guaranteed, the delivery speed of the warehouse is increased, and the characteristic of rapid turnover of clothing commodities is met.
Fig. 1 is a schematic diagram of main steps of a group list method according to an embodiment of the present invention, which is directed to a scenario in which stores such as the apparel industry require acceptance by money. In the embodiment of the invention, a policy of grouping by money is used, so that the warehouse orders are grouped, picked and boxed according to money under the condition of ensuring the efficiency, and the requirement that final stores can receive goods according to money is met. As shown in fig. 1, the method for grouping according to the embodiment of the present invention mainly includes the following steps S101 to S104.
Step S101: receiving a group order instruction, wherein the group order instruction comprises a group order parameter and a group order parameter limit value;
step S102: acquiring a group list parameter value corresponding to each subtask list;
step S103: for a first subtask list set with a group list parameter value not greater than a group list parameter limit value, performing group list according to the group list parameter value and the group list parameter limit value corresponding to each first subtask list;
step S104: and for each second subtask sheet in the second subtask sheet set with the group single parameter value larger than the group single parameter limit value, acquiring the group single parameter value of the storage position corresponding to the second subtask sheet, and performing group sheet according to the group single parameter value of the storage position and the group single parameter limit value.
According to the above steps S101 to S104, when the form by the money is required, 4 different service scenarios are abstracted according to the relationship between the money number and the task form. And calculating the order by adopting different dimensions according to different relations between the total article quantity of a certain money number and the upper limit of the task order. According to the principle of taking the maximum quantity of articles in the task list, the mode that the maximum value and the minimum value are matched in sequence is adopted for order grouping, the order grouping algorithm can exist in parallel with other order grouping algorithms, the flexibility of a warehouse management system cannot be reduced, the warehouse can pick the articles according to the money, the store can check the articles according to the money when receiving the articles in the store, the article picking efficiency is improved, and the rapid turnover of the clothing articles is met.
According to an embodiment of the present invention, performing a group list according to the group list parameter value and the group list parameter limit value corresponding to each first subtask list includes: taking out a first maximum value from the group list parameter value corresponding to each first subtask list; taking out the group single parameter values from the group single parameter values corresponding to the first subtask single remaining after the first 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 first maximum value to obtain a first sum value until the first sum value is larger than the group single parameter limit value; combining first subtask units except the first subtask unit corresponding to the last taken unit parameter value in the first subtask unit corresponding to the first sum value into a task list; and deleting the first subtask sheets combined into the task sheet from the first subtask sheet set to update the first subtask sheet set, and repeatedly executing the steps until each first subtask sheet is combined into the task sheet.
According to another embodiment of the present invention, performing a group list according to the group list parameter value and the group list parameter limit value corresponding to each first subtask list further includes: performing first sequencing according to the size of the group list parameter value corresponding to each first subtask list; 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 performing judgment according to the second sum value; if the second sum is larger than the group list parameter limit value, taking the first subtask list corresponding to the first maximum value as a combined task list; if the second sum value is not larger than the group single parameter limit value, taking out the group single parameter values from the updated first sequencing result one by one according to the sequence from small to large, accumulating and summing the taken out group single parameter values and the second sum value to obtain a third sum value when taking out one group single parameter value, and combining the first subtasks except the first subtask corresponding to the finally taken group single parameter value in the subtask corresponding to the third sum value into the task list until the third sum value is larger than the group single parameter limit value; and deleting the first subtask sheets combined into the task sheet from the first subtask sheet set to update the first subtask sheet set, and repeatedly executing the steps until each first subtask sheet is combined into the task sheet.
In an embodiment of the invention, the group list parameters include: commodity volume, commodity weight and commodity quantity; and each subtask list corresponds to a task of a commodity.
The factors affecting the upper limit of the task list are volume, weight, number of pieces, and the like, and the clothing is packed, and the volume factor is considered preferentially, so the volume is taken as an example. According to the technical scheme of the invention, if one money is combined with one task list, the number of the task lists is very large, some task lists have few articles, and the amount of the articles in the task lists is not saturated. The principle of taking the maximum article quantity in one task list is used, and the optimal picking efficiency is ensured. It is also ensured that a number does not appear in multiple job tickets (multiple numbers are allowed in a job ticket). At this time, the solution is made by matching and combining, and the judgment is based on the Sum Sum (V _ KHi) of the volumes of all the articles under the same model and the upper limit V of the volume of the article in one task listT. When Sum (V _ KHi) ≦ VTThe group order process comprises:
1. assuming n types of money numbers, the volumes of all the articles of each money number are summed, and a total of n Sum (V _ KHi) is obtained, wherein 0< i is less than or equal to n. Sorting the n values of Sum (V _ KHi) into Sum (V _ KH1), Sum (V _ KH2), … …, Sum (V _ KH (n-1)), Sum (V _ KHn) in sequence from large to small;
2. it is determined whether the Sum of the maximum value Sum (V _ KH1) and the minimum value Sum (V _ KHn) of the volumes exceeds the maximum volume of the order. Specifically, the method comprises the following steps:
if the sum exceeds the preset value, the task is not combined with the task of the money number with the minimum volume, and the task corresponding to the money number with the maximum volume forms a task list, namely: if Sum (V _ KH1) + Sum (V _ KHn)>VTIf yes, the task corresponding to KH1 is a group order result (a "single-money order task" type);
if not, continue to combine with the next smallest volume of money until the sum exceeds VTThat is, if Sum (V _ KH1) + Sum (V _ KHn) ≦ VTContinuously judging whether Sum (V _ KH1) + Sum (V _ KHn) + Sum (V _ KH (n-1)) is less than VTUntil Sum (V _ KH1) + Sum (V _ KHn) + … … + Sum (V _ KH (n-i +1)) + Sum (V _ KH (n-i))>VTAt this time, task group lists ("multi-style single task" types) corresponding to KH1, KHn, … … and KH (n-i +1) are selected;
3. after the first task list is combined, the volume values of the money numbers which are remained and not combined are continuously sorted from large to small, the remained current maximum volume value is taken to be combined with the remained current minimum volume value, and whether V is exceeded or not is judgedT. And the logic is the same as the above, and the steps are circulated in sequence until all the money number tasks are completed in a form.
FIG. 2 is a diagram illustrating a first sub-task single-time grouping process of a grouping method according to an embodiment of the present invention, as shown in FIG. 2 when Sum (V _ KHi)<VTWhen there are a total of 11 types, the volume values of the 11 types of commodities are sorted from large to small to form V _ KH1 to V _ KH 11. The Sum of the maximum Sum (V _ KH1) and the minimum Sum (V _ KH11) exceeds V for the 1 st groupTAt this time, the first subtasks corresponding to the pattern number KH1 are combined into a single task sheet, i.e., a "single-form task" type.
FIG. 3 is a schematic diagram of the first sub-task list secondary grouping process of the grouping method according to the embodiment of the present invention, as shown in FIG. 3, when the secondary grouping is performed, Sum (V _ KH2) + Sum (V _ KH11) + Sum (V _ KH10) + Sum (V _ KH9)>VTThen, the 3 first subtasks corresponding to the models KH2, KH11 and KH10 can form a task list, i.e., "multiple-form task"Type (b).
FIG. 4 is a schematic diagram of the first sub-task list three-time list grouping process of the list grouping method according to the embodiment of the present invention, as shown in FIG. 4, when the third list grouping is performed, Sum (V _ KH3) + Sum (V _ KH9) + Sum (V _ KH8)>VTThen, the 2 first subtasks corresponding to the models KH3 and KH9 can constitute a single task sheet, i.e. a "multiple-task" type.
According to an embodiment of the present invention, performing grouping according to the group parameter value and the group parameter limit value corresponding to the storage location includes: taking out a second maximum value from the group single parameter value corresponding to each storage position; taking out the group single parameter values from the group single parameter values left 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 when taking out one group single parameter value until the fourth sum value is larger than the group single parameter limit value; combining the picking tasks of the storage positions except the storage position corresponding to the last taken out group order parameter value in the storage positions corresponding to the fourth sum value into a task order; and deleting the storage positions corresponding to the picking tasks combined into the task list from the storage positions corresponding to the second subtask list to update the storage positions corresponding to the second subtask list, and repeatedly executing the steps until the picking tasks of all the storage positions are combined into the task list.
In an embodiment of the present invention, performing grouping according to the group list parameter value and the group list parameter limit value corresponding to the storage location further includes: performing second sorting according to the size of the single group parameter value corresponding to each storage position; 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 of the grouping list, and then executing judgment according to the fifth sum value of the grouping list; if the fifth sum of the group list is larger than the parameter limit value of the group list, combining the picking tasks of the storage positions corresponding to the second maximum value of the group list into a task list; if the group list fifth sum value is not larger than the group list parameter limit value, taking out the group list parameter values from the updated second sequencing result one by one according to the sequence from small to large, accumulating and summing the taken out group list parameter values and the group list fifth sum value to obtain a sixth sum value when taking out one group list parameter value, and combining the picking tasks of the storage positions except the storage position corresponding to the finally taken out group list parameter value in the storage position corresponding to the group list sixth sum value into a task list until the group list sixth sum value is larger than the group list parameter limit value; and deleting the storage positions corresponding to the picking tasks combined into the task list from the storage positions corresponding to the second subtask list of the group list to update the storage positions corresponding to the second subtask list of the group list, and repeatedly executing the steps until the picking tasks of all the storage positions are combined into the task list.
According to still another embodiment of the present invention, before performing the grouping according to the grouping parameter value and the grouping parameter limit value of the bin, the method further comprises: and judging whether the group single parameter value of the storage position is greater than the group single parameter limit value, and if so, adjusting the group single parameter limit value.
When Sum (V _ KHi)>VTWhen the total volume of the articles of one style exceeds the upper limit V of the volume of the task listTOne order cannot complete picking (can not be put down) of all the items in the money, and the order of picking the items in the money has to be split. Similarly, the principle of taking the maximum article quantity in one task list is adopted, the picking efficiency is ensured to be optimal, and the fewer the split task lists are, the better the splitting is. In this case, one money number may be divided into a plurality of job tickets, but a plurality of money numbers are not allowed to be entered into a plurality of jobs. At this time, the solution is continuously solved in a matching and combining manner, but the judgment basis is changed into the volume value of each positioning detail below the model, and the list combining process comprises the following steps:
1. positioning the articles corresponding to the money number KHi to obtain the volume V _ KHi _ m of the articles placed on n storage positions, wherein m is more than 0 and less than or equal to n, and sorting the n volume values 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 VTAnd if the number exceeds the preset value, the order is not combined with the minimum value, and the order picking task of the storage position corresponding to the current maximum value forms a task list. I.e. if V _ KHi _1+ V _ KHi _ n>VTThen the picking task of the bin corresponding to V KHi _1 constitutes a task order ("singles and multitask" type). It should be noted that the maximum value V _ KHi _1>VTAnd will not be present in the actual operating situation.Because the total volume of the commodities positioned on one storage position exceeds the upper volume limit of the task order, the order picker cannot complete the order picking of one storage position by one task, and the upper volume limit of the task order needs to be increased at the moment;
3. if V is not exceededTContinue to combine with the next smallest volume of money until V is exceededTI.e., if V _ KHi _1+ V _ KHi _ n ≦ VTThen, it is continuously determined whether V _ KHi _1+ V _ KHi _ n + V _ KHi _ (n-1) is less than VTUp to V _ KHi _1+ V _ KHi _ n + … … + V _ KHi _ (n-m +1) + V _ KHi _ (n-m)>VTAt this time, the picking tasks of the storage positions corresponding to V _ KHi _1, V _ KHi _ n, … … and V _ KHi _ (n-m +1) are combined into a task list (a "single-order multi-task" type);
4. after the first task list is combined, the volume values of the articles placed on the storage positions of the rest of the money number are continuously sequenced from large to small, the rest current maximum volume value is combined with the rest current minimum volume value, and whether the volume value exceeds V or not is judgedT. The logic is the same as the above, and the operation is circularly executed until the order picking tasks of the articles placed on all the storage positions are completed.
Fig. 5 is a schematic diagram of a second sub-task single-time grouping process of the grouping method according to the embodiment of the present invention, and as shown in fig. 5, when there are 9 location details (i.e., bins) referred to by reference numeral KHi, the volume values of the items placed on the 9 bins are sorted from large to small to form V _ KHi _1 to V _ KHi _ 9. In the 1 st group, the sum of the maximum volume value V _ KHi _1 and the minimum volume value V _ KHi _9 exceeds VTThen the picking tasks of the storage corresponding to V _ KHi _1 are individually grouped into a task order ("single-order multi-task" type).
FIG. 6 is a diagram illustrating a second sub-task list secondary grouping process of the grouping method according to the embodiment of the invention, as shown in FIG. 6, V _ KHi _2+ V _ KHi _9+ V _ KHi _8>VTThen the picking tasks of the storage locations where V _ KHi _2 and V _ KHi _9 are located constitute a task order ("singles and multitask" type).
FIG. 7 is a diagram illustrating a second sub-task list three-time list grouping process of the list grouping method according to an embodiment of the present invention, as shown in FIG. 7, V _ KHi _3+ V _ KHi _8>VTThen V _ KHi _3 is the pick order form of the storage positionAlone into a task list ("single multi-task" type).
Fig. 8 is a schematic diagram of main modules of an apparatus for intercepting a mobile terminal request method according to an embodiment of the present invention, and as shown in fig. 8, a list combining apparatus 800 according to an embodiment of the present invention mainly includes an instruction receiving module 801, a parameter obtaining module 802, a first list combining module 803, and a second list combining module 804.
An instruction receiving module 801, configured to receive a group order instruction, where the group order instruction includes a group order parameter and a group order parameter limit;
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, for a first subtask list set whose grouping list parameter value is not greater than the grouping list parameter limit, perform grouping according to the grouping list parameter value and the grouping list parameter limit corresponding to each first subtask list;
a second grouping module 804, configured to, for each second subtask list in the second subtask list set where the grouping parameter value is greater than the grouping parameter limit, obtain a grouping parameter value of a storage location corresponding to the second subtask list, and perform grouping according to the grouping parameter value of the storage location and the grouping parameter limit.
According to an embodiment of the invention, the first set of single modules 803 may also be used to: taking out a first maximum value from the group list parameter value corresponding to each first subtask list; taking out group single parameter values from group single parameter values corresponding to the first subtask single remaining after the first 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 first maximum value to obtain a first sum value when taking out one group single parameter value until the first sum value is larger than the group single parameter limit value; combining first subtask units except the first subtask unit corresponding to the last taken unit parameter value in the first subtask unit corresponding to the first sum value into a task list; and deleting the first subtask sheets combined into the task sheet from the first subtask sheet set to update the first subtask sheet set, and repeatedly executing the steps until each first subtask sheet is combined into the task sheet.
According to another embodiment of the present invention, the first set of single modules 803 may also be used to: performing first sequencing according to the size of the group list parameter value corresponding to each first subtask list; 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 performing judgment according to the second sum value; if the second sum is larger than the group list parameter limit value, taking the first subtask list corresponding to the first maximum value as a combined task list; if the second sum value is not larger than the group single parameter limit value, taking out the group single parameter values from the updated first sequencing result one by one according to the sequence from small to large, accumulating and summing the taken out group single parameter values and the second sum value to obtain a third sum value when taking out one group single parameter value, and combining the first subtasks except the first subtask corresponding to the finally taken group single parameter value in the subtask corresponding to the third sum value into the task list until the third sum value is larger than the group single parameter limit value; and deleting the first subtask sheets combined into the task sheet from the first subtask sheet set to update the first subtask sheet set, and repeatedly executing the steps until each first subtask sheet is combined into the task sheet.
According to yet another embodiment of the invention, the second set of single modules 804 may further be configured to: taking out a second maximum value from the group single parameter value corresponding to each storage position; taking out the group single parameter values from the group single parameter values left 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 when taking out one group single parameter value until the fourth sum value is larger than the group single parameter limit value; combining the picking tasks of the storage positions except the storage position corresponding to the last taken out group order parameter value in the storage positions corresponding to the fourth sum value into a task order; and deleting the storage positions corresponding to the picking tasks combined into the task list from the storage positions corresponding to the second subtask list to update the storage positions corresponding to the second subtask list, and repeatedly executing the steps until the picking tasks of all the storage positions are combined into the task list.
According to yet another embodiment of the invention, the second set of single modules 804 may further be configured to: performing second sorting according to the size of the single group parameter value corresponding to each storage position; taking out the second maximum value and the second minimum value from the second sorting result, summing the second maximum value and the second minimum value to obtain a fifth sum value, updating the second sorting result, and then performing judgment according to the fifth sum value; if the fifth sum is larger than the group order parameter limit value, combining the picking tasks of the storage positions corresponding to the second maximum value into a task order; if the fifth sum value is not larger than the group single parameter limit value, taking out the group single parameter values from the updated second sequencing result one by one according to the sequence from small to large, accumulating and summing the taken out group single parameter values and the fifth sum value to obtain a sixth sum value when taking out one group single parameter value until the sixth sum value is larger than the group single parameter limit value, and combining the picking tasks of the storage positions except the storage position corresponding to the finally taken out group single parameter value in the storage position corresponding to the sixth sum value into a task list; and deleting the storage positions corresponding to the picking tasks combined into the task list from the storage positions corresponding to the second subtask list to update the storage positions corresponding to the second subtask list, and repeatedly executing the steps until the picking tasks of all the storage positions are combined into the task list.
In an embodiment of the present invention, the apparatus 800 further includes a parameter limit adjusting module (not shown in the figure) configured to: before performing grouping according to the grouping parameter value of the storage position and the grouping parameter limit value, judging whether the grouping parameter value of the storage position is greater than the grouping parameter limit value, and if so, adjusting the grouping parameter limit value.
According to an embodiment of the invention, the set of single parameters comprises: commodity volume, commodity weight and commodity quantity; and each subtask list corresponds to a task of a commodity.
Fig. 9 illustrates an exemplary system architecture 900 in which a singulating method or a singulating device of embodiments of the present invention may be applied.
As shown in fig. 9, the system architecture 900 may include end devices 901, 902, 903, a network 904, and a server 905. Network 904 is the medium used to provide communication links between terminal devices 901, 902, 903 and server 905. Network 904 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 901, 902, 903 to interact with a server 905 over a network 904 to receive or send messages and the like. The terminal devices 901, 902, 903 may have various client applications installed thereon, such as a warehouse management type system, an e-commerce type application, an allocation combination type application, etc. (just examples).
The terminal devices 901, 902, 903 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 905 may be a server providing various services, such as a background management server (for example only) providing support for a warehouse management-type website browsed by a user using the terminal devices 901, 902, 903. The back-office management server may analyze and otherwise process the received data, such as order instructions, and feed back the processing results (e.g., the assigned picking order-just an example) to the terminal device.
It should be noted that the group and order method provided by the embodiment of the present invention is generally executed by the server 905, and accordingly, the group and order apparatus 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, a block diagram of a computer system 1000 suitable for use with a terminal device or server implementing an embodiment of the invention is shown. The terminal device or the server shown in fig. 10 is only an example, and should not bring any limitation to the functions and the 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 that can perform 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 necessary for the operation of the system 1000 are also stored. The CPU 1001, ROM 1002, and RAM 1003 are connected to each other via 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 section 1007 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 1008 including a hard disk and 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 driver 1010 is also connected to the I/O interface 1005 as necessary. A removable medium 1011 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 1010 as necessary, so that a computer program read out therefrom is mounted into the storage section 1008 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the 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 illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication part 1009 and/or installed from the removable medium 1011. The computer program executes the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 1001.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination 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 present invention, 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, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. 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 flowchart 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 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 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 described in the embodiments of the present invention may be implemented by software, or may be implemented by hardware. The described units or modules may also be provided in a processor, and may be described as: a processor comprises an instruction receiving module, a parameter acquiring module, a first group of single modules and a second group of single modules. Where the names of such units or modules do not in some cases constitute a limitation of the unit or module itself, for example, the instruction receiving module may also be described as "a module for receiving a group single instruction including a group single parameter and a group single parameter limit".
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 separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: receiving a group order instruction, wherein 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 a first subtask list set with a group list parameter value not greater than a group list parameter limit value, performing group list according to the group list parameter value and the group list parameter limit value corresponding to each first subtask list; and for each second subtask sheet in the second subtask sheet set with the group single parameter value larger than the group single parameter limit value, acquiring the group single parameter value of the storage position corresponding to the second subtask sheet, and performing group sheet according to the group single parameter value of the storage position and the group single parameter limit value.
According to the technical scheme of the embodiment of the invention, the group single instruction is received, and the group single instruction comprises a group single parameter and a group single parameter limit value; acquiring a group list parameter value corresponding to each subtask list; for a first subtask list set with a group list parameter value not greater than a group list parameter limit value, performing group list according to the group list parameter value and the group list parameter limit value corresponding to each first subtask list; for each second subtask sheet in the second subtask sheet set with the group sheet parameter value larger than the group sheet parameter limit value, the group sheet parameter value of the storage position corresponding to the second subtask sheet is obtained, and the technical means of group sheets is carried out according to the group sheet parameter value of the storage position and the group sheet parameter limit value, orders can be combined into different picking tasks according to money, and rechecking and packaging according to money after picking are facilitated, so that the purpose that goods can be finally received in a store according to money, the picking efficiency is optimal, the operation time is shortened, the operation efficiency is improved, and the purpose that the clothing goods can be rapidly circulated is achieved.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (10)

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;
acquiring a group list parameter value corresponding to each subtask list;
for a first subtask list set with a group list parameter value not greater than the group list parameter limit, performing group list according to the group list parameter value corresponding to each first subtask list and the group list parameter limit;
and for each second subtask sheet in the second subtask sheet set with the group single parameter value larger than the group single parameter limit value, acquiring the group single parameter value of the storage position corresponding to the second subtask sheet, and performing group ordering according to the group single parameter value of the storage position and the group single parameter limit value.
2. The method of claim 1, wherein performing a group order according to the group order parameter value and the group order parameter limit value corresponding to each first subtask order comprises:
taking out a first maximum value from the group list parameter value corresponding to each first subtask list;
taking out group single parameter values from group single parameter values corresponding to the first subtask single remaining after the first 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 first maximum value to obtain a first sum value when taking out one group single parameter value until the first sum value is larger than the group single parameter limit value;
combining first subtask units except the first subtask unit corresponding to the last taken unit parameter value in the first subtask unit corresponding to the first sum value into a task list;
and deleting the first subtask sheets combined into the task sheet from the first subtask sheet set to update the first subtask sheet set, and repeatedly executing the steps until each first subtask sheet is combined into the task sheet.
3. The method according to claim 1 or 2, wherein performing the grouping according to the group list parameter value corresponding to each first subtask list and the group list parameter limit value comprises:
performing first sequencing according to the size of the group list parameter value corresponding to each first subtask list;
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 performing judgment according to the second sum value;
if the second sum is larger than the group list parameter limit value, taking the first subtask list corresponding to the first maximum value as a combined task list;
if the second sum value is not greater than the group single parameter limit value, taking out the group single parameter values from the updated first sequencing result one by one according to the sequence from small to large, accumulating and summing the taken out group single parameter values and the second sum value to obtain a third sum value when taking out one group single parameter value, and combining the first subtasks except the first subtask corresponding to the finally taken out group single parameter value in the subtask corresponding to the third sum value into the task list until the third sum value is greater than the group single parameter limit value;
and deleting the first subtask sheets combined into the task sheet from the first subtask sheet set to update the first subtask sheet set, and repeatedly executing the steps until each first subtask sheet is combined into the task sheet.
4. The method of claim 1, wherein performing a group order according to the group order parameter value corresponding to the bin and the group order parameter limit value comprises:
taking out a second maximum value from the group single parameter value corresponding to each storage position;
taking out the group single parameter values from the group single parameter values left 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 when taking out one group single parameter value until the fourth sum value is larger than the group single parameter limit value;
combining the picking tasks of the storage positions except the storage position corresponding to the last taken out group order parameter value in the storage positions corresponding to the fourth sum value into a task order;
and deleting the storage positions corresponding to the picking tasks combined into the task list from the storage positions corresponding to the second subtask list to update the storage positions corresponding to the second subtask list, and repeatedly executing the steps until the picking tasks of each storage position are combined into the task list.
5. The method of claim 1 or 4, wherein performing group ordering according to the group order parameter value corresponding to the bin and the group order parameter limit value comprises:
performing second sorting according to the size of the single group parameter value corresponding to each storage position;
taking out a second maximum value and a second minimum value from a second sorting result, summing the second maximum value and the second minimum value 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 is larger than the group order parameter limit value, combining the picking tasks of the storage positions corresponding to the second maximum value into a task order;
if the fifth sum value is not larger than the group order parameter limit value, taking out the group order parameter values from the updated second sequencing result one by one according to the sequence from small to large, accumulating and summing the taken out group order parameter values and the fifth sum value to obtain a sixth sum value when taking out one group order parameter value until the sixth sum value is larger than the group order parameter limit value, and combining picking tasks of storage positions except the storage position corresponding to the last taken out group order parameter value in the storage positions corresponding to the sixth sum value into a task order;
and deleting the storage positions corresponding to the picking tasks combined into the task list from the storage positions corresponding to the second subtask list to update the storage positions corresponding to the second subtask list, and repeatedly executing the steps until the picking tasks of each storage position are combined into the task list.
6. The method of claim 1, further comprising, prior to performing a singleton based on a singleton parameter value of a bin and the singleton parameter limit:
and judging whether the group single parameter value of the storage position is greater than the group single parameter limit value, and if so, adjusting the group single parameter limit value.
7. The method of claim 1, wherein the set of singletons comprises: commodity volume, commodity weight and commodity quantity; and each subtask list corresponds to a task of a commodity.
8. An ordering apparatus, comprising:
the instruction receiving module is used for receiving a group order instruction, and the group order instruction comprises a group order parameter and a group order parameter limit value;
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 grouping a first subtask list set of which the group list parameter value is not larger than the group list parameter limit value according to the group list parameter value corresponding to each first subtask list and the group list parameter limit value;
and the second group list module is used for acquiring a group list parameter value of a storage position corresponding to the second subtask 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, and performing group list according to the group list parameter value of the storage position and the group list parameter limit value.
9. An electronic device for organizing, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-7.
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 true CN113822509A (en) 2021-12-21
CN113822509B 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
ETHAN MALINOWSKI 等: "Packaged gas supply chain planning with network-wide SKU rationalization", 《INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS》, vol. 204, pages 346 - 357 *
冯晓春 等: "基于学习效果的蔬菜电商成组拣货排序方法", 《系统工程理论与实践》, vol. 40, no. 2, pages 449 - 461 *
熊少杰: "A公司南京配送中心仓储管理优化研究", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》, vol. 2019, no. 9, pages 035 - 48 *

Also Published As

Publication number Publication date
CN113822509B (en) 2023-11-03

Similar Documents

Publication Publication Date Title
CN110197350B (en) Article delivery method and device
CN106875148B (en) Method and device for determining a storage position for an item
US20170039304A1 (en) Method and apparatus for providing pallet loading guide
CN110097414A (en) Order processing method and apparatus
CN110348771B (en) Method and device for order grouping of orders
CN108694637A (en) Order processing method, apparatus, server and storage medium
CN110197351A (en) A kind of article warehouse-out method and device
CN109961306B (en) Method and device for distributing inventory of articles
CN110390449A (en) Warehouse replenishing method and device
CN109961247A (en) A kind of generation method and device of article storage information
CN110751441A (en) Method and device for optimizing storage position in logistics storage system
CN111260270A (en) Method and device for improving order processing efficiency of store
CN114118888A (en) Order ex-warehouse method and device
CN109993470A (en) A kind of inventory&#39;s dispatching method and device
CN115660380B (en) Order processing method and device for picking goods to person
CN111507651A (en) Order data processing method and device applied to man-machine mixed warehouse
CN110304385A (en) A kind of warehouse restocking method and apparatus
CN113256193A (en) Warehouse commodity layout method and device
CN110689293A (en) Method and device for processing articles out of warehouse
CN112734329A (en) Warehouse goods picking shortest path calculation method, device, equipment and storage medium
CN112446652A (en) Method and device for processing task set
CN113822509B (en) Method and device for grouping sheets
CN116468521A (en) Method, device, equipment and storage medium for optimizing goods picking of goods picking personnel
CN112001664A (en) Method, device, equipment and storage medium for generating return task
CN111260271A (en) Method and device for shortening order picking time of store

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