Algorithm for solving multicriteria problem of appointments on the networks

Algorithm for solving multicriteria problem of appointments on the networks

Bugaeev, Yu. V.;Avseeva, O. V.;Korobova, L. A.;Shurupova, I. Yu.;
vestnik voronežskogo gosudarstvennogo universiteta inženernyh tehnologij 2018 Vol. 79 pp. 71-74
242
bugaeev2018algorithmvestnik

Abstract

To describe complex projects or various jobs that make up a set of interrelated activities, use the network schedule. Several variants of network models are used. 1. For practical use, the Gantt chart is the most widely used - it is a graphical representation of consecutive intervals of time and the use of resources. 2. The network graph is represented as a graph, where the vertices are an event (or its state at a certain point in time), and the connecting arcs (or edges) are works. The graph model is used in the work. In this case, the events (the fact of the completion or the beginning of the work) correspond to the vertices of the graph, and the work to the arcs, the orientation of which corresponds to the technology of this process. An important role in the project management model is played by the optimal assignment of performers to the existing list of works. With this formulation of the problem, the total implementation time or the length of the critical path on the graph can be used as a criterion. In this case, the criterion is imposed a restriction on the deadline for the execution of work (or the project as a whole). Thus, the total time spent on the project and the length of the critical path are represented by equally important characteristics of the project implementation, and they should be considered as two equivalent criteria for the multicriteria project management task. We have proposed an algorithm, in general, an approximate determination of the set of Pareto-optimal solutions of a given problem.

Citation

ID: 85822
Ref Key: bugaeev2018algorithmvestnik
Use this key to autocite in SciMatic or Thesis Manager

References

Blockchain Verification

Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
85822
Unique Identifier:
47f0ef1fa4b2911402381181668f4389
Network:
Scimatic Chain (ID: 481)
Loading...
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
5/5
Creates 1,000,000 NFT tokens for this article
Token Features:
  • ERC-1155 Standard NFT
  • 1 Million Supply per Article
  • Transferable via MetaMask
  • Permanent Blockchain Record
Blockchain QR Code
Scan with Saymatik Web3.0 Wallet

Saymatik Web3.0 Wallet