In this paper, a novel multi-objective robust possibilistic programming model is proposed, which simultaneously considers maximizing the distributive justice in relief distribution, minimizing the risk of relief distribution, and minimizing the total logistics costs. To effectively cope with the uncertainties of the after-disaster environment, the uncertain parameters of the proposed model are considered in the form of fuzzy trapezoidal numbers. The proposed model not only considers relief commodities priority and demand points priority in relief distribution, but also considers the difference between the pre-disaster and post-disaster supply abilities of the suppliers. In order to solve the proposed model, the LP-metric and the improved augmented ε-constraint methods are used. Second, a set of test problems are designed to evaluate the effectiveness of the proposed robust model against its equivalent deterministic form, which reveales the capabilities of the robust model. Finally, to illustrate the performance of the proposed robust model, a seismic region of northwestern Iran (East Azerbaijan) is selected as a case study to model its relief logistics in the face of future earthquakes. This investigation indicates the usefulness of the proposed model in the field of crisis.

In this paper, a new hybrid AHP and Dempster-Shafer Theory of Evidence is presented for solving the problem of choosing the best project among a list of available alternatives while uncertain risk factors are taken into account. The aim is to minimize overall risks. For this purpose, four groups of risk factors, including Properties, Operational and Technological, Financial, Strategic risk factors, are considered. Then using an L24 Taguchi method, several experiments with various dimensions have been designed and solved by the proposed algorithm. The outcomes are then analyzed using the Validating Index (VI), Reduced Risk Indicator (R.R.I%), and Solving time. The findings indicated that, compared to the classic AHP, the results of the proposed hybrid method were different in most cases due to uncertainty of risk factors. It was observed that the method could be safely used for selecting project problems in real industries.

Since scheduling literature has a wide range of uncertainties, it is crucial to take these into account when solving performance measure problems. Otherwise, the performance may severely be affected in a negative way. In this paper, an algorithm is proposed to minimize the total completion time (TCT) of a two-machine no-wait flowshop with uncertain setup times within lower and upper bounds. The results are compared to the best existing algorithm in scheduling literature: the programming language Python is used to generate random samples with respect to various distributions, and the TCT of the proposed algorithm is compared to that of the best existing one. Results reveal that the proposed one significantly outperforms the best one given in literature for all considered distributions. Specifically, the average percentage improvement of the proposed algorithm over the best existing one is over 90%. A test of hypothesis is conducted to further confirm the results.

Increasing attention to environmental problems and social responsibility lead to appear reverse logistic (RL) issues in designing supply chain which, in most recently, has received considerable attention from both academicians and practitioners. In this paper, a multi-product reverse logistic network design model is developed; then a hybrid method including Chance-constrained programming, Genetic algorithm and Monte Carlo simulation, are proposed to solve the developed model. The proposed model is solved for risk-averse and risk-seeking decision makers by conditional value at risk, sum of the excepted value and standard deviation, respectively. Comparisons of the results show that minimizing the costs had no direct relation with the kind of decision makers; however, in the most cases, risk-seeking decision maker gained more return products than risk-averse ones. It is clear that by increasing returned products to the chain, production costs of new products and material will be reduced and also by this act, environmental benefits will be created.

Recently, researchers have focused on how to minimize the negative effects of industrial activities on environment. Consequently, they work on mathematical models, which minimize the environmental issues as well as optimizing the costs. In the field of supply chain network design, most managers consider economic and environmental issues, simultaneously. This paper introduces a bi-objective supply chain network design, which uses fuzzy programming to obtain the capability of resisting uncertain conditions. The design considers production, recovery, and distribution centers. The advantage of using this model includes the optimal facilities, locating them and assigning the optimal facilities to them. It also chooses the type and the number of technologies, which must be bought. The fuzzy programming converts the multi objective model to an auxiliary crisp model by Jimenez approach and solves it with ?-constraint. For solving large size problems, the Multi Objective Differential Evolutionary algorithm (MODE) is applied.

One of the primary assumptions in many project portfolio selection is the availability of all parameters. However, in real-world cases, many parameters are under uncertainty and the exact values are unknown in advance. This paper presents a scenario based mathematical model for project portfolio selection when parameters are under uncertainty. The problem considers two objective functions where the first one maximizes the net present value while the second objective function is the minimization of the positive deviations from the allocation of resources. The second objective function is looking for project resource leveling. The resulted model is formulated as mixed integer programming and the problem is analyzed under different conditions.

Project scheduling models with resource constraints and multi-mode activities aims to create a schedule for carrying out activities considering precedence constraints and available resources in order to minimize the project duration. In the real world, we face uncertainty related to projects, where there are no historical data, hence, we should rely on the experts' judgements to estimate activity durations. For this purpose, in this paper, the 99-simulation method is used to deal with uncertainty. The exact mathematical programming model is presented in this paper and the hybrid algorithm based on Genetic Algorithm is used to solve this type of project scheduling problem which finds the near-optimal solution in a short computational time. Finally, the effectiveness of the proposed model is examined with a numerical example.

Making rational decisions in times of uncertainty is an important capability required of marketing managers. However, choosing the precise quantitative decision-making technique or a combination of such tools usually presents managers with a score of challenges. To lessen this challenge, this single case research demonstrates how the choice of three Bayesian decision models (Laplace criterion, Savage minimax regret, and Hurwicz coefficient of realization) can reduce uncertainty in content marketing, search engine optimization (SEO), and referral marketing decision. We employed the case study approach to enable direct access to the decision-making process of the case organization, and to collect relevant data relating to the three marketing decision variables. Results show that, although the Laplace criterion may not have a direct effect on content marketing decisions, it influences the decision-making process leading to the creation and promotion of content. The Savage minimax regret had a direct bearing on SEO decision-making. Hurwicz's coefficient of realization yielded no direct impact on referral marketing but shows the possibility of influencing decision-making processes that led to the development and implementation of referral marketing campaigns. The implications are discussed.

We study a location-inventory problem in a three level supply chain network under uncertainty, which leads to risk. The (r,Q) inventory control policy is applied for this problem. Besides, uncertainty exists in different parameters such as procurement, transportation costs, supply, demand and the capacity of different facilities (due to disaster, man-made events and etc). We present a robust optimization model, which concurrently specifies: locations of distribution centers to be opened, inventory control parameters (r,Q), and allocation of supply chain components. The model is formulated as a multi-objective mixed-integer nonlinear programming in order to minimize the expected total cost of such a supply chain network comprising location, procurement, transportation, holding, ordering, and shortage costs. Moreover, we develop an effective solution approach on the basis of multi-objective particle swarm optimization for solving the proposed model. Eventually, computational results of different examples of the problem and sensitivity analysis are exhibited to show the model and algorithm & apos; s feasibility and efficiency.

Having an efficient budget normally has different advantages such as measuring the performance of various organizations, setting appropriate targets and promoting managers based on their achievements. However, any budgeting planning requires prediction of different cost components. There are various methods for budgeting planning such as incremental budgeting, program budgeting, zero based budgeting and performance budgeting. In this paper, we present a fuzzy goal programming to estimate operational budget. The proposed model uses fuzzy triangular as well as interval number to estimate budgeting expenses. The proposed study of this paper is implemented for a real-world case study in province of Qom, Iran and the results are analyzed.