I am new to the fields of operations research. I have a Binary IP model for solving a scheduling problem and I am seeking to find information whether I can somehow transform it to a problem that can be solved using local search techniques. Is it possible? If yes, can you point me to some further materials on the topic?
I am aware the branch and bound technique builds a graph for the solution space. However, solving the problem does not scale particularly well due to the symmetry in scheduling problems and I wanted to explore an alternative technique such as local search. I am also happy to hear alternative suggestions.