%0 Journal Article
%A A. V. Eremeev
%A Yu. V. Kovalenko
%T On complexity of optimal recombination for one scheduling problem with setup times
%J Diskretnyj analiz i issledovanie operacij
%D 2012
%P 13-26
%V 19
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2012_19_3_a1/
%G ru
%F DA_2012_19_3_a1