GENERATING MULTIPLE OPTIMAL DAILY SCHEDULES FOR MULTIPLE TIME PERIODS IN A DAY AND FOR MULTIPLE DAILY PATTERNS

• US 20150012323A1
• Filed: 07/02/2013
• Published: 01/08/2015
• Est. Priority Date: 07/02/2013
• Status: Abandoned Application

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Guerinik, Nabil, Guerinik, Malika, Beuchard, Guillaume
• Application Number:
  US13/934,177
• Publication Number:
  US 20150012323A1
• Time in Patent Office: Days
• US Class Current: 705/7.21
• CPC Class Codes: G06Q 10/1097 Task assignment

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.

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.

2. The computer-implemented method of claim 1 wherein:

the attribute is work duration.

3. The computer-implemented method of claim 1 wherein:

the attribute is ending time.

4. The computer-implemented method of claim 1 wherein:

the attribute is hereinafter a first attribute;

the complete schedule has a second attribute; and

the computer-implemented method further comprises comparing (C) a third upper bound and a third lower bound on the second attribute of the first complete schedule with (D) a fourth upper bound and a fourth lower bound on said second attribute of the second complete schedule.

5. The method of claim 4 wherein:

the stored partial schedule is dominated by the new partial schedule when

the first upper bound is larger than the second upper bound;

the first lower bound is smaller than the second lower bound;

the third upper bound is larger than the fourth upper bound; and

the third lower bound is smaller than the fourth lower bound.

6. The method of claim 1 wherein:

the new partial schedule comprises a new item immediately following the last item of another stored partial schedule; and

the new item is of a type different from the last item.

7. The method of claim 1 wherein:

the multiple items assigned to time slots in the new partial schedule conform to a pattern; and

each stored partial schedule in the set comprises time slots to which are assigned said multiple items in conformance with said pattern.

8. The method of claim 7 wherein:

the set is identified by a cell in a three dimensional matrix stored in the one or more computer memories; and

the three dimensional matrix is indexed by;

(A) the index of the last item;

(B) the ending time of the last item; and

(C) an identifier of the pattern.

9. The method of claim 7 wherein:

at least the comparing, the adding, and the removing, are performed numerous times for said pattern, and several times for additional patterns.

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.

11. The one or more non-transitory computer-readable storage media of claim 10 wherein:

the attribute is work duration.

12. The one or more non-transitory computer-readable storage media of claim 10 wherein:

the attribute is ending time.

13. The one or more non-transitory computer-readable storage media of claim 10 wherein:

the attribute is hereinafter a first attribute;

the complete schedule has a second attribute; and

the computer-implemented method further comprises comparing (C) a third upper bound and a third lower bound on the second attribute of the first complete schedule with (D) a fourth upper bound and a fourth lower bound on said second attribute of the second complete schedule.

14. The one or more non-transitory computer-readable storage media of claim 13 wherein:

the stored partial schedule is dominated by the new partial schedule when

the first upper bound is larger than the second upper bound;

the first lower bound is smaller than the second lower bound;

the third upper bound is larger than the fourth upper bound; and

the third lower bound is smaller than the fourth lower bound.

15. The one or more non-transitory computer-readable storage media of claim 10 wherein:

the new partial schedule comprises a new item immediately following the last item of another stored partial schedule; and

the new item is of a type different from the last item.

16. The one or more non-transitory computer-readable storage media of claim 10 wherein:

the multiple items assigned to time slots in the new partial schedule conform to a pattern; and

each stored partial schedule in the set comprises time slots to which are assigned said multiple items in conformance with said pattern.

17. The one or more non-transitory computer-readable storage media of claim 16 wherein:

the set is identified by a cell in a three dimensional matrix stored in the one or more computer memories; and

the three dimensional matrix is indexed by;

(A) the index of the last item;

(B) the ending time of the last item; and

(C) an identifier of the pattern.

18. The one or more non-transitory computer-readable storage media of claim 10 wherein:

at least the instructions to compare, the instructions to add, and the instructions to remove, are configured for execution numerous times for said pattern, and several times for additional patterns.

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.

20. The apparatus of claim 19 wherein:

the attribute is hereinafter a first attribute;

the complete schedule has a second attribute; and

the apparatus further comprises means for comparing (C) a third upper bound and a third lower bound on the second attribute of the first complete schedule with (D) a fourth upper bound and a fourth lower bound on said second attribute of the second complete schedule.