Abstract
This paper proposes an efficient decision support tool for the optimal production scheduling of a variety of paper grades in a paper machine. The tool is based on a continuous-time scheduling model and generalized disjunctive programming. As the full-space scheduling model corresponds to a large-scale mixed integer linear programming model, we apply data analytics techniques to reduce the size of the decision space, which has a profound impact on the computational efficiency of the model and enables us to support the solution of large-scale problems. The data-driven model is based on an automated method of identifying the forbidden and recommended paper grade sequences, as well as the changeover durations between two paper grades. The results from a real industrial case study show that the data-driven model leads to good results in terms of both solution quality and CPU time in comparison to the full-space model.
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.
