Our approach of PFSP includes risk of machine failures due to lack of breaks.
We model the problem as a non-smooth optimization problem.
We propose the use of a biased-randomized algorithm to solve it.
We combine Iterated Local Search with biased randomization of classical heuristics.
05">Our approach outperforms other approaches just based on the makespan.