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...

Full description

Bibliographic Details
Main Authors:	Vladimir M. Kotov, Natallia S. Bogdanova
Format:	Article
Language:	Belarusian
Published:	Belarusian State University 2019-11-01
Series:	Журнал Белорусского государственного университета: Математика, информатика
Subjects:	bunch technique semionline partition scheduling worst case performance
Online Access:	https://journals.bsu.by/index.php/mathematics/article/view/1048

id	doaj-aedf6d6f03454bb4832fcc5d5440ffcd
record_format	Article
spelling	doaj-aedf6d6f03454bb4832fcc5d5440ffcd2020-11-25T03:25:28ZbelBelarusian State University Журнал Белорусского государственного университета: Математика, информатика 2520-65082617-39562019-11-01313413810.33581/2520-6508-2019-3-134-1381048Bunch technique for semionline with two groups of itemsVladimir M. Kotov0Natallia S. Bogdanova1https://orcid.org/0000-0003-3641-8663Belarusian State University, 4 Niezaliežnasci Avenue, Minsk 220030, Belarus Sukhoi State Technical University of Gomel, 48 Kastryčnika Avenue, Gomel 246746, Belarus 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.https://journals.bsu.by/index.php/mathematics/article/view/1048bunch techniquesemionlinepartitionschedulingworst case performance
collection	DOAJ
language	Belarusian
format	Article
sources	DOAJ
author	Vladimir M. Kotov Natallia S. Bogdanova
spellingShingle	Vladimir M. Kotov Natallia S. Bogdanova Bunch technique for semionline with two groups of items Журнал Белорусского государственного университета: Математика, информатика bunch technique semionline partition scheduling worst case performance
author_facet	Vladimir M. Kotov Natallia S. Bogdanova
author_sort	Vladimir M. Kotov
title	Bunch technique for semionline with two groups of items
title_short	Bunch technique for semionline with two groups of items
title_full	Bunch technique for semionline with two groups of items
title_fullStr	Bunch technique for semionline with two groups of items
title_full_unstemmed	Bunch technique for semionline with two groups of items
title_sort	bunch technique for semionline with two groups of items
publisher	Belarusian State University
series	Журнал Белорусского государственного университета: Математика, информатика
issn	2520-6508 2617-3956
publishDate	2019-11-01
description	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.
topic	bunch technique semionline partition scheduling worst case performance
url	https://journals.bsu.by/index.php/mathematics/article/view/1048
work_keys_str_mv	AT vladimirmkotov bunchtechniqueforsemionlinewithtwogroupsofitems AT natalliasbogdanova bunchtechniqueforsemionlinewithtwogroupsofitems
_version_	1724596890780041216

Bunch technique for semionline with two groups of items

Similar Items