<?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-632</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>MODIFIED ROMANOVSKY ALGORITHM FOR QUICK FINDING OF APPROXIMATE SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEM</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>Neydorf</surname><given-names>Rudolf A.</given-names></name></name-alternatives><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>Zhikulin</surname><given-names>Artem A.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Донской государственный технический университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Don State Technical University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2012</year></pub-date><pub-date pub-type="epub"><day>30</day><month>12</month><year>2012</year></pub-date><volume>12</volume><issue>6</issue><fpage>87</fpage><lpage>92</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Neydorf R.A., Zhikulin A.A., 2012</copyright-statement><copyright-year>2012</copyright-year><copyright-holder xml:lang="ru">Нейдорф Р.А., Жикулин А.А.</copyright-holder><copyright-holder xml:lang="en">Neydorf R.A., Zhikulin A.A.</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/632">https://www.vestnik-donstu.ru/jour/article/view/632</self-uri><abstract><p>The modification of Romanovsky algorithm for the approximate solution to the homogeneous allocation problem is developed. The modification involves lower resource requirements as against the original algorithm. The changes in the original algorithm which permit to provide a more effective procedure of loading executors with tasks are described. The computational experiments are resulted.</p></abstract><trans-abstract xml:lang="ru"/><kwd-group xml:lang="ru"><kwd>теория расписаний</kwd><kwd>однородная задача</kwd><kwd>минимаксный критерий</kwd><kwd>метод ветвей и границ</kwd><kwd>дерево вариантов.</kwd></kwd-group><kwd-group xml:lang="en"><kwd>scheduling theory</kwd><kwd>homogeneous problem</kwd><kwd>minimax criterion</kwd><kwd>branch-and-bound method</kwd><kwd>search tree.</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">Коффман, Э. Г. Теория расписания и вычислительные машины / Э. Г. Коффман. — Москва: Наука, 1984. — 334 с.</mixed-citation><mixed-citation xml:lang="en">Koffman, E`. G. Teoriya raspisaniya i vy`chislitel`ny`e mashiny` / E`. G. Koffman. — Moskva: Nauka, 1984. — 334 s. — In Russian.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Конвей, Р. В. Теория расписаний / Р. В. Конвей, В. Л. Максвелл, Л. В. Миллер. — Москва: Наука, 1975. — 360 с.</mixed-citation><mixed-citation xml:lang="en">Konvej, R. V. Teoriya raspisanij / R. V. Konvej, V. L. Maksvell, L. V. Miller. — Moskva: Nauka, 1975. — 360 s. — In Russian.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Нейдорф, Р. А. Методологические проблемы теории расписаний / Р. А. Нейдорф, В. Г. Кобак // Системный анализ, управление и обработка информации: 1-й межвуз. сб. науч. ст. / ДГТУ; ТТИ ЮФУ. — Ростов-на-Дону, 2007. — С. 101—108.</mixed-citation><mixed-citation xml:lang="en">Nejdorf, R. A. Metodologicheskie problemy` teorii raspisanij / R. A. Nejdorf, V. G. Kobak // Sistemny`j analiz, upravlenie i obrabotka informacii: 1-j mezhvuz. sb. nauch. st. / DGTU; TTI YuFU. — Rostov-na-Donu, 2007. — S. 101—108. — In Russian.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Романовский, И. В. Алгоритмы решения экстремальных задач / И. В. Романовский. — Москва: Наука, 1977. — 352 с.</mixed-citation><mixed-citation xml:lang="en">Romanovskij, I. V. Algoritmy` resheniya e`kstremal`ny`x zadach / I. V. Romanovskij. — Moskva: Nauka, 1977. — 352 s. — In Russian.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Будиловский, Д. М. Оптимизация решения задач теории расписаний на основе эволюционно-генетической модели распределения заданий: дисс. ... канд. техн. наук. — Ростов-на-Дону, 2007. — 212 с.</mixed-citation><mixed-citation xml:lang="en">Budilovskij, D. M. Optimizaciya resheniya zadach teorii raspisanij na osnove e`volyucionno-geneticheskoj modeli raspredeleniya zadanij: diss. ... kand. texn. nauk. — Rostov-na-Donu, 2007. — 212 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>
