Article ID: | iaor20011071 |
Country: | United States |
Volume: | 47 |
Issue: | 3 |
Start Page Number: | 476 |
End Page Number: | 481 |
Publication Date: | May 1999 |
Journal: | Operations Research |
Authors: | Jacobson Sheldon H., Ycesan Enver |
This paper uses computational complexity theory to assess the difficulty of various discrete event simulation problems. More specifically, accessibility of states, ordering of events, noninterchangeability of model implementations, and execution stalling for discrete event simulations are formally stated as search problems and proven to be