Schedule management interface

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 memory that is operative to store at least instructions;
• and
• a processor device that is operative to execute instructions that enable actions, including:
• generating at least one schedule layer that includes at least a start time, a shift duration, a precedence value, and at least one team member;
• generating at least one schedule entry for each schedule layer, wherein the at least one schedule entry includes a team member and a time range;
• comparing each schedule entry to each other schedule entry for all schedule layers based on an ordering of each precedence value for each schedule layer;
• determining at least one final schedule entry based on at least one compared schedule entry that corresponds to a schedule layer having a highest ordering, wherein the at least one final schedule entry includes at least a portion of the time range and the team member that corresponds to the at least one compared schedule entry;
• generating a final schedule based on the at least one final schedule entry for each team member that corresponds to the at least one compared schedule entry;
• and
• generating a plurality of epochs based on each equivalent time period within the final schedule where the same allocation of team members in the final schedule repeats, wherein jumping forward in time by each repeated epoch at least enables 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 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 final schedule;
• and
• displaying at least one notification to the at least one team member.

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

• a transceiver that is operative to communicate over a network;
• a memory that is operative to store at least instructions;
• and
• a processor device that is operative to execute instructions that enable actions, including:
• generating at least one schedule layer that includes at least a start time, a shift duration, a precedence value, and at least one team member,
• generating at least one schedule entry for each schedule layer, wherein the at least one schedule entry includes a team member and a time range;
• comparing each schedule entry to each other schedule entry for all schedule layers based on an ordering of each precedence value for each schedule layer;
• determining at least one final schedule entry based on at least one compared schedule entry that corresponds to a schedule layer having a highest ordering, wherein the at least one final schedule entry includes at least a portion of the time range and the team member that corresponds to the at least one compared schedule entry;
• generating a final schedule based on the at least one final schedule entry for each team member that corresponds to the at least one compared schedule entry;
• and
• generating a plurality of epochs based on each equivalent time period within the final schedule where the same allocation of team members in the final schedule repeats, wherein jumping forward in time by each repeated epoch at least enables reduced computation of at least a virtual start time.

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 at least one schedule layer that includes at least a start time, a shift duration, a precedence value, and at least one team member;
• generating at least one schedule entry for each schedule layer, wherein the at least one schedule entry includes a team member and a time range;
• comparing each schedule entry to each other schedule entry for all schedule layers based on an ordering of each precedence value for each schedule layer;
• determining at least one final schedule entry based on at least one compared schedule entry that corresponds to a schedule layer having a highest ordering, wherein the at least one final schedule entry includes at least a portion of the time range and the team member that corresponds to the at least one compared schedule entry;
• generating a final schedule based on the at least one final schedule entry for each team member that corresponds to the at least one compared schedule entry;
• and
• generating a plurality of epochs based on each equivalent time period within the final schedule where the same allocation of team members in the final schedule repeats, wherein jumping forward in time by each repeated epoch at least enables reduced computation of at least a virtual start time.