Skip to main content

2022 | OriginalPaper | Buchkapitel

The New Attempt of Network Reliability in the Assessment of Business Activities for Precision Management

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Network reliability has been applied to many real-world applications. The popular areas are traffic planning, computer network planning, power transmission planning, etc. However, in the social applications, there are still very limited cases reported. This chapter is planned to introduce the new attempt of applying network reliability in the assessment of business activities. Such attempt is a step toward precision management in business administration. Based on the capability of conducting precision management, a great deal of improvements in business practices can be taken place. Precision performance evaluation for individuals or groups are presented, and a case study is illustrated to show the approach proposed in this chapter.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Abel U, Bicker R (1982) Determination of all minimal cut-sets between a vertex pair in an undirected graph. IEEE Trans Reliab R-31:167–171 Abel U, Bicker R (1982) Determination of all minimal cut-sets between a vertex pair in an undirected graph. IEEE Trans Reliab R-31:167–171
2.
Zurück zum Zitat Aggarwal KK, Chopra YC, Bajwa JS (1982) Capacity consideration in reliability analysis of communication systems. IEEE Trans Reliab 31:177–80CrossRef Aggarwal KK, Chopra YC, Bajwa JS (1982) Capacity consideration in reliability analysis of communication systems. IEEE Trans Reliab 31:177–80CrossRef
3.
Zurück zum Zitat Aggarwal KK, Gupta JS, Misra KB (1975) A simple method for reliability evaluation of a communication system. IEEE Trans Commun 23:563–565CrossRef Aggarwal KK, Gupta JS, Misra KB (1975) A simple method for reliability evaluation of a communication system. IEEE Trans Commun 23:563–565CrossRef
4.
Zurück zum Zitat Chen SG (2020) Computation in network reliability. In: Pham H (ed) Reliability and statistical computing. Springer, pp 107–126 Chen SG (2020) Computation in network reliability. In: Pham H (ed) Reliability and statistical computing. Springer, pp 107–126
5.
Zurück zum Zitat Chen SG (2012) An optimal capacity assignment for the robust design problem in capacitated flow networks. Appl Math Model 36(11):5272–5282MathSciNetCrossRef Chen SG (2012) An optimal capacity assignment for the robust design problem in capacitated flow networks. Appl Math Model 36(11):5272–5282MathSciNetCrossRef
6.
Zurück zum Zitat Chen SG (2014) Reduced recursive inclusion-exclusion principle for the probability of union events. In: 2014 IEEE international conference on industrial engineering and engineering management, Selangor, Malaysia, pp 1–3 Chen SG (2014) Reduced recursive inclusion-exclusion principle for the probability of union events. In: 2014 IEEE international conference on industrial engineering and engineering management, Selangor, Malaysia, pp 1–3
7.
Zurück zum Zitat Chen SG (2014) Reduced recursive sum of disjoint product in network reliability. In: 2014 the 20th ISSAT international conference on reliability and quality in design, Seattle, Washington, USA, pp 170–173 Chen SG (2014) Reduced recursive sum of disjoint product in network reliability. In: 2014 the 20th ISSAT international conference on reliability and quality in design, Seattle, Washington, USA, pp 170–173
8.
Zurück zum Zitat Chen SG (2015) Search for all MCs with backtracking. Int J Reliab Qual Perform 6(2):101–106 Chen SG (2015) Search for all MCs with backtracking. Int J Reliab Qual Perform 6(2):101–106
9.
Zurück zum Zitat Chen SG (2018) A novel approach to search for all solutions of a non-negative linear Diophantine equation. In: 24th ISSAT international conference on reliability and quality in design, pp 55–57 Chen SG (2018) A novel approach to search for all solutions of a non-negative linear Diophantine equation. In: 24th ISSAT international conference on reliability and quality in design, pp 55–57
10.
Zurück zum Zitat Chen SG, Lin YK (2012) Search for all minimal paths in a general large flow network. IEEE Trans Reliab 61(4):949–956CrossRef Chen SG, Lin YK (2012) Search for all minimal paths in a general large flow network. IEEE Trans Reliab 61(4):949–956CrossRef
11.
Zurück zum Zitat Chen SG, Lin YK (2020) A permutation-and-backtrack approach for reliability evaluation in multistate information networks. Appl Math Comput 373:125024 Chen SG, Lin YK (2020) A permutation-and-backtrack approach for reliability evaluation in multistate information networks. Appl Math Comput 373:125024
12.
Zurück zum Zitat Colbourn CJ (1987) The combinatorics of network reliability. Oxford University Press, UK Colbourn CJ (1987) The combinatorics of network reliability. Oxford University Press, UK
13.
Zurück zum Zitat Ford LR, Fulkerson DR (1962) Flows in networks. Princeton University Press, NJMATH Ford LR, Fulkerson DR (1962) Flows in networks. Princeton University Press, NJMATH
14.
Zurück zum Zitat Jane CC, Lin JS, Yuan J (1993) On reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Trans Reliab 42:354–361, 368 Jane CC, Lin JS, Yuan J (1993) On reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Trans Reliab 42:354–361, 368
15.
Zurück zum Zitat Jasmon GB, Foong KW (1987) A method for evaluating all the minimal cuts of a graph. IEEE Trans Reliab R-36:538–545 Jasmon GB, Foong KW (1987) A method for evaluating all the minimal cuts of a graph. IEEE Trans Reliab R-36:538–545
16.
Zurück zum Zitat Lee SH (1980) Reliability evaluation of a flow network. IEEE Trans Reliab 29:24–26CrossRef Lee SH (1980) Reliability evaluation of a flow network. IEEE Trans Reliab 29:24–26CrossRef
17.
Zurück zum Zitat Lin JS, Jane CC, Yuan J (1995) On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks 25:131–138CrossRef Lin JS, Jane CC, Yuan J (1995) On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks 25:131–138CrossRef
18.
Zurück zum Zitat Lin YK (2001) On reliability evaluation of a stochastic-flow network in terms of minimal cuts. J Chin Inst Ind Eng 18:49–54 Lin YK (2001) On reliability evaluation of a stochastic-flow network in terms of minimal cuts. J Chin Inst Ind Eng 18:49–54
19.
Zurück zum Zitat Lin YK (2001) A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Comput Oper Res 28(13):1277–1285MathSciNetCrossRef Lin YK (2001) A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Comput Oper Res 28(13):1277–1285MathSciNetCrossRef
20.
Zurück zum Zitat Lin YK, Chen SG (2019) An efficient searching method for minimal path vectors in multi-state networks. Ann Oper Res 1–12 Lin YK, Chen SG (2019) An efficient searching method for minimal path vectors in multi-state networks. Ann Oper Res 1–12
21.
Zurück zum Zitat Roberts FS, Tesman B (2009) Applied combinatorics, 2nd edn. CRC Press Roberts FS, Tesman B (2009) Applied combinatorics, 2nd edn. CRC Press
22.
Zurück zum Zitat Schrijver A (2002) On the history of the transportation and maximum flow problems. Math Program 91(3):437–445MathSciNetCrossRef Schrijver A (2002) On the history of the transportation and maximum flow problems. Math Program 91(3):437–445MathSciNetCrossRef
23.
Zurück zum Zitat Shen Y (1995) A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectron Reliab 35:973–976CrossRef Shen Y (1995) A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectron Reliab 35:973–976CrossRef
24.
Zurück zum Zitat Xue J (1985) On multistate system analysis. IEEE Trans Reliab 34(4):329–337 Xue J (1985) On multistate system analysis. IEEE Trans Reliab 34(4):329–337
25.
Zurück zum Zitat Yeh WC (2001) A simple algorithm to search for all \( d \)-MPs with unreliable nodes. Reliab Eng Syst Saf 73:49–54CrossRef Yeh WC (2001) A simple algorithm to search for all \( d \)-MPs with unreliable nodes. Reliab Eng Syst Saf 73:49–54CrossRef
26.
Zurück zum Zitat Yeh WC (2001) A simple approach to search for all \( d \)-MCs of a limited-flow network. Reliab Eng Syst Saf 71:15–19CrossRef Yeh WC (2001) A simple approach to search for all \( d \)-MCs of a limited-flow network. Reliab Eng Syst Saf 71:15–19CrossRef
27.
Zurück zum Zitat Yeh WC (2002) A simple method to verify all \( d \)-minimal path candidates of a limited-flow network and its reliability. Int J Adv Manuf Technol 20(1):77–81CrossRef Yeh WC (2002) A simple method to verify all \( d \)-minimal path candidates of a limited-flow network and its reliability. Int J Adv Manuf Technol 20(1):77–81CrossRef
28.
29.
Zurück zum Zitat Yeh WC (2007) A simple heuristic algorithm for generating all minimal paths. IEEE Trans Reliab 56(3):488–494CrossRef Yeh WC (2007) A simple heuristic algorithm for generating all minimal paths. IEEE Trans Reliab 56(3):488–494CrossRef
30.
Zurück zum Zitat Zuo MJ, Tian Z, Huang HZ (2007) An efficient method for reliability evaluation of multistate networks given all minimal path vectors. IIE Trans 39:811–817CrossRef Zuo MJ, Tian Z, Huang HZ (2007) An efficient method for reliability evaluation of multistate networks given all minimal path vectors. IIE Trans 39:811–817CrossRef
Metadaten
Titel
The New Attempt of Network Reliability in the Assessment of Business Activities for Precision Management
verfasst von
Shin-Guang Chen
Copyright-Jahr
2022
DOI
https://doi.org/10.1007/978-3-030-93623-5_6

Premium Partner