🤖 AI Summary
This study addresses task sequencing, resource allocation, and multi-constraint optimization during project planning, aiming to jointly minimize makespan and cost. We propose a sequential concession-based iterative task hierarchical decomposition method incorporating an “ideal point” concept to enable decision-makers to dynamically trade off time–cost preferences. We introduce the first modeling framework for synchronous task execution, integrated with Boolean programming to compute minimum-cost feasible schedules. Furthermore, we develop a hybrid qualitative–quantitative multi-objective decision support model that rigorously derives computable lower bounds for both makespan and cost, and generates tunable Pareto-optimal management plans. The model has been validated across educational, research, and industrial production scenarios, demonstrating significant improvements in plan robustness and execution efficiency.
📝 Abstract
This paper reports an analysis of aspects of the project planning stage. The object of research is the decision-making processes that take place at this stage. This work considers the problem of building a hierarchy of tasks, their distribution among performers, taking into account restrictions on financial costs and duration of project implementation.
Verbal and mathematical models of the task of constructing a hierarchy of tasks and other tasks that take place at the stage of project planning were constructed.
Such indicators of the project implementation process efficiency were introduced as the time, cost, and cost-time efficiency. In order to be able to apply these criteria, the tasks of estimating the minimum value of the duration of the project and its minimum required cost were considered. Appropriate methods have been developed to solve them.
The developed iterative method for assessing the minimum duration of project implementation is based on taking into account the possibility of simultaneous execution of various tasks. The method of estimating the minimum cost of the project is to build and solve the problem of Boolean programming.
The values obtained as a result of solving these problems form an «ideal point», approaching which is enabled by the developed iterative method of constructing a hierarchy of tasks based on the method of sequential concessions. This method makes it possible to devise options for management decisions to obtain valid solutions to the problem. According to them, the decision maker can introduce a concession on the value of one or both components of the «ideal point» or change the input data to the task.
The models and methods built can be used when planning projects in education, science, production, etc.