The complexity of rapid learning in discrete event simulation.: An article from: IIE Transactions
Book Details
Author(s)Enver Yucesan, Sheldon H. Jacobson
ISBN / ASINB00097TDQQ
ISBN-13978B00097TDQ8
AvailabilityAvailable for download now
MarketplaceUnited States 🇺🇸
Description
This digital document is an article from IIE Transactions, published by Institute of Industrial Engineers, Inc. (IIE) on September 1, 1997. The length of the article is 6790 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.
From the author: 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.
Citation Details
Title: The complexity of rapid learning in discrete event simulation.
Author: Enver Yucesan
Publication:IIE Transactions (Refereed)
Date: September 1, 1997
Publisher: Institute of Industrial Engineers, Inc. (IIE)
Volume: v29 Issue: n9 Page: p783(8)
Distributed by Thomson Gale
From the author: 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.
Citation Details
Title: The complexity of rapid learning in discrete event simulation.
Author: Enver Yucesan
Publication:IIE Transactions (Refereed)
Date: September 1, 1997
Publisher: Institute of Industrial Engineers, Inc. (IIE)
Volume: v29 Issue: n9 Page: p783(8)
Distributed by Thomson Gale
