%0 Journal Article
%A Yu. V. Kovalenko
%T On complexity of optimal recombination for flowshop scheduling problems
%J Diskretnyj analiz i issledovanie operacij
%D 2016
%P 41-62
%V 23
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2016_23_2_a2/
%G ru
%F DA_2016_23_2_a2