|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
On Complexity and Exact Solution of Production Groups Formation Problem// OPTIMA-2018 Communications in Computer and Information Science, Vol 974. p. 111-122. DOI: 10.1007/978-3-030-10934-9_8тезисы доклада
- Авторы: Eremeev A., Kononov A., Ziegler I.
- Сборник: Optimization and Applications. OPTIMA 2018
- Серия: Communications in Computer and Information Science
- Том: 974
- Тезисы
- Год издания: 2019
- Место издания: Springer, Cham Cham
- Первая страница: 111
- Последняя страница: 122
- DOI: 10.1007/978-3-030-10934-9_8
- Аннотация: The success of a modern enterprize is substantially determined by the effectiveness of staff selection and formation of various kinds of functional groups. Creation of such groups requires consideration of different factors depending on the activity of the groups. The problem of production groups formation, considered in this paper, asks for an assignment of workers to jobs taking into account the implicational constraints. The first result of the paper states the NP-hardness of the problem under consideration. The second result is a branch and bound method, which uses supplementary assignment problems for computing bounds. A software implementation of the algorithm is made, and a computational experiment is carried out, comparing the proposed algorithm with the CPLEX solver on randomly generated input data.
- Добавил в систему: Кононов Александр Вениаминович