Time-cost tradeoff analysis is a very important issue in project management. The Kaufmann–Desbazeille algorithm is considered by numerous authors to be an exact algorithm to solve this problem. In the paper, we prove that this claim is not true. In particular, we perform a worst-case...

Time-cost tradeoff analysis is a very important issue in project management. The Kaufmann–Desbazeille algorithm is considered by numerous authors to be an exact algorithm to solve this problem. In the paper, we prove that this claim is not true. In particular, we perform a worst-case...

The goal programming (GP) is a well-known approach applied to multi-criteria decision making (M-DM). It has been used in many domains and the literature offers diverse extensions of this procedure. On the other hand, so far, some evident analogies between M-DM under certainty and scenario-based...

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...