International Journal of Industrial Engineering Computations最新文献

{"title":"To reduce maximum tardiness by Seru Production: model, cooperative algorithm combining reinforcement learning and insights","authors":"Guanghui Fu, Yang Yu, Wei Sun, I. Kaku","doi":"10.5267/j.ijiec.2022.10.002","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.10.002","url":null,"abstract":"The maximum tardiness reflects the worst level of service associated with customer needs; thus, the principle that seru production reduces the maximum tardiness is investigated, and a model to minimize the maximum tardiness of the seru production system is established. In order to obtain the exact solution, the non-linear seru production model with minimizing the maximum tardiness is split into a seru formation model and a linear seru scheduling model. We propose an efficient cooperative algorithm using a genetic algorithm and an innovative reinforcement learning algorithm (CAGARL) for large-scale problems. Specifically, the GA is designed for the seru formation problem. Moreover, the QL-seru algorithm (QLSA) is designed for the seru scheduling problem by combining the features of meta-heuristics and reinforcement learning. In the QLSA, we design an innovative QL-seru table and two state trimming rules to save computational time. After extensive experiments, compared with the previous algorithm, CAGARL improved by an average of 56.6%. Finally, several managerial insights on reducing maximum tardiness are proposed.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"91 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83980563","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":"Heuristics and metaheuristics to minimize makespan for flowshop with peak power consumption constraints","authors":"Yuan-Zhen Li, K. Gao, Lei-lei Meng, Xue-Lei Jing, Biao Zhang","doi":"10.5267/j.ijiec.2023.2.004","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.2.004","url":null,"abstract":"This paper addresses the permutation flowshop scheduling problem with peak power consumption constraints (PFSPP). The real-time power consumption of the PFSPP cannot exceed a given peak power at any time. First, a mathematical model is established to describe the concerned problem. The sequence of operations is taken as a solution and the characteristics of solutions are analyzed. Based on the problem characteristics, eight heuristics are proposed, including balanced machine-job decoding method, balanced machine-job insert method, balanced job-machine insert method, balanced machine-job group insert method, balanced job-machine group insert method, greedy algorithm, beam search algorithm, and improved beam search algorithm. Similarly, the canonical artificial bee colony algorithm and iterated local search algorithm are modified based on the problem characteristics to solve the PFSPP. A large number of experiments are carried out to evaluate the performance of new proposed heuristics and metaheuristics. The results and discussion show that the proposed heuristics and metaheuristics perform well in solving the PFSPP.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"18 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72891943","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":"Pricing and coordination of remanufacturing supply chain considering remanufacturing capacity and preferences under government mechanisms","authors":"Yanhua Feng, Shujun Yu","doi":"10.5267/j.ijiec.2023.2.006","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.2.006","url":null,"abstract":"The management of recycling and remanufacturing supply chains, which can help enterprises achieve low pollution, low energy consumption and sustainable development, has become a new strategy of modern enterprises. The factors of supply chain and government mechanisms will have an impact on enterprise decisions for recycling, remanufacturing and social welfare. In order to promote the sustainable operation of the supply chain, considering the coordination role of government mechanisms and supply chain, a recycling and remanufacturing supply chain model composed of a manufacturer, retailer and recycler is constructed. This paper discusses the pricing decision of new/remanufactured products, supply chain performance level, such as remanufacturing effort, publicity service efforts and profit, and social welfare in five models of three situations: centralized situation, including non-government mechanisms and non-supply chain coordination; manufacturer-led situation, including non-government mechanisms and non-supply chain coordination, government mechanisms and non-supply chain coordination, government mechanisms and supply chain coordination; government-led situation, including government mechanisms and non-supply chain coordination. It is found that under manufacturer-led situations, the government subsidy and bonus-penalty mechanisms can encourage manufacturer and retailer to actively participate in the recycling and remanufacturing activities. The supply chain coordination contract can further enhance the role of the consumer market and promote the implementation of government mechanisms. Manufacturer adopts a cost-sharing contract to encourage recyclers to carry out recycling activities. Under certain conditions, the contract can effectively improve the benefits and social welfare. The research conclusions have important theoretical and practical application value for the coordination and cooperation among enterprises in the supply chain and the formulation of government mechanisms.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"10 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84321174","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":"Half-open time-dependent multi-depot electric vehicle routing problem considering battery recharging and swapping","authors":"Fang Lijun, L. Changshi, Wu Zhang","doi":"10.5267/j.ijiec.2022.9.002","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.9.002","url":null,"abstract":"In order to promote green and sustainable development of the transportation industry, an increasing number of logistics companies have begun to deploy electric vehicles (EVs) to provide urban distribution services. This paper studies a Half-Open Time-Dependent Multi-Depot Electric Vehicle Routing Problem Considering Battery Recharging and Swapping (HOTDMDEVRPBRS) in last-mile delivery. Based on the calculation functions of EV energy consumption, travel time, and carbon emissions under the time-dependent road network, a mixed integer programming model is formulated. The goal of the model is to minimize the economic cost and environmental cost of logistics companies. Given the complexity of the problem, this paper designs a multi-objective simulated annealing algorithm (SAA). Finally, this paper carries out comprehensive computational experiments to verify and evaluate the performance of the proposed model and method and examines the economic and environmental benefits brought by the Half-Open Joint Distribution Mode (HOJDM). According to the results, SAA shows good performance and provides a high-quality solution. Meanwhile, the HOJDM significantly reduces the total cost and carbon emissions of logistics enterprises and provides valuable suggestions for enterprise managers and government decision-makers.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"9 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82745555","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 multiobjective scheme for closed-loop supply chains by considering financial criteria and scenarios","authors":"J. Escobar, William Adolfo Hormaza Peña, R. García-Cáceres","doi":"10.5267/j.ijiec.2022.12.004","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.12.004","url":null,"abstract":"This paper considers the closed-loop supply chain design problem by examining financial criteria and uncertainty in the parameters. A robust multiobjective optimization methodology is proposed by considering financial measures such as maximizing the net present value (NPV) and minimizing the financial risk (FR). The proposed methodology integrates various multiobjective optimization elements based on epsilon constraints and robustness measurements through the FePIA (named after the four steps of the procedure: Feature–Perturbation–Impact–Analysis) methodology. Similarly, an analysis of the parameter variability using scenarios was considered. The proposed method's efficiency was tested with real information from a multinational company operating in Colombia. The results show the effectiveness of the methodology in addressing real problems associated with supply chain design.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"37 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79037353","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":"A hybrid delayed differentiation multiproduct EPQ model with scrap and end-products multi-shipment policy","authors":"Yuan-Shyi Peter Chiu, Ya-Lei Lo, Tsu-Ming Yeh, Yunsen Wang, Hung-Yi Chen","doi":"10.5267/j.ijiec.2022.11.002","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.11.002","url":null,"abstract":"The present work intends to optimize a hybrid delayed differentiation multiproduct economic production quantity-EPQ model with the scrap and end-products multi-shipment policy. Since the requirements of multi-goods have a standard part in common, our fabrication planning adopts a two-phase delayed differentiation strategy to make the standard components first and produce the finished multi-goods in the second phase. Implementing a partial subcontracting option (with the additional expense) for the standard parts helps us to expedite the required uptime in the first phase. A screening process identifies the faulty items that need to be removed to ensure the in-house production quality. A multi-shipment plan delivers the finished lot of end-products to clients in fixed time intervals. This study optimizes the overall operating expenses of this intra-supply chain system, including fabrication, delivery, and client stock holding, through our proposed modeling, formulation, and optimization procedure. In addition, this study gives a numerical demonstration of the obtained results’ applicability and usefulness to managerial decision-making.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"1 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79367692","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":"Hybrid algorithm proposal for optimizing benchmarking problems: Salp swarm algorithm enhanced by arithmetic optimization algorithm","authors":"Erkan Erdemir","doi":"10.5267/j.ijiec.2023.1.002","DOIUrl":"https://doi.org/10.5267/j.ijiec.2023.1.002","url":null,"abstract":"Metaheuristic algorithms are easy, flexible and nature-inspired algorithms used to optimize functions. To make metaheuristic algorithms better, multiple algorithms are combined and hybridized. In this context, a hybrid algorithm (HSSAOA) was developed by adapting the exploration phase of the arithmetic optimization algorithm (AOA) to the position update part of the salp swarm algorithm (SSA) of the leader salps/salps. And also, there have also been a few new additions to the SSA. The proposed HSSAOA was tested in three different groups using 22 benchmark functions and compared with 7 well-known algorithms. HSSAOA optimized the best results in a total of 16 benchmark functions in each group. In addition, a statistically significant difference was obtained compared to other algorithms.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"30 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78903970","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":"Bio-inspired multi-objective algorithms applied on production scheduling problems","authors":"Beatriz Flamia Azevedo, Rub´én Montanño-Vega, M. Varela, A. Pereira","doi":"10.5267/j.ijiec.2022.12.001","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.12.001","url":null,"abstract":"Production scheduling is a crucial task in the manufacturing process. In this way, the managers must decide the job's production schedule. However, this task is not simple, often requiring complex software tools and specialized algorithms to find the optimal solution. In this work, a multi-objective optimization model was developed to explore production scheduling performance measures to help managers in decision-making related to job attribution under three simulations of parallel machine scenarios. Five important production scheduling performance measures were considered (makespan, tardiness and earliness times, number of tardy and early jobs), and combined into three objective functions. To solve the scheduling problem, three multi-objective evolutionary algorithms are considered (Multi-objective Particle Swarm Optimization, Multi-objective Grey Wolf Algorithm, and Non-dominated Sorting Genetic Algorithm II), and the set of optimum solutions named Pareto Front, provided by each one is compared in terms of dominance, generating a new Pareto Front, denoted as Final Pareto Front. Furthermore, this Final Pareto Front is analyzed through an automatic bio-inspired clustering algorithm based on the Genetic Algorithm. The results demonstrated that the proposed approach efficiently solves the scheduling problem considered. In addition, the proposed methodology provided more robust solutions by combining different bio-inspired multi-objective techniques. Furthermore, the cluster analysis proved fundamental for a better understanding of the results and support for choosing the final optimum solution.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"143 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90704375","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":"Marketplace channel encroachment under private brand introduction of online platform","authors":"Xiangsheng Wang, T. Chaolu, Yuchao Gao, Ying Wen, Peng Liu","doi":"10.5267/j.ijiec.2022.12.002","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.12.002","url":null,"abstract":"This paper studies the marketplace channel introduction of contract manufacturers and the response of the platform with an option to introduce a private brand. We develop a game-theoretical model to examine a three-tier e-commerce supply chain including a contract manufacturer (CM), an original equipment manufacturer (OEM) and a platform and derive the equilibrium results. We find that the marketplace channel introduction of the CM and the platform's private brand introduction influence each other. More specifically, marketplace channel encroachment may discourage the platform from introducing a private brand, and this preference is reinforced as the referral fee increases. Interestingly, the introduction of the platform's private brand increases the likelihood of contract manufacturer encroachment, which is mediated by the difference between the two private brands of the CM and platform--as the difference increases, the CM prefers to enter the marketplace channel. Furthermore, only contract manufacturer encroachment (or private brand introduction for the platform) can always benefit the whole supply chain, but the supply chain may be hurt when the platform and the CM perform their strategies simultaneously. In the extension section, in addition to demonstrating the validity of our main results when the CM and the OEM act as a single entity, we also find that the first-mover advantage of the platform may reduce the possibility of the contract manufacturer encroachment.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"3 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75623388","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":"Two-stage stochastic programming for the inventory routing problem with stochastic demands in fuel delivery","authors":"Zhenping Li, Pengbo Jiao","doi":"10.5267/j.ijiec.2022.7.004","DOIUrl":"https://doi.org/10.5267/j.ijiec.2022.7.004","url":null,"abstract":"The inventory routing problem (IRP) arises in the joint practices of vendor-managed inventory (VMI) and vehicle routing problem (VRP), aiming to simultaneously optimize the distribution, inventory and vehicle routes. This paper studies the multi-vehicle multi-compartment inventory routing problem with stochastic demands (MCIRPSD) in the context of fuel delivery. The problem with maximum-to-level (ML) replenishment policy is modeled as a two-stage stochastic programming model with the purpose of minimizing the total cost, in which the inventory management and routing decisions are made in the first stage while the corresponding resource actions are implemented in the second stage. An acceleration strategy is incorporated into the exact single-cut Benders decomposition algorithm and its multi-cut version respectively to solve the MCIRPSD on the small instances. Two-phase heuristic approaches based on the single-cut decomposition algorithm and its multi-cut version are developed to deal with the MCIRPSD on the medium and large-scale instances. Comparing the performance of the proposed algorithms with the Gurobi solver within limited time, the average objective value obtained by the proposed algorithm has decreased more than 7.30% for the medium and large instances, which demonstrates the effectiveness of our algorithms. The impacts of the instance features on the results are further analyzed, and some managerial insights are concluded for the manager.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"40 1","pages":""},"PeriodicalIF":3.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83601312","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}