RECURSIVE METHOD OF FORMING AN OPTIMAL SET OF TASKS ACCORDING TO THE CRITERION OF MAXIMIZING EARNINGS

• Published in: Сучасні інформаційні системи Vol. 8; no. 3; pp. 72 - 76
• Main Authors: Krepych, Svitlana, Spivak, Iryna
• Format: Journal Article
• Language: English
• Published: National Technical University "Kharkiv Polytechnic Institute" 23.09.2024
• Subjects: application; earnings; maximization criterion; optimization problem; prototype; work
• ISSN: 2522-9052
• DOI: 10.20998/2522-9052.2024.3.08

The work is devoted to the problem of a person's search in the current difficult times, when there is no work at all, or insufficient wages for normal living, the possibility of additional earnings. The analysis of the current state of the labor market and software systems with offers of vacant jobs showed that there are a sufficient number of such systems in general access and easy to use. One of their disadvantages is focusing only on vacancies that require full or partial employment (for example, the IT field) of a person. Such systems do not provide the possibility of hourly work, and then a person must independently search for offers on various advertising sites, in Telegram channels, Instagram, etc. Another and the most important problem is finding such additional income that would have the maximum impact on a person. The maximization criterion in this case for any person will be the maximum possible amount of earnings for a certain period of time. After all, each proposal has its own complexity and its own price, as well as the time of implementation. The object of research is the process of maximizing earnings. In view of the above-mentioned problems, it is proposed to develop a recursive method of forming an optimal set of tasks proposed for implementation, taking into account the criterion of maximizing earnings, which is the subject of the research. As a result of the implementation of this method, all tasks that will be in the time period specified by the user will be processed and added to the possible chains of tasks. The number of chains and tasks in them will depend on the "reachability" of a certain task for the user to implement, that is, whether the user will have time to physically reach the necessary place for its implementation. Conclusion: based on the results of working out this recursive method, prototypes of its implementation in practice with the formation of an optimal set of tasks and the laying of a route on Google-map are also illustrated.