Study on longer and shorter boundary duration vectors with arbitrary duration and cost values

Journal of the Operations Research Society of Japan

Volumn 50, Issue 2, 2007, Pages 73-81

  Lin, Yi Kuei ^a  

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

Author keywords

Activity cost; Activity duration; Minimal path; Project planning; Upper and lower boundary vectors

Indexed keywords

EID: 34547798942     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.50.73     Document Type: Article

References (14)

1. C. Alexopoulos: A note on state-space decomposition methods for analyzing stochastic flow networks. IEEE Transactions on Reliability, 44 (1995), 354-357.
2. A.G. AM: A heuristic technique for generating minimal path and cutsets of a general network. Computers and Industrial Engineering, 36 (1999), 45-55.
3. P. Doulliez and J. Jamoulle: Transportation networks with random arc capacities. RAIRO, Recherche Operationnelle Operations Research, 3 (1972), 45-60.
4. J. Gido and J.P. Clements: Successful Project Management (South-western college publishing, Ohio, 1999).
5. F.S. Hiller and G.J. Liberman: Introduction to Operations Research (McGraw-Hill, NY, 2001).
6. K. Kobayashi and H. Yamamoto: A new algorithm in enumerating all minimal paths in a sparse network. Reliability Engineering and System Safety, 65 (1999), 11-15.
7. Y.K. Lin and J. Yuan: A new algorithm to generate d-minimal paths in a multistate flow network with non-integer arc capacities. International Journal of Reliability, Quality and Safety Engineering, 5 (1998), 269-285.
8. Y.K. Lin: A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Computers and Operations Research, 28-13 (2001), 1277-1285.
9. Y.K. Lin: Reliability evaluation for a multi-commodity flow model under budget constraint. Journal of the Chinese Institute of Engineers, 25 (2002), 109-116.
10. Y.K. Lin: Find all longer and shorter boundary duration vectors under project time and budget constraints. Journal of the Operations Research Society of Japan, 45 (2002), 260-267.
11. Y.K. Lin: Reliability of a stochastic-flow network with unreliable branches & nodes under budget constraints. IEEE Transactions on Reliability, 53-5 (2004), 381-387.
12. Y. Shen: A new simple algorithm fir enumerating all minimal paths and cuts of a graph. Microelectronics and Reliability, 35-6 (1995), 973-976.
13. W.C. Yeh: A simple algorithm to search for all d-MPs with unreliable nodes. Reliability Engineering and System Safety, 73 (2001), 49-54.
14. W.C. Yeh: A simple approach to search for all d-MCs of a limited-flow network. Reliability Engineering and System Safety, 71 (2001), 15-19.