Abstract
In this work, the operational production scheduling problem of a manufacturer in the automotive sector, producing injection molded parts, is presented. In order to meet all requirements, including alternative resources, release dates, due dates and sequence dependent setup times, a schedule classification and a related integer programming formulation for this flexible job-shop scheduling real-world problem is presented. Since the combinatorial complexity of the problem does not allow an efficient optimization for the company partner, a constraint programming approach is proposed, solving the real-world case to optimality within a few seconds of runtime.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have