A limited discrepancy search method for solving disjunctive scheduling problems with resource flexibility

In this paper we are concerned with shop scheduling problems with resource flexibility. We propose to solve both problems, scheduling and allocation, in an integrated approach based on an adaptation of Limited Discrepancy Search (LDS) (Harvey and Ginsberg (1995)) to prune dramatically the search tree while ensuring good performances.