Virtual mode execution manager
US-12118376-B2 · Oct 15, 2024 · US
US2016299782A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2016299782-A1 |
| Application number | US-201615053480-A |
| Country | US |
| Kind code | A1 |
| Filing date | Feb 25, 2016 |
| Priority date | Apr 9, 2015 |
| Publication date | Oct 13, 2016 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Disclosed herein is a system and method for determining a sequence for a plurality of tasks, such as tasks assigned to an employee by an employer. The system associates a location identifier to each task, and generates a proposed sequence for the plurality of tasks. The disclosed system receives task performance data that provides information on the actual sequence that was used to perform the plurality of tasks. The task performance data is used to determine a performed sequence—the sequence used by the employee to perform the plurality of tasks. The system compares the performed sequence to the proposed sequence. The system may score the proposed sequence and the performed sequence using a plurality of weighted factors. The system for determining a sequence for a plurality of tasks uses the proposed sequence and the performed sequence to generate proposed sequences for future pluralities of tasks.
Opening claim text (preview).
What is claimed is: 1 . A computer system for determining a sequence for a plurality of tasks comprising: a sequence determination utility that generates a proposed sequence for performing a first plurality of tasks; and a performed sequence utility that stores in memory a performed sequence, wherein the performed sequence was used to perform the first plurality of tasks; wherein the sequence determination utility uses the performed sequence to generate a proposed sequence for performing a second plurality of tasks. 2 . The computer system of claim 1 , wherein the sequence determination utility uses a location identifier associated with each one of the first plurality of tasks to generate the proposed sequence for the first plurality of tasks. 3 . The computer system of claim 1 , wherein the sequence determination utility further comprises a sequence scoring utility, wherein the sequence scoring utility assigns a proposed sequence score to the proposed sequence and a performed sequence score to the performed sequence. 4 . The computer system of claim 3 , wherein the sequence scoring utility computes the performed sequence score by adding together a plurality of weighted factors. 5 . The computer system of claim 3 , wherein the sequence scoring utility determines the percentage that the performed sequence corresponds to the proposed sequence. 6 . The computer system of claim 3 , wherein the sequence scoring utility computes the performed sequence score by computing a safety factor for the performed sequence. 7 . The computer system of claim 3 , wherein the sequence determination utility comprises a sequence comparison utility, and wherein the sequence comparison utility compares the proposed sequence score to the performed sequence score when the performed sequence is different from the proposed sequence. 8 . The computer system of claim 7 , wherein the sequence comparison utility sets the proposed sequence equal to the performed sequence in response to the performed sequence score being greater than the proposed sequence score. 9 . The computer system of claim 1 , wherein the sequence determination utility uses the performed sequence to generate a proposed sequence for performing a second plurality of tasks if the performed sequence is different than the proposed sequence for performing the first plurality of tasks. 10 . The computer system of claim 1 , wherein the performed sequence utility collects a time stamp for each one of the first plurality of tasks, and wherein the performed sequence utility uses the time stamp for each one of the first plurality of tasks to determine the performed sequence. 11 . A method of generating a sequence for a plurality of tasks comprising: generating a proposed sequence for a first plurality of tasks; determining a performed sequence, wherein the performed sequence was used to perform the first plurality of tasks; comparing the performed sequence to the proposed sequence for the first plurality of tasks; and using the performed sequence to generate a proposed sequence for a second plurality of tasks. 12 . The method of claim 11 , wherein comparing the performed sequence to the proposed sequence comprises assigning a proposed sequence score to the proposed sequence. 13 . The method of claim 12 , wherein comparing the performed sequence to the proposed sequence further comprises assigning a performed sequence score to the performed sequence. 14 . The method of claim 14 , wherein using the performed sequence to generate a proposed sequence for a second plurality of tasks comprises setting the proposed sequence equal to the performed sequence in response to the performed sequence score being greater than the proposed sequence score. 15 . The method of claim 14 , wherein determining a performed sequence, wherein the performed sequence is the sequence used to perform the first plurality of tasks comprises collecting a time stamp for each of the first plurality of tasks. 16 . The method of claim 15 , wherein determining a performed sequence, wherein the performed sequence is the sequence used to perform the first plurality of tasks further comprises computing a total travel time between time stamps for the first plurality of tasks. 17 . The method of claim 16 , wherein determining a performed sequence, wherein the performed sequence is the sequence used to perform the first plurality of tasks further comprises computing a time factor by inverting the total travel time between time stamps for the first plurality of tasks. 18 . A system for providing a sequenced task list comprising: means for assigning a proposed sequence score to a proposed sequence for performing a first plurality of tasks; means for assigning a performed sequence score to a performed sequence, wherein the performed sequence was used to perform the first plurality of tasks; and means for comparing the proposed sequence score to the performed sequence score. 19 . The system of claim 18 , wherein the means for comparing the proposed sequence score to the performed sequence score sets the proposed sequence equal to the performed sequence in response to the performed sequence score being greater than the proposed sequence score. 20 . The system of claim 19 , further comprising a means for collecting a plurality of time stamps indicating the time each of the first plurality of tasks is completed.
Allocation of resources, e.g. of the central processing unit [CPU] · CPC title
Sequencing of tasks or work · CPC title
Scheduling, planning or task assignment for a person or group · CPC title
Optimisation of routes or paths, e.g. travelling salesman problem · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.