Article ID: | iaor20121144 |
Volume: | 62 |
Issue: | 1 |
Start Page Number: | 1 |
End Page Number: | 12 |
Publication Date: | Feb 2012 |
Journal: | Computers & Industrial Engineering |
Authors: | Kim Yongbeom, Kim Won Kyung, Yoon K Paul, Bronson Gary J |
Keywords: | simulation: applications, stochastic processes |
An activity network with returning loop activities has a wide variety of applications, but can cause a heavy computational burden for large networks. Moreover, if an activity processing time and/or the probability of taking a particular activity changes when the number of activity visits is added, the computation is very complicated and difficult. We propose a simulation approach to deal with stochastic activity networks consisting of multiple terminal nodes, no limit on looping activities, non‐constant activity selection probabilities, and non‐deterministic activity times following arbitrary distributions. Probability and time control functions are introduced to reflect the acceleration, or learning effect, of repeated activities. Performance measures such as system success/failure probabilities, time to completion/success/failure times, time between success/failure, and the