IISE Transactions最新文献

{"title":"Similarity-based Sampling for Simulation with Binary Outcomes","authors":"Haitao Liu, Ping Cao, Loo Hay Lee, Ek Peng Chew","doi":"10.1080/24725854.2023.2271027","DOIUrl":"https://doi.org/10.1080/24725854.2023.2271027","url":null,"abstract":"AbstractAbstract–We consider a feasibility determination problem via simulation with stochastic binary outcomes, in which the design space can be either discrete or continuous, and outcomes can be predicted through a functional relationship that depends on linear combinations of design variables. The goal is to identify all the feasible designs with means (i.e., probabilities) no smaller than a threshold. A logistic model is used to capture the relationship between the probability and design variables. Traditional binary rewards often conceal the numbers of correct and false determinations, thereby being inefficient in large and continuous design spaces. We thus propose a similarity measure to smooth binary rewards. Then, a sampling policy that optimizes a so-called similarity differential (SD) is developed. Under some mild conditions, we show that the SD policy is capable of identifying all the feasible designs as the sampling budget goes to infinity. Two approximate versions of the SD policy are developed to sequentially determine the sampling decisions in large and continuous design spaces. Extensive numerical experiments are conducted to demonstrate the superior performance of our SD policy, document computational savings, and reveal underlying sampling behaviors. Alternatively, we provide a simple but effective heuristic that can be easily used by practitioners.Keywords: simulationfeasibility determinationbinary outcomesoptimal computing budget allocationexperimental designDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. AcknowledgementsWe thank the editors and anonymous reviewers for valuable comments. This paper is supported by the National Science Foundation of China [Grant No. 72301187, 72122019, and 71771202], and by the Fundamental Research Funds for the Central Universities [Grant No. SXYPY202346]Additional informationNotes on contributorsHaitao LiuHaitao Liu received his Ph.D. degree in the Department of Industrial Systems Engineering and Management at National University of Singapore in 2022. He is currently an associate professor in Business School at Sichuan University. His research interests include simulation optimization, statistical learning, and supply chain management.Ping CaoPing Cao received his Ph.D. degree in Operational Research at Academy of Mathematics and Systems Science, Chinese Academy of Science in 2011. He is currently a professor at the School of Management in University of Science and Technology of China. He His research interests include stochastic control, queueing theory, Markov decision process, and dynamic pricing in reve","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136114371","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Integrated multi-plant collaborative production, inventory, and hub-spoke delivery of make-to-order products","authors":"Kefei Liu, Zhibin Jiang, Liping Zhou","doi":"10.1080/24725854.2023.2272261","DOIUrl":"https://doi.org/10.1080/24725854.2023.2272261","url":null,"abstract":"AbstractMotivated by make-to-order applications with committed delivery dates in a variety of industries, we investigate the integrated multi-plant collaborative production, inventory, and hub-spoke delivery problem in a complex production-distribution network. This network includes multi-location heterogeneous plants, distribution centers, and customers, for producing customized and splittable orders with one or more general-size multi-type jobs. Completed jobs are transported from plants to distribution centers, and then the orders whose all constituent jobs have arrived are delivered from distribution centers to customer sites. The objective is to make integrated scheduling decisions for production, inventory, and delivery, for minimizing total cost composed of production, transportation, tardiness, and inventory. We first formulate this problem as a mixed-integer programming model, and analyze its intractability by proving that the problem is NP-hard and no approximation algorithms exist with a constant worst-case ratio. We then reformulate this problem as a binary integer linear programming model to select a feasible schedule for each job, and propose a combined column generation and two-layer column enumeration algorithm to solve it. Through extensive numerical experiments, we demonstrate that our proposed algorithm is capable of generating optimal or near-optimal solutions expeditiously and outperforms four benchmark approaches, and gain valuable managerial insights for practitioners.Keywords: Customized and splittable ordersintegrated schedulingmulti-plant production and hub-spoke deliverymixed-integer programmingcolumn generation and column enumerationDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. Additional informationNotes on contributorsKefei LiuKefei Liu is a Ph.D. candidate in Management Science and Engineering from Antai College of Economics & Management, Shanghai Jiao Tong University (SJTU), Shanghai, China. Her main research interests include operations management of manufacturing systems.Zhibin JiangZhibin Jiang is currently a distinguished Professor with the Antai College of Economics & Management, SJTU, Shanghai, China. He is also the Dean of the Sino-US Global Logistics Institute of SJTU. He received a Ph.D. degree in Engineering Management from the City University of Hong Kong, Hong Kong, China, in 1999. He is a fellow of the Institute of Industrial and Systems Engineers and an Associate Editor of the International Journal of Production Research. His research interests include discrete-event modeling and simulation, and operations managem","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136079823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Change Point Detection of Multimode Processes Considering Both Mode Transitions and Parameter Changes","authors":"Jun Xu, Jie Zhou, Xiaofang Huang, Kaibo Wang","doi":"10.1080/24725854.2023.2266001","DOIUrl":"https://doi.org/10.1080/24725854.2023.2266001","url":null,"abstract":"AbstractMultimode processes are common in modern industry and refer to processes that work in multiple operating modes. Motivated by the torque control process of a wind turbine, we determine that there exist two types of changes in multimode processes: (1) mode transitions and (2) parameter changes. Detecting both types of changes is an important issue in practice, but existing methods mainly consider one type of change and thus do not work well. To address this issue, we propose a novel modeling framework for the offline change point detection problem of multimode processes, which simultaneously considers mode transitions and parameter changes. We characterize each mode with a parametric cost function and formulate the problem as an optimization model. In the model, two penalty terms penalize the number of change points, and a series of constraints specify the multimode characteristics. With certain assumptions, the asymptotic property ensures the accuracy of the model solution. To solve the model, we propose an iterative algorithm and develop a multimode-pruned exact linear time (multi-PELT) method for initialization. The simulation study and the real case study demonstrate the effectiveness of our method against the state-of-the-art methods in terms of the accuracy of change point detection, mode identification, and parameter estimation.Keywords: Change point detectionconstrained optimization modelmultimode processeswind turbine torque controlDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. Additional informationNotes on contributorsJun XuJun Xu is currently a Ph.D. student in Department of Industrial Engineering, Tsinghua University. He received his B.Eng. degree in Industrial Engineering from Tsinghua University in 2019. His research interests include modeling, monitoring, change detection and diagnosis of complex systems.Jie ZhouJie Zhou is a senior engineer in Goldwind Science & Technology Co.,Ltd, Beijing, China. He is focusing on wind turbine diagnosis and safety control. He is also currently working towards the D.Eng. degree in Industrial Engineering with Tsinghua University, Beijing, China. He received his B.S. and M.S. degrees in Electrical Engineering from Dalian University of Technology, Dalian, China.Xiaofang HuangXiaofang Huang is a senior engineer. She received her master's degree from Xidian University, Xi'an, China in 2006. She is currently a department lead of the R&D Center of Goldwind Science & Technology Co.,Ltd, mainly engaged in the development and localization of wind turbine main control system software, as well as the development of ","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134974997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Data-driven Adaptive Testing Resource Allocation Strategies for Real-time Monitoring of Infectious Diseases","authors":"Xin Zan, Jaclyn Hall, Tom Hladish, Xiaochen Xian","doi":"10.1080/24725854.2023.2266488","DOIUrl":"https://doi.org/10.1080/24725854.2023.2266488","url":null,"abstract":"AbstractSince 2002 with the SARS outbreak, infectious diseases, including the ongoing COVID-19 pandemic, have continued to be a major global public health threat. It is critical to develop effective data science methods to quickly detect disease outbreaks and contain their rapid globalized spread. However, in practice, limited testing availability, and thus insufficient testing data poses significant challenges in effective analysis and real-time monitoring of infectious diseases, especially during early stages of a novel disease outbreak. To tackle these challenges, this article proposes adaptive testing resource allocation strategies integrated with a physics-informed model to dynamically allocate limited testing resources across different communities. The physics-informed model accounts for transmission dynamics and health disparities, enabling effective health risk assessment despite limited data. By integrating nonstationary Multi-Armed Bandit (MAB) techniques that strike superior balance between exploring the communities with high uncertain risks and exploiting those with high risk levels, the proposed methodology facilitates test allocation to collect high-quality testing data for early outbreak detection. Theoretical analysis is carried out to evaluate the performance of the proposed allocation strategies, ensuring either sublinear or linear dynamic pseudo-regret under regularity assumptions. A comprehensive simulation study is conducted under three transmission scenarios to thoroughly evaluate the proposed methodology.Keywords: data-drivenhealth disparityinfectious diseasesMulti-Armed Bandit (MAB)real-time monitoringresource allocationtransmission dynamicsDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also.","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135592646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Statistical and Dynamic Model of Surface Morphology Evolution during Polishing in Additive Manufacturing","authors":"Adithyaa Karthikeyan, Soham Das, Satish T.S. Bukkapatnam, Ceyhun Eksin","doi":"10.1080/24725854.2023.2264889","DOIUrl":"https://doi.org/10.1080/24725854.2023.2264889","url":null,"abstract":"AbstractMany industrial components, especially those realized through 3D printing undergo surface finishing processes, predominantly, in the form of mechanical polishing. The polishing processes for custom components remains manual and iterative. Determination of the polishing endpoints, i.e., when to stop the process to achieve a desired surface finish, remains a major obstacle to process automation and in the cost-effective custom/3D printing process chains. With the motivation to automate the polishing process of 3D printed materials to a desired level of surface smoothness, we propose a dynamic model of surface morphology evolution of 3D printed materials during a polishing process. The dynamic model can account for both material removal and redistribution during the polishing process. In addition, the model accounts for increased material flow due to heat generated during the polishing process. We also provide an initial random surface model that matches the initial surface statistics. We propose an optimization problem for model parameter estimation based on empirical data using KL-divergence and surface roughness as two metrics of the objective. We validate the proposed model using data from polishing of a 3D printed sample. The procedures developed makes the model applicable to other 3D printed materials and polishing processes. We obtain a network formation model as a representation of the surface evolution from the heights and radii of asperities. We use the network connectivity (Fiedler number) as a metric for surface smoothness that can be used to determine whether a desired level of smoothness is reached or not.Keywords: Additive ManufacturingPolishingSurface Morphology EvolutionNetwork FormationDynamic modelsMaterial Removal and Material RedistributionDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. Additional informationNotes on contributorsAdithyaa KarthikeyanAdithyaa Karthikeyan is currently a PhD student specializing in Advanced Manufacturing within the Department of Industrial and Systems Engineering, Texas A&M University, USA. He received his B.Tech (Hons) degree in Mechanical Engineering from National Institute of Technology, Tiruchirappalli, India in 2017 and MS degree in Interdisciplinary Engineering from Texas A&M University in 2020. He was a summer intern with Micron Technology Inc. in 2023 with their CMP (Chemical Mechanical Planarization) process development team for semiconductor manufacturing. His research interests include mathematical modelling and data analytics for manufacturing processes and systems.Soham DasSoham Das is a PhD s","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":" 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135387231","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Ontology-guided Attribute Learning to Accelerate Certification for Developing New Printing Processes","authors":"Tsegai O. Yhdego, Hui Wang, Zhibin Yu, Hongmei Chi","doi":"10.1080/24725854.2023.2263786","DOIUrl":"https://doi.org/10.1080/24725854.2023.2263786","url":null,"abstract":"AbstractIdentifying printing defects is vital for process certification, especially with evolving printing technologies. However, this task proves challenging, especially for micro-level defects necessitating microscopy, which presents a scalability barrier for manufacturing. To address this challenge, we propose an attribute learning methodology inspired by human learning, which identifies shared attributes among seen and unseen objects. First, it extracts defect class embeddings from an engineering-guided defect ontology. Then, attribute learning identifies the combination of attributes for defect estimation. This approach enables it to recognize previously unseen defects by identifying shared attributes, even those not included in the training dataset. The research formulates a joint optimization problem for learning and fine-tuning class embedding and ontology and solves it by integrating natural language processing, metaheuristics for exploration and exploitation, and stochastic gradient descent. In a case study involving a direct-ink-writing process for creating nanocomposites, this methodology was used to learn new defects not found in the training data using the optimized ontology. Compared to traditional zero-shot learning, this ontology-based approach significantly improves class embedding, outperforming transfer learning in one-shot and two-shot learning scenarios. This research represents an early effort to learn new defect concepts, potentially reducing the need for extensive measurements in defect identification.Keywords: Additive ManufacturingAttribute learningOntologyDefect identificationProcess certificationDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. Additional informationNotes on contributorsTsegai O. YhdegoTsegai O. Yhdego is a researcher in Industrial Engineering pursuing a Ph.D. at Florida A&M University. His academic journey includes a BSc. in Electrical and Electronics Engineering (2015) from Eritrea Institute of Technology and an MSc. in Mechatronic Engineering (2019) from The Pan African University Institute for Basic Sciences, Technology and Innovation. His research focuses on developing small-sample machinelearning algorithms, specializing in ontology-based federated learning, emphasizing data security and collaborative machine learning. He has also contributed to the aviation industry, developing ML models to forecast flight delay and delay impact.Hui WangHui Wang is an associate professor of industrial engineering at the Florida A&M University-Florida State University College of Engineering and a member of the HighPerformance Ma","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135538456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Admission and Routing Control of Multiple Queues with Multiple Types of Customers","authors":"Sha Chen, Izak Duenyas, Seyed Iravani","doi":"10.1080/24725854.2023.2261569","DOIUrl":"https://doi.org/10.1080/24725854.2023.2261569","url":null,"abstract":"AbstractWe study the routing and admission control problem in a parallel queueing system with heterogeneous servers serving multiple types of customers. The system makes admission decision regarding whether to admit a customer upon arrival as well as routing decision of which queue an admitted customer is assigned to. The objective is to maximize the expected profit, which includes customer-dependent revenues and holding cost and server-dependent cost. We first characterize the structure of the optimal policy for the case with two servers and two types of customers that have the same holding cost. We show that the optimal admission and routing policy has a complex non-monotone structure; however, we show that this non-monotone structure is the result of overlapping of three pairwise dominant policies that have a monotone structure. Utilizing the above structure, we propose three heuristics for the general case of multiple servers and multiple types of customers. Through a numerical study, we demonstrate the effectiveness of our heuristics, and provide conditions under which each heuristic performs well. Lastly, we provide insights on the effect of holding cost on customer rejection and the effect of fixed production cost on capacity allocation.Keywords: Routing controladmission controlMarkov decision processparallel queuesDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. Acknowledgement:","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135770361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The Influence Coverage Optimization Problem","authors":"Majid Akhgar, Juan S. Borrero","doi":"10.1080/24725854.2023.2261507","DOIUrl":"https://doi.org/10.1080/24725854.2023.2261507","url":null,"abstract":"AbstractWe introduce the Influence Coverage Optimization Problem (ICOP), which is an influence maximization problem where the activation of nodes also depends on their location on the plane. Specifically, the ICOP assumes that there is a network where nodes become active (i.e., influenced) either by the influence they receive from interactions with active in-neighbors or by entering the coverage area of a physical ad or a Geo-fence. The objective is to locate a fixed number of ads or Geo-fences and modify the network influence rates to minimize the network activation time. Assuming a Markovian influence model, we prove that the ICOP is NP-hard, and then we present MIP formulations for three different types of coverage modes. A reformulation of the non-linear ‘big-M’ constraints, two types of valid cuts, and a fast heuristic based on the k-means algorithm are used as enhancements that facilitate solving the ICOP via an Iterative Decomposition Branch-and-Cut (IDBC) algorithm. In addition, we present an alternative discrete formulation of the ICOP using critical intersection points. Several experiments under various parameter configurations across instances with more than a hundred nodes and thousand arcs are conducted, showing the IDBC’s capability to provide optimal solutions within seconds or minutes for most instances. Moreover, the experiments reveal that the ICOP can significantly outperform a Geo-fence coverage model that does not consider network interactions to make location decisions.Keywords: Influence maximizationsocial networksmaximum coveragecritical intersection pointsbranch-and-cutDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. AcknowledgementsThis research is partially funded by the National Science Foundation (NSF) (Award ENG/CMMI # 2145553), by the Air Force Office of Scientific Research (AFORS) (Award # FA9550-22-1-0236), and the Office of Naval Research (ONR) (Award # N00014-19-1-2329).","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135816546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Rebooting Simulation","authors":"Barry L. Nelson","doi":"10.1080/24725854.2023.2261028","DOIUrl":"https://doi.org/10.1080/24725854.2023.2261028","url":null,"abstract":"AbstractComputer simulation has been in the toolkit of industrial engineers for over fifty years and its value has been enhanced by advances in research, including both modeling and analysis, and in application software, both commercial and open source. However, “advances” are different from paradigm shifts. Motivated by big data, big computing and the big consequences of model-based decisions, it is time to reboot simulation for industrial engineering.Keywords: Systems simulationbig datahigh-performance computingsystem of systemsDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. Additional informationNotes on contributorsBarry L. NelsonBarry L. Nelson is the Walter P. Murphy Professor Emeritus of the Department of Industrial Engineering and Management Sciences at Northwestern. His research focus is the design and analysis of computer simulation experiments on models of discrete-event, stochastic systems, including methodology for simulation optimization, quantifying and reducing model risk, variance reduction, output analysis, metamodeling and multivariate input modeling. He has published numerous papers and three books, including Foundations and Methods of Stochastic Simulation: A First Course (second edition, Springer, 2021). Nelson is a Fellow of INFORMS and IISE. Further information can be found at www.iems.northwestern.edu/∼nelsonb/.Barry L. Nelson is the Walter P. Murphy Professor Emeritus of the Department of Industrial Engineering and Management Sciences at Northwestern. His research focus is the design and analysis of computer simulation experiments on models of discrete-event, stochastic systems, including methodology for simulation optimization, quantifying and reducing model risk, variance reduction, output analysis, metamodeling and multivariate input modeling. His application areas are manufacturing, services, financial engineering, renewable energy generation and transportation. He has published numerous papers and three books, including Foundations and Methods of Stochastic Simulation: A First Course (second edition Springer, 2021). Nelson is a Fellow of INFORMS and IISE. In 2006, 2013 and 2015 he received the Outstanding Simulation Publication Award from the INFORMS Simulation Society; in 2009, 2011 and 2015 he was awarded the Best Paper–Operations Award from IIE Transactions; in 2019 he received the David F. Baker Distinguished Research Award from IISE; and in 2022 he received the Lifetime Professional Achievement Award from the INFORMS Simulation Society. His teaching has been acknowledged by a Northwestern University Alumni Association Excelle","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135059674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Dynamic Inspection and Maintenance Scheduling for Multi-State Systems Under Time-Varying Demand: Proximal Policy Optimization","authors":"Yiming Chen, Yu Liu, Tangfan Xiahou","doi":"10.1080/24725854.2023.2259949","DOIUrl":"https://doi.org/10.1080/24725854.2023.2259949","url":null,"abstract":"AbstractInspection and maintenance activities are effective ways to reveal and restore the health conditions of many industrial systems, respectively. Most extant works on inspection and maintenance optimization problems assumed that systems operate under a time-invariant demand. Such a simplified assumption is oftentimes violated by a changeable market environment, seasonal factors, and even unexpected emergencies. In this article, with the aim of minimizing the expected total cost associated with inspections, maintenance, and unsupplied demand, a dynamic inspection and maintenance scheduling model is put forth for multi-state systems (MSSs) under a time-varying demand. Non-periodic inspections are performed on the components of an MSS and imperfect maintenance actions are dynamically scheduled based on the inspection results. By introducing the concept of decision epochs, the resulting inspection and maintenance scheduling problem is formulated as a Markov decision process (MDP). The deep reinforcement learning (DRL) method with a proximal policy optimization (PPO) algorithm is customized to cope with the “curse of dimensionality” of the resulting sequential decision problem. As an extra input feature for the agent, the category of decision epochs is formulated to improve the effectiveness of the customized DRL method. A six-component MSS, along with a multi-state coal transportation system, is given to demonstrate the effectiveness of the proposed method.Keywords: multi-state systemdeep reinforcement learningdynamic inspection and maintenance schedulingproximal policy optimizationtime-varying demandDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. Additional informationNotes on contributorsYiming ChenYiming Chen received the Ph.D. degrees in mechanical engineering from the University of Electronic Science and Technology of China in 2022. He is currently a Lecturer with the College of Marine Equipment and Mechanical Engineering, Jimei University. His research interests include maintenance decisions, stochastic dynamic programming, and deep reinforcement learning.Yu LiuYu Liu is a professor of industrial engineering with the School of Mechanical and Electrical Engineering, University of Electronic Science and Technology of China. He received a PhD degree from the University of Electronic Science and Technology of China in 2010. He was a Visiting Predoctoral Fellow with the Department of Mechanical Engineering, Northwestern University, USA, from 2008 to 2010 and a Postdoctoral Research Fellow with the Department of Mechanical Engineering, University of Alberta, C","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135397256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}