Parallel Order Planning in Supply Chain Networks

The patent segments the planning process by creating mapping tables that map end-items to their dependent items, and by generating dependency maps that divide demands into different levels. This segmentation allows independent planning of demands at the same level to proceed simultaneously, reducing overall planning time while maintaining priority sequences across levels.

The patent introduces a new dimension of parallel processing by organizing demands into hierarchical levels based on dependency relationships. Demands at the same level can be processed in parallel across multiple processors, transforming the traditional single-threaded sequential process into a multi-dimensional parallel architecture that maintains logical priority while achieving computational efficiency.

The patent applies preliminary action by pre-computing and storing mapping tables that define relationships between end-items and their dependencies before the actual planning execution. This preprocessing step creates a structured foundation that enables efficient parallel processing without requiring complex real-time coordination, as the dependency relationships are established in advance.

The patent introduces mapping tables and dependency maps as intermediary structures that mediate between the input demands and the parallel processing engines. These intermediaries translate the complex dependency relationships into a format suitable for parallel execution, managing the complexity by providing a clear interface between the sequential priority logic and parallel computation.

The patent segments demands into different levels based on their dependency relationships, where each level represents a group of demands that can be processed independently of other levels. This segmentation allows the system to process multiple demands at the same level in parallel while maintaining the priority constraints between levels, achieving both efficiency and reliability.

The patent introduces dynamic parallel processing where the degree of parallelism is determined by the dependency structure of the demands. The system dynamically adjusts which demands can be processed simultaneously based on their level assignments, allowing maximum parallelization where dependencies permit while maintaining strict priority ordering where dependencies require sequential processing.