But it is not difficult to find the best sequence. Indeed, given a job sequence a tardiness value T is found as shown before, and conversely, given a target tardiness value T, we may consider the sequence given by the increasing values T divided by the weight for each article. The idea is to iterate between the two computations. What we get is something which is polynomial and practically fast.