A simple and effective multi-attribute decision-making method, named as BHARAT method, is proposed in Part-1 of this paper and the same method is used now as a multi- and many-objective decision-making method for evaluating the Pareto optimal solutions. The proposed BHARAT method is used to identify the best compromise Pareto solution. Based on their importance for the given optimization problem, the objectives are ranked, and the weights are assigned. The weights of the objectives and the normalized values of the objectives for different Pareto optimal solutions are used to compute the total scores. The total scores are used to differentiate the alternative optimal solutions and an alternative solution that gets the highest total score is suggested as the best compromise solution. Three case studies are presented to illustrate and validate the proposed BHARAT method. The case study 1 is a multi-objective optimization problem related to cloud manufacturing with 3 objectives and 20 alternative solutions; case study 2 is a many-objective optimization problem of electro-discharge machining process with 4 objectives and 50 alternative solutions; case study 3 is a many-objective optimization of milling process parameters with 4 objectives and 100 alternative solutions. The outcomes of the suggested BHARAT method are compared with those of the other popular decision-making approaches for each of the three case studies considered. The suggested simple and more logical BHARAT method can be used in multi- and many-objective optimization problems to select the best compromise solution.

A simple and effective multi-criteria decision-making methodology named as “Best Holistic Adaptable Ranking of Attributes Technique (BHARAT)” is proposed that can be used in single- as well as group decision-making scenarios of the industrial environment. The attributes data for various alternatives can be quantitative or qualitative (i.e., expressed in linguistic terms). This paper proposes to transform the qualitative attributes into quantitative attributes by means of simple linear scales rather than complex fuzzy scales. The proposed BHARAT method normalizes the data with reference to the “best” alternative corresponding to an attribute and the normalization procedure is repeated for all the attributes to get the normalized data. A group of decision-makers or a decision-maker assigns ranks to the attributes according to how important they are deemed to be, and these ranks are then transformed into the proper weights. The total scores of the alternatives are calculated by multiplying the weights of the attributes by the corresponding normalized data of the attributes for different alternatives. Four industrial case studies are presented to illustrate the potential of the suggested BHARAT method. The first case study deals with the problem of an automated warehouse selection for a large industrial plant involving a single decision-maker, 13 attributes, and 4 alternative warehouses; the second case study deals with the problem of sustainable maintenance service provider selection for a large petrochemical plant involving fuzzy group decision-making with 5 decision-makers, 9 attributes, and 4 alternative maintenance service providers; the third case study deals with the problem of alternative strategy selection for implementation of a make-to-order system for passenger car manufacturers involving 6 factors, 18 sub-factors, and 3 alternative strategies; and the fourth case study deals with the problem of process parameters selection in a sustainable high speed turning operation involving 4 attributes and 9 alternative sets of experimental conditions. The results of the proposed decision-making method and its second version are compared with the other popular decision-making methods. The proposed method and its another version are proved simple, effective, powerful, flexible, easy to apply, do not require the use of fuzzy logic, offer logical and consistent procedures to assign weights to the attributes, and are applicable to different decision-making scenarios of the industries. Part-1 of this paper describes the applications of the BHARAT method to multi-attribute decision-making problems and Part-2 describes the evaluation of Pareto solutions using the BHARAT method in multiple objective decision-making problems.

Batch dispersion problem (BDP) restricts batch traceability in large-scale discrete production and negatively impacts batch recall costs. However, previous research has ignored the complexity of the BDP in their analyses. This paper investigates the BDP under the composed bill of materials (BOM) and develops a mathematical model for the BDP with the goal of minimizing the total batch dispersion by utilizing the batch dispersion as a measure of the degree of dispersed usage of part batches. BDP-GAVNS, a hybrid genetic algorithm with variable neighborhood search, is devised for the BDP based on the demonstration that the BDP is an NPC problem. In BDP-GAVNS, memory banks were introduced to increase the diversity of individuals performing crossover operations. Additionally, the encoding method and infeasible solution repair program are designed according to the characteristics of BDP. Numerical experiments validate the viability and effectiveness of BDP-GAVNS in solving BDP. They demonstrate that (1) the optimal combination occurs when the ratio of individuals produced by the three types of population initialization methods, namely global selection (GS), local selection (LS), and random selection (RS), to the population takes values of 0.30, 0.10, and 0.60, respectively; (2) The memory bank enriches the source of individuals required for crossover operations and improves the performance of crossover operations; and (3) The BDP-GAVNS is more effective than the other five heuristic algorithms including genetic algorithms in seeking the optimal solution of BDP.

Introduce government competition policies and technological innovation efforts into the profit game model of the photovoltaic industry supply chain, establish two different supply chain profit models, and study the impact of government competition policies and manufacturers' technological innovation efforts on the profits of each manufacturer and the overall profit of the supply chain. Construct profit models in both competitive and cooperative situations, and empirically analyze the impact of government competition policies and manufacturers' technological innovation efforts on the optimal supply chain profits in both competitive and cooperative situations. Research has shown that: (1) government competition policies are conducive to promoting an increase in manufacturers' profits; (2) The increase in technological innovation efforts can quickly increase manufacturers' profits; (3) Compared to the cooperation situation, the profit of each manufacturer and the total profit of the entire supply chain are higher in the competitive situation.

This paper establishes a location-routing optimization model of the distribution center for emergency supplies with the goals of system reaction time, total cost of consumption, psychological fear of the populace in disaster-affected locations, and material usage rate. Where the excess time, demand, and penalty coefficient are the components of the penalty cost in the total consumption cost, and where the psychological panic of those in the affected area is represented by the psychological perception function of panic developed in accordance with the prospect theory. An improved hybrid multi-objective cuckoo-large-neighborhood search algorithm was then designed to introduce tent mapping, nonlinear inertia weights, elite strategies, congestion operators, and dynamically adjusted discovery probabilities into the standard multi-objective cuckoo optimization algorithm, which generates a new solution using a large-neighborhood search algorithm after discarding part of the solution with the discovery probability, and then accepts the current nondominated solution with dynamic probabilities. The paper uses the improved algorithm to solve Christofides69, an arithmetic example from the standard dataset of the LRP problem, and the results show that the solution provided by the improved algorithm outperforms the solutions provided by the standard multi-objective cuckoo search algorithm and the NSGA-II algorithm in terms of the total cost of dissipation, the level of psychological panic of the people in the affected area, the rate of utilization of the supplies, and the number of distribution centers open. Finally, the improved algorithm was used to analyze cases of different sizes separately, and it was found that the algorithm yielded better results and was therefore able to demonstrate its effectiveness.

This study aims to optimize a hybrid multi-item fabricating-shipping integrated system incorporating scrap, adjustable rate, and postponement. In present-day competitive market environments, there is a clear client demand trend for various goods, shorter lead time, and expected quality. To satisfy the client’s needs, the management of manufacturing firms requires an effective and efficient plan to fabricate various high-quality goods in an expedited period, under limited capacity, and with minimal operating expenses. Inspired by facilitating production management to determine the best fabricating scheme/plan to achieve their operational goals, this work proposes an exploratory postponement model with quality assurance and uptime reduction strategies for their decision-making. By employing a two-phase making scheme, the required standard components are first made in the 1st phase, and multiple finished merchandise is fabricated in the 2nd phase. The study suggests strategies of contracting out a part of the common parts’ batch and adopting an adjusted/expedited making rate in the 2nd phase to considerably reduce both phases’ production uptimes. During both fabricating processes, the screening tasks identify/remove scrapped/faulty goods to ensure each finished batch’s quality. Equal-amount multiple shipments of end merchandise are transported to the clients in fixed time-interval. Optimization methodology and mathematical analyses support us in deriving the model’s expected annual operating cost and deciding the optimal production-transportation policy. A numerical illustration helps verify our model’s applicability and reveals important managerial insights into the studied problem to facilitate management in decision-making.

This research delves into the software testing process and its environmental factors to uncover the core elements influencing software reliability. Specifically, it focuses on the learning and negligent aspects of the software reliability growth model. The learning factor accelerates reliability growth, leading to an S-shaped curve in the mean value function, while the negligent factor highlights the occurrence of imperfect debugging. The study also uses Brownian motion and stochastic differential equations to establish statistical confidence intervals for reliability and costs. These intervals aid software managers in assessing potential release risks at various confidence levels, allowing them to make informed decisions considering resource constraints and desired system reliability levels across different scenarios.

The One-Dimensional Cutting Stock Problem consists in cutting long bars into smaller ones, to satisfy customers’ demand, minimizing waste and cost. In this paper the standard problem is extended with the inclusion of additional constraints that are generally neglected in scientific literature, although relevant in many industrial applications. We also modified the standard objective function, by assuming that bars may have a different economical value and a different processing or shipping priority. Moreover, in line with business requirements, among solutions that generate the same cutting waste, we prefer the ones that generate a low number of leftovers, especially if leftovers are long, so that the likelihood of their reuse is high. To solve the problem, we propose a Simulated Annealing based heuristic, which exploits a specific neighbor search. The heuristic is implemented in a parametric way that allows the user to set the priorities of the bars and to choose the specific sub-set of constraints he or she wants to consider. The heuristic is finally tested on many problem instances, and it is compared to three benchmarks and to one commercial software. The outcomes of this comparative analysis demonstrate both its quality and effectiveness.

Safety is a top concern for the civil aviation industry, and the risk of safety accidents will increase due to pilot fatigue. To ensure the safety of civil aviation, this paper proposes a method to solve the crew scheduling problem considering pilot fatigue. In order to reflect individual differences and fatigue levels of pilots, an improved three-stage alertness calculation model is first proposed based on subjective and objective perspectives to represent pilots’ alertness levels and fatigue working duration quantitatively. Then, for the crew scheduling problem considering pilot fatigue, a mixed integer programming model is constructed to simultaneously achieve the optimization objectives of reducing the overall scheduling cost and crew fatigue working duration. Next, since the actual crew scheduling problem is large-scale, a solution algorithm based on a column generation framework is developed to improve the quality and efficiency of solving the large-scale crew scheduling problem. Furthermore, in the case study, we collected actual data from an airline company to validate the effectiveness of our proposed method. Finally, through multiple experimental comparisons and analyses, to balance the two optimization objectives mentioned above, it is more reasonable to handle pilot fatigue working duration with soft constraints. Sensitivity analysis reveals the variation rules of the crew cost and fatigue, providing some valuable managerial insights for the crew scheduling problem considering pilot fatigue.

Data sharing is a critical component in a blockchain traceability platform. Therefore, creating a reasonable incentive mechanism to ensure that all enterprises participate in data sharing is vital for blockchain platforms. Currently, many researchers employ evolutionary game theory to analyze problems related to data sharing. However, evolutionary game theory typically assumes that the population composed of enterprises is mixed uniformly. Enterprises in the manufacturing industry are not uniformly mixed, as they tend to have specific connections with each other due to the size of enterprises and volume of business. Therefore, a networked evolutionary game is introduced to solve this problem. Firstly, an incentive model for enterprises sharing data is established. Then, a scale-free network is employed to simulate the connections between enterprises. To comprehensively consider the individual and group benefits of enterprises in the game, this study designs a strategy update rule for networked evolutionary game based on Discrete Particle Swarm Optimization and Variable Neighborhood Descent algorithm. To tackle the challenge of determining reasonable incentive values in networked evolutionary games, this study proposes a dynamic incentive mechanism based on the Q-Learning algorithm. Finally, the experiments indicate that this method can successfully facilitate the stable involvement of enterprises in data sharing.