Abstract
In recent decades, genetic algorithms (GAs) have often been applied as heuristic techniques at various settings entailing production scheduling. However, early convergence is one of the problems associated with this approach. This study develops an efficient local search rule for the target-oriented rule in traditional GAs. It also addresses the problem of two-stage multiprocessor flowshop scheduling (FSP) by viewing the due window and sequence-dependent setup times as constraints faced by common flowshops with multiprocessor scheduling suites in the actual production scenario. Using the simulated data, this study verifies the effectiveness and robustness of the proposed algorithm. The results of data testing demonstrate that the proposed method may outperform other algorithms, including a significant hybrid algorithm, in addressing the problems considered.
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 callMore From: International Journal of Mathematics in Operational Research
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.
