IP Library Granted Patent US 7,539,630
Granted Patent B2
US 7,539,630 · App. 10/287,775 · Granted May 26, 2009

System, method, and computer program for replenishment by manufacture with attribute based planning

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 7,539,630
App. No.
10/287,775
Granted
May 26, 2009
Kind
B2
Abstract

A system and method for determining whether a supply chain network resource may be replenished by manufacture in order to meet demand as defined by an order. The system and method is an attribute-based system and method that may be part of an overall system and method for planning the use of supply chain network resources. The planning system and method may use configurations and bills of material, both of which may be defined by stock keeping units, subordinate stock keeping units and stock keeping unit attribute definition groups, in order to determine whether a resource may be replenished by manufacture. In determining a solution, the system and method may take into account, user and customer preferences including scheduling goals.

Claims (55)

1. An attribute-based method for planning replenishment of goods by manufacture of resources within a supply chain network, comprising:

modeling the supply chain network by defining stock keeping units (SKU) associated with the resources within the supply chain network;

creating a plurality of SKU attribute groups, each SKU attribute group defined by item identifier, location, date, quantity, priority, and customer, wherein a given SKU belongs to a given SKU attribute group provided the SKU has at least the attributes defined by the SKU attribute group;

inputting orders for goods each having attributes of customer name, order identification, SKU, goods identification, location, date, and quantity;

assigning a priority for each order for goods;

selecting a highest priority order for planning the replenishment of goods using the resources within the supply chain network;

generating a configuration of resources needed to fill the highest priority order based on the SKU attribute groups, the configuration including subordinate SKU which are needed to fill the order;

evaluating the configurations for feasibility, the configuration being feasible if all subordinates SKU in the configuration are available for the replenishment of goods in a planning interval; and

selecting the configuration that is feasible for planning purposes to fill the highest priority order.

2. The attribute-based method of claim 1 , wherein selecting the configuration that is feasible is made by selecting a first feasible configuration.

3. The attribute-based method of claim 1 , wherein selecting the configuration that is feasible is made by selecting a configuration that is suitable for a scheduling goal.

4. The attribute-based method of claim 3 , wherein the scheduling goal is just-in-time.

5. The attribute-based method of claim 3 , wherein the scheduling goal is forward.

6. The attribute-based method of claim 3 , wherein the scheduling goal is backward.

7. An attribute-based method for planning replenishment of goods by manufacture of resources within a supply chain network, comprising:

modeling the supply chain network by defining stock keeping units (SKU) associated with the resources within the supply chain network;

creating a plurality of SKU attribute groups, wherein a given SKU belongs to a given SKU attribute group provided the SKU has at least the attributes defined by the SKU attribute group;

inputting orders for goods each having attributes;

assigning a priority for each order for goods;

selecting a highest priority order for planning the replenishment of goods using the resources within the supply chain network;

generating a configuration of resources needed to fill the highest priority order based on the SKU attribute groups, the configuration including subordinate SKU which are needed to fill the order;

evaluating the configurations for feasibility, the configuration being feasible if all subordinates SKU in the configuration are available for the replenishment of goods in a planning interval; and

selecting a configuration that is feasible for planning purposes to fill the highest priority order.

8. The attribute-based method of claim 7 , wherein each, SKU attribute group is defined by item identifier, location, date, quantity, priority, and customer.

9. The attribute-based method of claim 7 , wherein the attributes of the orders include customer name, order identification, SKU, goods identification, location, date, and quantity.

10. The attribute-based method of claim 7 , wherein selecting the configuration that is feasible is made by selecting a first feasible configuration.

11. The attribute-based method of claim 7 , wherein selecting the configuration that is feasible is made by selecting a configuration that is suitable for a scheduling goal.

12. The attribute-based method of claim 11 , wherein the scheduling goal is just-in-time, forward, or backward.

13. A computer program product usable with a programmable computer processor having computer readable program code embodied therein which performs an attribute-based method for planning replenishment of goods by manufacture of resources within a supply chain network, comprising:

computer readable program code which models the supply chain network by defining stock keeping units (SKU) associated with the resources within the supply chain network;

computer readable program code which creates a plurality of SKU attribute groups, wherein a given SKU belongs to a given SKU attribute group provided the SKU has at least the attributes defined by the SKU attribute group;

computer readable program code which inputs orders for goods each having attributes;

computer readable program code which assigns a priority for, each order for goods;

computer readable program code which selects a highest priority order for planning the replenishment using the resources within the supply chain network;

computer readable program code which generates a configuration of resources needed to fill the highest priority order based on the SKU attribute groups, the configuration including subordinate SKU which are needed to fill the order;

computer readable program code which evaluates the configurations for feasibility, the configuration being feasible if all subordinates SKU in the configuration are available for the replenishment of goods in a planning interval; and

computer readable program code which selects the configuration that is feasible for planning purposes to fill the highest priority order.

14. The computer program product of claim 13 , wherein each SKU attribute group is defined by item identifier, location, date, quantity, priority, and customer.

15. The computer program product of claim 13 , wherein the attributes of the orders include customer name, order identification, SKU, goods identification, location, date, and quantity.

16. The computer program product of claim 13 , wherein selecting the configuration that is feasible is made by selecting a configuration that is suitable for a scheduling goal.

17. The computer program product of claim 16 , wherein the scheduling goal is just-in-time, forward, or backward.

18. A computer system for using an attribute-based method for planning replenishment of goods by manufacture of resources within a supply chain network, comprising:

means for modeling the supply chain network by defining stock keeping units (SKU) associated with the resources within the supply chain network;

means for creating a plurality of SKU attribute groups, wherein a given SKU belongs to a given SKU attribute group provided the SKU has at least the attributes defined by the SKU attribute group;

means for inputting orders for goods each having attributes;

means for assigning a priority for each order for goods;

means for selecting a highest priority order for planning the replenishment using the resources within the supply chain network;

means for generating a configuration of resources needed to fill the highest priority order based on the SKU attribute groups, the configuration including subordinate SKU which are needed to fill the order;

means for evaluating the configurations for feasibility, the configuration being feasible if all subordinates SKU in the configuration are available for the replenishment of goods in a planning interval; and

means for selecting the configuration that is feasible for planning purposes to fill the highest priority order.

19. The computer system of claim 18 , wherein each SKU attribute group is defined by item identifier, location, date, quantity, priority, and customer.

20. The computer system of claim 18 , wherein the attributes of the orders include customer name, order identification, SKU, goods identification, location, date, and quantity.

21. The computer system of claim 18 , wherein selecting the configuration that is feasible is made by selecting a first feasible configuration.

22. The computer system of claim 18 , wherein selecting the configuration that is feasible is made by selecting a configuration that is suitable for a scheduling goal.

23. The computer system of claim 22 , wherein the scheduling goal is just-in-time, forward, or backward.

Assignments (12)
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053383/0117) Recorded Nov 3, 2021
From: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT
To: BLUE YONDER GROUP, INC.
Reel/Frame 058794/0776 →
RELEASE OF SECURITY INTEREST Recorded Sep 16, 2021
From: JPMORGAN CHASE BANK, N.A.
To: BLUE YONDER GROUP, INC.; BLUE YONDER, INC.; JDA SOFTWARE SERVICES, INC.; I2 TECHNOLOGIES INTERNATIONAL SERVICES, LLC; MANUGISTICS SERVICES, INC.; MANUGISTICS HOLDINGS DELAWARE II, INC.; REDPRAIRIE COLLABORATIVE FLOWCASTING GROUP, LLC; JDA SOFTWARE RUSSIA HOLDINGS, INC.; REDPRAIRIE SERVICES CORPORATION; BY BOND FINANCE, INC.; BY NETHERLANDS HOLDING, INC.; BY BENELUX HOLDING, INC.
Reel/Frame 057724/0593 →
SECURITY AGREEMENT Recorded Aug 3, 2020
From: BLUE YONDER GROUP, INC.
To: U.S. BANK NATIONAL ASSOCIATION
Reel/Frame 053383/0117 →
CHANGE OF NAME Recorded Apr 14, 2020
From: JDA SOFTWARE GROUP, INC.
To: BLUE YONDER GROUP, INC.
Reel/Frame 052392/0604 →
SECURITY AGREEMENT Recorded Oct 12, 2016
From: RP CROWN PARENT, LLC; RP CROWN HOLDING LLC; JDA SOFTWARE GROUP, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 040326/0449 →
RELEASE OF SECURITY INTEREST IN PATENTS AT REEL/FRAME NO. 29556/0809 Recorded Oct 12, 2016
From: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
To: JDA SOFTWARE GROUP, INC.
Reel/Frame 040337/0356 →
RELEASE OF SECURITY INTEREST IN PATENTS AT REEL/FRAME NO. 29556/0697 Recorded Oct 12, 2016
From: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
To: JDA SOFTWARE GROUP, INC.
Reel/Frame 040337/0053 →
FIRST LIEN PATENT SECURITY AGREEMENT Recorded Jan 2, 2013
From: JDA SOFTWARE GROUP, INC.
To: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
Reel/Frame 029556/0697 →
FIRST LIEN PATENT SECURITY AGREEMENT Recorded Jan 2, 2013
From: JDA SOFTWARE GROUP, INC.
To: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
Reel/Frame 029556/0809 →
RELEASE OF SECURITY INTEREST IN PATENT COLLATERAL Recorded Dec 21, 2012
From: WELLS FARGO CAPITAL FINANCE, LLC
To: JDA SOFTWARE GROUP, INC.
Reel/Frame 029538/0300 →
PATENT SECURITY AGREEMENT Recorded Apr 4, 2011
From: JDA SOFTWARE GROUP, INC.
To: WELLS FARGO CAPITAL FINANCE, LLC, AS AGENT
Reel/Frame 026073/0392 →
RELEASE OF SECURITY INTEREST Recorded Apr 13, 2010
From: CITICORP NORTH AMERICA, INC., AS COLLATERAL AGENT
To: JDA SOFTWARE GROUP, INC.; JDA SOFTWARE, INC.; JDA WORLDWIDE, INC.; MANUGISTICS CALIFORNIA, INC.; MANUGISTICS GROUP, INC.; MANUGISTICS HOLDINGS DELAWARE II, INC.; MANUGISTICS HOLDINGS DELAWARE, INC.; MANUGISTICS SERVICES, INC.; MANUGISTICS, INC.; STANLEY ACQUISITION CORP.
Reel/Frame 024225/0271 →