Systems and methods of automatically scheduling a workforce
View Patent ↗Systems and methods of workforce scheduling are disclosed. One example embodiment, among others, comprises a computer-implemented method of scheduling workers. Each worker is associated with one of a set of flexibility classifications, which include non-flex-time and at least one flex-time. The method includes generating a set of shift instances to cover forecasted demand over a planning period, and assigning the shift instances to the set of workers by iterating through the each of the workers to assign at least a portion of the shift instances to a selected one of the workers. The assigning is such that total hours assigned to the selected worker depends on a number associated with the classification of the selected worker.
1. A method of scheduling a set of workers, each worker associated with one of a set of flexibility classifications, the set including a flex-time classification, comprising:
in a processor:
generating a set of shift instances to cover forecasted demand over a planning, period;
producing a set of staff mix enumerations to cover the shift instances, the set of enumerations varying from a first enumeration including zero workers of at least one non-flex-time classification and a first computed number of workers of the flex-time classification, to a last enumeration including a maximum number of workers of the at least one non-flex-time classification and a last computed number of workers of the flex-time classification; and
assigning the shift instances to the set of workers by iterating through the each of the workers to assign at least a portion of the shift instances to a selected one of the workers, such that total hours assigned to the selected worker depends on a per-interval maximum number and a per-interval minimum number of hours associated with the classification of the selected worker.
2. The method of claim 1 , wherein workers having a classification other than flex-time are assigned shill instances before workers having a classification of flex-time .
3. The method of claim 1 , wherein the total hours assigned to the selected worker approach, but do not exceed, the per-interval maximum associated with the classification of the selected worker.
4. The method of claim 1 , wherein assigning the shift instances to the set of workers uses dynamic programming.
5. The method of claim 1 , further comprising adjusting shift assignments, wherein adjusting shift assignments comprises:
determining the presence of an unassigned shift instance on a given day;
determining the presence of an underutilized, worker as compared to the per-interval maximum associated with the classification of the corresponding worker; and
assigning the unassigned shift instance to the underutilized worker.
6. The method of claim 5 , wherein adjusting shift assignments further comprises:
determining the presence of a shift instance assigned to the underutilized worker on the given day; and
swapping the shift instance assigned to the underutilized worker on the given day with another shift instance assigned to another worker on a different day.
7. The method of claim 1 , further comprising conditionally adjusting shift assignments based on a number of unassigned shifts, wherein conditionally adjusting shift assignments comprises:
determining the presence of an unassigned shift instance on a given day;
determining the presence of an underutilized worker as compared to the per-interval maximum associated with the classification of the corresponding worker; and
assigning the unassigned shift instance to the underutilized worker.
8. A non-transitory computer readable medium having instructions stored thereon for operating a computer system to schedule a set of workers, each worker associated with one of a set of flexibility classifications, the set including a flex-time classification, wherein the instructions, when executed by the computer system, direct the computer system to:
generate a set of shift instances to cover forecasted demand over a planning period;
produce a set of staff mix enumerations to cover the shift instances, the set of enumerations varying from a first enumeration including zero workers of at least one non-flex-time classification and a first computed number of workers of the flex-time classification, to a last enumeration including a maximum number of workers of the at least one non-flex-time classification and a last computed number of workers of the flex-time classification; and
assign the shift instances to the set of workers by iterating through the each of the workers to assign at least a portion of the shift instances to a selected one of the workers, such that total hours assigned to the selected worker depends on a per-interval maximum number and a per-interval minimum number of hours associated with the classification of the selected worker.
9. The non-transitory computer readable medium of claim 8 , wherein workers having a classification other than flex-time are assigned shift instances before workers having a classification of flex-time.
10. The non-transitory computer readable medium of claim 8 , wherein the total hours assigned to the selected worker approach, but do not exceed, the per-interval maximum associated with the classification of the selected worker.
11. The non-transitory computer readable medium of claim 8 , wherein the instructions direct the computer system to assign the shift instances to the set of workers using dynamic programming.
12. The non-transitory computer readable medium of claim 8 , wherein the instructions direct the computer system to adjust shift assignments by directing the computer system to:
determine the presence of an unassigned shift instance on a given day;
determine the presence of an underutilized worker as compared to the per-interval maximum associated with the classification of the corresponding worker; and
assign the unassigned shift instance to the underutilized worker,
13. The non-transitory computer readable medium of claim 12 , wherein the instructions direct the computer system to adjust shift assignments by further directing the computer system to:
determine the presence of a shift instance assigned to the underutilized worker on the given day; and
swap the shift instance assigned to the underutilized worker on the given day with another shift instance assigned to another worker on a different day.
14. The non-transitory computer readable medium of claim 8 , wherein the instructions direct the computer system to conditionally adjust shift assignments based on a number of unassigned shifts by directing the computer system to:
determine the presence of an unassigned shift instance on a given day;
determine the presence of an underutilized worker as compared to the per-interval maximum associated with the classification of the corresponding worker; and
assign the unassigned shift instance to the underutilized worker.