The assignment problem in human resource project management under uncertainty

The assignment problem (AP) is a discrete and combinatorial problem where agents are assigned to perform tasks for efficiency maximization or cost (time) minimization. AP is a part of human resource project management (HRPM). The AP optimization model, with deterministic parameters describing agent-task performance, can be easily solved, but it is characteristic of standard, well-known projects realized in a quiet environment. When considering new (innovation or innovative) projects or projects performed in very turbulent times, the parameter estimation becomes more complex (in extreme cases, even the use of the probability calculus is not recommended). Therefore, we suggest an algorithm combining binary programming with scenario planning and applying the optimism coefficient, which describes the manager's nature (attitude towards risk). The procedure is designed for one-shot decisions (i.e., for situations where the selected alternative is performed only once) and pure strategies (the execution of a weighted combination of several decision variants is not possible).