The Tortoise and the Hare: An Unexpected Scheduling Race Between MILP and CP Solvers

This story was originally published on HackerNoon at: https://hackernoon.com/the-tortoise-and-the-hare-an-unexpected-scheduling-race-between-milp-and-cp-solvers.
This paper compares MILP and CP solvers on a new FJS scheduling problem, showing CP is faster and "warm starts" are vital for large instances.
Check more stories related to programming at: https://hackernoon.com/c/programming. You can also check exclusive content about #constraint-programming, #flexible-job-shop-scheduling, #operations-research, #milp-vs-cp, #optimization-solvers, #warm-start, #computational-optimization, #benchmark-testing, and more.

This story was written by: @instancing. Learn more about this writer by checking @instancing's about page, and for more stories, please visit hackernoon.com.

This paper compares MILP and CP solvers on a new FJS scheduling problem, showing CP is faster and "warm starts" are vital for large instances.