摘要：Optimization of workforce planning is important for any production area.This leads to an improvement in production process. The aim is minimization of theassignment costs of the workers, who will do the jobs. The problem is to select andassign employers to the jobs to be performed. The constraints are very strong, comingboth from the specifics of the production process and from the legislation. Sometimesit is difficult to find feasible solutions. The complexity of the problem is very high andthe needed number of calculations is exponential, therefore only specially developedalgorithms can be applied. The objective is to minimize the assignment cost, whilerespecting all requirements. We propose a new hybrid metaheuristic algorithm tosolve the workforce-planning problem, which is a combination between Ant ColonyOptimization (ACO) and suitable local search procedure.
关键词：Metaheuristics; ant colony optimization; local search; workforce planning; combinatorial optimization.
