<?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="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">inform</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1816-0301</issn><issn pub-type="epub">2617-6963</issn><publisher><publisher-name>UIIP NASB</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">inform-179</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="ru"><subject>МАТЕМАТИЧЕСКОЕ МОДЕЛИРОВАНИЕ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MATHEMATICAL MODELING</subject></subj-group></article-categories><title-group><article-title>ПЛАНИРОВАНИЕ ПРОЦЕССА ИЗГОТОВЛЕНИЯ СЕКЦИИ КОРПУСА СУДНА</article-title><trans-title-group xml:lang="en"><trans-title>PLANNING VESSEL BODY SECTION PRODUCTION</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>Grivachevsky</surname><given-names>A. G.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Минск, Сурганова, 6 </p></bio><email xlink:type="simple">griva@newman.bas-net.by</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>Grivachevsky</surname><given-names>V. D.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Владивосток, ул. Суханова, 8 </p></bio><xref ref-type="aff" rid="aff-2"/></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>Kovalyov</surname><given-names>M. Y.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Минск, Сурганова, 6 </p></bio><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>Suhomlinov</surname><given-names>A. I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Владивосток, ул. Суханова, 8 </p></bio><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Объединенный институт проблем информатики НАН Беларуси</institution><country>Belarus</country></aff><aff xml:lang="ru" id="aff-2"><institution>Дальневосточный федеральный университет</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2015</year></pub-date><pub-date pub-type="epub"><day>12</day><month>11</month><year>2016</year></pub-date><volume>0</volume><issue>4</issue><fpage>49</fpage><lpage>56</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Гривачевский А.Г., Гривачевский В.Д., Ковалев М.Я., Сухомлинов А.И., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">Гривачевский А.Г., Гривачевский В.Д., Ковалев М.Я., Сухомлинов А.И.</copyright-holder><copyright-holder xml:lang="en">Grivachevsky A.G., Grivachevsky V.D., Kovalyov M.Y., Suhomlinov A.I.</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://inf.grid.by/jour/article/view/179">https://inf.grid.by/jour/article/view/179</self-uri><abstract><p>Рассматривается задача планирования процесса изготовления секции корпуса судна, которая сводится к классической в теории расписаний трехстадийной задаче Джонсона. Описывается генетический алгоритм решения и компьютерный эксперимент для сравнения эффективности этого алгоритма и алгоритма полного перебора.</p></abstract><trans-abstract xml:lang="en"><p>A problem of planning production of a vessel body section is considered. The problem is reduced to the classic Johnson’s tree-machine flow-shop scheduling problem. A genetic algorithm and computer experiment to compare efficiency of this algorithm and the algorithm of full enumeration are described.</p></trans-abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Johnson, S.M. Optimal two- and three-stage production schedules with set-up time included / S.M. Johnson // Naval Research Logistics Quarterly. – 1954. – Vol. 1. – P. 61–68.</mixed-citation><mixed-citation xml:lang="en">Johnson, S.M. Optimal two- and three-stage production schedules with set-up time included / S.M. Johnson // Naval Research Logistics Quarterly. – 1954. – Vol. 1. – P. 61–68.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Гэри, М. Вычислительные машины и труднорешаемые задачи / М. Гэри, Д. Джонсон. – М. : Наука, 1979.</mixed-citation><mixed-citation xml:lang="en">Гэри, М. Вычислительные машины и труднорешаемые задачи / М. Гэри, Д. Джонсон. – М. : Наука, 1979.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Holland, J. Adaptation in natural and artificial systems / J. Holland. – Cambridge : MIT Press, 1992.</mixed-citation><mixed-citation xml:lang="en">Holland, J. Adaptation in natural and artificial systems / J. Holland. – Cambridge : MIT Press, 1992.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Xu, X. Computer-aided process planning – A critical review of recent developments and future trends / X. Xu, L. Wang, S.T. Newman // International Journal of Computer Integrated Manufacturing. – 2011. – Vol. 24, № 1. – P. 1–31.</mixed-citation><mixed-citation xml:lang="en">Xu, X. Computer-aided process planning – A critical review of recent developments and future trends / X. Xu, L. Wang, S.T. Newman // International Journal of Computer Integrated Manufacturing. – 2011. – Vol. 24, № 1. – P. 1–31.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Qassim, R.Y. Integrated process planning and scheduling and multimode resource constrained project scheduling: ship block assembly application / R.Y. Qassim // Manufacturing System. – 2012. – P. 307–314.</mixed-citation><mixed-citation xml:lang="en">Qassim, R.Y. Integrated process planning and scheduling and multimode resource constrained project scheduling: ship block assembly application / R.Y. Qassim // Manufacturing System. – 2012. – P. 307–314.</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>
