Below is a statement of one perspective task of optimizing a complex of buildings, that is a further development of considered above three tasks. For this optimization task do not yet exist means of its solving.

     Here we use the following notations:

• NG — network graph;
• CAIR — constantly available individual resources;
• TUIR — temporarily unavailable individual resources;
• CACR — constantly available common resources;
• TUCR — temporarily unavailable common resources.

    General properties of the task:

• restriction for optimizable process — permissible time of NG execution;
• temporarily unavailable resources — possible;
• common resources in service of operations from different chains of the graph — possible.

     Given:

• threshold of restricting NG execution time;
• a sign of presence of first-type resources, which are CAIR;
• number of categories of second-type resources, which are TUIR, for each of them is given an array of timeslots of resources availability;
• hierarchical scheme of nesting into the NG of its components;
• for each hierarchical level of the graph are given the following parameters:
  • number of independent operations chains, included in a zero group, which are not interconnected by used common resources;
  • number of groups of dependent operations chains, which are interconnected by common resources, for each of them is given a number of such dependent chains;
  • for each independent operations chain (from the zero group) are given:
    • name of an operations chain;
    • coordinates of its ends in the NG;
    • number of operations in a chain, for each of them are given:
      • a sign of its reality or fictitiousness (see Sec. "1. Description of the subject area (4 tasks)" of this portal);
      • operation name;
      • number of its realization options, for each of them are given (for a real operation) or calculated before (for a fictitious operation):
        • essence of operation realization option;
        • type of used resource (CAIR or TUIR) and its category;
        • possible sign of forbidding suspension of operation execution;
        • net time of operation execution;
        • its execution cost;
  • for each group of dependent operations chain are given:
    • number of resources of the third type, which are CACR;
    • number of resources of the fourth type, that are TUCR, for each of them is given an array of timeslots of resources availability;
    • number of operations chains in this group, for each of them are given:
      • name of an operations chain;
      • coordinates of its ends in the NG;
      • number of operations in a chain, for each of them are given:
        • a sign of its reality or fictitiousness;
        • operation name;
        • number of its realization options, for each of them are given (for a real operation) or calculated early (for a fictitious operation):
          • essence of an operation realization option;
          • type of used resource (CAIR, TUIR, CACR or TUCR), as well as its category or number;
          • possible sign of forbidding suspension of operation execution;
          • net time of operation execution;
          • its execution cost.

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