Abstract
Abstract We propose four different discrete-time, mixed-integer programming (MIP) models for production scheduling problems in multistage facilities. Specifically, we discuss two models based on network representations and develop two models inspired by the Resource-Constrained Project Scheduling Problem. Furthermore, we propose different solution methods: tightening constraints, a reformulation, and priority-based branching. Through a comprehensive computational study, we show that up to four orders of magnitude improvements in computational time can be achieved compared to existing approaches.
Sign-in/Register to access full text options 
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.
