Kirik E.E.,1 Klimenko V.M.,2 Ostapenko V.V.3
1Educational-Scientific Complex “Institute for Applied Systems Analysis” of NTUU “KPI,” National Academy of
Sciences of Ukraine and Ministry of Education and Science, Youth and Sports of Ukraine, Kyiv, Ukraine, e-mail: kirik@mmsa.ntu-kpi.kiev.ua
2Educational-Scientific Complex “Institute for Applied Systems Analysis” of NTUU “KPI,” National Academy of
Sciences of Ukraine and Ministry of Education and Science, Youth and Sports of Ukraine, Kyiv, Ukraine, e-mail: vitalij_klimenko@yahoo.com.
3Educational-Scientific Complex “Institute for Applied Systems Analysis” of NTUU “KPI,” National Academy of
Sciences of Ukraine and Ministry of Education and Science, Youth and Sports of Ukraine, Kyiv, Ukraine.
Abstract. Generalized Kirchhoff’s law for flows in networks is modeled by a system of linear inequalities that has the structure of the respective graph. In the case where the graph has more than one cycle, solving the system of inequalities involves certain difficulties. The paper proposes a method of replacing a cycle in the graph with a star. Figs: 2. Refs: 8 titles.
Keywords: optimal schedule, job sequencing, makespan constraints, sequential optimization algorithms.