<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">donstu</journal-id><journal-title-group><journal-title xml:lang="en">Advanced Engineering Research (Rostov-on-Don)</journal-title><trans-title-group xml:lang="ru"><trans-title>Advanced Engineering Research (Rostov-on-Don)</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">2687-1653</issn><publisher><publisher-name>Don State Technical University</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">donstu-783</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>TECHNICAL SCIENCES</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ТЕХНИЧЕСКИЕ НАУКИ</subject></subj-group></article-categories><title-group><article-title>GENETIC ALGORITHMS OF WORK DISTRIBUTION</article-title><trans-title-group xml:lang="ru"><trans-title>Генетические алгоритмы распределения работ</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Айдинян</surname><given-names>Андрей Размикович</given-names></name><name name-style="western" xml:lang="en"><surname>Aidinyan</surname><given-names>Andrey R.</given-names></name></name-alternatives><email xlink:type="simple">andstyle@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Цветкова</surname><given-names>Ольга Леонидовна</given-names></name><name name-style="western" xml:lang="en"><surname>Tsvetkova</surname><given-names>Olga L.</given-names></name></name-alternatives><email xlink:type="simple">olga_cvetkova@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Донской государственный технический университет<country>Россия</country></aff><aff xml:lang="en">Don State Technical University<country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2011</year></pub-date><pub-date pub-type="epub"><day>30</day><month>12</month><year>2011</year></pub-date><volume>11</volume><issue>5</issue><fpage>723</fpage><lpage>729</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Aidinyan A.R., Tsvetkova O.L., 2011</copyright-statement><copyright-year>2011</copyright-year><copyright-holder xml:lang="ru">Айдинян А.Р., Цветкова О.Л.</copyright-holder><copyright-holder xml:lang="en">Aidinyan A.R., Tsvetkova O.L.</copyright-holder><license license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.vestnik-donstu.ru/jour/article/view/783">https://www.vestnik-donstu.ru/jour/article/view/783</self-uri><abstract><p>The tasks of heterogeneous work distribution among heterogeneous executors taking into account operation and switching process costs are investigated. Genetic algorithms of work distribution that can be used for solving various practical tasks both in the automated processes and in social systems are offered.</p></abstract><trans-abstract xml:lang="ru"><p>Исследованы задачи распределения неоднородных работ между неоднородными исполнителями с учетом затрат на выполнение работ и переключение между ними. Предложены генетические алгоритмы распределения работ, которые могут использоваться при решении различных практических задач как в автоматизированных процессах, так и в социальных системах.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>генетические алгоритмы</kwd><kwd>распределение работ</kwd><kwd>неоднородные работы</kwd><kwd>неоднородные исполнители.</kwd></kwd-group><kwd-group xml:lang="en"><kwd>genetic algorithms</kwd><kwd>work distribution</kwd><kwd>heterogeneous work</kwd><kwd>heterogeneous executors.</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Емельянов В.В. Теория и практика эволюционного моделирования / В.В. Емельянов, В.В. Курейчик, В.М. Курейчик. – М.: Физматлит, 2003. – 432 с.</mixed-citation><mixed-citation xml:lang="en">Emel`yanov V.V. Teoriya i praktika e`volyucionnogo modelirovaniya / V.V. Emel`yanov, V.V. Kurejchik, V.M. Kurejchik. – M.: Fizmatlit, 2003. – 432 s. – In Russian.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Реклейтис Г. Оптимизация в технике (в 2 кн.) / Г. Реклейтис, А. Рейвиндран, К. Рэкс-дел. – М.: Мир, 1988. – 348 с.</mixed-citation><mixed-citation xml:lang="en">Reklejtis G. Optimizaciya v texnike (v 2 kn.) / G. Reklejtis, A. Rejvindran, K. Re`ksdel. – M.: Mir, 1988. – 348 s. – In Russian.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Рутковская Д. Нейронные сети, генетические алгоритмы и нечеткие системы / Д. Рутковская, М. Пилинский, Л. Рутковский. – М.: Горячая линия – Телеком, 2006. – 452 с.</mixed-citation><mixed-citation xml:lang="en">Rutkovskaya D. Nejronny`e seti, geneticheskie algoritmy` i nechyotkie sistemy` / D. Rutkovskaya, M. Pilinskij, L. Rutkovskij. – M.: Goryachaya liniya – Telekom, 2006. – 452 s. – In Russian.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
