An Efficient Algorithm for Propagation of Temporal-Constraint Networks

An efficient artificial-intelligence-type algorithm for the propagation of temporal constraints has been devised for incorporation into software that performs scheduling and planning of tasks in real time. This algorithm checks for temporal consistency and computes time windows of time points within temporal-constraint networks, which are often used in scheduling and planning. A C++-language computer program that implements the algorithm has been devised for incorporation into the control software of the Mission Data System of NASA’s Jet Propulsion Laboratory. The algorithm and program could also be applied to industrial planning and scheduling problems.