A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes

DOI10.1007/978-3-030-49988-4_21zbMath1460.90084arXiv2004.03942OpenAlexW3038070887MaRDI QIDQ2663742

Ilya Chernykh, Alexander V. Kononov, Sergey Sevast'janov

Publication date: 19 April 2021

Full work available at URL: https://arxiv.org/abs/2004.03942

zbMATH Keywords

schedulingdynamic programmingflow shoppolynomially-solvable caserouting flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

This page was built for publication: A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes