Библиографическая ссылка:
Лазарев А.А., Лемтюжникова Д.В., Правдивец Н.А., Вернер Ф.. Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems / Communications in Computer and Information Science (Advances in Optimization and Applications). Cham, Switzerland: Springer Nature, 2020. С. 211-223.