METHOD AND SYSTEM FOR DETERMINING TASK SCHEDULING PROBABILITY

• US 20110125698A1
• Filed: 08/17/2007
• Published: 05/26/2011
• Est. Priority Date: 08/18/2006
• Status: Abandoned Application

• Current Assignee: Raytheon Company (Rtx Corporation)
• Original Assignee: Raytheon Company (Rtx Corporation)
• Inventors: Tinker, Peter Allmond, Fox, Jason R., Rome, David R.
• Application Number:
  US12/376,566
• Publication Number:
  US 20110125698A1
• Time in Patent Office: Days
• US Class Current: 706/50
• CPC Class Codes: G06Q 10/00 Administration; Management

Abstract

Provided is a method of determining task scheduling probability. More specifically, the method includes establishing a set of task attributes. A database of prior task vectors in accordance with the set of task attributes then also provided, wherein each prior task vector representing a prior scheduled task. A new task is received having at least a subset of the task attributes. For this new task, a new task vector is generated based on the new task attributes. The new task vector is compared with the prior task vectors and the differences are recorded. The probability of successful scheduling is then evaluated based on the aggregate differences for each attribute. A system operable to perform the method is also provided.

Claims

1. A method of determining task scheduling probability, comprising:

establishing a set of task attributes;

providing a database of prior task vectors in accordance with the set of task attributes, each prior task vector representing a prior scheduled task;

receiving a new task having at least a subset of the task attributes;

generating a new task vector based on the new task attributes;

comparing the new task vector to at least a subset of the prior task vectors and recording the differences between each task attribute; and

evaluating the probability of the new task scheduling successfully based upon the aggregate differences for each attribute.

2. The method of claim 1, wherein providing the database includes:

receiving a plurality of prior scheduled tasks; and

generating a prior task vector for each prior scheduled task based on the task attributes, and

inputting each prior task vector into the database.

3. The method of claim 1, wherein comparing the new task vector to each prior task vector is performed with prior task vectors having at least one attribute in common with the new task vector.

4. The method of claim 1, wherein at least one task attribute has a plurality of sub-attribute possibilities, and further comprising comparing the new task vector to each prior task vector being performed with prior task vectors having sub-attributes in common with the new task vector.

5. The method of claim 1, wherein all prior task vectors are compared to the new task vector.

6. The method of claim 1, wherein the aggregate differences are returned in order of hierarchy.

7. The method of claim 1, wherein in at least one embodiment the task attributes include task type, start execution time, end execution time, and priority.

8. The method of claim 7, wherein task type determines task resources and task duration.

9. The method of claim 1, further including adding the new task vector to the data base of prior tasks vectors upon operator direction.

10. The method of claim 1, wherein multiple instances of the method may be performed concurrently.

11. The method of claim 1, wherein multiple instances each employ a different set of task attributes.

12. The method of claim 1, wherein the method is stored on a computer-readable medium as a computer program which, when executed by a computer will perform the steps of determining task scheduling probability.

13. A system for determining task scheduling probability, comprising:

a set of task attributes;

a database operable to provide at least one prior task vector established in accordance with the set of task attributes, each prior task vector representing a prior scheduled task;

an interface operable to receive a new task having at least a subset of the task attributes;

a generator operable to receive the new task from the interface and generate a new task vector based on the new task attributes; and

an evaluator in connection with the database and the generator and operable to compare the new task vector with at least a subset of the prior task vectors and record the difference for each task attribute, the aggregate differences for each task attribute indicating a probability of the new task scheduling successfully.

14. The system of claim 13, wherein the evaluator is operable to compare the new task vector with prior task vectors having at least one attribute in common with the new task vector.

15. The system of claim 13, wherein at least one task attribute has a plurality of sub-attribute possibilities, the evaluator operable to compare the new task vector to each prior task vector having sub-attributes in common with the new task vector.

16. The system of claim 13, wherein the evaluator is operable to compare the new task vector with all prior task vectors.

17. The system of claim 13, wherein the interface is further operable to receive the aggregate differences from the evaluator and return the aggregate differences to a designated receiver.

18. The system of claim 13, wherein in at least one embodiment the task attributes include task type, start execution time, end execution time, and priority.

19. The system of claim 18, wherein task type determines task resources and task duration.

20. A computer-readable medium on which is stored a computer program for determining task scheduling probability, the computer program comprising instructions which, when executed by a computer, perform the steps of:

establishing a set of task attributes;

providing a database of prior task vectors in accordance with the set of task attributes, each prior task vector representing a prior scheduled task;

receiving a new task having at least a subset of the task attributes;

generating a new task vector based on the new task attributes;

comparing the new task vector to at least a subset of the prior task vectors and recording the differences between each task attribute; and

evaluating the probability of the new task scheduling successfully based upon the aggregate differences for each attribute.

21. The computer-readable medium of claim 20, wherein providing the database includes:

receiving a plurality of prior scheduled tasks; and

generating a prior task vector for each prior scheduled task based on the task attributes, each prior task vector added to the database.

22. The computer-readable medium of claim 20, wherein comparing the new task vector to each prior task vector is performed with prior task vectors having at least one attribute in common with the new task vector.

23. The computer-readable medium of claim 20, wherein at least one task attribute has a plurality of sub-attribute possibilities, and further comprising comparing the new task vector to each prior task vector being performed with prior task vectors having sub-attributes in common with the new task vector.

24. The computer-readable medium of claim 20, wherein all prior task vectors are compared to the new task vector.

25. The computer-readable medium of claim 20, wherein the aggregate differences are returned in order of hierarchy.

26. The computer-readable medium of claim 20, wherein in at least one embodiment the task attributes include task type, start execution time, end execution time, and priority.

27. The computer-readable medium of claim 26, wherein task type determines task resources and task duration.

28. The computer-readable medium of claim 20, wherein multiple instances of the method may be performed concurrently.

29. The computer-readable medium of claim 20, wherein multiple instances each employ a different set of task attributes.