Abstract
Flow-shop scheduling problems are classic examples of multi-resource and multi-operation optimization problems. This paper demonstrates our model and simulation for solving Flow-shop scheduling optimization problems with resource availability constraints to minimize makespan. Working hours, transfer times and setup times are taken into account. Working hours could be interpreted in two ways. In the first option, operations must fit into a single available time slot. In the second option, the simulation could cut operations across multiple time slots. We propose a simulation algorithm that accounts for both scenarios and could be used with any permutation-based exact, heuristic, or search algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.