A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes | Sciact - Система учета научной деятельности ИМ СО РАН

A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes Научная публикация

Журнал

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Вых. Данные

Год: 2020, Страницы: 301-312 Страниц : 12 DOI: 10.1007/978-3-030-49988-4_21

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

Dynamic programming; Flow shop; Polynomially-solvable case; Routing flow shop; Scheduling

Авторы

Chernykh Ilya ^1,2 , Kononov Alexander ¹ , Sevastyanov Sergey ¹

Организации

1	Sobolev Institute of Mathematics, Koptyug ave. 4, Novosibirsk, 630090, Russia
2	Novosibirsk State University, Pirogov str. 2, Novosibirsk, 630090, Russia

Chernykh I. , Kononov A. , Sevastyanov S.
A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes
Lecture Notes in Computer Science. 2020. P.301-312. DOI: 10.1007/978-3-030-49988-4_21 Scopus OpenAlex

Scopus:	2-s2.0-85087787371
OpenAlex:	W3038070887

БД	Цитирований
Scopus	1
OpenAlex	1