<?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">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2015-3-356-371</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-256</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>Articles</subject></subj-group></article-categories><title-group><article-title>ПОСТРОЕНИЕ РАСПИСАНИЙ ОБСЛУЖИВАНИЯ СТАЦИОНАРНЫХ ОБЪЕКТОВ ПЕРЕМЕЩАЮЩИМСЯ В ОДНОМЕРНОЙ ЗОНЕ ПРОЦЕССОРОМ</article-title><trans-title-group xml:lang="en"><trans-title>SCHEDULING PROBLEMS OF STATIONARY OBJECTS WITH THE PROCESSOR IN ONE-DIMENSIONAL ZONE</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>Dunichkina</surname><given-names>N. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Дуничкина Надежда Александровна, Волжский государственный университет водного транспорта, кандидат физико-математических наук, старший научный сотрудник, ORCID 0000-0002-4347-5116 </p></bio><email xlink:type="simple">nadezhda.dunichkina@gmail.com</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>Kogan</surname><given-names>D. I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Коган Дмитрий Израилевич, Московский государственный университет приборостроения и информатики, доктор технических наук, профессор, ORCID 0000-0002-1203-1539 </p></bio><email xlink:type="simple">kdi_41@mail.ru</email><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>Fedosenko</surname><given-names>Yu. S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Федосенко Юрий Семенович, Волжский государственный университет водного транспорта, доктор технических наук, профессор, ORCID 0000-0001-5582-2325</p></bio><email xlink:type="simple">fds@vgavt-nn.ru</email><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>Volga State University of Water Transport, Nizhny Novgorod</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Московский государственный университет приборостроения и информатики</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Moscow State University of Instrument Engineering and Informatics</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2015</year></pub-date><pub-date pub-type="epub"><day>20</day><month>06</month><year>2015</year></pub-date><volume>22</volume><issue>3</issue><fpage>356</fpage><lpage>371</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Дуничкина Н.А., Коган Д.И., Федосенко Ю.С., 2015</copyright-statement><copyright-year>2015</copyright-year><copyright-holder xml:lang="ru">Дуничкина Н.А., Коган Д.И., Федосенко Ю.С.</copyright-holder><copyright-holder xml:lang="en">Dunichkina N.A., Kogan D.I., Fedosenko Y.S.</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.mais-journal.ru/jour/article/view/256">https://www.mais-journal.ru/jour/article/view/256</self-uri><abstract><p> Рассматривается математическая модель, в которой мобильный процессор, перемещаясь в пределах одномерной рабочей зоны, реализует однофазное однократное обслуживание рассредоточенной в пределах этой зоны совокупности стационарных объектов. В процессе перемещений в рабочей зоне процессор совершает два рейса – прямой и обратный. При этом часть объектов обслуживается в прямом рейсе, остальные объекты – в обратном рейсе. Обслуживание любого объекта нельзя начать ранее предписанного ему срока. С каждым объектом ассоциирован индивидуальный штраф, являющийся монотонно возрастающей функцией от момента завершения его обслуживания. В качестве минимизируемых критериев оценки качества расписаний обслуживания выступают момент завершения работ по всей совокупности объектов и величина суммарного штрафа по ним. Ставятся и исследуются оптимизационные задачи с одним и двумя критериями оценки, конструируемые решающие алгоритмы основаны на принципе динамического программирования и концепции Парето; последовательная их реализация продемонстрирована на численных примерах. Показано, что алгоритм решения задачи на оптимальное быстродействие является полиномиальным, а задача построения расписания обслуживания, обеспечивающего минимизацию величины суммарного штрафа по всем объектам, является NP–трудной. Соответственно бикритериальная задача с указанными критериями оценки относится к числу труднорешаемых, вычислительная сложность алгоритма построения расписания обслуживания является экспоненциальной. Модель описывает процессы снабжения топливом плавучих дизель-электрических комплексов, осуществляющих русловую добычу инертных строительных материалов в крупномасштабных районах речных путей. Модели и оптимизационные задачи, подобные рассматриваемым, представляют интерес для таких приложений, как управление дозаправкой топливом орбитальной группировки спутников и магистральных гражданских самолетов.</p><p>Статья публикуется в авторской редакции.</p></abstract><trans-abstract xml:lang="en"><p>We consider the mathematical model in which an operating processor serves the set of the stationary objects positioned in a one-dimensional working zone. The processor performs two voyages between the uttermost points of the zone: the forward or direct one, where certain objects are served, and the return one, where remaining objects are served. Servicing of the object cannot start earlier than its ready date. The individual penalty function is assigned to every object, the function depending on the servicing completion time. Minimized criteria of schedule quality are assumed to be total service duration and total penalty. We formulate and study optimization problems with one and two criteria. Proposed algorithms are based on dynamic programming and Pareto principle, the implementations of these algorithms are demonstrated on numerical examples. We show that the algorithm for the problem of processing time minimization is polynomial, and that the problem of total penalty minimization is NP-hard. Correspondingly, the bicriteria problem with the mentioned evaluation criteria is fundamentally intractable, computational complexity of the schedule structure algorithm is exponential. The model describes the fuel supply processes to the diesel-electrical dredgers which extract non-metallic building materials (sand, gravel) in large-scale areas of inland waterways. Similar models and optimization problems are important, for example, in applications like the control of satellite group refueling and regular civil aircraft refueling.</p><p>The article is published in the author’s wording.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>теория расписаний</kwd><kwd>динамическое программирование</kwd><kwd>принцип Парето</kwd><kwd>NP-трудность</kwd><kwd>многокритериальная оптимизация</kwd></kwd-group><kwd-group xml:lang="en"><kwd>scheduling</kwd><kwd>dynamic programming</kwd><kwd>Pareto concept</kwd><kwd>NP-complexity</kwd><kwd>multicriteria optimization</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">РФФИ</funding-statement><funding-statement xml:lang="en">Russian Fund of Fundamental Research</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Kogan D. I., Fedosenko Yu. S., “Zadacha dispetcherizatsii: analiz vychislitel’noy slozhnosti i polinomial’no razreshimye podklassy”, Diskretnaya matematika RAN, 8:3 (1996), 135– 147, [in Russian].</mixed-citation><mixed-citation xml:lang="en">Kogan D. I., Fedosenko Yu. S., “Zadacha dispetcherizatsii: analiz vychislitel’noy slozhnosti i polinomial’no razreshimye podklassy”, Diskretnaya matematika RAN, 8:3 (1996), 135– 147, [in Russian].</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Tanaev V. S., Gordon V. S., Shafransky Y. N., Scheduling Theory, Single-Stage Systems, Springer Science+Business Media, 1994.</mixed-citation><mixed-citation xml:lang="en">Tanaev V. S., Gordon V. S., Shafransky Y. N., Scheduling Theory, Single-Stage Systems, Springer Science+Business Media, 1994.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">T’kindt V., Billaut J., Multicriteria scheduling: models and algorithms, Springer, 2006.</mixed-citation><mixed-citation xml:lang="en">T’kindt V., Billaut J., Multicriteria scheduling: models and algorithms, Springer, 2006.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Brucker P., Knust S., Complex scheduling, Springer, 2006.</mixed-citation><mixed-citation xml:lang="en">Brucker P., Knust S., Complex scheduling, Springer, 2006.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Brucker P., Scheduling Algorithms, Springer, 2007.</mixed-citation><mixed-citation xml:lang="en">Brucker P., Scheduling Algorithms, Springer, 2007.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Pinedo M., Scheduling: Theory, Algorithms, and Systems, Springer, 2008.</mixed-citation><mixed-citation xml:lang="en">Pinedo M., Scheduling: Theory, Algorithms, and Systems, Springer, 2008.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Shen H., Optimal Scheduling for Satellite Refueling in Circular Orbits, PhD thesis, School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, Georgia, 2003.</mixed-citation><mixed-citation xml:lang="en">Shen H., Optimal Scheduling for Satellite Refueling in Circular Orbits, PhD thesis, School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, Georgia, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Klimin A. V., Poedinok V. M., “Dozapravka v polete grazhdanskikh samoletov: perspektivy i problemy”, TsAGI, http://www.tsagi.ru/cgibin/jet/viewnews.cgi?id=20101230080777618957, [in Russian].</mixed-citation><mixed-citation xml:lang="en">Klimin A. V., Poedinok V. M., “Dozapravka v polete grazhdanskikh samoletov: perspektivy i problemy”, TsAGI, http://www.tsagi.ru/cgibin/jet/viewnews.cgi?id=20101230080777618957, [in Russian].</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Yu P., Multiple Criteria Decision Making: Concepts, Techniques and Extensions, Plenum Press, NY, 1985.</mixed-citation><mixed-citation xml:lang="en">Yu P., Multiple Criteria Decision Making: Concepts, Techniques and Extensions, Plenum Press, NY, 1985.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Steuer R. E., Multiple Criteria Optimization: Theory, Computation and Application, J.Wiley&amp;Sons Inc., NY-Chichester-Brisbane-Toronto-Singapore, 1986.</mixed-citation><mixed-citation xml:lang="en">Steuer R. E., Multiple Criteria Optimization: Theory, Computation and Application, J.Wiley&amp;Sons Inc., NY-Chichester-Brisbane-Toronto-Singapore, 1986.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Ehrgott M., Multicriteria Optimization, second ed., Springer, 2005.</mixed-citation><mixed-citation xml:lang="en">Ehrgott M., Multicriteria Optimization, second ed., Springer, 2005.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Podinovskiy V. V., Nogin V. D., Pareto-optimal’nye resheniya mnogokriterial’nykh zadach, Fizmatlit, 2007, [in Russian].</mixed-citation><mixed-citation xml:lang="en">Podinovskiy V. V., Nogin V. D., Pareto-optimal’nye resheniya mnogokriterial’nykh zadach, Fizmatlit, 2007, [in Russian].</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Bellman R., Dreyfus S. E., Applied dynamic programming, Princeton, 1962.</mixed-citation><mixed-citation xml:lang="en">Bellman R., Dreyfus S. E., Applied dynamic programming, Princeton, 1962.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Sigal I. X., Ivanova A. P., Vvedenie v prikladnoe diskretnoe programmirovanie: modeli i vychislitel’nye algoritmy, Fizmatlit, 2007, [in Russian].</mixed-citation><mixed-citation xml:lang="en">Sigal I. X., Ivanova A. P., Vvedenie v prikladnoe diskretnoe programmirovanie: modeli i vychislitel’nye algoritmy, Fizmatlit, 2007, [in Russian].</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Garey M. R., Johnson D. S., Computers and intractability: A guide to the theory of NPcompleteness, W.H. Freeman &amp; Co., 1979.</mixed-citation><mixed-citation xml:lang="en">Garey M. R., Johnson D. S., Computers and intractability: A guide to the theory of NPcompleteness, W.H. Freeman &amp; Co., 1979.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Arora S., Barak B., Computational Complexity: A Modern Approach, Princeton, 2009.</mixed-citation><mixed-citation xml:lang="en">Arora S., Barak B., Computational Complexity: A Modern Approach, Princeton, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Lipton R. J., The P=NP Question and G¨odel’s Lost Letter, Springer Science+Business Media, 2010.</mixed-citation><mixed-citation xml:lang="en">Lipton R. J., The P=NP Question and G¨odel’s Lost Letter, Springer Science+Business Media, 2010.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Villareal B., Karwan M., “Multicriteria Dynamic Programming with an Application to the Integer Case”, Journal of optimization theory and applications, 38:1 (1982), 43–69.</mixed-citation><mixed-citation xml:lang="en">Villareal B., Karwan M., “Multicriteria Dynamic Programming with an Application to the Integer Case”, Journal of optimization theory and applications, 38:1 (1982), 43–69.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Kogan D. I., Dinamicheskoe programmirovanie i diskretnaya mnogokriterial’naya optimizatsiya, Izd-vo NNGU, N. Novgorod, 2004, [in Russian].</mixed-citation><mixed-citation xml:lang="en">Kogan D. I., Dinamicheskoe programmirovanie i diskretnaya mnogokriterial’naya optimizatsiya, Izd-vo NNGU, N. Novgorod, 2004, [in Russian].</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Dunichkina N. A., Kogan D. I., Pushkin A. M., Fedosenko Yu. S., “Ob odnoy modeli obsluzhivaniya statsionarnykh ob”ektov peremeshchayushchimsya v odnomernoy rabochey zone protsessorom”, Trudy, XII vserossiyskoe soveshchanie po problemam upravleniya VSPU-2014 (Moskva, 16-19 iyunya 2014g.), Institut Problem Upravleniya im. V.A.Trapeznikova RAN, 2014, 5044–5052, [in Russian].</mixed-citation><mixed-citation xml:lang="en">Dunichkina N. A., Kogan D. I., Pushkin A. M., Fedosenko Yu. S., “Ob odnoy modeli obsluzhivaniya statsionarnykh ob”ektov peremeshchayushchimsya v odnomernoy rabochey zone protsessorom”, Trudy, XII vserossiyskoe soveshchanie po problemam upravleniya VSPU-2014 (Moskva, 16-19 iyunya 2014g.), Institut Problem Upravleniya im. V.A.Trapeznikova RAN, 2014, 5044–5052, [in Russian].</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Kogan D. I., Fedosenko Yu. S., “Optimal servicing strategy design problems for stationary objects in a one-dimensional working zone of a processor”, Automation and remote control, 71:10 (2010), 2058–2069.</mixed-citation><mixed-citation xml:lang="en">Kogan D. I., Fedosenko Yu. S., “Optimal servicing strategy design problems for stationary objects in a one-dimensional working zone of a processor”, Automation and remote control, 71:10 (2010), 2058–2069.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Dorigo M., Optimization, Learning and Natural Algorithms, PhD thesis, Dipartamento di Elettronica, Politecnico di Milano, 1992.</mixed-citation><mixed-citation xml:lang="en">Dorigo M., Optimization, Learning and Natural Algorithms, PhD thesis, Dipartamento di Elettronica, Politecnico di Milano, 1992.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Blum C., Roli A., “Metaheuristics in combinatorial optimization: Overview and conceptual comparison”, ACM Computing Surveys, 35(3) (2003), 268–308.</mixed-citation><mixed-citation xml:lang="en">Blum C., Roli A., “Metaheuristics in combinatorial optimization: Overview and conceptual comparison”, ACM Computing Surveys, 35(3) (2003), 268–308.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Jones M. T., Al Application Programming, Charles river media, Inc., Hingham, Massachusetts, 2003.</mixed-citation><mixed-citation xml:lang="en">Jones M. T., Al Application Programming, Charles river media, Inc., Hingham, Massachusetts, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Dunichkina N., “Algorithms for bi-criteria single-machine scheduling problem of servicing a spaced group of objects”, Proceedings of the 3th International IT Conference “Information Technology in modern life”, in: Abstracts of presentations, Bonn-Rhein-Sieg University of Applied Sciences, 2008, 4.</mixed-citation><mixed-citation xml:lang="en">Dunichkina N., “Algorithms for bi-criteria single-machine scheduling problem of servicing a spaced group of objects”, Proceedings of the 3th International IT Conference “Information Technology in modern life”, in: Abstracts of presentations, Bonn-Rhein-Sieg University of Applied Sciences, 2008, 4.</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>
