Abstract
The Cuckoo Search (CS) is heuristic search algorithm which inspired from cuckoo bird behavior. In this paper, we proposed two improvements for the cuckoo search algorithm of solving Flexible Job-Shop Scheduling problem (FJSP); the first one depends on Best Neighbors Generation (CS-BNG) and the second one based on Iterative Levy Flight (CS-ILF). Some adaptation for the key points of CS algorithm has been done to enhance searching in the discrete state space. The proposed algorithms have increased solutions quality and convergence rate. The improved algorithms have been tested on some FJSP benchmark instances for performance examination. The experimental results demonstrate the effectiveness of the improved algorithms in comparison to the basic cuckoo search algorithm.
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 on Perceptive and Cognitive Computing
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.
