Realtime schedule management interface
First Claim
1. A method for managing schedules using a network computer that communicates over a network, comprising:
- wherein the network computer is arranged to performactions, including;
providing information for editing an existing schedule having at least one layer that includes at least one of a team member, a start time, a precedence value, and a shift duration;
generating a edited layer based on an existing layer of the existing schedule and provided information, wherein the edited layer includes at least one of the team member, the start time and the shift duration of the existing layer that is edited by the information;
generating a plurality of epochs based on each equivalent time period within the existing schedule where a same allocation of team members in the existing schedule repeats;
determining a virtual start time for the edited layer based on an overlap of an actual start time of the edited layer and an end of the shift boundary for the existing layer, wherein jumping forward in time by each repeated epoch at least provides reduced computation of at least the virtual start time;
generating at least one schedule entry for the edited layer based on the virtual start time, wherein the schedule entry includes a team member and a time range;
discarding each portion of the time range that is disposed between the virtual start time and the actual start time;
generating a layer preview based on the at least one schedule entry and a view port that is employable to display at least a portion of the edited layer;
comparing each schedule entry to each other schedule entry for all layers of a new schedule that is based on an ordering of each precedence value for each layer;
determining at least one final schedule entry based on at least one compared schedule entry that corresponds to a layer having a highest ordering; and
generating a final schedule preview based on the at least one final schedule entry, wherein the view port is employable to display at least a portion of the final schedule preview.
1 Assignment
0 Petitions
Accused Products
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 the responsible of the incidents. Schedules previews may be updated in real-time as the schedule is edited.
19 Citations
30 Claims
-
1. A method for managing schedules using a network computer that communicates over a network, comprising:
wherein the network computer is arranged to performactions, including; providing information for editing an existing schedule having at least one layer that includes at least one of a team member, a start time, a precedence value, and a shift duration; generating a edited layer based on an existing layer of the existing schedule and provided information, wherein the edited layer includes at least one of the team member, the start time and the shift duration of the existing layer that is edited by the information; generating a plurality of epochs based on each equivalent time period within the existing schedule where a same allocation of team members in the existing schedule repeats; determining a virtual start time for the edited layer based on an overlap of an actual start time of the edited layer and an end of the shift boundary for the existing layer, wherein jumping forward in time by each repeated epoch at least provides reduced computation of at least the virtual start time; generating at least one schedule entry for the edited layer based on the virtual start time, wherein the schedule entry includes a team member and a time range; discarding each portion of the time range that is disposed between the virtual start time and the actual start time; generating a layer preview based on the at least one schedule entry and a view port that is employable to display at least a portion of the edited layer; comparing each schedule entry to each other schedule entry for all layers of a new schedule that is based on an ordering of each precedence value for each layer; determining at least one final schedule entry based on at least one compared schedule entry that corresponds to a layer having a highest ordering; and generating a final schedule preview based on the at least one final schedule entry, wherein the view port is employable to display at least a portion of the final schedule preview. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
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 perform actions, including; providing information for editing an existing schedule having at least one layer that includes at least one of a team member, a start time, a precedence value, and a shift duration; generating a edited layer based on an existing layer of the existing schedule and provided information, wherein the edited layer includes at least one of the team member, the start time and the shift duration of the existing layer that is edited by the information; generating a plurality of epochs based on each equivalent time period within the existing schedule where a same allocation of team members in the existing schedule repeats; determining a virtual start time for the edited layer based on an overlap of an actual start time of the edited layer and an end of the shift boundary for the existing layer, wherein jumping forward in time by each repeated epoch at least provides reduced computation of at least the virtual start time; generating at least one schedule entry for the edited layer based on the virtual start time, wherein the schedule entry includes a team member and a time range; discarding each portion of the time range that is disposed between the virtual start time and the actual start time; generating a layer preview based on the at least one schedule entry and a view port that is employable to display at least a portion of the edited layer; comparing each schedule entry to each other schedule entry for all layers of a new schedule that is based on an ordering of each precedence value for each layer; determining at least one final schedule entry based on at least one compared schedule entry that corresponds to a layer having a highest ordering; generating a final schedule preview based on the at least one final schedule entry, wherein the view port is employable to display at least a portion of the final schedule preview; 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 perform actions, including; displaying at least a portion of the layer preview; and displaying at least a portion of the final schedule preview. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A network device that is operative for managing schedules over a network, 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 perform actions, including; providing information for editing an existing schedule having at least one layer that includes at least one of a team member, a start time, a precedence value, and a shift duration; generating a edited layer based on an existing layer of the existing schedule and provided information, wherein the edited layer includes at least one of the team member, the start time and the shift duration of the existing layer that is edited by the information; generating a plurality of epochs based on each equivalent time period within the existing schedule where a same allocation of team members in the existing schedule repeats; determining a virtual start time for the edited layer based on an overlap of an actual start time of the edited layer and an end of the shift boundary for the existing layer, wherein jumping forward in time by each repeated epoch at least provides reduced computation of at least the virtual start time; generating at least one schedule entry for the edited layer based on the virtual start time, wherein the schedule entry includes a team member and a time range; discarding each portion of the time range that is disposed between the virtual start time and the actual start time; generating a layer preview based on the at least one schedule entry and a view port that is employable to display at least a portion of the edited layer; comparing each schedule entry to each other schedule entry for all layers of a new schedule that is based on an ordering of each precedence value for each layer; determining at least one final schedule entry based on at least one compared schedule entry that corresponds to a layer having a highest ordering; and generating a final schedule preview based on the at least one final schedule entry, wherein the view port is employable to display at least a portion of the final schedule preview. - View Dependent Claims (18, 19, 20, 21, 22, 23)
-
-
24. A processor readable non-transitive storage media that includes instructions for managing schedules over a network using a network device, wherein execution of the instructions by a processor device performs actions, comprising:
-
providing information for editing an existing schedule having at least one layer that includes at least one of a team member, a start time, a precedence value, and a shift duration; generating a layer based on an existing layer of the existing schedule and provided information, wherein the layer includes at least one of the team member, the start time and the shift duration of the existing layer that is edited by the information; generating a plurality of epochs based on each equivalent time period within the existing schedule where a same allocation of team members in the existing schedule repeats; determining a virtual start time for the edited layer based on an overlap of an actual start time of the edited layer and an end of the shift boundary for the existing layer, wherein jumping forward in time by each repeated epoch at least provides reduced computation of at least the virtual start time; generating at least one schedule entry for the edited layer based on the virtual start time, wherein the schedule entry includes a team member and a time range; discarding each portion of the time range that is disposed between the virtual start time and the actual start time; generating a layer preview based on the at least one schedule entry and a view port that is employable to display at least a portion of the edited layer; comparing each schedule entry to each other schedule entry for all layers of a new schedule that is based on an ordering of each precedence value for each layer; determining at least one final schedule entry based on at least one compared schedule entry that corresponds to a layer having a highest ordering; and generating a final schedule preview based on the at least one final schedule entry, wherein the view port is employable to display at least a portion of the final schedule preview. - View Dependent Claims (25, 26, 27, 28, 29, 30)
-
Specification