Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/14060
Title: | A general framework on the computing budget allocation problem | Authors: | PUVANESWARI A/P MANIKAM | Keywords: | Simulation, Ranking and Selection, Optimal Computing Budget Allocation, Assemble-to-Order, Sample Average Approximation | Issue Date: | 14-Jun-2004 | Citation: | PUVANESWARI A/P MANIKAM (2004-06-14). A general framework on the computing budget allocation problem. ScholarBank@NUS Repository. | Abstract: | Because the design space is huge in many real world problems, estimation of performance measure has to rely on simulation which is time-consuming. Hence it is important to decide how to sample the design space, how many designs to sample and for how long to run each design alternative within a given computing budget. In our work, we propose an approach for making these allocation decisions. This approach is then applied to the problem of assemble-to-order (ATO) systems where the sampling average approximation (SAA) is used as a sampling method. The numerical results show that this approach provides a good basis for decisions. | URI: | http://scholarbank.nus.edu.sg/handle/10635/14060 |
Appears in Collections: | Master's Theses (Open) |
Show full item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
Puvaneswari M.pdf | 660.54 kB | Adobe PDF | OPEN | None | View/Download |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.