Patent US6898472B2 successfully refreshed from Google Patents.
← Back to Patent Explorer
US6898472B2 Expired / Lapsed US ⏱️ 0.0 years remaining

System and method for order group planning with attribute based planning

Assignee: Blue Yonder Group Inc
•
Filing: 2002-11-05
•
Granted: 2005-05-24
•
Expires: 2022-11-05
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A system and method for planning the use of supply chain network resources by processing one or more groups of orders. The system and method is an attribute based rather than an order or stock keeping unit based system and method allowing for greater flexibility and improved simplicity in obtaining planning solutions. The system and method defining stock keeping unit attribute definition groups, which allows orders to be prioritized and organized into slices of orders such that an optimal planning solution is generated.

Inventors

  • 👤 Myrick Crampton
  • 👤 Sunil Soman

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-28 13:47
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/06

Claims Analysis

Total Claims: 37
Claim 1
Independent Claim 226 words
A method for planning the use of resources in order to satisfy demand as defined by a group of orders, comprising the steps of: creating SKU attributes definition (SAD) groups, said SAD groups are associated with orders based on shared attributes of said orders; prioritizing said SAD groups and said orders within said SAD groups based on at least one of said SAD groups; loading a slice of said orders into a window based on said priority of said orders; associating said loaded orders to buildable configurations for each loaded order; selecting a highest priority order from said window based on said priority of each said orders loaded into said window; selecting required resources for fulfilling said selected highest priority order based on a particular buildable configuration associated with said selected highest priority order; making an initial assignment of said selected resources, said initial assignment preventing future conflicting assignments of said resources to lower priority orders; and repeatedly selecting a next highest priority order from said window and repeating said selecting of a resource for fulfilling and said making of an initial assignment for said next highest priority order until each of said loaded slice of orders have been selected and initial assignments are made, or until a resource constraint is met; said resource constraint being associated with said window and one of said reqiuired resources.
Claim 2
Independent Claim 226 words
A method for planning the use of resources in order to satisfy demand as defined by a group of orders, comprising the steps of: creating SKU attributes definition (SAD) groups, said SAD groups are associated with orders based on shared attributes of said orders; prioritizing said SAD groups and said orders within said SAD groups based on at least one of said SAD groups; loading a slice of said orders into a window based on said priority of said orders; associating said loaded orders to buildable configurations for each loaded order; selecting a highest priority order from said window based on said priority of each said orders loaded into said window; selecting required resources for fulfilling said selected highest priority order based on a particular buildable configuration associated with said selected highest priority order; making an initial assignment of said selected resources, said initial assignment preventing future conflicting assignments of said resources to lower priority orders; and repeatedly selecting a next highest priority order from said window and repeating said selecting of a resource for fulfilling and said making of an initial assignment for said next highest priority order until each of said loaded slice of orders have been selected and initial assignments are made, or until a resource constraint is met; said resource constraint being associated with said window and one of said reqiuired resources.
Claim 3
Dependent Claim 23 words
The method according to claim 1 , further comprising creating a temporary table of unplanned orders to store said orders in said window.
Claim 4
Dependent Claim 23 words
The method according to claim 1 , further comprising creating a static model of said resources and using said static model for planning.
Claim 5
Dependent Claim 15 words
The method according to claim 1 , further comprising comprises the step of initializing buckets.
Claim 6
Dependent Claim 19 words
The method according to claim 4 , wherein said bucket is associated with a specified resource and time interval.
Claim 7
Dependent Claim 20 words
The method according to claim 4 , wherein said initializing of buckets further comprises placing one or more auxiliary constraints.
Claim 8
Dependent Claim 47 words
The method according to claim 1 , further comprising loading a second slice of orders after said slice of orders have been selected and initial assignments made, said initial assignments for said slice of orders being treated as a resource constraint for said second slice of orders.
Claim 9
Dependent Claim 17 words
The method according to claim 1 , further comprising creating a pre-determined assignments table for frozen orders.
Claim 10
Dependent Claim 19 words
The method according to claim 8 , further comprising storing data relating to orders that need to be pre-assigned.
Claim 11
Dependent Claim 17 words
The method according to claim 9 , further comprising placing a pre-assignment into one of said buckets.
Claim 12
Dependent Claim 15 words
The method according to claim 10 , further comprising allocating materials based on said pre-assignment.
Claim 13
Dependent Claim 25 words
The method according to claim 1 , further comprising loading into said window said configuration and bill of material data relating to said loaded orders.
Claim 14
Dependent Claim 32 words
The method according to claim 1 , wherein said step for selecting a resource for fulfilling said selected highest priority order is based on attributes of said selected order from said window.
Claim 15
Dependent Claim 180 words
An attribute based method for planning the use of manufacturing network resources to fulfill demand as defined by orders by prioritizing and planning the orders according to their assigned priority, comprising the steps of: organizing said orders into groups, wherein said orders having at least two attributes; prioritizing each group to have a relative group priority; prioritizing each order within each said group based on attributes of each said order so as to have a relative order priority within each said group; associating said orders to buildable configurations; and planning the use of at least one of said resources in order to fulfill said demand, wherein higher priority orders are planned first before lower priority orders based on said group priority of each order in each said group; and using said configuration associated with each order in order to select at least one of said resources for use in order to fulfill said demand, each selected resource being reserved as an initial assignment of said selected resources so as to prevent lesser priority orders from being overscheduled for said resource.
Claim 16
Dependent Claim 180 words
An attribute based method for planning the use of manufacturing network resources to fulfill demand as defined by orders by prioritizing and planning the orders according to their assigned priority, comprising the steps of: organizing said orders into groups, wherein said orders having at least two attributes; prioritizing each group to have a relative group priority; prioritizing each order within each said group based on attributes of each said order so as to have a relative order priority within each said group; associating said orders to buildable configurations; and planning the use of at least one of said resources in order to fulfill said demand, wherein higher priority orders are planned first before lower priority orders based on said group priority of each order in each said group; and using said configuration associated with each order in order to select at least one of said resources for use in order to fulfill said demand, each selected resource being reserved as an initial assignment of said selected resources so as to prevent lesser priority orders from being overscheduled for said resource.
Claim 17
Dependent Claim 33 words
The method of claim 14 , wherein said orders have an attribute for a customer type and said customer type attribute is used to prioritize each order belonging to one of said groups.
Claim 18
Dependent Claim 32 words
The method of claim 14 , wherein said orders have an attribute for a need date and said need date is used to prioritize each order belonging to one of said groups.
Claim 19
Dependent Claim 43 words
The method of claim 14 , wherein said order priority of each order belonging to one of said groups is based on capacity allocation, wherein said capacity allocation reserves resource capacity to one of said orders based on one of said order attributes.
Claim 20
Dependent Claim 15 words
The method of claim 17 , wherein said order attributes include a customer identification attribute.
Claim 21
Dependent Claim 41 words
The method of claim 14 , wherein said priority of each order belonging to one of said groups is based on material allocation, wherein said material allocation reserves inventory to one of said orders based on one of said order attributes.
Claim 22
Dependent Claim 15 words
The method of claim 19 , wherein said order attributes include a customer identification attribute.
Claim 23
Independent Claim 257 words
A system for planning the use of supply chain manufacturing resources in order to fulfill a demand as defined by a group of one or more orders, comprising: a computer device; a database in communication with said computer device; a module for defining orders by attributes; a module for creating stock keeping unit attributes definition (SAD) groups, said SAD groups being defined by attributes and associated with at least one order based on said SAD groups' attributes; a module for prioritizing said orders at least according to said SAD groups; a module for loading into a window at least one of said orders based on said priority of said orders; a module for associating loaded orders to configurations; a module for selecting a highest priority order from said window based on said priority of said loaded orders; a module for selecting required resources for fulfilling said selected highest priority order based on said configuration associated with said selected highest priority order; and a module for making an initial assignment of said selected resources, said initial assignment preventing future conflicting assignments of said resource to lower priority wherein said module for selecting resources repeatedly selects a next highest priority order from said window and said module for making an initial assignment makes an initial assignment for said next highest priority order until each of said loaded slice of orders have been selected and initial assignments are made, or until a resource constraint is met; said resource constraint being associated with said window and one of said reqiuired resources.
Claim 24
Independent Claim 257 words
A system for planning the use of supply chain manufacturing resources in order to fulfill a demand as defined by a group of one or more orders, comprising: a computer device; a database in communication with said computer device; a module for defining orders by attributes; a module for creating stock keeping unit attributes definition (SAD) groups, said SAD groups being defined by attributes and associated with at least one order based on said SAD groups' attributes; a module for prioritizing said orders at least according to said SAD groups; a module for loading into a window at least one of said orders based on said priority of said orders; a module for associating loaded orders to configurations; a module for selecting a highest priority order from said window based on said priority of said loaded orders; a module for selecting required resources for fulfilling said selected highest priority order based on said configuration associated with said selected highest priority order; and a module for making an initial assignment of said selected resources, said initial assignment preventing future conflicting assignments of said resource to lower priority wherein said module for selecting resources repeatedly selects a next highest priority order from said window and said module for making an initial assignment makes an initial assignment for said next highest priority order until each of said loaded slice of orders have been selected and initial assignments are made, or until a resource constraint is met; said resource constraint being associated with said window and one of said reqiuired resources.
Claim 25
Dependent Claim 23 words
The system according to claim 21 , wherein said database comprises a table of unplanned orders to store said orders in said window.
Claim 26
Dependent Claim 19 words
The system according to claim 21 , further comprising a module for creating a static model of said resources.
Claim 27
Dependent Claim 35 words
The system according to claim 21 , further comprising a module for initializing buckets including a means for placing capacity constraints on said buckets, said buckets being associated with a specified resource and time interval.
Claim 28
Dependent Claim 54 words
The system according to claim 21 , wherein said module for loading is further adapted to load a second slice of orders after said slice of orders have been selected and initial assignments made, said initial assignments for said slice of orders being treated as a resource constraint for said second slice of orders.
Claim 29
Dependent Claim 27 words
The system according to claim 21 , further comprising a module for loading configuration and bill of materials data relating to said orders placed into said window.
Claim 30
Dependent Claim 202 words
A program storage device readable by a machine, tangibly embodying a program of instructions executable by a machine to perform method steps of planning the use of manufacturing network resources to fulfill demand as defined by multiple orders by prioritizing and planning the orders according to their assigned priority, the method steps comprising: organizing said orders into groups, said orders having at least two attributes; prioritizing each group to have a relative group priority; prioritizing each order within each said group based on attributes of each said order so as to have a relative order priority within each said group; associating one or more buildable configurations to each of said orders; and planning the use of at least one of said resources in order to fulfill said demand, wherein higher priority orders are planned first before lower priority orders based on said group priority of each order in each group; and using said configuration associated with each order in order to select at least one of said resources for use in order to fulfill said demand, each selected resource being reserved as an initial assignment of said selected resources so as to prevent lesser priority orders from being overscheduled for said resource.
Claim 31
Dependent Claim 202 words
A program storage device readable by a machine, tangibly embodying a program of instructions executable by a machine to perform method steps of planning the use of manufacturing network resources to fulfill demand as defined by multiple orders by prioritizing and planning the orders according to their assigned priority, the method steps comprising: organizing said orders into groups, said orders having at least two attributes; prioritizing each group to have a relative group priority; prioritizing each order within each said group based on attributes of each said order so as to have a relative order priority within each said group; associating one or more buildable configurations to each of said orders; and planning the use of at least one of said resources in order to fulfill said demand, wherein higher priority orders are planned first before lower priority orders based on said group priority of each order in each group; and using said configuration associated with each order in order to select at least one of said resources for use in order to fulfill said demand, each selected resource being reserved as an initial assignment of said selected resources so as to prevent lesser priority orders from being overscheduled for said resource.
Claim 32
Dependent Claim 34 words
The program storage device of claim 27 , wherein said orders have an attribute for customer type and said customer type attribute is used to prioritize each order belonging to one of said groups.
Claim 33
Dependent Claim 33 words
The program storage device of claim 27 , wherein said ordcrs have an attribute for need date and said need date is used to prioritize each order belonging to one of said groups.
Claim 34
Dependent Claim 44 words
The program storage device of claim 27 , wherein said order priority of each order belonging to one of said groups is based on capacity allocation, said capacity allocation reserving resource capacity to one of said orders based on one of said order attributes.
Claim 35
Dependent Claim 17 words
The program storage device of claim 30 , wherein said order attributes include a customer identification attribute.
Claim 36
Dependent Claim 43 words
The program storage device of claim 27 , wherein said order priority of each order belonging to one of said groups is based on material allocation, said material allocation reserving inventory to one of said orders based on one of said order attributes.
Claim 37
Dependent Claim 17 words
The program storage device of claim 32 , wherein said order attributes include a customer identification attribute.

References Cited (Backward Citations)

US5204821A Cited
US6088626A Cited
US5819232A Cited
US6064982A Cited
US6141598A Cited
US20030109950A1 Cited
US6684119B2 Cited
US20030028276A1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2008-05-23 2008-11-22 2009-05-24 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2012-05-23 2012-11-22 2013-05-24 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2016-05-23 2016-11-22 2017-05-24 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag