Patent attributes
A computer implemented method for agent scheduling using a Mixed Integer Programming (MILP) model, and a Mixed Integer Programming and Search Heuristic (MILP&SH) algorithm. The MILP model of the invention comprises of an objective function, decision variables, and constraints expressing tour group and shift template rules and required staffing levels as equations and inequalities. The MILP&SH algorithm comprises of an MILP solution algorithm and a search heuristic. The MILP solution algorithm applied to the MILP model to generate a plurality of solutions. If a solution generated by the MILP solution algorithm is an integer feasible solution, the search heuristic generates agent schedules. If a solution is not an integer feasible solution, the steps of the search heuristic are executed to find an integer feasible solution. The search heuristic compares the objective function value for an integer feasible solution found with the objective value for the best solution. If the integer feasible solution has a better objective function value, the best solution is replaced with the integer feasible solution. The MILP&SH algorithm iterates to generate integer feasible solutions, and updating the best solution and associated agent schedules. The MILP&SH algorithm terminates with a best solution found when one or more stopping conditions are satisfied.
