<?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-1405</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>INFORMATION TECHNOLOGY, COMPUTER SCIENCE AND MANAGEMENT</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ИНФОРМАТИКА, ВЫЧИСЛИТЕЛЬНАЯ ТЕХНИКА И УПРАВЛЕНИЕ</subject></subj-group></article-categories><title-group><article-title>THE COMPARATIVE ANALYSIS  OF THE APPROACHED ALGORITHMS OF THE DECISION  OF THE MINIMAX PROBLEM FOR HOMOGENEOUS DEVICES</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>KOBAK</surname><given-names>V.G.</given-names></name></name-alternatives></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>BUDILOVSKIY</surname><given-names>D.M.</given-names></name></name-alternatives></contrib></contrib-group><pub-date pub-type="collection"><year>2006</year></pub-date><pub-date pub-type="epub"><day>16</day><month>10</month><year>2018</year></pub-date><volume>6</volume><issue>4</issue><fpage>327</fpage><lpage>333</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; KOBAK V., BUDILOVSKIY D., 2006</copyright-statement><copyright-year>2006</copyright-year><copyright-holder xml:lang="ru">КОБАК В., БУДИЛОВСКИЙ Д.</copyright-holder><copyright-holder xml:lang="en">KOBAK V., BUDILOVSKIY D.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" 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/1405">https://www.vestnik-donstu.ru/jour/article/view/1405</self-uri><abstract><p>In given work is given benchmark analysis drawn near algorithm of the decision for popular problem of the theories of the timetables at condition of homogeneity instrument information handling.</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>вычислительный эксперимент</kwd><kwd>вектор загрузки.</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">Головкин Б.А. Расчет характеристик и планирование параллельных вычислительных процессов. – М.: Радио и Связь, 1983. – 272 с.</mixed-citation><mixed-citation xml:lang="en">Головкин Б.А. Расчет характеристик и планирование параллельных вычислительных процессов. – М.: Радио и Связь, 1983. – 272 с.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Коффман Э.Г. Теория расписания и вычислительные машины. – М.: Наука,1987. – 335 с.</mixed-citation><mixed-citation xml:lang="en">Коффман Э.Г. Теория расписания и вычислительные машины. – М.: Наука,1987. – 335 с.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Пашкеев С.Д, Минязов Р.И., Могилевский В.Д. Машинные методы оптимизации в технике связи. – М.: Связь, 1976. – 272 с.</mixed-citation><mixed-citation xml:lang="en">Пашкеев С.Д, Минязов Р.И., Могилевский В.Д. Машинные методы оптимизации в технике связи. – М.: Связь, 1976. – 272 с.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Ларионов А.М.,Майоров С.А.,Новиков Г.И. Вычислительные комплексы, системы и сети. –Л.: Энергоатомиздат, 1987. – 287 с.</mixed-citation><mixed-citation xml:lang="en">Ларионов А.М.,Майоров С.А.,Новиков Г.И. Вычислительные комплексы, системы и сети. –Л.: Энергоатомиздат, 1987. – 287 с.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Holland J. H. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor. – Michigan, 1975. – 183 p.</mixed-citation><mixed-citation xml:lang="en">Holland J. H. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor. – Michigan, 1975. – 183 p.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Goldberg D. E. Genetic Algorithms in Search, Optimization and Machine Learning. – Addison-Wesley, 1989. – 432 p.</mixed-citation><mixed-citation xml:lang="en">Goldberg D. E. Genetic Algorithms in Search, Optimization and Machine Learning. – Addison-Wesley, 1989. – 432 p.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Mitchell M. An introduction to Genetic Algorithm. MIT Press, 1996. – 224 р.</mixed-citation><mixed-citation xml:lang="en">Mitchell M. An introduction to Genetic Algorithm. MIT Press, 1996. – 224 р.</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>
