Abstract
The Job-Shop scheduling problem by the minimum makespan is researched and its mathematical model with multi-restricted condition is established. In order to improve the ant colony algorithm deficiency of poor convergence and easy to fall in local optima, a genetic ant colony algorithm with master-slave structure is designed. In this algorithm, ant colony algorithm is regarded as master algorithm, and genetic algorithm as slave algorithm. Finally, computational tests based on the well known benchmark suites in the literature are conducted, and the computational results show that the presented algorithm is effective in finding optimal and near-optimal solutions.
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.
