<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Boris Sokolov</string-name>
          <email>sokolov_boris@inbox.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Valerii Zakharov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Aleksey Krylov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>St. Petersburg Federal Research Center of the Russian Academy of Sciences (SPC RAS)</institution>
          ,
          <addr-line>39, 14th line V.O., St.Petersburg, 199178</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The article suggests a polymodel description of cyber-physical systems (CFS) functioning, that represent multifunctional hardware and software complexes aimed at reception (transmission), storage, processing and forming of controlling actions both for the service objects (SO), conducting a given set of target tasks that are not included into CFS, as well as at ensuring their own reliable operation. Within the subject field, related to scientific device engineering, these models and relevant algorithms applying them, have a big scientific and practical value, as due to optimization of the measuring and computing operations (MCO), they allow to generally increase efficiency of using precise instrumental complexes in the specified environmental conditions. The developed polymodel description is based on the original dynamic interpretation of relevant processes.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Cyber-physical systems</kwd>
        <kwd>measuring and computing operations scheduling</kwd>
        <kwd>dynamic models</kwd>
        <kwd>optimal software control</kwd>
        <kwd>software tools</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>1. Introduction</p>
      <p>
        1 Currently various classes of
cyberphysical systems (CPS) are becoming the
major component of digital production and
digital economics in general; these systems
involve measuring, telecommuncational and
control subsystems. [
        <xref ref-type="bibr" rid="ref1 ref2">1,2</xref>
        ]. Hereafter CPS is
referred to a centralized and/or distributed
hardware and software system, implementing
physical and infocommunicational procedures
of processing, accumulation, storage, search,
protection, dissemination and usage of data
and information, as well as interacting with
objects of the real world through physical
processes.
      </p>
      <p>Based on the CPS projects of “Smart
Manufacturing”, “Smart Houses”, “Smart
Energy”, “Smart Transport”, “Smart Life
Safety System”, “Smart Healthcare System”,
“Smart and Safe Cities”, “smart”
defenserelevant objects etc., such systems can ensure
implementation of technologies for controlled
self-organization within traffic management
on the city streets by means of analyzing data
on status and driving direction, received from
vehicles; coordinated functioning of
production equipment for effective
manufacturing of small sets of various items,
as well as electricity generation by providing
workload optimization of thermal electric
power stations, nuclear power plants,
hydroelectric power stations, etc.</p>
      <p>
        In this case the CPS measurement and
calculation subsystems can be considered as
variants of intellectual self-managed
measurement and calculation systems with a
number of specific features. In the first
instance these features include the following
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]: the number of measurement channels
within one CPS can involve from tens to
hundreds of units even in the upcoming years;
measurement channels can include sensors of
various values, both scalar and tensor,
whereby in the territorial aspect the sensors
can be placed remotely from each other;
measurement information is transmitted over
long distances through wire and wireless
communication channels.
      </p>
      <p>
        Measurement information processing can
be implemented by means of various
computational technologies, including cloud
technologies, at the same time the processing
must be implemented close to the real time
scale [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. CPS control subsystems are
characterized by similar features.
      </p>
      <p>
        Creation of economically effective CPS is
possible only in case the data, information and
supporting knowledge, is characterized by
high confidence, received swiftly and the
operational costs are sufficiently small. Due to
limited scope of the article let us consider only
the issue of developing the MCO scheduling
plan, as the most important and
timeconsuming stage of the complex scheduling on
CPS functioning [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Scheduling problem description</title>
      <p>
        Let us assume that there is a set of service
objects (SO): A ={A i , i ∈ N}, forming part of
some SO group and aimed at solving the joint
set target task (i.e., monitoring of
ecoeconomic objects condition). To ensure SO
proper functioning it is required to
permanently conduct evaluation and correction
of navigational data on board of each SO. This
task is implemented by CPS [
        <xref ref-type="bibr" rid="ref2">2, 9</xref>
        ]: that
include hardware and software complexes,
which solve tasks on reception (transmission),
storage, processing and forming of controlling
actions both for the service objects, that are
not included into CPS, and at ensuring their
own reliable operation.
      </p>
      <p>Let us introduce a set of CPS:
B ={B j , i ∈ M }, M ={1,..., m }. Herewith, due to
availability of unitized hardware and software
tools in order to provide informational
interaction on SO and CPS, in case relevant
information is available, each of the listed
elements of SO and CPS is capable to a certain
extent conduct functions of any other element,
based on the emerging situation.</p>
      <p>To ensure convenience of further
representation we introduce the generalized set
of interacting objects (IO)
B ={Bl , l, i, j ∈ M =N  M ={1,..., m}}. Let us
also review a set of operations for interaction
(OI) D(i)
={Dγ(i) , γ ∈ Φ}, Φ</p>
      <p>={1,..., si }.</p>
      <p>
        All considered, at the informative level the
task on scheduling of CPS functioning for
implementing MCO (which are a subset of OI)
can be formulated as follows: it is required to
find such an admissible control programme for
information-computational operations and
CPS (their functioning scheduling), so that
within its implementation all the operations,
that are a part of relevant technological cycles
of SO control, would be conducted timely and
in the full scale, and the quality of
informational support to the SO would meet
all the specified requirements. At the same
time, if there are several admissible
programmes for CPS control received, it is
required to select the best possible
(appropriate) programme (comprehensive
plan) based on the accepted optimality
criterion [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Dynamic models for CPS fucntioning</title>
      <p>scheduling</p>
      <p>Formalization of the scheduling task, as it
was described in the introduction, will be
implemented, applying the dynamic
interpretation of the process on technical
operations realization, suggested by the
authors. Based on the problem description of
CPS scheduling, let us introduce the following
models for programme control.</p>
      <p>The dynamic model for programme control
of interaction operations (including the
computing operations) in CPS (model Мо).</p>
      <p>Mo =u(o) (t) | xi(γo) =∑ εij (t) ⋅ui(γoj); xi(γo) (t0 ) =0;</p>
      <p>m
 j=1</p>
      <p>m si (o) ≤ c(jo,1);
xi(γo) (t f ) =ai(γo);∑ ∑uiγ j</p>
      <p>i=1 γ=1
m sj (o) ≤ ci(o,2); ui(γoj) (t) ∈{0,1};
∑ ∑uiγ j
j= 1 γ= 1
 
iγ j  ∑ (ai(αo) − xi(αo) ) + ∏ (ai(βo) − x(o) ) = 0;
u(o)
α∈Γiγ1 β∈Γiγ2 iβ 
i, j =1,..., m;i ≠ j; γ =1,...,si},
(1)
with x(o) — the variable, characterizing the
iγ
state of IO implementation ( Dγ(i) , D(i) , D(i) );
α β
aγ(o) , ai(αo) , ai(βo) — the specified volumes of
operations implementation; ui(γo)j (t) — control
action; ui(γo)j (t) = 1 ,
if
implemented, and in the case
ui(γo)j (t) = 0 ; Γiγ1, Γiγ2 — a set of numbers of
interaction operations, conducted with object
Bi , immediately preceding and technologically
D(i)</p>
      <p>γ
opposite
is
related to operation Dγ(i) applying logic
operations «AND», «OR» respectively;
c(jo,1) , ci(o,2) — are defined constants,
characterizing the hardware restrictions,
related to CPS functioning in general; εij (t) —
the known matrix time function, whereby the
spatitemporal restrictions are set, related to
interaction of objects Bi (or B ) with Bj , this
k
function receives the value 1, if Bi gets into
the defined zone of interaction Bj ; 0 — in the
opposite case.</p>
      <p>The dynamic model for controlling
interaction operations (including computation
operations) in CPS (model Мe).</p>
      <p>M e
=u(e) { (t) | xi(g )</p>
      <p>=(t)xi(g Fi ) ;

Zi</p>
      <p>y(ji) (t) =dтj(t)xi(g ) + ξ(je) ;
=−Zi Fi − Fiт Zi − ∑m ∑ ui(γe)j dσjd2 тj ; (2)</p>
      <p>j= 1 γ∈Γi j
i ≠ j; i, j ∈ M ; 0 ≤ ui(γe)j ≤ c(jeγ)ui(γo)j },
with xi( g ) — state vector of OS Bi ; Fi(t) — is
the specified matrix, characterizing the
dynamic of variable change (computed
parameters), describing OS state (i.e., their
spatial position or aircraft systems state§); ξ(je)
— uncorrelated errors of SO parameters
measurements, that are conducted by CPS
technical means Bj ; it is supposed that
measurement errors comply with the normal
distributive law with zero mathematical
expectation and dispersion equal to σ2j ;
Dγ(i) ∈ D(i) ; ui(γe)j (t) — control action, defining
intensity of SO measuring parameters y(ji) (t)
(i.e. distance to SO, temperature and humidity
aboard SO), that are conducted in the remote
mode with technical means of CPS Bj ; ci(γe) —
specified values, characterizing technological
capabilities of means Bj while implementing
state vector component xi(g) (t) OS. The major
difference of the model (2) from the ones
previously proposed is that the operations on
CPS state parameters measurement, through
restrictions over control actions ui(γe)j , are
directly connected to MCO, implemented by
CPS, specified in the model Мо. This allows to
research the task on scheduling MCO
procedures of data collecting, transmitting and
processing, and the tasks on scheduling
measurements of the controlled objects
parameters from unified system positions.</p>
      <p>Quality evaluation of CPS MCO
programme control processes (or, in other
words, quality of MCO operational
scheduling) can be conducted using various
objective functions. Let us introduce some of
them:</p>
      <p>J (o) 1 m si m tf
1 =∑i=1 2 ∑γ=1{[ai(γo) − xi(γo) (t f )]2 + ∑j=1 t∫0 ηiγ (τ)ui(γo)j (τ)dτ},i ≠ j; (3)
 
J2(e) = bγT Ki (t f )bγ ;
(4)
J3(e)</p>
      <p>m m tf
=∑∫ ∑ ∑ ui(γe)j (τ )dτ , j ≠ i, (5)</p>
      <p>i=1 j=1 γ∈D(i) t0
with ηiγ (τ) — known monotone functions of
time, that are selected taking into
consideration the given scheduled time frames
of the start (finish) of implementing OS of
MCO with CPS Bi . The indicator (3) is
introduced in case it is necessary to evaluate
depth of boundary conditions fulfillment, as
well as the value of total fine for not
implementing the operations specified
scheduled time frames. For OS, where we
consider instrumental complexes, aimed at
solving tasks on monitoring specified
environmental objects (SEO) state, the
operations, related to evaluation of their
position, that therefore allow to define SEO
position, have the special significance.
Thereby the value of quality indicator (4)
characterizes the determination accuracy of χ
–bйχ = 0c0o..m.1.p..o0n0eTnt— of vector xi(g) (
specified intermediate
vector, which defines the required element
with number χ in the correlation matrix Ki (t)
). Objective function of type (5) allows to
provide quantitative evaluation for CPS
resources consumption while implementing
operations D(i) , related to OS state changes.</p>
      <p>γ</p>
      <p>Further, let us provide formal problem
statement on scheduling MCO, implemented
by CPS. It is required to find such admissible
control, that answers the required limitations
and transfers the dynamic system from the
specified initial state into the specified final
state. In case there are several such control
actions (complex plans), it is required to select
the best possible (optimal) among them,
ensuring that components of the generalized
vector take extreme values.</p>
      <p>
        Previously the works [
        <xref ref-type="bibr" rid="ref12 ref13">12,13</xref>
        ] demonstrated,
how it is possible to narrow down the task on
scheduling operations and distributing
resources in complex technical objects to
twopoint boundary value problem, applying
Boltyansky’s method of local sections. In this
case the task on MCO scheduling is
formulated as task on searching for optimal
programme control, that ensures required
determination accuracy of CPS and OS
position within minimum time frames (or with
minimum power consumption from MCO
implementation) [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Traditionally, the tasks
of this class (tasks of scheduling theory) are
solved applying the method of mathematical
programming [
        <xref ref-type="bibr" rid="ref11 ref15 ref5">5,11,15</xref>
        ]. The suggested usage
of methods for theory of optimal control in
order to solve tasks of the scheduling theory
allows to improve the quality of scheduling
results (including increase of efficiency on
plans development, reduction in energy
consumption within its implementation, etc.)
[
        <xref ref-type="bibr" rid="ref16 ref5">5, 16</xref>
        ].
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Results analysis on solving scheduling of</title>
      <p>measuring and computing operations in
CPS</p>
      <p>The search for a MCO complex plan is
implemented in two stages. At the first stage in
order to initialize the generalized procedure for
measuring and computing operations
optimization there was an admissible heuristic
plan synthesized. In order to implement it the
well-known FIFO algorithm (“first in, first
out”) was used. At the second stage the
multistep procedure for solving the two-point
boundary value problem was conducted, to
which the initial nonclassical task on calculus
of variations was narrowed. The results of two
stages implementation are shown in Fig. 1.</p>
      <p>Application of this approach allows to
reduce the amount of unprocessed
informational flows by 20%; eliminate
unbalanced resources consumption; reduce
interruptions of scheduled time in operation
implementation by 17%; increase the
generalized quality indicator by 19%.</p>
      <p>Moreover, additional researches of
processes on implementing measuring
operations, related to evaluation of various
factors influence on the mentioned factors,
were held. The graphs (Fig. 2, Fig. 3) show,
that for each OS with a new interaction session
with CPS the accuracy of measurement of its
position parameters increases.</p>
      <p>Within the second group of experiments the
parameters of measuring tool disperison were
sequentially reduced by half (Fig. 4). The
graph shows that the influence of measuring
tool dispersion parameters in a lesser extent
affects the results of measurements
optimization.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>The article provides a polymodel description
and results of solving task on planning MCO
of CPS. The main features and differences
between the suggested models are that within
dynamic interpretation of MCO, included into
CPS technological cycle, processes
implementation, the dimension of the solved
scheduling tasks and strength of association in
scheduling algorithm are notably reduced. This
dimension is defined within solving
scheduling task at each time point by a number
of independent tracks in the general network
graph, implemented by CPS, by current
spatiotemporal, technical, technological
restrictions.</p>
      <p>
        The studies on the developed models
features and characteristics showed, that by
means of CPS operation rational (optimal)
scheduling, firstly, the general capacity of CPS
increases and, secondly, CPS resource
consumption for MCO implementation
reduces, and as well time lags in CPS control
paths reduce, thirdly, there is a reduction of
peak informational loads within sudden
changes of CPS structure. Moreover, based on
dynamic description of CPS functioning
processes, it is possible to explicitly connect
its elements and subsystems control
technology with results of target application of
instrument complexes, implementing data on
SEO reception, processing and analysis, as
well as with characteristics of CPS hardware
and software complexes. MCO complex
scheduling offers interesting prospects on
forming justified requirements to CPS
characteristics. In [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] information is provided
about multiple ways to apply the suggested
approach in practice in order to solve tasks of
scheduling theory, emerging in various subject
fields (space technology, shipbuilding, state
administration, etc.).
      </p>
    </sec>
    <sec id="sec-6">
      <title>6. Acknowledgements</title>
      <p>The research described in this paper is
partially supported by the Russian Foundation
for Basic Research (19–08–00989,
20-0801046), state research 0073–2019–0004.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Teilans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Romanovs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. A.</given-names>
            <surname>Merkuryev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. P.</given-names>
            <surname>Dorogovs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Kleins</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Potryasaev</surname>
          </string-name>
          ,
          <article-title>Assessment of Cyber Physical System Risks with Domain Specific Modelling and Simulation</article-title>
          ,
          <source>SPIIRAS Proceedings</source>
          (
          <year>2018</year>
          )
          <fpage>115</fpage>
          -
          <lpage>139</lpage>
          . doi:
          <volume>10</volume>
          .15622/sp.59.5
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>W.</given-names>
            <surname>Wolf</surname>
          </string-name>
          ,
          <article-title>Cyber-physical Systems</article-title>
          . Computer, (
          <year>2009</year>
          )
          <fpage>88</fpage>
          -
          <lpage>89</lpage>
          . doi:
          <volume>10</volume>
          .1109/
          <string-name>
            <surname>MC</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <volume>81</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Ivanov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.V.</given-names>
            <surname>Sokolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dolgui</surname>
          </string-name>
          .
          <article-title>Introduction to Scheduling in Industry 4.0 and Cloud Manufacturing Systems</article-title>
          . In: Sokolov B.,
          <string-name>
            <surname>Ivanov</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dolgui</surname>
            <given-names>A</given-names>
          </string-name>
          . (
          <article-title>eds) Scheduling in Industry 4.0</article-title>
          and
          <string-name>
            <given-names>Cloud</given-names>
            <surname>Manufacturing</surname>
          </string-name>
          .
          <source>International Series in Operations Research &amp; Management Science</source>
          , (
          <year>2020</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -43177-
          <issue>8</issue>
          _
          <fpage>1</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Li</given-names>
            <surname>Da</surname>
          </string-name>
          <string-name>
            <surname>Xu</surname>
          </string-name>
          , Eric L.
          <article-title>Xu &amp; Ling Li Industry 4.0: state of the art and future trends</article-title>
          ,
          <source>International Journal of Production Research</source>
          (
          <year>2018</year>
          )
          <fpage>2941</fpage>
          -
          <lpage>2962</lpage>
          . doi:
          <volume>10</volume>
          .1080/00207543.
          <year>2018</year>
          .1444806
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D. F.</given-names>
            <surname>Rossit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Tohmé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Frutos</surname>
          </string-name>
          .
          <source>Industry 4</source>
          .0:
          <string-name>
            <surname>Smart</surname>
            <given-names>Scheduling</given-names>
          </string-name>
          ,
          <source>International Journal of Production Research</source>
          ,
          <volume>57</volume>
          (
          <issue>12</issue>
          ), (
          <year>2019</year>
          )
          <fpage>3802</fpage>
          -
          <lpage>3813</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R. M.</given-names>
            <surname>Yusupov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Musae</surname>
          </string-name>
          .
          <source>Efficiency of Information Systems and Technologies: Features of Estimation. SPIIRAS Proceedings. 2</source>
          , (
          <year>2017</year>
          )
          <fpage>5</fpage>
          -
          <lpage>34</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.L.</given-names>
            <surname>Ackoff</surname>
          </string-name>
          ,
          <source>The art of problem solving</source>
          ,
          <year>1978</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>V.</given-names>
            <surname>Kupriyanovsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Namiot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sinyagov</surname>
          </string-name>
          ,
          <article-title>Cyber-phisical systems as a base for digital economy</article-title>
          .
          <source>International Journal of Open Information Technologies</source>
          (
          <year>2016</year>
          )
          <fpage>18</fpage>
          -
          <lpage>24</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>W.</given-names>
            <surname>Shijie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yingfeng</surname>
          </string-name>
          ,
          <string-name>
            <surname>Z.</surname>
          </string-name>
          <article-title>A credit-based dynamical evaluation method for the smart configuration of manufacturing services under Industrial Internet of Things</article-title>
          .
          <source>J Intell Manuf</source>
          <volume>32</volume>
          , (
          <year>2021</year>
          )
          <fpage>1091</fpage>
          -
          <lpage>1115</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>V. V.</given-names>
            <surname>Zakharov</surname>
          </string-name>
          ,
          <article-title>Dynamic interpretation of formal description and solution of the problem of complex object modernization</article-title>
          .
          <source>Journal of Instrument Engineering</source>
          . (
          <year>2019</year>
          )
          <fpage>914</fpage>
          -
          <lpage>920</lpage>
          . doi:
          <volume>10</volume>
          .17586/
          <fpage>0021</fpage>
          -3454-2019-62- 10-914-920
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Csalodi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Süle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jaskó</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Holczinger</surname>
          </string-name>
          ,
          <source>J. Abonyi, Industry</source>
          <volume>4</volume>
          .0
          <article-title>-Driven Development of Optimization Algorithms: A Systematic Overview</article-title>
          . Complexity, (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>L.S.</given-names>
            <surname>Pontryagin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.G.</given-names>
            <surname>Boltyanskiy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.V.</given-names>
            <surname>Gamkrelidze</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.F.</given-names>
            <surname>Mishchenko</surname>
          </string-name>
          ,
          <source>The Mathematical Theory of Optimal Processes</source>
          . Oxford. Pergamon Press (
          <year>1964</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>V. N.</given-names>
            <surname>Kalinin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. V.</given-names>
            <surname>Sokolov</surname>
          </string-name>
          ,
          <article-title>A dynamic model and an optimal scheduling algorithm for activities with bans of interrupts</article-title>
          .
          <source>Automation and Remote Control</source>
          (
          <year>1987</year>
          )
          <fpage>88</fpage>
          -
          <lpage>94</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>E.B.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Markus</surname>
          </string-name>
          .
          <source>Foundations of optimal control theory</source>
          ,
          <year>1967</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>V.S.</given-names>
            <surname>Tanayev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.V.</given-names>
            <surname>Shkurba</surname>
          </string-name>
          , Introduction to Scheduling Theory,
          <year>1975</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Yu. Okhtilev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.V.</given-names>
            <surname>Sokolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.M.</given-names>
            <surname>Yusupov</surname>
          </string-name>
          .
          <article-title>Intellektual'nye tekhnologii monitoringa i upravleniya strukturnoy dinamikoy slozhnykh tekhnicheskikh ob"ektov (Intellectual Technologies of Monitoring and Management of Structural Dynamics of Complex Technical objects</article-title>
          ) (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <article-title>Laboratory of Information Technologies in System Analysis and Modeling</article-title>
          , http://www.litsam.ru,
          <source>last accessed</source>
          <year>2021</year>
          /06/06.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>