System and Method of Parallelizing Order-By-Order Planning

A computer-implemented method, comprising:

• accessing data describing a demand priority sequence, each demand priority sequence comprising at least one demand of an end-item;
• accessing data describing the supply chain network comprising two or more supply chain entities, each supply chain entity configured to supply one or more items to satisfy demand;
• creating a first mapping table for each end-item and for each end-item:
• accessing items in an end-item supply path;
• accessing resources in the end-item supply path;
• and
• updating the first mapping table with the accessed items and resources in the end-items supply path;
• creating a second mapping table for each end-item and for each end-item:
• accessing end-items in the item supply path;
• and
• updating the second mapping table with the accessed end-items in the items supply path;
• generating a dependency map for each end-item based on the first and second mapping tables;
• generating a list of demand levels comprising two or more demands that can be planned in parallel processing levels;
• and
• generating an order plan of end-items for planning in parallel comprising the orders planned for the demands at each demand level, wherein the dependency map reduces the number of parallel processing levels by excluding related end-items of infinite material.

A non-transitory computer-readable medium embodied with software, the software when executed using one or more computers is configured to:

• access data describing a demand priority sequence, each demand priority sequence comprising at least one demand of an end-item;
• access data describing the supply chain network comprising two or more supply chain entities, each supply chain entity configured to supply one or more items to satisfy demand;
• create a first mapping table for each end-item and for each end-item:
• access items in an end-item supply path;
• access resources in the end-item supply path;
• and
• update the first mapping table with the accessed items and resources in the end-items supply path;
• create a second mapping table for each end-item and for each end-item:
• access end-items in the item supply path;
• and
• update the second mapping table with the accessed end-items in the items supply path;
• generate a dependency map for each end-item based on the mapping tables, wherein the dependency map reduces the number of parallel processing levels;
• generate a list of demand levels comprising two or more demands that can be planned in parallel processing levels;
• and
• generate an order plan of end-items for planning in parallel comprising the orders planned for the demands at each demand level, wherein the dependency map reduces the number of parallel processing levels by excluding related end-items of infinite material.