Optimizing Robot Movements in Flexible Job Shop Environment by Metaheuristics Based on Clustered Holonic Multiagent Model

In systems based robotic cells, the control of some elements such as transport robot has some difficulties when planning operations dynamically. The Flexible Job Shop scheduling Problem with Transportation times and Many Robots (FJSPT-MR) is a generalization of the classical Job Shop scheduling Problem (JSP) where a set of jobs have to be transported between them by several transport robots. This paper proposes hybrid metaheuristics based on clustered holonic multiagent model for the FJSPT-MR. Computational results are presented using a set of literature benchmark instances. New upper bounds are found, showing the effectiveness of the presented approach.