Supply chain resilience in task networks
A system and method are provided including a memory storing processor-executable program code; and a processing unit to execute the processor-executable program code to: receive a first task map including a plurality of nodes, each node representing an executable process for completion of a task; identify a first node of the plurality of nodes as a starting node representing the first process for completion of the task; identify a second node of the plurality of nodes as the ending node representing the last process for completion of the task; generate a first sequence order of node execution for completion of the task based on a target parameter; identify an anomaly; generate a second sequence order of node execution for completing the task based on the target parameter; and execute the nodes in the generated second sequence order. Numerous other aspects are provided.
1. A system comprising:
a memory storing processor-executable program code; and
a processing unit to execute the processor-executable program code to:
receive a first task map including a plurality of nodes, each node representing an executable process for completion of a task;
identify a first node of the plurality of nodes as a starting node representing a first process for completion of the task;
identify a second node of the plurality of nodes as an ending node representing a last process for completion of the task;
generate a first sequence order of node execution for completion of the task based on a target parameter;
identify an anomalous node in the first sequence order;
generate a second sequence order of node execution for completion of the task based on the target parameter; and
execute the nodes in the generated second sequence order.
2. The system of claim 1 , wherein the second sequence order is different from the first sequence order.
3. The system of claim 2 , wherein the second sequence order is different from the first sequence order after a node prior to the node with the identified anomaly.
4. The system of claim 3 , wherein execution of the second sequence order bypasses the anomalous node.
5. The system of claim 1 , wherein each node is associated with a performance parameter.
6. The system of claim 5 , wherein the target parameter is achieved based on a combination of the performance parameters.
7. The system of claim 5 , wherein each node is associated with a node policy.
8. The system of claim 7 , wherein generation of the first sequence order further comprises processor-executable program code to:
execute Dijkstra's algorithm using the performance parameter and the node policy for each node of the plurality of nodes.
9. The system of claim 1 , wherein the task includes nodes in different systems.
10. The system of claim 1 , further comprising processor-executable program code to:
receive an indication an anomaly of the anomalous node is corrected; and
restore the first sequence order in response to the received indication.
11. A method comprising:
receiving a first task map including a plurality of nodes, each node representing an executable process for completion of a task;
identifying a first node of the plurality of nodes as a starting node representing a first process for completion of the task;
identifying a second node of the plurality of nodes as an ending node representing a last process for completion of the task;
generating a first sequence order of node execution for completion of the task based on a target parameter;
identifying an anomalous node in the first sequence order;
generating a second sequence order of node execution for completion of the task based on the target parameter; and
executing the nodes in the generated second sequence order, wherein the second sequence order is different from the first sequence order after a node prior to the anomalous node.
12. The method of claim 11 , wherein execution of the second sequence order bypasses the anomalous node.
13. The method of claim 11 , wherein execution of each node is associated with a performance parameter.
14. The method of claim 13 , wherein the target parameter is achieved based on a combination of the performance parameters.
15. The method of claim 13 , wherein each node is associated with a node policy.
16. The method of claim 15 , wherein generating the first sequence order further comprises:
executing Dijkstra's algorithm using performance parameter and node policy for each node in plurality of nodes.
17. The system of claim 1 , further comprising:
receiving an indication an anomaly of the anomalous node is corrected; and
restoring the first sequence order in response to the received indication.
18. A non-transitory computer readable medium having executable instructions stored therein to perform a method, the method comprising:
receiving a first task map including a plurality of nodes, each node representing an executable process for completion of a task;
identifying a first node of the plurality of nodes as a starting node representing a first process for completion of the task;
identifying a second node of the plurality of nodes as an ending node representing a last process for completion of the task;
generating a first sequence order of node execution for completion of the task based on a target parameter;
identifying an anomalous node in the first sequence order;
generating a second sequence order of node execution; and
executing the nodes in the generated second sequence order.
19. The medium of claim 18 , wherein execution of the second sequence order bypasses the anomalous node.
20. The method of claim 18 , wherein generating of the first sequence order further comprises:
executing Dijkstra's algorithm using a performance parameter and a node policy for each node in the plurality of nodes.