The advancement of Internet of Things technology enables the collection and transmission of real-time environmental and vehicle information, aiding the scheduling of postearthquake emergency supplies. Earthquakes often cause victims psychological pain due to insufficient supplies, and secondary disasters during transportation complicate supply scheduling. This study used a questionnaire to determine the psychological pain perception cost function of victims and identify the parameter value ranges under various environmental conditions. A fuzzy inference system was applied to ascertain the function parameters based on actual earthquake losses. Subsequently, a mixed-integer programming model for the multiperiod scheduling of emergency supplies was developed. An improved particle swarm optimization (IPSO) algorithm with a nondominated solution adjustment strategy was devised to solve the model and compared with the traditional particle swarm optimization (PSO) algorithm. The efficacy of the IPSO algorithm was validated through multiple examples. Additionally, a sensitivity analysis of factors such as supply satisfaction proportion was conducted. Results indicated that when remaining supplies fail to meet the minimum needs of undistributed disaster points, setting a minimum satisfaction percentage effectively reduces the total psychological pain cost. This study offers significant theoretical value in alleviating victims' psychological pain and enhancing rescue efficiency.

As Industry 4.0 continues to transform the manufacturing domain, the focus is shifting towards mass personalization of products, enabling companies to efficiently produce customized goods that meet individual customers’ unique needs and preferences. This requires manufacturing enterprises to be flexible and adaptable with their scheduling processes and manufacturing setup. Flexibility and subsequent realization of personalization of products can be realized by utilizing the notion of a Line-less Assembly System (LAS), which replaces a fixed conveyor system with a system in which the products move between machines, with products being fitted on Autonomous Mobile Robots (AMRs) to transport the products from one machine to another as per their production routing. This necessitates scheduling products as per their production routing on available AMRs to reap the benefits of LAS, which is viewed as a Job Shop Scheduling Problem (JSSP) to maximize resource utilization while adhering to constraints. The novelty of this approach is that, in addition to scheduling products, it also considers the scheduling of AMRs. A mathematical formulation to solve the deterministic JSSP is presented in the current work. The formulation is solved for various inputs using a mathematical solver. In general, JSSPs are NP-hard problems. Subsequently, a meta-heuristic-based Genetic Algorithm (GA) has been constructed to solve the JSSP. The solutions obtained through both GA and mathematical solver are compared, and it was found that GA performs well in computation and optimization efficiencies.

Recyclers can derive benefits from horizontal demand information sharing with competitors under specific conditions. However, these advantages may be compromised by the actions of remanufacturers. Information leakage occurs when a remanufacturer selectively discloses information obtained from one recycler to another. This study aims to support recyclers within the reverse supply chain in effectively engaging in horizontal information sharing while mitigating the risk of remanufacturers disclosing proprietary information to competitors, thereby preventing the dissemination of information contrary to the recyclers' intentions for sharing. The research focuses on analyzing the impact of horizontal information sharing and information leakage on the profitability of both remanufacturers and recyclers. An analytical model has been developed based on partial and asymmetric signals of customer valuation. Three scenarios are explored: no information sharing and no leakage, information sharing only, and scenarios involving both sharing and leakage. The novelty of this study lies in its examination of a demand process characterized by distributional uncertainty, which mirrors the informational challenges faced by recyclers entering new markets or expanding into new recycling categories. Recyclers operate with incomplete information and cannot determine whether they possess superior information compared to their competitors. The findings suggest that information sharing among recyclers can enhance the profits of those experiencing high demand but may adversely affect those with lower demand levels. In the absence of horizontal information sharing between recyclers, remanufacturers tend to leak information about higher-demand recyclers to others. Ultimately, managers of competing firms who face uncertainty regarding their information standing should consider sharing information to gain improved demand forecasts or, at minimum, to prevent remanufacturers from exploiting information leakage for personal gain. This refined analysis provides critical insights for stakeholders in the reverse supply chain, highlighting the complex interplay between information sharing and competitive advantage, as well as the strategic importance of managing information flow to safeguard business interests.

This study explores technology licensing in a low-carbon supply chain under cap-and-trade regulations, with an upstream firm holding partial shareholding in a downstream firm. We established a Stackelberg game to analyze four licensing strategies: free, fixed fee, royalty, and revenue-sharing. We investigate the effects of vertical shareholding and cap-and-trade regulation, as well as whether technology licensing yields a more favorable outcome compared to non-licensing and which licensing strategy proves superior. The findings reveal that when the upstream firm holds a higher share in the downstream firm, it results in increased profits for the upstream firm, the supply chain system, and consumer surplus, but decreased profit for the downstream firm. Furthermore, when carbon emission quotas are sufficiently high (low), a higher carbon trading price leads to increased (decreased) supply chain profitability, while inevitably decreasing consumer surplus. Increased carbon emission quotas consistently contribute to increased supply chain profitability, but have no impact on consumer surplus. All licensing contracts enhance the profitability of the upstream firm, the supply chain system, as well as consumer surplus, with revenue-sharing emerging as the most effective strategy. However, whether technology licensing promotes social welfare depends on factors such as the carbon emissions per unit of product and the environmental impact of each unit of carbon emission.

This paper presents a comprehensive review of the last two decades of research on Kidney Exchange Programs (KEPs), systematically categorizing and classifying key contributions to provide readers with a structured understanding of advancements in the field. The review highlights the evolution of KEP methodologies and lays the foundation for our contribution. We propose three mathematical models aimed at improving both the quantity and quality of kidney transplants. Model 1 maximizes the number of transplants by focusing on compatibility based on blood type and PRA, without additional constraints. Model 2 introduces a minimum Human Leukocyte Antigen (HLA) compatibility threshold to enhance transplant quality, though this leads to fewer matches. Model 3 extends the problem to a Multi-Agent Kidney Exchange Program (MKEP), pooling incompatible donor-recipient pairs across multiple agents, resulting in a higher number of successful transplants while ensuring fairness across agents. Sensitivity analyses demonstrate trade-offs between transplant quantity and quality, with Model 3 striking the optimal balance by leveraging multi-agent collaboration to improve both the number and quality of transplants. These findings underscore the potential benefits of more integrated kidney exchange systems.

Deferred payment and revenue-sharing contracts are significantly important for promoting the collaboration and the management of retail export supply chains for cross-border e-commerce. This research addresses the real-world challenges faced by managers in this domain by using a joint optimization model to investigate the best ordering and pricing tactics within cross-border e-commerce retail export supply chains, particularly taking into account export tax rebates and import tariffs. Our findings reveal that while revenue-sharing contracts and deferred payment mechanisms can significantly enhance supply chain profitability, their effectiveness is contingent on variables such as export rebate rates, tariffs, and tariff transfer factors. The practical implications of this study suggest that business administrators should carefully assess these factors when designing contracts to ensure robust supply chain coordination. When traditional contract mechanisms fail, hybrid approaches combining revenue-sharing and deferred payment can offer superior outcomes, thus providing a strategic advantage in volatile markets. These insights are crucial for managers seeking to navigate the complexities of international trade and optimize their supply chain performance.

This study focuses on the flexible job shop scheduling problem with sequence-dependent setup times (FJSP-SDST), and the goal is minimizing the makespan. To solve FJSP-SDST, first, we develop a constraint programming (CP) model to obtain optimal solutions. Due to the NP-hardness of FJSP-SDST, a CP assisted meta-heuristic algorithm (C-VNS-CP) is designed to make use of the advantages of both CP model and cooperative variable neighborhood search (C-VNS). The C-VNS-CP algorithm consists of two stages. The first stage involves C-VNS, for which eight neighborhood structures are defined. In the second stage, CP is used to further optimize the good solution obtained from C-VNS. In order to prove the efficiency of the C-VNS algorithm, CP model, and C-VNS-CP algorithm, experiments of 20 instances are conducted.

Many uncertainties arise during the manufacturing process, such as changes in the working environment, traffic transportation delays, machine breakdowns, and worker performance instabilities. These factors can cause job processing times and ready times to change. In this study, we address a scheduling model for a single machine where both job release dates and processing times are scenario dependent. The objective is to minimize the total completion time across the worst-case scenarios. Even without the uncertainty factor, this problem is NP-hard. To solve it, we derive several properties and a lower bound used in a branch-and-bound method to find an optimal solution. We propose nine heuristics based on a linear combination of scenario-dependent processing times and release times for approximate solutions. Additionally, we offer an iterated greedy population-based algorithm that efficiently solves this problem by taking advantage of the diversity of solutions. We evaluate the performance of the proposed nine heuristics and the iterated greedy population-based algorithm.

Facing current client expectations for high quality, timely order response, and multiple shipments of various needed merchandise, today’s producers must simultaneously satisfy external requirements and operate internally with minimum overall expenses and capacity constrained. Aiming to help present-day producers achieve the operational goals mentioned above, this work develops a decisional scheme to determine the best manufacturing-delivery policy for a multi-item economic production quantity (EPQ) system with multi-shipment, quality assurance, overtime, postponement, and external source. Combining a production postponement strategy in our multi-item batch fabricating procedures intends to first make all required standard/common parts for various client-needed merchandise and make finished goods in the 2nd phase. Two fabricating-uptime-shortening strategies are adopted: contracting out a proportion of the standard part’s batch and overtime-making of finished goods. We include screening and rework tasks in fabricating procedures to help us remove the identified scraps and correct the repairable faulty items. The quality-assured finished batches are divided into multiple equal-amount shipments transported to meet client requests. The overall manufacturing-transportation relevant expenses, including quality and uptime-expedited costs, are mathematically modeled and minimized using optimization methodology to help derive the best manufacturing-delivery operating policy. Moreover, we offer an illustration to validate the results and our research scheme’s capability numerically. This work mainly contributes to the literature by presenting a practical decision-making model. It enables the producers to expose numerous crucial problem-related managerial insights to facilitate producers in deciding the most appropriate manufacturing-delivery policy to meet clients’ multi-criteria demands.

Assembly lines, generally speaking, can reduce production costs, shorten cycle times, and achieve higher quality levels. Since the current market is characterized by increasing product variability, mixed-model assembly lines, in which similar product models can be assembled simultaneously, are more suitable to respond to varied market demands than traditional single-model assembly lines. In addition, in an assembly line, tasks often differ in processing requirements, and workers may have different qualification levels. This study, therefore, aims to construct models for the multi-objective mixed-model assembly line balancing problem with hierarchical worker assignment (MO-MALBP-HW). The goal is to generate a suitable plan for a mixed-model assembly line balancing problem considering the constraint of a hierarchical workforce, the cost of a hierarchical workforce, and production cycle time. When the problem is simple, it can be solved by a mixed integer programming (MIP) model. When the problem becomes complex, it can be solved by a multi-objective genetic algorithm (MOGA) and a non-dominated sorting genetic algorithm II (NSGA-II) to obtain a near-optimal solution. The implementation of this model can effectively manage the multi-objective mixed-model assembly line balancing plan, thereby improving plant efficiency and reducing cost.