{"type":"rich","version":"1.0","provider_name":"Transistor","provider_url":"https://transistor.fm","author_name":"Programming Tech Brief By HackerNoon","title":"The Tortoise and the Hare: An Unexpected Scheduling Race Between MILP and CP Solvers","html":"<iframe width=\"100%\" height=\"180\" frameborder=\"no\" scrolling=\"no\" seamless src=\"https://share.transistor.fm/e/2e53080d\"></iframe>","width":"100%","height":180,"duration":1092,"description":"\n        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.\nThis paper compares MILP and CP solvers on a new FJS scheduling problem, showing CP is faster and \"warm starts\" are vital for large instances.\nCheck more stories related to programming at: https://hackernoon.com/c/programming.\n            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.\nThis story was written by: @instancing. Learn more about this writer by checking @instancing's about page,\n            and for more stories, please visit hackernoon.com.\nThis paper compares MILP and CP solvers on a new FJS scheduling problem, showing CP is faster and \"warm starts\" are vital for large instances.","thumbnail_url":"https://img.transistorcdn.com/KhCapPSRkLGL2Xw8888yuChkNRWthaKapLYTvNdu4W4/rs:fill:0:0:1/w:400/h:400/q:60/mb:500000/aHR0cHM6Ly9pbWct/dXBsb2FkLXByb2R1/Y3Rpb24udHJhbnNp/c3Rvci5mbS9zaG93/LzQxMTY2LzE2ODM1/ODIzMzAtYXJ0d29y/ay5qcGc.webp","thumbnail_width":300,"thumbnail_height":300}