A backtracking resources planning algorithm

Details A backtracking resources planning algorithm A backtracking resources planning algorithm

G - Physics

05

B

G05B 13/00 (2006.01) G01N 35/00 (2006.01) G05B 13/04 (2006.01) G06Q 10/00 (2006.01)

Patent

CA 2410693

A method of scheduling a plurality of tasks includes the steps of establishing a node representative of each task, and indicative of resources required to perform that task. A hierarchy is established between the nodes to indicate an order in which tasks represented by the node are to be performed. The nodes whose hierarchy permits tasks represented by the node to be performed are selected to a next nodes list. A source is assigned to each of the selected nodes and is indicative of a priority to be accorded to respective ones of the selected nodes. The node with the highest priority is scheduled.

Affiliated with

Also associated with

Rating

A backtracking resources planning algorithm does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with A backtracking resources planning algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A backtracking resources planning algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1486520