from the conferences organized by TANGER Ltd.
The complexity of manufacturing systems is a result of the emergence, which unconditionally relies on the qualities of the analyzed manufacturing system, the type and scale of production and the features and kind of manufactured final products. For realistic production systems formally defining their complexity is difficult and ambivalent. This article discusses the topic of formalizing various types of manufacturing systems complexity and presents an algorithm for evaluating the system basing on cooperation complexity. The presented algorithm applies to systems of convergent production characteristics, for which the evaluation of existing codependences is an NP – hard problem. The formalized algorithm is developed basing on the number of existing relations (both asymmetrical and symmetrical) defined on chosen subsystems of a complex manufacturing structure. The decomposition stage has been conducted as per the principles of the general systems theory. The final part of the article presents an analysis of the correctness of the formalized algorithm in an extreme example, i.e.: two systems SI and SII have been compared, the structure of which comprised respectively of n (for SI) and n+1 (for SII) defined subsystems which have a certain number of relations of one type established..
Keywords: convergent production systems, cooperation complexity© This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.