Systems and methods of automatically scheduling a workforce
First Claim
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.
4 Assignments
0 Petitions
Accused Products
Abstract
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.
-
Citations
14 Claims
-
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. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
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. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
Specification