IP Library Granted Patent US 10,373,102
Granted Patent B2
US 10,373,102 · App. 15/087,569 · Granted Aug 6, 2019

System and method to incorporate node fulfillment capacity and capacity utilization in balancing fulfillment load across retail supply networks

Inventors: Ajay A. Deshpande (White Plains, NY); Saurabh Gupta (Irving, TX); Arun Hampapur (Norwalk, CT); Alan J. King (South Salem, NY); Ali Koc (White Plains, NY); Yingjie Li (Chappaqua, NY); Xuan Liu (Yorktown Heights, NY); Christopher S. Milite (Oxford, CT); Brian L. Quanz (Yorktown Heights, NY); Chek Keong Tan (Danbury, CT); Dahai Xing (White Plains, NY); Xiaobo Zheng (Shanghai, CN)
Assignee: International Business Machines Corporation
G06Q10/08345G06F3/0482G06F3/04847G06F16/148G06F16/1734G06F16/183G06F16/1844G06F16/2365G06N5/04G06N5/045G06N20/00G06Q10/0633G06Q10/06315G06Q10/06375G06Q10/083G06Q10/087G06Q10/0833G06Q10/0838G06Q10/0875G06Q30/0201G06Q30/0206G06Q30/0283G06Q30/0284G06Q30/0635H04L43/0882H04L43/16H04L43/0876
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,373,102
App. No.
15/087,569
Granted
Aug 6, 2019
Kind
B2
Abstract

A method and system for evaluating node fulfillment capacity in node order assignment. The method includes receiving a current order for node order assignment. The method also includes retrieving data of each node from a plurality of nodes, the retrieved data comprising current capacity utilization, capacity of a current day and capacity of a future day. The method then includes determining a probability of backlog on an expected ship date of each node, the probability of backlog being based on the retrieved current capacity utilization. Further, the method includes automatically converting the probability of backlog, backlog cost, and labor cost of each node into a capacity utilization cost of the each node using a capacity utilization cost model defining a set of predetermined capacity utilization threshold values. Then, the method includes automatically calculating a fulfillment cost of each node of the current order by adding a plurality of costs.

Claims (43)

1. A computer implemented method for evaluating node fulfillment capacity in node order assignment, comprising:

receiving a current order for node order assignment;

retrieving data of each node from a plurality of nodes, the retrieved data of each node comprising current capacity utilization;

determining a probability of backlog on an expected ship date of each node of the plurality of nodes, the probability of backlog being based on the retrieved current capacity utilization;

automatically converting the probability of backlog, backlog cost, and labor cost of each node of the plurality of nodes into a capacity utilization cost of each node of the plurality of nodes using a capacity utilization cost model defining a set of predetermined capacity utilization threshold values;

automatically calculating a fulfillment cost of each node of the plurality of nodes of the current order by adding a plurality of costs, the plurality of costs comprising shipping cost and the capacity utilization cost;

identifying one or more nodes from the plurality of nodes of the current order with the lowest fulfillment cost; and

automatically generating a node order assignment assigning the current order to one of the one or more nodes of the plurality of nodes with the lowest fulfillment cost.

2. The method of claim 1 , wherein the retrieved data of each node further comprising backlog data, capacity of a current day, and capacity of a future day.

3. The method of claim 2 , further comprising automatically calculating an actual capacity utilization on the expected ship date of each node of the plurality of nodes, the actual capacity utilization being based on the retrieved current capacity utilization, the capacity of a current day, the capacity of a future day, and the backlog data and wherein the capacity utilization cost model further uses the actual capacity utilization in determining the probability of backlog.

4. The method of claim 3 , wherein the actual capacity utilization is calculated by adding the result of the backlog divided by the capacity of a current day to the current capacity utilization, when the capacity of a current day is enough to fulfill the current order, and the actual capacity utilization is calculated by backlog on an expected ship date divided by the capacity of the expected ship day, the backlog on an expected ship date being calculated by adding the result of the current capacity utilization multiplied by the capacity of a current day to the backlog, and subtracting the result of the capacity of each day before the expected ship date multiplied by the backlog days of the current order before the expected ship date, when the capacity of a current day is not enough to fulfill the current order.

5. The method of claim 1 , wherein the probability of backlog is calculated by historical data of backlogged orders at the current capacity utilization divided by historical data of total orders at the current capacity utilization.

6. The method of claim 1 , wherein the probability of backlog is further based on hours left in the current day.

7. The method of claim 1 , further comprising determining a number of days of backlog on an expected ship date of each node of the plurality of nodes, the number of days of backlog being based on the retrieved current capacity utilization and wherein the capacity utilization cost model further considers the number of days of backlog in determining the capacity utilization cost of each node of the plurality of nodes.

8. A computer system for determining node order assignment, comprising:

a memory; and

a processor configured to:

receiving a current order for node order assignment;

retrieving data of each node from a plurality of nodes, the retrieved data of each node comprising current capacity utilization;

determining a probability of backlog on an expected ship date of each node of the plurality of nodes, the probability of backlog being based on the retrieved current capacity utilization;

automatically converting the probability of backlog, backlog cost, and labor cost of each node of the plurality of nodes into a capacity utilization cost of each node of the plurality of nodes using a capacity utilization cost model defining a set of predetermined capacity utilization threshold values;

automatically calculating a fulfillment cost of each node of the plurality of nodes of the current order by adding a plurality of costs, the plurality of costs comprising shipping cost and the capacity utilization cost;

identifying one or more nodes from the plurality of nodes of the current order with the lowest fulfillment cost; and

automatically generating a node order assignment assigning the current order to one of the one or more nodes of the plurality of nodes with the lowest fulfillment cost.

9. The computer system of claim 8 , wherein the retrieved data further comprising backlog data, capacity of a current day, and capacity of a future day and further comprising automatically calculating an actual capacity utilization on the expected ship date of each node of the plurality of nodes, the actual capacity utilization being based on the retrieved current capacity utilization, the capacity of a current day, the capacity of a future day, and the backlog data and wherein the capacity utilization cost model further uses the actual capacity utilization in determining the probability of backlog.

10. The computer system of claim 9 , wherein the actual capacity utilization is calculated by adding the result of the backlog divided by the capacity of a current day to the current capacity utilization, when the capacity of a current day is enough to fulfill the current order, and the actual capacity utilization is calculated by backlog on an expected ship date divided by the capacity of the expected ship day, the backlog on an expected ship date being calculated by adding the result of the current capacity utilization multiplied by the capacity of a current day to the backlog, and subtracting the result of the capacity of each day before the expected ship date multiplied by the backlog days of the current order before the expected ship date, when the capacity of a current day is not enough to fulfill the current order.

11. The computer system of claim 8 , wherein the probability of backlog is calculated by historical data of backlogged orders at the current capacity utilization divided by historical data of total orders at the current capacity utilization.

12. The computer system of claim 8 , wherein the probability of backlog is further based on hours left in the current day.

13. The computer system of claim 8 , further comprising determining a number of days of backlog on an expected ship date of each node of the plurality of nodes, the number of days of backlog being based on the retrieved current capacity utilization and wherein the capacity utilization cost model further considers the number of days of backlog in determining the capacity utilization cost of each node of the plurality of nodes.

14. The computer system of claim 8 , wherein the capacity of a current day is collected from a planned daily capacity database, the current capacity utilization is based on a node unit assignment database, the backlog data is collected from a backlog database, the backlog cost is collected from a backlog cost database, the labor cost is collected from a labor cost database, and the predetermined capacity utilization threshold is collected from a capacity utilization target range database.

15. A non-transitory article of manufacture tangibly embodying computer readable instructions, which when implemented, cause a computer to perform the steps of a method for determining node order assignment, comprising:

receiving a current order for node order assignment;

retrieving data of each node from a plurality of nodes, the retrieved data of each node comprising current capacity utilization;

determining a probability of backlog on an expected ship date of each node of the plurality of nodes, the probability of backlog being based on the retrieved current capacity utilization;

automatically converting the probability of backlog, backlog cost, and labor cost of each node of the plurality of nodes into a capacity utilization cost of each node of the plurality of nodes using a capacity utilization cost model defining a set of predetermined capacity utilization threshold values;

automatically calculating a fulfillment cost of each node of the plurality of nodes of the current order by adding a plurality of costs, the plurality of costs comprising shipping cost and the capacity utilization cost;

identifying one or more nodes from the plurality of nodes of the current order with the lowest fulfillment cost; and

automatically generating a node order assignment assigning the current order to one of the one or more nodes of the plurality of nodes with the lowest fulfillment cost.

16. A non-transitory article of manufacture of claim 15 , wherein the retrieved data further comprising backlog data, capacity of a current day, and capacity of a future day and further comprising automatically calculating an actual capacity utilization on the expected ship date of each node of the plurality of nodes, the actual capacity utilization being based on the retrieved current capacity utilization, the capacity of a current day, the capacity of a future day and the backlog data and wherein the capacity utilization cost model further uses the actual capacity utilization in determining the probability of backlog.

17. A non-transitory article of manufacture of claim 16 , wherein the actual capacity utilization is calculated by adding the result of the backlog divided by the capacity of a current day to the current capacity utilization, when the capacity of a current day is enough to fulfill the current order, and the actual capacity utilization is calculated by backlog on an expected ship date divided by the capacity of the expected ship day, the backlog on an expected ship date being calculated by adding the result of the current capacity utilization multiplied by the capacity of a current day to the backlog, and subtracting the result of the capacity of each day before the expected ship date multiplied by the backlog days of the current order before the expected ship date, when the capacity of a current day is not enough to fulfill the current order.

18. A non-transitory article of manufacture of claim 15 , wherein the probability of backlog is calculated by historical data of backlogged orders at the current capacity utilization divided by historical data of total orders at the current capacity utilization.

19. A non-transitory article of manufacture of claim 15 , wherein the probability of backlog is further based on hours left in the current day.

20. A non-transitory article of manufacture of claim 15 , further comprising determining a number of days of backlog on an expected ship date of each node of the plurality of nodes, the number of days of backlog being based on the retrieved current capacity utilization and wherein the capacity utilization cost model further considers the number of days of backlog in determining the capacity utilization cost of each node of the plurality of nodes.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 15, 2021
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: DOORDASH, INC.
Reel/Frame 057826/0939 →
CORRECTIVE ASSIGNMENT TO CORRECT THE NAME OF ASSIGNOR XIAOBO ZHENG PREVIOUSLY RECORDED AT REEL: 038175 FRAME: 0849. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Jul 13, 2016
From: DESHPANDE, AJAY A.; GUPTA, SAURABH; HAMPAPUR, ARUN; KING, ALAN J.; KOC, ALI; LI, YINGJIE; LIU, XUAN; MILITE, CHRISTOPHER S.; QUANZ, BRIAN L.; TAN, CHEK KEONG; XING, DAHAI; ZHENG, XIAOBO
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 039335/0088 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 1, 2016
From: DESHPANDE, AJAY A.; GUPTA, SAURABH; HAMPAPUR, ARUN; KING, ALAN J.; KOC, ALI; LI, YINGJIE; LIU, XUAN; MILITE, CHRISTOPHER S.; QUANZ, BRIAN L.; TAN, CHEK KEONG; XING, DAHAI; ZHENG, XIAO BO
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 038175/0849 →
Continuity (2)
Provisional Application 62279738 · Jan 16, 2016
Related Publication 20170206499A1 · Jul 20, 2017
Cited By (2)
US 12,373,772 US 12,437,265