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

Patent metadata

Field	Value
Publication number	US-11074544-B2
Application number	US-201916445568-A
Country	US
Kind code	B2
Filing date	Jun 19, 2019
Priority date	Jan 16, 2016
Publication date	Jul 27, 2021
Grant date	Jul 27, 2021

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.

First claim

What is claimed is:

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;
determining a capacity utilization cost of each node of the plurality of nodes based on the probability of backlog on the expected ship date;
automatically calculating a fulfillment cost of each node of the plurality of nodes of the current order based on 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.

4. The method of claim 3 , wherein the actual capacity utilization is calculated by adding the backlog on the expected ship date 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 the 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 the 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 determining the capacity utilization cost is further based on the number of days of backlog on the expected ship date 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;
determining a capacity utilization cost of each node of the plurality of nodes based on the probability of backlog on the expected ship date;
automatically calculating a fulfillment cost of each node of the plurality of nodes of the current order based on 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.

10. The computer system of claim 9 , wherein the actual capacity utilization is calculated by adding the backlog on the expected ship date 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 the 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 the 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 determining the capacity utilization cost is further based on the number of days of backlog on the expected ship date 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;
determining a capacity utilization cost of each node of the plurality of nodes based on the probability of backlog on the expected ship date;
automatically calculating a fulfillment cost of each node of the plurality of nodes of th

Assignees

• IBM

Inventors

• 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

Classifications

• G06N5/01

  Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound · CPC title

• G06N5/04

  Inference or reasoning models · CPC title

• H04L43/0876

  Network utilisation, e.g. volume of load or congestion level · CPC title

• G06F3/04847

  Interaction techniques to control parameter settings, e.g. interaction with sliders or dials · CPC title

• G06Q30/0201

  Market modelling; Market analysis; Collecting market data · CPC title