Abstract
Identical parallel robot scheduling problem for minimizing mean tardiness with precedence constraints is a very important scheduling problem. But, the solution of this problem becomes much difficult when there are a number of robots, jobs and precedence constraints. Genetic algorithm is an efficient tool in the solution of combinatorial optimization problems, as it is well known. In this study, a genetic algorithm is used to schedule jobs that have precedence constraints minimizing the mean tardiness on identical parallel robots. The solutions of problems, which have been taken in different scales, have been done using simulated annealing and genetic algorithm. In particular, genetic algorithm is found noteworthy successful in large-scale problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.