Abstract
Flexible flow shop scheduling (FFSS) is an NP-hard combinatorial optimization problem. Solving this problem using mathematical modeling approaches is very difficult. Mega-heuristic algorithms, such as the genetic algorithm (GA) and tabu search (TS), are powerful tools for finding near-optimal solutions to problems of this type. This paper develops a GATS model by combining GA and TS for solving FFSS problems. In the model, GA is used as the platform for global search, and TS is used to support GA in local search. This paper also uses the design of experiments (DOE) to optimize the parameters of the GATS model. The performance of the models, GATS and GATS with DOE, is compared with traditional heuristics being used. The result indicates that the models are good approaches for FFSS problems.
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: BOHR International Journal of Operations Management Research and Practices
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.
