Intractability results in discrete-event simulation

DOI10.1051/RO/1995290303531MaRDI QIDQ4883003zbMATH OpenOpenAlexFDO

Authors Sheldon H. Jacobson, Enver Yücesan

Publication date 7 April 1997

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105113

zbMATH Keywords

computational complexitymodel buildingNP-hardsimulation modelingdiscrete-event systeminterruptpolynomial Turing reductionsstrong permutationweak permutation

Mathematics Subject Classification ID

Applications of statistics to economics (62P20) Probabilistic methods, stochastic differential equations (65C99) Complexity and performance of numerical algorithms (65Y20) Search theory (90B40)

Recommendations

• Computational issues for accessibility in discrete event simulation
• On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models
• Exact, analytic, and locally approximate solutions to discrete event-simulation problems
• Simplifying the modeling of multiple activities, multiple queuing, and interruptions
• Parallelism analyzers for parallel discrete event simulation

Cited in

(2)

• On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models
• Computational issues for accessibility in discrete event simulation

This page was built for publication: Intractability results in discrete-event simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883003)