A backtracking resources planning algorithm

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....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	PAMELA ANN MARIE RENTON, BLAIR LEDUC, MICHAEL PECK
Format:	Patent
Sprache:	eng
Schlagworte:	CALCULATING CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION ORPROCESSING OF GOODS COMPUTING CONTROL OR REGULATING SYSTEMS IN GENERAL CONTROLLING COUNTING DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES FUNCTIONAL ELEMENTS OF SUCH SYSTEMS GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS ORELEMENTS PHYSICS REGULATING SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINSTCLIMATE CHANGE
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.