Application of genetic algorithms to assembly sequence planning with limited resources

Heuristic procedures based on priority rules are quite frequently used to solve the multiple resource-constrained project-scheduling problem (RCPSP), i.e. task programming with limited resources. The rules are based on the problem knowledge. Different local search procedures have been proposed in order to look for acceptable solutions in scheduling problems. In this work, local search procedures, that define the solution neighborhood based on greedy heuristics, are proposed to assign assembly operations to a fixed number of robots in a manufacturing cell. A genetic algorithm is used to generate the solution.