Research Article
Modelling Multilevel Interdependencies for Resilience in Complex Organisation
Algorithm 1
Task completion and resource sharing.
| Input: tasks, other_agents, networks, disrupted_agents | | Output: agent_task_completion_time | | t = 0 | | for task in tasks do | | for other_agent in other_agents do | | if task = other_agent[resource] then | | if other_agent not in disrupted_list then | | task = 100% | | t+= transfer_time(other_agent, agent) | | else | | for subs_agent in other_agent[shared_resources] do | | if subs_agent not in disrupted_list then | | if distance(subs_agent, agent)= 1 then ▹1 step | | agent[task]+ = subs_agent[subs_resources] | | t+ = transfer_time(subs_agent, agent) | | else if distance(subs_agent, agent)= 2 then ▹2 step | | if link and link fulfill the 2-step rule then | | agent[task]+ = subs_agent[subs_resources] | | t+ = transfer_time(subs_agent, agent) | | if all tasks 100 then | | return t | | else | | return nan |
|
