Shift design and assignment system
AssigneeWorkday, Inc.
InventorJin Yang
Life of this patent
Estimating the term…
Abstract
A system for shift design and assignment comprises an interface configured to receive scheduling input data which includes labor demand data, worker data, and scheduling configuration data, and a processor configured to generate a set of shift candidates, determine a set of decision variables, determine a cost function, determine a set of constraints, and determine simultaneously, using a SAT, a MP solver, or a MIP solver, a subset of the shift candidates selected in a final schedule and a set of shift assignments of which worker is assigned to which selected shift candidate of the subset of the shift candidates such that the hard constraints are fully respected, violations to the soft constraints are minimized, and the cost function is minimized.
Claims20
A system for shift design and assignment, comprising:
- a worker scheduling data interface configured to:
- receive worker data;
- and
- a processor configured to:
- generate a set of shift candidates;
- determine a set of decision variables representing whether a particular shift candidate is selected in a final schedule and whether a particular worker is assigned to the particular shift candidate;
- determine a cost function, wherein the cost function is expressed at least in part in terms of the set of decision variables, a worker cost data of the worker data, and the scheduling configuration data;
- determine a set of constraints, wherein the set of constraints is based at least in part on the set of decision variables, the set of shift candidates, the worker data, a labor demand data, and a scheduling configuration data;
- and
- determine simultaneously, using either a SAT solver, MP solver, or a MIP solver, a subset of the shift candidates selected in the final schedule and a set of shift assignments of which worker is assigned to which selected shift candidate of the subset of the shift candidates such that the hard constraints are fully respected, violations to the constraints are minimized, and the cost function is minimized.
A method for shift design and assignment, comprising:
- receiving worker data using a worker scheduling data interface;
- generating, using a processor, a set of shift candidates;
- determining a set of decision variables representing whether a particular shift candidate is selected in a final schedule and whether a particular worker is assigned to the particular shift candidate;
- determining a cost function, wherein the cost function is expressed at least in part in terms of the set of decision variables, a worker cost data of the worker data, and the scheduling configuration data;
- determining a set of constraints, wherein the set of constraints is based at least in part on the set of decision variables, the set of shift candidates, the worker data, a labor demand data, and a scheduling configuration data;
- and
- determining simultaneously, using either a SAT solver, a MP solver, or a MIP solver, a subset of the shift candidates selected in the final schedule and a set of shift assignments of which worker is assigned to which selected shift candidate of the subset of the shift candidates such that the hard constraints are fully respected, violations to the constraints are minimized, and the cost function is minimized.
A computer program product for shift design and assignment, the computer program product being embodied in a non-transitory computer readable storage medium and comprising computer instructions for:
- receiving worker data using a worker scheduling data interface;
- generating, using a processor, a set of shift candidates;
- determining a set of decision variables representing whether a particular shift candidate is selected in a final schedule and whether a particular worker is assigned to the particular shift candidate;
- determining a cost function, wherein the cost function is expressed at least in part in terms of the set of decision variables, a worker cost data of the worker data, and the scheduling configuration data;
- determining a set of constraints, wherein the set of constraints is based at least in part on the set of decision variables, the set of shift candidates, the worker data, a labor demand data, and a scheduling configuration data;
- and
- determining simultaneously, using either a SAT solver, a MP solver, or a MIP solver, a subset of the shift candidates selected in the final schedule and a set of shift assignments of which worker is assigned to which selected shift candidate of the subset of shift candidates such that the hard constraints are fully respected, violations to the constraints are minimized, and the cost function is minimized.
Dependencies are inferred from the claim text.