Abstract
Multiprocessor Scheduling is a problem of discrete optimization. The strong optimization capacity of Ant Colony Algorithm (ACA) on solving the discrete optimization suggests the feasibility to solve the multiprocessor scheduling problem using the ACA algorithm. Contrary to the shortcomings of traditional ant colony algorithm, this is easy to fall into the local convergence, In order to improve the calculation accuracy. combined of multiprocessor scheduling problem, propose a more efficient ant colony optimization algorithm and present a new state transition rule, at the same time use dynamically update the strategy of ant pheromones and the optimal parameter selection. it can find a better scheduling strategy in a short time, and it has excellent global optimization properties, The simulation results show that the credibility and the validity of the improved ant colony optimization algorithm for multiprocessor scheduling 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.
