GENERATING MULTIPLE OPTIMAL DAILY SCHEDULES FOR MULTIPLE TIME PERIODS IN A DAY AND FOR MULTIPLE DAILY PATTERNS
First Claim
1. A computer-implemented method to prepare schedules for employees in an organization, the computer-implemented method comprising:
- retrieving from one or more computer memories, a new partial schedule for an employee in the organization, the new partial schedule comprising a sequence of time slots to which are assigned multiple items including an item of work;
retrieving from the one or more computer memories, a set of one or more stored partial schedules, the set being identified at least partially by (1) an index of a last item assigned in the sequence, and (2) an ending time of the last item;
comparing at least;
(A) a first upper bound and a first lower bound on an attribute of a first complete schedule to be built including the new partial schedule with (B) a second upper bound and a second lower bound on said attribute of each second complete schedule to be built using each stored partial schedule in the set, to at least partially determine dominance between the new partial schedule and the stored partial schedules in the set;
adding the new partial schedule to the set, when the new partial schedule is determined to not be dominated by any stored partial schedule in the set; and
removing a stored partial schedule from the set, when the stored partial schedule is determined to be dominated by the new partial schedule;
wherein at least the comparing, the adding, and the removing, are performed by one or more processors coupled to the one or more computer memories.
1 Assignment
0 Petitions
Accused Products
Abstract
A computer and method use at least an index of a last item in a new partial schedule and an ending time of the last item to identify a set of one or more stored partial schedules. The computer and method determine whether the new partial schedule dominates any stored partial schedule in the set, based on comparison of at least new lower bound(s) and new upper bound(s) on attribute(s) of a complete schedule that comprises the new partial schedule, with corresponding lower bound and upper bound of each complete schedule to be built using each stored partial schedule. Any stored partial schedule in the set is removed, when the new partial schedule is determined to dominate said any stored partial schedule. When no stored partial schedule in the set dominates the new partial schedule, the new partial schedule is added to the set, followed by repeating the process.
-
Citations
20 Claims
-
1. A computer-implemented method to prepare schedules for employees in an organization, the computer-implemented method comprising:
-
retrieving from one or more computer memories, a new partial schedule for an employee in the organization, the new partial schedule comprising a sequence of time slots to which are assigned multiple items including an item of work; retrieving from the one or more computer memories, a set of one or more stored partial schedules, the set being identified at least partially by (1) an index of a last item assigned in the sequence, and (2) an ending time of the last item; comparing at least;
(A) a first upper bound and a first lower bound on an attribute of a first complete schedule to be built including the new partial schedule with (B) a second upper bound and a second lower bound on said attribute of each second complete schedule to be built using each stored partial schedule in the set, to at least partially determine dominance between the new partial schedule and the stored partial schedules in the set;adding the new partial schedule to the set, when the new partial schedule is determined to not be dominated by any stored partial schedule in the set; and removing a stored partial schedule from the set, when the stored partial schedule is determined to be dominated by the new partial schedule; wherein at least the comparing, the adding, and the removing, are performed by one or more processors coupled to the one or more computer memories. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. One or more non-transitory computer-readable storage media comprising a plurality of instructions executable by one or more processors in a computer, the plurality of instructions comprising:
-
instructions to retrieve from one or more computer memories, a new partial schedule for an employee in an organization, the new partial schedule comprising a sequence of time slots to which are assigned multiple items including an item of work; instructions to retrieve from the one or more computer memories, a set of one or more stored partial schedules, the set being identified at least partially by (1) an index of a last item assigned in the sequence, and (2) an ending time of the last item; instructions to compare at least;
(A) upper and lower bounds on an attribute of a first complete schedule to be built including the new partial schedule with (B) respective upper and lower bounds on said attribute of each second complete schedule to be built using each stored partial schedule in the set, to determine dominance between the new partial schedule and the stored partial schedules in the set;instructions to add the new partial schedule to the set, when the new partial schedule is determined to not be dominated by any stored partial schedule in the set; and instructions to remove a stored partial schedule from the set, when the stored partial schedule is determined to be dominated by the new partial schedule; wherein at least the instructions to compare, the instructions to add, and the instructions to remove, are to one or more processors coupled to the one or more computer memories. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. An apparatus comprising:
-
one or more computer memories coupled to one or more processors; wherein the one or more computer memories comprise a new partial schedule for an employee in an organization, the new partial schedule comprising a sequence of time slots to which are assigned multiple items including an item of work; wherein the one or more computer memories further comprise a set of one or more stored partial schedules, the set being identified at least partially by (1) an index of a last item assigned in the sequence, and (2) an ending time of the last item; means for comparing at least;
(A) upper and lower bounds on an attribute of a first complete schedule to be built including the new partial schedule with (B) respective upper and lower bounds on said attribute of each second complete schedule to be built using each stored partial schedule in the set, to determine dominance between the new partial schedule and the stored partial schedules in the set;means for adding the new partial schedule to the set, when the new partial schedule is determined to not be dominated by any stored partial schedule in the set; and means for removing a stored partial schedule from the set, when the stored partial schedule is determined to be dominated by the new partial schedule; wherein at least the instructions to compare, the instructions to add, and the instructions to remove, are to one or more processors coupled to the one or more computer memories. - View Dependent Claims (20)
-
Specification