# Designing of Machine Backups in Reconfigurable Manufacturing Systems
## 3 Results  
Due to the large scale of the overall solution, this article will be based on the study results of the designing of manufacturing lines using the principle of reconfigurability [20]. Therefore, only the results for the described module will be given. To concretize the proposed solution, it can be stated that ten products with the designation K1-K10, were defined for the calculation. The size of the manufacturing system with the number of machines \(ZQ=50\) was also defined. Specific types of operations have been defined for the products \(matrix\)\((NAME_{kn})\) for their processing, together with their operating \((t_{ij})\), the number of pieces to be produced \((n_{kn})\), as well as the manufacturing time defined by the customer \((Cr_{t_{kn}})\). The specific operations that the given system device can perform have also been defined \((matrix\)\(ZA=\left({{{q_{ij}}}}\right)_{m}^{n-1})\), and thus specific devices are reserved for specific operations (S1-S50). These input data were then recalculated in the modules Capacity and Operational availability and Validation of product manufacturability in time. These models verified the feasibility of the specified products and transferred products meeting these criteria to the Product priority determination module. The resulting assignment sequence for a given iteration was determined in this module. A more detailed process of creation is not the subject of this study, and therefore only the final sequence for a given iteration of the solution is given. \[\Omega=\{\Omega_{k1},\;\Omega_{k8},\;\Omega_{k2},\;\Omega_{k7},\;\Omega_{k4},\; \Omega_{k10},\;\Omega_{k5},\;\Omega_{k9},\Omega_{k3},\Omega_{k6}\}, \tag{34}\]  
As mentioned above, the product family creation module results will only be described for the final product family configuration for the first iteration. Furthermore, only the results for the final sequence of the iteration will be given. Thus, the above description contains only the final solution because each sequence has an identical solution procedure. It is therefore not necessary to describe each one separately. The product family creation algorithm begins with the first part, which involves creating product clusters and determining the production volume, as explained in the Method chapter. The LCS algorithm searches for the most extended standard sequence of operations of specified products for a specific product pair. Subsequently, the required production volume for each operating stage (operation) is recalculated separately. This calculation is necessary given the different times \(t_{kn}\) and the different types of products assigned to a particular operating stage. Therefore, the first step is to determine the minimum expected processing time for the products of the \(T\alpha\) product family. After defining this value, the updated production volume can be calculated for each product in the family. If we have a calculated production volume for each product, we can determine the production volume for a specific operating stage. Due to the future verification of the proposed configuration utilizing a simulation model, it is also necessary to calculate the total production volume. The results of all the values given are shown in Table 1.  
Another part of the product family configuration design calculates the required number of machines, which decides the possibility of producing a product family with specified products. The calculation of the number of machines is subject to verification through a computer simulation performed in the Tecnomatix Plant Simulation software v. 14.2, Educational environment. The configuration design can therefore be divided into two parts: the calculation of the initial number of configuration machines and the configuration verification through simulation. In the first phase, the work rhythm of the line configuration will be calculated using the Formula (1); during the initial recalculation, the increment of the correction coefficient is \(p=0\) and thus \(K_{p}=1\).