# US 2022/0036307 A1 · Systems and methods for inventory reshuffling and rebalancing

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0036307 A1
- Document ID: US20220036307A1
- Status: Published application
- Kind: A1
- Application number: 17/178,513
- Filed: 2021-02-18
- Published: 2022-02-03
- Earliest claimed: 2020-07-31
- Assignees: Coupang Corp.
- Applicants: Coupang Corp.
- Inventors: Je KIM
- Web page: https://patentgrep.com/patent/US20220036307A1

## CPC

- G06Q 10/08: Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q 10/0875: Itemisation or classification of parts, supplies or services, e.g. bill of materials
- G06Q 30/0635: {replenishment orders; recurring orders}
- 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

## Abstract

A computer-implemented system and method for automated inventory using data associated with stock keeping unit SKU and fulfillment centers (FC) to initialize a data structure comprising a plurality of nodes, determine a weight associated with each FC based on the capacity of each FC, assignment SKU to one or more FCs, perform a preliminary mapping for the plurality of FCs, determining whether to rebalance the preliminary mapping of the quantity, and rebalancing the preliminary mapping based on the weights associated with each FC, to promote maximum utilization of the network.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A computer-implemented system for automated inventory shuffling, comprising:
at least one processor;
a memory comprising instructions that, when executed by the at least one processor, performs steps comprising:
receive information comprising data regarding a network of a plurality of fulfillment centers (FCs), the data comprising a capacity of each FC;
determine, based on the capacity of each FC, a weighting factor associated with each FC relative to the received FC capacities, wherein the weighting factor is associated with an inbound capacity of the respective FC and an inventory level in the respective FC;
receive, for assignment to one or more FCs, a product identifier associated with a product, the identifier associated with a quantity and a minimum order quantity, wherein the product identifiers are divided into one or more categories by:
receiving information associated with a plurality of product identifiers, the information comprising demand of each product identifier;
assigning a plurality of subsets of the product identifiers with highest demand forecast quantities to a first set of categories; and
assigning the remaining subsets of the product identifiers with the next highest demand forecast quantities to a second set of categories; and
perform a preliminary mapping of the quantity to the plurality of FCs based on the associated minimum order quantity;
determine a category associated with the product identifier;
based on determining that the product identifier is associated with the first set of categories, rebalancing the preliminary mapping of the quantity; and
forward instructions to a computer system to cause a received quantity to be delivered to the network based on the preliminary mapping.

### Claim 22 (depends on 21)

The computer-implemented system of claim 21, wherein:
the quantity comprises at least a safety reorder quantity and a cycle reorder quantity; and
rebalancing the preliminary mapping of the quantity comprises rebalancing the safety reorder quantity across the network.

### Claim 23 (depends on 21)

The computer-implemented system of claim 21, wherein:
the quantity comprises at least a safety reorder quantity and a band associated with relative ranking of sales quantity; and
rebalancing the preliminary mapping of the quantity comprises rebalancing the safety reorder quantity across the network.

### Claim 24 (depends on 21)

The computer-implemented system of claim 21, wherein:
the at least one processor initializes a data structure comprising a plurality of nodes, the number of nodes equal to the number of FCs.

### Claim 25 (depends on 21)

The computer-implemented system of claim 21, wherein the quantity of the product identifier comprises at least one of a sum of demand forecast quantities for the product over a first period of time and a sum of safety stock quantities for the product over a second period of time.

### Claim 26 (depends on 21)

The computer-implemented system of claim 21, wherein the quantity of the product identifier is determined based on a number of incoming orders for the associated product.

### Claim 27 (depends on 21)

The computer-implemented system of claim 21, wherein the cycle reorder quantity is adjusted with expected demand.

### Claim 28 (depends on 21)

The computer-implemented system of claim 21, wherein rebalancing the preliminary mapping comprises evaluating a cost function for each FC.

### Claim 29 (depends on 28)

The computer-implemented system of claim 28, wherein the cost function comprises determining a cost value for each FC based on the quantity associated with the product identifier, a reorder quantity associated with the product identifier, and an FC utilization value.

### Claim 30 (depends on 29)

The computer-implemented system of claim 29, wherein the steps further comprise assigning a higher proportion of the quantity to an FC having a lowest associated cost value.

### Claim 31

A computer-implemented method for inventory shuffling, the method being performed by at least one processor executing stored instructions to perform steps comprising:
receive information comprising data regarding a network of a plurality of fulfillment centers (FCs), the data comprising a capacity of each FC;
determine, based on the capacity of each FC, a weighting factor associated with each FC relative to the received FC capacities, wherein the weighting factor is associated with an inbound capacity of the respective FC and an inventory level in the respective FC;
receive, for assignment to one or more FCs, a product identifier associated with a product, the identifier associated with a quantity and a minimum order quantity, wherein the product identifiers are divided into one or more categories by:
receiving information associated with a plurality of product identifiers, the information comprising demand of each product identifier;
assigning a plurality of subsets of the product identifiers with highest demand forecast quantities to a first set of categories; and
assigning the remaining subsets of the product identifiers with the next highest demand forecast quantities to a second set of categories; and
perform a preliminary mapping of the quantity to the plurality of FCs based on the associated minimum order quantity;
determine a category associated with the product identifier;
based on determining that the product identifier is associated with the first set of categories, rebalancing the preliminary mapping of the quantity; and
forward instructions to a computer system to cause a received quantity to be delivered to the network based on the preliminary mapping.

### Claim 32 (depends on 31)

The computer-implemented method of claim 31, wherein:
the quantity comprises at least a safety reorder quantity and a cycle reorder quantity; and
rebalancing the preliminary mapping of the quantity comprises rebalancing the safety reorder quantity across the network.

### Claim 33 (depends on 31)

The computer-implemented method of claim 31, wherein:
the quantity comprises at least a safety reorder quantity and a band associated with relative ranking of sales quantity; and
rebalancing the preliminary mapping of the quantity comprises rebalancing the safety reorder quantity across the network.

### Claim 34 (depends on 31)

The computer-implemented method of claim 31, wherein:
the at least one processor initializes a data structure comprising a plurality of nodes, the number of nodes equal to the number of FCs.

### Claim 35 (depends on 31)

The computer-implemented method of claim 31, wherein the quantity of the product identifier comprises at least one of a sum of demand forecast quantities for the product over a first period of time and a sum of safety stock quantities for the product over a second period of time.

### Claim 36 (depends on 31)

The computer-implemented method of claim 31, wherein the quantity of the product identifier is determined based on a number of incoming orders for the associated product.

### Claim 37 (depends on 31)

The computer-implemented method of claim 31, wherein the cycle reorder quantity is adjusted with expected demand.

### Claim 38 (depends on 31)

The computer-implemented method of claim 31, wherein rebalancing the preliminary mapping comprises evaluating a cost function for each FC.

### Claim 39 (depends on 38)

The computer-implemented method of claim 38, wherein the steps further comprise assigning a higher proportion of the quantity to an FC having a lowest associated cost value.

### Claim 40

A computer-implemented method inventory shuffling, the method being performed by at least one processor of a networked server executing stored instructions to perform steps comprising:
receive information comprising data regarding a network of a plurality of fulfillment centers (FCs), the data comprising an inbound capacity and a total capacity of each FC;
determine, based on a ratio of the inbound capacity and the total capacity, a utilization value for each FC;
receive, for assignment to one or more FCs, a product identifier associated with a product, the identifier associated with a quantity and a minimum order quantity, wherein the product identifiers are divided into one or more categories by:
receiving information associated with a plurality of product identifiers with highest demand forecast quantities to a first set of categories and;
assigning the remaining subsets of the product identifiers with the next highest demand forecast quantities to a second set of categories and;
perform a preliminary mapping of the quantity to the plurality of FCs based on the associated minimum order quantity;
determine a category associated with the product identifier;
based on determining that the product identifier is associated with the first set of categories, rebalancing the preliminary mapping of the quantity based on the utilization value associated with each FC; and
forward instructions to a computer system to cause a received quantity to be delivered to the network based on the preliminary mapping.
