Abstract

In this work we propose several reformulations of a general discrete-time mixed-integer formulation for production scheduling problems. Each reformulation involves the addition of new integer variables that we refer to as record keeping variables. Computational results show that the required CPU time is greatly reduced when record keeping variables are present in the optimization model. Additionally, we assess which of the individual aspects of traditional branch-and-bound solution procedures benefit from the inclusion of record keeping variables.

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 call

Disclaimer: 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.