cell formation problem
Recently Published Documents


TOTAL DOCUMENTS

229
(FIVE YEARS 26)

H-INDEX

32
(FIVE YEARS 3)

2022 ◽  
Vol 12 (1) ◽  
pp. 0-0

The Cubic Cell Formation Problem (CCFP) in cellular manufacturing systems consists in decomposing a production system into a set of manufacturing cells, and assigning workers to cells besides parts and machines. The major objective is to obtain manageable cells. Manageable cells mean cells with a minimum value of inter-cell moves of parts and workers and a minimum value of heterogeneity within cells. In this paper, a solution methodology based on a modified simulated annealing heuristic with a proposed neighbourhood search procedure is proposed. The methodology allows building multiple configurations by giving to the decision-maker the ability to control some parameters. Experimental results show that the proposed algorithm gives a promising performance for all problem instances found in the literature.


Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1768
Author(s):  
Jose Joaquin del Pozo-Antúnez ◽  
Francisco Fernández-Navarro ◽  
Horacio Molina-Sánchez ◽  
Antonio Ariza-Montes ◽  
Mariano Carbonero-Ruz

The traditional machine-part cell formation problem simultaneously clusters machines and parts in different production cells from a zero–one incidence matrix that describes the existing interactions between the elements. This manuscript explores a novel alternative for the well-known machine-part cell formation problem in which the incidence matrix is composed of non-binary values. The model is presented as multiple-ratio fractional programming with binary variables in quadratic terms. A simple reformulation is also implemented in the manuscript to express the model as a mixed-integer linear programming optimization problem. The performance of the proposed model is shown through two types of empirical experiments. In the first group of experiments, the model is tested with a set of randomized matrices, and its performance is compared to the one obtained with a standard greedy algorithm. These experiments showed that the proposed model achieves higher fitness values in all matrices considered than the greedy algorithm. In the second type of experiment, the optimization model is evaluated with a real-world problem belonging to Human Resource Management. The results obtained were in line with previous findings described in the literature about the case study.


2020 ◽  
Vol 24 (21) ◽  
pp. 16679-16690
Author(s):  
G. Nagaraj ◽  
Manimaran Arunachalam ◽  
K. Vinayagar ◽  
S. Paramasamy

2020 ◽  
Vol 16 (3-4) ◽  
pp. 368
Author(s):  
R. Kamalakannan ◽  
T.R. Raguraman ◽  
R. Sudhakara Pandian

2020 ◽  
Vol 16 (3/4) ◽  
pp. 368
Author(s):  
T.R. Raguraman ◽  
R. Sudhakara Pandian ◽  
R. Kamalakannan

Sign in / Sign up

Export Citation Format

Share Document