Support for `objective_lb_search` in interleaved search

**What language and solver does this apply to?**
CP-SAT

**Describe the problem you are trying to solve.**

I work on scheduling problems embedded within compilers. Because this is a compiler application, determinism is a hard requirement, which requires me to use interleaved search when I enable multiple workers.

I have found that `objective_lb_search` is highly effective at proving lower bounds for my makespan minimization problems.

**Describe the solution you'd like**

Can you please expose `objective_lb_search` as a supported subsolver within interleaved search?

**Describe alternatives you've considered**

I have experimented with various supported solvers within interleaved search, including adding various subsolvers I configure on my own. While CP-SAT often finds the optimal solution, it frequently struggles to prove optimality within a reasonable (deterministic) time without `objective_lb_search`, which is critical for our compilation times.

**Additional context**

If it's possible at all, I would also appreciate support for remaining solvers as well, though at this point they are not as critical as `objective_lb_search` for me at this point:
- lb_tree_search
- probing_search
- objective_shaving_search