The complexity of rapid learning in discrete event simulation

Enver Yücesan, Sheldon H. Jacobson

Research output: Contribution to journalArticlepeer-review

Abstract

Sensitivity analysis and optimization of discrete event simulation models require the ability to efficiently estimate performance measures under different parameter settings. One technique, termed rapid learning, aims at enumerating all possible sample paths of such models. There are two necessary conditions for this capability: observability and constructability. This paper shows that the verification of the observability condition is an NP-hard search problem; this result encourages the development of heuristic procedures to validate the applicability of rapid learning. Further implications are also discussed.

Original languageEnglish (US)
Pages (from-to)783-790
Number of pages8
JournalIIE Transactions (Institute of Industrial Engineers)
Volume29
Issue number9
DOIs
StatePublished - 1997
Externally publishedYes

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'The complexity of rapid learning in discrete event simulation'. Together they form a unique fingerprint.

Cite this