It is known that exact mathematical strategies such MILP are not efficient for large instances of the flexible job shop problem.
It is common to see in the literature MILP formulations for the FJS problem. I read that it is interesting to use the MILP model for experiments involving non-exact methods as metaheuristics (GA, FA, TS, etc) since it provides lower and upper bounds.
我还读到，当找到可行的解决方案比最优解决方案更重要时，应该选择CP。这是真实的说法吗？
mathematical-optimization linear-programming constraint-programming mixed-integer-programming