# Novel Complexity Indicator of Manufacturing Process Chains and Its Relations to Indirect Complexity Indicators

Authors: Vladimir Modrak; Zuzana Soltysova
Journal: Complexity
 (2017)

---

## Abstract

Manufacturing systems can be considered as a network of machines/workstations, where parts are produced in flow shop or job shop environment, respectively. Such network of machines/workstations can be depicted as a graph, with machines as nodes and material flow between the nodes as links. The aim of this paper is to use sequences of operations and machine network to measure static complexity of manufacturing processes. In this order existing approaches to measure the static complexity of manufacturing systems are analyzed and subsequently compared. For this purpose, analyzed competitive complexity indicators were tested on two different manufacturing layout examples. A subsequent analysis showed relevant potential of the proposed method.


---

## Body

## 1. Introduction

There is no doubt that manufacturing systems are one of the most complex processes. Moreover, the complexity has a tendency to increase due to dynamic changes in global market environment. For example, growing demand for customized products motivates companies to implement a transition toward a mass-customized manufacturing. According to Blecker et al. [1] mass customization induces a high complexity level in a context of various customer requirements and a steadily changing environment. There can be a positive side resulting from high complexity, but usually it brings negative long-term consequences to the business survival. Therefore, an investigation of complexity manufacturing process chains helps to understand and control the nonlinear behaviour of manufacturing systems [2]. Fredendall and Gabriel [3] in this context point out that by “measuring the system’s complexity, the managers can identify problems in the system that are hindering the production flow.” Isik [4] specifies other negative consequences of complexity related to logistics activities as high operational costs, customer dissatisfaction, time delay in delivery, excess inventory, or inventory shortage. In general, complexity is not easy to measure, since it is difficult to define precisely. Obviously, there are many useful complexity definitions related to manufacturing systems (see, e.g., [5–9]). In addition, several approaches were proposed during the past decades to analyze the manufacturing complexity. Those approaches differ especially in terms of types of complexity. There are two basic types of complexity in relation to the domain of the application: physical and functional [10]. The complexity viewed in terms of functional domain is defined as a measure of uncertainty in achieving the functional requirements. In the physical domain, manufacturing complexity is frequently classified into two types, static and dynamic. Dynamic complexity can be, in simplified manner, defined as uncertainty of the manufacturing system’s behaviour in a certain time period [11]. Static complexity is characterized as a function of the structure of the system [12]. Due to the fact that description of dynamic behaviour of manufacturing systems would require establishing complicated analytical equations, more extensive effort was made to develop static complexity metrics. Nevertheless, the debate on the effectiveness of the static complexity measures is still alive. The reason lies in the fact that static models of manufacturing process chains are generated for several purposes, for which different optimality criteria are specified. Moreover, some indicators of the static complexity can be seen as more or less alternative measures and other ones allow reflecting only specific properties of manufacturing process models. The main challenge in the complexity metric is to increase their effectiveness by getting a better appreciation of the real problems that manufacturers often encounter. Achieving this objective was the main motivation of the presented research to develop the novel method to measure the static complexity by using Shannon information theory.


## 2. Related Work

Firstly, it is useful to provide a working definition of complex system to specify a context in which this article focuses on the issues. We understand complex system as “a system with numerous components and interconnections, interactions or interdependencies that are difficult to describe, understand, predict, manage, design, and/or change” [13]. This definition inherently assumes that complexity of such systems arises not only from the size of the system but also from the interrelationships of the system components and the unpredictable behaviour of its drivers.Basically, there are two approaches to constructing complexity measures of manufacturing systems: algorithmic and probabilistic. Algorithmic complexity is object of study in algorithmic information theory and is based on the idea that simple tasks can be done by short algorithm while complex tasks require long computer programs [14]. The probabilistic approach to complexity is analyzing the system’s regularities as a basis for determining complexity [15]. The probabilistic approach can be divided into entropy-based complexity measures and axiomatic design-based complexity measures. In axiomatic design theory, the design process is described in terms of the mapping between four domains: the customer domain, the functional domain, the physical domain, and the process domain. Accordingly, complexity is defined as a measure of uncertainty in achieving the specified functional requirements derived from customer needs [16].The most accepted methods for complexity measures are related to information theory of entropy. The entropy is commonly associated with the amount of order, disorder, or chaos in a thermodynamic system and was first introduced by Clausius [17]. Later it was studied from statistical aspect mainly by Shannon [18]. The entropy-based complexity measure for manufacturing process chains was first adapted and introduced by Frizelle and Woodcock [19]. Complexity in another view is characterized as the number of system elements and relations among them (see, e.g., [20, 21]). Suh [22] confirmed that the manufacturing design complexity may also be seen in terms of variability, disorder, uncertainty, or entropy and proposed early complexity measurement for product design stages. Frizelle and Richards [23] proposed so-calleddynamic entropy model divided into structural complexity and operational complexity. Fujimoto et al. [24] proposed an information entropy-based measure of complexity for assembly planning. More recently, Hu et al. [25] applied entropy function to quantify the complexity of manufacturing processes and their configurations with examples in machining processes. Elmaraghy et al. [26] developed a set of complexity indices to compare layout alternatives at early design stages. Zhang [27] focuses on modelling static entropy-based complexity in manufacturing systems. His approach provides insight into the inherent complexity of system components and structure. Fisher et al. [28] pointed out that when looking downstream, uncertainties in demand variability create problems in planning, scheduling, and control. Entropy-based approaches to manufacturing complexity were presented in papers by Sivadasan et al. [29] and Deshmukh Abhijit [30]. Based on this theoretical background, complexity is considered as a random variable with different states and corresponding probabilities for each state. Isik [31] presented quite similar approach to operational complexity in manufacturing considering actual and scheduled demand using a deviation of outcomes from the expected outcome value for a definition of state’s intervals.From drivers’ point of view, internal and external complexity are mainly considered [32–34]. According to Serdarasan [35] complexity drivers are more or less manageable. Anderson [36] noted that organizational complexity has been traditionally viewed as a structural variation rate. The concept of complexity has also been treated in manufacturing research by analyzing operations processes (see, e.g., [6, 37, 38]). Several research works were conducted on a relation between complexity and manufacturing strategy [39–41].Inspired from the mentioned literature, our approach presented in this paper is complementary to the approaches mentioned above.


## 3. Description of Existing Metrics to Measure Static Complexity

In order to identify differences between the proposed method and existing metrics, three similar metrics will be further described and mutually compared including the proposed one. The first of these methods is developed by Deshmukh [12], who comprehensively defined the term static complexity of manufacturing systems and determined avoidable properties of static complexity metrics.


### 3.1. Metric by Deshmukh

He developed for this purpose three static complexity measures that differ in numbers of input variables. The first of them includes only number of machines; the second one incorporates number of operations and number of parts. The last of them is dedicated for flexible manufacturing systems assuming that the flexible manufacturing systems have the maximum entropy caused by multiple types of partsn, operations m, and machines r. Then, the maximum static complexity can be expressed as follows [12]:(1)Hs=log⁡m2nr.As an example, if we consider manufacturing system consisting of 5 machines, 10 operations, and 20 parts, then static complexity of manufacturing system using (1) equals 4 bits.Moreover, he defined significant properties of static complexity measures. According to him, any static complexity measure should be able to satisfy the following conditions.Rule #1. Static complexity should increase with the number of parts and number of machines and operations required to process the part mix.Rule #2. Static complexity should increase with increase in sequence flexibility for the parts in the production batch.Rule #3. Static complexity should increase as sharing of resources by parts increases.Rule #4. If the original part mix is split into two or more groups, then the complexity of processing should remain constant.These rules will be further used to validate presented metrics whether they follow the conditions or not.


### 3.2. Metric by Frizelle

The metric proposed by him adopts the concept of Shannon’s information entropy. Its mathematical expression can be formulated in simple way as [18](2)Hs=-∑i=1Spi·log2pi,where S represents the number of possible states the system can be in and pi is probability of system being in state i.The principle of his method is based on relation between products and machines according to the scheduled plan. So, the previous equation (2) was modified as follows [38]:(3)HS=-∑j=1M∑i=1Spijlog2⁡pij,where M represents the number of machines, S is the number of possible planned states the machine j can be in, pij is probability that the machine j is in state i.As an example, let us have the manufacturing system produce only one part with one machine. Then, probability of machine being in working state is calculated as ratio between working time of given machine and total manufacturing lead time.


### 3.3. Metric by Zhang

Zhang [42] proposed measuring static complexity of manufacturing systems using Shannon’s information entropy [22]. In his complexity model it is assumed that probabilities of any machine j being in any state i are those that reflect number of operations on available machines. Accordingly, he modified (2) as follows:(4)Hs=-∑j=1M∑i=1Sjpijlog2⁡pij,where M is the number of machines, Sj represents the number of possible planned states the machine j can be in (increased by one scheduled idle state), and pij is probability of any machine j being in any state i.


### 3.4. The Proposed Metric

The proposed method to quantify static complexity measures of manufacturing process is equally based on Shannon’s information theory. We adopt (2) by changing a meaning of probabilities of machine states in the following way:(5)Hs=-∑j=1M∑k=1Ppjk·log2pjk,where pjk is probability that part k is being processed on an individual machine j according to scheduling order, P represents the number of parts produced in manufacturing process chain (MPC), and M is the number of all machines of all types.Moreover, the following is assumed:(1)
Machines in a given manufacturing process chains are organized in serial and/or parallel manner. Then, probability that partk is being processed on an individual machine j is calculated in the following way. When a part is processed on machines in serial manner, then pjk equals 1/Ms, where Ms is number of machines organized in serial manner. If a part is processed on machines in parallel manner, then pjk=1/Mp, where Mp is number of machines organized in parallel. In case we have serial/parallel arrangement of machines and a part is processed on one of the parallel machines, then pjk equals 1/Ms·Mp.(2)
If there are identical MPCs (the same type and number of machines producing the same type and amount of parts), then static complexity of manufacturing system is calculated only for one MPC by the proposed method.To show applicability of the indicator, the following example can be used (see Figure1). We have serial/parallel arrangement of machines processing one part P.Figure 1
Serial/parallel arrangement of machines processing one part.Then, probabilitiespjk that the part is being processed by machines Mj can be calculated as shown in Figure 2.Figure 2
Values of probabilitiespjk and their distribution function.When the methods described above are mutually compared from the viewpoint of mechanism design, then some significant differences are identified (see in Table1).Table 1
Mutual comparison of static complexity methods.
Static complexity metrics
Number of machines
Number of parts
Number of operations
Flexible routings
Workplace organization
Part scheduling
Metric by Deshmukh
✓
✓
✓
x
x
x
Metric by Frizelle
✓
✓
✓
✓
x
x
Metric by Zhang
✓
✓
✓
✓
✓
x
Proposed metric
✓
✓
✓
✓
✓
✓As it can be seen from Table1, the proposed method seems to be the most comprehensive instrument to measure static complexity of manufacturing systems. In spite of the previous methods, this method includes parts scheduling. It takes into account the probability of parts being processed on individual machine according to scheduling order.


## 3.1. Metric by Deshmukh

He developed for this purpose three static complexity measures that differ in numbers of input variables. The first of them includes only number of machines; the second one incorporates number of operations and number of parts. The last of them is dedicated for flexible manufacturing systems assuming that the flexible manufacturing systems have the maximum entropy caused by multiple types of partsn, operations m, and machines r. Then, the maximum static complexity can be expressed as follows [12]:(1)Hs=log⁡m2nr.As an example, if we consider manufacturing system consisting of 5 machines, 10 operations, and 20 parts, then static complexity of manufacturing system using (1) equals 4 bits.Moreover, he defined significant properties of static complexity measures. According to him, any static complexity measure should be able to satisfy the following conditions.Rule #1. Static complexity should increase with the number of parts and number of machines and operations required to process the part mix.Rule #2. Static complexity should increase with increase in sequence flexibility for the parts in the production batch.Rule #3. Static complexity should increase as sharing of resources by parts increases.Rule #4. If the original part mix is split into two or more groups, then the complexity of processing should remain constant.These rules will be further used to validate presented metrics whether they follow the conditions or not.


## 3.2. Metric by Frizelle

The metric proposed by him adopts the concept of Shannon’s information entropy. Its mathematical expression can be formulated in simple way as [18](2)Hs=-∑i=1Spi·log2pi,where S represents the number of possible states the system can be in and pi is probability of system being in state i.The principle of his method is based on relation between products and machines according to the scheduled plan. So, the previous equation (2) was modified as follows [38]:(3)HS=-∑j=1M∑i=1Spijlog2⁡pij,where M represents the number of machines, S is the number of possible planned states the machine j can be in, pij is probability that the machine j is in state i.As an example, let us have the manufacturing system produce only one part with one machine. Then, probability of machine being in working state is calculated as ratio between working time of given machine and total manufacturing lead time.


## 3.3. Metric by Zhang

Zhang [42] proposed measuring static complexity of manufacturing systems using Shannon’s information entropy [22]. In his complexity model it is assumed that probabilities of any machine j being in any state i are those that reflect number of operations on available machines. Accordingly, he modified (2) as follows:(4)Hs=-∑j=1M∑i=1Sjpijlog2⁡pij,where M is the number of machines, Sj represents the number of possible planned states the machine j can be in (increased by one scheduled idle state), and pij is probability of any machine j being in any state i.


## 3.4. The Proposed Metric

The proposed method to quantify static complexity measures of manufacturing process is equally based on Shannon’s information theory. We adopt (2) by changing a meaning of probabilities of machine states in the following way:(5)Hs=-∑j=1M∑k=1Ppjk·log2pjk,where pjk is probability that part k is being processed on an individual machine j according to scheduling order, P represents the number of parts produced in manufacturing process chain (MPC), and M is the number of all machines of all types.Moreover, the following is assumed:(1)
Machines in a given manufacturing process chains are organized in serial and/or parallel manner. Then, probability that partk is being processed on an individual machine j is calculated in the following way. When a part is processed on machines in serial manner, then pjk equals 1/Ms, where Ms is number of machines organized in serial manner. If a part is processed on machines in parallel manner, then pjk=1/Mp, where Mp is number of machines organized in parallel. In case we have serial/parallel arrangement of machines and a part is processed on one of the parallel machines, then pjk equals 1/Ms·Mp.(2)
If there are identical MPCs (the same type and number of machines producing the same type and amount of parts), then static complexity of manufacturing system is calculated only for one MPC by the proposed method.To show applicability of the indicator, the following example can be used (see Figure1). We have serial/parallel arrangement of machines processing one part P.Figure 1
Serial/parallel arrangement of machines processing one part.Then, probabilitiespjk that the part is being processed by machines Mj can be calculated as shown in Figure 2.Figure 2
Values of probabilitiespjk and their distribution function.When the methods described above are mutually compared from the viewpoint of mechanism design, then some significant differences are identified (see in Table1).Table 1
Mutual comparison of static complexity methods.
Static complexity metrics
Number of machines
Number of parts
Number of operations
Flexible routings
Workplace organization
Part scheduling
Metric by Deshmukh
✓
✓
✓
x
x
x
Metric by Frizelle
✓
✓
✓
✓
x
x
Metric by Zhang
✓
✓
✓
✓
✓
x
Proposed metric
✓
✓
✓
✓
✓
✓As it can be seen from Table1, the proposed method seems to be the most comprehensive instrument to measure static complexity of manufacturing systems. In spite of the previous methods, this method includes parts scheduling. It takes into account the probability of parts being processed on individual machine according to scheduling order.


## 4. Testing of Described Metrics

As metric by Deshmukh is already verified, the three other metrics will be tested by the above described rules using the theoretical examples shown in Figures3–8. Prior to testing, we will assume also operation time (set in 10 minutes), since metric by Frizelle needs to know this item.Figure 3
MPC consisting of (a) one machine and one part and (b) two machines and one part.
(a)
(b)Figure 4
MPC consisting of (a) four machines and two parts and (b) four machines and one part.
(a)
(b)Figure 5
MPC consisting of (a) three machines and two parts and (b) four machines and two parts.
(a)
(b)Figure 6
MPC consisting of (a) two machines and three parts and (b) two machines and four parts.
(a)
(b)Figure 7
MPC consisting of (a) two machines and three parts and (b) two machines and four parts.
(a)
(b)Figure 8
MPC consisting of (a) two machines and four parts and (b) two machines and four parts divided into two groups with one machine and two parts for one group.
(a)
(b)


### 4.1. Testing Complexity Indicators by Rule #1

First, let us denote value of static complexity for MPC withj machines and k parts as Hj,k.The rule is proposing (in case of the three metrics) two conditional statements:(I)
Ifk is constant, j is increasing and machines are arranged only in serial manner and then Hj-1,k<Hj,k.(II)
Ifj is constant, k is increasing and machines are arranged only in serial manner and then Hj,k-1<Hj,k.


#### 4.1.1. Testing of Statement I for the 3 Complexity Metrics

Let us test two MPCs shown in Figure3 with static complexities H1;1 and H2;1.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 2.Table 2
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed metric
H
1
;
1
0 bits
1 bit
0 bits
H
2
;
1
1 bit
2 bits
1 bit
Proof
H
2,1
>
H
1,1
H
2,1
>
H
1,1
H
2,1
>
H
1,1For example, the complexities according to the proposed metric are calculated using (5) as follows: (6)H1,1=-p1,1log2⁡p1,1=-1log21=0bitsH2,1=-p1,1log2⁡p1,1+-p2,1log2⁡p2,1=0,5+0,5=1bit.


#### 4.1.2. Testing of Statement II for the 3 Complexity Metrics

Let us test two MPCs shown in Figure4 with static complexities H4;2 and H4;1.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 3.Table 3
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric by Zhang
Proposed metric
H
4
;
1
2 bits
4 bits
2 bits
H
4
;
2
1,89 bits
6,34 bits
4 bits
Proof
H
4,2
<
H
4,1
H
4,2
>
H
4,1
H
4,2
>
H
4,1Summarily, the results of the proofs are depicted in Table4.Table 4
Proofs of Rule #1.
Complexity indicator
Proofs forRule #1 (a)
Proofs forRule #1 (b)
Metric by Frizelle
True
False
Metric by Zhang
True
True
Proposed metric
True
True


### 4.2. Testing Complexity Indicators by Rule #2

The rule proposes the following conditional statement:Ifk is constant, j is increasing and machines are arranged only in parallel manner and then Hj-1,k<Hj,k.Let us test two MPCs shown in Figure5 with static complexities H3;2 and H4;2.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 5.Table 5
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed metric
H
3
;
2
1,5 bits
4,75 bits
2,86 bits
H
4
;
2
1,89 bits
6,34 bits
4 bits
Proof
H
4,2
>
H
3,2
H
4,2
>
H
3,2
H
4,2
>
H
3,2The results of the proofs are summarized in Table6.Table 6
Proofs of Rule #2.
Complexity indicator
Proofs for Rule #2
Metric by Frizelle
True
Metric by Zhang
True
Proposed metric
True


### 4.3. Testing Complexity Indicators by Rule #3

The rule is proposing two conditional statements:(I)
Ifj is constant, k is increasing and machines are arranged only in serial manner and then Hj,k-1<Hj,k.(II)
Ifj is constant, k is increasing and machines are arranged only in parallel and then Hj,k-1<Hj,k.


#### 4.3.1. Testing of Statement I

Let us test two MPCs shown in Figure6 with static complexities H2;3 and H2;4.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 7.Table 7
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed metric
H
2
;
3
1 bit
4 bits
3 bits
H
2
;
4
0,93 bits
4,64 bits
4 bits
Proof
H
2,4
<
H
2,3
H
2,4
>
H
2,3
H
2,4
>
H
2,3


#### 4.3.2. Testing of Statement II

Let us test two MPCs shown in Figure7 with static complexities H2;3 and H2;4.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 8.Table 8
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed metric
H
2
;
3
1 bit
4 bits
3 bits
H
2
;
4
0,93 bits
4,64 bits
4 bits
Proof
H
2,4
<
H
2,3
H
2,4
>
H
2,3
H
2,4
>
H
2,3Summarization of the proof results is shown in Table9.Table 9
Proofs of Rule #3.
Complexity indicator
Proofs forRule #3 (a)
Proofs forRule #3 (b)
Metric by Frizelle
False
False
Metric by Zhang
True
True
Proposed metric
True
True


### 4.4. Testing Complexity Indicators by Rule #4

The proposition of this rule is as follows:Ifk is constant,j is constant and MPC is split into two groups, and then Hj,k=Hj/2,k+Hj/2,k.Let us test three MPCs shown in Figure6 with static complexities H4;4, H2;4, and H2;4.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 10.Table 10
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed Metric
H
2
;
4
0,93 bits
4,64 bits
4 bits
H
4
;
4
1,85 bits
9,28 bits
8 bits
Proof
H
4,4
=
H
2,4
+
H
2,4
H
4,4
=
H
2,4
+
H
2,4
H
4,4
=
H
2,4
+
H
2,4Summarily, the results of the proofs are depicted in Table11.Table 11
Proofs of Rule #4.
Complexity indicator
Proofs for Rule #4
Metric by Frizelle
True
Metric by Zhang
True
Proposed metric
TrueThe comparison showed that metrics by Deshmukh and Zhang and the proposed indicator satisfies the rules.However, all the metrics will be further applied on MPC layouts previously used in case studies by Zhang [42] and Yan and Irani [43]. Prior to the application, these two independent layouts and their alternatives in the subsequent section are described.


## 4.1. Testing Complexity Indicators by Rule #1

First, let us denote value of static complexity for MPC withj machines and k parts as Hj,k.The rule is proposing (in case of the three metrics) two conditional statements:(I)
Ifk is constant, j is increasing and machines are arranged only in serial manner and then Hj-1,k<Hj,k.(II)
Ifj is constant, k is increasing and machines are arranged only in serial manner and then Hj,k-1<Hj,k.


### 4.1.1. Testing of Statement I for the 3 Complexity Metrics

Let us test two MPCs shown in Figure3 with static complexities H1;1 and H2;1.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 2.Table 2
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed metric
H
1
;
1
0 bits
1 bit
0 bits
H
2
;
1
1 bit
2 bits
1 bit
Proof
H
2,1
>
H
1,1
H
2,1
>
H
1,1
H
2,1
>
H
1,1For example, the complexities according to the proposed metric are calculated using (5) as follows: (6)H1,1=-p1,1log2⁡p1,1=-1log21=0bitsH2,1=-p1,1log2⁡p1,1+-p2,1log2⁡p2,1=0,5+0,5=1bit.


### 4.1.2. Testing of Statement II for the 3 Complexity Metrics

Let us test two MPCs shown in Figure4 with static complexities H4;2 and H4;1.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 3.Table 3
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric by Zhang
Proposed metric
H
4
;
1
2 bits
4 bits
2 bits
H
4
;
2
1,89 bits
6,34 bits
4 bits
Proof
H
4,2
<
H
4,1
H
4,2
>
H
4,1
H
4,2
>
H
4,1Summarily, the results of the proofs are depicted in Table4.Table 4
Proofs of Rule #1.
Complexity indicator
Proofs forRule #1 (a)
Proofs forRule #1 (b)
Metric by Frizelle
True
False
Metric by Zhang
True
True
Proposed metric
True
True


## 4.1.1. Testing of Statement I for the 3 Complexity Metrics

Let us test two MPCs shown in Figure3 with static complexities H1;1 and H2;1.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 2.Table 2
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed metric
H
1
;
1
0 bits
1 bit
0 bits
H
2
;
1
1 bit
2 bits
1 bit
Proof
H
2,1
>
H
1,1
H
2,1
>
H
1,1
H
2,1
>
H
1,1For example, the complexities according to the proposed metric are calculated using (5) as follows: (6)H1,1=-p1,1log2⁡p1,1=-1log21=0bitsH2,1=-p1,1log2⁡p1,1+-p2,1log2⁡p2,1=0,5+0,5=1bit.


## 4.1.2. Testing of Statement II for the 3 Complexity Metrics

Let us test two MPCs shown in Figure4 with static complexities H4;2 and H4;1.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 3.Table 3
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric by Zhang
Proposed metric
H
4
;
1
2 bits
4 bits
2 bits
H
4
;
2
1,89 bits
6,34 bits
4 bits
Proof
H
4,2
<
H
4,1
H
4,2
>
H
4,1
H
4,2
>
H
4,1Summarily, the results of the proofs are depicted in Table4.Table 4
Proofs of Rule #1.
Complexity indicator
Proofs forRule #1 (a)
Proofs forRule #1 (b)
Metric by Frizelle
True
False
Metric by Zhang
True
True
Proposed metric
True
True


## 4.2. Testing Complexity Indicators by Rule #2

The rule proposes the following conditional statement:Ifk is constant, j is increasing and machines are arranged only in parallel manner and then Hj-1,k<Hj,k.Let us test two MPCs shown in Figure5 with static complexities H3;2 and H4;2.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 5.Table 5
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed metric
H
3
;
2
1,5 bits
4,75 bits
2,86 bits
H
4
;
2
1,89 bits
6,34 bits
4 bits
Proof
H
4,2
>
H
3,2
H
4,2
>
H
3,2
H
4,2
>
H
3,2The results of the proofs are summarized in Table6.Table 6
Proofs of Rule #2.
Complexity indicator
Proofs for Rule #2
Metric by Frizelle
True
Metric by Zhang
True
Proposed metric
True


## 4.3. Testing Complexity Indicators by Rule #3

The rule is proposing two conditional statements:(I)
Ifj is constant, k is increasing and machines are arranged only in serial manner and then Hj,k-1<Hj,k.(II)
Ifj is constant, k is increasing and machines are arranged only in parallel and then Hj,k-1<Hj,k.


### 4.3.1. Testing of Statement I

Let us test two MPCs shown in Figure6 with static complexities H2;3 and H2;4.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 7.Table 7
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed metric
H
2
;
3
1 bit
4 bits
3 bits
H
2
;
4
0,93 bits
4,64 bits
4 bits
Proof
H
2,4
<
H
2,3
H
2,4
>
H
2,3
H
2,4
>
H
2,3


### 4.3.2. Testing of Statement II

Let us test two MPCs shown in Figure7 with static complexities H2;3 and H2;4.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 8.Table 8
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed metric
H
2
;
3
1 bit
4 bits
3 bits
H
2
;
4
0,93 bits
4,64 bits
4 bits
Proof
H
2,4
<
H
2,3
H
2,4
>
H
2,3
H
2,4
>
H
2,3Summarization of the proof results is shown in Table9.Table 9
Proofs of Rule #3.
Complexity indicator
Proofs forRule #3 (a)
Proofs forRule #3 (b)
Metric by Frizelle
False
False
Metric by Zhang
True
True
Proposed metric
True
True


## 4.3.1. Testing of Statement I

Let us test two MPCs shown in Figure6 with static complexities H2;3 and H2;4.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 7.Table 7
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed metric
H
2
;
3
1 bit
4 bits
3 bits
H
2
;
4
0,93 bits
4,64 bits
4 bits
Proof
H
2,4
<
H
2,3
H
2,4
>
H
2,3
H
2,4
>
H
2,3


## 4.3.2. Testing of Statement II

Let us test two MPCs shown in Figure7 with static complexities H2;3 and H2;4.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 8.Table 8
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed metric
H
2
;
3
1 bit
4 bits
3 bits
H
2
;
4
0,93 bits
4,64 bits
4 bits
Proof
H
2,4
<
H
2,3
H
2,4
>
H
2,3
H
2,4
>
H
2,3Summarization of the proof results is shown in Table9.Table 9
Proofs of Rule #3.
Complexity indicator
Proofs forRule #3 (a)
Proofs forRule #3 (b)
Metric by Frizelle
False
False
Metric by Zhang
True
True
Proposed metric
True
True


## 4.4. Testing Complexity Indicators by Rule #4

The proposition of this rule is as follows:Ifk is constant,j is constant and MPC is split into two groups, and then Hj,k=Hj/2,k+Hj/2,k.Let us test three MPCs shown in Figure6 with static complexities H4;4, H2;4, and H2;4.Applying (3), (4), and (5), according to metrics by Frizelle and Zhang and the proposed approach, we obtain the results shown in Table 10.Table 10
Static complexity values and their proof.
Complexity
Metric byFrizelle
Metric byZhang
Proposed Metric
H
2
;
4
0,93 bits
4,64 bits
4 bits
H
4
;
4
1,85 bits
9,28 bits
8 bits
Proof
H
4,4
=
H
2,4
+
H
2,4
H
4,4
=
H
2,4
+
H
2,4
H
4,4
=
H
2,4
+
H
2,4Summarily, the results of the proofs are depicted in Table11.Table 11
Proofs of Rule #4.
Complexity indicator
Proofs for Rule #4
Metric by Frizelle
True
Metric by Zhang
True
Proposed metric
TrueThe comparison showed that metrics by Deshmukh and Zhang and the proposed indicator satisfies the rules.However, all the metrics will be further applied on MPC layouts previously used in case studies by Zhang [42] and Yan and Irani [43]. Prior to the application, these two independent layouts and their alternatives in the subsequent section are described.


## 5. Description of Compared Layouts

Here two layout types are described in this section. The first type (Layout #1) consists of two groups. The first group represents 3 alternatives of 2-cell design layouts and the second group is representing 2 alternatives of 3-cell design layouts. The second type (Layout #2) includes two alternatives of MPC, one arranged as job shop and the other as flow shop.


### 5.1. Layout #1

MPC1 in Figure9 is divided into two cells with 23 machines, where first production cell consists of 11 machines and second cell is created by 12 machines. Parts P1–P4 and P7–P11 are processed in first cell; other parts marked as P12–18 are processed only in the second cell, while parts P5 and P6 are partially processed in the second cell and finalized in the first cell.Figure 9
MPC1 and its part flows divided into 2 cells.Manufacturing process chain marked as MPC2 (see in Figure10) is organized into two cells with 25 machines, while 16 machines are located in cell #1 and 9 machines in cell #2. Parts with numbers from 1 to 11 and 18 are processed in the first cell, while the remaining parts are processed in the second cell.Figure 10
MPC2 and its part flows divided into 2 cells.MPC3 in Figure11 is similar to MPC2 with machine organization in cells, but it differs that in the second cell machine M1 is redundant and therefore removed. Parts P15 and P16 start to be produced in the first cell and they continue to the second cell for finalization.Figure 11
MPC3 and its part flows divided into 2 cells.MPC4 shown in Figure12 contains 3 cells. Here there are 26 machines, while 8 machines are located in the first cell, 10 machines are located in the second cell, and 8 machines are located in the third cell. The first cell produces parts with numbers 1, 3, 7, 8, 9, and 11, while part P3 is finalized in the second cell. Parts P2, P4–6, P10, P15, P16, and P18 are produced in the second cell, but parts P15 and P16 are finalized in the third cell along with parts P12–14, P17, and P19.Figure 12
MPC4 and its part flows divided into 3 cells.MPC5 in Figure13 is divided into 3 cells containing together 24 machines, where the first cell includes 5 machines, the second cell includes 15 machines, and the third cell is comprised of four machines. Parts P1, P3, P7, P8, P9, and P11 are produced in the first cell, while parts P1, P3, P7, P8, and P9 are finalized in the second cell. Parts P2, P4–6, P10, P14, P15, P16, and P18 are machined in the second cell, but parts P15 and P16 are finally produced by machines in the third cell. Remaining parts P12-13, P17, and P19 are machined only in the third cell.Figure 13
MPC5 and its part flows divided into 3 cells.Layout#1 and its input data were taken from the chapter written by Yan and Irani [43]. These authors studied the impact of 2-cell and 3-cell design layout on MPC performance by comparing their process structure properties. This MPC produces 19 parts (P) by 12 machine types (M). Machine sequence and their operational times for all parts are in Table 12.Table 12
Sequence of operations for 19 parts.
Part number
Sequence of operations and their times in minutes
P1
M1 (96), M4 (36), M8 (36), M9 (72)
P2
M1 (36), M4 (120), M7 (20), M4 (120),M8 (24), M7 (20)
P3
M1 (96), M2 (48), M4 (36), M7 (120), M8 (36), M9 (72)
P4
M1 (96), M4 (36), M7 (120), M9 (72)
P5
M1 (96), M6 (72), M10 (200), M7 (120), M9 (72)
P6
M6 (36), M10 (120), M7 (60), M8 (36), M9 (24)
P7
M6 (72), M4 (36), M8 (48), M9 (48)
P8
M3 (144), M5 (120), M2 (48), M6 (72), M4 (36), M8 (48), M9 (48)
P9
M3 (144), M5 (120), M2 (48), M6 (72), M4 (36), M8 (48), M9 (48)
P10
M4 (120), M7 (20), M4 (120), M8 (24)
P11
M6 (72)
P12
M11 (192), M7 (150), M12 (80)
P13
M11 (192), M12 (60)
P14
M11 (288), M7 (180), M10 (360)
P15
M1 (15), M7 (70), M11 (54), M10 (45), M11 (54), M12 (30)
P16
M1 (15), M7 (70), M11 (54), M10 (45), M11 (54), M12 (30)
P17
M11 (192), M7 (150), M12 (80)
P18
M6 (108), M7 (180), M10 (360)
P19
M12 (60)


### 5.2. Layout #2

Layout #2 is taken from Zhang’s study case [42]. Both, MPC6 for job shop and MPC7 for flow shop, consist of 20 machines of 4 types, while machining time per part is 10 minutes. These MPCs produce 100 products and each product passes through one of each machine type.The first alternative of job shop production in Figure14 is characterized by arrangement of machines of the same type by free mode.Figure 14
Job shop production with alternative part flows.Transformed layout, in Figure15, into flow shop production consists of 5 lines. Every line contains four machines of each type. So, the 100 parts are regrouped into five lines, each producing 20 parts.Figure 15
Flow shop production divided into 5 lines.


## 5.1. Layout #1

MPC1 in Figure9 is divided into two cells with 23 machines, where first production cell consists of 11 machines and second cell is created by 12 machines. Parts P1–P4 and P7–P11 are processed in first cell; other parts marked as P12–18 are processed only in the second cell, while parts P5 and P6 are partially processed in the second cell and finalized in the first cell.Figure 9
MPC1 and its part flows divided into 2 cells.Manufacturing process chain marked as MPC2 (see in Figure10) is organized into two cells with 25 machines, while 16 machines are located in cell #1 and 9 machines in cell #2. Parts with numbers from 1 to 11 and 18 are processed in the first cell, while the remaining parts are processed in the second cell.Figure 10
MPC2 and its part flows divided into 2 cells.MPC3 in Figure11 is similar to MPC2 with machine organization in cells, but it differs that in the second cell machine M1 is redundant and therefore removed. Parts P15 and P16 start to be produced in the first cell and they continue to the second cell for finalization.Figure 11
MPC3 and its part flows divided into 2 cells.MPC4 shown in Figure12 contains 3 cells. Here there are 26 machines, while 8 machines are located in the first cell, 10 machines are located in the second cell, and 8 machines are located in the third cell. The first cell produces parts with numbers 1, 3, 7, 8, 9, and 11, while part P3 is finalized in the second cell. Parts P2, P4–6, P10, P15, P16, and P18 are produced in the second cell, but parts P15 and P16 are finalized in the third cell along with parts P12–14, P17, and P19.Figure 12
MPC4 and its part flows divided into 3 cells.MPC5 in Figure13 is divided into 3 cells containing together 24 machines, where the first cell includes 5 machines, the second cell includes 15 machines, and the third cell is comprised of four machines. Parts P1, P3, P7, P8, P9, and P11 are produced in the first cell, while parts P1, P3, P7, P8, and P9 are finalized in the second cell. Parts P2, P4–6, P10, P14, P15, P16, and P18 are machined in the second cell, but parts P15 and P16 are finally produced by machines in the third cell. Remaining parts P12-13, P17, and P19 are machined only in the third cell.Figure 13
MPC5 and its part flows divided into 3 cells.Layout#1 and its input data were taken from the chapter written by Yan and Irani [43]. These authors studied the impact of 2-cell and 3-cell design layout on MPC performance by comparing their process structure properties. This MPC produces 19 parts (P) by 12 machine types (M). Machine sequence and their operational times for all parts are in Table 12.Table 12
Sequence of operations for 19 parts.
Part number
Sequence of operations and their times in minutes
P1
M1 (96), M4 (36), M8 (36), M9 (72)
P2
M1 (36), M4 (120), M7 (20), M4 (120),M8 (24), M7 (20)
P3
M1 (96), M2 (48), M4 (36), M7 (120), M8 (36), M9 (72)
P4
M1 (96), M4 (36), M7 (120), M9 (72)
P5
M1 (96), M6 (72), M10 (200), M7 (120), M9 (72)
P6
M6 (36), M10 (120), M7 (60), M8 (36), M9 (24)
P7
M6 (72), M4 (36), M8 (48), M9 (48)
P8
M3 (144), M5 (120), M2 (48), M6 (72), M4 (36), M8 (48), M9 (48)
P9
M3 (144), M5 (120), M2 (48), M6 (72), M4 (36), M8 (48), M9 (48)
P10
M4 (120), M7 (20), M4 (120), M8 (24)
P11
M6 (72)
P12
M11 (192), M7 (150), M12 (80)
P13
M11 (192), M12 (60)
P14
M11 (288), M7 (180), M10 (360)
P15
M1 (15), M7 (70), M11 (54), M10 (45), M11 (54), M12 (30)
P16
M1 (15), M7 (70), M11 (54), M10 (45), M11 (54), M12 (30)
P17
M11 (192), M7 (150), M12 (80)
P18
M6 (108), M7 (180), M10 (360)
P19
M12 (60)


## 5.2. Layout #2

Layout #2 is taken from Zhang’s study case [42]. Both, MPC6 for job shop and MPC7 for flow shop, consist of 20 machines of 4 types, while machining time per part is 10 minutes. These MPCs produce 100 products and each product passes through one of each machine type.The first alternative of job shop production in Figure14 is characterized by arrangement of machines of the same type by free mode.Figure 14
Job shop production with alternative part flows.Transformed layout, in Figure15, into flow shop production consists of 5 lines. Every line contains four machines of each type. So, the 100 parts are regrouped into five lines, each producing 20 parts.Figure 15
Flow shop production divided into 5 lines.


## 6. Comparison of Performed Complexity Measures

Calculated values of static complexity are summarized in Tables13 and 14 for both Layouts #1 and #2 according to the four metrics.Table 13
Comparison of static complexity values for Layout #1.
Layout #1
Metric by Deshmukh
Metric by Frizelle
Metric by Zhang
Proposed metric
MPC1
6,45 bits
18,6 bits
62 bits
47,8 bits
MPC2
6,48 bits
17,7 bits
65,8 bits
50,7 bits
MPC3
6,48 bits
17,4 bits
60,9 bits
53,9 bits
MPC4
6,46 bits
21,7 bits
61,4 bits
44,8 bits
MPC5
6,5 bits
19,1 bits
57,2 bits
47,1 bitsTable 14
Comparison of static complexity values for Layout #2.
Layout #2
Metric by Deshmukh
Metric by Frizelle
Metric by Zhang
Proposed metric
MPC6
7,3 bits
10 bits
133 bits
4,32 bits
MPC7
7,3 bits
10 bits
22 bits
2,00 bitsPrior to analyses of results, one must clearly understand the desired aim of the MPC models. Therefore, the following assumptions are formulated.For Layout #1, consider the following.Assumption Number 1. It is expected that the static complexity of alternatives with three cells is lower than the static complexity of alternatives with two cells. This expectation results from the finding that “production scheduling for two cell solutions is harder than for three cell solutions” [43]. Because it is known that (see, e.g., Rintanen [44]) “harder scheduling problems typically involve uncertainty,” it can be stated that harder scheduling brings more complexity to the manufacturing system than easier scheduling.For Layout #2, consider the following.Assumption Number 2. The lower complexity of flow shop production is expected, compared to the job shop. This assumption is more or less generally known. For example, Morton and Pentico [45] argue that flow of parts through the shop is usually less complex than that for closed or open job shops.The aim of testing was to verify whether these metrics follow these tendencies. In this order, Table15 offers the overview of how the indicators reflect the assumptions.Table 15
Comparison of complexity indicators according to the specified assumptions.
AssumptionNumber 1
AssumptionNumber 2
Metric by Deshmukh
✓
N/A
Metric by Frizelle
x
N/A
Metric by Zhang
x
✓
Novel metric
✓
✓Based on the results, the tendencies by Assumption Number 1 were confirmed only by Deshmukh’s metric and proposed method. The tendency by Assumption Number 2 was confirmed only by Zhang’s metric and novel method, while the remaining metrics are not applicable (N/A).


## 7. Comparison of the Proposed Method with Indirect Indicators

The comparison shown above yielded positive findings about the proposed method. However, each additional verification of this metric may contribute to its objectivity or versatility. For this reason, the next section is focused on the evaluation of mutual relations between the proposed method and other indirect complexity indicators, such as the production line balancing rate and the number of intercell flows and intracell flows. For this purpose only Layout #1 will be used.


### 7.1. Description of Indirect Indicators

#### 7.1.1. Production Line Balancing Rate

Production line balancing rate is the quota that measures the average situation of every cycle time in working procedure on processing line. Production line balancing rate is calculated as follows [46]:(7)P=∑j=1ntjm∗max⁡Ti,where tj is the expression of standard work time of the j job elements, n represents the number of the work elements, m is the number of total lines (cells) in MPCs, Ti represents the work time in the line, and max⁡(Ti) is the biggest line operating time.


#### 7.1.2. Number of Intercell and Intracell Flows

Part flows of manufacturing system can be classified into intercell and intracell types. It is also known as intercell and intracell layout problems. Intercell flows are expressed as movements between the cells. Intracell flows present the connection between machines at workstations [47]. It is quite frequently stated that intercell flows impact on manufacturing system negatively [48–55]. It is due to the fact that intercell trips are difficult for scheduling and controlling.


### 7.2. Comparison of the Proposed Method with Indirect Complexity Indicators

The results of indirect indicators calculation are shown in Table16.Table 16
Comparison of indirect indicators with static complexity measure.
Layout #1
Static complexity
Production line balancing rate
Number of intercell flows
Number of intracell flows
MPC1
47,8 bits
92,4%
15
244
MPC2
50,7 bits
78,7%
0
262
MPC3
53,9 bits
78,2%
8
326
MPC4
44,8 bits
85,6%
6
141
MPC5
47,1 bits
50,7%
14
217Based on the results in Table16 one can state that there are significant mutual relations between these indicators and static complexity. Specifically, the following prepropositions can be formulated.Preproposition Number 1. In the case of well-balancing lines, the static complexity is lower and vice versa.Preproposition Number 2. The greater number of intercell flows has greater impact on the static complexity than the smaller one.Preproposition Number 3. The greater number of intracell flows has greater impact on the static complexity than the smaller one.When verifying the prepropositions by individual MPCs we can conclude that the previous prepropositions were confirmed for all of these three indicators and for all MPCs excluding one situation. It is specifically for number of intercell flows in MPC1, where the number of intercell flows should cause the highest complexity, but in this case the value of static complexity is the lowest.It can be explained by the fact that it is the specific situation. The second line (cell) contains three machines of M10 type, while in the first line there is no machine of M10 type. But, this layout is the most preferable from the perspective of production line balancing rate.


## 7.1. Description of Indirect Indicators

### 7.1.1. Production Line Balancing Rate

Production line balancing rate is the quota that measures the average situation of every cycle time in working procedure on processing line. Production line balancing rate is calculated as follows [46]:(7)P=∑j=1ntjm∗max⁡Ti,where tj is the expression of standard work time of the j job elements, n represents the number of the work elements, m is the number of total lines (cells) in MPCs, Ti represents the work time in the line, and max⁡(Ti) is the biggest line operating time.


### 7.1.2. Number of Intercell and Intracell Flows

Part flows of manufacturing system can be classified into intercell and intracell types. It is also known as intercell and intracell layout problems. Intercell flows are expressed as movements between the cells. Intracell flows present the connection between machines at workstations [47]. It is quite frequently stated that intercell flows impact on manufacturing system negatively [48–55]. It is due to the fact that intercell trips are difficult for scheduling and controlling.


## 7.1.1. Production Line Balancing Rate

Production line balancing rate is the quota that measures the average situation of every cycle time in working procedure on processing line. Production line balancing rate is calculated as follows [46]:(7)P=∑j=1ntjm∗max⁡Ti,where tj is the expression of standard work time of the j job elements, n represents the number of the work elements, m is the number of total lines (cells) in MPCs, Ti represents the work time in the line, and max⁡(Ti) is the biggest line operating time.


## 7.1.2. Number of Intercell and Intracell Flows

Part flows of manufacturing system can be classified into intercell and intracell types. It is also known as intercell and intracell layout problems. Intercell flows are expressed as movements between the cells. Intracell flows present the connection between machines at workstations [47]. It is quite frequently stated that intercell flows impact on manufacturing system negatively [48–55]. It is due to the fact that intercell trips are difficult for scheduling and controlling.


## 7.2. Comparison of the Proposed Method with Indirect Complexity Indicators

The results of indirect indicators calculation are shown in Table16.Table 16
Comparison of indirect indicators with static complexity measure.
Layout #1
Static complexity
Production line balancing rate
Number of intercell flows
Number of intracell flows
MPC1
47,8 bits
92,4%
15
244
MPC2
50,7 bits
78,7%
0
262
MPC3
53,9 bits
78,2%
8
326
MPC4
44,8 bits
85,6%
6
141
MPC5
47,1 bits
50,7%
14
217Based on the results in Table16 one can state that there are significant mutual relations between these indicators and static complexity. Specifically, the following prepropositions can be formulated.Preproposition Number 1. In the case of well-balancing lines, the static complexity is lower and vice versa.Preproposition Number 2. The greater number of intercell flows has greater impact on the static complexity than the smaller one.Preproposition Number 3. The greater number of intracell flows has greater impact on the static complexity than the smaller one.When verifying the prepropositions by individual MPCs we can conclude that the previous prepropositions were confirmed for all of these three indicators and for all MPCs excluding one situation. It is specifically for number of intercell flows in MPC1, where the number of intercell flows should cause the highest complexity, but in this case the value of static complexity is the lowest.It can be explained by the fact that it is the specific situation. The second line (cell) contains three machines of M10 type, while in the first line there is no machine of M10 type. But, this layout is the most preferable from the perspective of production line balancing rate.


## 8. Conclusion

The presented paper offers promising findings for improving the static complexity measurement and assessment of manufacturing systems. It was also proved that the four criteria defined for validation of static complexity have to be respected and we underline their importance for a future research focused on static complexity issues in manufacturing environment.At the same time, it can be stated that indirect complexity indicators seem to be helpful tools to assess the property of manufacturing systems. It can be also anticipated that production line balancing rate more greatly affects the complexity mitigation, compared to number of intercell part flows and intracell part flows. Nonetheless, it will be necessary to go through a number of simulation experiments with different manufacturing systems to verify these prepropositions.



---

*Source: 9102824-2017-06-21.xml*