Inconel 600 is a super alloy known for its properties like low thermal conductivity and work hard-ening. The work hardening property of this alloy makes it harder and harder during successive passes of the tool during machining. Therefore, machining of this type of material demands inno-vation in tool material, selection of proper combination of parameters and their levels for economical machining. Coated carbide tool inserts are most widely used for machining Inconel alloys. These inserts are coated with special materials by PVD or CVD technique to reduce flank wear, improve surface finish of machined components and increase the material removal rate (MRR). In this work carbide insert coated with nanocomposite coatings like AlTiN and TiAlSiN commercially known as Hyperlox and HSN2 were used and their performance during machining of Inconel 600 was studied. As improper selection of process parameter influences on the quality of products and productivity, it is important to identify the optimum combination of input process parameters. Most of the time the influence of the input process parameters on the output parameters like MRR, surface roughness and flank wear is studied independently. Information obtained through single objective optimization may not be sufficient because industries desire to optimize all the output parameters, simultaneously. Multi-objective optimization is the only solution to satisfy the requirements of industries and genetic algorithm based multi-objective optimization is adopted in this work in order to get the optimum combination of input process parameters to obtain maximum material removal rate, minimum surface roughness and minimum flank wear simultaneously.

In this paper, we have modeled a decision making problem of a tea industry as a multi-objective optimization problem in interval environment. The goal of this problem is to maximize the overall profit as well as to minimize the total production cost subject to the given resource constraints depending on budget, storage space and allotted processing times in different machines. For this purpose, the problem has been formulated as a multi-objective integer linear programming problem with interval objectives. To solve the problem, we have proposed extended elitist non-dominated sorting genetic algorithm (ENSGA-II) for integer variables with interval fitness, crowded tournament selection, intermediate crossover, one neighborhood mutation and elitism. To develop this algorithm, we have proposed modified non-dominated sorting and crowding distance based on interval mathematics and interval order relations. Finally, to test the performance of the proposed algorithm, a numerical example has been solved.

Group scheduling problem in cellular manufacturing systems consists of two major steps. Sequence of parts in each part-family and the sequence of part-family to enter the cell to be processed. This paper presents a new method for group scheduling problems in flow shop systems where it minimizes makespan (Cmax) and total tardiness. In this paper, a position-based learning model in cellular manufacturing system is utilized where processing time for each part-family depends on the entrance sequence of that part. The problem of group scheduling is modeled by minimizing two objectives of position-based learning effect as well as the assumption of setup time depending on the sequence of parts-family. Since the proposed problem is NP-hard, two meta heuristic algorithms are presented based on genetic algorithm, namely: Non-dominated sorting genetic algorithm (NSGA-II) and non-dominated rank genetic algorithm (NRGA). The algorithms are tested using randomly generated problems. The results include a set of Pareto solutions and three different evaluation criteria are used to compare the results. The results indicate that the proposed algorithms are quite efficient to solve the problem in a short computational time.

Integrated supply chain includes different components of order, production and distribution and it plays an important role on reducing the cost of manufacturing system. In this paper, an integrated supply chain in a form of multi-objective decision-making problem is presented. The proposed model of this paper considers different parameters with uncertainty using trapezoid numbers. We first implement a ranking method to covert the fuzzy model into a crisp one and using multi-objective particle swarm optimization, we solve the resulted model. The results are compared with the performance of NSGA-II for some randomly generated problems and the preliminary results indicate that the proposed model of the paper performs better than the alternative method.

This paper proposes a particle swarm optimization (PSO) algorithm to solve various types of economic dispatch (ED) problems in power systems such as, environmental/economic dispatch (EED) and multi-area environmental/economic dispatch. The proposed model considers the environmental impact to achieve the minimization of fuel costs and pollutant emissions, simultaneously. The EED problem is further extended to dispatch the power among different areas to aid emission allowance trading. The performance of the proposed PSO is compared with conventional method and genetic algorithm. The results clearly show that the proposed algorithms give global optimum solution compared to the other methods. The results obtained also show that the proposed PSO algorithms can provide comparable dispatch solutions with reduced computation time for all types of ED problems.

When a production facility is designed, there are various parameters affecting the number machines such as production capacity and reliability. It is often a tedious task to optimize different objectives, simultaneously. The other issue is the uncertainty in many design parameters which makes it difficult to reach a desirable solution. In this paper, we present a new mathematical model with two objectives. The primary objective function is considered to be the production capacity and the secondary objective function is total reliability. The proposed model is formulated on different units of production which are connected together in serial form and for each unit, we may have various machines. The resulted model is formulated using recent advances of robust optimization and solution procedure is analyzed with some numerical examples.