NP-completeness of cell formation problem with grouping efficacy objective

2019 ◽  
Vol 58 (20) ◽  
pp. 6159-6169 ◽  
Author(s):  
Mikhail V. Batsyn ◽  
Ekaterina K. Batsyna ◽  
Ilya S. Bychkov
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.


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.


Sign in / Sign up

Export Citation Format

Share Document