A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes

A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes Full article

Journal

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

Output data

Year: 2020, Pages: 301-312 Pages count : 12 DOI: 10.1007/978-3-030-49988-4_21

Tags

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

Authors

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

Affiliations

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

DB	Citing
Scopus	1
OpenAlex	1