Machine-part cell formation for maximum grouping efficacy based on genetic algorithm

Author(s):  
Manash Hazarika ◽  
Dipak Laha
2012 ◽  
pp. 699-725
Author(s):  
Saber Ibrahim ◽  
Bassem Jarboui ◽  
Abdelwaheb Rebaï

The aim of this chapter is to propose a new heuristic for Machine Part Cell Formation problem. The Machine Part Cell Formation problem is the important step in the design of a Cellular Manufacturing system. The objective is to identify part families and machine groups and consequently to form manufacturing cells with respect to minimizing the number of exceptional elements and maximizing the grouping efficacy. The proposed algorithm is based on a hybrid algorithm that combines a Variable Neighborhood Search heuristic with the Estimation of Distribution Algorithm. Computational results are presented and show that this approach is competitive and even outperforms existing solution procedures proposed in the literature.


2018 ◽  
Vol 5 (5) ◽  
pp. 13574-13584
Author(s):  
N. Sowmiya ◽  
B. Valarmathi ◽  
N. Srinivasa Gupta ◽  
P. Essaki Muthu ◽  
C. Rajendran

Author(s):  
Saber Ibrahim ◽  
Bassem Jarboui ◽  
Abdelwaheb Rebaï

The aim of this chapter is to propose a new heuristic for Machine Part Cell Formation problem. The Machine Part Cell Formation problem is the important step in the design of a Cellular Manufacturing system. The objective is to identify part families and machine groups and consequently to form manufacturing cells with respect to minimizing the number of exceptional elements and maximizing the grouping efficacy. The proposed algorithm is based on a hybrid algorithm that combines a Variable Neighborhood Search heuristic with the Estimation of Distribution Algorithm. Computational results are presented and show that this approach is competitive and even outperforms existing solution procedures proposed in the literature.


Author(s):  
Amin Rezaeipanah ◽  
Musa Mojarad

This paper presents a new, bi-criteria mixed-integer programming model for scheduling cells and pieces within each cell in a manufacturing cellular system. The objective of this model is to minimize the makespan and inter-cell movements simultaneously, while considering sequence-dependent cell setup times. In the CMS design and planning, three main steps must be considered, namely cell formation (i.e., piece families and machine grouping), inter and intra-cell layouts, and scheduling issue. Due to the fact that the Cellular Manufacturing Systems (CMS) problem is NP-Hard, a Genetic Algorithm (GA) as an efficient meta-heuristic method is proposed to solve such a hard problem. Finally, a number of test problems are solved to show the efficiency of the proposed GA and the related computational results are compared with the results obtained by the use of an optimization tool.


2015 ◽  
Vol 07 (03) ◽  
pp. 107-122
Author(s):  
Murugaiyan Pachayappan ◽  
Ramasamy Panneerselvam

Sign in / Sign up

Export Citation Format

Share Document