<?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">vestifm</journal-id><journal-title-group><journal-title xml:lang="ru">Известия Национальной академии наук Беларуси. Серия физико-математических наук</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-2430</issn><issn pub-type="epub">2524-2415</issn><publisher><publisher-name>The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">vestifm-164</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>INFORMATICS</subject></subj-group></article-categories><title-group><article-title>МНОГОГРАННИК ОПТИМАЛЬНОСТИ РАСПИСАНИЯ, МИНИМИЗИРУЮЩЕГО СУММУ ВЗВЕШЕННЫХ МОМЕНТОВ ЗАВЕРШЕНИЯ ОБСЛУЖИВАНИЯ ТРЕБОВАНИЙ</article-title><trans-title-group xml:lang="en"><trans-title>OPTIMALITY BOX OF THE SCHEDULE MINIMIZING THE SUM OF THE WEIGHTED COMPLETION TIMES OF THE JOB</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>Sotskov</surname><given-names>Yu. N.</given-names></name></name-alternatives><email xlink:type="simple">sotskov@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>Egorova</surname><given-names>N. G.</given-names></name></name-alternatives><email xlink:type="simple">egorovanatalja@bk.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>Werner</surname><given-names>F.</given-names></name></name-alternatives><email xlink:type="simple">frank.werner@mathematik.uni-magdeburg.de</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Объединенный институт проблем информатики Национальной академии наук Беларуси, Минск</institution></aff><aff xml:lang="en"><institution>United Institute of Informatics Problems of the National Academy of Sciences of Belarus, Minsk</institution></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Университет им. Отто фон Герике, Магдебург</institution></aff><aff xml:lang="en"><institution>Otto-von-Guericke-University, Magdeburg</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2015</year></pub-date><pub-date pub-type="epub"><day>20</day><month>05</month><year>2016</year></pub-date><volume>0</volume><issue>4</issue><fpage>103</fpage><lpage>111</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">Sotskov Y.N., Egorova N.G., Werner F.</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://vestifm.belnauka.by/jour/article/view/164">https://vestifm.belnauka.by/jour/article/view/164</self-uri><abstract><p>В качестве меры устойчивости оптимальной перестановки π обслуживания в одностадийной обслуживающей системе множества требований к изменениям длительностей обслуживания требований предлагается использовать размерность и относительный объем многогранника оптимальности перестановки π. Для случайно сгенерированных задач проведено экспериментальное сравнение размерностей и относительных объемов многогранников оптимальности расписаний обслуживания требований и относительных погрешностей целевых функций с оптимальными значениями целевых функций, вычисленными для фактических длительностей обслуживания требований. </p></abstract><trans-abstract xml:lang="en"><p>It is proposed to use an optimality box of the job permutation π as a measure of the stability of an optimal permutation π for processing a set of jobs in the single-stage processing system respecting to variations of the processing times of the jobs. For randomly generated problems, experimental comparison is made of the relative dimensions and the volumes of the optimality box for permutation and relative errors of the objective function with the optimal value of the objective function calculated for the actual processing jobs. </p></trans-abstract><kwd-group xml:lang="ru"><kwd>планирование</kwd><kwd>одностадийное обслуживание требований</kwd><kwd>взвешенные моменты завершения обслуживания требований</kwd><kwd>устойчивость</kwd><kwd>неопределенность</kwd><kwd>интервальные длительности обслуживания требований</kwd></kwd-group><kwd-group xml:lang="en"><kwd>scheduling</kwd><kwd>single machine problems</kwd><kwd>total weighted completion times</kwd><kwd>stability</kwd><kwd>uncertainty</kwd><kwd>interval processing times</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">Optimization and approximation in deterministic sequencing and scheduling: a survey / R. L. Graham [et al.] // Ann. Discrete Math. – 1976. – Vol. 5. – P. 287–326.</mixed-citation><mixed-citation xml:lang="en">Optimization and approximation in deterministic sequencing and scheduling: a survey / R. L. Graham [et al.] // Ann. Discrete Math. – 1976. – Vol. 5. – P. 287–326.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Smith, W. E. Various optimizers for single-stage production / W. E. Smith // Naval Research Logistics Quarterly. – 1956. – Vol. 3, N 1. – Р. 59–66.</mixed-citation><mixed-citation xml:lang="en">Smith, W. E. Various optimizers for single-stage production / W. E. Smith // Naval Research Logistics Quarterly. – 1956. – Vol. 3, N 1. – Р. 59–66.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Scheduling under uncertainty: theory and algorithms / Yu. N. Sotskov [et al.]. – Minsk: Belorus. nauka, 2010.</mixed-citation><mixed-citation xml:lang="en">Scheduling under uncertainty: theory and algorithms / Yu. N. Sotskov [et al.]. – Minsk: Belorus. nauka, 2010.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Sotskov, Yu. N. Minimizing total weighted flow time of a set of jobs with interval processing times / Yu. N. Sotskov, N. G. Egorova, T.-C. Lai // Mathematical and Computer Modelling. – 2009. – Vol. 50, N 3/4. – P. 556–573.</mixed-citation><mixed-citation xml:lang="en">Sotskov, Yu. N. Minimizing total weighted flow time of a set of jobs with interval processing times / Yu. N. Sotskov, N. G. Egorova, T.-C. Lai // Mathematical and Computer Modelling. – 2009. – Vol. 50, N 3/4. – P. 556–573.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Сотсков, Ю. Н. Многогранники устойчивости оптимальной перестановки обслуживания требований / Ю. Н. Сотсков, Н. Г. Егорова // Автоматика и телемеханика. – 2014. – № 7. – С. 136–154.</mixed-citation><mixed-citation xml:lang="en">Сотсков, Ю. Н. Многогранники устойчивости оптимальной перестановки обслуживания требований / Ю. Н. Сотсков, Н. Г. Егорова // Автоматика и телемеханика. – 2014. – № 7. – С. 136–154.</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>
