scholarly journals The Machine-Part Cell Formation Problem with Non-Binary Values: A MILP Model and a Case of Study in the Accounting Profession

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.

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.


2015 ◽  
Vol 21 (1) ◽  
pp. 55-63 ◽  
Author(s):  
Seyed Mohammad Seyedhosseini ◽  
Hassan Badkoobehi ◽  
Azadeh Noktehdan

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Reza Raminfar ◽  
Norzima Zulkifli ◽  
Mohammadreza Vasili

Cell formation (CF) is a crucial aspect in the design of cellular manufacturing (CM) systems. This paper develops a comprehensive mathematical programming model for the cell formation problem, where product demands, cell size limits, sequence of operations, multiple units of identical machines, machine capacity, or machine cost are all considered. In this model, the intercell moves are restricted to be unidirectional from one cell to the downstream cells, without backtracking. The proposed model is investigated through several numerical examples. To evaluate the solution quality of the proposed model, it is compared with some well-known cell formation methods from the literature, by using group capability index (GCI) as a performance measure. The results and comparisons indicate that the proposed model produces solution with a higher performance.


Sign in / Sign up

Export Citation Format

Share Document