IDiyas

For the Inventor, By the Inventor

The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Patent No.:

US 11074544 B1

PDFFull Text
Date of Patent:
Jul. 27, 2021

Filed:

Jun. 19, 2019

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

Applicant:

International Business Machines Corporation, Armonk, NY (US);

Inventors:

Ajay A. Deshpande, White Plains, NY (US);

Saurabh Gupta, Irving, TX (US);

Arun Hampapur, Norwalk, CT (US);

Alan J. King, South Salem, NY (US);

Ali Koc, White Plains, NY (US);

Yingjie Li, Chappaqua, NY (US);

Xuan Liu, Yorktown Heights, NY (US);

Christopher S. Milite, Oxford, CT (US);

Brian L. Quanz, Yorktown Heights, NY (US);

Chek Keong Tan, Danbury, CT (US);

Dahai Xing, White Plains, NY (US);

Xiaobo Zheng, Shanghai, CN;

Assignee:

International Business Machines Corporation, Armonk, NY (US);

Attorneys:

Scully, Scott, Murphy & Presser, PC

Joseph Petrokaitis, Esq.

Primary Examiner:

Talia F Crawley

Int. Cl.
CPC ...
G06Q 50/28 (2012.01); G06Q 10/06 (2012.01); G06Q 30/00 (2012.01); G06Q 10/08 (2012.01); G06Q 30/02 (2012.01); G06N 20/00 (2019.01); G06F 16/14 (2019.01); G06F 16/182 (2019.01); G06F 16/17 (2019.01); G06F 16/23 (2019.01); G06N 5/00 (2006.01); G06F 3/0482 (2013.01); G06F 3/0484 (2013.01); G06Q 30/06 (2012.01); H04L 12/26 (2006.01); G06N 5/04 (2006.01);
U.S. Cl.
CPC ...
G06Q 10/08345 (2013.01); G06F 3/0482 (2013.01); G06F 3/04847 (2013.01); G06F 16/148 (2019.01); G06F 16/1734 (2019.01); G06F 16/183 (2019.01); G06F 16/1844 (2019.01); G06F 16/2365 (2019.01); G06N 5/003 (2013.01); G06N 5/04 (2013.01); G06N 5/045 (2013.01); G06N 20/00 (2019.01); G06Q 10/0633 (2013.01); G06Q 10/06315 (2013.01); G06Q 10/06375 (2013.01); G06Q 10/083 (2013.01); G06Q 10/087 (2013.01); G06Q 10/0833 (2013.01); G06Q 10/0838 (2013.01); G06Q 10/0875 (2013.01); G06Q 30/0201 (2013.01); G06Q 30/0206 (2013.01); G06Q 30/0283 (2013.01); G06Q 30/0284 (2013.01); G06Q 30/0635 (2013.01); H04L 43/0882 (2013.01); H04L 43/16 (2013.01); H04L 43/0876 (2013.01);
Abstract

Evaluating node fulfillment capacity in node order assignment by receiving a current order for node order assignment, retrieving data of each node, the retrieved data of each node including current capacity utilization, 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, determining a capacity utilization cost of each node based on the probability of backlog on the expected ship date, automatically calculating a fulfillment cost of each node of the current order based on the capacity utilization cost, identifying one or more nodes for 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 with the lowest fulfillment cost.

Find Patent Forward Citations

Loading…