Abstract
We investigate a tactical level production planning problem in process industries under costly sequence dependent family setups, which drives the need for manufacturing of product families in campaigns. The motivation of our work is float glass manufacturing, which has some unique properties such as co-production and uninterruptible production. To solve the problem, we develop a branch-and-price algorithm based on a novel formulation of the problem. Our algorithm is capable of providing consistent performance in different problem sizes. We compare our proposed algorithm with previous work on the same problem by running computational experiments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
