DESIGN FOR HIGHLY-SCALABLE, DISTRIBUTED REPLENISHMENT PLANNING ALGORITHM

摘要

The present invention divides processing across multiple nodes to escape limitations placed by the processing power of commonly available application server platforms. The solution processing divides the problem into independently processed batches. Coordination of processing between nodes is achieved using a relational database tables and coordination for algorithm startup and initialization may be accomplished through a messaging system. The database table is loaded with rows to represent batches to be processed, and the independent processing nodes are given a message via the messaging system to start processing various jobs at a particular level. The nodes may then signal back when they can no longer find batches to process at that level. Once all nodes have completed a level, a message is sent to the nodes starts on to the next level. In this way, the messaging between the nodes is generally limited to two messages per level per node. The solution may be applied to supply chain problems by dividing the supply chain into separate levels and using separate nodes for calculations at each of the levels.