|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
Quantity-based buffer-constrained two machine flowshop problem: active and passive prefetch models for multimedia applications,статья
Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 8 октября 2025 г.
- Авторы: Kononov A., Hong J-S, Kononova P., Lin F-C
- Журнал: Journal of Scheduling
- Том: 15
- Год издания: 2012
- Издательство: Springer Nature
- Местоположение издательства: Switzerland
- Первая страница: 487
- Последняя страница: 497
- DOI: 10.1007/s10951-011-0235-z
- Аннотация: Conventional studies on buffer-constrained flow-shop scheduling problems have considered applications with a limitation on the number of jobs that are allowed in the intermediate storage buffer before flowing to the nextmachine. The study in Lin et al. (Comput. Oper. Res. 36(4):1158–1175, 2008a) considered a two-machine flow-shop problem with “processing time-dependent” buffer constraints for multimedia applications. A “passive” prefetch model (the PP-problem), in which the download process is suspended unless the buffer is sufficient for keeping anincoming media object, was applied in Lin et al. (Comput. Oper. Res. 36(4):1158–1175, 2008a). This study further considers an “active” prefetch model (the AP-problem)that exploits the unoccupied buffer space by advancing the download of the incoming object by a computed maximal duration that possibly does not cause a buffer overflow. We obtain new complexity results for both problems.
- Добавил в систему: Кононов Александр Вениаминович