Search results

This paper investigates a problem in a reverse logistics (RLs) network to decide whether to dispose of unsold goods in primary stores or re-commercialize them in outlet centers. By deducting the costs associated with each policy from its revenue, this study aims to maximize the profit from managing unsold goods.

A new mixed-integer linear programming model has been developed to address the problem, which considers the selling prices of products in primary and secondary stores and the costs of transportation, cross-docking and returning unwanted items. As a result of uncertain nature of the cost and time parameters, gray numbers are used to deal with it. In addition, an innovative uncertain solution approach for gray programming problems is presented that considers objective function satisfaction level as an indicator of optimism.

According to the results, higher costs, including transportation, cross-docking and return costs, make sending goods to outlet centers unprofitable and more goods are disposed of in primary stores. Prices in primary and secondary stores heavily influence the number of discarded goods. Higher prices in primary stores result in more disposed of goods, while higher prices in secondary stores result in fewer. As a result of the proposed method, the objective function satisfaction level can be viewed as a measure of optimism.

An integral contribution of this study is developing a new mixed-integer linear programming model for selecting the appropriate goods for re-commercialization and choosing the best outlet center based on the products' price and total profit. Another novelty of the proposed model is considering the matching percentage of boxes with secondary stores’ desired product lists and the probability of returning goods due to non-compliance with delivery dates. Moreover, a new uncertain solution approach is developed to solve mathematical programming problems with gray parameters.

This paper aims to minimize the mean-risk cost of sustainable and resilient supplier selection, order allocation and production scheduling (SS,OA&PS) problem under uncertainty of disruptions. The authors use conditional value at risk (CVaR) as a risk measure in optimizing the combined objective function of the total expected value and CVaR cost. A sustainable supply chain can create significant competitive advantages for companies through social justice, human rights and environmental progress. To control disruptions, the authors applied (proactive and reactive) resilient strategies. In this study, the authors combine resilience and social responsibility issues that lead to synergy in supply chain activities.

The present paper proposes a risk-averse two-stage mixed-integer stochastic programming model for sustainable and resilient SS,OA&PS problem under supply disruptions. In this decision-making process, determining the primary supplier portfolio according to the minimum sustainable-resilient score establishes the first-stage decisions. The recourse or second-stage decisions are: determining the amount of order allocation and scheduling of parts by each supplier, determining the reactive risk management strategies, determining the amount of order allocation and scheduling by each of reaction strategies and determining the number of products and scheduling of products on the planning time horizon. Uncertain parameters of this study are the start time of disruption, remaining capacity rate of suppliers and lead times associated with each reactive strategy.

In this paper, several numerical examples along with different sensitivity analyses (on risk parameters, minimum sustainable-resilience score of suppliers and shortage costs) were presented to evaluate the applicability of the proposed model. The results showed that the two-stage risk-averse stochastic mixed-integer programming model for designing the SS,OA&PS problem by considering economic and social aspects and resilience strategies is an effective and flexible tool and leads to optimal decisions with the least cost. In addition, the managerial insights obtained from this study are extracted and stated in Section 4.6.

This work proposes a risk-averse stochastic programming approach for a new multi-product sustainable and resilient SS,OA&PS problem. The planning horizon includes three periods before the disruption, during the disruption period and the recovery period. Other contributions of this work are: selecting the main supply portfolio based on the minimum score of sustainable-resilient criteria of suppliers, allocating and scheduling suppliers orders before and after disruptions, considering the balance constraint in receiving parts and using proactive and reactive risk management strategies simultaneously. Also, the scheduling of reactive strategies in different investment modes is applied to this problem.

This paper proposes a two-level supply chain including suppliers and manufacturers. The purpose of this paper is to design a resilient fuzzy risk-averse supply portfolio selection approach with lead-time sensitive manufacturers under partial and complete supply facility disruption in addition to the operational risk of imprecise demand to minimize the mean-risk costs. This problem is analyzed for a risk-averse decision maker, and the authors use the conditional value-at-risk (CVaR) as a risk measure, which has particular applications in financial engineering.

The methodology of the current research includes two phases of conceptual model and mathematical model. In the conceptual model phase, a new supply portfolio selection problem is presented under disruption and operational risks for lead-time sensitive manufacturers and considers resilience strategies for risk-averse decision makers. In the mathematical model phase, the stages of risk-averse two-stage fuzzy-stochastic programming model are formulated according to the above conceptual model, which minimizes the mean-CVaR costs.

In this paper, several computational experiments were conducted with sensitivity analysis by GAMS (General algebraic modeling system) software to determine the efficiency and significance of the developed model. Results show that the sensitivity of manufacturers to the lead time as well as the occurrence of disruption and operational risks, significantly affect the structure of the supply portfolio selection; hence, manufacturers should be taken into account in the design of this problem.

The study proposes a new two-stage fuzzy-stochastic scenario-based mathematical programming model for the resilient supply portfolio selection for risk-averse decision-makers under disruption and operational risks. This model assumes that the manufacturers are sensitive to lead time, so the demand of manufacturers depends on the suppliers who provide them with services. To manage risks, this model also considers proactive (supplier fortification, pre-positioned emergency inventory) and reactive (revision of allocation decisions) resilience strategies.

This study proposes strategies for vaccine center allocation for coronavirus disease (COVID) vaccine by determining the number of vaccination stations required for the vaccination drive, location of vaccination station, assignment of demand group to vaccination station, allocation of the scarce medical professional teams to station and number of optimal days a vaccination station to be functional in a week.

The authors propose a mixed-integer nonlinear programming model. However, to handle nonlinearity, the authors devise a heuristic and then propose a two-stage mixed-integer linear programming (MILP) formulation to optimize the allocation of vaccination centers or stations to demand groups in the first stage and the allocation of vaccination centers to cold storage links in the second stage. The first stage optimizes the cost and average distance traveled by people to reach the vaccination center, whereas the second stage optimizes the vaccine’s holding and storage and transportation cost by efficiently allocating cold storage links to the centers.

The model is studied for the real-world case of Chandigarh, India. The results obtained validate that the proposed approach can immensely help government agencies and policymaking body for a successful vaccination drive. The model tries to find a tradeoff between loss due to underutilized medical teams and the distance traveled by a demand group to get the vaccination.

To the best of our knowledge, there are hardly any studies on a vaccination program at such a scale due to sudden outbreaks such as Covid-19.

Supply chain risk management can effectively reduce the loss of retailers. In this regard, retailers need to consider the competition risks of competitors in addition to the disruption risks. This paper designs a resilient retail supply chain network for perishable foods under the dynamic competition to maximize retailer's profits.

A two-stage mixed-integer non-linear model is presented for designing the supply chain network. In the first stage, an equilibrium model that considers the characteristics of perishable foods is developed. In the second stage, a mixed integer non-linear programming model is presented to deal with the strategic decisions. Finally, an efficient memetic algorithm is designed to deal with large-scale problems.

The optimal the selection of suppliers, distribution centers and the order allocation are found among the supply chain entities. Considering the perishability of agri-food products, the equilibrium retail price and selling quantity are determined. Through a numerical example, the optimal inventory period under different maximum shelf life and the impact of three resilient strategies on retailer's profit, selling price and selling quantity are analyzed.

As for future research, the research can be extended in a number of directions. First, this paper studies the retail supply chain network design problem under competition among retailers. It can be an interesting direction to consider retailers competing with suppliers. Second, the authors can try to linearize the non-linear model and solve the large-scale integer programming problem by exact algorithm. Finally, the freshness of perishable foods gradually declines linearly to zero as the maximum shelf life approaches, and it would be a meaningful attempt to consider the freshness of perishable foods declines exponentially.

This paper innovatively designs the resilient supply chain network for perishable foods under dynamic competition. The retailer's dynamic competition and resilient strategies are considered simultaneously when designing supply chain network for perishable foods. In addition, this paper gives insights into how to obtain the optimal inventory period and compare the retailer's resilient strategies.

This study aims to address the inherent uncertainties within closed-loop supply chain (CLSC) networks through the application of a multi-objective approach, specifically focusing on the optimization of integrated production and transportation processes. The primary purpose is to enhance decision-making in supply chain management by formulating a robust multi-objective model.

In dealing with uncertainty, this study uses Pythagorean fuzzy numbers (PFNs) to effectively represent and quantify uncertainties associated with various parameters within the CLSC network. The proposed model is solved using Pythagorean hesitant fuzzy programming, presenting a comprehensive and innovative methodology designed explicitly for handling uncertainties inherent in CLSC contexts.

The research findings highlight the effectiveness and reliability of the proposed framework for addressing uncertainties within CLSC networks. Through a comparative analysis with other established approaches, the model demonstrates its robustness, showcasing its potential to make informed and resilient decisions in supply chain management.

This study successfully addressed uncertainty in CLSC networks, providing logistics managers with a robust decision-making framework. Emphasizing the importance of PFNs and Pythagorean hesitant fuzzy programming, the research offered practical insights for optimizing transportation routes and resource allocation. Future research could explore dynamic factors in CLSCs, integrate real-time data and leverage emerging technologies for more agile and sustainable supply chain management.

This research contributes significantly to the field by introducing a novel and comprehensive methodology for managing uncertainty in CLSC networks. The adoption of PFNs and Pythagorean hesitant fuzzy programming offers an original and valuable approach to addressing uncertainties, providing practitioners and decision-makers with insights to make informed and resilient decisions in supply chain management.

The paper formulates a bi-objective mixed-integer nonlinear programming model, aimed at minimizing the total labor hours and the workload unfairness for the multi-skilled worker assignment problem in Seru production system (SPS).

Three approaches, namely epsilon-constraint method, non-dominated sorting genetic algorithm 2 (NSGA-II) and improved strength Pareto evolutionary algorithm (SPEA2), are designed for solving the problem.

Numerous experiments are performed to assess the applicability of the proposed model and evaluate the performance of algorithms. The merged Pareto-fronts obtained from both NSGA-II and SPEA2 were proposed as final solutions to provide useful information for decision-makers.

SPS has the flexibility to respond to the changing demand for small amount production of multiple varieties products. Assigning cross-trained workers to obtain flexibility has emerged as a major concern for the implementation of SPS. Most enterprises focus solely on measures of production efficiency, such as minimizing the total throughput time. Solutions based on optimizing efficiency measures alone can be unacceptable by workers who have high proficiency levels when they are achieved at the expense of the workers taking more workload. Therefore, study the tradeoff between production efficiency and fairness in the multi-skilled worker assignment problem is very important for SPS.

The study investigates a new mixed-integer programming model to optimize worker-to-seru assignment, batch-to-seru assignment and task-to-worker assignment in SPS. In order to solve the proposed problem, three problem-specific solution approaches are proposed.

The purpose of this study is to develop a holistic optimization model for an integrated sustainable fleet planning and closed-loop supply chain (CLSC) network design problem under uncertainty.

A novel mixed-integer programming model that is able to consider interactions between vehicle fleet planning and CLSC network design problems is first developed. Uncertainties of the product demand and return fractions of the end-of-life products are handled by a chance-constrained stochastic program. Several Pareto optimal solutions are generated for the conflicting sustainability objectives via compromise and fuzzy goal programming (FGP) approaches.

The proposed model is tested on a real-life lead/acid battery recovery system. By using the proposed model, sustainable fleet plans that provide a smaller fleet size, fewer empty vehicle repositions, minimal CO₂ emissions, maximal vehicle safety ratings and minimal injury/illness incidence rate of transport accidents are generated. Furthermore, an environmentally and socially conscious CLSC network with maximal job creation in the less developed regions, minimal lost days resulting from the work's damages during manufacturing/recycling operations and maximal collection/recovery of end-of-life products is also designed.

Unlike the classical network design models, vehicle fleet planning decisions such as fleet sizing/composition, fleet assignment, vehicle inventory control, empty repositioning, etc. are also considered while designing a sustainable CLSC network. In addition to sustainability indicators in the network design, sustainability factors in fleet management are also handled. To the best of the authors' knowledge, there is no similar paper in the literature that proposes such a holistic optimization model for integrated sustainable fleet planning and CLSC network design.

Disruptions at ports may destroy the planned ship schedules profoundly, which is an imperative operation problem that shipping companies need to overcome. This paper attempts to help shipping companies cope with port disruptions through recovery scheduling.

This paper studies the ship coping strategies for the port disruptions caused by severe weather. A novel mixed-integer nonlinear programming model is proposed to solve the ship schedule recovery problem (SSRP). A distributionally robust mean conditional value-at-risk (CVaR) optimization model was constructed to handle the SSRP with port disruption uncertainties, for which we derive tractable counterparts under the polyhedral ambiguity sets.

The results show that the size of ambiguity set, confidence level and risk-aversion parameter can significantly affect the optimal values, decision-makers should choose a reasonable parameter combination. Besides, sailing speed adjustment and handling rate adjustment are effective strategies in SSRP but may not be sufficient to recover the schedule; therefore, port skipping and swapping are necessary when multiple or longer disruptions occur at ports.

Since the port disruption is difficult to forecast, we attempt to take the uncertainties into account to achieve more meaningful results. To the best of our knowledge, there is barely a research study focusing on the uncertain port disruptions in the SSRP. Moreover, this is the first paper that applies distributionally robust optimization (DRO) to deal with uncertain port disruptions through the equivalent counterpart of DRO with polyhedral ambiguity set, in which a robust mean-CVaR optimization formulation is adopted as the objective function for a trade-off between the expected total costs and the risk.

Maintenance stands are the most valuable maintenance resources and provide the necessary maintenance space and maintenance facilities for aircraft maintenance. To expand the maintenance market, maintenance, repair and overhaul (MRO) urgently need to achieve a reasonable schedule between aircraft maintenance requirements and maintenance stand capability to improve aircraft maintenance continuity and reduce the risk of scratching due to aircraft movement. This study aims to design a maintenance stand scheduling (MSS) model based on spatiotemporal constraints to solve the problem of maintenance stand schedules.

To address the problem of maintenance stand schedules, this study introduces mixed-integer programming algorithm to design the MSS model on the basis of classical hybrid flow shop structure. When designing the optimization objective function of MSS modeling, the spatiotemporal constraints are mainly considered. Specifically, first, the spatial constraints between maintenance stands are fully considered so that more aircraft can be parked in the workshop. Second, the optimization objective is designed to minimize the number of aircraft movements by defining multiple maintenance capabilities of the stand. Finally, a solution based on spatiotemporal constraints is proposed in the solving process.

A set of MRO production data from Guangzhou is used as a test data set to demonstrate the effectiveness of the proposed MSS model.

The types of maintenance stands are defined and divided into four categories: fixed stand, temporary stand, half-body stand and engine ground test stand, which facilitates optimal modeling; a new scheduling model is designed considering both temporal constraints and spatial constraints, which can improve both the utilization of maintenance stand and safety (reduce the risk of scratching between aircraft).