Stelios K. Georgantzinos , Georgios Kastanos , Alexandra D. Tseni , Vassilis Kostopoulos
{"title":"Efficient optimization of the multi-response problem in the taguchi method through advanced data envelopment analysis formulations integration","authors":"Stelios K. Georgantzinos , Georgios Kastanos , Alexandra D. Tseni , Vassilis Kostopoulos","doi":"10.1016/j.cie.2024.110618","DOIUrl":"10.1016/j.cie.2024.110618","url":null,"abstract":"<div><div>This study introduces an innovative strategy to address the multi-response challenge inherent in the Taguchi Method, frequently encountered in the enhancement of production processes and productivity indices. By integrating the Taguchi Method with Data Envelopment Analysis (DEA), experimental trials are transformed into Decision Making Units (DMUs), with response variables categorized as inputs and outputs. Advanced DEA models, including simultaneous DEA and super-efficiency models, are employed to determine the DMUs’ relative and cross efficiencies, thus retaining the advantages of the Taguchi Design of Experiments (DoE) while offering an optimal solution for enhancing multiple quality responses. The superiority of this approach is validated by the Addictive Model for Factor Effects, demonstrating enhanced outcomes and reduced computational effort compared to existing empirical and scholarly solutions. These findings have significant implications for advancing manufacturing practices that require multi-response optimization, marking a notable contribution to the field.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"197 ","pages":"Article 110618"},"PeriodicalIF":6.7,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422232","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Shubham R. Shinde , Shashibhushan B. Mahadik , Athanasios C. Rakitzis
{"title":"New Lepage-type control charts for joint monitoring of location and scale","authors":"Shubham R. Shinde , Shashibhushan B. Mahadik , Athanasios C. Rakitzis","doi":"10.1016/j.cie.2024.110614","DOIUrl":"10.1016/j.cie.2024.110614","url":null,"abstract":"<div><div>This paper introduces two new Shewhart Lepage-type control charts for jointly monitoring the location and scale parameters of continuous processes. The first is based on the <em>van der Waerden</em> (VW) and <em>Ansari-Bradley</em> (AB) tests while the other is on the VW and Mood tests. Statistical performances, in terms of <em>average run length</em> (ARL), of these charts are evaluated numerically and compared with that of their two competitor charts in the existing literature under four distributional models for the process output, namely, the normal, lognormal, Laplace, and logistic. The numerical results show that irrespective of the process distribution, one of the proposed charts (based on VW and Mood tests) has the best performance among all the four charts in the detection of simultaneous shifts in both the parameters of all sizes as well as in the detection of shifts in the scale that have not been accompanied by shifts in the location (only-scale shifts) of all sizes. Moreover, the other proposed chart (based on VW and AB tests) performs better than one of the competitor charts in the existing literature for detecting simultaneous shifts as well as only-scale shifts of all sizes. In addition, it performs better than the other competitor chart for detecting the simultaneous shifts consisting of a large location shift and a small scale shift, however, performs worse than that for detecting the simultaneous shifts consisting of a small location shift and a scale shift of any size, as well as for detecting the only-scale shifts of all sizes. All the four charts perform almost similarly in the detection of only-location shifts of all sizes. Regression models are provided for the proposed charts, which facilitate their designs in practice. Finally, the practical implementation of the proposed charts is illustrated through a real-data example.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"197 ","pages":"Article 110614"},"PeriodicalIF":6.7,"publicationDate":"2024-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Daniel Schibelbain, Thiago Cantos Lopes, Leandro Magatão
{"title":"A method to balancing robotic mixed-model assembly lines: Practical constraints, computational challenges, and performance estimation","authors":"Daniel Schibelbain, Thiago Cantos Lopes, Leandro Magatão","doi":"10.1016/j.cie.2024.110595","DOIUrl":"10.1016/j.cie.2024.110595","url":null,"abstract":"<div><div>This paper considers a robotic assembly line with various practical constraints. These have been previously modeled mathematically, but extending it to consider mixed-model production presents two challenges: computational costs increase substantially with problem size, and devising a theoretical model for practical performance is difficult within mathematical programming. This paper seeks to bridge those gaps,by proposing a method based on fixing, constraining, and optimizing mixed-integer programming instances. Simulations and linear relaxations are used to measure performance and estimate room for improvement. The resulting solution for the large-size industrial case study reached approximately 5% better throughput than a mixed-model benchmark approach, which represents around 85% of the estimated improvement potential for starting from that initial solution. Furthermore, an exhaustive set of tests was performed to demonstrate the proposed method’s efficacy. Hence, the method managed to optimize a rather challenging computational problem that combines the complexity of relevant practical constraints with theoretical difficulties in estimating the performance of solutions.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"197 ","pages":"Article 110595"},"PeriodicalIF":6.7,"publicationDate":"2024-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422233","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A novel bi-objective model for sustainable and efficient airport logistics management: A case study on Copenhagen airport","authors":"Reza Ramezanian , Razieh Larizadeh , Babak Mohamadpour Tosarkani","doi":"10.1016/j.cie.2024.110589","DOIUrl":"10.1016/j.cie.2024.110589","url":null,"abstract":"<div><div>Due to the growing volume of air transportation and the scarcity of airport resources, aviation planners are paying more attention to the efficiency of airport resource management. Optimizing the assignment and scheduling of ground facilities plays an important role in reducing ground congestion, flight delays, and passenger dissatisfaction. To prevent any collisions among aircraft on the apron, taxi network, and runways, safety considerations should be strictly followed by traffic controllers. Minimizing taxi time is another matter of importance in airport logistics management that helps mitigate environmental concerns (e.g., fuel consumption, tire abrasion, and noise pollution). In this study, a bi-objective mixed-integer linear programming model is developed to optimize the ground resource scheduling problem, taking into account the challenges of gate assignment, taxi planning, and runway scheduling. The model is developed in a way that includes safety and sustainability considerations. The validation of the proposed model is investigated through several examples based on Copenhagen airport using the augmented <span><math><mi>ε</mi></math></span>-constraint method. Since the simultaneous scheduling of multiple resources is an NP-hard problem, two multi-objective metaheuristic algorithms are employed to deal with the large-scale problems. The performance of the algorithms is then compared in terms of coverage and convergence rates. Additionally, the results are discussed in detail to provide managerial implications for airport authorities.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"197 ","pages":"Article 110589"},"PeriodicalIF":6.7,"publicationDate":"2024-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422235","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Considering the peak power consumption problem with learning and deterioration effect in flow shop scheduling","authors":"Dan-Yang Lv, Ji-Bo Wang","doi":"10.1016/j.cie.2024.110599","DOIUrl":"10.1016/j.cie.2024.110599","url":null,"abstract":"<div><div>This paper investigates the permutation flow shop scheduling problem with peak power constraints under sequence-dependent setup time, learning, and deterioration effects to minimize the makespan, where the peak power consumption satisfies a given upper bound at any time. We establish relevant mathematical models based on the characteristics of the scheduling environment and set up five setup time-based heuristics, including the earliest start time, the latest setup time based on balance job–machine, latest setup time based on balance machine–job, latest setup time insert based on balance job–machine, and latest setup time insert based on balance machine–job. Similarly, a hybrid genetic algorithm combined with simulated annealing is proposed to prevent premature trapping in local optima. The algorithms are evaluated through a large number of data experiments, and the results show that it can effectively solve this scheduling problem.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"197 ","pages":"Article 110599"},"PeriodicalIF":6.7,"publicationDate":"2024-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Effects of online-to-offline spillovers on manufacturers’ online sales mode selection","authors":"Chaoqun Yi , Yu Cao , Zihan Zhou , Guangyu Wan","doi":"10.1016/j.cie.2024.110584","DOIUrl":"10.1016/j.cie.2024.110584","url":null,"abstract":"<div><div>Numerous studies have confirmed the existence of two types of spillover effects (i.e., negative or positive spillover) from online sales to offline sales. The manufacturer’s chosen strategy for sales mode can be challenging and complex when considering online sales efforts and spillover effects. With positive spillover, enhancing online sales efforts not only increases online demand but also stimulates offline demand. Conversely, with negative spillover, an increase in online sales efforts boosts online sales while simultaneously cannibalizing offline sales. This paper analyzes the manufacturer’s choice between reselling and agency selling modes and investigates how both positive and negative spillover effects influence the manufacturer’s choice when considering online sales efforts. We demonstrate that, with a significant positive spillover, agency selling is the manufacturer’s optimal strategy. Counterintuitively, we show that the larger the negative spillover, the more the manufacturer prefers reselling. Furthermore, when the negative or positive spillover is relatively low, the manufacturer’s decision regarding the sales mode depends on the commission rate. Moreover, our study highlights that the optimal selling strategy for the manufacturer is affected by consumers’ sensitivity to online sales efforts. We also find that when considering online sales efforts, in scenarios where there is a significant positive spillover, the manufacturer is better off adopting agency selling. Meanwhile, the manufacturer may obtain negative profits from the online channel but can be compensated by the profits made from the offline channel. We extend the model to consider online sales efforts provided by the online platform in two selling modes, demonstrating the robustness of our main outcomes.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"197 ","pages":"Article 110584"},"PeriodicalIF":6.7,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422231","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new mathematical model and meta-heuristic algorithm for order batching, depot selection, and assignment problem with multiple depots and pickers","authors":"Selma Gülyeşil , Zeynep Didem Unutmaz Durmuşoğlu","doi":"10.1016/j.cie.2024.110585","DOIUrl":"10.1016/j.cie.2024.110585","url":null,"abstract":"<div><div>The ‘order picking problem’ involves the efficient and organized retrieval of items from shelves to fulfill customer orders. In this study, we consider a new configuration of warehouse system with multiple pickers and depots (m-pickers & n-depots) for manually operated ‘picker-to-parts’ warehouses. The efficiency of the process is measured based on two metrics: i- total order picking distance of each picker ii- total number of pickers assigned to each of depots. The handled problem is called as <strong><em>‘Order Batching, Depot Selection and Assignment Problem with Multiple Depots and Multiple Pickers (OBDSAPMDMP)</em></strong><span><span><sup>1</sup></span></span><strong><em>’.</em></strong> To solve this complex problem, a new bi-objective Mixed-Integer Linear Programming (MILP) formulation for small-sized problems and a <em>meta</em>-heuristic called ‘Dependent Harmony Search (DHS)<span><span><sup>2</sup></span></span>’ for large-sized problems are proposed. The performance of DHS algorithm is evaluated by comparing the optimal results attained by MILP model. For the problem size of 10 orders, the average gap (%) in distance between the solution of DHS and MILP is 4.22%, although in some experiments DHS can find the optimal solution in a very short time. Also, in related analysis, it is seen that constructing multiple depots instead of one left-most located depot decreases total order picking distance by 7.11% on average.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"197 ","pages":"Article 110585"},"PeriodicalIF":6.7,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analyzing component failures in series-parallel systems with dependent components","authors":"Nuria Torrado , Murat Ozkut","doi":"10.1016/j.cie.2024.110604","DOIUrl":"10.1016/j.cie.2024.110604","url":null,"abstract":"<div><div>This paper investigates a series-parallel system comprising <span><math><mi>N</mi></math></span> independent subsystems with interchangeable dependent components, a prevalent reliability structure in engineering and network design. The primary aim of this research is to derive the joint probability distribution of the number of failed components within these configurations, considering component dependence and varying distributions across subsystems. This approach reflects a more realistic scenario than previously explored in the literature. Initially, the analysis is conducted for systems with two subsystems and subsequently extended to encompass configurations with <span><math><mi>N</mi></math></span> subsystems. The study also evaluates key reliability metrics including the average number of failed components and the mean time to failure (MTTF) of the entire system, theoretically proving that the system’s MTTF increases with the number of components under certain sufficient conditions. In addition to probabilistic analysis, an optimization problem is addressed to determine the optimal allocation of components within each subsystem. The objective is to minimize the average cost associated with corrective maintenance, thereby enhancing the cost-effectiveness of system operation.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"197 ","pages":"Article 110604"},"PeriodicalIF":6.7,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jialong He , Chenchen Wu , Wanghao Shen , Cheng Ma , Zikang Wang , Jun Lv
{"title":"A model for remaining useful life interval prediction of servo turret power head system of turn-milling center under time-varying operating conditions","authors":"Jialong He , Chenchen Wu , Wanghao Shen , Cheng Ma , Zikang Wang , Jun Lv","doi":"10.1016/j.cie.2024.110592","DOIUrl":"10.1016/j.cie.2024.110592","url":null,"abstract":"<div><div>With the diversification of machining tasks in turn-milling centers, the service conditions of the servo turret power head system are complex and changeable, and there are multi-source uncertainties in the degradation monitoring process. Based on the improved conditionally parameterized convolutions and nonlinear Wiener process, this paper proposes an interval prediction model suitable for the remaining useful life (RUL) under time-varying operating conditions. Firstly, a method for making sample performance degradation labels based on operating condition classification is proposed, and the labels under continuously identical operating conditions are linearized according to the classification results of operating conditions to solve the problem of inconsistent degradation rate under time-varying operating conditions. Then, a conditionally parameterized convolutions module considering global–local features (GL-CondConv) is proposed, and the convolution kernel parameters are adaptively learned according to the input samples, so that the model fully considers the influence of the features of each sample on the prediction results under time-varying operating conditions. Finally, the nonlinear Wiener process is used to estimate the RUL interval of the equipment to quantify the RUL uncertainty. The effectiveness of the proposed method is verified on the servo turret power head system dataset and PHM bearing dataset.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"197 ","pages":"Article 110592"},"PeriodicalIF":6.7,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142358479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Grinding process optimization considering carbon emissions, cost and time based on an improved dung beetle algorithm","authors":"Qi Lu , Yonghao Chen , Xuhui Zhang","doi":"10.1016/j.cie.2024.110600","DOIUrl":"10.1016/j.cie.2024.110600","url":null,"abstract":"<div><div>During the machining phase, carbon emissions produced by grinding machines account for a significant proportion of the total emissions. Optimizing grinding process parameters is an effective energy-saving measure, which can notably reduce carbon emissions. However, most of the research on parameter optimization related to carbon emissions and energy saving is focused on turning and milling processes, with limited studies on the grinding process. To address this gap, this paper introduces an optimization method for grinding process parameters that considers carbon emissions and seeks to balance emissions, time, and cost in the grinding process. Initially, we quantify the relationship between grinding parameters and optimization objectives and a corresponding multi-objective optimization model is established subsequently. Then an improved multi-objective dung beetle optimization algorithm (INSDBO) is proposed to solve this model. As a case study, we conduct experiments on the machining of a plunger. Simulation results indicate that after optimization, carbon emissions, grinding costs and time have decreased by 11.7%,7.7%, and 6.7% respectively, validating the effectiveness of the proposed optimization method. When compared with the Adaptive Weighted Evolutionary Algorithm (AdaW)、the traditional dung beetle algorithm (NSDBO), and Multi-Stage Multi-Objective Evolutionary Algorithm (MSEA), the improved dung beetle optimization algorithm(INSDBO) showed superior performance. This refined algorithm can suggest optimal parameters in the grinding process, thereby reducing carbon emissions, machining time, and costs.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"197 ","pages":"Article 110600"},"PeriodicalIF":6.7,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}