|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
Two-machine flow shop with dynamic storage spaceстатья
Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 8 октября 2025 г.
- Авторы: Berlińska J., Kononov A., Zinder Y.
- Журнал: Optimization Letters
- Том: 15
- Номер: 7
- Год издания: 2021
- Издательство: Springer Verlag
- Местоположение издательства: Germany
- Первая страница: 2433
- Последняя страница: 2454
- DOI: 10.1007/s11590-020-01645-5
- Аннотация: The publications on two-machine flow shop scheduling problems with job dependentstorage requirements, where a job seizes a portion of the storage space for the entireduration of its processing, were motivated by various applications ranging from supplychains of mineral resources to multimedia systems. In contrast to the previous publications that assumed that the availability of the storage space remains unchanged, this paper is concerned with a more general case when the availability is a function of time. It strengthens the previously published result concerning the existence of an optimal permutation schedule, shows that the variable storage space availability leads to the NP-hardness in the strong sense even for unit processing times, and presents a polynomial-time approximation scheme together with several heuristic algorithms. The heuristics are evaluated by means of computational experiments.
- Добавил в систему: Кононов Александр Вениаминович