{"title":"Empirical make-or-buy decision making model in the Japanese automobile industry","authors":"Nguyen Dang Minh","doi":"10.1109/WSC.2011.6147793","DOIUrl":"https://doi.org/10.1109/WSC.2011.6147793","url":null,"abstract":"The decision on whether Japanese automobile companies produce crucial components in-house or outsource them is complicated and time-consuming topic within the industry. In response to questions about the use of a make or buy model as part of a scientific decision making process for the issue, industrialists had the same answer that the final decision on make or buy has been made for the most part based on experiences and various discussions, and that no models were used. The main purpose of this paper is to propose a model for a make or buy decision from an empirical point of view. The model was developed as the Analytic Hierarchy Process (AHP) method in which the main criteria and sub-criteria were summarized from practical interviews with Japanese automobile industrialists. The proposed model also was applied in an actual project to confirm the feasibility of the model.","PeriodicalId":246140,"journal":{"name":"Proceedings of the 2011 Winter Simulation Conference (WSC)","volume":"478 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122744869","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":"Panel discussion: Integrating data from multiple simulation models of different fidelity","authors":"D. Bingham, C. Reese, B. Williams","doi":"10.5555/2431518.2431693","DOIUrl":"https://doi.org/10.5555/2431518.2431693","url":null,"abstract":"Computer models are used to simulate physical processes in almost all areas of science and engineering. A single evaluation of these computation models (or computer codes) can take as little as a few seconds or as long as weeks or months. In either case, experimenters use the model outputs to learn something about the physical system. In some settings, outputs from several computational models, with varying levels of fidelity, are available to researchers. In addition, observations from the physical system may also be in hand. In this panel discussion we address issues relating to model formulation, estimation, prediction and extrapolation using multi-fidelity computer models are addressed. In the first presentation, Bayesian methods are used to build a predictive model using low and high fidelity computational models with different inputs and also field observations. The second presentation deals with the difficult computational issues facing computer model calibration and prediction using a Bayesian framework that are typically remedied through the use of Markov Chain Monte Carlo techniques. While the computational burden is substantial, we review faster alternatives to standard MCMC techniques that are particularly useful in the multi-fidelity simulator problem. In the final presentation, calibration of computational models is discussed in the context of validation and extrapolation, with introduction to developments in stochastic model calibration.","PeriodicalId":246140,"journal":{"name":"Proceedings of the 2011 Winter Simulation Conference (WSC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122846841","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":"Greedy servers on a torus","authors":"Karl W. Stacey, Dirk P. Kroese","doi":"10.1109/WSC.2011.6147764","DOIUrl":"https://doi.org/10.1109/WSC.2011.6147764","url":null,"abstract":"Queuing systems in which customers arrive at a continuum of locations, rather than at a finite number of locations, have been found to provide good models for certain telecommunication and reliability systems as well as dynamic stochastic vehicle routing problems. In this paper the continuum is the unit square, where the opposite edges have been glued together to form a flat “torus”. Customers arrive according to a Poisson process with arrival rate λ and are removed by servers. We investigate properties of the system under various server strategies. We find that the greedy strategy, where a server simply heads for its closest point, results in a stable system and we analyze the equilibrium distribution. The greedy strategy is inefficient, in part because multiple greedy servers coalesce. We investigate the expected time until this occurs and identify improvements to the greedy strategy.","PeriodicalId":246140,"journal":{"name":"Proceedings of the 2011 Winter Simulation Conference (WSC)","volume":"661 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122963686","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":"Multivariate arrival rate estimation using semidefinite programming","authors":"D. Papp, F. Alizadeh","doi":"10.1109/WSC.2011.6147982","DOIUrl":"https://doi.org/10.1109/WSC.2011.6147982","url":null,"abstract":"An efficient method for the smooth estimation of the arrival rate of non-homogeneous, multi-dimensional Poisson processes from inexact arrivals is presented. The method provides a piecewise polynomial spline estimator. It is easily parallelized, and it exploits the sparsity of the neighborhood structure of the underlying spline space; as a result, it is very efficient and scalable. Numerical illustration is included.","PeriodicalId":246140,"journal":{"name":"Proceedings of the 2011 Winter Simulation Conference (WSC)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114147702","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":"Combining simulation allocation and optimal splitting for rare-event simulation optimization","authors":"Ben Crain, Chun-Hung Chen, J. Shortle","doi":"10.1109/WSC.2011.6148090","DOIUrl":"https://doi.org/10.1109/WSC.2011.6148090","url":null,"abstract":"This paper presents research toward generalizing the optimization of the allocation of simulation replications to an arbitrary number of designs, when the problem is to maximize the Probability of Correct Selection among designs, the best design being the one with the smallest probability of a rare event. The simulation technique within each design is an optimized version of the splitting method. An earlier work solved this problem for the special case of two designs. In this paper an alternative two-stage approach is examined in which, at the first stage, allocations are made to the designs by a modified version of the Optimal Computing Budget Allocation. At the second stage the allocation among the splitting levels within each design is optimized. Our approach is shown to work well on a two-tandem queuing model.","PeriodicalId":246140,"journal":{"name":"Proceedings of the 2011 Winter Simulation Conference (WSC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114592105","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}
U. Clausen, Jan Kaffka, Daniel Diekmann, Larissa Mest
{"title":"Impact of different unloading zone locations in transshipment terminals under various forklift dispatching rules","authors":"U. Clausen, Jan Kaffka, Daniel Diekmann, Larissa Mest","doi":"10.1109/WSC.2011.6147882","DOIUrl":"https://doi.org/10.1109/WSC.2011.6147882","url":null,"abstract":"Operators of less-than-truckload terminals face the challenge of improving their efficiency to reduce handling costs and increase the performance of the terminal due to small profit margins. This paper uses material flow simulation to address the impact of different operational levers on a forklift-based internal transportation system. For a given I-shaped terminal two concepts of locating unloading zones are compared and evaluated concerning travel time of forklifts. In addition, different dispatching rules for the forklifts are implemented to reduce the empty travel time of the forklift and identify the potential for improvement based on a distance-optimized fleet control.","PeriodicalId":246140,"journal":{"name":"Proceedings of the 2011 Winter Simulation Conference (WSC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122105189","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}
Adrian Ramirez Nafarrate, John W. Fowler, Teresa Wu
{"title":"Design of centralized Ambulance Diversion policies using Simulation-Optimization","authors":"Adrian Ramirez Nafarrate, John W. Fowler, Teresa Wu","doi":"10.1109/WSC.2011.6147846","DOIUrl":"https://doi.org/10.1109/WSC.2011.6147846","url":null,"abstract":"Ambulance Diversion (AD) has been an issue of concern for the medical community because of the potential harmful effects of long transportation; however, AD can be used to reduce the waiting time in Emergency Departments (EDs) by redirecting patients to less crowded facilities. This paper proposes a Simulation-Optimization approach to find the appropriate parameters of diversion policies for all the facilities in a geographical area to minimize the expected time that patients spend in non-value added activities, such as transporting, waiting and boarding. In addition, two destination policies are tested in combination with the AD policies. The use of diversion and destination policies can be seen as ambulance flow control within an emergency care system. The results of this research show significant improvement in the flow of emergency patients in the system as a result of the optimization of destination-diversion policies compared to not using AD at all.","PeriodicalId":246140,"journal":{"name":"Proceedings of the 2011 Winter Simulation Conference (WSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117329092","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 analysis for ERP conducted in Japanese SMEs using the concept of MFCA","authors":"Xuzhong Tang, S. Takakuwa","doi":"10.1109/WSC.2011.6147831","DOIUrl":"https://doi.org/10.1109/WSC.2011.6147831","url":null,"abstract":"Small and medium-sized enterprises (SMEs), which have limited resources, spend the majority of their time on routine business and have difficulty pursuing goals beyond economic efficiency, such as environmental preservation. In this study, using the concept of Material Flow Cost Accounting (MFCA), a simulation model for the Enterprise Resource Planning (ERP) business flow of a Japanese electronic related manufacturing SME was constructed, and the hidden problems of stock shortage and dead stock were actualized. By analyzing the causes of these problems and by using a tool called Arena OptQuest, an appropriate materials purchasing plan was determined for the company. This solution will improve production efficiency and reduce the dead stock that causes a negative environmental impact. As a result, an improvement in both economic and environmental performance can be achieved.","PeriodicalId":246140,"journal":{"name":"Proceedings of the 2011 Winter Simulation Conference (WSC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128417975","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 combined deterministic and sampling-based sequential bounding method for stochastic programming","authors":"Péguy Pierre-Louis, G. Bayraksan, D. Morton","doi":"10.1109/WSC.2011.6148105","DOIUrl":"https://doi.org/10.1109/WSC.2011.6148105","url":null,"abstract":"We develop an algorithm for two-stage stochastic programming with a convex second stage program and with uncertainty in the right-hand side. The algorithm draws on techniques from bounding and approximation methods as well as sampling-based approaches. In particular, we sequentially refine a partition of the support of the random vector and, through Jensen's inequality, generate deterministically valid lower bounds on the optimal objective function value. An upper bound estimator is formed through a stratified Monte Carlo sampling procedure that includes the use of a control variate variance reduction scheme. The algorithm lends itself to a stopping rule theory that ensures an asymptotically valid confidence interval for the quality of the proposed solution. Computational results illustrate our approach.","PeriodicalId":246140,"journal":{"name":"Proceedings of the 2011 Winter Simulation Conference (WSC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128352847","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}
Dashi I. Singham, Meredith Therkildsen, L. Schruben
{"title":"Applications of flocking algorithms to input modeling for agent movement","authors":"Dashi I. Singham, Meredith Therkildsen, L. Schruben","doi":"10.1109/WSC.2011.6147953","DOIUrl":"https://doi.org/10.1109/WSC.2011.6147953","url":null,"abstract":"Simulation flocking has been introduced as a method for generating simulation input from multivariate dependent time series for sensitivity and risk analysis. It can be applied to data for which a parametric model is not readily available or imposes too many restrictions on the possible inputs. This method uses techniques from agent-based modeling to generate a flock of boids that follow the data. In this paper, we apply simulation flocking to a border crossing scenario to determine if waypoints simulated from flocking can be used to provide improved information on the number of hostiles successfully crossing the border. Analysis of the output reveals scenario limitations and potential areas of improvement in the patrol strategy.","PeriodicalId":246140,"journal":{"name":"Proceedings of the 2011 Winter Simulation Conference (WSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129450735","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}