مشخصات پژوهش

عنوان	Solving a Cyclic Multiple-Part Type Robotic Cell Scheduling Problem by Genetic Algorithm
نوع پژوهش	مقاله ارائه شده کنفرانسی
کلیدواژه‌ها	Cyclic blocking flow-shop, genetic algorithm, robotic cell, scheduling
چکیده	In this paper, we develop a new mathematical model for a cyclic multiple-part type three-machine robotic cell problem with assumption of robot movement policy that minimizes the cycle time. The developed model is based on Petri nets and provides a new method to calculate cycle times by considering waiting times. It was proved that calculating cycle time under policy is unary NP-complete. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. In this paper we implement the genetic algorithm (GA) to solve the problem. To validate the developed model and solution algorithm, various test problems are examined.
پژوهشگران	علی حسین میرزایی (نفر سوم)، سعیده غلامی (نفر دوم)، عیسی نخعی کمال آبادی (نفر اول)