|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirementsстатья
Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 8 октября 2025 г.
- Авторы: Zinder Y., Kononov A., Fung J.
- Журнал: Journal of Combinatorial Optimization
- Том: 42
- Год издания: 2021
- Издательство: Springer Nature
- Местоположение издательства: Switzerland
- Первая страница: 276
- Последняя страница: 309
- DOI: 10.1007/s10878-021-00706-4
- Аннотация: The paper is concerned with the two-machine scheduling problem where each job isto be processed on the first-stage machine and after that on the second-stage machine.In order to be processed, each job requires storage space that it seizes at the start of its processing on the first-stage machine and releases only at the completion of processingon the second-stage machine. The storage space is limited and its consumption variesfrom job to job. The goal is to minimise the time needed for the completion of alljobs. All instances of the considered scheduling problem are classified by means offive parameters. This leads to the sixty four families of instances. For each family, thepaper establishes its computational complexity and, in the case of polynomial-timesolvability, presents a polynomial-time algorithm, constructing an optimal schedule.
- Добавил в систему: Кононов Александр Вениаминович