Flexible Manufacturing Systems (FMS) are advanced production environments integrating automated machine tools and material handling devices such as mobile robots with the aim to form a high efficiency, flexibility and adaptability production system. In FMS, material handling system is crucial to ensure the production flow to be in high efficiency. The problem of achieving efficient scheduling in FMS is considered a challenging combinatorial optimization problem which mainly caused by asymmetric travel times, machine and mobile robot constraints and precedence constraints. This paper investigates the metaheuristic approaches consist of Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) to solve the scheduling problem of dual mobile robot system in a Job-Shop FMS environment. The scheduling algorithms are formulated with the objective to achieve a minimal completion time (or makespan) while maintaining the order of task execution and transportation task by mobile robots. Multiple layouts were applied to both algorithms for evaluation and analysis purposes. The results have indicated that GA delivered a better performance in terms of providing a solution with lover makespan whereas PSO demonstrated faster convergence with minimized computational times.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Comparative Analysis of Dual-Mobile Robot Scheduling in Job-Shop Flexible Manufacturing System

  • Ho San Chew,
  • Mohd Saiful Azimi Mahmud,
  • Nurulaqilla Khamis,
  • Norhaliza Abdul Wahab,
  • Muhamad Fadli Ghani,
  • Erlianasha Samsuria

摘要

Flexible Manufacturing Systems (FMS) are advanced production environments integrating automated machine tools and material handling devices such as mobile robots with the aim to form a high efficiency, flexibility and adaptability production system. In FMS, material handling system is crucial to ensure the production flow to be in high efficiency. The problem of achieving efficient scheduling in FMS is considered a challenging combinatorial optimization problem which mainly caused by asymmetric travel times, machine and mobile robot constraints and precedence constraints. This paper investigates the metaheuristic approaches consist of Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) to solve the scheduling problem of dual mobile robot system in a Job-Shop FMS environment. The scheduling algorithms are formulated with the objective to achieve a minimal completion time (or makespan) while maintaining the order of task execution and transportation task by mobile robots. Multiple layouts were applied to both algorithms for evaluation and analysis purposes. The results have indicated that GA delivered a better performance in terms of providing a solution with lover makespan whereas PSO demonstrated faster convergence with minimized computational times.