We consider the one machine scheduling problem with identical release dates, sequence dependent set-up times and weighted sum of performance as performance measure. We propose new genetic operators called "data oriented" that use not only the permutation contained in the chromosome but also an analysis of the corresponding solution. The experimental results show that data oriented operators are globally better than calssical ones.