|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
Algorithms for Flow Shop with Job–Dependent Buffer Requirementsтезисы доклада
- Авторы: Kononov A., Memar J., Zinder Y.
- Сборник: Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2021
- Серия: Lecture Notes in Networks and Systems
- Том: 363
- Тезисы
- Год издания: 2022
- Место издания: Springer, Cham Cham
- Первая страница: 63
- Последняя страница: 74
- DOI: 10.1007/978-3-030-92666-3_6
- Аннотация: The paper is concerned with algorithms for the two-machine flow shop, where each job needs storage space (a buffer) during the entire time of its processing. The buffer requirement is determined by the duration of job’s first operation. The goal is to minimise the time needed for the completion of all jobs. This scheduling problem is NP-hard in the strong sense. Recently, the polynomial-time algorithms were developed for particular cases of this problem. In this paper, we discuss two heuristics based on these polynomial-time algorithms and compare them with other efficient heuristics.
- Добавил в систему: Кононов Александр Вениаминович