We present some results attained witht wovariants of Bounded Dynamic Programming algorithm o solve the Fm 9 block 9 C max problem using as an experimental data the well-known Taillar dinstances.Wehave improved the bes tknown solutions for 17 of Taillard’s instances ,including the 10 instances from set 12.