{"title":"束技术半在线与两组项目","authors":"V. Kotov, Natallia S. Bogdanova","doi":"10.33581/2520-6508-2019-3-134-138","DOIUrl":null,"url":null,"abstract":"Bunch 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 se cond 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.","PeriodicalId":36323,"journal":{"name":"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bunch technique for semionline with two groups of items\",\"authors\":\"V. Kotov, Natallia S. Bogdanova\",\"doi\":\"10.33581/2520-6508-2019-3-134-138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Bunch 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 se cond 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.\",\"PeriodicalId\":36323,\"journal\":{\"name\":\"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33581/2520-6508-2019-3-134-138\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33581/2520-6508-2019-3-134-138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
Bunch technique for semionline with two groups of items
Bunch 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 se cond 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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
