Abstract
In this paper we consider a multi-machine scheduling problem with setup times, which is determined in the literature as the flexible job shop problem. It belongs to the strongly NPcomplete complexity class.We propose an algorithm based on the tabu search method. The new elimination criteria were used in the construction process of blocks of the critical path
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.
