International Journal of Industrial Engineering & Production Research

---

Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the feasible region via stepwise movements and a plain continuous interaction with Decision Maker (DM). We consider the case where all objective functions and constraints are linear. The implementation of the proposed algorithm is demonstrated with two numerical examples.

---

This paper deals with the problem of forbidden states in discrete event systems modeled by Petri Net. To avoid the forbidden states, some constraints which are called Generalized Mutual Exclusion Constraints can be assigned to them. Enforcing these constraints on the system can be performed using control places. However, when the number of these constraints is large, a large number of control places must be connected to the system which complicates the model of controller. In this paper, the objective is to propose a general method for reducing the number of the mentioned constraints and consequently the number of control places. This method is based on mixing some constraints for obtaining a constraint verifying all of them which is performed using the optimization algorithms. The obtained controller after reducing the number of the control places is maximally permissive.

---

In this paper, we propose an extended relocation model for warehouses configuration in a supply chain network, in which uncertainty is associated to operational costs, production capacity and demands whereas, existing researches in this area are often restricted to deterministic environments. In real cases, we usually deal with stochastic parameters and this point justifies why the relocation model under uncertainty should be evaluated. Albeit the random parameters can be replaced by their expectations for solving the problem, but sometimes, some methodologies such as two-stage stochastic programming works more capable. Thus, in this paper, for implementation of two stage stochastic approach, the sample average approximation (SAA) technique is integrated with the Bender's decomposition approach to improve the proposed model results. Moreover, this approach leads to approximate the fitted objective function of the problem comparison with the real stochastic problem especially for numerous scenarios. The proposed approach has been evaluated by two hypothetical numerical examples and the results show that the proposed approach can find better strategic solution in an uncertain environment comparing to the mean-value procedure (MVP) during the time horizon.

---

This paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. In addition, the setup time of a job on each machine is proportional to the actual processing time of the already processed jobs on the corresponding machine, i.e., the setup time of a job is past- sequence-dependent (p-s-d). The objective is to determine jointly the jobs assigned to each machine and the order of jobs such that the total completion time (called TC) is minimized. Since that the problem is NP-hard, optimal solution for the instances of realistic size cannot be obtained within a reasonable amount of computational time using exact solution approaches. Hence, an efficient method based on ant colony optimization algorithm (ACO) is proposed to solve the given problem. The performance of the presented model and the proposed algorithm is verified by a number of numerical experiments. The related results show that ant colony optimization algorithm is effective and viable approache to generate optimal⁄near optimal solutions within a reasonable amount of computational time.

---

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. Firstly, with respect to the proposed problem a mixed integer linear programming model is developed. Since the problem is NP-hard, for solving large size problems, a hybrid meta-heuristic algorithm which combines artificial immune system and simulated annealing is proposed. The performance of hybrid algorithm is tested by some numerical experiments and the results show its superiority to the other two algorithms.

---

In the new strategies of purchasing and production, suppliers play a key role in achieving of competitive capability for big companies. The selection of suitable suppliers is a critical component of this strategy. The problem of allocation order to supplier is a multi-objective problem that includes fuzzy parameters and also suppliers usually consider discount due to different levels of purchase amount. Since there is not a multi-objective fuzzy model for allocating orders in the literature that consider discount and shortfall simultaneously in the planning horizon of multi-products, this research proposes a new model includes minimization of costs, delays and the percentage of defective parts as objective functions. Jimenez method is used to defuzzy price, demand, delay and percentage of defective parts. Since the model is NP-hard, the two metaheuristic algorithms, NSGAII and MOPSO that their parameters were set by the Taguchi method has been developed. According to the results of numerical problems, the proposed algorithms can provide a good approximation of the optimal solutions for intended objectives.
 

---

Sustainable supply chain networks have attracted considerable attention in recent years as a means of dealing with a broad range of environmental and social issues. This paper reports a multi-objective mixed-integer linear programming (MILP) model for use in the design of a sustainable closed loop supply chain network under uncertain conditions. The proposed model aims to minimize total cost, optimize environmental impacts of establishment of facilities, processing and transportation between each level as well as social impacts including customer satisfaction. Due to changes in business environment the uncertainty existed in the research problem, in this paper the chance constrained fuzzy programming approach applied to cope with uncertainties in parameter of the proposed model. Then the proposed multi-objective model solves as single-objective model using LP-metric method.

---

In this paper, a new five-parameter distribution is proposed that is called MarshallOlkin Gompertz Makeham distribution(MOGM). This new model is applicable in analysis lifetime data, engineering and actuarial. In this research, some properties of the new model such as mode, moment, Reyni entropy, Tsallis entropy, quantile function and the hazard rate function which is decreasing and unimodal, are studied. The unknown parameters of the MOGM distribution are estimated using the maximum likelihood and Bayes methods. Then these methods are compared using Monte Carlo simulation and the best estimator is proposed. Finally, applications of the proposed model are illustrated to show its usefulness.

---

The introduction of blockchain technology into the food supply chain represents a digital revolution that has led to widespread advances in tracking food security. This article presents a comprehensive review of the literature on the use of blockchain in the food supply chain. This article is a review of the synthesis evidence Best group. We have focused on the supply chains of meat, fruits and vegetables. The Literature review has been conducted from seven different databases. For more insight, we categorized meat, fruit, and vegetable articles into four groups: descriptive, prescriptive, conceptual, and predictive. Due to the small number of case studies in research, the theoretical and conceptual frameworks proposed in most food supply chain articles, including the supply chain of meat, fruits and vegetables, have been less tested in reality. These surveys and small-scale case studies do not clearly and completely identify the impact of blockchain on the meat, fruit and vegetable supply chain and the challenges that blockchain implementation may pose to these supply chains. Findings indicate that little valid and quality research has been done in this field and more research is needed on the use of blockchain in the supply chain of fresh products.
 

---

In this paper, a closed-loop supply chain is modeled based on hyperchaotic dynamics. Then, synchronization of the two hyperchaotic closed loop supply chains is performed with a proportional integral (PI) sliding mode controller design method. Using Lyapunov stability theory, it has been proved that the PI sliding mode controller can converge the synchronization error to zero in a limited time. The most important issue in the design of control strategies is the behavior of the control signal. In other words, it affects the cost of design and implementation. Numerical simulation results show that the control signal has low amplitude and fluctuations. so, the PI sliding mode control method can be implemented in the real world. Based on the numerical simulation results, the use of two controllers is proposed to reduce design costs.

---