Abstract
Fruit Fly algorithm (FFO) is a recently reported metaheuristics originally designed for function optimization problems. This paper proposes an effective FFO to solve the hybrid flowshop scheduling (HFS) problem with the aim of makespan optimization (minimization). In presented FFO, we utilize the permutation-based representation and operators. The presented FFO can directly explore the discrete solution space of the HFS problem. Extensive comparisons are carried out with well-known meta-heuristics. The results show that the developed FFO is very effective for the considered HFS problem.
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.
