Virginia TechJacobson, Sheldon H.Yücesan, E.2014-05-142014-05-141995Jacobson, Sheldon H., and Yücesan, Enver. Charles S. Tapiero ("Guest editors"), ed. "Intractability results in discrete-event simulation." RAIRO - Operations Research - Recherche Opérationnelle 29.3 (1995): 353-369. <http://eudml.org/doc/105113>.0399-0559http://hdl.handle.net/10919/48023Simulation is often viewed as a modeling methodology of last resort. This is due to the lack of automated algorithms and procedures that exist to aid in the construction and analysis of simulation models. Jacobson and Yucesan (1994) present four structural issue search problems associated with simulation model building, and prove them to be NP-hard, hence intractable under the worst-case analysis of computational complexity theory. In this article, three new structural issue search problems are presented and proven to be NP-hard. The consequences and implications of these results are discussed.application/pdfenIn CopyrightSimulationModel buildingComputational complexityDiscrete eventSystemsOperations research & management scienceArticlehttps://eudml.org/doc/105113