Here we use the following notations:

• NG — network graph;
• NNSG — nested network subgraph.

    General properties of the task:

• restriction for optimizable process — permissible cost of NG execution;
• temporarily unavailable resources — absent;
• common resources in service of operations from different NG chains — absent.

     Given:

• total number of operations chain in the NG;
• number of nested chains in the NG, in presence of which are given:
  • possible mode of NG decomposition by selecting NNSGs in the NG, in presence of which is given:
    • manual or automatic mode of NNSG numeration;
  • mode of automatic conversion (in order to solve the task) of some usual operations into crucial ones;
• for each chain of operations are given:
  • its name;
  • coordinates of its ends in the NG;
  • number of operations in a chain, for each of them are given:
    • operation name;
    • number of its realization options, for each of them are given:
      • essence of an operation realization option;
      • operation run-time;
      • its execution cost;
• one of two:
  • up to ten possible thresholds of restricting cost of executing the NG, if its resulting part (after decomposition) will consist of a single operations chain;
  • one threshold of restricting cost of executing the NG, if its resulting part will consist of two or more operations chain.

     Minimized quality criterion: time of NG execution under given restriction on its execution cost.