Hello, 

I have a scheduling & allocation algorithm that is working well, with customed search_phases.

On one specific use case, depending on the random seed value, I have a solution within 1 sec, or no solution in 5 min. It is a bit disturbing, I would like to know if there is a way to let the solver test different seed very quickly, and focus on a specific seed once a solution is found.

Jean-Christophe

------------------------------
Jean-Christophe GUILLERMIN
------------------------------

Hi,

1) What about setting a time limit 10s and then if after 10 s no solution then try another random seed else go on with the solve ?

2) Do you have a way to make the problem harder with more constraints but with less flexibility to get a first feasible solution and then warmstart into the first problem ?

The first way is much simpler and much better if you get no solution after 10 s for not that many ransom seeds

Best regards

------------------------------
[Alex] [Fleischer]
[Data and AI Technical Sales]
[IBM]
------------------------------