We consider a dynamic sharing out of the risk throughout the entire scheduling horizon. We propose a deterministic equivalent of the problem and solve linear approximations of the program to provide upper and lower bounds of the optimal solution. We applied our approach on a real-life instance and give numerical results.