A stochastic model to study the system capacity for supply chains in terms of minimal cuts

International Journal of Production Economics

Volumn 124, Issue 1, 2010, Pages 181-187

  Lin, Yi Kuei ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Capacity weight; p commodity stochastic flow networks; Supply chain; System capacity; Unreliable node

Indexed keywords

EFFICIENT ALGORITHM; MAXIMUM FLOWS; MINIMAL CUTS; PERFORMANCE INDICES; STOCHASTIC FLOW NETWORKS; SUPPLY CHAIN SYSTEMS; SYSTEM CAPACITY; UPPER BOUND; UPPER BOUNDARY;

ALGORITHMS; HIGH ENERGY PHYSICS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; SUPPLY CHAIN MANAGEMENT;

SUPPLY CHAINS;

EID: 74549212451     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2009.10.022     Document Type: Article

References (29)

1. Aggarwal K.K., Gupta J.S., and Misra K.B. A simple method for reliability evaluation of a communication system. IEEE Transactions on Communications 23 (1975) 563-565
2. Al-Ghanim A.M. A heuristic technique for generating minimal paths and cutsets of a general network. Computers and Industrial Engineering 36 (1999) 45-55
3. Assad A.A. Multicommodity network flows-a survey. Networks 8 (1978) 37-91
4. Bailey K., and Francis M. Managing information flows for improved value chain performance. International Journal of Production Economics 111 (2008) 2-12
5. Fard N.S., and Lee T.H. Cutest enumeration of network systems with link and node failures. Reliability Engineering & System Safety 65 (1999) 141-146
6. Ford L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton University Press
7. Ford L.R., and Fulkerson D.R. A suggested computation for maximal multicommodity network flows. Management Science 20 (1974) 822-844
8. Griffith W.S. Multistate reliability models. Journal of Applied Probability 17 (1980) 735-744
9. Held M., Wolfe P., and Crowder H.P. Validation of subgradient optimization. Mathematical Programming 6 (1974) 62-88
10. Hu T.C. Multi-commodity network flows. Operations Research 11 (1963) 344-360
11. Jane C.C., Lin J.S., and Yuan J. On reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Transactions on Reliability 42 (1993) 354-361
12. Jarvis J.J. On the equivalence between the node-arc and arc-chain formulations for the multi-commodity maximal flow problem. Naval Research Logistics Quarterly 16 (1969) 525-529
13. Lin J.S., Jane C.C., and Yuan J. On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks 25 (1995) 131-138
14. Lin J.S. Reliability evaluation of capacitated-flow networks with budget constraints. IIE Transactions 30 (1998) 1175-1180
15. Lin Y.K. On reliability evaluation of a stochastic-flow network in terms of minimal cuts. Journal of Chinese Institute of Industrial Engineers 18 (2001) 49-54
16. Lin Y.K. Study on the multicommodity reliability of a capacitated-flow network. Computers & Mathematics with Applications 42 (2001) 255-264
17. Lin Y.K. Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs. Reliability Engineering & System Safety 75 (2002) 41-46
18. Lin Y.K. Reliability of a stochastic-flow network with unreliable branches & nodes under budget constraints. IEEE Transactions on Reliability 53 (2004) 381-387
19. Lin Y.K. Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts. Reliability Engineering & System Safety 91 (2006) 539-545
20. Lin Y.K. Reliability evaluation for an information network with node failure under cost constraint. IEEE Transactions on Systems, Man and Cybernetics-Part A: Systems and Humans 37 (2007) 180-188
21. Lin Y.K. Performance evaluation for the logistics system in case that capacity weight varies from arcs and types of commodity. International Journal of Production Economics 107 (2007) 572-580
22. Lin Y.K. On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint. European Journal of Operational Research 176 (2007) 347-360
23. Rothechild B., and Whinston A. On two commodity network flows. Operations Research 14 (1966) 377-387
24. Shen Y. A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectronics and Reliability 35 (1995) 973-976
25. Xue J. On multistate system analysis. IEEE Transactions on Reliability 34 (1985) 329-337
26. Yeh W.C. A revised layered-network algorithm to search for all d-Minpaths of a limited-flow acyclic network. IEEE Transactions on Reliability 47 (1998) 436-442
27. Yeh W.C. A simple approach to search for all d-MCs of a limited-flow network. Reliability Engineering & System Safety 71 (2001) 15-19
28. Yeh W.C. Multistate network reliability evaluation under the maintenance cost constraint. International Journal of Production Economics 88 (2004) 73-83
29. Yeh W.C. A new approach to evaluate reliability of multistate networks under the cost constraint. Omega 33 (2005) 203-209