WO2015156631A1 - Procédé pour attribuer une quantité de produits à un nœud de vendeur et appareil correspondant - Google Patents

Procédé pour attribuer une quantité de produits à un nœud de vendeur et appareil correspondant Download PDF

Info

Publication number
WO2015156631A1
WO2015156631A1 PCT/KR2015/003601 KR2015003601W WO2015156631A1 WO 2015156631 A1 WO2015156631 A1 WO 2015156631A1 KR 2015003601 W KR2015003601 W KR 2015003601W WO 2015156631 A1 WO2015156631 A1 WO 2015156631A1
Authority
WO
WIPO (PCT)
Prior art keywords
allocation
seller
node
rule
allocation rule
Prior art date
Application number
PCT/KR2015/003601
Other languages
English (en)
Korean (ko)
Inventor
김동호
조강형
최원석
Original Assignee
삼성에스디에스 주식회사
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 삼성에스디에스 주식회사 filed Critical 삼성에스디에스 주식회사
Publication of WO2015156631A1 publication Critical patent/WO2015156631A1/fr

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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management

Definitions

  • the present invention relates to a method and apparatus for allocating quantities to seller nodes having a hierarchical connection relationship. More specifically, the present invention relates to a method and apparatus for distributing available to Promise (hereinafter referred to as "ATP quantity") allocated to a top node to subordinate seller nodes according to a production plan. .
  • ATP quantity available to Promise
  • SCM Supply Chain Management
  • the sales network has a hierarchical structure.
  • the sales network may have a tree-shaped structure.
  • the quantity produced is assigned to the root node of the tree as ATP.
  • the ATP quantity allocated to the root node is distributed to the child nodes according to a predetermined policy, and each child node also repeats the same process. According to this process, the quantity produced is distributed to all nodes included in the sales network. Each node compares the quantity assigned to it and the quantity ordered to determine if the order is committed.
  • An allocation policy refers to a standard for distributing ATP quantity of a parent node to one or more child nodes. For example, an allocation policy for distributing ATP quantity of a parent node based on demand forecast quantity of a child node, and an allocation policy for distributing ATP quantity of a parent node according to a predetermined priority for each child node are known. .
  • the volume allocation process according to the prior art is to distribute the ATP quantity of the top node to all seller nodes according to a single predetermined policy. Accordingly, there is a need for a method of allocating quantities with various rules according to the characteristics of each seller node, and provision of an apparatus to which the method is applied.
  • the technical problem to be solved by the present invention is a method for allocating a quantity to each seller node in a top-down manner on a seller network including a plurality of seller nodes having a hierarchical connection relationship. It is to provide a method and apparatus for allocating quantity to support a separate allocation rule for each.
  • Another technical problem to be solved by the present invention is to provide a method and apparatus for allocating quantity that allows the user to use each allocation policy and allocation rules in which the order is defined.
  • Another technical problem to be solved by the present invention is to stratify the allocation requirements of each seller node, and to use a new allocation policy to allocate the quantity based on the quantity order of the tiered allocation requirements in the allocation rule. To provide a method and apparatus for allocating quantity to support.
  • the first allocation policy is to allocate a portion of the assignable quantities of the first seller node to the lower seller node, and the second allocation policy is left in the first seller node after the first allocation policy is executed. At least a portion of the remaining assignable quantity is allocated to the lower seller node.
  • a quantity allocation method of selecting a first seller node from a plurality of seller nodes, and setting information of a first allocation rule applied to the first seller node Receiving input, selecting a second seller node different from the first seller node among the plurality of seller nodes, and setting information of a second allocation rule applied to the second seller node and different from the first allocation rule Receiving an input, transmitting identification information of the first seller node, identification information of the second seller node, setting information of the first allocation rule, and setting information of the second allocation rule to an external device. And receiving a quantity allocation result for the plurality of seller nodes from the external device.
  • Receiving the setting information of the first allocation rule comprises the step of receiving information for specifying two or more allocation policies constituting the first allocation rule and information on the order of execution, the second allocation rule
  • the receiving of the setting information may include receiving input of information specifying at least two allocation policies constituting the second allocation rule and information on an execution order thereof.
  • at least one of an allocation policy constituting the first allocation rule and an allocation policy constituting the second allocation rule is different from each other, or an execution order of the allocation policy constituting the first allocation rule and the second allocation. It is desirable that the order in which the allocation policies constituting the rules be performed is at least some different.
  • an apparatus for allocating quantity the allocation rule matching information storage unit for storing information on a matching allocation rule for at least some of the plurality of seller nodes, and the allocation rule.
  • the first allocation rule is matched to a first seller node of the plurality of seller nodes by using the information stored in a matching information storage unit, and the second seller node is different from the first seller node among the plurality of seller nodes.
  • An allocation rule matching unit matching a second allocation rule different from the first allocation rule, and allocating at least a portion of the assignable quantities of the first seller node to the lower seller node of the first seller node using the first allocation rule; And assigning the second seller node to a lower seller node of the second seller node using the second allocation rule. It performs assignment to assign at least a portion of the volume comprises part.
  • a quantity allocation system for receiving selection information of a first seller node and a second seller node from among a plurality of seller nodes, and receiving the selected information from the user.
  • a user terminal that receives the setting information of the first allocation rule applied and the setting information of the second allocation rule applied to the second seller node, and transmits the allocation rule setting information for each seller node according to the input result to the quantity allocation device.
  • receiving the quantity allocation device from the user terminal allocating at least a portion of the assignable quantities of the first seller node to a lower seller node of the first seller node using the first allocation rule.
  • the second seller node may be allocated to a lower seller node of the second seller node using an allocation rule. Allocating at least a portion of the amount to include the amount assignment unit that performs volume allocation procedure for said merchant network.
  • FIG. 1 is an illustration of a merchant network to which embodiments of the present invention may be applied.
  • FIG. 2 is a view showing a virtual seller network for explaining a quantity allocation method according to an embodiment of the present invention.
  • FIG. 3 is a diagram illustrating a process of matching an allocation rule to each seller node in a quantity allocation method according to an embodiment of the present invention.
  • 5A to 6B are diagrams for describing an allocation result of a quantity allocation method according to an embodiment of the present invention.
  • FIG. 7 is a view for explaining a new allocation rule that can be used in the quantity allocation method according to an embodiment of the present invention.
  • FIG. 8 is a diagram for describing hierarchizing allocation requirements of each seller node in order to execute the allocation rule described with reference to FIG. 7.
  • FIG. 9 is a diagram for describing a process of allocating a quantity by applying the allocation rule described with reference to FIG. 7.
  • FIG. 10 is a flowchart illustrating a quantity allocation method according to an embodiment of the present invention.
  • FIG. 11 is a flowchart illustrating a quantity allocation method according to another embodiment of the present invention.
  • FIG. 12 is a block diagram of a quantity allocation system according to an embodiment of the present invention.
  • FIG. 13 is a block diagram of a quantity allocation device according to an embodiment of the present invention.
  • FIG. 14 is a hardware configuration diagram of a quantity allocation device according to another embodiment of the present invention.
  • “seller network” means a data structure including a plurality of seller nodes having a hierarchical connection relationship.
  • the merchant network may be configured in a tree structure.
  • the allocation required amount may mean the quantity of products that each seller node requires allocation.
  • ATP quantity is allocated to the top node.
  • the ATP quantity may be provided from a master planning apparatus.
  • the quantity allocation method according to the present invention means a method of distributing ATP quantity allocated to a top node to lower seller nodes.
  • the term “quantity” may mean a quantity of a manufactured product, a unit for providing a service, or the like. Therefore, the quantity allocation method according to the embodiments of the present invention means a method for determining how much quantity to distribute the produced product, the ready service to each seller node.
  • a quantity of a service may mean a quantity based on the service providing unit, on the premise that the service may be quantified and the unit of providing the service may be counted using the result of the quantification.
  • the allocation requirement may mean the largest allocation requirement among the allocation requirements for each attribute. For example, when a particular seller node has a first allocation requirement of a first attribute, a second allocation requirement of a second attribute, and a third allocation requirement of a third attribute, the largest allocation requirement among them is the allocation of the seller node. Expressed in the required amount.
  • the “attribute” means the reason why allocation is necessary.
  • the “attribute” may be an ORDER quantity, a demand forecast quantity (FCST) quantity, a previous cycle allocation (COM-ALLOC) quantity, and the like.
  • the head office node shown in FIG. 2 has an Asian node and an Americas node as child nodes, and it is a problem how to distribute the 800 unit ATP quantity assigned to the headquarters node to the Asia node and the Americas node. This is because the combined requirements for the Asia and Americas nodes add up to 900, exceeding 800, which the headquarters node can distribute.
  • the present invention provides various methods for solving this problem and an apparatus to which the method is applied.
  • quantity allocation is started from the top node, but according to an embodiment of the present invention, quantity allocation may be started from the seller node or the seller node designated by the user to the lower seller nodes.
  • At least one of the seller nodes included in the seller network may be subject to a different allocation rule from other seller nodes. That is, one allocation rule is not applied to the entire seller network, but different allocation rules may be applied to each seller node. Therefore, in consideration of the sales situation of each seller node or the relationship with the sub-seller node, it is possible to distribute the assignable quantity of each seller node to the sub-seller nodes. It also has the effect of providing scalability in terms of strategies that can be used by managers for volume allocation in seller networks.
  • allocation rule A may be matched to the headquarters node
  • allocation rule B may be matched to the Asia node
  • allocation rule C may be matched to the Americas node.
  • the ATP quantity of the headquarters node is distributed to the Asia node and the Americas node by the allocation rule A
  • the quota distributed to the Asia node is distributed to the Korea node and the China node by the allocation rule B
  • the quota allocated to means to be distributed to North and South American nodes according to allocation rule C.
  • an allocation rule matches a particular seller node it means using the allocation rule when distributing at least some of the assignable quantities of the seller node to subordinate seller nodes of the seller node.
  • the allocation rule may be matched only to some seller nodes included in the seller network. That is, some seller nodes may not match allocation rules.
  • the allocation rule to be applied may be determined according to various criteria. In FIG. 3, allocation rules are not matched for the Chinese node, the US east node, the US west node, and the Canada node.
  • the allocation rule may be automatically determined for the seller node that does not match the allocation rule. In this case, there is an effect of reducing the workload of the manager.
  • embodiments related to allocation rule determination for seller nodes whose allocation rules do not match will be described.
  • an allocation rule matched to a parent node may be applied to a seller node that does not match an allocation rule.
  • the allocation rule B matched to the Asian node as the parent node is applied to the Chinese node, and the allocation rule matched to the North American node as its parent node to the US East node, the US West node, and Canada node. D is applied.
  • This embodiment is useful when it is desired that the allocation rules of higher nodes are uniformly propagated to lower seller nodes in the seller network.
  • an allocation rule matched to one of sibling nodes may be applied to a seller node that does not match an allocation rule. At this time, if there is one node among which siblings match the allocation rule, the matching rule is applied to the node, and if there are two or more nodes among which siblings match the allocation rule, according to a predetermined rule. You can decide which nodes apply matching rules.
  • an allocation rule C matched to a Korean node which is its sibling node may be applied to the Chinese node. This embodiment is useful when one wants to apply the same allocation rules for a particular level in a merchant network.
  • an allocation rule designated as a default allocation rule may be applied to a seller node for which a specific allocation rule is not matched by a user.
  • the default assignment rule is previously specified by the user and may be updated with another assignment rule.
  • the allocation rule A which is a default allocation rule, may be applied to the Chinese node, the US east node, the US west node, and the Canada node. If there is no assignment rule specified as the default assignment rule, the assignment rule matched to the top node may be applied instead of the default assignment rule.
  • This embodiment is useful when basically applying a specific allocation rule in a seller network, but wants to apply a different allocation rule only to seller nodes with special circumstances.
  • FIG. 4 a method of configuring an allocation rule according to the present invention will be described in detail.
  • the allocation rule may consist of two or more allocation policies that are sequentially performed.
  • the allocation policy refers to a policy used when distributing the remaining assignable quantity to lower seller nodes.
  • a situation in which an allocation rule for sequentially performing a first allocation policy, a second allocation policy, and a third allocation policy is applied to the seller node X will be described.
  • the ATP quantity of seller node X is allocated to a child node of seller node X by applying a first allocation policy.
  • the remaining ATP quantity at the seller node X (if there is remaining ATP quantity) is additionally allocated to the child node by applying the second allocation policy.
  • the remaining ATP quantity still exists in the seller node X (if there is any remaining ATP quantity), and then additionally allocated to the child nodes by applying a third allocation policy.
  • allocation rule A 10 illustrates the configuration of allocation rule A 10, allocation rule B 20, and allocation rule C 30. Since each allocation rule consists of two or more allocation rules, first, various allocation policies that can be used to configure allocation rule A (10), allocation rule B (20), and allocation rule C (30) are described.
  • the PER_ORDER allocation policy is a policy that allocates the order based on the ORDER quantity of the child node's allocation requirements so that the delivery date of the order is made.
  • ORDER quantity means the quantity that the order has been received from the customer.
  • the ORDER quantity of each child node is allocated, and the quantity that can be distributed to child nodes is ORDER quantity of all child nodes. If it is less than the sum, all the quantity that can be distributed is distributed according to the ORDER quantity ratio of each child node.
  • the two child nodes may be allocated 40 and 50, respectively, and the parent node may be allocated as the allocable quantity of 10. Will leave.
  • the allocable quantity of the parent node is 100 and the ORDER quantities of the two child nodes are 80 and 120, respectively, the two child nodes allocate 40 (100 * 2/5) and 60 (100 * 3/5), respectively. Receive.
  • PER_COM-ALLOC allocation policy is a policy that prevents a sudden change in quantity allocation by allocating based on the quantity allocated in the previous cycle among the allocation requirements of the child nodes.
  • the PER_COM-ALLOC allocation policy if the quantity that can be distributed to the child nodes is equal to or more than the sum of the previous cycle allocations of all the child nodes, the immediate cycle allocation of each child node is allocated and the child nodes can be distributed to the child nodes. If the quantity is less than the sum of the previous cycle allocation quantity of all the child nodes, all the quantity that can be distributed are distributed according to the ORDER quantity ratio of each child node.
  • the two child nodes can be allocated 40 and 50, respectively. In this case, the parent node will leave 10 for the allocation. In addition, if the allocable quantity of the parent node is 100, and the two children nodes are allocated 80, 120 in the previous cycle, the two child nodes are 40 (100 * 2/5) and 60 (100 * 3 / 5) is assigned this cycle.
  • the PER_FCST allocation policy is a policy that allocates an order based on a demand forecast quantity of an allocation requirement of child nodes so that a delivery date is promised for an order.
  • the demand forecast quantity refers to a quantity determined by the enterprise as a demand forecast quantity of a specific seller node based on a demand forecast quantity input by a sales representative. According to the PER_FCST allocation policy, if the quantity that can be distributed to the child nodes is equal to or greater than the sum of the demand forecast quantities of all the child nodes, the demand allocation quantity of each child node is allocated, and the quantity that can be distributed to the child nodes is allocated to all the child nodes.
  • the demand forecast volume is less than the sum, all the quantity that can be distributed is distributed according to the demand forecast volume ratio of each child node.
  • the allocable quantity of the parent node is 100, and the demand forecasting quantities of the two child nodes are 40 and 50, respectively, the two child nodes may be allocated 40 and 50, respectively, and the parent node is the allocable quantity. You leave 10. Also, according to PER_FCST, if the allocable quantity of the parent node is 100 and the demand forecasting quantities of the two child nodes are 80 and 120, respectively, the two child nodes are 40 (100 * 2/5) and 60 (100 * 3 / 5) assigned.
  • the PER_RANK allocation policy is a policy that considers the child nodes that should be allocated first when there is not enough quantity to allocate based on the priority set between each child node.
  • the seller network general manager or the manager of each seller node may set priority information on child nodes or change the set priority.
  • the PER_RATE allocation policy allocates based on the quantity allocation rate set between each child node.
  • the seller network general manager or the manager of each seller node may set the quantity allocation rate for the child nodes or change the set quantity allocation rate.
  • the seller node matched by the allocation rule A (10) is first distributed according to the PER_ORDER allocation policy when distributing the allocable quantity to the lower seller node, and if there is a remaining quantity according to the PER_FCST allocation policy Additional allocation is made, and if there is one last, it is distributed according to the PER_RANK allocation policy.
  • the seller node that the allocation rule B 20 matches is distributed first according to the PER_ORDER allocation policy when distributing the assignable quantity to the lower seller node, and further distribution according to the PER_COM-ALLOC allocation policy if there is a remaining quantity. Finally, if there is a quantity remaining, additional distribution will be made according to the PER_RATE allocation policy.
  • the seller node is first distributed according to the PER_ORDER allocation policy when distributing the allocable quantity to the lower seller node, and then additionally distributed according to the PER_FCST allocation policy if there is a remaining quantity.
  • this embodiment is referred to as an absolute quantity securing embodiment.
  • the PER_ORDER, PER_FCST, and PER_COM-ALLOC allocation policies which are performed twice or in a subsequent order, may be performed by reflecting a quantity previously allocated.
  • PER_FCST which is the second allocation policy of Allocation Rule A (10)
  • PER_FCST the second allocation policy of Allocation Rule B (20)
  • PER_FCST the second allocation policy of Allocation Rule B (20)
  • the second allocation policy PER_FCST of the allocation rule C 30 to the allocation rule C 30 uses the quantity excluding the quantity allocated according to the PER_ORDER allocation policy, which is the first allocation policy, as the allocation reference quantity.
  • this embodiment is referred to as a relative quantity securing embodiment.
  • the allocable amount of the parent node is larger than the sum of the allocating requirements of the child nodes, the only amount allocated to each child node is allocated and the remaining amount is not owned by the parent node. All of the node's allocable quantity can be allocated according to the ratio of allocation requirement of each child node.
  • the unit assigns 100 units of the allocable amount of the parent node to 4: 5 (40:50) instead of performing the following allocation rule.
  • the ratio may be allocated to the first child node and the second child node.
  • FIG. 4 An example configuration of an allocation rule has been described with reference to FIG. 4.
  • FIG. 4 only an allocation rule composed of two allocation policies or three allocation policies has been described as an example.
  • the allocation rule according to the present invention may also be configured with four or more allocation policies.
  • the administrator of the seller network may define various combinations of assignment rules not shown in FIG. 4 to match specific seller nodes.
  • the allocation rule A 10 is matched to the headquarters node 1, which is the top node.
  • the head office node 1 has an Asian node 2 and an Americas node 3 as child nodes. Therefore, the 800 unit ATP quantity allocated to the headquarters node 1 is distributed to the Asian node 2 and the Americas node 3, at which time the allocation rule A 10 is applied.
  • the assignable quantity (ATP) is allocated to the headquarters node 1, 800 units, how 800 units of quantity will be distributed to the lower seller nodes according to the allocation rule A (10).
  • the first allocation policy of allocation rule A (10) is PER_ORDER. Since the ATP quantity (800 units) of the headquarters node (1) is higher than the ORDER quantity (300 units) of the Asian node 2 and the ORDER quantity (200 units) of the Americas node (3), the Asian node 2 ) Is allocated to 300 units, and 200 units to the endnote nodes. As a result of PER_ORDER, 300 units (800-300-200) are left in the headquarter node 1 as ATP quantity.
  • the second allocation policy of allocation rule A (10) is PER_FCST.
  • the remaining 300 units of ATP of the headquarters node 1 are distributed to the Asian node 2 and the Americas node 3 by PER_FCST. This time, the remaining ATP volume of the headquarters node 1 is not sufficient to meet the demand forecasts of the Asia node 2 and the Americas node 3. Therefore, the remaining ATP quantity (300 units) of the headquarter node (1) is 5: 4 (Asia node demand forecast volume: America node demand demand volume) to Asia node 2 and America node (3). Must be distributed.
  • PER_FCST 166 units (300 * 5/9) are additionally allocated (decimal point, below) to the Asian node 2, and 133 units (300 * 4/9) are added to the endnote node 3 Is assigned.
  • 1 unit 300-166-133 is left in the headquarter node 1 as ATP quantity.
  • the last allocation policy of allocation rule A (10) is PER_RANK.
  • the remaining ATP quantity (1 unit) of the headquarters node 1 is further allocated to the Asian node 2 having higher priority by the PER_RANK policy.
  • the ATP quantity of 800 units allocated to the headquarters node (1) is allocated 467 units to the Asian node (2), 333 units to the Americas node (3), respectively.
  • the amount of the quantity according to a predetermined ratio may be retained in the parent node, and only the remaining amount may be distributed to the child nodes.
  • a predetermined amount may be left in the parent node, and only the remaining amount may be distributed to the child node. Distributing the remaining quantity to the child node after leaving the quantity in the parent node can be provided as an option function. If it is set to distribute the remaining quantity after leaving the quantity in the parent node, the same rule may be applied to all levels of nodes included in the target node (if there are child nodes).
  • 160 units which is 20% of the ATP quantity (800 units) of the headquarters node (1), are left in the headquarters node (1), and the remaining 640 units are distributed to the Asian node (2) and the Americas node (3). Is determined.
  • the first allocation policy of allocation rule A (10) is PER_ORDER.
  • the ATP volume (640 units) distributed at the headquarters node (1) is greater than the sum of the ORDER quantity (300 units) of the Asian node 2 and the ORDER quantity (200 units) of the Americas node (3). 300 units are allocated to 2) and 200 units are allocated to the endnote nodes.
  • 140 units (640-300-200) are left in the headquarter node 1 as ATP quantity.
  • the second allocation policy of allocation rule A (10) is PER_FCST.
  • 140 units, the remaining ATP quantity of the headquarters node 1 are distributed to the Asian node 2 and the Americas node 3 by PER_FCST. This time, the remaining ATP volume of the headquarters node 1 is not sufficient to meet the demand forecasts of the Asia node 2 and the Americas node 3. Therefore, the remaining ATP quantity (140 units) of the headquarters node 1 is 5: 4 (Asia node demand forecast volume: America node demand demand volume) to Asia node 2 and America node (3). Must be distributed.
  • PER_FCST 77 units (140 * 5/9) are additionally allocated (decimal point, below) to Asia node 2, and 62 units (140 * 4/9) are added to the Americas node 3 Is assigned.
  • 1 unit 140-77-62 is left in the headquarter node 1 as ATP quantity.
  • the last allocation policy of allocation rule A (10) is PER_RANK.
  • the remaining ATP quantity (1 unit) of the headquarters node 1 is further allocated to the Asian node 2 having higher priority by the PER_RANK policy.
  • the ATP quantity of 800 units allocated to the headquarters node (1) is 378 (300 + 77 + 1) units to the Asian node (2).
  • 262 (200 + 62) units are allocated to the endnote nodes 3, respectively.
  • the option of distributing the remaining quantity to the child node after leaving a predetermined amount of quantity or a predetermined quantity in the parent node may be applied to the relative quantity securing embodiment as well as the absolute quantity securing embodiment.
  • FIG. 5B The process of applying the allocation rule A according to the relative quantity secured embodiment will be described.
  • the execution result of PER_ORDER which is the first allocation policy of the allocation rule A 10, is the same as that described with reference to FIG. 5A.
  • the execution result of PER_FCST which is the second allocation policy of the allocation rule A 10, is different from that described with reference to FIG. 5A.
  • 300 units the remaining ATP quantity, are distributed to the Asia node 2 and the Americas node 3 by PER_FCST.
  • the reference quantity to be allocated according to PER_FCST is 200 except for 500 (FCST quantity) in the Asian node 2 to 300 (quantity already allocated by PER_ORDER), and 400 (FCST in the Americas node 3). Quantity) is 200 excluding 200 (pre-assigned quantity by PER_ORDER).
  • the last allocation policy of the allocation rule A 10 is PER_RANK, since there is no remaining ATP quantity of the headquarters node 1, there is no quantity that can be further allocated according to PER_RANK.
  • the ATP quantity of 800 units allocated to the headquarters node 1 is assigned to 450 units for the Asian node 2 and 350 units for the Americas node 3, respectively.
  • an ATP quantity of 333 units (see the results shown in FIG. 5A) allocated to the Americas node 3 is allocated to the North American node 4 and the South American node 5 by the allocation rule C 30.
  • the first allocation policy of allocation rule C (30) is PER_ORDER.
  • the ATP quantity (333 units) of the Americas node (3) is greater than the sum of the ORDER quantity (250 units) of the North American node (4) and the ORDER quantity (50 units) of the South American node (5). ) Is assigned 250 units, and 50 units are assigned to Latin American nodes.
  • 33 units (333-250-50) are left in the endnote node 3 as ATP quantity.
  • the second allocation policy of allocation rule C 30 is PER_FCST. 33 units, the remaining ATP quantity of the Americas node 3, are distributed to the North American node 4 and the South American node 5 by PER_FCST. At this time, the remaining ATP quantity of the Americas node 3 is not sufficient to satisfy the demand forecasts of the North American node 4 and the South American node 5. Therefore, the remaining ATP quantity (33 units) of the Americas node 3 is 3: 1 (North American node demand forecast quantity: South American node demand forecast quantity) to the North American node 4 and the South American node (5). Must be distributed.
  • the first allocation policy of allocation rule C (30) is PER_ORDER. Since the ATP quantity (350 units) of the Americas node 3 is larger than the sum of the ORDER quantity (250 units) of the North American node 4 and the ORDER quantity (50 units) of the South American node 5, the North American node (2) ) Is assigned 250 units, and 50 units are assigned to Latin American nodes. As a result of PER_ORDER, 50 units (350-250-50) are left in the endnote node 3 as ATP quantity.
  • the second allocation policy of allocation rule C 30 is PER_FCST. 50 units, the remaining ATP quantity of the Americas node 3, are distributed to the North American node 4 and the South American node 5 by PER_FCST. At this time, the reference quantity to be allocated according to PER_FCST is 50 except for 300 (FCST quantity) to 250 (pre-assigned quantity by PER_ORDER) for North American node 4, and 100 (for South American node 5). FCST quantity) is 50 minus 50 (the quantity already allocated by PER_ORDER).
  • the remaining ATP quantity of the Americas node 3 is not sufficient to satisfy the demand forecasting quantity of the North American node 4 and the South American node 5 (excluding the previously allocated quantity). Therefore, the remaining ATP quantity (50 units) of the Americas node 3 should be distributed to the North American node 4 and the South American node 5 in a ratio of 50:50. Therefore, according to PER_FCST, 25 units (50 * 1/2) are additionally allocated to the North American node 4, and 25 units (50 * 1/2) are additionally allocated to the South American node 5 as well. As a result of performing PER_FCST, 0 units (50 to 25 to 25) are left in the endnote node 3 as ATP quantity.
  • the new allocation policy allocates the quantity based on the allocation requirement for each attribute of each seller node, but does not allocate the quantity based on the allocation requirement of a specific attribute, but the allocation requirement in which the quantity of the quantity is a specific order. Allocate quantity on the basis of
  • the US East Node 6 has 50 units of ORDER quantity, 70 units of previous cycle allocation quantity (COM-ALLOC), and 100 units of demand forecast quantity (FCST). That is, the allocation required by the US East Node 6 is the first layer L1 of 0 units to 50 units (ORDER quantity), and 0 units to 70 units (prior period allocation quantity (COM-ALLOC)). 2nd layer L2 and the 3rd layer L3 of 0 unit to 100 unit (a demand prediction quantity).
  • “the Nth layer allocation requirement” means the Nth allocation requirement when the allocation requirements for each attribute are sorted in ascending order, or when the allocation requirement for each attribute is sorted in the descending order, May mean an allocation requirement.
  • the Nth layer allocation requirement means the Nth allocation requirement when the allocation requirements for each attribute are arranged in ascending order.
  • the ORDER quantity may be greater than the previous share price allocation (COM-ALLOC).
  • the first floor allocation requirement of the US West Node 7 is a previous cycle allocation quantity (COM-ALLOC)
  • the second layer allocation requirement is an ORDER quantity
  • the third layer allocation requirement is a demand prediction quantity (FCST).
  • FCST demand prediction quantity
  • FCST demand prediction quantity
  • FCST demand prediction quantity
  • the PER_1ST-LAYER allocation policy is a policy for allocating based on the first-layer quantity of allocation requirements of child nodes. According to the PER_1ST-LAYER allocation policy, if the quantity that can be distributed to child nodes is equal to or more than the sum of the first-tier allocation requirements of all the child nodes, the first-layer allocation requirement of each child node can be allocated and distributed to the child nodes. If the quantity present is less than the sum of the first layer allocation requirements of all the child nodes, all the amounts that can be distributed are distributed according to the ratio of the first layer allocation requirements of each child node.
  • the PER_2ND-LAYER allocation policy means to allocate the quantity based on the allocation requirement of the second layer
  • the PER_3RD-LAYER allocation policy means to allocate the quantity based on the allocation requirement of the third layer.
  • the PER_Nth-LAYER allocation policy allocates the quantity based on the allocation requirement of the Nth layer. Allocation policy.
  • An allocation policy (PER_LAST LAYER) that allocates quantity based on the allocation requirement of the last layer may also be used. PER_LAST LAYER may be conveniently used when trying to base on the largest allocation requirement without considering the number of allocation requirements for each attribute of the seller node.
  • the order of allocation required for each attribute may vary according to the order of ORDER. That is, the PER_ORDER allocation policy may not be an allocation policy based on the minimum amount of the seller node's allocation requirements, or the PER_FCST allocation policy may not be an allocation policy based on the maximum amount of the seller node's allocation requirements. Therefore, by using the PER_Nth-LAYER allocation policy, the user can accurately specify the allocation requirements in a specific order among the allocation requirements for each attribute of each seller node as the basis of the quantity allocation.
  • the allocation rule D 40 illustrated in FIG. 7 includes a policy (PER_1ST-LAYER) for allocating based on the allocation requirement of the first layer, a policy (PER_3RD-LAYER) for allocating based on the allocation requirement of the third layer, and a predetermined designation.
  • a policy (PER_RATE) that distributes volume by rate is performed sequentially.
  • the absolute quantity embodiment and the relative quantity embodiment described with reference to FIGS. 4 to 6 may also be applied to the allocation rule D 40.
  • the allocation rule D 40 according to the absolute quantity embodiment performs the second PER_3RD LAYER without considering the previously allocated quantity, while the allocation rule D 40 according to the relative quantity embodiment is 1 PER_3RD LAYER is performed based on the quantity already allocated by PER_1ST LAYER.
  • FIG. 9 illustrates a process in which the North American node 4, which has been assigned an ATP of 274 units (see the result shown in FIG. 6A), distributes the quantity to the child nodes.
  • the allocation requirements for US East Node 6, US West Node 7, and Canada Node 8 are indicated for each floor. (L1 is the first layer, L2 is the second layer, L3 is the third layer)
  • the allocation requirements of the first order refer to the allocation requirements of the first layer, the allocation requirements of the second order, the allocation requirements of the second layer, ..., the allocation requirements of the Nth order, and the allocation requirements of the Nth layer. Will be.
  • the first allocation policy of allocation rule D 40 is PER_1ST-LAYER.
  • the remaining ATP of the North American node 4 becomes 99 units (274-50-100-25).
  • the second allocation policy of allocation rule D 40 is PER_3RD-LAYER.
  • the remaining ATP (99 units) of the North American node (4) is a ratio of 2: 3: 1 (100: 150: 50) to the US East Node (6), US West Node (7), and Canada Node (8). Respectively).
  • the last allocation policy of allocation rule D 40 is PER_RATE.
  • the pre-specified volume distribution ratios for US East Node (6), US West Node (7), and Canada Node (8) are 50:20:30.
  • the remaining ATP of the North American node 4 at the time of performing PER_RATE is 1 unit, there is no additional amount allocated by PER_RATE.
  • allocation rule matching information is stored for each seller node (S100).
  • the assignment rule matching information may be configured using information received from a user terminal.
  • the information received from the user terminal may include seller node designation information and setting information of an allocation rule matching the seller node.
  • the setting information of the allocation rule includes an allocation policy constituting the allocation rule and information specifying an execution order thereof.
  • the following operations may be performed in the user terminal.
  • a first seller node is selected among the plurality of seller nodes.
  • the configuration information of the first allocation rule applied to the first seller node is input.
  • a second seller node different from the first seller node is selected among the plurality of seller nodes.
  • the configuration information of the second allocation rule applied to the second seller node and different from the first allocation rule is received.
  • the identification information of the first seller node, the identification information of the second seller node, the setting information of the first allocation rule, and the setting information of the second allocation rule are transmitted to an external device performing the quantity allocation method. do.
  • At least one seller node may be matched with another seller node with a different allocation rule. That is, at least one of an allocation policy constituting the first allocation rule and an allocation policy constituting the second allocation rule is different from each other, or an execution order of the allocation policy constituting the first allocation rule and the second allocation rule are configured. The order in which the allocation policy is performed may be at least partially different.
  • the stored allocation rule matching information is loaded (S102) when the allocation of quantity is to be performed (S102).
  • the loaded allocation rule matching information is compared with the seller network configuration information that is subject to quantity allocation. As a result of the comparison, a seller node without a matching allocation rule is determined.
  • the allocation rule of the parent node may be applied, the allocation rule of the sibling node may be applied, or the default allocation rule may be applied.
  • the criteria for determining the allocation rule to be applied to the seller node having no matching allocation rule may be a user setting.
  • the quantity allocation is performed in a top-down manner for each seller node included in the seller network. At this time, the quantity allocation is performed using the allocation rule matched to each seller node or determined in step S104 (S106). ).
  • the quantity allocated for each seller node is recorded (S108).
  • Information about the quantity allocated to each seller node is provided to the order management device, which can be used to make a delivery date for orders received from customers.
  • a quantity allocation method according to another embodiment of the present invention will be described with reference to FIG.
  • the quantity allocation method according to the present embodiment is characterized in that a user generates an allocation rule by combining two or more allocation policies in various orders, and performs a top-down quantity allocation of quantities using the allocation rule.
  • the user terminal receives the setting information of the allocation rule (S200).
  • the setting information of the allocation rule includes an allocation policy constituting the allocation rule and information specifying an execution order thereof.
  • the allocation rule allocates a quantity to a lower seller node and allocates a quantity based on an allocation requirement of a specific attribute of the lower seller node, and allocates a quantity to a lower seller node, respectively. It may be configured to include an allocation policy for allocating the quantity based on the priority or quantity allocation ratio specified between the lower seller node.
  • the allocation rule may be configured to include an allocation policy for allocating the quantity to the lower seller node based on the allocation requirement of a particular floor of the lower seller node.
  • the allocation rule may be configured to further allocate an amount to the lower seller node, the allocation policy for allocating the quantity based on the priority or the quantity allocation ratio specified between each lower seller node.
  • the setting information of the allocation rule received from the user terminal is stored as it is or stored through a format processing process (S202).
  • the concepts of the present invention described above with reference to FIGS. 1 through 11 may be implemented in computer readable code on a computer readable medium.
  • the computer-readable recording medium may be, for example, a removable recording medium (CD, DVD, Blu-ray disc, USB storage device, removable hard disk) or a fixed recording medium (ROM, RAM, computer equipped hard disk). Can be.
  • the computer program recorded in the computer-readable recording medium may be transmitted to another computing device and installed in the other computing device through a network such as the Internet, thereby being used in the other computing device.
  • the quantity allocation system includes a server system 100 and one or more user terminals 200.
  • the server system 100 may be composed of one or more physical server devices.
  • the user terminal 200 may be implemented in any form of terminal having a computing capability and a data communication capability through a network.
  • the user terminal 200 may be, for example, one of a desktop PC, a notebook PC, a tablet PC, a server device, a workstation, a smart phone, a feature phone, a wearable computer, a smart TV, and a set top box.
  • the demand management device 102, the production planning device 104, the quantity allocation device 106, and the order management device 108 are included in the server system 100 based on an operation to be performed.
  • the demand management device 102, the production planning device 104, the quantity allocation device 106, and the order management device 108 may each be different physical server devices, but two or more devices may be one physical server device. Note that it may be implemented using.
  • the demand management device 102 manages demand forecast quantities input by members of the seller network. For each seller node included in the seller network, two or more demand forecast quantities may be input from a person in charge at each level. The demand management device 102 calculates the input of two or more demand forecast quantities for each seller node as one determined demand forecast quantity by a predetermined method, and the determined demand forecast quantity is the quantity allocation device 106 and the production plan. To the device 104.
  • the production planning apparatus 104 receives a demand forecast quantity from the demand management apparatus 102 and establishes a production plan.
  • the production plan established by the production planning device 104 may be provided to a factory planning device (not shown, Factory Planning Module) may be used as a reference for establishing a production plan of a factory unit.
  • the ATP quantity information according to the production plan established by the production planning apparatus 104 may be provided to the quantity allocation apparatus 106.
  • the ATP quantity information provided from the production planning apparatus 104 may be an ATP quantity for the top node of the seller network, or may be an ATP quantity for a specific node below the top node of the seller network.
  • the quantity allocation device 106 receives the ATP quantity information from the production planning device 104 and the order information received from the order management device 108.
  • the quantity allocation device 106 may also store quantity information allocated to each seller node belonging to the seller network in the previous cycle until the predetermined period has elapsed.
  • the quantity allocation device 106 is based on the order information received from the order management device 108, the demand forecast quantity provided from the demand management apparatus 102, and the ATP quantity information provided from the production planning apparatus 104. In this way, the quantity allocation of the top-down method is performed to each seller node in the seller network.
  • the quantity allocation device 106 may perform the quantity allocation according to a predetermined cycle or when there is a user request or when an event occurs.
  • the quantity allocation of the top-down method may be understood as a process of sequentially distributing ATP quantity allocated to the top node, which is the highest node, to the lower seller node.
  • the quantity allocation device 106 applies a first allocation rule to the first seller node included in the seller network to distribute the quantity to lower seller nodes, and the second seller node included in the seller network.
  • the second allocation rule may be applied to distribute the quantity to the lower seller node. That is, the quantity allocation device 106 supports at least some seller nodes distributing quantities to lower seller nodes using different allocation rules from other seller nodes.
  • the quantity allocation apparatus 106 also supports distributing the quantity to lower seller nodes by applying an allocation rule defined by the user through the user terminal 200.
  • the user terminal 200 may transmit data based on setting information of an allocation rule input from a user to the server system 100 through a network.
  • the data received from the user terminal 200 will be provided to the quantity allocation device 106.
  • the data received from the user terminal 200 includes information specifying each allocation policy constituting the allocation rule, and information specifying the order in which each allocation policy is performed. That is, the allocation rule defined by the user sequentially performs different allocation policies.
  • the quantity allocation device 106 allocates the quantity based on the allocation requirement for each attribute of each sub-seller node, but does not allocate the quantity based on the allocation requirement of the specific attribute, but based on the size of the quantity. It also supports configuring allocation rules using an allocation policy that allocates quantities based on allocation requirements in a specific order.
  • the quantity allocating apparatus 106 has an allocation policy for allocating the quantity based on the allocation requirement of the specific attribute owned by the lower seller node, and based on the priority or the quantity allocation ratio specified between each of the lower seller nodes. It also supports defining hybrid allocation rules that include all allocation policies that allocate quantities.
  • the quantity allocating apparatus 106 has an allocation policy for allocating the quantity based on the allocation requirement of the specific attribute owned by the lower seller node, and based on the priority or the quantity allocation ratio specified between each of the lower seller nodes. It also supports defining hybrid allocation rules that include all allocation policies that allocate quantities.
  • the quantity allocation device 106 has an allocation policy for allocating the quantity based on the allocation requirement of a specific floor owned by the lower seller node, and based on the priority or ratio of the quantity allocation specified between the respective lower seller nodes. It also supports defining hybrid allocation rules that include all allocation policies that allocate quantities.
  • the quantity allocation device 106 When the quantity allocation device 106 completes the quantity allocation for each seller node, the quantity allocation device 106 stores the quantity allocation result for each seller node and provides the quantity allocation result to the order management device 108.
  • the order management device 108 manages orders received from customers and confirms the delivery date for each order.
  • the order management device 108 uses the quantity allocation result provided from the quantity allocation device 106 to generate information on whether or not each order can be delivered on request.
  • the quantity allocation device 106 may include an allocation rule matching information storage unit 162, an allocation rule matching unit 164, and an allocation performing unit 166.
  • the allocation rule matching information storage unit 162 stores information about the allocation rule matched to at least some of the plurality of seller nodes.
  • the allocation rule matching information storage unit 162 may receive information about the allocation rule from an external device through the network interface 160.
  • the external device may be a user terminal or a server device that manages configuration information.
  • the information on the allocation rule includes information specifying each allocation policy constituting the allocation rule and information specifying an order in which each allocation policy is performed.
  • the assignment rule matching unit 162 matches the first allocation rule to a first seller node of the plurality of seller nodes using the information stored in the assignment rule matching information storage unit 162, and the first rule among the plurality of seller nodes.
  • a second allocation rule different from the first allocation rule may be matched to a second seller node different from the first seller node.
  • the allocation rule matching unit 162 may determine an allocation rule to be applied to the seller node that does not match the allocation rule.
  • the allocation rule matching unit 162 may apply the allocation rule matched to the parent node with respect to the seller node that the specific allocation rule does not match. This embodiment is useful when it is desired that the allocation rules of higher nodes are uniformly propagated to lower seller nodes in the seller network.
  • the allocation rule matching unit 162 may apply an allocation rule matched to one of sibling nodes with respect to a seller node whose specific allocation rule is not matched by the user. At this time, if there is one node among which siblings match the allocation rule, the matching rule is applied to the node, and if there are two or more nodes among which siblings match the allocation rule, according to a predetermined rule. You can decide which nodes apply matching rules. This embodiment is useful when one wants to apply the same allocation rules for a particular level in a merchant network.
  • the allocation rule matching unit 162 may apply a default allocation rule to seller nodes that do not match a specific allocation rule.
  • the default assignment rule is previously designated by the user, and may be changed to another assignment rule. This embodiment is useful when basically applying a specific allocation rule in a seller network, but wants to apply a different allocation rule only to seller nodes with special circumstances.
  • the allocation performing unit 166 allocates at least a portion of the assignable quantities of the first seller node to the lower seller node of the first seller node using the first allocation rule, and uses the second allocation rule to allocate At least a portion of an allocable quantity of the second seller node is allocated to a lower seller node of the second seller node.
  • the allocation performing unit 166 receives the demand forecast quantity for each seller node from the demand management apparatus 102, receives the ATP quantity information for the top node from the production planning apparatus 104, and the order management apparatus 108. Order information for each seller node is provided.
  • the allocation performing unit 166 sequentially distributes the ATP quantity allocated to the top node based on the received information to lower seller nodes.
  • the quantity distributed to each seller node by the allocation performing unit 166 is provided to the order management device 108 and used to confirm the delivery date of the customer's order.
  • Each component of FIGS. 12 and 13 may refer to software or hardware such as a field-programmable gate array (FPGA) or an application-specific integrated circuit (ASIC).
  • FPGA field-programmable gate array
  • ASIC application-specific integrated circuit
  • the components are not limited to software or hardware, and may be configured to be in an addressable storage medium and may be configured to execute one or more processors.
  • the functions provided in the above components may be implemented by more detailed components, or may be implemented as one component that performs a specific function by combining a plurality of components.
  • the quantity allocation device 106 communicates with the system bus 161, the processor 163, the random access memory (RAM) 165, the storage 167, and an external device. It may include a network interface 38 for.
  • the computer program code for implementing the quantity allocation method according to the present invention may be stored in the storage 167, loaded into the RAM 165, and executed by the processor 163.
  • the quantity allocation device 106 may include information about a matching allocation rule, information about each allocation policy, and information about a configuration of a seller network, for at least some of the plurality of seller nodes.
  • the database 169 may further include an allocation result for each seller node included in the seller network.
  • the database 169 may be configured of a database management system (DBMS) and data storage, which may be located in an external device connected to the quantity allocation device 106 in a network.
  • DBMS database management system
  • program code of an allocation policy handler in which the storage 167 implements a specific allocation policy, may be stored.
  • the storage 167 may also store program code of a master handler that sequentially loads the allocation policy handler according to the information on the allocation rule stored in the database 169.
  • the master handler is provided with a command to perform an allocation rule that first performs a first allocation policy, and finally performs a second allocation policy, and loads and performs an allocation policy handler of the first allocation policy.
  • the allocation policy handler of the second allocation policy may be loaded and executed.
  • the allocation policy handler may be implemented in the form of a library that is dynamically loaded at runtime, for example, a DLL, an OCX, or a COM.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Quality & Reliability (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

L'invention concerne un procédé et un appareil d'attribution de quantité de produits qui prennent en charge chaque nœud de vendeur pour avoir une règle d'attribution séparée appliquée à ce dernier dans un procédé d'attribution d'une quantité de produits à chaque nœud de vendeur dans une technique descendante dans un réseau de vendeurs comprenant une pluralité de nœuds de vendeur ayant une relation de liaison hiérarchique. La présente invention comprend les étapes consistant : à mettre en correspondance une première règle d'attribution avec un premier nœud de vendeur parmi la pluralité de nœuds de vendeur ; à mettre en correspondance une seconde règle d'attribution différente de la première règle d'attribution avec un second nœud de vendeur différent du premier nœud de vendeur, parmi la pluralité de nœuds de vendeur ; à attribuer au moins certaines des quantités de produits pouvant être attribuées du premier nœud de vendeur à un sous-nœud de vendeur du premier nœud de vendeur, à l'aide de la première règle d'attribution ; et à attribuer au moins certaines des quantités de produits pouvant être attribuées du second nœud de vendeur à un sous-nœud de vendeur du second nœud de vendeur, à l'aide de la seconde règle d'attribution.
PCT/KR2015/003601 2014-04-11 2015-04-10 Procédé pour attribuer une quantité de produits à un nœud de vendeur et appareil correspondant WO2015156631A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR10-2014-0043549 2014-04-11
KR1020140043549A KR20150117875A (ko) 2014-04-11 2014-04-11 물량을 판매자 노드에 할당하는 방법 및 그 장치

Publications (1)

Publication Number Publication Date
WO2015156631A1 true WO2015156631A1 (fr) 2015-10-15

Family

ID=54288126

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2015/003601 WO2015156631A1 (fr) 2014-04-11 2015-04-10 Procédé pour attribuer une quantité de produits à un nœud de vendeur et appareil correspondant

Country Status (2)

Country Link
KR (1) KR20150117875A (fr)
WO (1) WO2015156631A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6188989B1 (en) * 1995-06-16 2001-02-13 I2 Technologies, Inc. System and method for managing available to promised product (ATP)
US20060011717A1 (en) * 2004-07-15 2006-01-19 Wolfram Schick ATP system communication interface
US7085729B1 (en) * 1995-06-16 2006-08-01 I2 Technologies Us, Inc. System and method for allocating manufactured products to sellers
JP2009199397A (ja) * 2008-02-22 2009-09-03 Nec Corp 在庫管理装置、その在庫管理方法、そのためのコンピュータプログラム
JP5347276B2 (ja) * 2008-02-01 2013-11-20 日本電気株式会社 在庫管理支援装置、在庫管理支援方法およびプログラム

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6188989B1 (en) * 1995-06-16 2001-02-13 I2 Technologies, Inc. System and method for managing available to promised product (ATP)
US7085729B1 (en) * 1995-06-16 2006-08-01 I2 Technologies Us, Inc. System and method for allocating manufactured products to sellers
US20060011717A1 (en) * 2004-07-15 2006-01-19 Wolfram Schick ATP system communication interface
JP5347276B2 (ja) * 2008-02-01 2013-11-20 日本電気株式会社 在庫管理支援装置、在庫管理支援方法およびプログラム
JP2009199397A (ja) * 2008-02-22 2009-09-03 Nec Corp 在庫管理装置、その在庫管理方法、そのためのコンピュータプログラム

Also Published As

Publication number Publication date
KR20150117875A (ko) 2015-10-21

Similar Documents

Publication Publication Date Title
WO2020017844A1 (fr) Procédé de surveillance d'une pluralité de grappes et d'applications dans une plateforme en nuage
US5732257A (en) Object conversion method from a flat object space to a class structured space
WO2018203635A1 (fr) Procédé de conteneurisation d'une application sur une plateforme en nuage
WO2020017843A1 (fr) Procédé d'attribution et de gestion de ressource de grappe sur une plateforme en nuage
US7730488B2 (en) Computer resource management method in distributed processing system
CN107545338B (zh) 业务数据处理方法及业务数据处理系统
CN109656879B (zh) 大数据资源管理方法、装置、设备及存储介质
WO2020017846A1 (fr) Procédé de fourniture de volume de conteneur d'application (stockage) dans une plateforme en nuage
US11669599B2 (en) Systems and methods for software license management
JP2007114983A (ja) サーバプール管理方法
WO2020192649A1 (fr) Système de gestion de centre de données
US9930006B2 (en) Method for assigning logical addresses to the connection ports of devices of a server cluster, and corresponding computer program and server cluster
US10817492B2 (en) Application extension
CN109213584B (zh) 任务执行方法、装置、电子设备及计算机可读存储介质
CN109150964A (zh) 一种可迁移的数据管理方法及服务迁移方法
WO2017188682A1 (fr) Nfvo ayant une fonction de gestion de licence de vnf et procédé de gestion de licence de vnf l'utilisant
CN115129423A (zh) 资源管理方法、装置、设备及存储介质
WO2015156631A1 (fr) Procédé pour attribuer une quantité de produits à un nœud de vendeur et appareil correspondant
WO2023182661A1 (fr) Dispositif électronique d'analyse de mégadonnées et son procédé de fonctionnement
CN111897627A (zh) 一种云计算资源配额管理方法和系统
CN113407108A (zh) 一种数据存储方法和系统
CN114090969B (zh) 多级多租户交叉授权管理方法
US20050138625A1 (en) Configuration management resource specification database design
US10992534B2 (en) Forming groups of nodes for assignment to a system management server
CN115629853A (zh) 一种任务调度的方法和装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15776322

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15776322

Country of ref document: EP

Kind code of ref document: A1