Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/33312
Title: An improved spanning tree approach for the reliability analysis of supply chain collaborative network
Authors: Lam, CY
Ip, WH 
Keywords: collaborative network
reliability analysis
spanning tree
supply chain
supply chain management
Issue Date: 2012
Publisher: Taylor & Francis
Source: Enterprise information systems, 2012, v. 6, no. 4, p. 405-418 How to cite?
Journal: Enterprise information systems 
Abstract: A higher degree of reliability in the collaborative network can increase the competitiveness and performance of an entire supply chain. As supply chain networks grow more complex, the consequences of unreliable behaviour become increasingly severe in terms of cost, effort and time. Moreover, it is computationally difficult to calculate the network reliability of a Non-deterministic Polynomial-time hard (NP-hard) all-terminal network using state enumeration, as this may require a huge number of iterations for topology optimisation. Therefore, this paper proposes an alternative approach of an improved spanning tree for reliability analysis to help effectively evaluate and analyse the reliability of collaborative networks in supply chains and reduce the comparative computational complexity of algorithms. Set theory is employed to evaluate and model the all-terminal reliability of the improved spanning tree algorithm and present a case study of a supply chain used in lamp production to illustrate the application of the proposed approach.
URI: http://hdl.handle.net/10397/33312
ISSN: 1751-7575
EISSN: 1751-7583
DOI: 10.1080/17517575.2012.673236
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

13
Last Week
0
Last month
0
Citations as of Aug 21, 2017

WEB OF SCIENCETM
Citations

13
Last Week
0
Last month
0
Citations as of Aug 4, 2017

Page view(s)

27
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.