The Assignment Problem in Human Resource Project Management under Uncertainty

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