Abstract: A computer-implemented method which includes receiving a set of external supplies and one or more external outputs based on an external calculation. The output is converted into a converted format that is receivable by a heuristic application. Thereafter, warm start data is generated from the converted format, which in turn, is converted , converting to a set of converted warm start data. A set of demands and one or more inputs, along with the set of converted warm start data, is input to the heuristic. Application of the heuristic results in generating a set of supplies and one or more outputs.

Abstract: A system, method and non-transitory computer-readable storage medium for computing a full dependency graph before obtaining a result of an analytic; and constructing a scheduling graph to optimally distribute work between the available threads, based on the full dependency graph.

Abstract: Systems and methods that distribute fairly, limited inventory across multi levels of warehouses, where each warehouse has its own inventory target. The goal is to first ensure that all real demands (e.g. sales orders and forecasts) are satisfied, fair-sharing as needed. Once real demands are satisfied, nodes in the distribution network should be brought up to their safety stock levels fairly: each downstream node should achieve an equal fraction of its desired days of coverage.

Abstract: Systems and methods in which a demand planning schedule and a safety stock schedule of an entity in a supply chain are managed, by creating a transformed demand planning schedule, which is obtained by allocating one or more safety stock demands to one or more non-safety stock demands and creating one or more new safety stock demands to maintain the safety stock schedule.