REALTIME SCHEDULE MANAGEMENT INTERFACE

• US 20140278667A1
• Filed: 05/30/2014
• Published: 09/18/2014
• Est. Priority Date: 12/21/2012
• Status: Active Grant

• Current Assignee: Pagerduty, Inc.
• Original Assignee: Pagerduty, Inc.
• Inventors: Solomon, Dan Alexandru, Laban, John Gary Ryan, Enders, Ian Alexander, Basiri, Ali, Miklas, Andrew Gregory
• Granted Patent: US 9,830,578 B2
• Time in Patent Office: Days
• US Class Current: 705/7.18
• CPC Class Codes: G06Q 10/06311 Scheduling, planning or task assignment for a person or group
• CPC Class Codes: G06Q 10/06314 Calendaring for a resource
• CPC Class Codes: G06Q 10/109 Time management, e.g. calendars, reminders, meetings or time accounting
• CPC Class Codes: G06Q 10/1097 Task assignment

Abstract

Embodiments are directed towards generating and managing schedules. In at least one of the various embodiments, these schedules may be configured to schedule team members, rotating which team member is active (“on-call”). In at least one of the various embodiments, these may be employed to determine which resource is responsible to respond and/or resolve incidents that may be reported and/or detected. In at least one of the various embodiments, if a team member is determined to be the on-call or responsible team member, the notification engine may determine the methods for notify die responsible of the incidents. Schedules previews may be updated in real-time as the schedule is edited.

Claims

1. A method for managing schedules using a network computer that communicates over a network, comprising:

wherein the network computer is arranged to perform actions, including;

generating a schedule that includes at least one schedule entry;

if at least one restriction is associated with the schedule, modifying the at least one schedule entry based on at least one of a start time or an end time that is associated with the at least one restriction; and

generating a plurality of epochs based on each equivalent time period within the schedule where a same allocation of team members in the schedule repeats, wherein jumping forward in time by each repeated epoch at least provides reduced computation of at least a virtual start time.

2. The method of claim 1, wherein modifying the at least one schedule entry, further comprises, discarding the at least one schedule entry if the start time associated with at the least one restriction is the same or earlier than a start time for the at least one schedule entry and the end time associated, with the at least one restriction is the same or later than an end time for the at least one schedule entry.

3. The method of claim 1, wherein modifying the at least one schedule entry, further comprises, generating another schedule entry if a start time for the at least one schedule entry is earlier than the start tune associated with at the least one restriction and an end lime for the at least one schedule entry is the later than the end time associated with the at least one restriction.

4. The method of claim 1, further comprising, associating a same team member to another schedule entry if the duration of the at least one schedule entry is less than a duration of a shift that is associated with the team member.

5. The method of claim 1, further comprising, if an end of the shift duration is reached for a schedule layer that is included in the schedule and a current team member is assigned to at least one schedule entry that corresponds to a portion of the at least one shift duration, rotating a next team member of the schedule layer to be the current team member for another portion of the at least one shift duration.

6. The method of claim 1, further comprising, determining a responsible team member based on the schedule and a time of occurrence of a reported incident.

7. The method of claim 1, further comprising, providing at least one notification to at least one responsible team member based on a reported incident, wherein the responsible team member is determined based on a time that the incident is reported.

8. The method of claim 1, further comprising, communicating with at least one monitoring service, wherein the at least one monitoring service provides incident reports.

9. A system arranged for managing schedules over a network, comprising:

a server device, including;

a transceiver that is operative to communicate over the network;

a non-transitive memory that is operative to store at least instructions; and

a processor device that is operative to execute instructions that enable actions, including;

generating a schedule that includes at least one schedule entry;

if at least one restriction is associated with die schedule, modifying the at least one schedule entry based on at least one of a start time or an end time that is associated with the at least one restriction; and

generating a plurality of epochs based on each equivalent time period within the schedule where a same allocation of team members in the schedule repeats, wherein jumping forward in time by each repeated epoch at least provides reduced computation of at least a virtual start time; and

a client device, comprising,

a transceiver that is operative to communicate over the network;

a non-transitive memory that is operative to store at least instructions; and

a processor device that is operative to execute instructions that enable actions, including;

displaying at least a portion of the schedule; and

displaying at least one notification to at least one team member.

10. The system of claim 9, wherein modifying the at least one schedule entry, further comprises, discarding the at least one schedule entry if the start time associated with at the least one restriction is the same or earlier than a start time for the at least one schedule entry and the end time associated with the at least one restriction is the same or later than an end time for the at least one schedule entry.

11. The system of claim 9, wherein modifying the at least one schedule entry, further comprises, generating another schedule entry if a start time for the at least one schedule entry is earlier than the start time associated with at the least one restriction and an end time for the at least one schedule entry is the later than the end time associated with the at least one restriction.

12. The system of claim 9, wherein the server device processor device is operative to enable actions, further comprising, associating a same team member to another schedule entry if the duration of the at least one schedule entry is less than a duration of a shift that is associated with the team member.

13. The system of claim 9, wherein the server device processor device is operative to enable actions, if an end of the shift duration is reached for a schedule layer that is included in the schedule and a current team member is assigned to at least one schedule entry that corresponds to a portion of the at least one shift duration, rotating a next team member of the schedule layer to be the current team member for another portion of the at least one shift duration.

14. The system of claim 9, wherein the server device processor device is operative to enable actions, determining a responsible team member based on the schedule and a time of occurrence of a reported incident.

15. The system of claim 9, wherein the server device processor device is operative to enable actions, providing at least one notification to at least one responsible team member based on a reported incident, wherein die responsible team member is determined based on a time that the incident is reported.

16. The system of claim 9, wherein the server device processor device is operative to enable actions, communicating with at least one monitoring service, wherein the at least one monitoring service provides incident reports.

17. A network device that is operative for managing schedules, comprising:

a transceiver that is operative to communicate over a network;

a non-transitive memory that is operative to store at least instructions; and

a processor device that is operative to execute instructions that enable actions, including;

generating a schedule that includes at least one schedule entry;

if at least one restriction is associated with the schedule, modifying the at least one schedule entry based on at least one of a start time or an end time that is associated with the at least one restriction; and

generating a plurality of epochs based on each equivalent time period within the schedule where a same allocation of team members in the schedule repeats, wherein jumping forward in time by each repeated epoch at least provides reduced computation of at least a virtual start time.

18. The network device of claim 17, wherein modifying the at least one schedule entry, toiler comprises, discarding the at least one schedule entry if the start time associated with at the least one restriction is the same or earlier than a start time for the at least one schedule entry and die end time associated with the at least one restriction is the same or later than an end time for the at least one schedule entry.

19. The network device of claim 17, wherein modifying the at least one schedule entry, further comprises, generating another schedule entry if a start time for the at least one schedule entry is earlier than the start time associated with at the least one restriction and an end time for the at least one schedule entry is the later than the end time associated with the at least one restriction.

20. The network device of claim 17, wherein the network device processor device is operative to enable actions further, comprising, associating a same team member to another schedule entry if the duration of the at least one schedule entry is less than a duration of a shift that is associated with the team member.

21. The network device of claim 17, wherein the network device processor device is operative to enable actions further, comprising, if an end of the shift duration is reached for a schedule layer that is included in the schedule and a current team member is assigned to at least one schedule entry that corresponds to a portion of the at least one shift duration, rotating a next team member of the schedule layer to be the current team member for another portion of the at least one shift duration.

22. The network device of claim 17, wherein the network device processor device is operative to enable actions further, comprising, determining a responsible team member based on the schedule and a time of occurrence of a reported incident.

23. The network device of claim 17, wherein the network device processor device is operative to enable actions further, comprising, providing at least one notification to at least one responsible team member based on a reported incident, wherein the responsible team member is determined based on a time that the incident is reported.

25. The media of claim 19, wherein modifying the at least one schedule entry, further comprises, discarding the at least one schedule entry if the start time associated with at the least one restriction is the same or earlier than a start time for the at least one schedule entry and the end time associated with the at least one restriction is the same or later than an end time for the at least one schedule entry.

26. The media of claim 19, wherein modifying the at least one schedule entry, further comprises, generating another schedule entry if a start, time for the at least one schedule entry is earlier than the start time associated with at the least one restriction and an end time for the at least one schedule entry is the later than the end time associated with the at least one restriction.

27. The media of claim 19, further comprising, associating a same team member to another schedule entry if the duration of the at least one schedule entry is less than a duration of a shift that is associated whir the same team member.

28. The media of claim 19, further comprising, if an end of the shift duration is reached for a schedule layer that is included in the schedule and a current team member is assigned to at least one schedule entry that corresponds to a portion of the at least one shift duration, rotating a next team member of the schedule layer to be the current team member for another portion of the at least one shift duration.

29. The media of claim 19, further comprising, determining a responsible team member based on the schedule and a time of occurrence of a reported, incident.

30. The media of claim 19, further comprising, providing at least one notification, to at least one responsible team member based on a reported incident, wherein the responsible team member is determined based on a time that the incident is reported.

24. A processor readable non-transitive storage media that includes instructions for managing schedules, wherein execution of the instructions by a processor device enables actions, comprising:

generating a schedule that includes at least one schedule entry;

if at least one restriction is associated with the schedule, modifying the at least one schedule entry based on at least one of a start time or an end time that is associated with the at least one restriction; and

generating a plurality of epochs based on each equivalent time period within the schedule where a same allocation of team members in the schedule repeats, wherein jumping forward in time by each repeated epoch at least provides reduced computation of at least a virtual start time.