Worker-to-Task Skill-Based Assignment

Vlad Rochian, Cosmin Bonchis, Ionut Tepeneu

Abstract: We know that any optimization problem with constraints can be solved through linear programming methods that are NP-hard and thus have (at the time of writing) only exponential solutions. In practice, though, there are methods that perform well. There are, however, particular cases of constrained optimization problems that allow polynomial solutions. In this article we study how some real world worker allocation problems can be modeled as optimization problems, whether they can be solved in polynomial time and whether a polynomial solution works better in practice than the naive one.