{"title":"A resource reconciliation mechanism for a manufacturing federation coordinated using an MRP/ERP system","authors":"Seungyub Lee, R. Wysk","doi":"10.1109/WSC.2004.1371433","DOIUrl":"https://doi.org/10.1109/WSC.2004.1371433","url":null,"abstract":"This paper presents a top-down mechanism for coordinating distributed discrete event simulation (DDES) models using an MRP/ERP system as the federation coordinator. The same MRP/ERP system, which is typically used as a coordination tool for interactions between complex highly variable manufacturing systems, serves to coordinate and synchronize complex highly variable simulation models of these same systems. This research focuses on enabling each system entity modeled by DDES models to constantly correct its performance with respect to reference trajectories which consist of planned orders and the size of a time bucket generated by an MRP/ERP system, and trigger a global coordinator which consists of the MRP/ERP system and adapter if necessitated by any discrepancies observed by the entity through simulation models. A global coordinator can synchronize timing of DDES models and provide adaptive time buckets using the cost-based mathematical model and corrected plans using the updated time bucket.","PeriodicalId":257599,"journal":{"name":"Proceedings of the 2004 Winter Simulation Conference, 2004.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115448613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Hats Simulator","authors":"P. Cohen, C. Morrison","doi":"10.1109/WSC.2004.1371399","DOIUrl":"https://doi.org/10.1109/WSC.2004.1371399","url":null,"abstract":"The Hats Simulator is designed to be a lightweight proxy for many intelligence analysis problems, and thus a test environment for analysts' tools. It is a virtual world in which many agents engage in individual and collective activities. Most agents are benign, some intend harm. Agent activities are planned by a generative planner. Playing against the simulator, the job of the analyst is to find harmful agents before they carry out their plans. The simulator maintains information about all agents. However, information is hidden from the analyst and some is expensive. After each game, the analyst is assessed a set of scores including the cost of acquiring information about agents, the cost of falsely accusing benign agents, and the cost of failing to detect harmful agents. The simulator is implemented and currently manages the activities of up to one hundred thousand agents.","PeriodicalId":257599,"journal":{"name":"Proceedings of the 2004 Winter Simulation Conference, 2004.","volume":"30 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120938901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Web based evaluation of material handling alternatives for automated manufacturing: a parallel replications approach","authors":"W. Biles, John Brian Casebier","doi":"10.1109/WSC.2004.1371494","DOIUrl":"https://doi.org/10.1109/WSC.2004.1371494","url":null,"abstract":"This paper describes the application of a master/slave configuration of processors to study a comparison of alternative material handling configurations for automated manufacturing. Such a study usually requires a large number of simulation replications, and carrying out those replications on a multi-processor platform yields significant savings in elapsed time. In the present application, a master processor carries out the statistical computations for a 2k factorial design on up to eight slave processors. This paper will compare the results from using two, four and eight processors.","PeriodicalId":257599,"journal":{"name":"Proceedings of the 2004 Winter Simulation Conference, 2004.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125171156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A simulation methodology in modeling cell divisions with stochastic effects","authors":"H. Rajasimha, D. Samuels, R. Nance","doi":"10.1109/WSC.2004.1371566","DOIUrl":"https://doi.org/10.1109/WSC.2004.1371566","url":null,"abstract":"We present a model to explain the effects of the long time between blood stem cell divisions and rapid cascades of progenitor cell divisions on the mitochondrial DNA drift. We allow four stochastic events in the system namely, mtDNA replication and degradation, cell division and death. To implement the conceptual model, we design two simulation models; one for a limited number of stem cells (20,000) over very long time scale (100 years) and another for the cell divisions of a progenitor cell resulting in a large number of blood cells (/spl sim/10 million) over a shorter time span (25 days). Iterative enhancement with incremental builds constitutes the modeling methodology. We adopt the activity scanning conceptual framework for the model implementation. Initial transient and memory issues are resolved. By output data analysis, we conclude that the variation in mutation level occurs significantly due to time and less so due to cell divisions.","PeriodicalId":257599,"journal":{"name":"Proceedings of the 2004 Winter Simulation Conference, 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126064241","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Teaching regression with simulation","authors":"John H. Walker","doi":"10.1109/WSC.2004.1371575","DOIUrl":"https://doi.org/10.1109/WSC.2004.1371575","url":null,"abstract":"Computer simulations can be used to teach complicated statistical concepts in linear regression more quickly and effectively than traditional lecture alone. In introductory applied statistics classes, the coverage of important statistical topics, such as the nature of the sampling distribution of the simple linear regression slope, the problem of multicollinearity in multiple linear regression, or the danger of extrapolation in predictions from multiple linear regression models, may be shortened or eliminated entirely for lack of time. Simulation can provide a way to introduce these topics in a brief, but memorable, way for introductory students or as the first step in a more thorough treatment for higher level students. This paper describes each simulation, discusses its pedagogical advantages, and gives sample computer output.","PeriodicalId":257599,"journal":{"name":"Proceedings of the 2004 Winter Simulation Conference, 2004.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125427285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Airport terminal-approach safety and capacity analysis using an agent-based model","authors":"Yue Xie, J. Shortle, G. Donohue","doi":"10.1109/WSC.2004.1371471","DOIUrl":"https://doi.org/10.1109/WSC.2004.1371471","url":null,"abstract":"The consistent growth of air traffic demand is causing the operational volumes at hub airports to approach their maximum capacities. With this growth, delays are increasing, and safety is becoming a more crucial problem. The terminal approaching and landing phases are especially important since the airspace is more crowded and operational procedures are more complicated compared with the en route phase. We have developed an agent-based stochastic simulation model which is useful to analyze the relationship among airport arrival capacity, delay, and safety. We first present a simplified queue model to demonstrate key ideas. Then, we give a detailed agent-based model that is calibrated to Hartsfield Atlanta International Airport. We use the model to evaluate several operational scenarios and examine the trade-offs between system capacity and safety.","PeriodicalId":257599,"journal":{"name":"Proceedings of the 2004 Winter Simulation Conference, 2004.","volume":"322 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116541459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Simulation model of the telemedicine program","authors":"J. Lach, R. Vázquez","doi":"10.1109/WSC.2004.1371563","DOIUrl":"https://doi.org/10.1109/WSC.2004.1371563","url":null,"abstract":"The telemedicine program was created to provide medical assistance to people living in extreme poverty conditions in Mexico. Through a satellite connection, a physician located in Mexico City can diagnose the patient who is physically inspected on a mobile unit, equipped with telecommunications gear. The program's performance has brought positive results, and is starting to expand to farther regions. This paper explains how the program's processes were simulated on a specially designed logical-mathematical computer model in order to observe, and analyze the possible results generated when specific information of the model's parameters is introduced. The results shown by the model when different scenarios are being run, can be used as a powerful tool in the decision making process in order to optimize the program's performance by maximizing its utilization and efficiency, looking forward to incrementing its productivity.","PeriodicalId":257599,"journal":{"name":"Proceedings of the 2004 Winter Simulation Conference, 2004.","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122449224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Approximate time-parallel cache simulation","authors":"T. Kiesling","doi":"10.1109/WSC.2004.1371335","DOIUrl":"https://doi.org/10.1109/WSC.2004.1371335","url":null,"abstract":"In time-parallel simulation, the simulation time axis is decomposed into a number of slices, which are assigned to parallel processes for concurrent simulation. Although a promising parallelization technique, it is difficult to be applied. Recently, using approximation with time-parallel simulation has been proposed to extend the class of suitable models and to improve the performance of existing models. In trace-driven cache simulation, sequences of memory requests are processed to determine the performance of variously sized caches. Time-parallel simulation has been applied to trace-driven cache simulation, but only with limited scalability of the parallel algorithm. In order to solve the scaling problem, this work uses approximation with time-parallel cache simulation. Although introducing an uncertainty in the results, the approximate algorithms work in a way that result accuracy increases monotonically with time, allowing direct control of the quality of results. Experiments with a prototypical implementation indicate the viability of this approach.","PeriodicalId":257599,"journal":{"name":"Proceedings of the 2004 Winter Simulation Conference, 2004.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114132714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A generalized multiple response surface methodology for complex computer simulation applications","authors":"J. Schamburg, Donald E. Brown","doi":"10.1109/WSC.2004.1371414","DOIUrl":"https://doi.org/10.1109/WSC.2004.1371414","url":null,"abstract":"This work provides a generalization of the traditional response surface methodology (RSM) that can be applied to complex, multiobjective simulation studies. These problems involve a larger number of input variables, multiple measures of performance, and complex systems relationships. This multiple RSM approach capitalizes on the underlying learning philosophy of the traditional RSM while benefiting from other knowledge discovery concepts and data mining techniques. Furthermore it does not require the restrictive assumptions of the traditional RSM nor does it restrict the analyst to the traditional RSM techniques. Based on a variation of (Brown and Schamburg 2004) and (Schamburg 2004), a brief description of the generalized approach is provided. Then, the multiple response techniques are shown through an example application.","PeriodicalId":257599,"journal":{"name":"Proceedings of the 2004 Winter Simulation Conference, 2004.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117288338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A queueing network approximation of semiconductor automated material handling systems: how much information do we really need?","authors":"T. Roeder, N. Govind, L. Schruben","doi":"10.1109/WSC.2004.1371555","DOIUrl":"https://doi.org/10.1109/WSC.2004.1371555","url":null,"abstract":"Queueing networks are sometimes used to model material handling in flexible manufacturing systems. We explore the use of a closed queueing network model to approximate an intrabay automated material handling system (AMHS) in semiconductor manufacturing. Rather than solving the model analytically, we propose simulating it. Current industry models are very complex and require long development and run times. The simulated approximation can be used as an easy and fast alternative. To compare the approximation with the detailed models in use, we employ an information taxonomy to classify AMHS models based on the amount and types of information needed to model the system, and to obtain desired output. This classification aids modelers in determining the level of detail to incorporate in a model based on the objectives of the simulation study.","PeriodicalId":257599,"journal":{"name":"Proceedings of the 2004 Winter Simulation Conference, 2004.","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117296179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}