# US 2018/0322471 A1 · Techniques for crowdsourcing and dynamically updating computer-aided schedules

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0322471 A1
- Document ID: US20180322471A1
- Status: Published application
- Kind: A1
- Application number: 15/925,632
- Filed: 2018-03-19
- Published: 2018-11-08
- Earliest claimed: 2017-05-04
- Assignees: Autodesk, Inc.
- Applicants: Autodesk, Inc.
- Inventors: Fraser ANDERSON; George FITZMAURICE; Justin Frank MATEJKA
- Web page: https://patentgrep.com/patent/US20180322471A1

## CPC

- G06Q 10/1093: Calendar-based scheduling for persons or groups
- G06Q 10/107: Computer-aided management of electronic mailing [e-mailing]
- G06F 3/0482: Interaction with lists of selectable items, e.g. menus
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In various embodiments, a scheduling application automatically determines the timing of linearly dependent events. In operation, the scheduling application detects that a first event included in an original scheduled sequence of events has not completed by a scheduled completion time based on a current time. The scheduling application then determines that a second event included in the original scheduled sequence of events has a dependency on the completion of the first event. Subsequently, the scheduling application updates one or more temporal properties associated with the second event based on the current time to generate a third event. The scheduling application then generates, via a processor, a modified scheduled sequence of events that includes the third event instead of the second event. Advantageously, automatically adjusting the timing of linear dependent events based on the current time reduces inefficiencies associated with conventional scheduling techniques.

## Claims

### Claim 1

A computer-implemented method for automatically determining the timing of linearly dependent events, the method comprising:
detecting that a first event included in an original scheduled sequence of events has not completed by a scheduled completion time based on a current time;
determining that a second event included in the original scheduled sequence of events has a first dependency on the completion of the first event;
updating one or more temporal properties associated with the second event based on the current time to generate a third event; and
generating, via a processor, a modified scheduled sequence of events that includes the third event instead of the second event.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein detecting that the first event has not completed by the scheduled completion time comprises determining that the first event is in progress and that the current time is later than the scheduled completion time.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, further comprising determining that the first event is still in progress based on input received via a user interface.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, wherein determining that the second event has the first dependency comprises determining that the second event is subsequent to the first event in a timeline defined by the original scheduled sequence of events.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein the one or more temporal properties associated with the second event comprises at least one of a scheduled start time, a different scheduled completion time, and a scheduled duration.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, wherein updating the one or more temporal properties associated with the second event comprises:
computing a delay based on the current time and the scheduled completion time;
computing a compression factor based on the delay and a scheduled completion time associated with the original scheduled sequence of events;
computing a scheduled start time associated with the third event based on the delay and a scheduled start time associated with the second event; and
computing a scheduled duration associated with the third event based on the contraction factor and a scheduled duration associated with the second event.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, further comprising, prior to detecting that the first event has not completed:
generating a first email associated with a delegated event;
transmitting the first email to a first user; and
generating the first event and the original sequence of unscheduled events based on a first duration specified in an electronically-communicated response to the first email.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, further comprising, updating a graphical user interface to indicate that the first event has not completed by the scheduled completion time.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, wherein the original scheduled sequence of events comprises an agenda, and the first event comprises an agenda item that is associated with a first meeting attendee.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, further comprising:
detecting that the third event completed before a scheduled completion time associated with the third event;
determining that a fourth event included in the modified scheduled sequence of events has a second dependency on the completion of the third event;
updating one or more temporal properties associated with the fourth event based on the current time to generate a fifth event; and
generating, via a processor, a new modified scheduled sequence of events that includes the fifth event instead of the fourth event.

### Claim 11

A computer-readable storage medium including instructions that, when executed by a processing unit, cause the processing unit to automatically determine the timing of linearly dependent events by performing the steps of:
detecting that a first event included in an original scheduled sequence of events has not completed by a scheduled completion time based on a current time;
determining that a second event included in the original scheduled sequence of events has a first dependency on the completion of the first event;
updating one or more temporal properties associated with the second event based on the current time to generate a third event; and
generating, via a processor, a modified scheduled sequence of events that includes the third event instead of the second event.

### Claim 12 (depends on 11)

The computer-readable storage medium of claim 11, wherein detecting that the first event has not completed by the scheduled completion time comprises determining that the first event is in progress and that the current time is later than the scheduled completion time.

### Claim 13 (depends on 11)

The computer-readable storage medium of claim 11, wherein determining that the second event has the first dependency comprises determining that the second event is subsequent to the first event in a timeline defined by the original scheduled sequence of events.

### Claim 14 (depends on 11)

The computer-readable storage medium of claim 11, wherein the one or more temporal properties associated with the second event comprises at least one of a scheduled start time, a different scheduled completion time, and a scheduled duration.

### Claim 15 (depends on 11)

The computer-readable storage medium of claim 11, wherein updating the one or more temporal properties associated with the second event comprises:
computing a delay based on the current time and the scheduled completion time;
computing a scheduled duration associated with a first buffer based on the delay and a scheduled duration associated with a second buffer included in the original scheduled sequence of events; and
computing a scheduled start time associated with the third event based on the delay and a scheduled start time associated with the second event.

### Claim 16 (depends on 15)

The computer-readable storage medium of claim 15, wherein generating the modified sequence of linearly dependent events comprises aggregating at least the first event, the third event, and the first buffer.

### Claim 17 (depends on 11)

The computer-readable storage medium of claim 11, further comprising, prior to detecting that the first event has not completed:
generating a first email associated with a delegated event;
transmitting the first email to a first user; and
generating the first event and the original sequence of unscheduled events based on a first duration specified in an electronically-communicated response to the first email.

### Claim 18 (depends on 11)

The computer-readable storage medium of claim 11, wherein the original scheduled sequence of events comprises a Gantt chart and the first event comprises a first project deliverable, a first project milestone, or a first project activity.

### Claim 19 (depends on 11)

The computer-readable storage medium of claim 11, further comprising:
storing, in a historical database, information indicating that a first user associated with the first event did not complete the first event by the scheduled completion time; and
generating a new scheduled sequence of events that includes a fourth event associated with the first user based on the historical database and input received from the first user.

### Claim 20

A system, comprising:
a memory storing instructions; and
a processor that is coupled to the memory and, when executing the instructions, is configured to:
detect that a first event included in an original scheduled sequence of events has not completed by a scheduled completion time based on a current time;
determine that a second event included in the original scheduled sequence of events has a first dependency on the completion of the first event;
update one or more temporal properties associated with the second event based on the current time to generate a third event; and
generate, via a processor, a modified scheduled sequence of events that includes the third event instead of the second event.
