A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job | Sciact - Система учета научной деятельности ИМ СО РАН

Журнал

Journal of Scheduling
ISSN: 1094-6136

Вых. Данные

Год: 2015, Том: 19, Номер: 1, Страницы: 61-72 Страниц : 12 DOI: 10.1007/s10951-015-0454-9

Ключевые слова

Mixed-shop scheduling; Polynomial-time algorithms; Preemption

Авторы

Dugarzhapov Aldar ^2,3 , Kononov Alexander ^1,2

Организации

1	Sobolev Institute of Mathematics, Novosibirsk, Russia
2	Novosibirsk State University, Novosibirsk, Russia
3	École Polytechnique, Palaiseau, France

Dugarzhapov A. , Kononov A.
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
Journal of Scheduling. 2015. V.19. N1. P.61-72. DOI: 10.1007/s10951-015-0454-9 WOS Scopus OpenAlex

Опубликована online:

28 сент. 2015 г.