Digital memorabilia system with cycle-based greeting scheduler functions

An apparatus, comprising;

• a processor,
• a network interface,
• a memory comprising computer-readable instructions operative, when executed, to cause the processor to:
• receive, during a current cycle, a request for a first digital greeting, the request associated with a recipient user and identifying the first entity and a first delivery time;
• determine whether the request meets a scheduling condition, at least in part, by:
• accessing, in a computer-readable memory, a data record and a scheduling data structure associated with a first entity, wherein the data record includes a cycle start value, a cycle length and a maximum greeting value and wherein the scheduling data structure identifies two or more consecutive cycles and, for each cycle, one or more pre-existing scheduled greetings;
• rejecting the request, if the delivery time precedes the end of a second cycle associated with the analyst and immediately following the current cycle;
• rejecting the request, if all cycles in the scheduling data structure that precede the delivery time include a number of non-movable, pre-existing scheduled greetings that equals the maximum greeting value, wherein a non-movable, pre-existing scheduled greeting is a pre-existing scheduled greeting having a delivery time that lies within a cycle corresponding to the first delivery time;
• accept the first digital greeting for creation in the second cycle, if the second cycle includes a number of pre-existing scheduled greetings to be created in the second cycle less than the maximum greeting value;
• and
• modify the scheduling data structure to schedule the first digital greeting for creation in a selected cycle if the scheduling condition is met.

A method for providing scheduling information on a user interface for ordering a greeting, the method comprising

• displaying an indication of an analyst in a first region of the user interface;
• displaying one or more availability indications in a second region of the user interface, wherein each of the one or more availability indications correspond to a respective calendar day and indicate the availability of a greeting composed by the analyst;
• wherein the one or more availability indications are generated, in a current cycle, for each calendar day by
• accessing, in a computer-readable memory, a data record and a scheduling data structure associated with the analyst, wherein the data record includes a cycle start value, a cycle length and a maximum greeting value and wherein the scheduling data structure identifies two or more consecutive cycles and, for each cycle, one or more pre-existing scheduled greetings;
• generating a negative availability indication, if the calendar day precedes the end of a second cycle associated with the analyst and immediately following the current cycle;
• generating a negative availability indication, if all cycles in the scheduling data structure that precede the calendar day include a number of non-movable, pre-existing scheduled greetings that equals the maximum greeting value, wherein a non-movable, pre-existing scheduled greeting is a pre-existing scheduled greeting having a delivery time that lies within a cycle corresponding to the calendar day;
• generating a positive availability indication for the calendar days falling in the second cycle, if the second cycle includes a number of pre-existing scheduled greetings to be created in the second cycle less than the maximum greeting value.