Here we use the following notations:

• NG — network graph;
• TUR — temporarily unavailable resources.

    General properties of the task:

• restriction for optimizable process — permissible time of NG execution;
• temporarily unavailable resources — present;
• 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 is given:
  • mode of automatic conversion (in order to solve the task) of some usual operations into crucial ones;
• number of TUR categories, for each of them are given:
  • number of timeslots of resource accessibility, for each of them are given moments of its start and end;
• 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;
      • a category of used resource;
      • possible sign of forbidding suspension of operation execution
      • net time of operation execution;
      • its execution cost;
• up to ten possible thresholds of restricting NG execution time.

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