Scheduling Strategy Development for Solving Periodic Fuzzy Network Scheduling Problem with Limited Resources

The paper introduces a strategy for solving a periodic fuzzy problem of temporal network scheduling with limited resources. It is proposed to use a computation graph and decision tree approach to analyze the stages of the planning system at each moment in time. In some cases of dynamic networks, the topology or some network parameters may change from round to round of calculations, and the results of the previous stage of calculations can become input for the next stage of calculations. The method proposed in this paper allows reflecting precedence relations on a graph, formalizes fuzzy temporal input parameters of the network using fuzzy numbers (left and right distribution). Fuzzy temporal justification in planning problems involves the introduction of relationships between elements or operations, their topological ordering in time under limitations of the system. It is also proposed to use the concept of temporal triangular fuzzy number on a real-time scale as a partial order (schedule or alternative) corresponding to their relation of the priority of operations from left to right.