The manufacturing cell formation represents one of the important stages of the construction of cellular manufacturing systems. It focuses on grouping machines, parts and workers and assigning them to the corresponding cells. This assignment is guided by multiple objectives, and is subject to many constraints. In this paper, the focus is made on a variant of the cell formation problem, which is the Generalized Cubic Cell Formation Problem (GCCFP). In this study, a mathematical model is developed for this variant of the problem. Besides the multiple objectives considered in most research works, the quality index of the produced parts is also considered in this study. To solve the problem, a Discrete Flower Pollination Algorithm (DFPA) is developed. To validate the model and the DFPA, a set of randomly generated instances were solved using B&B under LINGO software, DFPA and Simulated Annealing (SA) algorithm. The performance of DFPA, from the standpoint of the considered objectives and the time of calculation, has been tested. The experiment results show the efficiency of the developed method.

制造单元的形成代表了蜂窝制造系统构建的重要阶段之一。它着重于对机器，零件和工人进行分组，并将它们分配给相应的单元。此分配受多个目标指导，并受到许多约束。在本文中，重点是细胞形成问题的变体，即广义立方细胞形成问题（GCCFP）。在这项研究中，针对该问题的变体开发了数学模型。除了大多数研究工作中考虑的多个目标外，本研究还考虑了所生产零件的质量指标。为了解决该问题，开发了一种离散花授粉算法（DFPA）。为了验证模型和DFPA，使用B＆求解了一组随机生成的实例 B在LINGO软件，DFPA和模拟退火（SA）算法下获得。从考虑的目标和计算时间的角度，DFPA的性能已经过测试。实验结果表明了该方法的有效性。