Skip navigation
Please use this identifier to cite or link to this item: https://libeldoc.bsuir.by/handle/123456789/10391
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEgorova, N. G.-
dc.contributor.authorSotskov, Y. N.-
dc.date.accessioned2016-11-28T11:44:07Z-
dc.date.accessioned2017-07-27T12:26:49Z-
dc.date.available2016-11-28T11:44:07Z-
dc.date.available2017-07-27T12:26:49Z-
dc.date.issued2014-
dc.identifier.citationEgorova, N. G. Stability polyhedra of optimal permutation of jobs servicing / N. G. Egorova, Y. N. Sotskov // Automation and Remote Control. – 2014. – Vol. 75, № 7. – P. 1267–1282.ru_RU
dc.identifier.urihttps://libeldoc.bsuir.by/handle/123456789/10391-
dc.description.abstractConsideration was given to minimization of the sum of weighted instants of completing servicing of n customers by a single server, provided that the duration of jobs servicing may assume any real value from a given numerical interval. An algorithm of complexity O(n) was developed to construct a polyhedron (parallelepiped) of the optimality of permutation of servicing of n jobs that is contained in the domain of stability of the same permutation and comprises the polyhedron of its stability.ru_RU
dc.language.isoenru_RU
dc.publisherMAIK Naukaru_RU
dc.subjectпубликации ученыхru_RU
dc.subjectодностадийное обслуживания требованийru_RU
dc.subjectнеопределенность длительностей обслуживания требованийru_RU
dc.subjectмногогранник оптимальностиru_RU
dc.subjectмногогранник устойчивостиru_RU
dc.subjectsingle-machine schedulingru_RU
dc.subjectuncertain processing timesru_RU
dc.subjectstability boxru_RU
dc.subjectoptimality boxru_RU
dc.titleStability polyhedra of optimal permutation of jobs servicingru_RU
dc.typeArticleru_RU
Appears in Collections:Публикации в зарубежных изданиях

Files in This Item:
File Description SizeFormat 
051007.docx17.99 kBMicrosoft Word XMLView/Open
Show simple item record Google Scholar

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.