A Complete 4-parametric complexity classification of short shop scheduling problems | Sciact - Система учета научной деятельности ИМ СО РАН

A Complete 4-parametric complexity classification of short shop scheduling problems Научная публикация

Журнал

Journal of Scheduling
ISSN: 1094-6136

Вых. Данные

Год: 2012, Том: 15, Номер: 4, Страницы: 427-446 Страниц : 20 DOI: 10.1007/s10951-011-0243-z

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

Complexity classification; Makespan minimization; Shop scheduling

Авторы

Kononov Alexander ¹ , Sevastyanov Sergey ^1,2 , Sviridenko Maxim ³

Организации

1	Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
2	Novosibirsk State University of Economics and Management
3	IBM T.J. Watson Research Center, Yorktown Heights, USA

Kononov A. , Sevastyanov S. , Sviridenko M.
A Complete 4-parametric complexity classification of short shop scheduling problems
Journal of Scheduling. 2012. V.15. N4. P.427-446. DOI: 10.1007/s10951-011-0243-z WOS Scopus OpenAlex

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

22 июл. 2011 г.

Web of science:	WOS:000304706100004
Scopus:	2-s2.0-84865608416
OpenAlex:	W1987322775

БД	Цитирований
Scopus	10
OpenAlex	9
Web of science	9