---

  Multiple criteria decision making (MCDM) problem is one of the famous different kinds of decision making problems. In more cases in real situations, determining the exact values for MCDM problems is difficult or impossible. So, the values of alternatives with respect to the criteria or / and the values of criteria weights, are considered as fuzzy values (fuzzy numbers). In such conditions, the conventional crisp approaches for solving MCDM problems tend to be less effective for dealing with the imprecise or vagueness nature of the linguistic assessments. In this situation, the fuzzy MCDM methods are applied for solving MCDM problems. In this paper, we propose a fuzzy TOPSIS (for Order Preference by Similarity to Ideal Solution) method based on left and right scores for fuzzy MCDM problems. To show the applicability of the proposed method, two numerical examples are presented. As a result, our proposed method is precise, easy use and practical for solving MCDM problem with fuzzy data. Moreover, the proposed method considers the decision makers (DMs) preference in the decision making process. It seems that the proposed fuzzy TOPSIS method is flexible and easy to use and has a low computational volume .

---

In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is minimized. A single path TCTP is constructed as an optimization problem with decision variables of activity mean durations. We then reformulate the single path TCTP as a cone quadratic program in order to apply polynomial time interior point methods to solve the reformulation. Finally, we develop an iterative algorithm based on Monte Carlo simulation technique and conic optimization to solve general TCTP. The proposed approach has been tested on some randomly generated test problems. The results illustrate the good performance of our new approach.

---

Assembly lines are special kinds of production systems which are of great importance in the industrial production of high quantity commodities. In many practical manufacturing systems, configuration of assembly lines is fixed and designing a new line may be incurred huge amount of costs and thereby it is not desirable for practitioners. When some changes related to market demand occur, it is worthwhile to re-balance an existing line rather than balancing a new one. Hence, in this paper we suggest a re-balancing model of an existing assembly line in which a new demand related cycle time (CT) is embedded to the traditional assembly line balancing problem (ALBP) as a new parameter. It does not focus on balancing a new line instead it considers a more realistic problem which is re-balancing an existing line. The objective is to re-schedule the tasks in order to reduce the current CT to the new required one such that two criteria are optimized: (i) minimization of the incurred costs and (ii) minimization of non-smoothing of reconfigured line. To solve the considered problem, an effective differential evolution algorithm is developed. Furthermore, to enhance the performance of algorithm, its parameters are optimized by the use of Taguchi method which is a conventional statistical technique for parameter design. The obtained results from computational experiments on benchmark instances show the effectiveness of suggested algorithm against other methods.

---

Scheduling has become an attractive area for artificial intelligence researchers. On other hand, in today's real-world manufacturing systems, the importance of an efficient maintenance schedule program cannot be ignored because it plays an important role in the success of manufacturing facilities. A maintenance program may be considered as the heath care of manufacturing machines and equipments. It is required to effectively reduce wastes and have an efficient, continuous manufacturing operation. The cost of preventive maintenance is very small when it is compared to the cost of a major breakdown. However, most of manufacturers suffer from lack of a total maintenance plan for their crucial manufacturing systems. Hence, in this paper, we study a maintenance operations planning optimization on a realistic variant of parallel batch machines manufacturing system which considers non-identical parallel processing machines with non-identical job sizes and fixed/flexible maintenance operations. To reach an appropriate maintenance schedule, we propose solution frameworks based on an Artificial Immune Algorithm (AIA), as an intelligent decision making technique. We then introduce a new method to calculate the affinity value by using an adjustment rate. Finally, the performance of proposed methods are investigated. Computational experiments, for a wide range of test problems, are carried out in order to evaluate the performance of methods.

---

Achieving optimal production cycle time for improving manufacturing processes is one of the common problems in production planning. During recent years, different approaches have been developed for solving this problem, but most of them assume that mean quality characteristic is constant over production run length and sets it on customer’s target value. However, the process mean may drift from an in-control to an out-of-control at a random point in time. This study aims to select the production cycle time and the initial setting of mean quality characteristic, so that the expected total cost, consisting of quality loss and maintenance costs as well as ordering and holding costs, already considered in the classic models is minimized. To investigate the effect of mean process setting, a computational analysis on a real world example is performed. Results show the superiority of the proposed approach compared to the classical economic production quantity model.

---

This study aims to select optimal maintenance strategy for components of an electric motor of the National Iranian Oil Refining and Distribution Company. In this regard, a method based on revised multi choice goal programming and analytic hierarchy process (AHP) is presented. Since improving the equipment reliability is an important issue, reliability centered maintenance (RCM) strategies are introduced in this paper. Furthermore, on one hand, we know that maintenance cost consists of a considerable percentage of production cost; on the other hand, the risk of equipment failure is a main factor on personnel’s safety. Consequently, the cost and risk factors are selected as important criteria of maintenance strategies.

---

One of the basic assumptions of classical production-inventory models is that all products are of perfect quality. However, in real manufacturing situations, the production of defective items is inevitable, and a fraction of the items produced may be naturally imperfect. In fact, items may be damaged due to production and/or transportation conditions in the manufacturing process. On the other hand, some reworkable items exist among imperfect items that can be made perfect by additional processing. In addition, the classical production-inventory models assume that there is only one product in the system and that there is an unlimited amount of resources. However, in many practical situations, several products are produced and there are some constraints related to various factors such as machine capacity, storage space, available budget, number of allowable setups, etc. Therefore, we propose new constrained production-inventory models for multiple products where the manufacturing process is defective and produces a fraction of imperfect items. A percentage of defective items can be reworked, and these products go through the rework process to become perfect and return to the consumption cycle. The goal is to determine economic production quantities to minimize the total cost of the system. The analytical solutions are each derived separately by Lagrangian relaxation method, and a numerical example is presented to illustrate and discuss the procedure. A sensitivity analysis is performed to investigate how the variation in the inputs of the models affects the total cost of the inventory system. Finally, some research directions for future works are discussed.

---

This paper designs a Scenario analysis approach to determine the joint production policy for two products under possible substitution. The Scenario analysis is designed to improve decision making by considering possible outcomes and their implications. The traditional multi-products production models assume that there is no possible substitution between products. However, in real-world cases, there are many substitutable products where substitution may occur in the event of a product stock-out. The proposed model optimizes production quantities for two products under substitution with the aim of minimizing the total cost of inventory system, including setup and holding costs, subject to a resource constraint. To analyze the problem, four special Scenarios are derived and discussed in detail. Furthermore, the total cost functions are derived for each Scenario separately, and then a solution procedure is suggested based on the Scenarios developed. The numerical examples are implemented, and the results are discussed in detail.

---