Abstract
Building computational models of real world systems usually requires the interaction of decision modules and simulation modules. Given different models and algorithms, the major hurdles in building a principled and robust system are model composibility and algorithm interoperability. We describe an approach to the composibility problem including initial results. This exposition is given in the context of Linear Programming as the decision technique and Discrete Event Simulation as the simulation technique, both applied to the design and operation of semiconductor supply/demand networks.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - Winter Simulation Conference |
Editors | R.G. Ingalls, M.D. Rossetti, J.S. Smith, B.A. Peters |
Pages | 232-239 |
Number of pages | 8 |
Volume | 1 |
State | Published - 2004 |
Event | Proceedings of the 2004 Winter Simulation Conference - Washington, DC, United States Duration: Dec 5 2004 → Dec 8 2004 |
Other
Other | Proceedings of the 2004 Winter Simulation Conference |
---|---|
Country/Territory | United States |
City | Washington, DC |
Period | 12/5/04 → 12/8/04 |
ASJC Scopus subject areas
- Engineering(all)