Optimization Mechanisms of Assignment in Project Management

2025

Closed access Metadata (CSL-JSON)
DOI 10.1109/sist61657.2025.11139317
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

In the two-level hierarchial game system (consisting of the center and the executors), it is required to have such a competitive executors assigning mechanism, which ensures the optimum final result at the project implementation stages.The executors are to be selected and assigned so that each candidate can pretend to execution of various quantity and quality of the general project stages at the stage of the project operations execution.An assignment problem solution can be obtained by the method of potentials, as it is a special case of transportation problem. In view of a high degree of the assignment problem primary basis degeneracy, its solution based on the method of potentials includes many trivial steps, which hampers the solution process convergence. Therefore, calculation is effected by the Hungarian method.In is reasonable to develop a model of generalized assignment problem and to provide an algorithm of its solution. Utilization of this model in the project management will contribute to creation of the optimum network diagram for project planning.