For open source optimization solvers, the cutting plane algorithm is not effective in solving the scheduling problem of single machine

Question

The corresponding example in MIPLIB is neos-3046615-murg which is labeled as simple.

cplex、gurobi can get a better lower bound fast.

Is there an opportunity to improve the open source solver?

Relevant papers, recommendations or codes would be appreciated!