Abstract
This article studies a no-wait two-stage flexible flow shop scheduling problem with setup times aiming to minimize the total completion time. The problem is solved using an adaptive imperialist competitive algorithm (AICA) and genetic algorithm (GA). To test the performance of the proposed AICA and GA, the algorithms are compared with ant colony optimisation, known as an effective algorithm in the literature. The performance of the algorithms are evaluated by solving both small and large-scale problems. Their performance is evaluated in terms of relative percentage deviation. Finally the results of the study are discussed and conclusions and potential areas for further study are highlighted.
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: Journal of Experimental & Theoretical Artificial Intelligence
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.
