Discrepancy search for solving flexible scheduling problems

In this paper, we propose specific adaptations of the Climbing Depth-bounded Discrepancy Search (CDDS) method. We introduce the principles of CDDS and some adaptation for the problems under study. We then present CDDS performance through different well-known benchmarks.