Logo BSU

Please use this identifier to cite or link to this item: https://elib.bsu.by/handle/123456789/260891
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKotov, V.M.-
dc.contributor.authorBogdanova, N.S.-
dc.date.accessioned2021-06-07T07:45:59Z-
dc.date.available2021-06-07T07:45:59Z-
dc.date.issued2019-
dc.identifier.citationZ Beloruss Gos Univ , Mat Inform 2019;2019(3):134-138.ru
dc.identifier.urihttps://elib.bsu.by/handle/123456789/260891-
dc.description.abstractBunch technique for semionline with two groups of items is proposed in this paper. Algorithm to solve this problem is to distribute items from the first group bunch approach and after that apply LS-algorithm to assign items from the second group. In order to prove the estimation of our algorithm is introduced different types of bunches to distribute all items from the first group such a way that only one of the entered types of bunches are obtained. During the second stage we use LS with worst case performance is at most 17 . 9.ru
dc.language.isoruru
dc.publisherThe Belarusian State Universityru
dc.subjectЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математикаru
dc.subjectЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Кибернетикаru
dc.titleBunch technique for semionline with two groups of itemsru
dc.typearticleru
dc.rights.licenseCC BY 4.0ru
dc.identifier.DOI10.33581/2520-6508-2019-3-134-138-
dc.identifier.scopus85091922293-
Appears in Collections:Статьи факультета прикладной математики и информатики

Files in This Item:
File Description SizeFormat 
1048-Текст статьи-8816-1-10-20191221.pdf450,75 kBAdobe PDFView/Open
Show simple item record Google Scholar



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