束技术半在线与两组项目

Q4 Mathematics
V. Kotov, Natallia S. Bogdanova
{"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}
引用次数: 0

摘要

提出了具有两组项的半在线问题的束技术。解决这一问题的算法是先从第一组进行分组分配,然后用ls -算法从第二组进行分组分配。为了证明算法的估计,我们引入了不同类型的束来分布第一组中的所有项目,使得只得到输入的一种类型的束。在第二阶段,我们使用最坏情况下性能最多为17/9的LS。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.50
自引率
0.00%
发文量
21
审稿时长
16 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信