The Guided Local Search Method for a Class of Workforce Scheduling Problems

A class of frequently met workforce scheduling problems that may be over-constrained in the real world is (described.) Such problems are difficult to be resolved using the classical brunch-and-bound system search method. We (then) (discuss) the application of Guided Local Search, a new kind of meta-heuristics, in such problems. As compared with (other) (common) used meta-heuristics such as Tabu Search and Simulated Annealing, Guided Local Search shows notable (better) (performance) as to solution quality, solving rapidity and algorithm robustness.