IISE Transactions最新文献

{"title":"Decision support for selecting cost-efficient order picking solutions","authors":"Fabian Schäfer, Fabian Lorson, Alexander Hübner","doi":"10.1080/24725854.2023.2284317","DOIUrl":"https://doi.org/10.1080/24725854.2023.2284317","url":null,"abstract":"Enabled via recent technological advances coupled with the advent of new systems providers and decreased price points, automated and robotized order-picking solutions (e.g., pick-assisting autonomo...","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"69 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2023-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138542092","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":"Modeling User Choice Behavior under Data Corruption: Robust Learning of the Latent Decision Threshold Model","authors":"Feng Lin, Xiaoning Qian, Bobak Mortazavi, Zhangyang Wang, Shuai Huang, Cynthia Chen","doi":"10.1080/24725854.2023.2279080","DOIUrl":"https://doi.org/10.1080/24725854.2023.2279080","url":null,"abstract":"AbstractRecent years have witnessed the emergence of many new mobile Apps and user-centered systems that interact with users by offering choices with rewards. These applications have been promising to address challenging societal problems such as congestion in transportation and behavior changes for healthier lifestyles. Considerable research efforts have been devoted to model the user behaviors in these new applications. However, as real-world user data is often prone to data corruptions, the success of these models hinges on a robust learning method. Building on the recently proposed Latent Decision Threshold (LDT) model, this paper shows that, among the existing robust learning frameworks, the L0 norm based framework can outperform other state-of-the-art methods in terms of prediction accuracy and model estimation. And based on the L0 norm framework, we further develop a user screening algorithm to identify potential bad actors.Keywords: Choice Behavior ModelingLatent Decision Threshold ModelRobust learningData CorruptionBad Actor DetectionDisclaimerAs 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":"10 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135137917","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":"Automated Deviation-Aware Landmark Selection for Freeform Product Accuracy Qualification in 3D Printing","authors":"Weizhi Lin, Qiang Huang","doi":"10.1080/24725854.2023.2280606","DOIUrl":"https://doi.org/10.1080/24725854.2023.2280606","url":null,"abstract":"AbstractLandmarks are essential in non-rigid shape registration for identifying the correspondence between designs and actual products. In 3D printing, manual selection of landmarks becomes labor-intensive due to complex product geometries and their non-uniform shape deviations. Automatic selection, however, has to pinpoint landmarks indicative of geometric regions prone to deviations for accuracy qualification. Existing automatic landmarking methods often generate clustered and redundant landmarks for prominent features with high curvatures, compromising the balance between global and local registration errors. To address these issues, we propose an automatic landmark selection method through deviation-aware segmentation and landmarking. As opposed to segmentation for semantic feature identification, deviation-aware segmentation partitions a freeform product for high-curvature region identification. Prone to deviation, these regions are generated through curvature-sensitive remeshing to extract vertices of high curvature and automatic clustering of vertices based on vertex density. Within each segment or high-curvature region, a curvature-weighted function is tailored for the Gaussian process landmarking to sequentially select landmarks with the highest local curvatures. Furthermore, we propose a new evaluation criterion to assess the effectiveness of selected landmarks through registration. The proposed approach is tested through automatic landmarking of printed dental models.Keywords: 3D printing qualificationnon-rigid shape registrationshape segmentationclusteringGaussian process landmarkingDisclaimerAs 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 contributorsWeizhi LinWeizhi Lin is a PhD student in the Daniel J. Epstein Department of Industrial and Systems Engineering at the University of Southern California (USC) in Los Angeles. She completed her B.E. degree in Statistics at Beihang University in 2019. Her research focuses on leveraging domain knowledge to develop models for analyzing complex manifold data, with a specific emphasis on addressing challenges in the field of advanced manufacturing.Qiang HuangDr. Qiang Huang is a professor at the Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California (USC), Los Angeles. His research focuses on Machine Learning for Smart Manufacturing and Quality Control for Personalized Manufacturing. He was the holder of the Gordon S. Marshall Early Career Chair in Engineering at USC from 2012 to 2016. He received the IISE Fellow Award, ASME Fellow Award, NS","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"27 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135390464","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":"An Adaptive Approach for Online Monitoring of Large Scale Data Streams","authors":"Shuchen Cao, Ruizhi Zhang","doi":"10.1080/24725854.2023.2281580","DOIUrl":"https://doi.org/10.1080/24725854.2023.2281580","url":null,"abstract":"AbstractIn this paper, we propose an adaptive top-r method to monitor large-scale data streams where the change may affect a set of unknown data streams at some unknown time. Motivated by parallel and distributed computing, we propose to develop global monitoring schemes by parallel running local detection procedures and then use the Benjamin-Hochberg (BH) false discovery rate (FDR) control procedure to estimate the number of changed data streams adaptively. Our approach is illustrated in two concrete examples: one is a homogeneous case when all data streams are i.i.d with the same known pre-change and post-change distributions. The other is when all data are normally distributed, and the mean shifts are unknown and can be positive or negative. Theoretically, we show that when the pre-change and post-change distributions are completely specified, our proposed method can estimate the number of changed data streams for both the pre-change and post-change status. Moreover, we perform simulations and two case studies to show its detection efficiency.Keywords: False discovery rateCUSUMquickest change detectionprocess 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.","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":" 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135340531","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":"Introduction to the Special Issue on Analytical Methods for Detecting, Disrupting, and Dismantling Illicit Operations","authors":"Thomas C. Sharkey, Burcu B. Keskin, Renata Konrad, Maria E. Mayorga","doi":"10.1080/24725854.2023.2271536","DOIUrl":"https://doi.org/10.1080/24725854.2023.2271536","url":null,"abstract":"Click to increase image sizeClick to decrease image size AcknowledgmentsWe appreciate the work of Cole Smith on this special issue in coordinating the review process, especially the work done well after his term as the Focus Issue Editor of Operations Engineering and Analytics came to an end. We would also like to acknowledge the contributions of the reviewers of papers submitted to this special issue.","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"317 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135474910","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":"Ranking and Pricing under a Cascade Model of Consumer Review Browsing","authors":"Jingtong Zhao, Xin Pan, Van-Anh Truong, Jie Song","doi":"10.1080/24725854.2023.2274898","DOIUrl":"https://doi.org/10.1080/24725854.2023.2274898","url":null,"abstract":"AbstractIn online platforms, the reviews posted by consumers who arrive earlier are playing an increasingly important role in the purchasing decisions of consumers who arrive later. Motivated by this observation, we study the problems faced by a platform selling a single product with no capacity constraint, where the demand is explicitly influenced by the reviews presented to the consumers. More precisely, we model a consumer’s browsing of reviews for a single product as following a cascade click model, with each consumer seeing some initial number of reviews and forming a utility estimate for the product based on the reviews the consumer has read. In the first part of the paper, we consider how to rank the reviews to induce short- and long-term revenue-maximizing purchasing behaviors. In the second part, we study how to set the price of the product. We derive structural insights and bounds on both problems. We also consider the case that the parameters of the model are unknown, where we propose algorithms that learn the parameters and optimize the ranking of the reviews or the price online. We show that our algorithms have regrets O(T23).Keywords: Analysis of algorithmsApproximations/heuristicsRevenue managementDisclaimerAs 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":"37 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135933218","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":"Robust expected improvement for Bayesian optimization","authors":"Ryan B. Christianson, Robert B. Gramacy","doi":"10.1080/24725854.2023.2275166","DOIUrl":"https://doi.org/10.1080/24725854.2023.2275166","url":null,"abstract":"AbstractBayesian Optimization (BO) links Gaussian Process (GP) surrogates with sequential design toward optimizing expensive-to-evaluate black-box functions. Example design heuristics, or so-called acquisition functions, like expected improvement (EI), balance exploration and exploitation to furnish global solutions under stringent evaluation budgets. However, they fall short when solving for robust optima, meaning a preference for solutions in a wider domain of attraction. Robust solutions are useful when inputs are imprecisely specified, or where a series of solutions is desired. A common mathematical programming technique in such settings involves an adversarial objective, biasing a local solver away from “sharp” troughs. Here we propose a surrogate modeling and active learning technique called robust expected improvement (REI) that ports adversarial methodology into the BO/GP framework. After describing the methods, we illustrate and draw comparisons to several competitors on benchmark synthetic exercises and real problems of varying complexity.Keywords: Robust OptimizationGaussian ProcessActive LearningSequential 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.","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"55 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135813672","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":"Optimal Shipping, Collaboration, and Outsourcing Decisions in a Hybrid Cross-docking Supply Chain","authors":"Seulchan Lee, Alexandar Angelus, Jon M. Stauffer, Chelliah Sriskandarajah","doi":"10.1080/24725854.2023.2273373","DOIUrl":"https://doi.org/10.1080/24725854.2023.2273373","url":null,"abstract":"AbstractMotivated by the supply chain of our oil-field service industry partner, we study shipping, collaboration, and outsourcing decisions in a decentralized, three-stage supply chain consisting of suppliers, a hybrid cross-dock facility, and oil well facilities. Unlike pure cross-docking, which transships arriving products quickly downstream, hybrid cross-docking allows for inventory to remain at the cross-dock for multiple periods. We formulate multi-period, optimization models to minimize costs of different members in a hybrid cross-docking supply chain and establish structural properties of optimal solutions. We make use of those results to identify conditions under which hybrid cross-docking is more cost efficient than pure cross-docking. Our results provide managerial insights regarding when a hybrid cross-dock should be enabled, and the value of the resulting cost savings. We also quantify the value of collaboration among different stages in the supply chain. Upstream collaboration results in 1% to 9% average cost savings for the cross-dock, while downstream collaboration generates 4% to 13% in average cost savings for oil well facilities, depending on the number of products and their holding cost. We also develop a Stackelberg pricing game between a logistics company and oil well facilities seeking to lower their costs by outsourcing their transportation and inventory operations. We identify the structure of oil well facilities’ best response to the price of outsourcing services, as well as the structure of the logistics provider’s optimal pricing policy. Our findings and models, based on current literature, provide application focused tools that allow managers to improve cross-docking operations in their supply chains, realize the benefits of collaborations, and make better outsourcing decisions.Keywords: Cross-dockingOutsourcingOil-field serviceDynamic lot sizingDisclaimerAs 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. Data Availability StatementDue to the nature of this research, participants of this study did not agree for their data to be shared publicly, so supporting data is not available.","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135570102","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":"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}