2012 4th IEEE International Symposium on Logistics and Industrial Informatics 2012
DOI: 10.1109/lindi.2012.6319478
|View full text |Cite
|
Sign up to set email alerts
|

Unraveling complexity in assembly supply chain networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 19 publications
(9 citation statements)
references
References 19 publications
0
5
0
Order By: Relevance
“…Subsequently, the information entropy of a graph with a total weight W and vertex weights w i can be expressed in the form of the equation: (19) Based on our previous comparison [33,34] of Vertex degree index with another complexity measures we can confirm that I vd meet given criteria for a complexity assessment of networks in the best way. For the evaluation of complexity indicators the correlation based on Spearman's rank correlation coefficient between different methods of complexity measures was used.…”
Section: Specifications Of Asc Network Complexity Measurementioning
confidence: 94%
“…Subsequently, the information entropy of a graph with a total weight W and vertex weights w i can be expressed in the form of the equation: (19) Based on our previous comparison [33,34] of Vertex degree index with another complexity measures we can confirm that I vd meet given criteria for a complexity assessment of networks in the best way. For the evaluation of complexity indicators the correlation based on Spearman's rank correlation coefficient between different methods of complexity measures was used.…”
Section: Specifications Of Asc Network Complexity Measurementioning
confidence: 94%
“…Their methods are devoted to measuring topological complexity and are also easily applicable in manufacturing process domain. The authors of the work [42] developed two practically oriented complexity indicators to assess assembly supply chain networks. It is also worth mentioning a generic static complexity measure that is easily employed in manufacturing systems environment [43].…”
Section: Related Workmentioning
confidence: 99%
“…Competitive properties of the SDC measure can be found by its comparison with possible concurrent measures. Possible alternative complexity indicators were already mutually compared in previous studies [19,20], where so called Index of vertex degree (Ivd) met optimality criteria for assessment of network complexity in the best way. Index of vertex degree has been introduced by Bonchev and Buck [21] and is expressed for Graph G consists of a set of V vertices, {V}≡{v1, v2, … , vV}, by formula:…”
Section: Comparison Of Sdc Against To Concurrent Measurementioning
confidence: 99%