CN110046776B - Method and device for determining object allocation amount - Google Patents

Method and device for determining object allocation amount Download PDF

Info

Publication number
CN110046776B
CN110046776B CN201810036923.0A CN201810036923A CN110046776B CN 110046776 B CN110046776 B CN 110046776B CN 201810036923 A CN201810036923 A CN 201810036923A CN 110046776 B CN110046776 B CN 110046776B
Authority
CN
China
Prior art keywords
allocation
amount
demand
current
determining
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
CN201810036923.0A
Other languages
Chinese (zh)
Other versions
CN110046776A (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 Century Trading Co Ltd
Beijing Jingdong Shangke Information Technology Co Ltd
Original Assignee
Beijing Jingdong Century Trading Co Ltd
Beijing Jingdong Shangke 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 Century Trading Co Ltd, Beijing Jingdong Shangke Information Technology Co Ltd filed Critical Beijing Jingdong Century Trading Co Ltd
Priority to CN201810036923.0A priority Critical patent/CN110046776B/en
Publication of CN110046776A publication Critical patent/CN110046776A/en
Application granted granted Critical
Publication of CN110046776B publication Critical patent/CN110046776B/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/06315—Needs-based resource requirements planning or analysis
    • 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

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Warehouses Or Storage Devices (AREA)

Abstract

The invention discloses a method and a device for determining an object allocation amount, and relates to the technical field of computers. One embodiment of the method comprises the following steps: for each object, determining a number of nested relationships containing the object; according to the number, sorting all objects from small to large; and calculating the allocation amount of each object according to the sequencing result, the allocation demand amount, the allocation availability amount and the group relationship of each object. According to the method and the device, the allocation quantity can be confirmed according to the group relation of the objects, the allocation demand quantity and the allocation availability quantity of the objects, so that the allocation demand quantity can be met, and the requirement of complete allocation can be met to the maximum extent. The problem that a plurality of suite products are not matched in all storehouses due to the fact that the configuration is carried out according to the actual demand in the prior art is solved, the blending efficiency of the suite products is improved, and the management of the products is facilitated.

Description

Method and device for determining object allocation amount
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method and apparatus for determining an allocation amount of an object.
Background
In managing products, which may need to be deployed between warehouses, for large products, there may be kits that need to be used in sets, such as a set of air conditioning products comprising an inner machine and an outer machine. For more than one product included in a set of kit products, the products have a set relationship with each other, e.g., the set relationship of the products in a kit product air conditioner is { inner machine: 1, outer machine: 1}. However, for kit products, there is often a mismatch between the products in the individual warehouses. For example, the air conditioner external unit purchased by the user fails, and further an application for replacing the external unit is provided, and after the verification is passed, an order for replacing the external unit is generated. If the spare part library corresponding to the order is not in stock, the stock is required to be allocated to an external machine. After this process, the warehouse is dispensed to produce a single item of the internal machine. The external machine replaced by the customer is stored in the spare part library, and a single product of the external machine is generated in the spare part library. At this time, the dispensing warehouse and the spare part warehouse are not matched with the suite products. For this case, it is necessary for a specialized person to periodically verify the stock of each warehouse, match it according to the stack relationship between products and other factors, and call the matched products to a place for further operations.
In the process of implementing the prior art, the inventor finds that at least the following problems exist in the prior art: when the products are distributed, the distribution is carried out according to the actual goods quantity, so that the problem that a plurality of suite products are not matched in each warehouse is caused, and the problem that the suite products are not matched can cause low product distribution efficiency and increase difficulty in product management.
Disclosure of Invention
In view of this, the embodiments of the present invention provide a method and an apparatus for determining an allocation amount of an object, which can confirm the allocation amount according to a group relationship of the object, an allocation demand amount of the object, and an allocation available amount, so that the allocation demand amount can be satisfied, and a requirement of complete allocation can be satisfied to the maximum extent.
To achieve the above object, according to one aspect of an embodiment of the present invention, there is provided a method of determining an amount of adjustment of an object.
The method for determining the allocation amount of the object in the embodiment of the invention comprises the following steps: for each object, determining a number of nested relationships containing the object; according to the number, sorting all objects from small to large; and calculating the allocation amount of each object according to the sequencing result, the allocation demand amount, the allocation availability amount and the group relationship of each object.
Optionally, the step of determining the number of the set of relationships in which each object is located includes: marking all the group relationships; for each object, storing a tag containing a set relationship for the object in a list of the object; and counting the marks of the group relationships in the list of each object, and determining the number of the group relationships where each object is located.
Optionally, the step of calculating the allocation amount of each object according to the result of the sorting and allocation demand amount, allocation availability amount and group relation of each object includes: traversing all objects in turn according to the sequencing result, and carrying out the following processing on each object: acquiring a reference set relation of a current processing object, a current allocation demand and a current allocation available quantity; the current allocation demand and the current allocation available quantity are the residual allocation demand and the residual allocation available quantity of the last processing object; determining the number of the demand kits of the current processing object according to the current allocation demand and the reference set relation; calculating the number of available kits of each object in the reference group relation according to the current allocation available amount and the reference group relation, and determining the number of available kits of the current processing object according to the calculation result; determining the number of driving suites of the current processing object according to the number of required suites and the number of available suites of the current processing object; determining a temporary adjustment amount according to the number of the driving assemblies and the reference group sleeve relation; and subtracting the temporary allocation amount from the current allocation demand amount and the current allocation available amount to obtain the residual allocation demand amount and the residual allocation available amount.
Optionally, after obtaining the remaining deployment demand and the remaining deployment availability, further comprising: comparing the value of the residual allocation demand quantity and the residual allocation available quantity of the current processing object, and taking the smaller value as the adjustment parameter of the current processing object; subtracting the adjustment parameter from the numerical value of the residual allocation demand and the residual allocation available quantity of the current processing object to obtain the adjusted residual allocation demand and the adjusted residual allocation available quantity; and adding the temporary allocation amount of the current processing object to the adjustment parameter to obtain an adjusted temporary allocation amount.
Optionally, before determining the number of the group relationships where each object is located according to the group relationships of the objects, the method further includes: and collecting the objects to be allocated according to the received object information, and acquiring the group relationship of the objects, the allocation demand and the allocation availability of the objects.
To achieve the above object, according to one aspect of the embodiments of the present invention, there is provided an apparatus for determining an amount of adjustment of an object.
The device for determining the adjustment amount of the object in the embodiment of the invention comprises the following steps: a determining module for determining, for each object, a number of nested relationships containing the object; the sorting module is used for sorting all objects from small to large according to the number; and the calculation module is used for calculating the allocation quantity of each object according to the sequencing result, the allocation demand quantity, the allocation available quantity and the group relation of each object.
Optionally, the determining module is further configured to flag all the stack relationships; for each object, storing a tag of the set relationship in which the object is located in a list of the object; and counting the marks of the group relationships in the list of each object, and determining the number of the group relationships where each object is located.
Optionally, the computing module is further configured to traverse all objects in turn according to the ordered result, and for each object, perform the following processing: acquiring a reference set relation of a current processing object, a current allocation demand and a current allocation available quantity; the current allocation demand and the current allocation available quantity are the residual allocation demand and the residual allocation available quantity of the last processing object; determining the number of the demand kits of the current processing object according to the current allocation demand and the reference set relation; calculating the number of available kits of each object in the reference group relation according to the current allocation available amount and the reference group relation, and determining the number of available kits of the current processing object according to the calculation result; determining the number of driving suites of the current processing object according to the number of required suites and the number of available suites of the current processing object; determining a temporary adjustment amount according to the number of the driving assemblies and the reference group sleeve relation; and subtracting the temporary allocation amount from the current allocation demand amount and the current allocation available amount to obtain the residual allocation demand amount and the residual allocation available amount.
Optionally, the calculation module is further configured to compare the value of the remaining allocation demand and the remaining allocation available of the current processing object, and take the smaller value as the adjustment parameter of the current processing object; subtracting the adjustment parameter from the numerical value of the residual allocation demand and the residual allocation available quantity of the current processing object to obtain the adjusted residual allocation demand and the adjusted residual allocation available quantity; and adding the temporary allocation amount of the current processing object to the adjustment parameter to obtain an adjusted temporary allocation amount.
Optionally, the device for determining the allocation amount of the object according to the embodiment of the present invention further includes an aggregation module, configured to aggregate the object to be allocated according to the received object information, and obtain a set relationship of the object, an allocation demand and an allocation availability of the object.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided an electronic device that determines an adjustment amount of an object.
The electronic device for determining the adjustment amount of the object in the embodiment of the invention comprises: one or more processors; and a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method of determining an amount of object allocation of any of the above.
To achieve the above object, according to an aspect of the embodiments of the present invention, there is provided a computer readable medium having stored thereon a computer program, characterized in that the program, when executed by a processor, implements the method of determining an adjustment amount of an object of any one of the above.
One embodiment of the above invention has the following advantages or benefits: the allocation quantity can be confirmed according to the group relation of the objects, the allocation demand quantity and the allocation availability quantity of the objects, so that the allocation demand quantity can be met, and the requirement of complete allocation can be met to the maximum extent. The problem that a plurality of suite products are not matched in all storehouses due to the fact that the configuration is carried out according to the actual demand in the prior art is solved, the blending efficiency of the suite products is improved, and the management of the products is facilitated.
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 flow of a method of determining an amount of an object allocation according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a method of determining a blending quantity of a product object according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of the main modules of an apparatus for determining the amount of an object to be dispensed according to an embodiment of the present invention;
FIG. 4 is an exemplary system architecture diagram in which embodiments of the present invention may be applied;
fig. 5 is a schematic diagram of a computer system suitable for use in implementing an embodiment of the 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.
Fig. 1 is a schematic diagram of a main flow of a method for determining an adjustment amount of an object according to an embodiment of the present invention, and as shown in fig. 1, the method for determining an adjustment amount of an object according to an embodiment of the present invention mainly includes:
Step S101: for each object, a number of nested relationships containing the object is determined. Each set of relationships includes at least two objects, and an object may be in several sets of relationships. In the process, marking all the group relationships; for each object, storing the tag containing the set of relationships for that object in the list of objects; and counting the storage marks in the list of each object, and further determining the number of the group relationships where each object is located. Before the step is carried out, the objects to be allocated are summarized according to the received object information, and the group relation of the objects, the allocation demand and allocation availability of the objects are obtained. The object information includes objects to be deployed, and after the objects to be deployed are summarized, a set relationship of the objects can be obtained according to the objects. The object information may further include a blending requirement amount of the objects, where the blending requirement amount is the number of objects that are required to be blended in the blending warehouse, and the blending available amount of the objects to be blended, that is, the number of objects that can be blended in the blending warehouse, is obtained according to the stored record data of the blending warehouse.
Step S102: all objects are ordered from small to large by this number. In the process, all the objects are ordered from small to large according to the number of the group relationships of each object, and then when the allocation quantity of the objects is calculated, the objects with less group relationships are preferentially processed according to the ordered results, so that the calculated results are more accurate, and the calculation process can be simplified.
Step S103: and calculating the allocation amount of each object according to the sequencing result, the allocation demand amount, the allocation availability amount and the group relation of each object. Specifically, all objects are traversed in turn according to the ordered result, and the following processing is performed for each object: acquiring a reference set relation of a current processing object, a current allocation demand and a current allocation available quantity; the current allocation demand and the current allocation available quantity are the residual allocation demand and the residual allocation available quantity of the last processing object; determining the number of the required kits of the current processing object according to the current allocation demand and the reference kit relation; calculating the number of available kits of each object in the reference set relation according to the current allocation available amount and the reference set relation, and determining the number of available kits of the current processing object according to the calculation result; determining the number of driving suites of the current processing object according to the number of required suites and the number of available suites of the current processing object; determining temporary allocation amount according to the number of the driving kits and the reference kit relation; and respectively subtracting the temporary allocation amount from the current allocation demand amount and the current allocation available amount to obtain the residual allocation demand amount and the residual allocation available amount. After traversing all the objects, the temporary allocation determined by processing the last object is the final allocation. After the final blending amount is determined, the blending library blends the object into the blending library according to the blending amount. The allocation quantity determined through the process is carried out based on the allocation available quantity and allocation demand quantity of all objects and the group relation among the objects, so that the allocation quantity can meet the demand quantity of goods and the requirement of the group allocation to the maximum extent.
Comparing the value of the residual allocation demand quantity and the residual allocation available quantity of the current processing object, and taking the smaller value as the adjustment parameter of the current processing object; subtracting the adjustment parameters from the values of the residual allocation demand and the residual allocation availability of the current processing object to obtain adjusted residual allocation demand and residual allocation availability; and adding the temporary allocation amount of the current processing object to the adjustment parameters to obtain the adjusted temporary allocation amount. Through the process, the determined blending amount can be more accurate.
In a delivery system, to meet the production of a dispensable suspension order in an order system, it is necessary to dispense from within another warehouse to the warehouse where the tentative order is located. The merchandise in the order may be any merchandise in a mall such as books, department stores, 3C, large merchandise, etc. Whereas large items exist as a suite of items, such as a suite of air conditioning items comprising an inner (main) and an outer (accessory). Such a kit commodity may have a case where the number of main products and the number of accessory products are not matched after the suspension order is assembled. For example, if a customer purchases an air-conditioning commodity, the external machine fails, an application for replacing the external machine is provided, and after the verification is passed, an order for replacing the external machine is generated. If the warehouse is not in stock, a pause order of 1 out-of-service machine is generated. If the internal distribution is carried out according to the actual required goods quantity, after the internal distribution is finished, a single product of an internal machine is produced after the internal distribution is carried out in a warehouse. The bad external machine that is replaced back to the customer will enter the spare part library where a single product of the external machine will be produced. After the single products are produced, special personnel are required to process regularly, the stock of each warehouse is verified, matching is carried out, and subsequent sales, return and other operations are carried out after the matching is carried out, so that a great deal of manpower is consumed. If the whole distribution is changed, the process flow is as follows. First, a set of outer and inner machines is dispensed from a warehouse with goods to a warehouse with goods. At this time, after the prepared warehouse is finished with goods, no single product is present. After receiving goods, the goods warehouse needs to produce an order for changing the external machine, the received external machine is distributed to the customer, an order is automatically generated, and the newly received internal machine is sent to the spare part warehouse. The external machine that is swapped back from the customer will also enter the spare parts library. So after the whole process is finished, no single product is dispensed from the warehouse, the warehouse for goods and spare parts. If the internal distribution is carried out according to the actual cargo quantity, a plurality of inconveniences are brought to the site and operation management during the internal distribution. For example, after the suspension orders are summarized, the air-conditioning commodities with the suite proportion relationship of 1:1 need 3 hosts and 5 external machines in a warehouse where the suspension orders are located, and the suspension orders are not in complete 3 sets or 5 sets. Therefore, in order to reduce the unmatched number of main accessories, and improve the inventory management level, it is required to control the main accessories during the warehouse-in and warehouse-out operation, so that the main accessories can be integrally and uniformly accessed according to the suite relationship as much as possible.
Taking a product object as an example to describe the method for determining the allocation amount of the object of the present invention, fig. 2 is a schematic diagram of a method for determining the allocation amount of the product object according to an embodiment of the present invention. According to the method for determining the blending amount of the product object, the blending amount of the product to be blended is determined, and then the product is blended from the blending warehouse to the blending warehouse according to the blending amount. The allocation demand of the product object is the goods demand of the product allocation warehouse, and the allocation available quantity of the product object is the goods supply quantity of the product allocation warehouse.
As shown in fig. 2, a method for determining a blending amount of a product object according to an embodiment of the present invention includes:
Step S201: and summarizing the required products (sku) and the required and supplied amount of each product. For example, the required sku for the warehouse is A, B, C and D, and the total demand for A, B, C and D is determined to be 5, 12, 15, and 2, respectively, { A:5, B:12, C:15, D:2}. For A, B, C and D, the delivery volumes for the warehouse are: 5. 20, 12 and 2, i.e., { A:5, B:20, C:12, D:2}.
Step S202: for each sku, a set of relationships (suit) for the sku is determined, and suit for the sku is stored in the list (suitList) of objects. After the above procedure, suitList for all skus were obtained, suitList for all skus were stored in Map to obtain suitMap, and key for this suitMap was sku and value was suitList for this sku, i.e. suitList was obtained by sku. Moreover, the correlation of sku with this suit is reflected by the priority of suit, and then the priority of suit in suitList can be set so that suit obtained by sku is suit with the greatest correlation with this sku.
Step S202 is to perform a loop process on all the obtained skus, for example, four of the obtained skus are A, B, C and D, and suit are { A:1, B:2, C:3} and { D:2, B:2}, respectively, as indicated by suit and suit. Initially suitMap, no element is found, and the value found according to the sku is null. The treatment of sku a may be performed first: according to the acquired stack relation of suit a, suit is taken as an element of list and is respectively stored in the list of A, B, C. Wherein, the list execution code of the suit to the A, B, C in suitMap is:
suitMap.put(A,[suit1])；
suitMap.put(B,[suit1])；
suitMap.put(C,[suit1])。
after the completion of the sku A processing, the data stored in suitMap are { A: [ suit ] B: [ suit ] C: [ suit ] data.
Suit obtained from sku B is { D:2, B:2}, at which time suit2 is added to the list of B and D in suitMap. For sku B, a list for B may be determined from sku B in suitMap, traversed to determine that there is no equivalent set relationship to suit2, and suit2 added to the list. Since the priority of B's nest relationship may be set, suit's 2 acquired according to B may be the nest relationship with the greatest correlation with B, so it may be inserted into the first bit of B's suitList as the first element. For D, which does not have a value in suitMap, suit2 is added directly to the list of D in suitMap. Through the above process, the data stored in suitMap are { A: [ suit1], B: [ suit, suit1], C: [ suit1], D: [ suit2] }.
The obtained set relationship from sku C is still suit1, and sku in suit is A, B and C. By processing A, B, C one by one, it can be determined that suit1 is already present in the list of A, B, C in suitMap. Also suit is the first element of list of C, so after the process is completed, { A: [ suit ] 1, B: [ suit2, suit1], C: [ suit1], D: [ suit2] are stored in suitMap.
The obtained set of relationships from sku D is still suit2, which by the above procedure already exists in the list corresponding to B, D in suitMap. Furthermore, suit is the first element of D corresponding to list, so after the process is completed, { A: [ suit ] B: [ suit2, suit1], C: [ suit ] 1, D: [ suit2] are stored in suitMap.
Step S203: ordering is performed from small to large according to the number suit of the sku. For example, the data stored in suitMap are { A: [ suit1], B: [ suit, suit1], C: [ suit ], D: [ suit2] }, and it is known that the number of suit where A, C, D is located is 1, and the number of suit where B is located is 2, so that the result after sorting is [ { A: [ suit1] }, { C: [ suit1] }, { D: [ suit2] }, { B: [ suit, suit1] } ], where the number of suit where A, C, D is located is the same, and the sorting can be randomly performed. The specific implementation is as follows: all entries in suitMap are placed in a list ENTRYLIST and sorted in positive order of size of suitList in the value of each entry. For { A: [ suit ] 1, B: [ suit2, suit1], C: [ suit ] 1, D: [ suit2] }, suitList of A, C, D had a size of 1, and suitList of B had a size of 2.
Step S204: according to the result of the sorting, the amount of adjustment is calculated for each sku according to the amount of demand and the amount of supply. The method specifically comprises the following steps:
S204a: the first suit of the currently processed sku in suitList is obtained as a reference set of relationships for that sku. The quantity of the required quantity kit of the sku is calculated according to the required quantity of the sku and the quantity of the required quantity kit in the reference kit relation. For example, currently processed is sku a, which suitList is [ suit1], then its reference set relationship is suit (if currently processed is sku B, which suitList is [ suit2, suit1], then the reference set relationship for B is suit 2). suit1 is specifically { A:1, B:2, C:3}, the number of A in the reference stack relationship is 1, and the required amount of A is 5 as determined in step S201, and the quotient of the required amount and the number of A in the reference stack relationship is rounded up to obtain the required amount kit number of A, namely Sleeve (calculation result rounded up). If the reference stack relationship of A is { A:3, B:2, C:1}, the number of A in the reference stack relationship is 3, and if the demand of A is 5, the determined quantity of the demand packages of A is/>, in order to satisfy the demand of A Sleeve (calculation result rounded up).
S204b: for each sku in the reference stack relationship, the available set number of each sku is calculated according to the supply quantity and the quantity in the reference stack relationship, the calculation result is rounded down, and the minimum value of the required quantity set number of the sku in the reference stack relationship is taken as the available set number of the sku currently processed. For example, for A, B, C in the reference stack relationship { A:1, B:2, C:3}, the supply quantity is determined to be { A:5, B:20, C:12, D:2}, and the number of available stacks for A isThe number of available kits of B is/>The number of available kits of C is/>Taking its minimum value of 4 as the number of available suites for the currently processed sku.
S204c: comparing the quantity of the required goods quantity sets obtained in the process with the quantity of the available sets, and taking the smaller value as the current driving set quantity. For example, if the quantity of required packages of a is 5 and the quantity of available packages is 4 in S204a and S204b, then 4 is taken as the current driving package quantity.
S204d: according to the obtained current driving suite quantity and the current processed reference suite relation, calculating the temporary allocation quantity of each sku in the reference suite relation, and deducting the temporary allocation quantity from the required goods quantity and the supplied goods quantity to obtain the residual required goods quantity and the residual supplied goods quantity. For example, for the currently processed reference set relationship { A:1, B:2, C:3}, the determined temporary allocation for the current number of drive sets of 4, A, B, C is { A:4, B:8, C:12}. The initial demand is { A:5, B:12, C:15, D:2}, the supply is { A:5, B:20, C:12, D:2}, the temporary allocation { A:4, B:8, C:12} is deducted, the remaining demand is { A:1, B:4, C:3, D:2}, and the remaining supply becomes { A:1, B:12, C:0, D:2}.
S204e: comparing the residual cargo demand and the residual cargo supply of the current processing sku, and taking the smaller value as the adjustment parameter of the current processing sku. For example, if the remaining required amount of a determined in S204d is 1, the remaining supply amount is 1, and the remaining required amount is equal to the remaining supply amount, the value of the remaining required amount or the remaining supply amount is arbitrarily taken as the adjustment parameter, and the adjustment parameter of the sku is determined to be 1.
S204f: and adding the current quantity of the skus in the temporary allocation quantity to the adjustment parameters of the skus, and subtracting the adjustment parameters of the skus from the current quantity of the skus in the determined residual cargo quantity and the residual cargo supply quantity. For example, the temporary allocation amount determined in S204d is { a:4, b:8, c:12}, the remaining required amount { a:1, b:4, c:3, d:2}, the remaining required amount { a:1, b:12, c:0, d:2}, and the adjustment parameter of the current processed a is 1 in S204e, the number of a in the temporary allocation amount is increased by 1, the number of a in the remaining required amount is decreased by 1, and the number of a in the remaining required amount is decreased by 1, so as to obtain the adjusted temporary allocation amount, remaining required amount, and remaining required amount { a:5, b:8, c:12}, { a:0, b:4, c:3, d:2} and { a:0, b:12, c:0, d:2}, respectively.
In the above embodiment, the initial demand is { A:5, B:12, C:15, D:2}, the initial supply is { A:5, B:20, C:12, D:2}, the product has a stack relationship of { A:1, B:2, C:3} and { D:2, B:2}, the products are sorted according to the above step S203, and the sorting result is A, C, D, B, and then A, C, D, B is sequentially processed.
Firstly, obtaining the current reference group relation { A:1, B:2, C:3}, the required goods amount { A:5, B:12, C:15, D:2}, and the supplied goods amount { A:5, B:20, C:12, D:2}, according to the sku A. The number of A in the reference stack relationship is 1, and the required amount of A is 5, the required amount kit number isA. b, C in the current reference stack relationship is 1,2, 3, a, B, C are 5, 20, 12, respectively, then the number of available packages of a is/>And determining the quantity required kit quantity 5 and the quantity available kit quantity 4, wherein the current driving kit quantity is min (5, 4) =4. On the premise that the number of the current driving suite is not 0, the number of the front driving suite is multiplied by A, B, C in the current reference suite relationship to determine temporary allocation amount, and the temporary allocation amount is { A:4, B:8, C:12}. Subtracting the temporary allocation amount from the required amount to obtain the residual required amount { A:1, B:4, C:3, D:2}. Subtracting the temporary allocation amount from the supply amount to obtain the residual supply amount { A:1, B:12, C:0, D:2}. For the currently processed A, the residual cargo supply and the residual cargo demand are both 1, and the current adjustment parameter is 1. Adding 1 to the temporary allocation amount of A, subtracting 1 from the residual demand amount and residual supply amount of A, and obtaining adjusted temporary allocation amounts { A:5, B:8, C:12}, the residual demand amount becoming { A:0, B:4, C:3, D:2} and the residual supply amount becoming { A:0, B:12, C:0, D:2}.
After the processing of the A is completed, the processing of the C is carried out according to the sequencing result. Obtaining the current reference stack relation { A:1, B:2, C:3} according to the sku C, and obtaining the remaining cargo demand { A:0, B:4, C:3, D:2} of the previous operation, the remaining cargo supply { A:0, B:12, C:0, D:2} and the temporary allocation { A:5, B:8, C:12}. The number of C in the current reference pallet relationship { A:1, B:2, C:3} is 3, and the amount of C required is 3 as determined by the remaining required amounts { A:0, B:4, C:3, D:2}, the required amount pallet kit number isA. B, C the number of current reference set relationships { A:1, B:2, C:3} are 1,2, 3, respectively, and the supply of A, B, C is 0, 12, 0, respectively, as determined by the remaining supply amounts { A:0, B:12, C:0, D:2}, the number of available sets of C isAnd determining the quantity of required packages 1 and the quantity of available packages 0, wherein the current driving package quantity is min (1, 0) =0. The number of the current driving kits is 0, the temporary allocation amount is unchanged, the remaining goods amount is unchanged { A:5, B:8, C:12}, the remaining goods amount is unchanged { A:0, B:4, C:3, D:2}, the remaining goods amount is unchanged, and the remaining goods amount is changed, and the remaining goods amount is { A:0, B:12, C:0, D:2}. For the current processed C, the residual cargo supply and the residual cargo demand are both 0, and the current adjustment parameter is 0. The current adjustment parameter is 0, the temporary adjustment amount is unchanged, the remaining goods amount is unchanged { A:5, B:8, C:12}, the remaining goods amount is unchanged { A:0, B:4, C:3, D:2}, the remaining goods amount is unchanged { A:0, B:12, C:0, D:2}.
After the processing of C is completed, the processing of D is carried out according to the sequencing result. Obtaining the current reference stack relation as { D:2, B:2}, and obtaining the residual demand { A:0, B:4, C:3, D:2} of the previous operation, the residual supply { A:0, B:12, C:0, D:2} and the temporary allocation { A:5, B:8, C:12}. D is 2 in the current reference pallet relationship { D:2, B:2}, and the D's pallet size is 2 as known by the remaining pallet sizes { A:0, B:4, C:3, D:2}, the pallet size kit number isB. The number of D in the current reference set relation { D:2, B:2} is 2 and 2 respectively, and the supply of B, D is 12 and 2 respectively as known from the remaining supply amounts { A:0, B:12, C:0, D:2}, the number of available sets of C is/> And determining the quantity required kit quantity 1 and the available kit quantity 1, wherein the current driving kit quantity is min (1, 1) =1. The current drive-set number is 1, and the previous drive-set number is multiplied by B, D in the current reference-set relationship, respectively, and added to the temporary allocation determined in the operation above, and the temporary allocation becomes { A:5, B:10, C:12, D:2}, if the other products A, C are unchanged. Subtracting the temporary allocation amount from the required amount { A:5, B:12, C:15, D:2} to obtain the remaining required amount { A:0, B:2, C:3, D:0}. Subtracting the temporary adjustment amount from the supply amount { A:5, B:20, C:12, D:2} to obtain the remaining supply amount { A:0, B:10, C:0, D:0}. For the current process D, the remaining supply and demand are both 0, and the current adjustment parameter is 0. The temporary allocation determined in this step becomes { A:5, B:10, C:12, D:2}, the remaining inventory amounts are { A:0, B:2, C:3, D:0}, and the remaining inventory amounts are { A:0, B:10, C:0, D:0}.
After the treatment of D is completed, the treatment of B is carried out according to the ordered result. According to the sky D, the current reference stack relation is { D:2, B:2}, the remaining goods quantity { A:0, B:2, C:3, D:0} of the previous operation, the remaining goods quantity { A:0, B:10, C:0, D:0} and the temporary allocation quantity { A:5, B:10, C:12, D:2} are obtained. B is 2 in the current reference pallet relationship { D:2, B:2}, and the current pallet demand of B is 2 as known by the remaining pallet demand { A:0, B:2, C:3, D:0}, the pallet demand kit quantity isB. The number of D in the current reference group relation { D:2, B:2} is 2 and 2 respectively, and the current supply amount of B, D is 10 and 0 respectively as known from the residual supply amounts { A:0, B:10, C:0 and D:0}, the number of available groups of C is/> And determining the quantity of required packages 1 and the quantity of available packages 0, wherein the current driving package quantity is min (1, 0) =0. The number of the current driving kits is 0, the temporary allocation amount is unchanged, the remaining cargo demand is unchanged, the remaining cargo supply is unchanged, and the remaining cargo supply is unchanged, the remaining cargo demand is changed, and the remaining cargo demand is changed, wherein the remaining cargo demand is changed, and the remaining cargo demand is changed. For the current processing B, the remaining supply amount is 2 and the remaining demand amount is 10, and the current adjustment parameter is 2 with a smaller value as the current adjustment parameter. Adding 2 to the temporary allocation amount of B, subtracting 2 from the residual cargo demand and residual cargo supply of B, and obtaining adjusted temporary allocation amounts { A:5, B:12, C:12, D:2}, residual cargo demand { A:0, B:0, C:3, D:0}, residual cargo supply { A:0, B:8, C:0, D:0}.
After traversing all objects, determining that the final allocation is { A:5, B:12, C:12, D:2}, the allocation library may allocate the product A, B, C, D to the allocation library according to the allocation. According to the technical scheme provided by the embodiment of the invention, the allocation quantity can be confirmed according to the group relation of the objects, the allocation demand quantity of the objects and the allocation available quantity, so that the allocation demand quantity can be met, and the requirement of complete allocation can be met to the maximum extent. The problem that a plurality of suite products are not matched in all storehouses due to the fact that the configuration is carried out according to the actual demand in the prior art is solved, the blending efficiency of the suite products is improved, and the management of the products is facilitated.
Fig. 3 is a schematic diagram of main modules of an apparatus for determining an amount of an object to be adjusted according to an embodiment of the present invention, as shown in fig. 3, an apparatus 300 for determining an amount of an object to be adjusted according to an embodiment of the present invention mainly includes:
A determining module 301 is configured to determine, for each object, a number of nesting relationships that include the object. The determining module 301 is further configured to mark all the set of relationships; for each object, storing a tag containing a set relationship for the object in a list of the object; and counting the marks of the group relationships in the list of each object, and determining the number of the group relationships where each object is located.
A sorting module 302, configured to sort all objects from small to large according to the number. The calculation module 302 is further configured to traverse all objects in turn according to the ordered result, and perform the following processing for each object: acquiring a reference set relation of a current processing object, a current allocation demand and a current allocation available quantity; the current allocation demand and the current allocation available quantity are the residual allocation demand and the residual allocation available quantity of the last processing object; determining the number of the required kits of the current processing object according to the current allocation demand and the reference kit relation; calculating the number of available kits of each object in the reference set relation according to the current allocation available amount and the reference set relation, and determining the number of available kits of the current processing object according to the calculation result; determining the number of driving suites of the current processing object according to the number of required suites and the number of available suites of the current processing object; determining temporary allocation amount according to the number of the driving kits and the reference kit relation; and respectively subtracting the temporary allocation amount from the current allocation demand amount and the current allocation available amount to obtain the residual allocation demand amount and the residual allocation available amount. The calculation module 302 is further configured to compare the value of the remaining allocation demand and the remaining allocation available of the current processing object, and take the smaller value as the adjustment parameter of the current processing object; subtracting the adjustment parameters from the values of the residual allocation demand and the residual allocation availability of the current processing object to obtain adjusted residual allocation demand and residual allocation availability; and adding the temporary allocation amount of the current processing object to the adjustment parameters to obtain the adjusted temporary allocation amount.
The calculating module 303 is configured to calculate the allocation amount of each object according to the ordering result and the allocation requirement amount, allocation availability amount and the stack relationship of each object.
The device for determining the allocation amount of the object further comprises an aggregation module, wherein the aggregation module is used for aggregating the object to be allocated according to the received object information, and acquiring the group relationship of the object, the allocation demand and the allocation available amount of the object.
According to the technical scheme of the embodiment of the invention, after traversing all the objects, determining the final allocation amount, and allocating the objects to the allocation warehouse according to the allocation amount. The allocation quantity can be confirmed according to the group relation of the objects, the allocation demand quantity and the allocation availability quantity of the objects, so that the allocation demand quantity can be met, and the requirement of complete allocation can be met to the maximum extent. The problem that a plurality of suite products are not matched in all storehouses due to the fact that the configuration is carried out according to the actual demand in the prior art is solved, the blending efficiency of the suite products is improved, and the management of the products is facilitated.
Fig. 4 illustrates an exemplary system architecture 400 of a method of determining an amount of a subject or an apparatus of determining an amount of a subject to be adjusted to which embodiments of the invention may be applied.
As shown in fig. 4, the system architecture 400 may include terminal devices 401, 402, 403, a network 404, and a server 405. The network 404 is used as a medium to provide communication links between the terminal devices 401, 402, 403 and the server 405. The network 404 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
A user may interact with the server 405 via the network 404 using the terminal devices 401, 402, 403 to receive or send messages or the like. Various communication client applications, such as shopping class applications, web browser applications, search class applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only) may be installed on the terminal devices 401, 402, 403.
The terminal devices 401, 402, 403 may be various 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 405 may be a server providing various services, such as a background management server (by way of example only) providing support for shopping-type websites browsed by users using the terminal devices 401, 402, 403. The background management server can analyze and other data of the received product information inquiry request and feed back the processing result to the terminal equipment.
It should be noted that, the method for determining the amount of the object to be adjusted according to the embodiment of the present invention is generally performed by the server 405, and accordingly, the device for determining the amount of the object to be adjusted is generally disposed in the server 405.
It should be understood that the number of terminal devices, networks and servers in fig. 4 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 5, there is illustrated a schematic diagram of a computer system 500 suitable for use in implementing an embodiment of the present invention. The terminal device shown in fig. 5 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiment of the present invention.
As shown in fig. 5, the computer system 500 includes a Central Processing Unit (CPU) 501, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the system 500 are also stored. The CPU501, ROM 502, and RAM 503 are connected to each other through a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input section 506 including a keyboard, a mouse, and the like; an output portion 507 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The drive 510 is also connected to the I/O interface 505 as needed. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as needed so that a computer program read therefrom is mounted into the storage section 508 as needed.
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 509, and/or installed from the removable media 511. 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) 501.
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 logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams 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 modules involved in the embodiments of the present invention may be implemented in software or in hardware. The described modules may also be provided in a processor, for example, as: a processor includes a determination module, a ranking module, and a calculation module. Where the names of the modules do not constitute a limitation on the module itself in some cases, for example, the determination module may also be described as "a module that determines the number of nested relationships in which each object is located".
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: determining the number of the set of relationships in which each object is located; according to the number, sorting all objects from small to large; and calculating the allocation amount of each object according to the sequencing result, the allocation demand amount, the allocation availability amount and the group relationship of each object.
According to the technical scheme provided by the embodiment of the invention, the allocation quantity can be confirmed according to the group relation of the objects, the allocation demand quantity of the objects and the allocation available quantity, so that the allocation demand quantity can be met, and the requirement of complete allocation can be met to the maximum extent. The problem that a plurality of suite products are not matched in all storehouses due to the fact that the configuration is carried out according to the actual demand in the prior art is solved, the blending efficiency of the suite products is improved, and the management of the products is facilitated.
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 (10)

1. A method of determining an amount of an object to be dispensed, comprising:
For each object, determining a number of nested relationships containing the object;
according to the number, sorting all objects from small to large;
Calculating the allocation amount of each object according to the sequencing result and the allocation demand amount, allocation availability amount and group relation of each object, wherein the method comprises the following steps: traversing all objects in turn according to the sequencing result, and carrying out the following processing on each object:
acquiring a reference set relation of a current processing object, a current allocation demand and a current allocation available quantity; the current allocation demand and the current allocation available quantity are the residual allocation demand and the residual allocation available quantity of the last processing object;
determining the number of the demand kits of the current processing object according to the current allocation demand and the reference set relation;
Calculating the number of available kits of each object in the reference group relation according to the current allocation available amount and the reference group relation, and determining the number of available kits of the current processing object according to the calculation result;
Determining the number of driving suites of the current processing object according to the number of required suites and the number of available suites of the current processing object;
determining a temporary adjustment amount according to the number of the driving assemblies and the reference group sleeve relation;
And subtracting the temporary allocation amount from the current allocation demand amount and the current allocation available amount to obtain the residual allocation demand amount and the residual allocation available amount.
2. The method of claim 1, wherein the step of determining the number of nested relationships in which each object is located comprises:
Marking all the group relationships;
For each object, storing a tag containing a set relationship for the object in a list of the object;
And counting the marks of the group relationships in the list of each object, and determining the number of the group relationships where each object is located.
3. The method of claim 1, further comprising, after obtaining the remaining deployment demand and the remaining deployment availability:
comparing the value of the residual allocation demand quantity and the residual allocation available quantity of the current processing object, and taking the smaller value as the adjustment parameter of the current processing object;
Subtracting the adjustment parameter from the numerical value of the residual allocation demand and the residual allocation available quantity of the current processing object to obtain the adjusted residual allocation demand and the adjusted residual allocation available quantity;
And adding the temporary allocation amount of the current processing object to the adjustment parameter to obtain an adjusted temporary allocation amount.
4. The method of claim 1, further comprising, prior to determining the number of nested relationships in which each object is located based on the nested relationships of the objects:
summarizing objects to be deployed according to the received object information, and
And acquiring the set relationship of the objects and the allocation demand and allocation availability of the objects.
5. An apparatus for determining an amount of an object to be dispensed, comprising:
A determining module for determining, for each object, a number of nested relationships containing the object;
The sorting module is used for sorting all objects from small to large according to the number;
the calculation module is used for calculating the allocation quantity of each object according to the sequencing result, the allocation demand quantity, the allocation available quantity and the group sleeve relation of each object;
The computing module is further used for traversing all objects in turn according to the sequencing result, and carrying out the following processing on each object: acquiring a reference set relation of a current processing object, a current allocation demand and a current allocation available quantity; the current allocation demand and the current allocation available quantity are the residual allocation demand and the residual allocation available quantity of the last processing object; determining the number of the demand kits of the current processing object according to the current allocation demand and the reference set relation; calculating the number of available kits of each object in the reference group relation according to the current allocation available amount and the reference group relation, and determining the number of available kits of the current processing object according to the calculation result; determining the number of driving suites of the current processing object according to the number of required suites and the number of available suites of the current processing object; determining a temporary adjustment amount according to the number of the driving assemblies and the reference group sleeve relation; and subtracting the temporary allocation amount from the current allocation demand amount and the current allocation available amount to obtain the residual allocation demand amount and the residual allocation available amount.
6. The apparatus of claim 5, wherein the determination module is further configured to flag all of the set of relationships; for each object, storing a tag containing a set relationship for the object in a list of the object; and counting the marks of the group relationships in the list of each object, and determining the number of the group relationships where each object is located.
7. The apparatus of claim 5, wherein the computing module is further configured to compare a value of a remaining allocation demand and a remaining allocation availability of the current processing object, and take a smaller value as the adjustment parameter of the current processing object; subtracting the adjustment parameter from the numerical value of the residual allocation demand and the residual allocation available quantity of the current processing object to obtain the adjusted residual allocation demand and the adjusted residual allocation available quantity; and adding the temporary allocation amount of the current processing object to the adjustment parameter to obtain an adjusted temporary allocation amount.
8. The apparatus of claim 5, further comprising a summarizing module configured to summarize objects to be deployed according to the received object information, and obtain a nesting relationship of the objects and a deployment demand and a deployment availability of the objects.
9. An electronic device for determining an amount of an object to be dispensed, 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-4.
10. 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-4.
CN201810036923.0A 2018-01-15 2018-01-15 Method and device for determining object allocation amount Active CN110046776B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810036923.0A CN110046776B (en) 2018-01-15 2018-01-15 Method and device for determining object allocation amount

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810036923.0A CN110046776B (en) 2018-01-15 2018-01-15 Method and device for determining object allocation amount

Publications (2)

Publication Number Publication Date
CN110046776A CN110046776A (en) 2019-07-23
CN110046776B true CN110046776B (en) 2024-06-18

Family

ID=67272801

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810036923.0A Active CN110046776B (en) 2018-01-15 2018-01-15 Method and device for determining object allocation amount

Country Status (1)

Country Link
CN (1) CN110046776B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113780917B (en) * 2020-11-30 2023-11-03 北京京东振世信息技术有限公司 Cargo scheduling method and system

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107464177A (en) * 2017-08-23 2017-12-12 北京惠赢天下网络技术有限公司 The processing method and order processing server of a kind of order

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080071840A1 (en) * 2006-09-14 2008-03-20 Viswanath Srikanth Introducing Multi-Level Nested Kits Into Existing E-Commerce Systems
CN106779897B (en) * 2015-11-23 2020-10-27 菜鸟智能物流控股有限公司 Method and device for processing transaction information of combined commodity object
CN107545381B (en) * 2016-06-24 2021-02-26 北京京东振世信息技术有限公司 Method for managing warehouse inventory and warehouse management system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107464177A (en) * 2017-08-23 2017-12-12 北京惠赢天下网络技术有限公司 The processing method and order processing server of a kind of order

Also Published As

Publication number Publication date
CN110046776A (en) 2019-07-23

Similar Documents

Publication Publication Date Title
CN110363456B (en) Method and device for putting articles on shelves
CN106980955B (en) Method and apparatus for outputting information
CN110866709B (en) Method and device for merging orders
CN110059993B (en) Warehouse management method and device
CN110472899B (en) Method and device for distributing articles out of warehouse
CN109961247B (en) Method and device for generating article storage information
CN113762858B (en) Inventory management method and device
CN111292030A (en) Bin selection method and device and computer readable storage medium
CN110019330B (en) Information output method and device
CN109961306B (en) Method and device for distributing inventory of articles
CN109934427B (en) Method and device for generating item distribution scheme
CN110826953B (en) Warehouse storage equipment planning method and device
CN112884405A (en) Inquiry system and scheduling method thereof
CN111985862A (en) Method and apparatus for locating inventory items
CN109978213B (en) Task path planning method and device
CN111950830B (en) Task allocation method and device
CN110555641B (en) Warehouse allocation method and device
CN110046776B (en) Method and device for determining object allocation amount
CN107844932B (en) Order processing method and device
CN110827102A (en) Method and device for adjusting goods price ratio
US20160189090A1 (en) Smart Scheduling for Processing Back Orders
CN113762863A (en) Inventory management method and device
CN111260271A (en) Method and device for shortening order picking time of store
CN112926907B (en) Warehouse inventory layout method and device
CN112801569B (en) Article sorting method and device

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