Cell formation and layout design are two important steps for the implementation of the production systems. The existing models majorly have focused on the cell formation issue and the layout design of machines, but have paid little attention to the placement of cells in dynamic environment. In addition, in most of the available papers, binary variables have been used for cell formation, and other information such as volume of production, operation sequences and production costs have played unimportant roles in the structure of the existing models. In this paper, a nonlinear program-ming model under potentially dynamic conditions is proposed which minimizes the cost associated with the difference between the estimated demands from its expected value. The other purpose of the proposed model includes minimization of the total costs of inter/intra cellular movements of elements (forward and backward movements), the existence of exceptional elements, intercellular displacement of machines and cellular reconfiguration and operational costs and constant cost of machineries. The problem is solved via GAMS and a Genetic Algorithm (GA) is employed to solve the large sized problems and the results are analyzed.

This paper presents a mathematical model for scheduling of a single machine when there are preemptions in jobs. The primary objective of the study is to minimize different objectives such as earliness, tardiness and work in process. The proposed mathematical problem is considered as NP-Hard and the optimal solution is available for small scale problems. Therefore, a genetic algorithm (GA) is developed to solve the problem for large-scale problems. The implementation of the proposed model is compared with GA for problems with up to 50 jobs using three methods of roulette wheel sampling, random sampling and competition sampling. The results have indicated that competition sampling has reached optimal solutions for small scale problems and it could obtain better near-optimal solutions in relatively lower running time compared with other sampling methods.

This paper presents a model to solve the multi-objective location-routing problem with capacitated vehicles. The main purposes of the model are to find the optimal number and location of depots, the optimal number of vehicles, and the best allocation of customers to distribution centers and to the vehicles. In addition, the model seeks to optimize vehicle routes and sequence to serve the customers. The proposed model considers vehicles’ traveled distances, service time and waiting time while guaranteeing that the sum of these parameters is lower than a predetermined value. Two objective functions are investigated. First objective function minimizes the total cost of the system and the second one minimizes the gap between the vehicles’ traveled distances. To solve the problem, a Multi-Objective Imperialist Competitive Algorithm (MOICA) is developed. The efficiency of the MOICA is demonstrated via comparing with a famous meta-heuristics, named Non-Dominated Sorting Genetic Algorithm-II (NSGA-II). Based on response surface methodology, for each algorithm, several crossover and mutation strategies are adjusted. The results, in terms of two well-known comparison metrics, indicate that the proposed MOICA outperforms NSGA-II especially in large sized problems.

Cellular manufacturing is considered as a lean technique of producing similar parts using sells or groups of team members, workstations, or equipment to facilitate operations by removing setup and unnecessary cost components among various operations. Cell formation and layout planning are the most components of the cellular manufacturing. This paper presents a dynamic method to minimize different costs including the total cost of movements within and between cells and exceptional parts. In this study, the Hierarchical Genetic Algorithm (HGA) is used for solving the resulted model and the results are compared with genetic algorithm. The results have indicated that the proposed method could reach optimal solutions for some small and medium sized problems in reasonable amount of time.