{"title":"Method to model actions for discrete-event simulations of logistics networks","authors":"M. Rabe, Dominik Schmitt, Felix Dross","doi":"10.1109/WSC.2017.8248053","DOIUrl":"https://doi.org/10.1109/WSC.2017.8248053","url":null,"abstract":"Managers of logistics networks have the complex task of continuously maintaining their network in good operating conditions under a changing environment. Thus, they need to identify promising actions to adapt and improve the logistics network. Such actions could be the relocation of stock or the adjustment of transport relations. In order to support the managers, the authors have previously proposed a decision support system (DSS) based on discrete-event simulation (DES). The DSS automatically examines possible actions and suggests the best actions found to the managers. Since a data-driven DES approach is used for this DSS, all actions can be described as changes to a database. In this paper, an approach for modeling, integrating and executing user-generated actions into the DSS is described, in order to increase its flexibility and usability. In conclusion, the authors propose to develop a domain-specific modeling language for modeling actions for DES models.","PeriodicalId":145780,"journal":{"name":"2017 Winter Simulation Conference (WSC)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124707605","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":"Time-parallel simulation of air traffic networks","authors":"Young Jin Kim, D. Mavris, R. Fujimoto","doi":"10.1109/WSC.2017.8247851","DOIUrl":"https://doi.org/10.1109/WSC.2017.8247851","url":null,"abstract":"Air traffic management is widely studied in several different fields because of its complexity and criticality to a variety of stakeholders. However, the exploding amount of air traffic in recent years has created new challenges to ensure effective management of the airspace. A fast time simulation capability is essential to effectively explore the consequences of decisions of air traffic management. A new algorithm for simulating air traffic networks using a time-parallel simulation approach is proposed that distributes time segments of the simulation scenarios across different processors. A simulation model for the National Airspace System (NAS) is described and validated. The components of the simulator are described as well as the parallel simulation algorithms. Experimental results utilizing real-world traffic data for the continental U.S. are presented demonstrating the speed ups achieved by a prototype simulator. These results illustrate that time-parallel simulation can be used to significantly accelerate certain air traffic simulations.","PeriodicalId":145780,"journal":{"name":"2017 Winter Simulation Conference (WSC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129647553","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}
J. Leathrum, R. Mielke, Andrew J. Collins, M. Audette
{"title":"Proposed unified discrete event simulation content roadmap for M&S curricula","authors":"J. Leathrum, R. Mielke, Andrew J. Collins, M. Audette","doi":"10.1109/WSC.2017.8248135","DOIUrl":"https://doi.org/10.1109/WSC.2017.8248135","url":null,"abstract":"This paper presents a new educational roadmap for teaching discrete event system (DES) simulation software design. This roadmap represents the hierarchical structure and inter-relationships characterizing the worldviews of DES simulation, namely, event scheduling and process interaction. The roadmap was developed from the authors' experience while teaching DES simulation to both undergraduate and graduate students, spanning several years. The roadmap's development was motivated by the need to strive for greater completeness as well as fewer inconsistencies in the material curriculum. The commonality between the worldviews is highlighted in striving for a uniform approach. The intent of this paper is to provide other educators a foundation for their own DES simulation course development. A simple example is used to illustrate the worldviews within the roadmap.","PeriodicalId":145780,"journal":{"name":"2017 Winter Simulation Conference (WSC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130560359","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":"Designing internal supply routes: A case study in the automotive industry","authors":"Marcelus Fabri Lima, H. Ramalhinho","doi":"10.1109/WSC.2017.8248052","DOIUrl":"https://doi.org/10.1109/WSC.2017.8248052","url":null,"abstract":"In today's competitive market environment, logistics has a substantial impact on companies' performance. Improving the logistics efficiency is a main goal for many industries, especially, for those involved in car manufacturing. This work considers a real logistics problem in a car-assembly factory. The problem consists in optimizing the supply of components from the internal warehouse to the production lines, determining the best delivering routes. We describe the problem in detail, propose a mathematical programming model, and solve it with CPLEX. Afterward, to evaluate the impact of implementing the optimal routes in realistic scenarios, we apply Monte Carlo simulation and present a comparison between both solutions. The manufacturer's Key Performance Indicators are considered for evaluating the obtained results. The study showed that the proposed solution outperformed the current one, pointing out that the optimized routes could deal with different levels of production in a more efficient and cost reductive manner.","PeriodicalId":145780,"journal":{"name":"2017 Winter Simulation Conference (WSC)","volume":"592 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123389888","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}
Georg Seidel, Ching Foong Lee, Ai Mei Kam, Boon-Ping Gan, Chew Wye Chan, A. Naumann, P. Preuss
{"title":"Harmonizing operations management of key stakeholders in wafer fab using discrete event simulation","authors":"Georg Seidel, Ching Foong Lee, Ai Mei Kam, Boon-Ping Gan, Chew Wye Chan, A. Naumann, P. Preuss","doi":"10.1109/WSC.2017.8248079","DOIUrl":"https://doi.org/10.1109/WSC.2017.8248079","url":null,"abstract":"Operations meeting in a wafer fab involves daily alignment of action items among key stakeholders: operations, maintenance, engineering and planning department. They have conflicting job functions. The maintenance department is required to conduct preventive maintenance (PM) to improve tools' reliability The engineering department is required to qualify new products and processes. Both cases interfere with the flow of production lots. The planning department must ensure production ramp up. This can have a short term impact on overall fab delivery and capacity. The primary challenge is to reach aligned decisions e.g. the best timing for PM or optimizing dispatch prioritization of production and development lots to ensure on-time delivery while maximizing capacity and tool utilization. In this paper we discuss the associated modelling issues of a 7-day simulation-based forecast, providing forecast of incoming WIP, moves and utilization at work center level. The simulation forecast consistently achieved an accuracy above 90%.","PeriodicalId":145780,"journal":{"name":"2017 Winter Simulation Conference (WSC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121317814","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":"History of uniform random number generation","authors":"P. L'Ecuyer","doi":"10.1109/WSC.2017.8247790","DOIUrl":"https://doi.org/10.1109/WSC.2017.8247790","url":null,"abstract":"Random number generators were invented before there were symbols for writing numbers, and long before mechanical and electronic computers. All major civilizations through the ages found the urge to make random selections, for various reasons. Today, random number generators, particularly on computers, are an important (although often hidden) ingredient in human activity. In this article, we give a historical account on the design, implementation, and testing of uniform random number generators used for simulation.","PeriodicalId":145780,"journal":{"name":"2017 Winter Simulation Conference (WSC)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121486666","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":"Continuous flow transport scheduling for conveyor-based AMHS in wafer fabs","authors":"Clemens Schwenke, K. Kabitzsch","doi":"10.1109/WSC.2017.8248072","DOIUrl":"https://doi.org/10.1109/WSC.2017.8248072","url":null,"abstract":"Automated material handling systems (AMHS) can greatly impact the manufacturing performance of a semiconductor fabricating facility (fab). High traffic loads within an AMHS can impede individual wafer lots so that they arrive late at their destination machines. Thus, corresponding process operations as well as dependent succeeding operations will be delayed due to the fab schedule's precedence constraints. Consequently, such transport-related delays can widely propagate throughout the overall fab schedule. In order to reduce transport-related delays before time-critical operations, novel ways of planning wafer transports have been investigated in this study. For validation, a well-known realistic representative wafer fab model has been extended with conveyor elements constituting a typical AMHS for continuous flow transport (CFT). As a result, improvements of the overall fab performance due to advanced transport scheduling methods are demonstrated and compared. Finally, the practicality of the suggested methods is discussed in the dynamic scheduling context of real fabs.","PeriodicalId":145780,"journal":{"name":"2017 Winter Simulation Conference (WSC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114777132","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 sequential elimination approach to value-at-risk and conditional value-at-risk selection","authors":"A. Hepworth, Michael P. Atkinson, R. Szechtman","doi":"10.1109/WSC.2017.8247963","DOIUrl":"https://doi.org/10.1109/WSC.2017.8247963","url":null,"abstract":"Conditional Value-at-Risk (CVaR) is a widely used metric of risk in portfolio analysis, interpreted as the expected loss when the loss is larger than a threshold defined by a quantile. This work is motivated by situations where the CVaR is given, and the objective is to find the portfolio with the largest or smallest quantile that meets the CVaR constraint. We define our problem within the classic stochastic multi-armed bandit (MAB) framework, and present two algorithms. One that can be used to find the portfolio with largest or smallest loss threshold that satisfies the CVaR constraint with high probability, and another that determines the portfolio with largest or smallest probability of exceeding a loss threshold implied by a CVaR constraint, also at some desired probability level.","PeriodicalId":145780,"journal":{"name":"2017 Winter Simulation Conference (WSC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127886909","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":"Using simulation to help hospitals reduce emergency department waiting times: Examples and impact","authors":"Thomas Monks, Rudabeh Meskarian","doi":"10.1109/WSC.2017.8248000","DOIUrl":"https://doi.org/10.1109/WSC.2017.8248000","url":null,"abstract":"In recent years, all acute hospitals in the UK have experienced unprecedented emergency department waiting times and hospital bed pressures. The consequences are overcrowded emergency departments, ambulance shortages, cancelled elective operations, low staff morale and financial penalties. To deal with the increasing numbers of patient admissions and delayed discharges hospitals must turn now to modelling and simulation to help increase their flexibility and ability to deal with demand variation. Hospitals face several issues that reduce their flexibility including the need for extreme value-for-money and specialization of care. This talk presents three ED case studies undertaken by an analytics team in the UK. The paper considers the impact of the work and challenges arising from their experiences of simulation modelling in acute hospitals. Final thoughts consider the future of ED simulation.","PeriodicalId":145780,"journal":{"name":"2017 Winter Simulation Conference (WSC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126421743","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 two-time-scale adaptive search algorithm for global optimization","authors":"Qi Zhang, Jiaqiao Hu","doi":"10.1109/WSC.2017.8247940","DOIUrl":"https://doi.org/10.1109/WSC.2017.8247940","url":null,"abstract":"We study a random search algorithm for solving deterministic optimization problems in a black-box scenario. The algorithm has a model-based nature and finds improved solutions by sampling from a distribution model over the feasible region that gradually concentrates its probability mass around high quality solutions. In contrast to many existing algorithms in the class, which are population-based, our approach combines random search with a two-time-scale stochastic approximation idea to address a certain ratio bias inherent in these algorithms and uses only a single candidate solution per iteration. We prove global convergence of the algorithm and carry out numerical experiments to illustrate its performance.","PeriodicalId":145780,"journal":{"name":"2017 Winter Simulation Conference (WSC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127922381","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}