Data

Scopus
EXPORT DATE:24 Jan 2020
Wu, T.-H., Low, C., Wu, W.-T.

7404814990;7102903010;55707527300;
A tabu search approach to the cell formation problem
(2004) International Journal of Advanced Manufacturing Technology, 23 (11-12), pp.
916-924. Cited 38 times.
https://www.scopus.com/inward/record.uri?eid=2-s2.0-
3142611381&doi=10.1007%2fs00170-003-1766-
z&partnerID=40&md5=d065b5b53cd509402d7243c7634fbc7b
DOI: 10.1007/s00170-003-1766-z
AFFILIATIONS: Dept. of Industrial Engineering, Da-Yen University, Changhua, 515,
Taiwan;
UMC, Science-Based Industrial Park, Hsinchu, 300, Taiwan
ABSTRACT: The cell formation problem determines the decomposition of the
manufacturing cells of a production system in which machines are assigned to these
cells to process one or more part families so that each cell is operated
independently and the intercellular flows are minimised or the number of parts flow
processed within cells is maximised. In this paper, a tabu search heuristic - TSCF
- that consists of dynamic tabu tenure with a long-term memory mechanism is
presented to solve the cell formation problem. Test problems adopted from the
literature and generated randomly are used to evaluate the performance of the
proposed algorithm. In addition, two methods for quickly generating the initial
solutions are proposed, namely the group-and-assign (GAA) method, and the random
approach. Computational results indicate that the GAA method, accompanied by the
TSCF algorithm can produce optimal solutions in less than or equal to 0.005 s for
all small- and medium-sized problems. The proposed algorithm should thus be useful
to both practitioners and researchers.
AUTHOR KEYWORDS: Cell formation problem; Tabu search
INDEX KEYWORDS: Algorithms; Approximation theory; Cellular manufacturing; Group
technology; Heuristic methods; Integer programming; Machine components; Machine
design; Optimization, Cell formation problems; Group-and-design (GAA); Tabu search,
Production control
REFERENCES: Garey, M.R., Johnson, D.S., (1979) Computers and Intractability, ,
Freeman, San Francisco;
Chen, C.H., Algorithms for grouping machines groups in group technology (1992)
Omega, 20, pp. 493-501;
Chu, C.H., Cluster analysis in manufacturing cellular formation (1989) Omega, 17,
pp. 289-295;
Moon, C., Kim, J., Genetic algorithm for maximizing the parts flow within cells in
manufacturing cell design (1999) Comput Ind Eng, 36, pp. 379-389;
Harlalakis, J., Nagi, R., Proth, J.M., An efficient heuristic in manufacturing cell
formation for group technology applications (1990) Int J Prod Res, 28, pp. 185-198;
Rajagopalan, R., Batra, J., Design of cellular production systems-a graph

theoretical approach (1975) Int J Prod Res, 13, pp. 256-268;
Vohra, T., Chen, D., Chang, J., Chen, H., A network approach to cell formation in
cellular manufacturing (1990) Int J Prod Res, 28, pp. 2075-2084;
Wu, N., Salvendy, G., Modified network approach for the design of cellular
manufacturing systems (1993) Int J Prod Res, 31, pp. 1409-1421;
Sun, D., Lin, L., Batta, R., Cell formation using tabu search (1995) Comput Ind
Eng, 28, pp. 485-494;
Aljaber, N., Baek, W., Chen, C.-L., A tabu search approach to the cell formation
problem (1997) Comput Ind Eng, 32, pp. 169-185;
Wu, T.H., A note on a global approach for general 0-1 fractional programming (1997)
Eur J Oper Res, 101, pp. 220-223;
Glover, F., Tabu search - Part I (1989) ORSA J Comput, 1, pp. 190-206;
Glover, F., Tabu search - Part II (1990) ORSA J Comput, 2, pp. 4-32;
Glover, F., Laguna, M., (1997) Tabu Search, , Kluwer Academic Publishers, Boston;
Battiti, R., Tecchiolli, G., The reactive tabu search (1994) ORSA J Comput, 6, pp.
126-140;
Rolland, E., Schilling, D.A., Current, J.R., An efficient tabu search procedure for
the p-median problem (1996) Eur J Oper Res, 96, pp. 329-342;
Sun, M., Aronson, J.E., McKeown, P.G., Drinka, D., A tabu search heuristic
procedure for the fixed charge transportation problem (1998) Eur J Oper Res, 106,
pp. 441-456;
Wu, T.-H., Low, C., Wu, W.-T., A tabu search approach to generalized assignment
problem (2003) Technical Report, , department of industrial engineering, Da-Yeh
University, Taiwan
CORRESPONDENCE ADDRESS: Wu, T.-H.; Dept. of Industrial Engineering, Da-Yen
University, Changhua, 515, Taiwan; email: [email protected]
PUBLISHER: Springer London
ISSN: 02683768
CODEN: IJATE
LANGUAGE OF ORIGINAL DOCUMENT: English
ABBREVIATED SOURCE TITLE: Int J Adv Manuf Technol
DOCUMENT TYPE: Article
PUBLICATION STAGE: Final
SOURCE: Scopus
Kao, Y., Lin, C.-H.

23034954300;55332297400;
A PSO-based approach to cell formation problems with alternative process routings
(2012) International Journal of Production Research, 50 (15), pp. 4075-4089. Cited
29 times.
84864852142&doi=10.1080%2f00207543.2011.590541&partnerID=40&md5=5eeef1d21ee1f8a7276
be3bc3565cc53
DOI: 10.1080/00207543.2011.590541
AFFILIATIONS: Department of Information Management, Tatung University, 40,
Chungshan N. Rd., Sec. 3, Taipei, 104, Taiwan
ABSTRACT: Group technology (GT) has been extensively applied to cellular
manufacturing system (CMS) design for decades due to many benefits such as
decreased number of part movements among cells and increased machine utilisation in
cells. This paper considers cell formation problems with alternative process
routings and proposes a discrete particle swarm optimisation (PSO) approach to
minimise the number of exceptional parts outside machine cells. The approach
contains two main steps: machine partition and part-routing assignment. Through
inheritance and random search, the proposed algorithm can effectively partition
machines into different cells with consideration of multiple part process routings.
The computational results are compared with those obtained by using simulated
annealing (SA)-based and tabu search (TS)-based algorithms. Experimental results
demonstrate that the proposed algorithm can find equal or fewer exceptional
elements than existing algorithms for most of the test problems selected from the
literature. Moreover, the proposed algorithm is further tailed to incorporate
various production factors in order to extend its applicability. Four sample cases
are tested and the results suggest that the algorithm is capable of solving more
practical cell formation problems. © 2012 Copyright Taylor and Francis Group, LLC.
AUTHOR KEYWORDS: alternative process routings; cell formation problems;
generalised group technology; particle swarm optimisation
INDEX KEYWORDS: Alternative process routings; Cell formation problem; Computational
results; Exceptional elements; Machine cell; Multiple parts; Particle swarm
optimisation; Random searches; Routings; Test problem, Algorithms; Cells; Cytology;
Group technology; Particle swarm optimization (PSO); Simulated annealing; Tabu
search, Cellular manufacturing
REFERENCES: Adenso-Diáz, B., Machine cell formation in generalised group technology
(2001) Computers and Industrial Engineering, 41 (2), pp. 227-240;
Adil, G.K., Rajamani, D., Strong, D., Cell formation considering alternate
routeings (1996) International Journal of Production Research, 34 (5), pp. 1361-
1380;
Andrés, C., Lozano, S., A particle swarm optimisation algorithm for part machine
grouping (2006) Robot CIM-International Manufacturing, 22 (5-6), pp. 468-474;
Banks, A., Vincent, J., Anyakoha, C., A review of particle swarm optimisation. Part
I: Background and development (2007) Natural Computing, 6 (4), pp. 467-484;
Caux, C., Bruniaux, R., Pierreval, H., Cell formation with alternative process
plans and machine capacity constraints: A new combined approach (2000)
International Journal of Production Economics, 64 (1-3), pp. 279-284;
Chan, F.T.S., Cell formation problem with consideration of both intracellular and
intercellular movements (2008) International Journal of Production Research, 46
(10), pp. 2589-2620;
Chung, S.H., Wu, T.H., Chang, C.C., An efficient tabu search algorithm to the cell
formation problem with alternative routings and machine reliability considerations
Hwang, H., Ree, P., Routes selection for the cell formation problem with
alternative part process plans (1996) Computers and Industrial Engineering, 30 (3),
pp. 423-431;
Gravel, M., Nsakanda, A.L., Price, W., Efficient solutions to the cell-formation
problem with multiple routings via a double-loop genetic algorithm (1998) European
Journal of Operational Research, 109 (2), pp. 286-298;
Jabal Ameli, M.S., Arkat, J., Barzinpour, F., Modelling the effects of machine
breakdowns in the generalised cell formation problem (2008) International Journal
of Advanced Manufacturing Technology, 39 (7-8), pp. 838-850;
Jarboui, B., Combinatorial particle swarm optimisation (CPSO) for partitional
clustering problem (2007) Applied Mathematics and Computation, 192 (2), pp. 337-
345;
Kasilingam, R.G., Lashkari, R.S., Cell formation in the presence of alternate
process plans in flexible manufacturing systems (1991) Production Planning &
Control, 2 (2), pp. 135-141;
Kennedy, J., Eberhart, R.C., Particle swarm optimisation (1995) Proceedings of IEEE
International Conference on Neural Networks, 4, pp. 1942-1948;
Kennedy, J., Eberhart, R.C., A discrete binary version of the particle swarm
algorithm (1997) Proceedings of IEEE International Conference on Systems, Man, and
Cybernetics, 5, pp. 4104-4108;
Kusiak, A., The generalised group technology concept (1987) International Journal
of Production Research, 25 (4), pp. 561-569;
Kusiak, A., Cho, M., Similarity coefficient algorithms for solving the group
technology problem (1992) International Journal of Production Research, 30 (11),
pp. 2633-2646;
Lei, D., Wu, Z., Tabu search approach based on a similarity coefficient for cell
formation in generalised group technology (2005) International Journal of
Production Research, 43 (19), pp. 4035-4047;
Logendran, R., Ramakrishna, P., Sriskandarajah, C., Tabu search-based heuristics
for cellular manufacturing systems in the presence of alternative process plans
(1994) International Journal of Production Research, 32 (2), pp. 273-297;
Moon, Y.B., Chi, S.C., Generalised part family formation using neural network
techniques (1992) Journal of Manufacturing Systems, 11 (3), pp. 149-159;
Moon, C., Gen, M., A genetic algorithm-based approach for design of independent
manufacturing cells (1999) International Journal of Production Economics, 60-61,
pp. 421-426;
Nagi, R., Harhalakis, G., Proth, J.M., Multiple routings and capacity
considerations in group technology applications (1990) International Journal of
Papaioannou, G., Wilson, J.M., The evolution of cell formation problem
methodologies based on recent studies (1997-2008): Review and directions for future
research (2010) European Journal of Operational Research, 206 (3), pp. 509-521;
Poli, R., Kennedy, J., Blackwell, T., Particle swarm optimisation: An overview
(2007) Swarm Intelligence, 1 (1), pp. 33-57;
Sankaran, S., Kasilingam, R.G., An integrated approach to cell formation and part
routing in group technology manufacturing systems (1990) Engineering Optimization,
16 (3), pp. 235-245;
Selim, H.M., Askin, R.G., Vakharia, A.J., Cell formation in group technology:
Review, evaluation and directions for future research (1998) Computers and
Industrial Engineering, 34 (1), pp. 3-20;
Sofianopoulou, S., Manufacturing cells design with alternative process plans and/or
replicate machines (1999) International Journal of Production Research, 37 (3), pp.
707-720;
Solimanpur, M., Saeedi, S., Mahdavi, I., Solving cell formation problem in cellular
manufacturing using ant-colonybased optimisation (2010) International Journal of
Advanced Manufacturing Technology, 50 (9-12), pp. 1135-1144;
Spiliopoulos, K., Sofianopoulou, S., Manufacturing cell design with alternative
routings in generalised group technology: Reducing the complexity of the solution
space (2007) International Journal of Production Research, 45 (6), pp. 1355-1367;
Won, Y., Kim, S., An assignment method for the part-machine cell formation problem
in the presence of multiple process routes (1994) Engineering Optimization, 22 (3),
pp. 231-240;
Won, Y., Kim, S., Multiple criteria clustering algorithm for solving the group
technology problem with multiple process routings (1997) Computers and Industrial
Engineering, 32 (1), pp. 207-220;
Won, Y., New p-median approach to cell formation with alternative process plans
Wu, T.H., Chen, J.F., Yeh, J.Y., A decomposition approach to the cell formation
problem with alternative process plans (2004) International Journal of Advanced
Manufacturing Technology, 24 (11-12), pp. 834-840;
Wu, T.H., Chung, S.H., Chang, C.C., Hybrid simulated annealing algorithm with
mutation operator to the cell formation problem with alternative process routings
(2009) Expert System Applications, 36 (2), pp. 3652-3661;
Yin, Y., Yasuda, K., Manufacturing cells' design in consideration of various
production factors (2002) International Journal of Production Research, 40 (4), pp.
885-906
CORRESPONDENCE ADDRESS: Kao, Y.; Department of Information Management, Tatung
University, 40, Chungshan N. Rd., Sec. 3, Taipei, 104, Taiwan; email:
[email protected]
ISSN: 00207543
CODEN: IJPRB
ABBREVIATED SOURCE TITLE: Int J Prod Res
SOURCE: Scopus
Nalluri, M.S.R., Kannan, K., Gao, X.-Z., Roy, D.S.

57194976652;22734092100;57193611024;36806630100;
An efficient hybrid meta-heuristic approach for cell formation problem
(2019) Soft Computing, 23 (19), pp. 9189-9213. Cited 2 times.
85061709493&doi=10.1007%2fs00500-019-03798-
7&partnerID=40&md5=a767226e10adb8e6809078e4c7cfe219
DOI: 10.1007/s00500-019-03798-7
AFFILIATIONS: School of Computing, SASTRA Deemed University, Thanjavur, Tamilnadu,
India;
School of Humanities and Sciences, SASTRA Deemed University, Thanjavur, Tamilnadu,
India;
School of Computing, University of Eastern Finland, Kuopio, Finland;
Department of Computer Science and Engineering, National Institute of Technology
Meghalaya, Shillong, Meghalaya, India
ABSTRACT: The cellular manufacturing technology, an application of group technology
in manufacturing, has been a widely studied combinatorial optimization problem
where the entire production system is divided into many cells and part families. In
this paper, a novel clonal selection algorithm (CSA) that uses a new affinity
function and part assignment heuristic for solving a multi-objective cell formation
problem is studied. The proposed CSA has been hybridized with genetic algorithm for
generating feasible cell sequences that fulfill both mutual exhaustivity and
exclusion properties of machine cells prior to the initial population generation.
Additionally, a new part assignment heuristic function that maps parts to machine
cells and a novel basic affinity function have been built into the proposed CSA so
that it can act as the utility function to solve the multi-objective cell formation
problem. This hybrid CSA (HCSA) has been presented and computational results have
been obtained for the proposed scheme with a set of 52 benchmark instances
collected from literature. The results presented herein demonstrate that overall
proposed HCSA is much more promising in comparison with existing approaches
available in recent literatures. Extensive statistical and convergence tests have
been carried out to ratify the superiority of the proposed HCSA. The improvements
can be attributed to the collaborative interactions in the CSA mechanism, the
proposed hybridization for initial population generation and so forth. © 2019,
Springer-Verlag GmbH Germany, part of Springer Nature.
AUTHOR KEYWORDS: Cell formation problem; Clonal selection algorithm; Genetic
algorithms; Grouping; Hyper-mutation
INDEX KEYWORDS: Benchmarking; Clone cells; Combinatorial optimization; Cytology;
Genetic algorithms; Group technology; Heuristic algorithms; Heuristic methods, Cell
formation problem; Clonal selection algorithms; Collaborative interaction;
Combinatorial optimization problems; Grouping; Hyper mutation; Manufacturing
technologies; Multi-objective cell formation problem, Cellular manufacturing
REFERENCES: Abdel-Basset, M., Fakhry, A.E., El-Henawy, I., Qiu, T., Sangaiah, A.K.,
Feature and intensity based medical image registration using particle swarm
optimization (2017) J Med Syst, 41 (12), p. 197;
Abdel-Basset, M., El-Shahat, D., Sangaiah, A.K., A modified nature inspired meta-
heuristic whale optimization algorithm for solving 0–1 knapsack problem (2017) Int
J Mach Learn Cybern, 1, pp. 1-20;
Abdel-Basset, M., El-Shahat, D., El-Henawy, I., Sangaiah, A.K., A modified flower
pollination algorithm for the multidimensional knapsack problem: human-centric
decision making (2018) Soft Comput, 22 (13), pp. 4221-4239;
Abdel-Basset, M., El-Shahat, D., El-henawy, I., Sangaiah, A.K., Ahmed, S.H., A
novel whale optimization algorithm for cryptanalysis in Merkle–Hellman cryptosystem
(2018) Mob Netw Appl, 5, pp. 1-11;
Ahi, A., Aryanezhad, M.B., Ashtiani, B., Makui, A., A novel approach to determine
cell formation, intracellular machine layout and cell layout in the CMS problem
based on TOPSIS method (2009) Comput Oper Res, 36 (5), pp. 1478-1496;
Albadawi, Z., Bashir, H.A., Chen, M., A mathematical approach for the formation of
manufacturing cells (2005) Comput Ind Eng, 48 (1), pp. 3-21;
Arikan, F., Güngör, Z., A parametric model for cell formation and exceptional
elements’ problems with fuzzy parameters (2005) J Intell Manuf, 16 (1), pp. 103-
114;
Arkat, J., Hosseini, L., Farahani, M.H., Minimization of exceptional elements and
voids in the cell formation problem using a multi-objective genetic algorithm
(2011) Expert Syst Appl, 38 (8), pp. 9597-9602;
Arkat, J., Abdollahzadeh, H., Ghahve, H., A new branch and bound algorithm for cell
formation problem (2012) Appl Math Model, 36 (10), pp. 5091-5100;
Asktn, R.G., Subramantan, S.P., A cost-based heuristic for group technology
configuration (1987) Int J Prod Res, 25 (1), pp. 101-113;
Bajestani, M.A., Rabbani, M., Rahimi-Vahed, A.R., Khoshkhou, G.B., A multi-
objective scatter search for a dynamic cell formation problem (2009) Comput Oper
Res, 36 (3), pp. 777-794;
Balakrishnan, S.M., Sangaiah, A.K., MIFIM—middleware solution for service centric
anomaly in future internet models (2017) Future Gener Comput Syst, 74, pp. 349-365;
Balakrishnan, S.M., Sangaiah, A.K., Integrated QoUE and QoS approach for optimal
service composition selection in internet of services (IoS) (2017) Multimed Tools
Appl, 76 (21), pp. 22889-22916;
Batsyn, M., Bychkov, I., Goldengorin, B., Pardalos, P., Sukhov, P., Pattern-based
heuristic for the cell formation problem in group technology (2013) Models,
algorithms, and technologies for network analysis, pp. 11-50., Goldengorin B, (ed),
Springer, New York;
Boctor, F.F., A linear formulation of the machine-part cell formation problem
(1991) Int J Prod Res, 29 (2), pp. 343-356;
Boe, W.J., Cheng, C.H., A close neighbour algorithm for designing cellular
manufacturing systems (1991) Int J Prod Res, 29 (10), pp. 2097-2116;
Burbidge, J.L., Production flow analysis (1971) Prod Eng, 50 (4), pp. 139-152;
Bychkov, I., Batsyn, M., An efficient exact model for the cell formation problem
with a variable number of production cells (2018) Comput Oper Res, 91, pp. 112-120;
Cai, X., Gao, X.Z., Xue, Y., Improved bat algorithm with optimal forage strategy
and random disturbance strategy (2016) Int J Bio-Inspir Comput, 8 (4), pp. 205-214;
Cai, X., Wang, H., Cui, Z., Cai, J., Xue, Y., Wang, L., Bat algorithm with
triangle-flipping strategy for numerical optimization (2018) Int J Mach Learn
Cybern, 9 (2), pp. 199-215;
Carrie, A.S., Numerical taxonomy applied to group technology and plant layout
(1973) Int J Prod Res, 11 (4), pp. 399-416;
Chan, H.M., Milner, D.A., Direct clustering algorithm for group formation in
cellular manufacture (1982) J Manuf Syst, 1 (1), pp. 65-75;
Chan, F.T., Lau, K.W., Chan, P.L., Choy, K.L., Two-stage approach for machine-part
grouping and cell layout problems (2006) Robot Comput Integr Manuf, 22 (3), pp.
217-238;
Chandrasekharan, M., Rajagopalan, R., MODROC: an extension of rank order clustering
for group technology (1986) Int J Prod Res, 24 (5), pp. 1221-1233;
Chandrasekharan, P.M., Rajagopalan, R., An ideal seed non-hierarchical clustering
algorithm for cellular manufacturing (1986) Int J Prod Res, 24 (2), pp. 451-463;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC—an algorithm for concurrent
formation of part-families and machine-cells (1987) Int J Prod Res, 25 (6), pp.
835-850;
Chandrasekharan, M.P., Rajagopalan, R., Groupabil1ty: an analysis of the properties
of binary data matrices for group technology (1989) Int J Prod Res, 27 (6), pp.
1035-1052;
Chattopadhyay, M., Dan, P.K., Mazumdar, S., Application of visual clustering
properties of self organizing map in machine-part cell formation (2012) Appl Soft
Comput, 12 (2), pp. 600-610;
Chaudhuri, B., Jana, R.K., Sharma, D.K., Dan, P.K., A goal programming embedded
genetic algorithm for multi-objective manufacturing cell design (2019) Int J Appl
Decis Sci, 12 (1), pp. 98-114;
Chen, S.J., Cheng, C.S., A neural network-based cell formation algorithm in
cellular manufacturing (1995) Int J Prod Res, 33 (2), pp. 293-318;
Chiang, H.S., Sangaiah, A.K., Chen, M.Y., Liu, J.Y., A novel artificial bee colony
optimization algorithm with SVM for bio-inspired software-defined networking (2018)
Int J Parallel Program, 1, pp. 1-19;
Chu, C.H., An improved neural network for manufacturing cell formation (1997) Decis
Support Syst, 20 (4), pp. 279-295;
Cui, Z., Sun, B., Wang, G., Xue, Y., Chen, J., A novel oriented cuckoo search
algorithm to improve DV-hop performance for cyber–physical systems (2017) J
Parallel Distrib Comput, 103, pp. 42-52;
Cui, Z., Cao, Y., Cai, X., Cai, J., Chen, J., Optimal LEACH protocol with modified
bat algorithm for big data sensing systems in Internet of Things (2018) J Parallel
Distrib Comput;
Dalfard, V.M., New mathematical model for problem of dynamic cell formation based
on number and average length of intra and intercellular movements (2013) Appl Math
Model, 37 (4), pp. 1884-1896;
De Castro, L.N., Von Zuben, F.J., Learning and optimization using the clonal
selection principle (2002) IEEE Trans Evolut Comput, 6 (3), pp. 239-251;
Deb, K., (2001) Multi-objective optimization using evolutionary algorithms, 16.,
Wiley, New York;
Delgoshaei, A., Gomes, C., A multi-layer perceptron for scheduling cellular
manufacturing systems in the presence of unreliable machines and uncertain cost
(2016) Appl Soft Comput, 49, pp. 27-55;
Dimopoulos, C., Zalzala, A.M., Recent developments in evolutionary computation for
manufacturing optimization: problems, solutions, and comparisons (2000) IEEE Trans
Evolut Comput, 4 (2), pp. 93-113;
Floreano, D., Mattiussi, C., (2008) Bio-inspired artificial intelligence: theories,
methods, and technologies, , MIT Press, London;
Gonçalves, J.F., Resende, M.G., An evolutionary algorithm for manufacturing cell
formation (2004) Comput Ind Eng, 47 (2), pp. 247-273;
Guerrero, F., Lozano, S., Smith, K.A., Canca, D., Kwok, T., Manufacturing cell
formation using a new self-organizing neural network (2002) Comput Ind Eng, 42 (2),
pp. 377-382;
Ham, I., Hitomi, K., Yoshida, T., (1985) Group technology: applications to
production management, , Kluwer Academic Publications, Alphen aan den Rijn;
Hwang, H., Sun, J.U., A genetic-algorithm-based heuristic for the GT cell formation
problem (1996) Comput Ind Eng, 30 (4), pp. 941-955;
Imran, M., Kang, C., Lee, Y.H., Jahanzaib, M., Aziz, H., Cell formation in a
cellular manufacturing system using simulation integrated hybrid genetic algorithm
(2017) Comput Ind Eng, 105, pp. 123-135;
James, T.L., Brown, E.C., Keeling, K.B., A hybrid grouping genetic algorithm for
the cell formation problem (2007) Comput Oper Res, 34 (7), pp. 2059-2079;
Karoum, B., Elbenani, B., El Khattabi, N., El Imrani, A.A., Manufacturing cell
formation problem using hybrid Cuckoo search algorithm (2018) Recent developments
in metaheuristics, pp. 151-162., Amodeo L, (ed), Springer, Cham;
Kim, J., Bentley, P.J., Towards an artificial immune system for network intrusion
detection: An investigation of clonal selection with a negative selection operator
(2001) Proceedings of the 2001 Congress on Evolutionary Computation, IEEE, 2, pp.
1244-1252;
King, J.R., Machine-component grouping in production flow analysis: an approach
using a rank order clustering algorithm (1980) Int J Prod Res, 18 (2), pp. 213-232;
King, J.R., Nakornchai, V., Machine-component group formation in group technology:

review and extension (1982) Int J Prod Res, 20 (2), pp. 117-133;
Kumar, K.R., Vannelli, A., (1986) Strategic Subcontracting for Efficient
Disaggregated Manufacturing, , BEBR faculty working paper, no. 1252;
Kumar, K.R., Kusiak, A., Vannelli, A., Grouping of parts and components in flexible
manufacturing systems (1986) Eur J Oper Res, 24 (3), pp. 387-397;
technology problem (1992) Int J Prod Res, 30 (11), pp. 2633-2646;
Kusiak, A., Chow, W.S., Efficient solving of the group technology problem (1987) J
Manuf Syst, 6 (2), pp. 117-124;
Li, X., Baki, M.F., Aneja, Y.P., An ant colony optimization metaheuristic for
machine-part cell formation problems (2010) Comput Oper Res, 37 (12), pp. 2071-
2081;
Lin, T.L., Dessouky, M.M., Kumar, K.R., Ng, S.M., A heuristic-based procedure for
the weighted production-cell formation problem (1996) IIE Trans, 28 (7), pp. 579-
590;
Lu, X., Tang, K., Sendhoff, B., Yao, X., A review of concurrent optimisation
methods (2014) Int J Bio-Inspir Comput, 6 (1), pp. 22-31;
Mahdavi, I., Paydar, M.M., Solimanpur, M., Heidarzade, A., Genetic algorithm
approach for solving a cell formation problem in cellular manufacturing (2009)
Expert Syst Appl, 36 (3), pp. 6598-6604;
Mahmoodian, V., Jabbarzadeh, A., Rezazadeh, H., Barzinpour, F., A novel intelligent
particle swarm optimization algorithm for solving cell formation problem (2017)
Neural Comput Appl, 1, pp. 1-15;
Martinez, W.L., Martinez, A.R., (2007) Computational statistics handbook with
MATLAB, 22., CRC Press, London;
McAuley, J., Machine grouping for efficient production (1972) Prod Eng, 51, pp. 53-
57;
McCormick, W.T., Jr., Schweitzer, P.J., White, T.W., Problem decomposition and data
reorganization by a clustering technique (1972) Oper Res, 20 (5), pp. 993-1009;
Mitranov, S.P., (1959) The scientific principles of group technology, , National
Lending Library, London;
Mosier, C., Taube, L., The facets of group technology and their impacts on
implementation—a state-of-the-art survey (1985) Omega, 13 (5), pp. 381-391;
Mosier, C., Taube, L., Weighted similarity measure heuristics for the group
technology machine clustering problem (1985) Omega, 13 (6), pp. 577-579;
Nalluri, M.R., Roy, D.S., Hybrid disease diagnosis using multiobjective
optimization with evolutionary parameter optimization (2017) J Healthc Eng, 2017,
p. 27;
Nedjah, N., Mourelle, L.D.M., Evolutionary multi-objective optimisation: a survey
(2015) Int J Bio-Inspir Comput, 7 (1), pp. 1-25;
Noktehdan, A., Seyedhosseini, S., Saidi-Mehrabad, M., A Metaheuristic algorithm for
the manufacturing cell formation problem based on grouping efficacy (2016) Int J
Adv Manuf Technol, 82 (1-4), pp. 25-37;
Nouri, H., Development of a comprehensive model and BFO algorithm for a dynamic
cellular manufacturing system (2016) Appl Math Model, 40 (2), pp. 1514-1531;
Oliveira, S., Ribeiro, J.F.F., Seok, S.C., A comparative study of similarity
measures for manufacturing cell formation (2008) J Manuf Syst, 27 (1), pp. 19-25;
Oliveira, S., Ribeiro, J.F.F., Seok, S.C., A spectral clustering algorithm for
manufacturing cell formation (2009) Comput Ind Eng, 57 (3), pp. 1008-1014;
Onwubolu, G.C., Mutingi, M., A genetic algorithm approach to cellular manufacturing
systems (2001) Comput Ind Eng, 39 (1), pp. 125-144;
Pailla, A., Trindade, A.R., Parada, V., Ochi, L.S., A numerical comparison between
simulated annealing and evolutionary approaches to the cell formation problem
Pandian, R.S., Mahapatra, S.S., Manufacturing cell formation with production data
using neural networks (2009) Comput Indus Eng, 56 (4), pp. 1340-1347;
Panigrahi, B.K., Yadav, S.R., Agrawal, S., Tiwari, M.K., A clonal algorithm to
solve economic load dispatch (2007) Electr Power Syst Res, 77 (10), pp. 1381-1389;
methodologies based on recent studies (1997–2008): review and directions for future
research (2010) Eur J Oper Res, 206 (3), pp. 509-521;
Pinheiro, R.G.S., Martins, I.C., Protti, F., Ochi, L.S., A matheuristic for the
cell formation problem (2017) Opt Lett, 12, pp. 1-12;
Rajesh, K.D., Krishna, M.M., Ali, M.A., Chalapathi, P.V., A modified hybrid
similarity coefficient based method for solving the cell formation problem in
cellular manufacturing system (2017) Mater Today Proc, 4 (2), pp. 1469-1477;
Rao, N.M., Kannan, K., Gao, X.Z., Roy, D.S., Novel classifiers for intelligent
disease diagnosis with multi-objective parameter evolution (2018) Comput Electr
Eng, 67, pp. 483-496;
Saeidi, S., Solimanpur, M., Mahdavi, I., Javadian, N., A multi-objective genetic
algorithm for solving cell formation problem using a fuzzy goal programming
approach (2014) Int J Adv Manuf Technol, 70 (9-12), pp. 1635-1652;
Safaei, N., Saidi-Mehrabad, M., Tavakkoli-Moghaddam, R., Sassani, F., A fuzzy
programming approach for a cell formation problem with dynamic and uncertain
conditions (2008) Fuzzy Sets Syst, 159 (2), pp. 215-236;
Sahin, Y.B., Alpay, S., A metaheuristic approach for a cubic cell formation problem
(2016) Expert Syst Appl, 65, pp. 40-51;
Sakhaii, M., Tavakkoli-Moghaddam, R., Bagheri, M., Vatani, B., A robust
optimization approach for an integrated dynamic cellular manufacturing system and
production planning with unreliable machines (2016) Appl Math Model, 40 (1), pp.
169-191;
Schott, J.R., (1995) Fault tolerant design using single and multicriteria genetic
algorithm optimization, , No. AFIT/CI/CIA-95-039. Air force inst of tech Wright–
Patterson AFB OH;
Seifoddini, H.K., Single linkage versus average linkage clustering in machine cells
formation applications (1989) Comput Ind Eng, 16 (3), pp. 419-426;
Seifoddini, H., Wolfe, P.M., Application of the similarity coefficient method in
group technology (1986) IIE Trans, 18 (3), pp. 271-277;
review, evaluation and directions for future research (1998) Comput Ind Eng, 34
(1), pp. 3-20;
Selim, H.M., Abdelaal, R.M., Mahdi, A.I., Formation of machine groups and part
families: a modified SLC method and comparative study (2003) Integr Manuf Syst, 14
(2), pp. 123-137;
Shiyas, C.R., Pillai, V.M., A mathematical programming model for manufacturing cell
formation to develop multiple configurations (2014) J Manuf Syst, 33 (1), pp. 149-
158;
Solimanpur, M., Vrat, P., Shankar, R., A multi-objective genetic algorithm approach
to the design of cellular manufacturing systems (2004) Int J Prod Res, 42 (7), pp.
1419-1441;
Srikanth, K., Panwar, L.K., Panigrahi, B.K., Herrera-Viedma, E., Sangaiah, A.K.,
Wang, G.G., Meta-heuristic framework: quantum inspired binary grey wolf optimizer
for unit commitment problem (2018) Comput Electr Eng, 70, pp. 243-260;
Srinlvasan, G., Narendran, T.T., Mahadevan, B., An assignment model for the part-
families problem in group technology (1990) Int J Prod Res, 28 (1), pp. 145-152;
Stanfel, L.E., Machine clustering for economic production (1985) Eng Costs Prod
Econ, 9 (1-3), pp. 73-81;
Su, C.T., Hsu, C.M., Multi-objective machine-part cell formation through parallel
simulated annealing (1998) Int J Prod Res, 36 (8), pp. 2185-2207;
Suresh Kumar, C., Chandrasekharan, M.P., Grouping efficacy: a quantitative
criterion for goodness of block diagonal forms of binary matrices in group
technology (1990) Int J Prod Res, 28 (2), pp. 233-243;
Tsai, C.C., Lee, C.Y., Optimization of manufacturing cell formation with a multi-
functional mathematical programming model (2006) Int J Adv Manuf Technol, 30 (3-4),
pp. 309-318;
van Veldhuizen, D.A., (1999) Multiobjective Evolutionary Algorithms:
Classifications, Analyses, and New Innovations, , No. AFIT/DS/ENG/99-01. Air Force
Institute of Technology Wright–Patterson AFB Oh School of Engineering;
Verma, A., Kaushal, S., Sangaiah, A.K., Computational intelligence based heuristic
approach for maximizing energy efficiency in internet of things (2017) Intelligent
decision support systems for sustainable computing, pp. 53-76., Sangaiah AK, (ed),
Springer, Cham;
Waghodekar, P.H., Sahu, S., Machine-component cell formation in group technology:
MACE (1984) Int J Prod Res, 22 (6), pp. 937-948;
Wemmerlöv, U., Hyer, N.L., Research issues in cellular manufacturing (1987) Int J
Prod Res, 25 (3), pp. 413-431;
Wemmerlov, U., Johnson, D.J., Cellular manufacturing at 46 user plants:
implementation experiences and performance improvements (1997) Int J Prod Res, 35
(1), pp. 29-49;
White, J.A., Garrett, S.M., Improved pattern recognition with artificial clonal
selection? (2003) Artificial Immune Systems, pp. 181-193., Springer, Berlin;
Wilcoxon, F., Individual comparisons by ranking methods (1945) Biom Bull, 1 (6),
pp. 80-83;
Wu, T.H., Chung, S.H., Chang, C.C., A water flow-like algorithm for manufacturing
cell formation problems (2010) Eur J Oper Res, 205 (2), pp. 346-360;
Yang, M.S., Yang, J.H., Machine-part cell formation in group technology using a
modified ART1 method (2008) Eur J Oper Res, 188 (1), pp. 140-152;
Yang, J.H., Sun, L., Lee, H.P., Qian, Y., Liang, Y.C., Clonal selection based
memetic algorithm for job shop scheduling problems (2008) J Bionic Eng, 5 (2), pp.
111-119;
Yin, Y., Yasuda, K., Similarity coefficient methods applied to the cell formation
problem: a comparative investigation (2005) Comput Ind Eng, 48 (3), pp. 471-489;
Zeb, A., Khan, M., Khan, N., Tariq, A., Ali, L., Azam, F., Jaffery, S.H.I.,
Hybridization of simulated annealing with genetic algorithm for cell formation
problem (2016) Int J Adv Manuf Technol, 86 (5-8), pp. 2243-2254;
Zhang, M., Wang, H., Cui, Z., Chen, J., Hybrid multi-objective cuckoo search with
dynamical local search (2018) Memet Comput, 10 (2), pp. 199-208;
Zheng, Z., Saxena, N., Mishra, K.K., Sangaiah, A.K., Guided dynamic particle swarm
optimization for optimizing digital image watermarking in industry applications
(2018) Future Gener Comput Syst, 5, p. 256;
Zitzler, E., (1999) Evolutionary Algorithms for Multiobjective Optimization:
Methods and Applications, , Ph.D. thesis, ETH Zurich, Switzerland
CORRESPONDENCE ADDRESS: Roy, D.S.; Department of Computer Science and Engineering,
National Institute of Technology MeghalayaIndia; email: [email protected]
PUBLISHER: Springer Verlag
ISSN: 14327643
ABBREVIATED SOURCE TITLE: Soft Comput.
SOURCE: Scopus
Danilovic, M., Ilic, O.

55621808100;7801578785;
A novel hybrid algorithm for manufacturing cell formation problem
(2019) Expert Systems with Applications, 135, pp. 327-350.
85067255174&doi=10.1016%2fj.eswa.2019.06.019&partnerID=40&md5=e6f21fda1257c794a9d83
ea351f8a6cf
DOI: 10.1016/j.eswa.2019.06.019
AFFILIATIONS: Department of Operations Management, Faculty of Organizational
Sciences, University of Belgrade, Jove Ilića 154, Beograd, 11000, Serbia
ABSTRACT: The cell formation problem is a crucial component of a cell production
design in a manufacturing system. Problems related to the cell formation problem
are complex NP-hard problems. The goal of the work is to design the algorithm for
the cell formation problem that is more efficient then the best-known algorithms
for the same problem. The strategy of the new approach is to use the specificities
of the input instances to narrow down the feasible set, and thus increase the
efficiency of the optimization process. In the dynamic production environment,
efficacy is one of the most significant characteristics of the applied expert
system. The result is, extensible hybrid algorithm that can be used to solve
complex, multi-criteria optimization cell formation problems. The new algorithm
produces solutions that are as good as, or better than, the best results previously
reported in literature on all commonly used test instances. The time efficiency of
the proposed algorithm is at least an order of magnitude better than the efficiency
of the most efficient reported algorithms. The obtained experimental results,
modularity and generality of the new algorithm imply the significant impact on the
expert systems for cell formation problem since the proposed strategy can improve
the efficiency of existing algorithms for the grouping problems. © 2019
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Feasible solution set;
Grouping efficacy index; Part-machine clustering
INDEX KEYWORDS: Cells; Computational complexity; Cytology; Efficiency; Expert
systems; Multiobjective optimization, Best-known algorithms; Cell formation; Cell
formation problem; Feasible solution set; Grouping efficacy; Manufacturing cell
formation; Multicriteria optimization; Part-machine clustering, Cellular
manufacturing
REFERENCES: Arkat, J., Hosseini, L., Farahani, M., Minimization of exceptional
elements and voids in the cell formation problem using a multi-objective genetic
algorithm (2011) Expert System with Applications, 38, pp. 9597-9602;
Askin, R., Subramanian, S., A cost-based heuristic for group technology
configuration (1987) International Journal of Production Research, 25 (1), pp. 101-
113;
Ballakur, A., Steudel, H., A within in cell utilization based heuristic for
designing cellular manufacturing system (1987) International Journal of Production
Research, 25, pp. 639-655;
Boctor, F., A linear formulation of the machine part cell formation problem (1991)
International Journal of Production Research, 29 (2), pp. 343-356;
Boe, W., Cheng, C., A close neighbour algorithm for designing cellular
manufacturing systems (1991) International Journal of Production Research, 29 (10),
pp. 2097-2116;
Brusco, M., An exact algorithm for maximizing grouping efficacy in part-machine
clustering (2015) IIE Transactions, 47 (6), pp. 653-671;
Brusco, M., An iterated local search heuristic for cell formation (2015) Computers
& Industrial Engineering, 90, pp. 292-304;
with a variable number of production cells (2018) Computers and Operations
Research, 91, pp. 112-120;
Carrie, A., Numerical taxonomy applied to group technology and plant layout (1973)
Chan, H., Milner, D., Direct clustering algorithm for group formation in cellular
manufacture (1982) Journal of Manufacturing Systems, 1, pp. 65-75;
Chandrasekharan, M., Rajagopalan, R., MODROC: An extension of rank order clustering
for group technology (1986) International Journal of Production Research, 24 (5),
pp. 1221-1233;
Chandrasekharan, M., Rajagopalan, R., An ideal seed non-hierarchical clustering
algorithm for cellular manufacturing (1986) International Journal of Production
Research, 24 (2), pp. 451-464;
Chandrasekharan, M., Rajagopalan, R., ZODIAC: An algorithm for concurrent formation
of part-families and machine-cells (1987) International Journal of Production
Research, 25 (6), pp. 835-850;
Chandrasekharan, M., Rajagopalan, R., GROUPABILITY: An analysis of the properties
of binary data matrices for group technology (1989) International Journal of
Danilovic, M., Ilic, O., A generalized constructive algorithm using insertion-based
heuristics (2016) Computers and Operations Research, 66, pp. 29-43;
Dıaz, J., Luna, D., Luna, R., A GRASP heuristic for the manufacturing cell
formation problem (2012) Top, 20 (3), pp. 679-706;
Dura´n, O., Rodriguez, N., Consalter, L., Collaborative particle swarm optimization
with a data mining technique for manufacturing cell design (2010) Expert Systems
with Applications, 37, pp. 1563-1567;
Elbenani, B., Ferland, J., An exact method for solving the manufacturing cell
formation problem (2012) International Journal of Production Research, 50, pp.
4038-4045;
Feng, Y., Pheng, K., An exact schema theorem for adaptive genetic algorithm and its
application to machine cell formation (2011) Expert Systems with Applications, 38,
pp. 8538-8552;
Goncalves, J., Resende, M., An evolutionary algorithm for manufacturing cell
formation (2004) Computers & Industrial Engineering, 47, pp. 247-273;
James, T., Brown, E., Keeling, K., A hybrid grouping algorithm for the cell
formation problem (2007) Computers & Operations Research, 34, pp. 2059-2079;
King, J., Machine-component grouping in production flow analysis: An approach using
a rank order clustering algorithm (1980) International Journal of Production
Research, 18, pp. 213-232;
King, R., Nakornchai, V., Machine-component group formation in group technology:
Review and extension (1982) International Journal of Production Research, 20 (2),
pp. 117-133;
Knuth, D.E., The art of computer programming, volume 4A combinatorial algorithms
(2011), ADDISON-WESLEY, Pearson Education Inc Boston; Kumar, K., Vannelli, A.,
Strategic subcontracting for efficient disaggregated manufacturing (1987)
Kumar, K., Kusiak, A., Vannelli, A., Grouping of parts and components in flexible
manufacturing systems (1986) European Journal of Operations Research, 24, pp. 387-
397;
Kusiak, A., Cho, M., Similarity coefficient algorithm for solving the group
pp. 2633-2646;
Kusiak, A., Chow, W., Efficient solving of the group technology problem (1987)
Journal of Manufacturing Systems, 6 (2), pp. 117-124;
Li, X., Baki, M., Aneja, Y., An ant colony optimization metaheuristic for machine-
part cell formation problems (2010) Computers & Operations Research, 37, pp. 2071-
2081;
Mahdavi, I., Paydar, M., Solimanpur, M., Heidarzade, A., Genetic algorithm approach
for solving a cell formation problem in cellular manufacturing (2009) Expert
Systems with Applications, 36, pp. 6598-6604;
Martinsa, I., Pinheiroa, R., Prottia, F., Ochi, L., A hybrid iterated local search
and variable neighborhood descent heuristic applied to the cell formation problem
(2015) Expert Systems With Applications, 42, pp. 8947-8955;
McCormick, W., Schweitzer, P., White, T., Problem decomposition and data
reorganization by a clustering technique (1972) Operations Research, 20, pp. 993-
1009;
McLean, C., Bloom, H., Hopp, T., The virtual manufacturing cell (1982) Proceedings
of the 4th IFAC/IFIP conference on information control problems in manufacturing
technology, Gaithersburg, MD, pp. 105-111;
Mosier, C., Taube, L., The facets of group technology and their impact on
implementation (1985) OMEGA, 13 (5), pp. 381-391;
technology machine clustering problem (1985) OMEGA, 13 (6), pp. 577-578;
Mutel, B., Ostrosi, E., Feature-based manufacturing cell formation using a fuzzy-
set approach (2002) International Journal Computer Integrated Manufacturing, 15
(2), pp. 152-167;
Noktehdan, A., Karimi, B., Husseinzadeh Kashan, A., A differential evolution
algorithm for the manufacturing cell formation problem using group based operators
(2010) Expert Systems with Applications, 37, pp. 4822-4829;
Noktehdan, A., Seyedhosseini, S., Saidi-Mehrabad, M., A Metaheuristic algorithm for
the manufacturing cell formation problem based on grouping efficacy (2016)
International Journal of Advanced Manufacturing Technology, 82 (1), pp. 25-37;
Onwubolu, G., Mutingi, M., A genetic algorithm approach to cellular manufacturing
systems (2001) Computers & Industrial Engineering, 39 (1-2), pp. 125-144;
Ostrosi, E., Fougères, A.-J., Intelligent virtual manufacturing cell formation in
cloud-based design and manufacturing (2018) Engineering Applications of Artificial
Intelligence, 76, pp. 80-95;
Pailla, A., Trindade, A., Parada, V., Ochi, V., A numerical comparison between
Paydar, M., Saidi-Mehrabad, M., A hybrid genetic-variable neighborhood cell
formation problem based on group efficiency (2013) Computers & Operations Research,
40, pp. 980-990;
Pinheiro, R., Martins, I., Protti, F., Ochi, L., Simonetti, L., Subramanian, A., On
solving manufacturing cell formation via bicluster editing (2016) European Journal
of Operational Research, 254, pp. 769-779;
Seifoddini, H., A note on the similarity coefficient method and the problem of
improper machine assignment in group technology applications (1989) International
Journal of Production Research, 27 (7), pp. 1161-1165;
Seifoddini, H., Wolfe, P., Application of the similarity coefficient method in
group technology (1986) IIE Transactions, 18 (3), pp. 271-277;
Srinivasan, G., Narendran, T., Mahadevan, B., An assignment model for the part-
families problem in group technology (1990) International Journal of Production
Research, 28 (1), pp. 145-152;
Stanfel, L., Machine clustering for economic production (1985) Engineering Costs
and Production Economics, 9, pp. 73-81;
Stawowy, A., Evolutionary strategy for manufacturing cell design (2006) Omega, The
International Journal of Management Science, 34, pp. 1-18;
Tariq, A., Hussain, I., Ghafoor, A., A hybrid genetic algorithm for machine-part
grouping (2009) Computers & Industrial Engineering, 56, pp. 347-356;
Tunnukij, T., Hicks, C., An enhanced grouping genetic algorithm for solving the
cell formation problem (2009) International Journal of Production Research, 47 (7),
pp. 1989-2007;
Unler, A., Gungo, Z., Applying K-harmonic means clustering to the part-machine
classification problem (2009) Expert Systems with Applications, 36, pp. 1179-1194;
Waghodekar, P., Sahu, S., Machine-component cell formation in group technology MACE
(1984) International Journal of Production Research, 22, pp. 937-948;
Wang, J., A linear assignment clustering algorithm based on the least similar
cluster representatives (1999) IEEE Transactions on Systems Man and Cybernetics
Part A–Systems and Humans, 29 (1), pp. 100-104;
Wu, T., Chang, C., Chung, S., A simulated annealing algorithm for manufacturing
cell formation problems (2008) Expert Systems with Applications, 34, pp. 1609-1617;
Wu, T., Chang, C., Yeh, J., A hybrid heuristic algorithm adopting both Boltzmann
function and mutation operator for manufacturing cell formation problems (2009)
International Journal of Production Economics, 120, pp. 669-688;
Wu, T., Chung, S., Chang, C., A water flow-like algorithm for manufacturing cell
formation problems (2010) European Journal of Operational Research, 205, pp. 346-
360;
Ying, K., Lin, S., Lu, C., Cell formation using a simulated annealing algorithm
with variable neighbourhood (2011) European Journal of Industrial Engineering, 5
(1), pp. 22-42
CORRESPONDENCE ADDRESS: Danilovic, M.; Department of Operations Management, Faculty
of Organizational Sciences, University of Belgrade, Jove Ilića 154, Serbia; email:
[email protected]
PUBLISHER: Elsevier Ltd
ISSN: 09574174
CODEN: ESAPE
ABBREVIATED SOURCE TITLE: Expert Sys Appl
SOURCE: Scopus
Safaei, N., Tavakkoli-Moghaddam, R., Jabal-Ameli, S.

8886880300;56491438400;46061028500;
A generalized cell formation problem in dynamic environment with different inter
and intra-cell batch sizes
(2006) IFAC Proceedings Volumes (IFAC-PapersOnline), 12 (PART 1), 6 p. Cited 1
time.
79961199868&partnerID=40&md5=9d1dd38ccabb540b74a3774135afc36d
AFFILIATIONS: Department of Industrial Engineering, Iran University of Science and

Technology, Iran;
Department of Industrial Engineering, Faculty of Engineering, University of Tehran,
Iran
ABSTRACT: This paper presents a mixed-integer linear programming approach for cell
formation problem (CFP) by assuming that the product mix and part demand change
under a multi-period planning horizon. As a result, the best cell design for one
period may not be efficient for subsequent periods and then reconfiguration of
cells is required. The advantages of the proposed model are as follows: considering
different inter and intra-cell movements, batch sizes, alternative process plan for
part types, sequencing part-operation, machine relocation, cell size, and
flexibility of cell number. The objective is to minimize the sum of the
depreciation and relocation machine cost as well as inter and intra-cell movements
cost. Copyright © 2006 IFAC.
AUTHOR KEYWORDS: Batch size; Dynamic environment; Generalized cell formation
problem; Mathematical model
INDEX KEYWORDS: Alternative process plans; Batch sizes; Cell design; Cell formation
problem; Cell number; Cell size; Demand changes; Dynamic environment; Dynamic
environments; Generalized cell formation problem; Machine costs; Mixed integer
linear programming; Multi-period; Planning horizons; Product mix, Cells; Cellular
manufacturing; Integer programming; Mathematical models, Cytology
REFERENCES: Askin, R.G., Selim, H.M., Vakharia, A.J., A methodology for designing
flexible cellular manufacturing systems (1997) IIE Transactions (Institute of
Industrial Engineers), 29 (7), pp. 599-610;
Balakrishnan, J., Cheng, C.H., Dynamic cellular manufacturing under multiperiod
planning horizons (2005) Journal of Manufacturing Technology Management, 16 (5),
pp. 516-530., DOI 10.1108/17410380510600491;
Chen, M., A mathematical programming model for systems reconfiguration in a dynamic
cell formation condition (1998) Annals of Operations Research, 77 (1), pp. 109-128;
Harhalakis, G., Nagi, R., Proth, J.M., Efficient heuristic in manufacturing cell
formation for group technology applications (1990) International Journal of
Song, S.-J., Hitomi, K., Integrating the production planning and cellular layout
for flexible cellular manufacturing (1996) Production Planning and Control, 7 (6),
pp. 585-593;
Tavakkoli-Moghaddam, R., Aryanezhad, M.B., Safaei, N., Azaron, A., Solving a
dynamic cell formation problem using metaheuristics (2005) Applied Mathematics and
Computation, 170 (2), pp. 761-780., DOI 10.1016/j.amc.2004.12.021, PII
S0096300305000238;
Vakharia, A.J., Kaku, B.K., Redesigning a cellular manufacturing system to handle
long-term demand changes: A methodology and investigation (1993) Decision Sciences,
24 (5), pp. 909-929;
Wilhelm, W.E., Chiou, C.C., Chang, D.B., Integrating design and planning
considerations in cellular manufacturing (1998) Annals of Operations Research, 77,
pp. 97-107
CORRESPONDENCE ADDRESS: Safaei, N.; Department of Industrial Engineering, Iran
University of Science and TechnologyIran; email: [email protected]
ISSN: 14746670
ISBN: 9783902661043
ABBREVIATED SOURCE TITLE: IFAC Proc. Vol. (IFAC-PapersOnline)
DOCUMENT TYPE: Conference Paper
SOURCE: Scopus
Chung, S.-H., Wu, T.-H., Chang, C.-C.

12239511500;7404814990;57142825500;
An efficient tabu search algorithm to the cell formation problem with alternative
routings and machine reliability considerations
(2011) Computers and Industrial Engineering, 60 (1), pp. 7-15. Cited 55 times.
78650572280&doi=10.1016%2fj.cie.2010.08.016&partnerID=40&md5=f21fa0e5453879ab4a6b69
b3ad9ba1b0
DOI: 10.1016/j.cie.2010.08.016
AFFILIATIONS: Department of Industrial Engineering and Management, National Chiao
Tung University, 1001, Ta Hsueh Road, Hsinchu 300, Taiwan;
Department of Business Administration, National Taipei University, 151, University
Road, San Shia, Taipei 237, Taiwan
ABSTRACT: Cell formation is the first step in the design of cellular manufacturing
systems. In this study, an efficient tabu search algorithm based on a similarity
coefficient is proposed to solve the cell formation problem with alternative
process routings and machine reliability considerations. In the proposed algorithm,
good initial solutions are first generated and later on improved by a tabu search
algorithm combining the mutation operator and an effective neighborhood solution
searching mechanism. Computational experiences from test problems show that the
proposed approach is extremely effective and efficient. When compared with the
mathematical programming approach which took three hours to solve problems, the
proposed algorithm is able to produce optimal solutions in less than 2 s. © 2010
Published by Elsevier Ltd.
AUTHOR KEYWORDS: Alternative process routings; Cell formation; Machine
reliability; Mutation operator; Tabu search
INDEX KEYWORDS: Alternative process routings; Cell formation; Cell formation
problem; Cell formation problem with alternative routings; Cellular manufacturing
systems; Initial solution; Machine reliability; Mutation operators; Optimal
solutions; Searching mechanism; Similarity coefficients; Tabu search algorithms;
Test problem, Cellular manufacturing; Learning algorithms; Mathematical operators;
Mathematical programming; Problem solving; Reliability, Tabu search
REFERENCES: Albadawi, Z., Bashir, H.A., Chen, M., A mathematical approach for the
formation of manufacturing cells (2005) Computers and Industrial Engineering, 48,
pp. 3-21;
Alhourani, F., Seifoddini, H., Machine cell formation for production management in
cellular manufacturing systems (2007) International Journal of Production Research,
45 (4), pp. 913-934;
Ballakur, A., Steudel, H.J., A within cell utilization based heuristic for
designing cellular manufacturing systems (1987) International Journal of Production
Research, 25, pp. 639-655;
Bhide, P., Bhandwale, A., Kesavadas, T., Cell formation using multiple process
plans (2005) Journal of Intelligent Manufacturing, 16, pp. 53-65;
Boctor, F., A linear formulation of the machine-part cell formation problem (1991)
Burbidge, J.L., (1975) The Introduction of Group Technology, , Wiley New York;
Das, K., Lashkari, R.S., Sengupta, S., Reliability consideration in the design and
analysis of cellular manufacturing systems (2007) International Journal of
Production Economics, 105 (1), pp. 243-262., DOI 10.1016/j.ijpe.2006.04.015, PII
S0925527306001137;
Diallo, M., Perreval, H., Quillot, A., Manufacturing cell design with flexible
routing capability in presence of unreliable machines (2001) International Journal
of Production Economics, 74 (13), pp. 175-182;
Diaz, B.A., Lozano, S., Racero, J., Guerrero, F., Machine cell formation in
generalized group technology (2001) Computers and Industrial Engineering, 41, pp.
227-240;
Glover, F., Tabu search - Part i (1989) ORSA Journal on Computing, 1 (3), pp. 190-
206;
Glover, F., Tabu search - Part II (1990) ORSA Journal on Computing, 2 (1), pp. 4-
32;
Hu, L., Yasuda, K., Minimising material handling cost in cell formation with
alternative processing routes by grouping genetic algorithm (2006) International
Journal of Production Research, 44, pp. 2133-2167;
Jabal Ameli, M.S., Arkat, J., Cell formation with alternative process routings and
machine reliability consideration (2008) International Journal of Advanced
Manufacturing Technology, 35, pp. 761-768;
breakdowns in the generalized cell formation problem (2008) International Journal
of Advanced Manufacturing Technology, 39, pp. 838-850;
Jeon, G., Broering, M., Leep, H.R., Parsaei, H.R., Wong, J.P., Part family
formation based on alternative routes during machine failure (1998) Computers and
Kazerooni, M., Luong, H.S., Abhary, K., A genetic algorithm based cell design
considering alternative routing (1997) Computer Integrated Manufacturing Systems,
10 (2), pp. 93-107;
Kim, C.-O., Baek, J.-G., Baek, J.-K., A two-phase heuristic algorithm for cell
formation problems considering alternative part routes and machine sequences (2004)
manufacturing systems (1986) International Journal of Production Research, 24, pp.
387-397;
Kusiak, A., The generalized group technology concept (1987) International Journal
of Production Research, 25, pp. 561-569;
technology problem (1992) International Journal of Production Research, 30, pp.
2633-2646;
Lee, M.K., Luong, H.S., Abhary, K., A genetic algorithm based cell design
10 (2), pp. 93-108;
formation in generalized group technology (2005) International Journal of
Logendran, R., Talkington, D., Analysis of cellular and functional manufacturing
system in the presence of machine breakdown (1997) International Journal of
Production Economics, 53 (3), pp. 239-256;
Lozano, S., Adenso-Diaz, B., Onieva, L., A one-step tabu search algorithm for
manufacturing cell design (1999) Journal of the Operational Research Society, 50,
pp. 509-516;
Lozano, S., Guerrero, F., Eguia, I., Onieva, L., Cell design and loading in the
presence of alternative routing (1999) International Journal of Production
Research, 37, pp. 3289-3304;
McAuley, J., Machine grouping for efficient production (1972) Production Engineer,
52, pp. 53-57;
Mitrovanov, S.P., (1966) The Scientific Principles of Group Technology, , National
Lending Library Translation Boston Spa, Yorkshire;
Nair, G.J., Narendran, T.T., CASE: A clustering algorithm for cell formation with
sequence data (1998) International Journal of Production Research, 36, pp. 157-179;
Savsar, M., Reliability analysis of a flexible manufacturing cell (2000)

Reliability Engineering & System Safety, 67, pp. 147-152;
Seifoddini, H., Djassemi, M., Merits of the production volume based similarity
coefficient in machine cell formation (1995) Journal of Manufacturing Systems, 14,
pp. 35-44;
replicate machines (1999) International Journal of Production Research, 37, pp.
707-720;
Srinivasan, G., Narendran, T., Mahadevan, B., An assignment model for the part
Research, 28 (1), pp. 145-152;
Sun, D., Lin, L., Batta, R., Cell formation using tabu search (1995) Computers and
Industrial Engineering, 28, pp. 485-494;
Wang, J., Formation of machine cells and part families in cellular manufacturing
systems using a linear assignment algorithm (2003) Automatica, 39, pp. 1607-1615;
Wemmerlov, U., Hyer, N., Research issues in cellular manufacturing (1987)
International Journal of Production Research, 25, pp. 413-431;
Won, Y.K., Kim, S.H., Multiple criteria clustering algorithm for solving the group
Engineering, 32, pp. 207-220;
Wu, T.-H., Chang, C.-C., Chung, S.-H., A simulated annealing algorithm to
manufacturing cell formation problems (2008) Expert Systems with Applications, 34,
pp. 1609-1617;
Wu, T.-H., Chung, S.-H., Chang, C.-C., Hybrid simulated annealing algorithm with
Wu, T.-H., Low, C., Wu, W.-T., A tabu search approach to the cell formation problem
(2004) International Journal of Advanced Manufacturing Technology, 23, pp. 916-924;
problem: A taxonomy and review (2006) International Journal of Production
Economics, 101, pp. 329-352;
Zakarian, A., Kusiak, A., Modeling manufacturing dependability (1997) IEEE
Transactions Robotics and Automation, 13 (2), pp. 161-168
CORRESPONDENCE ADDRESS: Wu, T.-H.; Department of Business Administration, National
Taipei University, 151, University Road, San Shia, Taipei 237, Taiwan; email:
[email protected]
ISSN: 03608352
CODEN: CINDD
ABBREVIATED SOURCE TITLE: Comput Ind Eng
SOURCE: Scopus
Li, X., Baki, M.F., Aneja, Y.P.

57192491061;7003403469;7004571474;
An ant colony optimization metaheuristic for machinepart cell formation problems
(2010) Computers and Operations Research, 37 (12), pp. 2071-2081. Cited 53 times.
77955281012&doi=10.1016%2fj.cor.2010.02.007&partnerID=40&md5=432e7ca87344e08075c5f4
6055e14caf
DOI: 10.1016/j.cor.2010.02.007
AFFILIATIONS: School of Economics and Management, Tongji University, Shanghai
200092, China;
Odette School of Business, University of Windsor, Windsor, ON N9B 3P4, Canada
ABSTRACT: In this paper we propose an ant colony optimization metaheuristic (ACO-
CF) to solve the machinepart cell formation problem. ACO-CF is a MAXMIN ant system,
which is implemented in the hyper-cube framework to automatically scale the
objective functions of machinepart cell formation problems. As an intensification
strategy, we integrate an iteratively local search into ACO-CF. Based on the
assignment of the machines or parts, the local search can optimally reassign parts
or machines to cells. We carry out a series of experiments to investigate the
performance of ACO-CF on some standard benchmark problems. The comparison study
between ACO-CF and other methods proposed in the literature indicates that ACO-CF
is one of the best approaches for solving the machinepart cell formation problem. ©
2010 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Ant colony optimization; Cell formation problem; Iteratively
local search; Metaheuristic
INDEX KEYWORDS: Ant-colony optimization; Bench-mark problems; Cell formation
problem; Comparison study; Local search; Max-Min Ant System; Metaheuristic;
Objective functions, Artificial intelligence; Cellular manufacturing; Heuristic
methods; Optimization, Algorithms
REFERENCES: Shunk, D., Group technology provides organized approach to realizing
benefits of cims (1985) Industrial Engineering, 17, pp. 74-80;
Hyer, N., Brown, K., Zimmerman, S., A socio-technical systems approach to cell
design: Case study and analysis (1999) Journal of Operational Management, 17, pp.
179-203;
Ballakur, A., Steudel, H., A within-cell utilization based heuristic for designing
25, pp. 639-655;
McCormick Jr., W.T., Sehweitzer, P.J., White, T.W., Problem decomposition and data
1009;
King, J.R., Machine-component grouping in production flow analysis: An approach
using a rank order clustering algorithm (1980) International Journal of Production
Research, 18, pp. 213-232;
King, J., Nakornchai, V., Machine-component group formation in group technology:
Review and extension (1982) International Journal of Production Research, 20, pp.
117-133;
Chandrasekharan, M.P., Rajagopalan, R., Modroc: An extension of rank order
clustering for group technology (1986) International Journal of Production
Research, 24, pp. 1221-1264;
McAuley, D., Machine grouping for efficient production (1972) The Production
Chandrasekharan, M.P., Rajagopalan, R., An ideal seed non-hierarchical clustering
Research, 24 (2), pp. 451-464;
Chandrasekharan, M.P., Rajagopalan, R., ZODIACan algorithm for concurrent formation
Research, 25 (6), pp. 835-850;
Srinivasan, G., Narendran, T.T., Mahadevan, R., An assignment model for the part-
Research, 28 (1), pp. 145-152;
Gunasingh, K., Lashkari, R., Simultaneous grouping of parts and machines in
cellular manufacturing systems. An integer programming approach (1991) Computer &
Logendran, R., Binary integer programming approach for simultaneous machinepart
grouping in cellular manufacturing systems (1993) Computer & Industrial
Adil, G., Rajamani, D., Strong, D., Cell formation considering alternate routings
manufacturing cells (2005) Computers & Industrial Engineering, 48 (1), pp. 3-21;
Defersha, F., Chen, M., A comprehensive mathematical model for the design of
cellular manufacturing systems (2006) International Journal of Production
Economics, 103, pp. 767-783;
Slomp, J., Chowdary, B., Suresh, N., Design of virtual manufacturing cells: A
mathematical programming approach (2005) Robotics and Computer-Integrated
Manufacturing, 21, pp. 273-288;
Tavakkoli-Moghaddam, R., Javadian, N., Javadi, B., Safaei, N., Design of a facility
layout problem in cellular manufacturing systems with stochastic demands (2007)
Applied Mathematics and Computation, 184, pp. 721-728;
Mahdavi, I., Javadi, B., Fallah-Alipour, K., Slomp, J., Designing a new
mathematical model for cellular manufacturing system based on cell utilization
(2007) Applied Mathematics and Computation, 190, pp. 662-670;
Boctor, F.F., A linear formulation of the machinepart cell formation problem (1991)
Sofianopoulou, S., Application of simulated annealing to a linear model for the
formulation of machine cells ingroup technology (1997) International Journal of
Production Research, 35, pp. 501-511;
Xambre, A., Vilarinho, P., A simulated annealing approach for manufacturing cell
formation with multiple identical machines (2003) European Journal of Operational
Research, 151, pp. 434-446;
Baykasoglu, A., A metaheuristic algorithm to solve quadratic assignment
formulations of cell formation problems without presenting number of cells (2004)
Journal of Intelligent Manufacturing, 15, pp. 753-759;
Lozano, S., Adenso-Diaz, B., Eguia, I., Onieva, L., A one-step tabu search
algorithm for manufacturing cell design (1999) Journals on Behalf of the
Operational Research Society, 50, pp. 509-516;
Wu, T., Low, C., Wu, W., A tabu search approach to the cell formation problem
Venugopal, V., Narendran, T., Genetic algorithm approach to the machine-component

grouping problem with multiple objectives (1992) Computer & Industrial Engineering,
22, pp. 469-480;
Cheng, C.H., Gupta, Y.P., Lee, W.H., Wong, K.F., A TSP-based heuristic for forming
machine groups and part families (1998) International Journal of Production
Research, 36, pp. 1325-1337;
Mak, K.L., Wong, Y.S., Wang, X.X., An adaptive genetic algorithm for manufacturing
cell formation (2000) International Journal of Advanced Manufacturing Technology,
16, pp. 491-497;
to the design of cellular manufacturing systems (2004) International Journal of
Rajagopalan, R., Batra, J., A genetic algorithm approach for machine cell formation
(2006) Journal of Advance Manufacturing Systems, 5, pp. 27-44;
Gonalves, J., Resende, M., An evolutionary algorithm for manufacturing cell
Stawowy, A., Evolutionary strategy for manufacturing cell design (2006) The
Brown, E.C., Sumichrast, R.T., CF-GGA: A grouping genetic algorithm for the cell
3651-3669;
Yasuda, K., Hu, L., Yin, Y., A grouping genetic algorithm for the multi-objective
cell formation problem' (2005) International Journal of Production Research, 43
(4), pp. 829-853;
James, T., Brown, E., Keeling, K., A hybrid grouping algorithm for the cell
formation problem (2007) Computers & Operations Research, 34, pp. 2059-2079;
Islier, A.A., Group technology by an ant system algorithm (2005) International
Kao, Y., Li, Y.L., Ant colony recognition systems for part clustering problems
Megala, N., Rajendran, C., Gopalan, R., An ant colony algorithm for cell-formation
in cellular manufacturing systems (2008) European Journal of Industrial
Engineering, 2 (3), pp. 298-336;
Xu, H., Wang, H., Part family formation for gt applications based on fuzzy
mathematics (1989) International Journal of Production Research, 27, pp. 1637-1651;
Josien, K., Liao, T., Simultaneous grouping of parts and machines with an
integrated fuzzy clustering method (2002) Fuzzy Sets and Systems, 126, pp. 1-21;
Pai, P.-F., Chang, P.-T., Lee, S.-Y., Part-machine family formation using genetic
algorithms in a fuzzy environment (2005) International Journal of Advanced
Torkul, O., Cedimoglu, I., Geyik, A., An application of fuzzy clustering to
manufacturing cell design (2006) Journal of Intelligent and Fuzzy Systems, 17, pp.
173-181;
Kaparthi, S., Suresh, N., An improved neural network leader algorithm for
partmachine grouping in group technology (1993) European Journal of Operational
Research, 69, pp. 342-356;
Venugopal, V., Narendran, T.T., Machinecell formation through neural network models
Kamal, S., Burke, L., FACT: A new neural network-based clustering algorithm for
group technology (1996) International Journal of Production Research, 34, pp. 919-
946;
Saidi-Mehrabad, M., Safaei, N., A new model of dynamic cell formation by a neural
approach (2007) International Journal of Advanced Manufacturing Technology, 33, pp.
1001-1009;
Chandrasekharan, M., Rajagopalan, R., GROUPABILITY: An analysis of the properties
Kumar, C., Chandrasekharan, M., Grouping efficacy: A quantitative criterion for
goodness of block diagonal forms of binary matrices in group technology (1990)
Hsu, C., (1990) Similarity Coefficient Approaches to Machine Component Cell
Formation in Cellular Manufacturing: A Comparative Study, , Dissertation,
University of Wisconsin, USA;
Miltenburg, J., Zhang, W., A comparative evaluation of nine well-known algorithms
for solving the cell formation problem in group technology (1991) Journal of
Operations Management, 10, pp. 44-72;
Nair, G., Narendran, T., Grouping index: A new quantitative criterion for goodness
of block-diagonal forms in group technology (1996) International Journal of
Sarker, B., Simultaneous route selection and cell formation: A mixed-integer
programming time-cost model (1997) Integrated Manufacturing Systems, 8, pp. 374-
377;
Sarker, B., Measure of grouping efficiency in cellular manufacturing systems (2001)
European Journal of Operational Research, 130, pp. 588-611;
Sarker, B., Khan, M., A comparison of existing grouping efficiency measures and a
new weighted grouping efficiency measure (2001) IIE Transactions, 33, pp. 11-27;
Dorigo, M., Sttzle, T., (2004) Ant Colony Optimization, , The MIT Press
Massachusetts;
Sttzle, T., Hoos, H.H., Maxmin ant system (2000) Future Generation of Computer
Systems, 16, pp. 889-914;
Blum, C., Dorigo, M., The hyper-cube framework for ant colony optimization (2004)
IEEE Transactions on Systems, Man, and CyberneticsPart B, 34 (2), pp. 1161-1172;
Mace (1984) International Journal of Production Research, 22, pp. 937-948;
2633-2646;
Journal of Manufacturing Systems, 6, pp. 117-124;
Kumar, K.R., Vannelli, A., Strategic subcontracting for efficient disaggregated
manufacturing (1987) International Journal of Production Research, 25, pp. 1715-
1728;
implementation (1985) OMEGAThe International Journal of Management Science, 13 (5),
pp. 381-391;
Chan, H.M., Milner, D., Direct clustering algorithm for group formation in cellular
Askin, R.G., Subramanian, S.P., A cost-based heuristic for group technology
113;
Zolfaghari, S., Liang, M., Comparative study of simulated annealing, genetic
algorithms and tabu search for solving binary and comprehensive machine-grouping
problems (2002) International Journal of Production Research, 40 (9), pp. 2141-
2158;
Askin, R.G., Standridge, C.R., (1993) Modeling and Analysis of Manufacturing
Systems, , Wiley New York;
De Witte, J., The use of similarity coefficients in production flow analysis (1980)
technology machine clustering problem (1985) OMEGAThe International Journal of
Management Science, 13 (6), pp. 577-583;
Shafer, S.M., Rogers, D.F., Similarity and distance measures for cellular
manufacturing. Part II. An extension and comparison (1993) International Journal of
Kumar, K., Kusiak, A., Vannelli, A., Grouping of parts and components in flexible
manufacturing systems (1986) European Journal of Operational Research, 24, pp. 387-
397;
Boe, W.J., Cheng, C.H., A close neighbor algorithm for designing cellular
pp. 2097-2116;
Zolfaghari, S., Liang, M., A new genetic algorithm for the machine/part grouping
problem involving processing times and lot sizes (2002) Computer & Industrial
Birattari, M., (2005) The Problem of Tuning Metaheuristics As Seen from A Machine
Learning Perspective, , Dissertation, Universite Libre De Bruxelles, Belgium;
Srinivasan, G., Narendran, T.T., GRAFICSa nonhierarchical clustering algorithm for
478;
Srinivasan, G., A clustering algorithm for machine cell formation in group
technology using minimum spanning trees (1994) International Journal of Production
Research, 32 (9), pp. 2149-2158;
systems (2001) Computer & Industrial Engineering, 39, pp. 125-144;
Dimopoulos, C., Mortt, N., A hierarchical clustering methodology based on genetic
programming for the solution of simple cell-formation problems (2001) International
Islier, A.A., (2008), Personal communicationCORRESPONDENCE ADDRESS: Li, X.; School
of Economics and Management, Tongji University, Shanghai 200092, China; email:
[email protected]
ISSN: 03050548
CODEN: CMORA
ABBREVIATED SOURCE TITLE: Comp. Oper. Res.
SOURCE: Scopus
Ho, Y.-C., Moodie, C.L.

7402554803;7003309996;
Solving cell formation problems in a manufacturing environment with flexible
processing and routeing capabilities
78 times.
0030270466&doi=10.1080%2f00207549608905065&partnerID=40&md5=dbb30439c3207857f60b532
898cbba81
DOI: 10.1080/00207549608905065
AFFILIATIONS: Institute of lndustrial Management, National Central University,
Chung-Li, 32054, Taiwan;
School of Industrial Engineering, Purdue University, West Lafayette, IN, 47907,
United States
ABSTRACT: In this paper, we investigate cell formation problems in a manufacturing
system with flexible processing and routeing capabilities. Flexible processing
means that a part can be manufactured by any one of several process combinations.
Flexible routeing means that even when the processes are fixed, the part can
traverse any one of several routes—each offering the same processes. The cell
formation problems for these types of manufacturing systems are different from
traditional problems. Traditional cell formation problems are for manufacturing
systems with fixed processes and routes where one knows what machines will be used
for manufacturing the parts. However, this information will not be available in the
flexible systems discussed here, since a part can be completed by any one of the
many different combinations of machines. In other words, it is possible to
manufacture two identical parts using different sets of machines. Traditional cell
formation techniques rely on knowing the specific machine usage information of
parts, therefore cannot be applied to the cell formation problems defined here. We
propose a solution procedure that can overcome this difficulty and allow us to
solve the cell forming problems in this flexible processing and routeing
manufacturing environment. © 1996 Taylor and Francis Group, LLC.
INDEX KEYWORDS: Algorithms; Efficiency; Manufacture; Problem solving; Processing;
Technology, Cell formation problems; Routing capabilities; Traditional cell
formation, Flexible manufacturing systems
REFERENCES: Bukbiixjë, J.L., Production flowanalysis (1971) The Production
Engineer, pp. 139-152., April/May;
Bukhidgë, J.L., A manual method of production llow analysis (1977) The Production
Engineer, pp. 34-38., Oct;
Burhidc, I.J.L., (1989) Production Flow Analysis-For Planning Group Technology, ,
Oxford: Clarendon Press;
Cahhie, A.S., Numerical taxonomy applied to group technology and plant layout
cellular manufacturing (1982) Journal of Manufacturing Systems, 1 (10), pp. 65-74;
Chooqinuh, F., A framework for the design of cellular manufacturing systems (1988)
(1993) Using the CPLEX Callable Library and CPLEX Mixed Integer Library, , Incline
Village, NV: CPLEX Optimization);
El-Essawy, I.G.K., Torrance, J., Component flow analysis-an effective approach to
production systems’ design (1972) The Production Engineer, pp. 165-170., May;
Gunasingh, K.R., Lashkari, R.S., Machine grouping problem in cellular manufacturing
systems-an integer programming approach (1989) International Journal of Production
Research, 27 (9), pp. 1465-1473;
Research, 18 (2), pp. 213-232;
pp. 2633-2646;
Lin, G.Y., (1993) A Distributed Production Control for Intelligent Manufacturing
Systems, , PhD thesis, Purdue University;
Mc Auley, J., Machine grouping for efficient production (1972) The Production
Engineer, pp. 53-57., February;
Mc Cormick, W.T., Jr., Schweitzer, P.J., White, T.W., Problem decomposition and
data reorganization by a clustering technique (1972) Operations Research, pp. 993-
1009., October;
Moodie, C.L., Drolet, J., Ho, Y.-C., Warren, G.M.H., Cell design strategies for
efficient materials handling (1994) Material Flow Systems in Manufacturing, , J. M.
A. Tanchoco (Ed.) (London: Chapman & Hall;
Moon, Y.B., Forming part-machine families for cellular manufacturing: A neural-
network approach (1990) International Journal of Advanced Manufacturing Technology,
5, pp. 278-291;
Moon, Y.B., Kao, Y., Automatic generation of group technology families during the
part classification process (1993) International Journal of Advanced Manufacturing
Technology, 8, pp. 160-166;
Moon, Y.B., Chi, S.C., Generalized part family formation using neural network
Rajamani, D., Singh, N., Aneja, Y.P., Integrated design of cellular manufacturing
systems in the presence of alternative process plans (1990) International Journal
Wemmerlov, U., Hyer, N.L., Group technology in the US manufacturing industry: A
survey of current practices (1989) International Journal of Production Research, 27
(8), pp. 1287-1304;
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in U S, industry: A survey of
users (1989) International Journal of Production Research, 27 (9), pp. 1511-1530
CORRESPONDENCE ADDRESS: Moodie, C.L.; School of Industrial Engineering, Purdue
University, West Lafayette, IN, 47907, United States
ISSN: 00207543
SOURCE: Scopus
Almonacid, B., Soto, R., Crawford, B.

56407124500;24403038600;23395875300;
Comparing three simple ways of generating neighboring solutions when solving the
cell formation problem using two versions of migrating birds optimization
(2017) Proceedings of the 2017 17th International Conference on Computational
Science and Its Applications, ICCSA 2017, art. no. 7999653, .
85041198813&doi=10.1109%2fICCSA.2017.7999653&partnerID=40&md5=fbc4d1ee345e1db1f2aeb
b86e155fca8
DOI: 10.1109/ICCSA.2017.7999653
AFFILIATIONS: Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile
ABSTRACT: The cell formation problem is a classic optimization problem devoted to
the manufacturing industry. Such a problem proposes to divide a manufacturing plant
in a set of cells, where each cell is composed of machines which in turn process
product parts. The goal is to design a plant division in such a way the need for
part interchange among cells is minimized. The idea is to reduce cost and increase
productivity. In this paper, we propose different variations of the original
migrating birds optimization algorithm for solving this problem. In particular, we
propose two different leader exchange procedures and three different neighboring
solution generations. We illustrate interesting results by solving well-known
instances considering the group efficiency as optimization criterion in contrast to
previous work done on this metaheuristic. © 2017 IEEE.
AUTHOR KEYWORDS: Cell Formation Problems; Evolutionary computation; Heuristic;
Metaheuristic; Migrating Birds Optimization
INDEX KEYWORDS: Birds; Cells; Cellular manufacturing; Cytology; Evolutionary
algorithms; Manufacture; Optimization, Cell formation problem; Heuristic;
Manufacturing industries; Metaheuristic; Migrating birds; Optimization algorithms;
Optimization criteria; Optimization problems, Problem solving
REFERENCES: Suresh Kumar, C., Chandrasekharan, M., Grouping efficacy: A
quantitative criterion for goodness of block diagonal forms of binary matrices in
group technology (1990) International Journal of Production Research, 28 (2), pp.
233-243;
Ying, K.-C., Lin, S.-W., Lu, C.-C., Cell formation using a simulated annealing
algorithm with variable neighbourhood (2010) European Journal of Industrial
Wu, T.-H., Chung, S.-H., Chang, C.-C., A water flow-like algorithm for
manufacturing cell formation problems (2010) European Journal of Operational
Research, 205 (2), pp. 346-360;
Li, X., Baki, M., Aneja, Y.P., An ant colony optimization metaheuristic for
machine-part cell formation problems (2010) Computers & Operations Research, 37
(12), pp. 2071-2081;
Paydar, M.M., Saidi-Mehrabad, M., A hybrid geneticvariable neighborhood search
algorithm for the cell formation problem based on grouping efficacy (2013)
Computers & Operations Research, 40 (4), pp. 980-990;
Duman, E., Uysal, M., Alkaya, A.F., Migrating birds optimization: A new
metaheuristic approach and its performance on quadratic assignment problem (2012)
Information Sciences, 217, pp. 65-77;
Pan, Q.-K., Dong, Y., An improved migrating birds optimisation for a hybrid
flowshop scheduling with total flowtime minimisation (2014) Information Sciences,
277, pp. 643-655;
Niroomand, S., Hadi-Vencheh, A., Şahin, R., Vizvari, B., Modified migrating birds
optimization algorithm for closed loop layout with exact distances in flexible
manufacturing systems (2015) Expert Systems with Applications;
Alkaya, A.F., Algin, R., Metaheuristic based solution approaches for the obstacle
neutralization problem (2015) Expert Systems with Applications, 42 (3), pp. 1094-
1105;
Soto, R., Crawford, B., Almonacid, B., Paredes, F., A migrating birds optimization
algorithm for machine-part cell formation problems (2015) Mexican International
Conference on Artificial Intelligence, pp. 270-281., Springer;
Soto, R., Crawford, B., Almonacid, B., Efficient leader exchange for migrating
birds optimization when solving machinepart cell formation problems (2016)
Information Systems and Technologies (CISTI), 2016 11th Iberian Conference on, pp.
1-7., IEEE;
Soto, R., Crawford, B., Almonacid, B., Paredes, F., Efficient parallel sorting for
migrating birds optimization when solving machine-part cell formation problems
(2016) Scientific Programming, 2016, p. 21;
formation (2004) Computers & Industrial Engineering, 47 (2), pp. 247-273;
Almonacid, B., (2017) Dataset - Migrating Birds Optimization for Cell Formation
Problems, , http://www.inf.ucv.cl/_balmonacid/MPCFP/MBOCFP2017, Pontificia
Universidad Católica de Valparaíso, Chile, [Online];
Review and extension (1982) The International Journal of Production Research, 20
(2), pp. 117-133;
Waghodekar, P., Sahu, S., Machine-component cell formation in group technology:
Mace (1984) The International Journal of Production Research, 22 (6), pp. 937-948;
improper machine assignment in group technology applications (1989) The
technology problem (1992) The International Journal of Production Research, 30
(11), pp. 2633-2646;
Kusiak, A., Chow, W.S., Efficient solving of the group technology problem (1987)
Boctor, F.F., A jinear formulation of the machine-part cell formation problem
(1991) The International Journal of Production Research, 29 (2), pp. 343-356;
Chandrasekharan, M., Rajagopalan, R., Modroc: An extension of rank order clustering
pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., An ideal seed nonhierarchical clustering
Research, 24 (2), pp. 451-463;
implementation-A state-of-the-art survey (1985) Omega, 13 (5), pp. 381-391;
Osaba, E., Diaz, F., Carballedo, R., Onieva, E., Perallos, A., Focusing on the
golden ball metaheuristic: An extended study on a wider set of problems (2014) The
Scientific World Journal, 2014;
Soto, R., Crawford, B., Olivares, R., Galleguillos, C., Castro, C., Johnson, F.,
Paredes, F., Norero, E., Using autonomous search for solving constraint
satisfaction problems via new modern approaches (2016) Swarm and Evolutionary
Computation, 30, pp. 64-77
EDITORS: Taniar D., Rocha A.M.A.C., Misra S., Torre C.M., Cuzzocrea A., Gervasi O.,
Borruso G., Apduhan B.O., Murgante B., Cuzzocrea A., Misra S., Stankova E E.
PUBLISHER: Institute of Electrical and Electronics Engineers Inc.
ISBN: 9781538638934
ABBREVIATED SOURCE TITLE: Proc. Int. Conf. Comput. Sci. Appl., ICCSA
SOURCE: Scopus
Safaei, N., Javadian, N., Saidi-Mehrabad, M., Javadi, B.

8886880300;23485559000;18435197300;16417433500;
A fuzzy goal programming based approach to solve a dynamic cell formation problem
(2006) 36th International Conference on Computers and Industrial Engineering, ICC
and IE 2006, pp. 3201-3210. Cited 1 time.
84886886484&partnerID=40&md5=91b87c20487d68a5f9fe554c202d25b6

Technology, Tehran, Iran;
Department of Management, Azad University of Qaemshahr, Iran;
Department of Industrial Engineering, Mazandaran University of Science and
Technology, Babol, Iran
ABSTRACT: This paper presents a fuzzy goal programming based approach for solving a
multi-objective mixed-integer model of cell formation problem under dynamic
condition. In dynamic condition, a multi-period planning horizon is considered in
which product mix and demand in each period can be different such as seasonal
products demand. As a result, the best cells designed for one period may not be
efficient cells for subsequent periods and some of reconfigurations required. The
advantages of proposed model are considering the machine's
constant/variable/relocation costs, machine duplication, inter/intra cell material
handling, operation sequence and alternative process plans for part types. Resource
constraints are cell size and machine capacity. To illustrate the behavior of the
proposed model, some of instances are solved optimally and computational results
reported.
AUTHOR KEYWORDS: Dynamic cell formation problem; Fuzzy goal programming
INDEX KEYWORDS: Alternative process plans; Cell formation problem; Computational
results; Dynamic cell formation; Fuzzy goal programming; Mixed-integer modeling;
Operation sequences; Resource Constraint, Cells; Computer programming; Cytology;
Industrial engineering, Cellular manufacturing
REFERENCES: Askin, R.G., Selim, H.M., Vakharia, A.J., A methodology for designing
flexible cellular manufacturing systems (1997) IIE Transactions, 29, pp. 599-610;
Abd El-Wahed, W.F., Abo-Sinna, M.A., A hybrid fuzzy-goal programming approach to
multiple objective decision making problems (2001) Fuzzy Sets and Systems, 119, pp.
71-85;
Abd El-Wahed, W.F., Lee, S.M., Interactive fuzzy goal programming for multi-
objective transportation problems (2006) Omega, 34, pp. 58-166;
pp. 516-530;
Bellman, R.E., Zadeh, L.A., Decision making in a fuzzy environment (1970)
Management Science, 17, pp. 141-164;
Challam, G.A., Fuzzy goal programming (FGP) approach to a stochastic transportation
problem under budgetary constraints (1994) Fuzzy Sets and Systems, 66 (3), pp. 293-
299;
cellular manufacturing environment (1998) Annals of Operations Research, 77 (1),
pp. 109-128;
Drolet, J., Abdulnour, G., Rheault, M., The cellular manufacturing evolution (1996)
Computers and Industrial Engineering, 31, pp. 139-142;
Harhalaks, G., Nagi, R., Proth, J., An effective heuristic in manufacturing cell
Harlahakis, G., Ioannou, G., Minis, I., Nagi, R., Manufacturing cell formation
under random product demand (1994) International Journal of Production Research,
32, pp. 47-64;
Jeon, G., Leep, H.R., Forming part families by using genetic algorithm and
designing machine cells under demand changes (2006) Computers & Operations
Research, 33, pp. 263-283;
Marcoux, Y., Drolet, J., Abdulnour, G., Studying the performance of a dynamic
cellular manufacturing system (1997) Computers and Industrial Engineering, 33, pp.
239-242;
Narasimhan, R., Goal programming in a fuzzy environment (1980) Decision Sciences,
11, pp. 325-326;
Narasimhan, R., On fuzzy goal programming: Some comments (1981) Decision Sciences,
12, pp. 532-538;
Rheault, M., Jocelyn, D., Georges, A., Physically reconfigurable virtual cells: A
dynamic model for a highly dynamic environment (1995) Computers and Industrial
Engineering, 29, pp. 221-225., Printed in Great Britain;
Song, S., Hitomi, K., Integrating the production planning and cellular layout for
flexible cellular manufacturing (1996) International Journal of Prod Planning and
Control, 7 (6), pp. 585-593;
dynamic cell formation problem using meta-heuristics (2005) Applied Mathematics and
Computation, 170, pp. 761-780;
24 (5), pp. 909-929;
Wicks, E.M., Reasor, R.J., Designing cellular manufacturing systems with dynamic
part populations (1999) IIE Transactions, 31, pp. 11-20;
Yang, T., Ignizio, J.P., Kism, H.J., Fuzzy programming with nonlinear membership
functions: Piecewise linear approximation (1991) Fuzzy Sets and Systems, 11, pp.
39-53;
Zimmermann, H.J., Fuzzy programming and linear programming with several objective
functions (1978) Fuzzy Sets and Systems, 1, pp. 45-55
CORRESPONDENCE ADDRESS: Department of Industrial Engineering, Iran University of
Science and Technology, Tehran, Iran

ABBREVIATED SOURCE TITLE: Int. Conf. Comput. Ind. Eng., ICC IE
SOURCE: Scopus
Paydar, M.M., Saidi-Mehrabad, M., Jabbarzadeh, A.

23025569300;18435197300;35189134400;
A robust optimization model for generalized cell formation problem considering
machine layout
(2012) Proceedings of International Conference on Computers and Industrial
Engineering, CIE, 1, pp. 267-278.
84893006337&partnerID=40&md5=dd1b7a04ed19622932b0e28a33e189b3

Technology, Tehran, Iran
ABSTRACT: Cell formation problem as one of the most important decision problems in
designing a cellular manufacturing system includes grouping the machines in cells
and the parts as part families. Several factors should be considered in cell
formation problem. As an important issue, machines and their capacity should be
modeled correctly. Another important facet is material handling costs which include
intercellular and intracellular movement costs considering machine layout. In the
proposed model, in addition the aforementioned factors, demand is also considered
in decision making. In this paper, a robust optimization model is developed to
solve cell formation problem and machine layout with uncertainty data, in which the
total costs consisting of intercellular and intracellular (forward and backward)
material handling costs, investment cost of machines and inventory cost are
minimized. The robustness and effectiveness of the proposed model are presented by
comprehensive numerical experiments. © 2012 CIE & SAIIE.
AUTHOR KEYWORDS: Cell formation problem; Machine layout; Robust optimization
INDEX KEYWORDS: Cell formation problem; Decision problems; Forward-and-backward;
Machine layout; Material handling costs; Numerical experiments; Robust
optimization; Robust optimization models, Cellular manufacturing; Costs; Industrial
engineering; Materials handling; Mathematical models, Problem solving
REFERENCES: Heragu, S.S., Group technology and cellular manufacturing (1994) IEEE
Transactions on Systems, Man and Cybernetics, 24 (2), pp. 203-214;
Mahdavi, I., Shirazi, B., Paydar, M.M., A flow matrix-based heuristic algorithm for
cell formation and layout design in cellular manufacturing system (2008) The
International Journal of Advanced Manufacturing Technology, 39, pp. 943-953;
Paydar, M.M., Mahdavi, I., Sharafeddin, I., Solimanpur, M., Designing cellular
manufacturing systems using MDmTSP: Simulated annealing methodology (2010)
Computers & Industrial Engineering, 59 (4), pp. 929-936;
Wu, X., Chu, C.H., Wang, Y., Yan, W., A genetic algorithm for cellular
manufacturing design and layout (2007) European Journal of Operational Research,
181, pp. 156-167;
Solimanpur, M., Foroughi, A., A new approach to the cell formation problem with
alternative processing routes and operation sequence (2011) International Journal
Chung, S., Wub, T., Chang, C., An efficient tabu search algorithm to the cell
(2011) Computers & Industrial Engineering, 60 (1), pp. 7-15;
Eski, O., Ozkarahan, I., Design of manufacturing cells for uncertain production
requirements with presence of routing flexibility (2007) ICIC 2007, pp. 670-681.,
LNAI 4682;
Ghezavati, V.R., Saidi-Mehrabad, M., An efficient hybrid self-learning method for
stochastic cellular manufacturing problem: A queuing-based analysis (2011) Expert
Systems with Applications, 38 (3), pp. 1326-1335;
Szwarc, D., Rajamani, D., Bectort, C.R., Cell formation considering fuzzy demand
and machine capacity (1997) International Journal of Advanced Manufacturing
Shanker, R., Vrat, P., Some design issues in cellular manufacturing using the fuzzy
programming approach (1999) International Journal of Production Research, 37, pp.
2545-2563;
Arikan, F., Gungor, Z., Modeling of a manufacturing cell design problem with fuzzy
multi-objective parametric programming (2009) Mathematical and Computer Modelling,
50 (3-4), pp. 407-420;
Leung, S.C.H., Tsang, S.O.S., Ng, W.L., Wu, Y., A robust optimization model for
multi-site production planning problem in an uncertain environment (2007) European
Journal of Operational Research, 181, pp. 224-238;
MirzapourAl-E-hashem, S.M.J., Malekly, H., Aryanezhad, M.B., A multiobjective
robust optimization model for multi-product multi-site aggregate production
planning in a supply chain under uncertainty (2011) International Journal of
Mulvey, J.M., Vanderbei, R.J., Zenios, S.A., Robust optimization of largescale
systems (1995) Operations Research, 43, pp. 264-281;
Yu, C.S., Li, H.L., A robust optimization model for stochastic logistic problems
(2000) International Journal of Production Economics, 64, pp. 385-397
CORRESPONDENCE ADDRESS: Paydar, M.M.; Department of Industrial Engineering, Iran
University of Science and Technology, Tehran, Iran; email: [email protected]
ISSN: 21648689
ISBN: 9781627486842
ABBREVIATED SOURCE TITLE: Proc. Int. Conf. Comput. Ind. Eng., CIE
SOURCE: Scopus
Tavakkoli-Moghaddam, R., Ranjbar-Bourani, M., Mirzahosseinian, H., Aryanezhad, M.B.

56491438400;26768125700;26768148700;35615819500;
A new multi-objective model for a cell formation problem considering machine
utilization and alternative process routes
(2009) International Journal of Engineering, Transactions A: Basics, 22 (1), pp.
67649969122&partnerID=40&md5=5d84afa38680f9065ea92e1f4ca507e4
AFFILIATIONS: Department of Industrial Engineering, College of Engineering,

University of Tehran, P.O. Box 11155-4563, Tehran, Iran;
Department of Industrial Engineering, Graduate School Islamic, Azad University-
South Tehran Branch, Tehran, Iran;
Department of Industrial Engineering, Iran University of Science and Technology,
P.O. Box 16844, Tehran, Iran
ABSTRACT: This paper presents a novel, multi-objective mixed-integer nonlinear
programming (MINLP) model for a cell formation problem (CFP) with alternative
means. Due to existing contradiction among objectives, three are considered: 1)
Minimizing the total cost consisting of; intercellular movements, purchasing,
operation, and maintenance; 2) maximizing the utilization of machines in the
system; 3) minimizing the deviation levels between the cell utilization (i.e.,
balancing the workload between cells). Furthermore, alternative process for each
part, which is a key characteristic for flexible manufacturing systems, is
considered in this paper. The main goals of our proposed model are to; 1) Select a
process plan for each part with minimum cost, simultaneous machine grouping and
complete series of all parts; 2) Identify the appropriate level of overall
utilization of machines; 3) Balancing the workload among the cells in the
production system.
AUTHOR KEYWORDS: Alternative process plan; Alternative routes; Multi-objective
cell formation problem
INDEX KEYWORDS: Flexible manufacturing systems; Integer programming; Multiobjective
optimization; Process control, Alternative process; Alternative process plan;
Alternative routes; Cell formation problem; Intercellular movement; Key
characteristics; Machine grouping; Machine utilization; Minimum cost; Mixed-integer
nonlinear programming; Multi objective; Multi-objective cell formation problem;
Multiobjective models; Process plan; Production system; Total costs, Cellular
manufacturing
REFERENCES: Wemmerlov, U., Johnson, D.J., Cellular Manufacturing at 46 user Plants:
Implementation Experiences and Performance Improvements (1997) International
Kusiak, A., The Generalized Group Technology Concept (1987) International Journal
Adil, G.K., Rajamani, D., Strong, D., Cell Formation Considering Alternate Routings
Dynamic Cell Formation Problem using Metaheuristics (2005) Applied Mathematics and
Computations, 170 (2), pp. 761-780;
Chen, M., A Mathematical Programming Model for Systems Reconfiguration in a dynamic
Cell Formation Condition (1998) Annals of Operations Research, 77 (1), pp. 109-128;
Caux, C., Bruniaux, R., Pierreval, H., Cell Formation with Alternative Process
Plans and Machine Capacity Constraints: A New Combined Approach (2000)
International Journal of Production Economic, 64, pp. 279-284;
Hwang, H., Ree, P., Routes Selection for the Cell Formation Problem with
Alternative Part Process Plans (1996) Computers and Industrial Engineering, 30 (3),
pp. 423-431;
Sofianopoulou, S., Manufacturing Cells Design with Alternative Process Plans and/or
Replicate Machines (1999) International Journal of Production Research, 37 (3), pp.
707-720;
Arkat, J., Saidi, M., Abbasi, B., Applying Simulated Annealing to Cellular
Manufacturing System Design (2007) International Journal of Advanced Manufacturing
Askin, R., Selim, H., Vakharia, A., A Methodology for Designing Flexible Cellular
Manufacturing Systems (1997) IIEE Transactions, 29 (7), pp. 599-610;
Kim, C.O., Baek, J.G., Baek, J.K., A Two-Phase Heuristic Algorithm for Cell
Formation Problems Considering Alternative Part Routes and Machine Sequences (2004)
Tavakkoli-Moghaddam, R., Minaeian, S., Rabbani, S., A New Multi-Objective Model for
Dynamic Cell Formation Problem with Fuzzy Parameters (2008) International Journal
of Engineering-Transactions A, 21 (2), pp. 1-14., Basic;
Shafer, S.M., Rogers, D.F., A Goal Programming Approach to the Cell Formation
Problem (1991) Journal of Operations Management, 10, pp. 28-43;
Venugopal, V., Narendran, T.T., A Genetic Algorithm Approach to the Machine-
Component Grouping Problem with Multiple Objectives (1992) Computers and Industrial
Mansouri, S.A., Moattar-Husseini, S.H., Zegordi, S.H., A Genetic Algorithm for
Multiple Objective Dealing with Exceptional Elements in Cellular Manufacturing
(2003) Production Planning and Control, 14 (5), pp. 437-446;
Yasuda, K., Hu, L., Yin, Y., A Grouping Genetic Algorithm for the multi-Objective
Cell Formation Problem (2005) International Journal of Production Research, 43 (4),
pp. 829-853;
Liang, M., Taboun, S.M., Converting Functional Manufacturing Systems into focused
Machine Cells-a Bi-Criterion Approach (1995) International Journal of Production
Research, 33, pp. 2147-2161;
Mansouri, S.A., Moattar-Husseini, S.M., Newman, S.T., A Review of the Modern
Approaches to Multi-Criteria Cell Design (2000) International Journal of Production
Research, 38 (5), pp. 1201-1218;
Logendran, R., Effect of the Identification of Key Machines in the Cell Formation
Problem of Cellular Manufacturing Systems (1990) Computers and Industrial
Engineering, 20 (4), pp. 439-449;
Collette, Y., Siarry, P., (2003) Multi-Objective Optimization: Principles and Case
Studies, , Springer;
Aramoon Bajestani, M., Rabbani, M., Rahimi-Vahed, A. R. and Baharian Khoshkhou, G.,
A Multi-Objective Scatter Search for a Dynamic Cell Formation Problem, Computers
and Industrial Engineering, Doi: 10.1016/j. Cor.2007.10.026, To Appear In (2008);
Mungwatanna A., Design of Cellular Manufacturing Systems for Dynamic and Uncertain
Production Requirement with Presence of Routing Flexibility, Ph. D. Thesis,
Blacksburg State University Virginia, Virginia, U. S. A., (2000); Vin, E., Lit, P.,
Delchambre, A., A Multiple-Objective Grouping Genetic Algorithm for the Cell
Formation Problem with Alternative Routings (2005) Journal of Intelligent
Manufacturing, 16, pp. 189-205
CORRESPONDENCE ADDRESS: Tavakkoli-Moghaddam, R.; Department of Industrial
Engineering, College of Engineering, University of Tehran, P.O. Box 11155-4563,
Tehran, Iran; email: [email protected]
PUBLISHER: Materials and Energy Research Center
ISSN: 17281431
ABBREVIATED SOURCE TITLE: Int. J. Eng. Trans. A Basics
SOURCE: Scopus
Wu, T.-H., Chung, S.-H., Chang, C.-C.

7404814990;12239511500;57142825500;
Hybrid simulated annealing algorithm with mutation operator to the cell formation
problem with alternative process routings
(2009) Expert Systems with Applications, 36 (2 PART 2), pp. 3652-3661. Cited 50
times.
56349129124&doi=10.1016%2fj.eswa.2008.02.060&partnerID=40&md5=b669e8df69db548c59d09
0a2f62b70ca
DOI: 10.1016/j.eswa.2008.02.060
AFFILIATIONS: Department of Business Administration, National Taipei University,
151, University Road, San Shia, Taipei, 237, Taiwan;
Department of Industrial Engineering and Management, National Chiao Tung
University, 1001, Ta Hsueh Road, Hsinchu, 300, Taiwan
ABSTRACT: In this study, a hybrid simulated annealing algorithm with mutation
operator is proposed to solve the manufacturing cell formation problem considering
multiple process routings for parts, so that either the intercellular movements are
minimized or the grouping efficacy is maximized, depending on the definition of the
decision objective. The proposed algorithm is designed mainly to explore solution
regions efficiently and to expedite the solution search process. The performance of
the proposed algorithm is tested by a range of test problems, some of which are
from the literature and some of which are generated within this study. The
comparative study shows that the proposed algorithm improves the best results found
in the literature for 28.6% of the test problems and the percentages of improvement
are even higher than 18% in several test instances. © 2008 Elsevier Ltd. All rights
reserved.
AUTHOR KEYWORDS: Cell formation problem with alternative routings; Generalized GT;
Hybrid simulated annealing algorithm
INDEX KEYWORDS: Simulated annealing, Alternative process routings; Cell formation
problem; Cell formation problem with alternative routings; Comparative studies;
Generalized GT; Hybrid simulated annealing algorithm; Intercellular movement;
Manufacturing cell formation, Cellular manufacturing
REFERENCES: Adenso-Díaz, B., Lozano, S., Racero, J., Guerrero, F., Machine cell
formation in generalized group technology (2001) Computers and Industrial
routeings (1996) International Journal of Production Research, 34, pp. 1361-1380;
Chandrashekharan, M.P., Rajagopalan, R., An ideal seed non-hierarchical clustering
Research, 24, pp. 451-464;
Conçalves, J.F., Resende, M.G.C., An evolutionary algorithm for manufacturing cell
formation (2004) Computers and Industrial Engineering, 47, pp. 247-273;
process plans in flexible manufacturing systems (1991) Production Planning and
Control, 2, pp. 135-141;
Kumar, C.S., Chandrasekharan, M.P., Grouping efficacy: A quantitative criterion for
Kusaik, A., The generalized group technology concept (1987) International Journal
2633-2646;
Logendram, R., Ramakrishna, P., Sriskandarajah, C., Tabu search-based heuristics
Metropolis, N., Rosenbluth, A.W., Teller, A.H., Equation of state calculations by
fast computing machines (1953) Journal of Chemical Physics, pp. 1087-1092;
techniques (1992) Journal of Manufacturing Systems, 11, pp. 149-159;
Nagi, R., Harlarakis, G., Proth, J.M., Multiple routings and capacity
Sankaran, S., Kasilingam, K.G., An integrated approach to cell formation and part
routing in group technology (1990) Engineering Optimization, 16, pp. 235-245;
routings in generalized group technology: Reducing the complexity of the solution
space (2007) International Journal of Production Research, 45, pp. 1355-1367;
707-720;
Soke, A., Bingul, Z., Hybrid genetic algorithm and simulated annealing for two-
dimensional non-guillotine rectangular packing problems (2006) Engineering
Applications of Artificial Intelligence, 19, pp. 557-567;
Won, Y.K., Kim, S.H., An assignment method for the part-machine cell formation
problem in the presence of multiple process routes (1994) Engineering Optimization,
22, pp. 231-240;
Wong, S.Y.W., Hybrid simulated annealing/genetic algorithm approach to short-term
hydro-thermal scheduling with multiple thermal plants (2001) International Journal
of Electrical Power and Energy Systems, 23, pp. 565-575;
Wu, T.-H., Chen, J.-F., Yeh, J.-Y., A decomposition approach to the cell formation
Manufacturing Technology, 24, pp. 834-840
Taipei University, 151, University Road, San Shia, Taipei, 237, Taiwan; email:
[email protected]
ISSN: 09574174
CODEN: ESAPE
SOURCE: Scopus
Xambre, A.R.
6505827041;
Cell formation problem: A genetic algorithm based on an inter-operation flow matrix
(2015) Proceedings - CIE 45: 2015 International Conference on Computers and
Industrial Engineering, .
84963636134&partnerID=40&md5=726df43833b3d9d1c89d34f4b1e7054f
AFFILIATIONS: Department of Economics, Management and Industrial Engineering,

CIDMA, Center for Research and Development in Mathematics and Applications,
University of Aveiro, Campus de Santiago, Aveiro, 3810-193, Portugal
ABSTRACT: When designing a Cellular Manufacturing System an essential step is to
solve the cell formation problem: determining which machines and parts belong to
each cell. The main purpose is to obtain autonomous cells capable of completely
processing the respective family of parts and thus eliminate, or at least reduce,
intercellular flow. Additionally, if there is more than one machine of each type
(i.e. if a certain operation can be performed in different machines) the assignment
of operations to specific machines becomes part of the cell formation problem. In
this paper an algorithm for the cell formation problem with multiple identical
machines, which minimises the intercellular flow, is presented. The algorithm uses
the information provided by an inter-operation flow matrix so the real flow,
associated with each solution, can be adequately determined. Furthermore, due to
the combinatorial nature of this problem, the procedure is based on genetic
algorithms in order to improve the exploration of the solution space.
AUTHOR KEYWORDS: Cellular manufacturing systems; Genetic algorithms; Inter-
operation flow matrix
INDEX KEYWORDS: Algorithms; Cells; Cytology; Genetic algorithms; Manufacture;
Transfer cases (vehicles), Cell formation problem; Identical machines; One-machine;
Operation flow; Real flow; Solution space, Cellular manufacturing
REFERENCES: Stevenson, W.J., (2011) Operations Management, , 11th edition, McGraw-
Hill International Edition;
Singh, N., Rajamani, D., (2011) Cellular Manufacturing Systems Design, Planning and
Control, , 1st edition reprinted, Chapman & Hall;
Deif, A.M., Dynamic analysis of a lean cell under uncertainty (2012) International
Xambre, A.R., (2013) Planeamento de Sistemas de Produção Celulares, , PhD. Thesis,
University of Aveiro;
Shahin, A., Janatyan, N., Group technology (GT) and lean production: A conceptual
model for enhancing productivity (2010) International Business Research, 3 (4), pp.
105-118;
Burbidge, J.L., Change to group technology: Process organization is obsolete (1992)
Raminfar, R., Zulkifli, N., Vasili, M., Hong, T.S., An integrated model for the
design of cellular manufacturing systems (2012) Proceedings of the 2nd
International Conference on Chemical Engineering and Advanced Materials (CEAM
2012), , Guangzhou, China;
Arvindh, B., Irani, S.A., Cell formation: The need for an integrated solution of
the subproblems (1994) International Journal of Production Research, 32 (5), pp.
1197-1218;
Williams, G.B., Davis, L.E., Butchef, P.A., Cell based manufacturing and measures
of performance (1993) Advances in Production Management Systems, pp. 561-568;
Agrawal, A.K., Bhardwaj, P., Srivastava, V., On some measures for grouping
efficiency (2011) The International Journal of Advanced Manufacturing Technology,
56, pp. 789-798;
Elbenani, B., Ferland, J.A., An exact method for solving the manufacturing cell
formation problem (2012) International Journal of Production Research, 50 (15), pp.
4038-4045;
Won, Y., Logendran, R., Effective two-phase p-median approach for the balanced cell
formation in the design of cellular manufacturing system (2015) International
manufacturing cell formation (2009) Computers & Industrial Engineering, 57, pp.
1008-1014;
Xambre, A.R., Vilarinho, P.M., A simulated annealing approach for manufacturing
cell formation with multiple identical machines (2003) European Journal of
Operational Research, 151 (2), pp. 434-446;
machine-part cell formation problems (2010) Computers & Operations Research, 37,
pp. 2071-2081;
Saraç, T., Ozcelik, F., A genetic algorithm with proper parameters for
manufacturing cell formation problems (2012) Journal of Intelligent Manufacturing,
23, pp. 1047-1061;
Díaz, J.A., Luna, D., Luna, R., A GRASP heuristic for the manufacturing cell
formation problem (2012) Top, 20, pp. 679-706;
Nouri, H., Hong, T.S., A bacteria foraging algorithm based cell formation
considering operation time (2012) Journal of Manufacturing Systems, 31, pp. 326-
336;
Sayadi, M.K., Hafezalkotob, A., Naini, S.G.J., Firefly-inspired algorithm for
discrete optimization problems: An application to manufacturing cell formation
(2013) Journal of Manufacturing Systems, 32, pp. 78-84;
Paydar, M.M., Saidi-Mehrabad, M., A hybrid genetic-variable neighbourhood search
Computers & Operations Research, 40, pp. 980-990;
Shiyas, C.R., Madhusudanan Pillai, V., Cellular manufacturing system design using
grouping efficacy-based genetic algorithm (2014) International Journal of
Yang, M.-S., Yang, J.-H., Machine-part cell formation in group technology using a
modified ART1 method (2008) European Journal of Operational Research, 188, pp. 140-
152;
Askin, R.G., Contributions to the design and analysis of cellular manufacturing
systems (2013) International Journal of Production Research, 51 (23-24), pp. 6778-
6787;
Holland, J.H., (1975) Adaptation in Natural and Artificial Systems, , University of
Michigan Press;
23, pp. 1047-1061;
Xambre, A.R., Vilarinho, P.M., A genetic algorithm for the facility layout design
of cellular manufacturing systems (2001) Proceedings of the 2001 Joint Conference
of the 28th International Conference on Computers and Industrial Engineering and
the International Conference on Industry, Engineering and Management Systems
(ICC&IE/IEMS), pp. 273-278., Cocoa Beach, Florida, EUA;
Michalewicz, Z., (1996) Genetic Algorithms + Data Structures = Evolution
Programs, , 1st edition, Springer-Verlag;
Falkenaeur, E., (1999) Genetic Algorithms and Grouping Problems, , 1st edition,
John Wiley & Sons;
Hamamoto, S., Yih, Y., Salvendy, G., Development and validation of genetic
algorithm-based facility layout - A case study in the pharmaceutical industry
(1999) International Journal of Production Research, 37 (4), pp. 749-768
CORRESPONDENCE ADDRESS: Xambre, A.R.; Department of Economics, Management and
Industrial Engineering, CIDMA, Center for Research and Development in Mathematics
and Applications, University of Aveiro, Campus de SantiagoPortugal; email:
[email protected]
EDITORS: Kacem I.
PUBLISHER: Universite de Lorraine

ABBREVIATED SOURCE TITLE: Proc. - CIE: Int. Conf. Comput. Ind. Eng.
SOURCE: Scopus
Žilinskas, J., Goldengorin, B., Pardalos, P.M.

55966595000;6506538311;7005330875;
Pareto-optimal front of cell formation problem in group technology
(2015) Journal of Global Optimization, 61 (1), pp. 91-108. Cited 8 times.
84920257352&doi=10.1007%2fs10898-014-0154-
6&partnerID=40&md5=23c02ee26cd540a7d8dd887e5487da5d
DOI: 10.1007/s10898-014-0154-6
AFFILIATIONS: Vilnius University Institute of Mathematics and Informatics,
Akademijos 4, Vilnius, LT-08663, Lithuania;
Department of Industrial and Systems Engineering, Center for Applied Optimization,
University of Florida, 303 Weil Hall, P. O. Box 116595, Gainesville, FL 32611-
6595, United States;
Laboratory of Algorithms and Technologies for Networks Analysis, Higher School of
Economics, Rodionova 136, Nizhny Novgorod, 603093, Russian Federation
ABSTRACT: The earliest approaches to the cell formation problem in group
technology, dealing with a binary machine-part incidence matrix, were aimed only at
minimizing the number of intercell moves (exceptional elements in the block-
diagonalized matrix). Later on this goal was extended to simultaneous minimization
of the numbers of exceptions and voids, and minimization of intercell moves and
within-cell load variation, respectively. In this paper we design the first exact
branch-and-bound algorithm to create a Pareto-optimal front for the bi-criterion
cell formation problem. © 2014, Springer Science+Business Media New York.
AUTHOR KEYWORDS: Branch and bound; Cell formation problem; Multi-objective
optimization
INDEX KEYWORDS: Algorithms; Branch and bound method; Cells; Cytology; Group
technology; Information dissemination; Matrix algebra; Multiobjective optimization;
Pareto principle, Branch-and-bound algorithms; Cell formation problem; Cell load
variation; Exceptional elements; Incidence matrices; Inter-cell moves; Minimizing
the number of; Pareto-optimal front, Cellular manufacturing
REFERENCES: Arkat, J., Hosseini, L., Farahani, M.H., Minimization of exceptional
algorithm (2011) Expert Syst. Appl., 38 (8), pp. 9597-9602;
Bajestani, M.A., Rabbani, M., Rahimi-Vahed, A., Khoshkhou, G.B., A multi-objective
scatter search for a dynamic cell formation problem (2009) Comput. Oper. Res., 36
(3), pp. 777-794;
Batsyn, M., Bychkov, I., Goldengorin, B., Pardalos, P.M., Sukhov, P., Goldengorin,
B., Kalyagin, V.A., Pardalos, P.M., Pattern-based heuristic for the cell formation
problem in group technology (2013) Models, Algorithms, and Technologies for Network
Analysis, Springer Proceedings in Mathematics & Statistics, vol. 32, pp. 11-50.,
Springer, New York:;
Boulif, M., Atif, K., A new fuzzy genetic algorithm for the dynamic bi-objective
cell formation problem considering passive and active strategies (2008) Int. J.
Approx. Reason., 47 (2), pp. 141-165;
Chinchuluun, A., Pardalos, P.M., A survey of recent developments in multiobjective
optimization (2007) Ann. Oper. Res., 154, pp. 29-50;
Dimopoulos, C., A review of evolutionary multiobjective optimization applications
in the area of production research (2004) Congress on Evolutionary Computation
(CEC2004), vol. 2, pp. 1487-1494;
Dimopoulos, C., Explicit consideration of multiple objectives in cellular
manufacturing (2007) Eng. Optim., 39 (5), pp. 551-565;
Fontes, D.B.M.M., Gaspar-Cunha, A.: On multi-objective evolutionary algorithms. In:
C. Zopounidis, P.M. Pardalos (eds.) Handbook of Multicriteria Analysis, Applied
Optimization, vol. 103, pp. 287–310. Springer, Berlin (2010); Goldengorin, B.,
Krushinsky, D., Pardalos, P.M., (2013) Cell Formation in Industrial Engineering:
Theory, Algorithms and Experiments, , Springer, New York:;
Goldengorin, B., Krushinsky, D., Slomp, J., Flexible PMP approach for large-size
cell formation (2012) Oper. Res., 60 (5), pp. 1157-1166;
Goldengorin, B., Pardalos, P.M., (2012) Data Correcting Approaches in Combinatorial
Optimization, , Springer, New York:;
Lee, S.D., Chen, Y.L., A weighted approach for cellular manufacturing design:
minimizing intercell movement and balancing workload among duplicated machines
(1997) Int. J. Prod. Res., 35 (4), pp. 1125-1146;
Lei, D., Wu, Z., Tabu search for multiple-criteria manufacturing cell design (2006)
Int. J. Adv. Manuf. Technol., 28, pp. 950-956;
Malakooti, B., Yang, Z., Multiple criteria approach and generation of efficient
alternatives for machine-part family formationin group technology (2002) IIE
Trans., 34, pp. 837-846;
Mansouri, S.A., Husseini, S.M., Newman, S., A review of the modern approaches to
multi-criteria cell design (2000) Int. J. Prod. Res., 38 (5), pp. 1201-1218;
Neto, A.R.P., Filho, E.V.G., A simulation-based evolutionary multiobjective
approach to manufacturing cell formation (2010) Comput. Ind. Eng., 59 (1), pp. 64-
74;
research (2010) Eur. J. Oper. Res., 206 (3), pp. 509-521;
Paulavičius, R., Žilinskas, J., Grothey, A., Investigation of selection strategies
in branch and bound algorithm with simplicial partitions and combination of
Lipschitz bounds (2010) Optim. Lett., 4, pp. 173-183;
Saaty, T.L., The modern science of multicriteria decision making and its practical
applications: the AHP/ANP approach (2013) Oper. Res., 61 (5), pp. 1101-1118;
simulated annealing (1998) Int. J. Prod. Res., 36 (8), pp. 2185-2207;
Tavakkoli-Moghaddam, R., Ranjbar-Bourani, M., Amin, G., Siadat, A., A cell
formation problem considering machine utilization and alternative process routes by
scatter search (2012) J. Intell. Manuf., 23, pp. 1127-1139;
Venugopal, V., Narendran, T., A genetic algorithm approach to the machine-component
grouping problem with multiple objectives (1992) Comput. Ind. Eng., 22 (4), pp.
469-480;
Wemmerlov, U., Johnson, D.J., Empirical findings on manufacturing cell design
(2000) Int. J. Prod. Res., 38 (3), pp. 481-507;
Zopounidis, C., Pardalos, P.M., (eds.): Handbook of Multicriteria Analysis (2010)
Applied Optimization, 103., Springer, Berlin:;
Žilinskas, A., Žilinskas, J., Branch and bound algorithm for multidimensional
scaling with city-block metric (2009) J. Glob. Optim., 43, pp. 357-372;
Žilinskas, J., Reducing of search space of multidimensional scaling problems with
data exposing symmetries (2007) Inf. Technol. Control, 36 (4), pp. 377-382;
Žilinskas, J., Branch and bound with simplicial partitions for global optimization
(2008) Math. Model. Anal., 13 (1), pp. 145-159
CORRESPONDENCE ADDRESS: Žilinskas, J.; Vilnius University Institute of Mathematics
and Informatics, Akademijos 4, Lithuania
PUBLISHER: Kluwer Academic Publishers
ISSN: 09255001
CODEN: JGOPE
ABBREVIATED SOURCE TITLE: J of Global Optim
SOURCE: Scopus
Arkat, J., Abdollahzadeh, H., Ghahve, H.

55912953100;48761129300;54885362500;
A new branch and bound algorithm for cell formation problem
(2012) Applied Mathematical Modelling, 36 (10), pp. 5091-5100. Cited 18 times.
84861912804&doi=10.1016%2fj.apm.2011.12.047&partnerID=40&md5=9698e07f529cfd72f8eab6
fd3315a940
DOI: 10.1016/j.apm.2011.12.047
AFFILIATIONS: University of Kurdistan, Department of Industrial Engineering,
Sanandaj 16177-15175, Iran
ABSTRACT: Cell formation (CF) is the first and the most important problem in
designing cellular manufacturing systems. Due to its non-polynomial nature, various
heuristic and metaheuristic algorithms have been proposed to solve CF problem.
Despite the popularity of heuristic algorithms, few studies have attempted to
develop exact algorithms, such as branch and bound (B&B) algorithms, for this
problem. We develop three types of branch and bound algorithms to deal with the
cell formation problem. The first algorithm uses a binary branching scheme based on
the definitions provided for the decision variables. Unlike the first algorithm,
which relies on the mathematical model, the second one is designed based on the
structure of the cell formation problem. The last algorithm has a similar structure
to the second one, except that it has the ability to eliminate duplicated nodes in
branching trees. The proposed branch and bound algorithms and a hybrid genetic
algorithm are compared through some numerical examples. The results demonstrate the
effectiveness of the modified problem-oriented branch and bound algorithm in
solving relatively large size cell formation problems. © 2011 Elsevier Inc..
AUTHOR KEYWORDS: Branch and bound algorithm; Cell formation problem; Problem-
oriented branching scheme
INDEX KEYWORDS: Branch and bounds; Branch-and-bound algorithms; Branching tree;
Cell formation; Cell formation problem; Decision variables; Exact algorithms;
Hybrid genetic algorithms; Large sizes; Meta heuristic algorithm; Numerical
example; Problem-oriented branching scheme, Branch and bound method; Cellular
manufacturing; Heuristic algorithms; Linear programming; Mathematical models; Trees
(mathematics), Problem solving
REFERENCES: Greene, T.J., Sadowski, R.P., A review of cellular manufacturing
assumptions, advantages and design techniques (1984) J. Oper. Manag., 4, pp. 85-97;
Ballakur, A., Steudel, H.J., A within-in cell utilization based heuristic for
designing cellular manufacturing systems (1987) Int. J. Prod. Res., 25, pp. 639-
655;
Singh, N., Design of cellular manufacturing systems: an invited review (1993) Eur.
J. Oper. Res., 69, pp. 281-511;
Kamrani, A.K., Parsaei, H.R., Chaudhry, M.A., A survey of design methods for
manufacturing cells (1993) Comput. Ind. Eng., 25, pp. 487-490;
review evaluation and directions for future research (1998) Comput. Ind. Eng., 34,
pp. 3-20;
problem: a taxonomy and review (2006) Int. J. Prod. Econ., 101, pp. 329-352;
methodologies based on recent studies (1997-2008): review and directions for future
research (2010) Eur. J. Oper. Res., 206, pp. 509-521;
Kusiak, A., Chow, W.S., Efficient solving of the group technology problem (1987) J.
Manuf. Syst., 6, pp. 117-124;
Spiliopoulos, K., Sofianopoulou, S., An optimal tree search method for the
manufacturing systems cell formation problem (1998) Eur. J. Oper. Res., 105, pp.
537-551;
Boulif, M., Atif, K., A new branch-and-bound-enhanced genetic algorithm for the
manufacturing cell formation problem (2006) Comput. Oper. Res., 33, pp. 2219-2245;
Rajagopalan, R., Batra, J.L., Design of cellular production system: a graph-
theoretic approach (1975) Int. J. Prod. Res., 13, pp. 567-579;
Kusiak, A., Boe, W.J., Cheng, C., Designing cellular manufacturing systems: branch-
and-bound and A * approaches (1993) IIE Trans., 25, pp. 46-56;
Chun Hung, G., Chon-Hung, G., Anita, L., Solving the Generalized Machine Assignment
Problem in Group Technology (1996) J. OPER. RES. SOC., 47, pp. 794-802;
Finke, G., Burkard, R.E., Rendl, F., Quadratic assignment problems (1987) Ann.
Disc. Math., 31, pp. 61-82;
Rendl, F., Wolkowicz, H., A projection technique for partitioning the nodes of a
graph (1995) Ann. Oper. Res., 58, pp. 155-179;
Al-Qattan, I., Designing flexible manufacturing cells using a branch and bound
method (1990) Int. J. Prod. Res., 28, pp. 325-336;
Taha, H.A., (1975) Integer programming: theory, applications, and computations, ,
Academic Press;
Shim, S., Generating sub-problems in branch and bound algorithms for parallel
machines scheduling problem (2009) Comput. Ind. Eng., 57, pp. 1150-1153;
Hillier, F., Lieberman, G., (2004) Introduction to Operations Research, , McGraw-
Hill, New York, London, Milan;
Anderson, I., (2001) A First Course in Discrete Mathematics, , Springer, London;
Christofides, N., Alvarez-Valdés, R., Tamarit, J.M., Project scheduling with
resource constraints: a branch and bound approach (1987) Eur. J. Oper. Res., 29,
pp. 262-273;
Jayakrishnan Nair, G., Narendran, T.T., CASE: a clustering algorithm for cell
formation with sequence data (1998) Int. J. Prod. Res., 36, pp. 157-179;
Vakharia, A.J., Wemmerlov, U., Designing a cellular manufacturing system: a
material flow approach based on operation sequences (1990) IIE Trans., 22, pp. 84-
97;
simulated annealing (1998) Int. J. Prod. Res., 36, pp. 2185-2207;
Nagi, R., Harhalakis, G., Proth, J.M., Multiple routing and capacity considerations
in group technology applications (1990) Int. J. Prod. Res., 28, pp. 2243-2257
CORRESPONDENCE ADDRESS: Arkat, J.; University of Kurdistan, Department of
Industrial Engineering, Sanandaj 16177-15175, Iran; email: [email protected]
ISSN: 0307904X
CODEN: AMMOD
ABBREVIATED SOURCE TITLE: Appl. Math. Model.
ACCESS TYPE: Open Access
SOURCE: Scopus
Solimanpur, M., Saeedi, S., Mahdavi, I.
35615315700;35747107600;16417373200;
Solving cell formation problem in cellular manufacturing using ant-colony-based
optimization
1135-1144. Cited 30 times.
77957869001&doi=10.1007%2fs00170-010-2587-
5&partnerID=40&md5=9582635c7a0c6612228100399c831ec8
DOI: 10.1007/s00170-010-2587-5
AFFILIATIONS: Faculty of Engineering, Urmia University, Urmia, West Azerbaijan
Province, Iran;
Industrial Engineering Department, Mazandaran University of Science and Technology,
Babol, Iran
ABSTRACT: Grouping the machines and parts in a cellular manufacturing system based
on similarities is known as the cell formation problem. It has been shown that cell
formation problem is a NP-hard problem. In this paper, the ant colony optimization
(ACO) method is used as an evolutionary approach to solve the cell formation
problem. This model uses a P = [P ij ] (C)∈×∈(M + P) pheromone matrix in which C,
M, and P are the number of cells, machines, and parts, respectively. In order to
represent the sequence of operations, the machine-part incidence matrix entries are
considered as positive integers. Performance of the proposed algorithm is tested on
some benchmark problems existing in the literature to show the applicability and
effectiveness of the proposed model. Comparison of the solutions obtained by the
proposed algorithm with those reported in the literature indicates that application
of the proposed algorithm has resulted in 5.73% improvement in the total number of
intercellular movements and voids on average. © 2010 Springer-Verlag London
Limited.
AUTHOR KEYWORDS: Ant colony optimization; Cell formation problem; Cellular
manufacturing
INDEX KEYWORDS: Ant colony optimization methods; Ant-colony optimization; Bench-
mark problems; Cell formation problem; Cellular manufacturing systems; Evolutionary
approach; Incidence matrices; Intercellular movement; matrix; NP-HARD problem;
Positive integers, Algorithms; Artificial intelligence; Computational complexity;
Optimization, Cellular manufacturing
REFERENCES: Zhao, C., Wu, Z., A genetic algorithm for manufacturing cell formation
with multiple routes and multiple objectives (2000) International Journal of
Production Research, 38 (2), pp. 385-395., DOI 10.1080/002075400189473;
Gallagher, C.C., Knight, W.A., (1986) Group Technology Production Methods in
Manufacturing, , Knight/Ellis Horwood Limited Chichester;
Morris, J.S., Tersine, R.J., A simulation analysis of factors influencing the
attractiveness of group technology and cellular layouts (1990) Manag Sci, 36, pp.
1567-1578., 10.1287/mnsc.36.12.1567;
Burbidge, J.L., (1979) Group-technology in Engineering Industry, , Mechanical
Engineering Publication Ltd. UK;
designing cellular manufacturing systems (1987) Int J Prod Res, 25, pp. 639-655.,
10.1080/00207548708919868;
Joines, J.A., King, R.E., Culbreth, C.T., A comprehensive review of production-
oriented manufacturing cell formation technique (1996) Int J Flex Autom Integr
Manuf, 3 (34), pp. 225-265;
Journal of Production Research, 43 (5), pp. 913-932., DOI
10.1080/0020754047000298566;
Prabhaharan, G., Asokan, P., Girish, B.S., Muruganandam, A., Machine cell formation
for cellular manufacturing systems using an ant colony system approach (2005)
International Journal of Advanced Manufacturing Technology, 25 (9-10), pp. 1013-
1019., DOI 10.1007/s00170-003-1927-0;
Mak, K.L., Peng, P., Wang, X.X., Lau, T.L., An ant colony optimization algorithm
for scheduling virtual cellular manufacturing systems (2007) International Journal
of Computer Integrated Manufacturing, 20 (6), pp. 524-537., DOI
10.1080/09511920600596821, PII 780858702;
Spiliopoulos, K., Sofianopoulou, S., An efficient ant colony optimization system
for the manufacturing cells formation problem (2008) International Journal of
Advanced Manufacturing Technology, 36 (5-6), pp. 589-597., DOI 10.1007/s00170-006-
0862-2;
Kesen, S.E., Toksari, M.D., Gungor, Z., Guner, E., Analyzing the behaviors of
virtual cells (VCs) and traditional manufacturing systems: Ant colony optimization
(ACO)-based metamodels (2009) Comput Oper Res, 36, pp. 2275-2285., 1158.90331
10.1016/j.cor.2008.09.002;
Satoglu, S.I., Surech, N.C., A goal programming approach for design of hybrid
cellular manufacturing system in dual resource constrained environments (2009)
Comput Ind Eng, 56, pp. 560-575., 10.1016/j.cie.2008.06.009;
Kao, Y., Fu, S.C., An ant-based clustering algorithm for manufacturing cell design
(2006) Int J Adv Manuf Technol, 28, pp. 1182-1189., 10.1007/s00170-004-2475-y;
using neural networks Comput Ind Eng, , doi: 10.1016/j.cie.2008.08.003;
Mahdavi, I., Paydar, M.M., Solimanpur, M., Heidarzadeh, A., Genetic algorithm
Expert Systems Appl, 36, pp. 6598-6604., 10.1016/j.eswa.2008.07.054;
cell formation and layout design in cellular manufacturing system (2008) Int J Adv
Manuf Technol, 39, pp. 943-953., 10.1007/s00170-007-1274-7;
Arkat, J., Saidi, M., Abbasi, B., Applying simulated annealing to cellular
manufacturing system design (2007) International Journal of Advanced Manufacturing
Technology, 32 (5-6), pp. 531-536., DOI 10.1007/s00170-005-0358-5;
Ahi, A., Aryanezhad Mir, B., Ashtiani, B., Makui, A., A novel approach to determine
cell formation, intercellular machine layout and cell layout in the CMS problem
based on TOPSIS method (2009) Comput Oper Res, 36, pp. 1478-1496., 1179.90101
10.1016/j.cor.2008.02.012;
Wang, X., Tang, J., Yung, K., Optimization of the multi objective dynamic cell
formation problem using a scatter search approach Int J Adv Manuf Technol, , doi:
10.1007/s00170-008-1835-4;
Muruganandam, A., Prabhaharan, G., Asokan, P., Baskaran, V., A memetic algorithm
approach to the cell formation problem (2005) International Journal of Advanced
Manufacturing Technology, 25 (9-10), pp. 988-997., DOI 10.1007/s00170-003-1912-7;
Dorigo, M., Caro Gi, D., (1999) The Ant Colony Optimization Meta-heuristic, ,
McGraw-Hill New York;
Mahdavi, I., Mahadevan, B., CLASS: An algorithm for cellular manufacturing system
and layout design using sequence data (2008) Robotics and Computer-Integrated
Manufacturing, 24 (3), pp. 488-497., DOI 10.1016/j.rcim.2007.07.011, PII
S0736584507000737;
Boe, W.J., Cheng, C.H., A close neighborhood algorithm for designing cellular
manufacturing systems (1991) Int J Prod Res, 20 (10), pp. 2097-2116.,
10.1080/00207549108948069;
Stanfel, L.E., Machine clustering for economic production (1985) Engineering Costs
and Production Economy, 9, pp. 993-1009;
Srinivasan, G., A clustering algorithm for machine cell formation problem in group
technology using minimum spanning trees (1994) Int J Prod Res, 32, pp. 2149-2158.,
0897.90116 10.1080/00207549408957064;
Wu, X., Chu, C.-H., Wang, Y., Yue, D., Genetic algorithms for integrating cell
formation with machine layout and scheduling (2007) Computers and Industrial
Engineering, 53 (2), pp. 277-289., DOI 10.1016/j.cie.2007.06.021, PII
S0360835207001118, Selected Papers from The 27th. International Conference on
Computers and Industrial Engineering - Part 2;
Tsai, C.C., Lee, C., Optimization of manufacturing cell formation with a multi-
function mathematical programming model (2008) Int J Adv Manuf Technol, 30, pp.
309-318., 10.1007/s00170-005-0056-3;
Ying, K., Liao, C., An ant colony system approach for scheduling problems (2003)
Prod Plan Control, 14, pp. 68-75., 10.1080/0953728031000089988;
Guo, Z.X., Wong, W.K., Leung, S.Y.S., Fan, J.T., Chan, S.F., Mathematical model and
genetic optimization for the job shop scheduling problem in a mixed- and multi-
product assembly environment: A case study based on the apparel industry (2006)
Computers and Industrial Engineering, 50 (3), pp. 202-219., DOI
10.1016/j.cie.2006.03.003, PII S0360835206000271;
Guo, Z.X., Wong, W.K., Leung, S.Y.S., Fan, J.T., Chan, S.F., Genetic optimization
of order scheduling with multiple uncertainties (2008) Expert Systems Appl, 35 (4),
pp. 1788-1801., 10.1016/j.eswa.2007.08.058;
Becker, C., Scholl, A., A survey on problems and methods in generalized assembly
line balancing (2006) European Journal of Operational Research, 168 (3), pp. 694-
715., DOI 10.1016/j.ejor.2004.07.023, PII S0377221704004801, Balancing Assembly and
Transfer Lines;
Gamberini, R., Grassi, A., Rimini, B., A new multi-objective heuristic algorithm
for solving the stochastic assembly line re-balancing problem (2006) Int J Prod
Econ, 102 (2), pp. 226-243., 10.1016/j.ijpe.2005.02.013;
Guo, Z.X., Wong, W.K., Leung, S.Y.S., Fan, J.T., Chan, S.F., A genetic-algorithm-
based optimization model for solving the flexible assembly line balancing problem
with work sharing and workstation revisiting (2008) IEEE Transactions on Systems,
Man and Cybernetics Part C: Applications and Reviews, 38 (2), pp. 218-228., DOI
10.1109/TSMCC.2007.913912
CORRESPONDENCE ADDRESS: Solimanpur, M.; Faculty of Engineering, Urmia University,
Urmia, West Azerbaijan Province, Iran; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Venkatadri, U., Elaskari, S.M., Kurdi, R.

6507622371;57192079712;57192079003;
A multi-commodity network flow-based formulation for the multi-period cell
formation problem
84996644321&doi=10.1007%2fs00170-016-9673-
2&partnerID=40&md5=76208bde590cb4cb25ac597e9380485d
DOI: 10.1007/s00170-016-9673-2
AFFILIATIONS: Department of Industrial Engineering, Dalhousie University, P.O. Box
15000, 5269 Morris Street, Halifax, NS B3H 4R2, Canada;
ARAMCO, Dhahran, Saudi Arabia
ABSTRACT: In this paper, we present a new multi-commodity network flow-based
formulation for the multi-period cell formation problem. The objective of the model
is to minimize the total costs of acquisition, disposal, and relocation of
machines, manufacturing, and inter-cell/intra-cell material handling. The main
contribution of this paper comes from the fact that we structure the underlying
problem as a multi-period multi-commodity network flow problem with general integer
variables for machine acquisition, disposal, and relocation connecting one period
to the next. This formulation is more efficient than the formulations we have
encountered in the literature. Another contribution of this paper is that the flow
variables representing the flow of parts through the system is path based; as a
result, this approach makes it very easy to model alternate process routings. This
paper illustrates the formulation by the use of two examples taken from the
literature and presents computational results for other representative problems. ©
2016, Springer-Verlag London.
AUTHOR KEYWORDS: Alternate process routings; Cell formation; Cellular
manufacturing; Design of production systems; Group technology; Mixed integer
linear programming; Multi-commodity network flow; Multi-period cell formation
problem
INDEX KEYWORDS: Cells; Cytology; Group technology; Integer programming;
Manufacture; Materials handling, Cell formation; Cell formation problem; Design of
production systems; Mixed integer linear programming; Multi-commodity network
flows; Routings, Cellular manufacturing
REFERENCES: Altuntas, S., Dereli, T., Selim, H., Fuzzy weighted association rule
based solution approaches to facility layout problem in cellular manufacturing
system (2013) Int J Ind Syst Eng, 15 (3), pp. 253-271;
Aryanezhad, M.B., Deljoo, V., Al-E-Hashem, S.M.J.M., Dynamic cell formation and the
worker assignment problem: a new model (2009) Int J Adv Manuf Technol, 41 (3), pp.
329-342;
Askin, R.G., Contributions to the design and analysis of cellular manufacturing
systems (2013) Int J Prod Res, 51 (23-24), pp. 6778-6787;
Askin, R.G., Standridge, C.R., (1993) Modeling and analysis of manufacturing
systems, vol 29, , Wiley, New York;
Askin, R.G., Selim, H.M., Vakharia, A.J., A methodology for designing flexible
cellular manufacturing systems (1997) IIE Trans, 29 (7), pp. 599-610;
planning horizons (2005) J Manuf Technol Manag, 16 (5-6), pp. 516-530;
Balakrishnan, J., Cheng, C.H., Multi-period planning and uncertainty issues in
cellular manufacturing: A review and future directions (2007) Eur J Oper Res, 177
(1), pp. 281-309;
Boctor, F., Linear formulation of the machine-part cell formation problem (1991)
Int J Prod Res, 29 (2), pp. 343-356;
Deep, K., Singh, P.K., Design of robust cellular manufacturing system for dynamic
part population considering multiple processing routes using genetic algorithm
(2015) J Manuf Syst, 35, pp. 155-163;
Defersha, F.M., Chen, M., A comprehensive mathematical model for the design of
cellular manufacturing systems (2006) Int J Prod Econ, 103 (2), pp. 767-783;
Deljoo, V., Al-E-Hashem, S.M.J.M., Deljoo, F., Aryanezhad, M.B., Using genetic
algorithm to solve dynamic cell formation problem (2010) Appl Math Model, 34 (4),
pp. 1078-1092;
formation problem (2012) Int J Prod Res, 50 (15), pp. 4038-4045;
Filho, E.V.G., Tiberti, A.J., A group genetic algorithm for the machine cell
formation problem (2006) Int J Prod Econ, 102 (1), pp. 1-21;
Ghotboddini, M.M., Rabbani, M., Rahimian, H., A comprehensive dynamic cell
formation design: Bender’s decomposition approach (2011) Expert Syst Appl, 38 (3),
pp. 2478-2488;
Heragu, S.S., Gupta, Y.P., A heuristic for designing cellular manufacturing
facilities (1994) Int J Prod Res, 32 (1), pp. 125-140;
alternative processing routes by grouping genetic algorithm (2006) Int J Prod Res,
44 (11), pp. 2133-2167;
Jayakumar, V., Raju, R., An adaptive cellular manufacturing system design with
routing flexibility and dynamic system reconfiguration (2010) Eur J Sci Res, 47
(4), pp. 595-611;
Kochikar, V.P., Narendran, T.T., Logical cell formation in fms, using flexibility-
based criteria (1998) Int J Flex Manuf Syst, 10 (2), pp. 163-181;
Liu, C.G., Yin, Y., Yasuda, K., Lian, J., A heuristic algorithm for cell formation
problems with consideration of multiple production factors (2010) Int J Adv Manuf
Technol, 46 (9-12), pp. 1201-1213;
Moghaddam, R.T., Aryanezhad, M.B., Safaei, N., Azaron, A., Solving a dynamic cell
formation problem using metaheuristics (2005) Appl Math Comput, 170 (2), pp. 761-
780;
research (2010) Eur J Oper Res, 206, pp. 509-521;
Patil, D., Irani, S., (2013) Design of a flexible and lean machining cell (part 1.)
Gear Technology, , 20–26;
Ribeiro, J.F.F., Manufacturing cells formation based on graph theory (2009)
Computers & Industrial Engineering, 2009. CIE, 2009, pp. 658-662;
Romesburg, H.C., (1984) Cluster analysis for researchers, , Lifetime Learning
Publications, Belmont;
Seifoddini, H., Application of the similarity coefficient method in group
technology (1986) IIE Trans, 18 (3), pp. 271-277;
(1), pp. 3-20;
Tomlin, J.A., Minimum-cost multicommodity network flows (1966) Oper Res, 14 (1),
pp. 45-51;
cell formation problem (2009) Int J Prod Res, 47 (7), pp. 1989-2007;
systems using a linear assignment algorithm (2003) Automatica, 39 (9), pp. 1607-
1615;
part populations (1999) IIE Trans, 31 (1), pp. 11-20;
problem: A comparative investigation (2005) Comput Ind Eng, 48 (3), pp. 471-489;
problem: A taxonomy and review (2006) Int J Prod Econ, 101 (2), pp. 329-352
CORRESPONDENCE ADDRESS: Venkatadri, U.; Department of Industrial Engineering,
Dalhousie University, P.O. Box 15000, 5269 Morris Street, Canada; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Tavakkoli-Moghaddam, R., Minaeian, S., Rabbani, M.

56491438400;56038495300;57208701862;
A new multi-objective model for dynamic cell formation problem with fuzzy
parameters
67649986474&partnerID=40&md5=181ce9740916abe45ef22d175ce0cf69
AFFILIATIONS: Center of Excellence for Intelligence-Based Experimental Mechanics,

Department of Industrial Engineering, College of Engineering, P.O. Box 11365/4563,
Tehran, Iran
ABSTRACT: This paper proposes a comprehensive, multi-objective, mixed-integer,
nonlinear programming (MINLP) model for a cell formation problem (CFP) under fuzzy
and dynamic conditions aiming at: (1) minimizing the total cost which consists of
the costs of intercellular movements and subcontracting parts as well as the cost
of purchasing, operation, maintenance and reconfiguration of machines, (2)
maximizing the preference level of the decision making (DM) and (3) balancing
intracellular workload. Dynamic CFP divides the planning horizon to smaller periods
and considers different product combinations and demands in each period, which may
result in cell reconfiguration necessity. Moreover, it is more realistic to take
into account the inexact and uncertain (fuzzy) nature of parameters, such as
product demand or machine capacity. The main goals of the proposed model is to
select a process plan with the minimum cost and also to identify the most
appropriate production volume with respect to fuzzy demands and capacities in order
to minimize the deviation from the desired production and balanced machine
workload.
AUTHOR KEYWORDS: Dynamic cms; Fuzzy theory; Multi-objective cell formation
problem
INDEX KEYWORDS: Cellular manufacturing; Integer programming; Multiobjective
optimization; Uncertainty analysis, Cell formation problem; Dynamic cell formation;
Dynamic condition; Fuzzy demand; Fuzzy parameter; Fuzzy theory; In-cell;
Intercellular movement; Minimum cost; Multi objective; Multi-objective cell
formation problem; Multiobjective models; Planning horizons; Preference level;
Process plan; Product combinations; Product demand; Production volumes; Total
costs, Costs
REFERENCES: Rheault, M., Jocelyn, D., Geoges, A., Physically Reconfigurable Virtual
Cells: A Dynamic Model for a Highly Dynamic Environment (1995) Computers and
Song, S., Hitomi, K., Integrating the Production Planning and Cellular Layout for
Flexible Cellular Manufacturing (1996) Production Planning and Control, 7 (6), pp.
585-593;
Vakharia, A.J., Kaku, B.K., Redesigning a Cellular Manufacturing System to Handle
Long-Term Demand Changes: A Methodology and Investigation (1993) Decision Sciences,
24 (5), pp. 909-929;
Harhalaks, G., Nagi, R., Proth, J., An Efficient Heuristic in Manufacturing Cell
Formation to Group Technology Applications (1990) Int. Journal of Production
Research, 28 (1), pp. 185-198;
Wilhelm, W., Chiou, C., Chang, D., Integrating Design and Planning Considerations
in Cellular Manufacturing (1998) Annals of Operation Research, 77 (1), pp. 97-107;
Askin, R.G., Selim, H.M., Vakharia, A.J., A Methodology for Designing Flexible
Cellular Manufacturing Systems (1997) IIE Transactions, 29, pp. 599-610;
Chen, M., A Mathematical Programming Model for Systems Reconfiguration in a Dynamic
Cell Formation Condition (1998) Annals of Operations Research, 77 (1), pp. 109-128;
Balakrishnan, J., Cheng, C.H., Dynamic Cellular Manufacturing under Multi-Period

Planning Horizons (2005) Journal of Manufacturing Technology Management, 16 (5),
pp. 516-530;
Dynamic Cell Formation Problem using Metaheuristics (2005) Applied Mathematics and
Defersha, F.M., Chen, M., A Comprehensive Mathematical Model for the Design of
Cellular Manufacturing System (2006) International Journal of Production Economics,
103, pp. 767-783;
Shankar, R., Vrat, P., Some Design Issues in Cellular Manufacturing using the Fuzzy
Programming Approach (1999) International Journal of Production Research, 37 (11),
pp. 2545-2563;
Seifoddini, H., A Probabilistic Model for Machine Cell Formation (1990) Journal of
Manufacturing Systems, 9 (1), pp. 69-75;
Tavakkoli-Moghaddam, R., Safaei, N., Babakhani, M., Solving a Dynamic Cell
Formation Problem with Machine Cost and Alternative Process Plan by Memetic
Algorithms (2005) Lecture Notes in Computer Science, 3777, pp. 213-227;
Tavakkoli-Moghaddam, R., Aryanezhad, M.B., Safaei, N., Vasei, M., Azaron, A., A New
Approach for the Cellular Manufacturing Problem in Fuzzy Dynamic Conditions by a
Genetic Algorithm (2007) Journal of Intelligent and Fuzzy Systems, 18 (4), pp. 363-
376;
Safaei, N., Saidi-Mehrabad, M., Tavakkoli- Moghaddam, R., Sassani, F., A Fuzzy
Programming Approach to a Cell Formation Problem with Dynamic and Uncertain
Conditions (2008) Fuzzy Sets and Systems, 159 (2), pp. 215-236;
Torabi, S.A., Hassini, E., An Interactive Possibilistic Programming Approach for
Multiple Objective Supply Chain Master Planning (2008) Fuzzy Sets and Systems, 159
(2), pp. 193-214;
Arikan, F., Gungor, Z., A Parametric Model for Cell Formation and Exceptional
Elements' Problems with Fuzzy Parameters (2005) Journal of Intelligent
Tavakkoli-Moghaddam, R., Safaei, N., A Generalized Dynamic Cell Formation Problem
with Fuzzy Demand and Unreliable Facilities (2006) Proceeding of the 3rd
International Conference on Group Technology/Cellular Manufacturing, pp. 349-356.,
Groningen, Netherlands;
Tanaka, H., Okuda, T., Asai, K., On Fuzzy Mathematical Programming (1974) Journal
of Cybernetics, 3, pp. 37-46;
Lai, Y.J., Hwang, C.L., Fuzzy Mathematical Programming: Methods and Applications
(1992) Lecture Notes in Economics and Mathematical Systems, , Springer-Verlag,
Berlin Heidelberg;
Logendran, R., Effect of the Identification of Key Machines in the Cell Formation
Problem of Cellular Manufacturing Systems (1990) Computers and Industrial
Engineering, 20 (4), pp. 439-449;
Agarwal, D., Sahu, S., Ray, P.K., Cell Formation in Cellular Manufacturing: A
Multi-Objective Genetic Algorithm Approach (2006) Group Technology /Cellular
Manufacturing Conference, pp. 401-410., Groningen, Netherlands;
Verdegay, J.L., Fuzzy Mathematical Programming (1982) Fuzzy Information and
Decision Processes, pp. 231-237., M. M. Gupta and E. Sanchez Eds, Publishing
Company, Amsterdam, North-Holland;
Venugopal, V., Narendran, T.T., A Genetic Algorithm Approach to the Machine
Engineering, 22 (4), pp. 469-480;
Mansouri, S.A., Hussaini, S.M.M., Newman, S.T., A Review of the Modern Approaches
to Multi-Criteria Cell Design (2000) International Journal of Production Research,
38 (5), pp. 1201-1218;
Vin, E., Lit, P., Delchambre, A., A Multiple- Objective Grouping Genetic Algorithm
for the Cell Formation Problem with Alternative Routings (2005) J. of Intelligent
Manufacturing, 16, pp. 189-205
CORRESPONDENCE ADDRESS: Tavakkoli-Moghaddam, R.; Center of Excellence for
Intelligence-Based Experimental Mechanics, Department of Industrial Engineering,
College of Engineering, P.O. Box 11365/4563, Tehran, Iran; email: [email protected]
ISSN: 17281431
SOURCE: Scopus
Vafaeinezhad, M., Kia, R., Shahnazari-Shahrezaei, P.

57192663612;24461690200;54793653900;
Robust optimization of a mathematical model to design a dynamic cell formation
problem considering labor utilization
(2016) Journal of Industrial Engineering International, 12 (1), pp. 45-60. Cited 3
times.
85007196105&doi=10.1007%2fs40092-015-0127-
5&partnerID=40&md5=f5a80bcca92f27732d1781b606fc81a7
DOI: 10.1007/s40092-015-0127-5
AFFILIATIONS: Department of Industrial Engineering, Firoozkooh Branch, Islamic Azad
University, Firoozkooh, Iran
ABSTRACT: Cell formation (CF) problem is one of the most important decision
problems in designing a cellular manufacturing system includes grouping machines
into machine cells and parts into part families. Several factors should be
considered in a cell formation problem. In this work, robust optimization of a
mathematical model of a dynamic cell formation problem integrating CF, production
planning and worker assignment is implemented with uncertain scenario-based data.
The robust approach is used to reduce the effects of fluctuations of the uncertain
parameters with regards to all possible future scenarios. In this research,
miscellaneous cost parameters of the cell formation and demand fluctuations are
subject to uncertainty and a mixed-integer nonlinear programming model is developed
to formulate the related robust dynamic cell formation problem. The objective
function seeks to minimize total costs including machine constant, machine
procurement, machine relocation, machine operation, intercell and intra-cell
movement, overtime, shifting labors between cells and inventory holding. Finally, a
case study is carried out to display the robustness and effectiveness of the
proposed model. The tradeoff between solution robustness and model robustness is
also analyzed in the obtained results. © The Author(s) 2015.
AUTHOR KEYWORDS: Dynamic cell formation problem; Mixed-integer nonlinear model;
Scenariobased robust optimization; Worker assignment
REFERENCES: Aryanezhad, M.B., Deljoo, V., Mirzapour Al-e-hashem, S.M.J., Dynamic
cell formation and the worker assignment problem: a new model (2009) Int J Adv
Manuf Technol, 41, pp. 329-342;
Bagheri, M., Bashiri, M., A new mathematical model towards the integration of cell
formation with operator assignment and intercell layout problems in a dynamic
environment (2014) Appl Math Model, 38 (4), pp. 1237-1254;
Bai, D., Carpenter, T., Mulvey, J., Making a case for robust optimization models
(1997) Manag Sci, 43, pp. 895-907;
Balakrishnan, J., Cheng, C.H., Dynamic cellular manufacturing under multi period
planning horizons (2005) J Manuf Technol Manag, 16 (5), pp. 516-530;
Bashiri, M., Bagheri, M., A two stage heuristic solution approach for resource
assignment during a cell formation problem (2013) Int J Eng Trans C Asp, 26 (9), p.
943;
Ben-Tal, A., Nemirovski, A., A Robust convex optimization (1998) Math Oper Res, 23,
pp. 769-805;
Ben-Tal, A., Nemirovski, A., A robust optimization-methodology and applications
(2002) Math Program, 92, pp. 453-480;
Ben-Tal, A., Nemirovski, A., Roos, C., Robust solutions of uncertain quadratic and
conic-quadratic problems (2002) SIAM J Optim, 13, pp. 535-560;
Bertsimas, D., Sim, M., (2002) Robust discrete optimization Technical Report, ,
Sloan School of Management and Operations Research Center, MIT Cambridge;
Bertsimas, D., Thiele, A., (2003) A robust optimization approach to supply chain
management, , Technical Report Working Paper MIT;
Feng, P., Rakesh, N., Robust supply chain design under uncertain demand in agile
manufacturing (2010) Comput Oper Res, 37 (4), pp. 668-683;
Forghani, K., Sobhanallahi, M., Mirzazadeh, A., Mohammadi, M., A mathematical model
in cellular manufacturing system considering subcontracting approach under
constraints (2012) Manag Sci Lett, 2 (7), pp. 2393-2408;
Ghezavati, V., Sadjadi, S., Dehghan Nayeri, M., Integrating strategic and tactical
decisions to robust designing of cellular manufacturing under uncertainty: fixed
suppliers in supply chain (2011) Int J Comput Intell Syst, 4 (5), pp. 837-854;
Hassannezhad, M., Cantamessa, M., Montagna, F., Mehmood, F., Sensitivity analysis
of dynamic cell formation problem through meta-heuristic (2014) Procedia Technol,
12, pp. 186-195;
Kia, R., Paydar, M.M., Jondabeh, M.A., Javadian, N., Nejatbakhsh, Y., A fuzzy
linear programming approach to layout design of dynamic cellular manufacturing
systems with route selection and cell reconfiguration (2011) Int J Manag Sci Eng
Manag, 6 (3), pp. 219-230;
Kia, R., Baboli, A., Javadian, N., Tavakkoli-Moghaddam, R., Kazemi, M., Khorrami,
J., Solving a group layout design model of a dynamic cellular manufacturing system
with alternative process routings, lot splitting and flexible reconfiguration by
simulated annealing (2012) Comput Oper Res, 39, pp. 2642-2658;
Kia, R., Shirazi, H., Javadian, N., Tavakkoli-Moghaddam, R., A multi-objective
model for designing a group layout of a dynamic cellular manufacturing system
(2013) J Ind Eng Int, 9, p. 8;
Mahdavi, I., Aalaei, A., Paydar, M.M., Solimanpur, M., Designing a mathematical
model for dynamic cellular manufacturing systems considering production planning
and worker assignment (2010) Comput Math Appl, 60 (4), pp. 1014-1025;
Mirzapour Al-E-Hashem, S.M.J., Malekly, H., Aryanezhad, M.B., A multi-objective
planning in a supply chain under uncertainty (2011) Int J Prod Econ, 134 (1), pp.
28-42;
Mulvey, J.M., Vanderbei, R.J., Zenios, S.A., Robust optimization of large-scale
systems (1995) Math Oper Res, 43, pp. 264-281;
Paydar, M.M., Saidi-Mehrabad, M., Teimoury, E., A robust optimisation model for
generalised cell formation problem considering machine layout and supplier
selection (2013) Int J Comput Integr Manuf, 27 (8), pp. 772-786;
Rafiei, H., Ghodsi, R., A bi-objective mathematical model toward dynamic cell
formation considering labor utilization (2013) Appl Math Model, 37 (4), pp. 2308-
2316;
Rheault, M., Drolet, J., Abdulnour, G., Physically reconfigurable virtual cells: a
dynamic model for a highly dynamic environment (1995) Comput Ind Eng, 29 (1-4), pp.
221-225;
production planning with unreliable machines (2015) Appl Math Model.;
Shirazi, H., Kia, R., Javadian, N., Tavakkoli-Moghaddam, R., An archived multi-
objective simulated annealing for a dynamic cellular manufacturing system (2014) J
Ind Eng Int, 10, p. 58;
formation with machine layout and scheduling (2007) Comput Ind Eng, 53 (2), pp.
277-289;
(2000) Int J Prod Econ, 64 (1-3), pp. 385-397
CORRESPONDENCE ADDRESS: Kia, R.; Department of Industrial Engineering, Firoozkooh
Branch, Islamic Azad UniversityIran; email: [email protected]
PUBLISHER: SpringerOpen
ISSN: 17355702
ABBREVIATED SOURCE TITLE: J. Ind. Eng. Int.
SOURCE: Scopus
Dmytryshyn, T., Ismail, M., Rashwan, O.

57205528066;57213564213;54917374200;
A novel modeling approach for solving the cell formation problem
(2018) ASME International Mechanical Engineering Congress and Exposition,
Proceedings (IMECE), 2, . Cited 1 time.
85060400268&doi=10.1115%2fIMECE2018-
88128&partnerID=40&md5=83f7acd972a9c568fc2ddcffbfbcd50c
DOI: 10.1115/IMECE2018-88128
AFFILIATIONS: Industrial Systems Engineering, University of Regina, Regina, SK,
Canada;
Penn State University - Harrisburg, Harrisburg, PA, United States
ABSTRACT: This paper presents a new modeling approach called Progressive Modeling
(PM) and demonstrates it by solving the Cell Formation Problem (CFP). In this
paper, the Progressive Modeling (PM), a component- based optimization technique, is
used to solve the cell formation problem (CFP). This novel solution algorithm is
utilized to find optimal or near-optimal solutions. A user-friendly Windows
application is presented to capture the problem data, demonstrate the solution
process, and display the results. A benchmark problem in the literature is solved
and presented in this paper. The paper concludes by demonstrating the efficiency of
the new modeling approach and its future extension. Copyright © 2018 ASME
INDEX KEYWORDS: Engineering; Industrial engineering, Bench-mark problems; Cell
formation problem; Near-optimal solutions; Optimization techniques; Progressive
models; Solution algorithms; Solution process; Windows application, Cellular
manufacturing
REFERENCES: Wemmerlov, U., Hayer, N.M.L., Cellular manufacturing in the US
industry: A survey of users (1989) Int. J. Prod. Res., 27 (9), pp. 1511-1530;
Logendran, R., Ramakrishna, P., Sriskarandajah, C., Tabu search-based heuristics
for cellular manufacturing systems in the oresence of alternative process plans
(1994) Int. J. Prod. Res., 32 (2), pp. 273-297;
Joines, J.A., King, R.E., Culbreth, C.T., (1996) A Comprehensive Review of
Production-Oriented Manufacturing Cell Formation Techniques, , North Carolina State
University, Department of Ind. Eng;
Mansouri, S.A., Moattar Husseini, S.M., Newman, S.T., A review of the modern
approaches to multi-criteria cell design (2000) Int. J. Prod. Res., 38 (5), pp.
1201-1218;
Patel, J.N., Patel, S.V., Approaches to solve cell formation, machine layout and
cell layout problem. A review (2014) Transactions on Machine Learning and
Artificial Intelligence, 2 (5), pp. 80-96;
cluster representatives (1999) IEEE Transactions on Systems, Man and Cybernetics -
Part A. Systems and Humans., 29 (1), pp. 100-104;
Economics, 101, pp. 329-352;
Defersha, F.M., Chen, M., A parallel multiple Markov chain simulated annealing for
multi-period manufacturing cell formation problems (2008) International Journal of
Advanced Manufacturing Technology, 37, pp. 140-156;
Adenso-Diaz, B., Lozano, S., Racero, J., Fernando, G., Machine cell formation in
generalized group technology (2001) Computers & Industrial Engineering, 41, pp.
227-240;
Cao, D., Chen, M., Using penalty function and tabu search to solve cell formation
problems with fixed cell cost (2004) Computers & Operations Research, 31, pp. 21-
37;
Wu, T.H., Low, C., Wu, W.T., A tabu search approach to the cell formation problem
Chung, S.H., Wu, T.H., Chang, C.C., An efficient tabu search algorthm to the cell
(2011) Computers & Industrial Engineering, 60, pp. 7-15;
Arkat, J., Saidi, M., Abbasi, B., Appluing simulated annealing to cellular
manufacturing system dresign (2007) Journal of Advanced Manufacturing Technology,
32, pp. 531-536;
plans and machine capacity constrains. A new combined approach (2000) Int. J. Prod.
Res., 64, pp. 279-284;
Baykasoglu, A., A meta-heuristic algorithm to solve quadratic assignment
formulations of cell formation problems without presetting number of cells (2004)
Saeidi, S., Solimanpur, M., Mahdavi, I., A multi-objective Genetic Algorithm for
solving cell formation problem using a fuzzy goal programming approach (2014)
Brown, E.C., Sumichrast, R.T., CF-GGA. A grouping genetic algorithm for the cell
formation problem (2001) Int. J. Prod. Res., 39 (16), pp. 3651-3669;
Askin, R.J., Contributions to the design and analysis of cellular manufacturing
systems (2013) Int. J. Prod. Res., 51 (23-24), pp. 6778-6787;
Review and extension (1982) Int. J. Prod. Res., 20 (2), pp. 117-133
PUBLISHER: American Society of Mechanical Engineers (ASME)
ISBN: 9780791852019
ABBREVIATED SOURCE TITLE: ASME Int Mech Eng Congress Expos Proc
SOURCE: Scopus
Zhang, J., Zhou, B.

57196381322;7401906826;
Design an incremental cell formation problem considering human factor
(2017) Proceedings of 2017 IEEE 3rd Information Technology and Mechatronics
Engineering Conference, ITOEC 2017, 2017-January, pp. 559-563.
85043381671&doi=10.1109%2fITOEC.2017.8122359&partnerID=40&md5=cafe47bbf33c3450623bb
f737aceb64a
DOI: 10.1109/ITOEC.2017.8122359
AFFILIATIONS: School of Mechanical Engineering, Tongji University, Shanghai, China
ABSTRACT: Over the past three decades, plenty of techniques have been developed to
solve cell formation problems. However, most researchers focus on forming cells in
a single run or non-incrementally without considering implementation, planning and
capital investment issues. This paper proposes a mixed-integer goal programming
model to deal with incremental cell formation problem, in which human factor is
involved trying to minimize total material handling cost, operation time of workers
and salary cost. Furthermore, an improved cooperative particle swarm optimization
is developed to solve the model. At last, a simple experiment is given and it
proves that the model and the proposed algorithm are effective. © 2017 IEEE.
AUTHOR KEYWORDS: Goal programing; Human factor; ICPSO; Incremental cell
formation
INDEX KEYWORDS: Cells; Compensation (personnel); Cytology; Human engineering;
Integer programming; Investments; Linear programming; Materials handling; Particle
swarm optimization (PSO); Problem solving, Capital investment; Cell formation; Cell
formation problem; Cooperative particle swarm optimizations; Goal programing; Goal
programming model; ICPSO; Material handling costs, Cellular manufacturing
REFERENCES: Ghezavati, V.R., Saidi-Mehrabad, M., An efficient hybrid self-learning
method for stochastic cellular manufacturing problem: A queuing-based analysis[J]
(2011) Expert Systems with Applications, 38 (3), pp. 1326-1335;
Mahesh, O., Srinivasan, G., Incremental cell formation considering alternative
machines[J] (2002) International Journal of Production Research, 40 (14), pp. 3291-
3310;
Marsh, R.F., Shafer, S.M., Meredith, J.R., A comparison of cellular manufacturing
research presumptions with practice[J] (1999) International Journal of Production
Research, 37 (14), pp. 3119-3138;
Adil, G.K., Ghosh, J.B., Forming GT cells incrementally using GRASP[J] (2005) The
Venkumar, P., Noorul Haq, A., Fractional cell formation in group technology using
modified ART1 neural networks [J] (2006) The International Journal of Advanced
Manufacturing Technology, 28 (7), pp. 761-765;
Zeidi, J.R., Javadian, N., Tavakkoli-Moghaddam, R., A hybrid multi-objective
approach based on the genetic algorithm and neural network to design an incremental
cellular manufacturing system[J] (2013) Computers & Industrial Engineering, 66 (4),
pp. 1004-1014;
Mahdavi, I., Aalaei, A., Paydar, M.M., A new mathematical model for integrating all
incidence matrices in multi-dimensional cellular manufacturing system[J] (2012)
Min, H., Shin, D., Simultaneous formation of machine and human cells in group
technology: A multiple objective approach[J] (1993) International Journal of
Cesaní, V.I., Steudel, H.J., A study of labor assignment flexibility in cellular
manufacturing systems[J] (2005) Computers & Industrial Engineering, 48 (3), pp.
571-591;
Norman, B.A., Tharmmaphornphilas, W., Needy, K.L., Worker assignment in cellular
manufacturing considering technical and human skills[J] (2002) International
Kennedy, J., Particle swarm optimization[M] (2011) Encyclopedia of Machine
Learning, pp. 760-766., Springer US
EDITORS: Xu B.
ISBN: 9781509053629
ABBREVIATED SOURCE TITLE: Proc. IEEE Inf. Technol. Mechatronics Eng. Conf., ITOEC
SOURCE: Scopus
Gómez, A.T., Ferrary, F.R., Canto Dos Santos, J.V., Chiwiacowsky, L.

24767323600;56414949900;26646309200;6507125150;
Cell formation problem: An multithreading tabu search for setup time optimization
for limited machine magazines: A new solution for a classical problem
(2014) ICINCO 2014 - Proceedings of the 11th International Conference on
Informatics in Control, Automation and Robotics, 1, pp. 332-339.
84910089670&partnerID=40&md5=7ce1beb51915dfc68077f7ac2101b00e
AFFILIATIONS: Universidade do Vale do Rio dos Sinos, PIPCA, Av. Unisinos, 950, São
Leopoldo - RS, Brazil
ABSTRACT: This paper aims to present a solution for the Manufacturing Cell
Formation Problem through the use of a multithreading Tabu Search that uses
deterministic methods to effectively explore local optimum areas. Manufacturing
Cell Formation problem involves the process of analysing parts and groups them
according to their similarity. This paper aims maximize the production efficiency,
by minimizing the machine setup time in a limited magazine size through the
reduction of tool changes by creating clusters of parts that share machining tools
and present an initial scheduling based on tool changes reduction. In order to
valid the proposed algorithm, the results obtained are compared against other Tabu
Search solutions proposed in the literature.
AUTHOR KEYWORDS: Machine setup time optimization; Manufacturing Cell Formation;
Tabu search
INDEX KEYWORDS: Cells; Cytology; Flexible manufacturing systems; Manufacture;
Robotics; Scheduling; Tabu search, Cell formation problem; Classical problems;
Deterministic methods; Machine set-up time; Manufacturing cell formation; Multi-
threading; Production efficiency; Setup time optimization, Cellular manufacturing
REFERENCES: Basu, S., Tabu search implementation on traveling salesman problem and
its variations: A literature survey (2012) American Journal of Operations Research,
2 (2), pp. 163-173;
Black, P.E., Greedy algorithm (2005) Dictionary of Algorithms and Data
Structures, , [online], Vreda Pieterse and Paul E. Black, eds;
cellular manufacture (1982) Journal of Manufacturing Systems, 1, pp. 65-75;
Research, 24 (2), pp. 451-64;
Chandrasekharan, M.P., Rajagopalan, R., MODROC: An extension of rank order
Research, 24 (5), pp. 1221-64;
Crainic, T.G., Gendreau, M., Soriano, P., Toulouse, M., A tabu search procedure for
multicommodity location/Allocation with balancing requirements (1993) Annals of
Operations Research, 41, pp. 359-383;
Croes, G.A., A method for solving traveling salesman problems (1958) Operations
Res., 6, pp. 791-812;
Fiechter, C.N., A parallel tabu search algorithm for large traveling salesman
problems (1994) Discrete Applied Mathematics, 51 (3);
Glover, F., Future paths for integer programming and links to artificial
intelligence (1986) Computers and Operations Research, 1, pp. 533-549;
Gómez, A.T., (1996) Modelo para o Sequenciamento de Partes e Ferramentas Em Um
Sistema de Manufatura Flexível Com Restrições Às Datas de Vencimento e à Capacidade
do Magazine, , PhD thesis, Instituto Nacional de Pesquisas Espaciais, São José dos
Campos, São Paulo, Brasil;
Gómez, A.T., Linck, I., Galafassi, C., Wickert, T., A study for manufacturing cell
formation approach considering setup (2011) 8th International Conference, pp. 43-
48., ICINCO 2011 Noordwijkerhout, The Netherlands;
Greistorfer, P., A tabu scatter search metaheuristic for the arc routing problem
(2003) Computers and Industrial Engineering, 44 (2);
Groover, M.P., (2001) Automation, Production Systems, and Computer-Integrated
Manufacturing, , Upper Saddle River, New Jersey: Prentice-Hall, USA;
Hasegawa, M., Ikeguchi, T., Aihara, K., Combination of chaotic neurodynamics with
the 2-opt algorithm to solve traveling salesman problem (1997) Physical Review
Letters, pp. 2344-2347;
He, Y., Qiu, Y., Liu, G., Lei, K., A parallel adaptive tabu search approach for
traveling salesman problems (2005) Natural Language Processing and Knowledge
Engineering;
the cell formation problem (2007) Computers and Operations Research, 34, pp. 2059-
2079;
Kaur, D., Murugappan, M.M., Performance enhancement in solving traveling salesman
problem using hybrid genetic algorithm (2008) Proceedings of the 2008 Annual
Meeting of the North American Fuzzy Information Processing Society, pp. 1-6., New
York;
pp. 117-33;
Kothari, R., Ghosh, D., Tabu search for the single row facility layout problem
using exhaustive 2-opt and insertion neighbourhoods (2013) European Journal of
Kumar, K.R., Chandrasekharan, M.P., Grouping efficacy: A quantitative criterion for
pp. 2633-46;
Lau, H., Sim, M., Teo, K., Vehicle routing problem with time windows and a limited
number of vehicles (2003) European Journal of Operational Research, 148 (3);
Li, X., Baki, M.F., Aneja, Y.P., Flow shop scheduling to minimize the total
completion time with a permanently present operator: Models and ant colony
optimization metaheuristic (2011) Computers & Operations Research, 38 (1), pp. 152-
164;
Lim, Y.F., Hong, P.Y., Ramli, R., Khalid, R., An improved tabu search for solving
symmetric traveling salesman problems (2011) Humanities, Science and Engineering
(CHUSER), pp. 851-854., 2011 IEEE Colloquium on;
Liu, Y., Xiong, S., Liu, H., Hybrid simulated annealing algorithm based on adaptive
cooling schedule for TSP (2009) Proceedings of GEC'09, pp. 895-898., Shanghai;
Mosier, C.T., Taube, L., The facets of group technology and their impact on
Selim, M.S., Askin, R.G., Vakharia, A.J., Cell formation in group technology:
Review evaluation and directions for future research (1998) Computers and
Semet, F., Taillard, E.D., Solving real-life vehicle routing problems efficiently
using tabu search (1993) Annals of Operations Research, 41, pp. 469-488;
Sorlin, S., Christine, S., Reactive tabu search for measuring graph similarity
(2005) Graph-Based Representations in Pattern Recognition, pp. 172-182;
Tang, H., Hooks, E., A tabu search heuristic for the team orienteering problem
(2005) Computers & Operations Research, 32 (6);
Ting, C., Li, S., Lee, C., On the harmonious mating strategy through tabu search
(2003) Information Sciences, 156 (3-4);
Tsai, C.W., Tseng, S.P., Chiang;, M.C., Yang, C.S., A time-efficient method for
metaheuristics: Using tabu search and tabu GA as a case (2009) Hybrid Intelligent
Systems, 2009, 2, pp. 24-29., HIS '09. Ninth International Conference on;
Waghodekar, P.H., Sahu, S., Machine-component cell formation in group technology
MACE (1984) International Journal of Production Research, 22, pp. 937-48;
Wemmerlöv, U., Hyer, N.L., Cellular manufacturing in the U.S. Industry: A survey of
users (1989) International Journal of Production Research, 27 (9), pp. 1511-1530;
cell formation problems (2010) European Journal of Operational Research, 205 (2),
pp. 346-360;
Wu, X., Chu, C.H., Wang, Y., Yue, D., Genetic algorithms for integrating cell
formation with machine layout and scheduling (2007) Computers & Industrial
Engineering, 53 (2), pp. 277-289;
Xu, Y.T., Zhang, Y., Huang, X., Single-machine ready times scheduling with group
technology and proportional linear deterioration (2014) Applied Mathematical
Modelling, 38 (1), pp. 384-391
CORRESPONDENCE ADDRESS: Gómez, A.T.; Universidade do Vale do Rio dos Sinos, PIPCA,
Av. Unisinos, 950, Brazil
EDITORS: Sasiadek J., Filipe J., Filipe J., Gusikhin O., Madani K.
PUBLISHER: SciTePress
ISBN: 9789897580390
ABBREVIATED SOURCE TITLE: ICINCO. - Proc. Int. Conf. Informatics Control, Autom.
Rob.
SOURCE: Scopus
Kim, C.O., Baek, J.-G., Baek, J.-K.

7409879549;7103228722;7103228748;
A two-phase heuristic algorithm for cell formation problems considering alternative
part routes and machine sequences
33 times.
4944238366&doi=10.1080%2f00207540410001704078&partnerID=40&md5=f2f1e2f572ce75f09edc
89d33a52623f
DOI: 10.1080/00207540410001704078
AFFILIATIONS: Sch. of Comp. Sci. and Indust. Eng., Yonsei University, Seoul, 120-
749, South Korea;
Dept. of Indust. System Engineering, Induk Institute of Technology, Seoul, 139-749,
South Korea;
Dept. of Indust. System Management, Seoul College, Seoul, 131-702, South Korea
ABSTRACT: In this paper, we deal with the multi-objective machine cell formation
problem. This problem is characterized as determining part route families and
machine cells such that the total sum of inter-cell part movements and maximum
machine workload imbalance are simultaneously minimized. Together with the
objective function, alternative part routes and the machine sequences of part
routes are considered in grouping part route families. Also, it is assumed that the
number of machine cells is not pre-defined. Owing to the complexity of the problem,
a two-phase heuristic algorithm is proposed. Computational experiments were
conducted to verify the performance of the algorithm. Throughout the computational
experiments, we verified that the two-phase heuristic algorithm is effective for
large-scale machine cell formation problems.
INDEX KEYWORDS: Algorithms; Computational complexity; Decision making; Heuristic
programming; Industrial management; Inventory control; Investments; Large scale
systems; Optimization; Problem solving, Inter-cell part movements; Machine indices;
Machine sequences; Multi-objective machine cell formation problems, Cellular
manufacturing
REFERENCES: Bertsekas, D.P., Tsitsiklis, J.N., Wu, C., Rollout algorithm for
combinatorial optimization (1997) Journal of Heuristics, 3, pp. 245-262;
Burbidge, J.L., (1997) Production Flow Analysis for Planning Group Technology, ,
Oxford: Clarendon Press;
Caux, C., Bruniaux, R., Pierreval, H., Cell formation with alternative process plan
and machine capacity constraints: A new combined approach (2000) International
Journal of Production Economics, 64 (1-3), pp. 279-284;
Choobineh, F., A framework for the design of cellular manufacturing systems (1988)
Ham, I., Hitomi, K., Yoshida, T., (1985) Group Technology, , Boston: Kluwer-Nijhoff
Publishing;
pp. 423-431;
Kim, C., Park, Y., Jun, J., Generalized clustering algorithm for part-machine
grouping with alternative process plans (2001) Journal of the Korean Institute of
Industrial Engineers, 27 (3), pp. 281-288;
Kusiak, A., Vannelli, A., Kumar, K.R., Clustering analysis: Models and algorithms
(1986) Control and Cybernetics, 15 (2), pp. 139-154;
Kusiak, A., (1990) Intelligent Manufacturing Systems, , Englewood Cliffs, NJ:
Prentice-Hall;
Lee, H., Garcia-Diaz, A., Network flow procedures for the analysis of cellular
manufacturing systems (1996) IIE Transactions, 28 (4), pp. 333-345;
sequence data (1998) International Journal of Production Research, 36 (1), pp. 157-
179;
Suresh, N.C., Slomp, J., A multi-objective procedure for labour assignment and
grouping in capacitated cell formation problems (2001) International Journal of
Venugopal, V., Narendran, T.T., A genetic algorithm approach to the machine
component grouping problem with multiple objectives (1992) Computers and Industrial
Venugopal, V., Narendran, T.T., Machine-cell formation through neural network
models (1994) International Journal of Production Research, 32 (9), pp. 2105-2115;
technology problem with multiple process routes (1997) Computers and Industrial
Engineering, 32 (1), pp. 207-220;
Won, Y., Lee, K., Group technology cell formation considering machine sequences and
production volumes (2001) International Journal of Production Research, 39 (13),
pp. 2755-2768;
Yin, Y., Yasuda, K., Manufacturing cell's design in consideration of various
885-906;
Zhao, C., Wu, Z., A genetic algorithm for manufacturing cell formation with
multiple routes and multiple objectives (2000) International Journal of Production
Research, 38 (2), pp. 385-395
CORRESPONDENCE ADDRESS: Kim, C.O.; Sch. of Comp. Sci. and Indust. Eng., Yonsei
University, Seoul, 120-749, South Korea; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Ganesh, M.V., Srinivasan, G.

25629482000;36136249100;
A heuristic algorithm for the cell formation problem
https://www.scopus.com/inward/record.uri?eid=2-s2.0-0028199294&doi=10.1016%2f0360-
8352%2894%2990037-X&partnerID=40&md5=3c1b91be2e01b96c3f833d13ac204903
DOI: 10.1016/0360-8352(94)90037-X
AFFILIATIONS: Industrial Engineering and Management Division, Department of
Humanities and Social Sciences, Indian Institute of Technology, Madras, 600036,
India
ABSTRACT: In batch production environments, Group Technology is implemented to
evolve Cellular Manufacturing Systems. This is done to reduce uncertainties in
throughput times, work-in-process inventories and operational costs. Group
Technology seeks to group the products into part families and machines into machine
cells such that a part belonging to a particular family undergoes maximum
processing in the corresponding machine cell. One approach to grouping uses a
product flow analysis, which lends itself to mathematical manipulation easily. This
paper presents a heuristic using machine distance matrix, p-median formulation of
the cell formation problem and an iterative scheme which converges to a good
solution to the cell formation problem. Computational experiences with the
heuristic suggests its superiority over existing cell formation methods. © 1994.
INDEX KEYWORDS: Algorithms; Graph theory; Heuristic methods; Iterative methods;
Mathematical programming; Matrix algebra; Production control, Cell formation
problem; Group Technology (GT); Heuristic using machine distance matrix; Product
flow analysis, Computer aided manufacturing
REFERENCES: Askin, Cresswell, Goldberg, Vakharia, A Hamiltonian path approach to
reordering the part-machine matrix for Cellular Manufacturing (1991) Int. J. Prod.
Res., 29, pp. 1081-1100;
Carrie, Numerical taxonomy applied to group technology and plant layout (1973) Int.
J. Prod. Res., 11, pp. 399-416;
Chandrasekhara, Rajagopalan, MODROC: an extension of rank order clustering for
1233;
Chandrasekharan, Rajagopalan, ZODIAC—an algorithm for concurrent formation of part
families and machine cells (1987) Int. J. Prod. Res., 25, pp. 835-850;
Chandrasekharan, Rajagopalan, Groupability: an analysis of the properties of binary
data matrices for group technology (1989) Int. J. Prod. Res., 27, pp. 1035-1052;
Chu, Cluster analysis in manufacturing cell formation (1989) Omega, 17, pp. 289-
295;
Boctor, A linear formulation of the machine-part cell formation problem (1991) Int.
J. Prod. Res., 29, pp. 343-356;
King, Machine component grouping in production flow analysis: an approach using
rank order clustering (1980) Int. J. Prod. Res., 18, pp. 213-232;
King, Nakornchai, Machine-component group formation in group technology: review and
extension (1982) International Journal of Production Research, 20, pp. 117-133;
Krishnamurthy, (1989) The application of group technology algorithms in a textile
machinery firm, , Unpublished thesis, National Productivity Council, Madras, India;
Kumar, Chandrasekharan, Grouping efficacy: a quantitative criterion for goodness of

block diagonal forms of binary matrices in group technology (1991) International
Kumar, Kusiak, Vannelli, Grouping of parts and components in flexible manufacturing
systems (1986) European Journal of Operational Research, 24, pp. 387-397;
Kumar, Vannelli, Entropic measures of manufacturing flexibility (1987)
Kusiak, The generalized group technology concept (1987) Int. J. Prod. Res., 25, pp.
561-569;
Kusiak, Chow, Efficient solving of the group technology problem (1987) J. Manuf.
Syst., 6, pp. 117-124;
Kusiak, Branching algorithms for solving the group technology problem (1991) J.
Manuf. Syst., 10, pp. 332-343;
McAuley, Machine grouping for efficient production (1972) Production Engineer, 51
(2), pp. 53-57;
McCormick, Sweitzer, White, Problem decomposition and data reorganization by a
clustering technique (1972) Opns Res., 20, pp. 993-1009;
Miltenburg, Zhang, A comparative evaluation of nine well known algorithms for
solving the cell formation problem in Group Technology (1991) J. Opns Mgmt, 10, pp.
44-72;
Moon, Chi, Generalized part family formation using neural networks (1992) J. Manuf.
Syst., 11, pp. 149-159;
Mosier, Taube, Weighted similarity measure heuristics for the group technology
clustering problem (1985) Omega, 13, pp. 577-579;
Rajagopalan, Batra, Design of cellular production systems—a graph theoretic
approach (1975) Int. J. Prod. Res., 13, pp. 567-579;
Gunasingh, Lashkari, Simultaneous grouping of parts and machines in cellular
manufacturing systems—an integer programming approach (1991) Computers & Industrial
Seiffodini, Single linkage versus average linkage clustering in machine cells
formation applications (1989) Computers & Industrial Engineering, 16, pp. 419-426;
Seiffodini, Wolfe, Application of the Similarity Coefficient Method in Group
Technology (1986) IIE Transactions, 18, pp. 271-277;
Shafer, Kern, Wei, A mathematical programming approach for dealing with exceptional
elements in cellular manufacturing (1992) Int. J. Prod. Res., 30, pp. 1029-1036;
Kaparthi, Suresh, Machine component cell formation in group technology: a neural
networks approach (1992) Int. J. Prod. Res., 30, pp. 1353-1367;
Srinivasan, Narendran, Mahadevan, An assignment model for the part-time families
problem in group technology (1990) Int. J. Prod. Res., 28, pp. 145-152;
Srinivasan, Narendran, GRAFICS—a nonheirarchical clustering algorithm for Group
Technology (1991) Int. J. Prod. Res., 29, pp. 463-478;
Stanfel, Machine clustering for economic production (1985) Engng Costs Prod. Econ.,
9, pp. 73-81;
Steudel, Ballakur, A dynamic programming based heuristic for machine grouping in
manufacturing cell formation (1987) Comput. Indust. Engng, 12, pp. 215-222;
Taboun, Sankaran, Bhole, Comparison and evaluation of similarity measures in Group
Technology (1991) Comput. Indust. Engng, 20, pp. 343-354;
Gupta, Clustering algorithms for design of Cellular Manufacturing System—an
analysis of their performance (1991) Comput. Indust. Engng, 20, pp. 461-468;
Venugopal, Narendran, Cell formation in manufacturing systems through simulated
annealing: an experimental evaluation (1992) Eur. J. Opl Res., 63, pp. 409-422;
Waghodekar, Sahu, Machine component cell formation in Group Technology: MACE (1984)
Int. J. Prod. Res., 22, pp. 937-948
CORRESPONDENCE ADDRESS: Ganesh, M.V.; Industrial Engineering and Management
Division, Department of Humanities and Social Sciences, Indian Institute of
Technology, Madras, 600036, India
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Huang, H., Feng, H., Pan, E., Xi, L.

57192999394;56942805300;7006567662;57093169100;
A hybrid discrete Cuckoo Search algorithm for cell formation problem with
alternative process routings and operation sequence
(2016) IEEE International Conference on Industrial Engineering and Engineering
Management, 2016-December, art. no. 7798030, pp. 1011-1015. Cited 1 time.
85009833785&doi=10.1109%2fIEEM.2016.7798030&partnerID=40&md5=b20c849af0b6f8b30c9a26
5b6b906e2a
DOI: 10.1109/IEEM.2016.7798030
AFFILIATIONS: Department of Industrial Engineering and Management, Shanghai Jiao
Tong University, Shanghai, China
ABSTRACT: As the foremost step for designing a cellular manufacturing system, cell
formation is a hard optimization problem. It is necessary and significant to
develop methods to find near-optimal solutions in a reasonable time. In this paper,
the first hybrid discrete Cuckoo Search (HDCS) algorithm is designed to address the
cell formation problem. Alternative process routings and operation sequence of
parts are considered. The number of cells is not known as a priori. In HDCS, Lévy
flights are redefined to perform the evolution of discrete solutions. Local search
is employed to expand the search scope. Computational experiments on six cell
formation problems available in the literature are also presented. The results
reveal that HDCS outperforms the genetic algorithm-based and particle swarm
optimization-based approaches. HDCS is more robust, effective and efficient. © 2016
IEEE.
AUTHOR KEYWORDS: Alternative process routings; cell formation; Cuckoo Search;
number of cells; operation sequence
INDEX KEYWORDS: Cells; Cytology; Genetic algorithms; Manufacture; Optimization;
Particle swarm optimization (PSO), Alternative process routings; Cell formation;
Cell formation problem; Computational experiment; Cuckoo search algorithms; Cuckoo
searches; Near-optimal solutions; Operation sequences, Cellular manufacturing
REFERENCES: Chung, S.-H., Wu, T.-H., Chang, C.-C., An efficient tabu search
algorithm to the cell formation problem with alternative routings and machine
reliability considerations (2011) Computers & Industrial Engineering, 60, pp. 7-15;

research (2010) European Journal of Operational Research, 206, pp. 509-521;
Deljoo, V., Mirzapour Al-e-Hashem, S.M.J., Deljoo, F., Aryanezhad, M.B., Using
genetic algorithm to solve dynamic cell formation problem (2010) Applied
Mathematical Modelling, 34, pp. 1078-1092;
Baykasoǧlu, A., A meta-heuristic algorithm to solve quadratic assignment
Sun, D., Lin, L., Batta, R., Cell formation using tabu search (1995) Computers &
Kao, Y., Lin, C.-H., A PSO-based approach to cell formation problems with
alternative process routings (2012) International Journal of Production Research,
50, pp. 4075-4089;
Yang, X.S., Suash, D., Cuckoo Search via Lévy flights (2009) Nature & Biologically
Inspired Computing, 2009. NaBIC 2009. World Congress on, pp. 210-214;
Yildiz, A.R., Cuckoo search algorithm for the selection of optimal machining
parameters in milling operations (2013) The International Journal of Advanced
Gandomi, A.H., Yang, X.-S., Alavi, A.H., Cuckoo search algorithm: A metaheuristic
approach to solve structural optimization problems (2011) Engineering with
Computers, 29, pp. 17-35;
Ouaarab, A., Ahiod, B., Yang, X.-S., Discrete cuckoo search algorithm for the
travelling salesman problem (2014) Neural Computing and Applications, 24, pp. 1659-
1669;
Mahmoudi, S., Lotfi, S., Modified cuckoo optimization algorithm (MCOA) to solve
graph coloring problem (2015) Applied Soft Computing, 33, pp. 48-64;
Li, X., Yin, M., A hybrid cuckoo search via Lévy flights for the permutation flow
shop scheduling problem (2013) International Journal of Production Research, 51,
pp. 4732-4754;
Feng, H.-X., Wang, H., Yao, J., Pan, E.-S., Xi, L.-F., An improved discrete PSO-
based approach for cell formation problem (2015) Shanghai Jiaotong Daxue
Xuebao/Journal of Shanghai Jiaotong University, 49, pp. 1332-1338;
707-720;
Saeed Jabal Ameli, M., Arkat, J., Cell formation with alternative process routings
and machine reliability consideration (2008) International Journal of Advanced
Nagi, R., Harhalakis, G., Proth, J.-M., Multiple routeings and capacity
Production Research, 28, pp. 2243-2257
PUBLISHER: IEEE Computer Society
ISSN: 21573611
ISBN: 9781509036653
ABBREVIATED SOURCE TITLE: IEEE Int. Conf. Ind. Eng. Eng. Manage.
SOURCE: Scopus
Spiliopoulos, K., Sofianopoulou, S.

55910439800;6603156425;
An optimal tree search method for the manufacturing systems cell formation problem
(1998) European Journal of Operational Research, 105 (3), pp. 537-551. Cited 23
times.
https://www.scopus.com/inward/record.uri?eid=2-s2.0-0032024502&doi=10.1016%2fS0377-
2217%2897%2900078-7&partnerID=40&md5=443cb3a23b818c4212ba87242ffd0b7c
DOI: 10.1016/S0377-2217(97)00078-7
AFFILIATIONS: Department of Industrial Management, University of Piraeus, 80
Karaoli and Demetriou Street, 185 34 Piraeus, Greece
ABSTRACT: A solution methodology producing exact solutions to the manufacturing
systems cell formation problem is presented. A distance matrix representing the
closeness between pairs of machines with regard to the parts they process is taken
into account. The proposed approach is an optimal tree search method which employs
two different bounds; a classical bound for the Quadratic Assignment Problem and a
recently proposed one for the Quadratic Transportation Problem, as well as a new
heuristic for the cell formation problem A special tree search was designed in
order to reduce the size of the tree, minimize the computational effort required in
time consuming calculations and exploit symmetries of the problem. Computational
results indicate that the proposed algorithm is very efficient in generating
optimal solutions at low computational cost. © 1998 Elsevier Science B.V.
AUTHOR KEYWORDS: Branch and bound; Flexible manufacturing systems; Group
technology; Quadratic programming
INDEX KEYWORDS: Algorithms; Computational methods; Critical path analysis;
Mathematical programming; Process control; Production control; Scheduling; Trees
(mathematics), Branch and bound method; Cell formation problems (CFP); Group
technology; Quadratic assignment problem; Quadratic programming; Quadratic
transportation problem, Flexible manufacturing systems
REFERENCES: Assad, A.A., Xu, W., On lower bounds for a class of quadratic 0,1
programs (1985) Operations Research Letters, 4 (4), pp. 175-180;
Brunetta, Rinaldi, Sassano, (1994) The Node Capacitated Graph Partitioning Problem:
Formulations and Valid Inequalities, , IASI, Rome;
Carraresi, P., Malucelli, F., A new lower bound for the quadratic assignment
problem (1992) Operations Research, 40 (1), pp. 22-27;
Cheng, C.H., Algorithms for grouping machine groups in group technology (1992)
OMEGA International Journal of Management Science, 20 (4), pp. 493-501;
Cheng, C.H., Goh, C.-H., Lee, A., Solving the generalized machine assignment
problem in group technology (1996) Journal of the Operational Research Society, 47,
pp. 794-802;
Cohen, D., (1978) Basic Techniques of Combinatorial Theory, , John Wiley and Sons;
Falkner, J., Rendl, F., Wolkowicz, H., A computational study of graph partitioning
(1994) Mathematical Programming, 66, pp. 211-239;
Fiduccia, C., Mattheyses, R., A linear-time heuristic for improving network
partitions (1982) Technical Report 82CRD130, , General Electric Co., Schenectady,
NY;
Finke, G., Burkard, R.E., Rendl, F., Quadratic assignment problems (1987) Annals of
Discrete Mathematics, 31, pp. 61-82;
Garey, M.R., Johnson, D.S., (1979) Computers and Intractability: A Guide to the
Theory of NP-completeness, , Freeman, New York;
Gilmore, P.C., Optimal and suboptimal algorithms for the quadratic assignment
problem (1962) SIAM Journal on Applied Mathematics, 10 (2), pp. 305-313;
Harhalakis, G., Nagi, R., Proth, J.M., An efficient heuristic in manufacturing cell
Horlm, Sorensen, The optimal graph partitioning problem (1993) Operations Research
Spektrum, 5, pp. 1-8;
Johnson, Optimization by simulated annealing: An experimental evaluation. I: Graph
partitioning (1989) Operations Research, 87, pp. 865-892;
Johnson, E.L., Mehrotra, A., Nemhauser, G.L., Min-cut clustering (1993)
Mathematical Programming, 62, pp. 133-151;
Kandiller, L., A comparative study of cell formation in cellular manufacturing
systems (1994) International Journal of Production Research, 32 (10), pp. 2395-
2429;
Kernighan, B.W., Lin, S., An efficient heuristic procedure for partitioning graphs
(1970) Bell Systems Technical Journal, 49 (2), pp. 291-307;
397;
Lee, H., Garcia-Diaz, A., A network flow approach to solve clustering problems in
603-612;
Papadimitriou, C.H., Steiglitz, K., (1982) Combinatorial Optimization: Algorithms
and Complexity, , Prentice-Hall, New Jersey;
Pardalos, P.M., Rendl, F., Wolkowicz, H., The quadratic assignment problem: A
survey and recent developments (1994) Quadratic Assignment and Related Problems.
DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, pp. 1-
42., Pardalos, P.M., Wolkowicz, H. (Eds.);
graph (1995) Annals of Operations Research, 58, pp. 155-179;
Schramm, H., Zowe, J., A version of the bundle idea for minimizing a nonsmooth
function: Conceptual idea, convergence analysis, numerical results (1992) SIAM
Journal of Optimization, 2 (1), pp. 121-152;
Sofianopoulou, S., A mathematical programming approach to the manufacturing systems
cell formation problem (1993) Proceedings of 2nd Balkan Conference on OR, pp. 197-
209., Papathanassiou, B., Paparrizos, K., Eds;
formation of machine cells in group technology (1997) International Journal of
Vohra, J., Chen, D.S., Chang, J.C., Chen, H.C., A network approach to cell
formation in cellular manufacturing (1990) International Journal of Production
Research, 28, pp. 2075-2084;
Wei, J.C., Gaither, N., An optimal model for cell formation decisions (1990)
Decision Sciences, 21 (2), pp. 416-433;
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the U.S. Industry: A survey of
Wu, N., Salvendy, G., A modified network approach for the design of cellular
pp. 1409-1421
CORRESPONDENCE ADDRESS: Sofianopoulou, S.; Department of Industrial Management,
University of Piraeus, 80 Karaoli and Demetriou Street, 185 34 Piraeus, Greece
PUBLISHER: Elsevier
ISSN: 03772217
CODEN: EJORD
ABBREVIATED SOURCE TITLE: Eur J Oper Res
SOURCE: Scopus
Rabbani, M., Jolai, F., Manavizadeh, N., Radmehr, F., Javadi, B.

57208701862;56218703500;37761692300;57193482302;16417433500;
Solving a bi-objective cell formation problem with stochastic production quantities
by a two-phase fuzzy linear programming approach
84855989344&doi=10.1007%2fs00170-011-3413-
4&partnerID=40&md5=348c6dd5189aa9255726c514817b3495
DOI: 10.1007/s00170-011-3413-4
University of Tehran, Tehran, Iran
ABSTRACT: We propose a bi-objective cell formation problem with demand of products
expressed in a number of probabilistic scenarios. To deal with the uncertain demand
of products, a framework of two-stage stochastic programming model is presented.
The proposed model considers minimizing the sum of the miscellaneous costs (machine
constant cost, expected machine variable cost, cell fixed-charge cost, and expected
intercell movement cost) and expected total cell loading variation. Because of
conflicting objectives, we develop a two-phase fuzzy linear programming approach
for solving bi-objective cell formation problem. To show the effectiveness of the
proposed approach, numerical examples are solved and the results are compared with
the two existing approaches in the literature. The computational results show that
the proposed fuzzy method achieves lower objective functions as well as higher
satisfaction degrees. © 2011 Springer-Verlag London Limited.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing design; Fuzzy
linear programming; Multi-objective; Stochastic programming model
INDEX KEYWORDS: Cell formation problem; Cell loading; Computational results; Fixed
Charges; Fuzzy linear programming; Fuzzy methods; Intercell; Multi objective;
Numerical example; Objective functions; Satisfaction degrees; Stochastic
production; Stochastic programming model; Two-stage stochastic programming;
Uncertain demand; Variable costs, Cells; Cellular manufacturing; Computer
programming; Cost accounting; Costs; Linear programming; Stochastic programming;
Stochastic systems, Stochastic models
REFERENCES: Burbidge, J.L., Production flow analysis (1963) Prod Eng, 42, pp. 742-
752., 10.1049/tpe.1963.0114;
Suresh, N.C., Meredith, J.R., Achieving factory automation principles through group
technology principles (1985) J Oper Manag, 5, pp. 151-167., 10.1016/0272-
6963(85)90004-X;
Industrial Engineering, 34 (1), pp. 3-20., PII S0360835297001472;
Implementation experiences and performance improvements (1997) International
Shanker, R., Vrat, P., Post design modeling for cellular manufacturing system with
cost uncertainty (1998) International Journal of Production Economics, 55 (1), pp.
97-109., PII S0925527398000437;
approaches to multi-criteria cell design (2000) International Journal of Production
Research, 38 (5), pp. 1201-1218., DOI 10.1080/002075400189095;
Nei, J.C., Gaither, N., A capacity constrained multi-objective cell formation
method (1990) J Manuf Syst, 9, pp. 222-232., 10.1016/0278-6125(90)90053-K;
Venugopal, V., Narendran, T.T., Genetic algorithm approach to the machine-component
grouping problem with multiple objectives (1992) Computers and Industrial
Engineering, 22 (4), pp. 469-480., DOI 10.1016/0360-8352(92)90022-C;
Research, 38 (2), pp. 385-395., DOI 10.1080/002075400189473;
Baykasoglu, A., Gindy, N.N.Z., Cobb, R.C., Capability based formulation and
solution of multiple objective cell formation problems using simulated annealing
(2001) Integrated Manufacturing Systems, 12 (4), pp. 258-274., DOI
10.1108/09576060110392560;
Solimanpur, M., Vart, M., Shankar, R., A multi-objective genetic algorithm approach
to the design of cellular manufacturing systems (2004) Int J Prod Res, 42, pp.
1419-1441., 1060.90084 10.1080/00207540310001638073;
Int J Adv Manuf Technol, 28, pp. 950-956., 10.1007/s00170-004-2441-8;
Aramoon Bajestani, M., Rabbani, M., Rahimi-Vahed, A.R., Baharian Khoshkhou, G., A
multi-objective scatter search for a dynamic cell formation problem (2009) Comput
Oper Res, 36, pp. 777-794., 1157.90384 10.1016/j.cor.2007.10.026;
Helton, J.C., Johnson, J.D., Oberkampf, W.L., An exploration of alternative
approaches to the representation of uncertainty in model predictions (2004) Reliab
Eng Syst Saf, 85 (13), pp. 39-71., 10.1016/j.ress.2004.03.025;
Apostolakis, G., The concept of probability in safety assessments of technological
systems (1990) Science, 250 (4986), pp. 1359-1364;
cellular manufacturing: A review and future directions (2007) European Journal of
Operational Research, 177 (1), pp. 281-309., DOI 10.1016/j.ejor.2005.08.027, PII
S0377221705009045;
Kim, C.O., Baek, J.-G., Jun, J., A machine cell formation algorithm for
simultaneously minimising machine workload imbalances and inter-cell part movements
(2005) International Journal of Advanced Manufacturing Technology, 26 (3), pp. 268-
275., DOI 10.1007/s00170-003-1619-9;
Liu, C., Yin, Y., Yasuda, K., Lian, J., A heuristic algorithm for cell formation
Technol, , 10.1007/s00170-009-2170-0 doi:;
Ostrosi, E., Tautrim, J., Fukuda, S., Consensual cell searching in cellular
manufacturing design (2010) Int J Adv Manuf Technol, 51 (58), pp. 769-788.,
10.1007/s00170-010-2660-0;
Szwarc, D., Rajamani, D., Bector, C.R., Cell formation considering fuzzy demand and
machine capacity (1997) Int J Adv Manuf Technol, 13 (2), pp. 834-840.,
10.1007/BF01225760;
Masnata, A., Settineri, L., An application of fuzzy clustering to cellular
manufacturing (1997) International Journal of Production Research, 35 (4), pp.
1077-1094;
Susanto, S., Kennedy, R.D., Price, J.W., A new fuzzy-c-means and assignment
technique-based cell formation algorithm to perform part-type clusters and machine-
type clusters separately (1999) Prod Plann Control, 10 (4), pp. 375-388.,
10.1080/095372899233127;
Chu, C.H., Hayya, J.C., A fuzzy clustering approach to manufacturing cell formation
(1991) Int J Prod Res, 29 (7), pp. 1475-1487., 10.1080/00207549108948024;
Lozano, S., Dobado, D., Larraneta, J., Onieva, L., Modified fuzzy C-means algorithm
for cellular manufacturing (2002) Fuzzy Sets and Systems, 126 (1), pp. 23-32., DOI
10.1016/S0165-0114(01)00003-3, PII S0165011401000033;
Arikan, F., Gungor, Z., A parametric model for cell formation and exceptional
elements' problems with fuzzy parameters (2005) Journal of Intelligent
Manufacturing, 16 (1), pp. 103-114., DOI 10.1007/s10845-005-4827-3;
Torkul, O., Cedimoglu, I.H., Geyik, A.K., An application of fuzzy clustering to
manufacturing cell design (2006) J Intell Fuzzy Syst, 17 (2), pp. 173-181;
Ravichandran, K.S., Chandra Sekhara Rao, K., A new approach to fuzzy part-family
formation in cellular manufacturing systems (2001) International Journal of
Advanced Manufacturing Technology, 18 (8), pp. 591-597., DOI 10.1007/s001700170036;
Pai, P.-F., Chang, P.-T., Lee, S.-Y., Part-machine family formation using genetic
Manufacturing Technology, 25 (11-12), pp. 1175-1179., DOI 10.1007/s00170-003-1944-
z;
Tsai, C.-C., Lee, C.-Y., Optimization of manufacturing cell formation with a multi-
functional mathematical programming model (2006) International Journal of Advanced
conditions (2008) Fuzzy Sets and Systems, 159 (2), pp. 215-236., DOI
10.1016/j.fss.2007.06.014, PII S0165011407003296, Theme: Games and Decision;
Papaioannou, G., Wilson, J., Fuzzy extensions to Integer Programming models of
cell-formation problems in machine scheduling (2009) Ann Oper Res, 166 (1), pp.
163-181., 2470998 1163.90820 10.1007/s10479-008-0423-1;
Tilsley, R., Lewis, F.A., Flexible cell production systems-a realistic approach
(1977) Manuf Technol, Gen Assem of CIRP, 27th, 26 (1-2), pp. 269-271;
Seifoddini, H., A probabilistic model for machine cell formation (1990) J Manuf
Syst, 9 (1), pp. 69-75., 10.1016/0278-6125(90)90070-X;
Seifoddini, H., Djassemi, M., Sensitivity analysis in cellular manufacturing system
in the case of product mix variation (1996) Computers and Industrial Engineering,
31 (1-2), pp. 163-167;
Harhalakis, G., Ioannou, G., Minis, I., Nagi, R., Manufacturing cell formation
under random product demand (1994) Int J Prod Res, 32 (1), pp. 47-64., 0905.90096
10.1080/00207549408956915;
Cao, D., Chen, M., A robust cell formation approach for varying product demands
(2005) International Journal of Production Research, 43 (8), pp. 1587-1605., DOI
10.1080/00207540412331327754;
Saidi-Mehrabad, M., Ghezavat, V., Designing integrated cellular manufacturing
systems with scheduling considering stochastic processing time (2010) Int J Adv
Dantzing, G.B., Linear programming under uncertainty (1995) Manag Sci, 1, pp. 197-
206., 10.1287/mnsc.1.3-4.197;
Kall, P., Wallace, S.W., (1994) Stochastic Programming, , Wiley Chichester
0812.90122;
Ruszcynski, A., Shapiro, A., (2003) Stochastic Programming (Handbooks in Operations
Research and Management Science), , Elsevier Amsterdam;
Beraldi, P., Conforti, D., Violi, A., A two-stage stochastic programming model for
electric energy producers (2008) Computers and Operations Research, 35 (10), pp.
3360-3370., DOI 10.1016/j.cor.2007.03.008, PII S030505480700069X;
Liu, C., Fan, Y., Ordonez, F., A two-stage stochastic programming model for
transportation network protection (2009) Comput Oper Res, 36 (5), pp. 1582-1590.,
2586325 1179.90246 10.1016/j.cor.2008.03.001;
Mulvey, J.M., Shetty, B., Financial planning via multi-stage stochastic
optimization (2004) Computers and Operations Research, 31 (1), pp. 1-20., DOI
10.1016/S0305-0548(02)00141-7, PII S0305054802001417;
Collette, Y., Siarry, P., (2003) Multiobjective Optimization: Principles and Case
Studies, , Springer Berlin;
functions (1978) Fuzzy Set Syst, 1, pp. 45-56., 0364.90065 10.1016/0165-
0114(78)90031-3;
Bellman, R.E., Zadeh, L.A., Decision making in a fuzzy environment (1970) Manag
Sci, 17, pp. 141-164., 301613 10.1287/mnsc.17.4.B141;
Lee, S., Li, R.J., Fuzzy multiple objective programming and compromise programming
with Pareto optimum (1993) Fuzzy Set Syst, 53, pp. 275-288., 1212441 0807.90130
10.1016/0165-0114(93)90399-3;
Guu, S.-M., Wu, Y.-K., Two-phase approach for solving the fuzzy linear programming
problems (1999) Fuzzy Sets and Systems, 107 (2), pp. 191-195., PII
S0165011497003047;
Li, X., Li, B., Computing efficient solutions to fuzzy multiple objective linear
programming problems (2006) Fuzzy Set Syst, 157, pp. 1328-1332., 1132.90383
10.1016/j.fss.2005.12.003;
Abd El-Wahed, W.F., Lee, S.M., Interactive fuzzy goal programming for multi-
objective transportation problems (2006) Omega, 34 (2), pp. 158-166., DOI
10.1016/j.omega.2004.08.006, PII S0305048304001392;
Guo, Z.X., Wong, W.K., Leung, S.Y.S., Fan, J.T., Chan, S.F., A genetic-algorithm-
based optimization model for scheduling flexible assembly lines (2008)
International Journal of Advanced Manufacturing Technology, 36 (1-2), pp. 156-168.,
DOI 10.1007/s00170-006-0818-6;
Guo, Z.X., Wong, W.K., Leung, S.Y.S., Fan, J.T., Chan, S.F., Mathematical model and
genetic optimization for the job shop scheduling problem in a mixed- and multi-
product assembly environment: A case study based on the apparel industry (2006)
10.1016/j.cie.2006.03.003, PII S0360835206000271
CORRESPONDENCE ADDRESS: Rabbani, M.; Department of Industrial Engineering, College
of Engineering, University of Tehran, Tehran, Iran; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Elbenani, B., Ferland, J.A.

36147113000;57193718834;
An exact method for solving the manufacturing cell formation problem
23 times.
84864839514&doi=10.1080%2f00207543.2011.588622&partnerID=40&md5=73ae749a4b615b653fe
76d7f287b825c
DOI: 10.1080/00207543.2011.588622
AFFILIATIONS: Département d'Informatique, Université Med V-Agdal, Rabat, Morocco;
Département d'Informatique et de Recherche Opérationnelle, Université de Montréal,
Canada
ABSTRACT: The cell formation problem is extensively studied in the literature, but
very few authors have proposed exact methods. In this paper a linear binary
programming formulation is introduced to generate a solution for the cell formation
problem. To verify the behaviour of the proposed model, a set of 35 benchmark
problems is solved using the branch and cut method implemented in the IBM ILOG
CPLEX 10.11 Optimiser. Moreover, these results allow us to validate the quality of
the solution generated with heuristic methods proposed in the literature. This
experimentation indicates that, for the smaller problems, the best-known solutions
are the same as those generated with CPLEX 10.11 Optimiser. These results indicate
a fair confidence in the optimality of the best-known solutions generated by the
heuristic methods. Furthermore, our approach is the first exact method providing
results of this quality. © 2012 Copyright Taylor and Francis Group, LLC.
AUTHOR KEYWORDS: cell formation problem; grouping efficiency; heuristic methods;
linear binary programming formulation
INDEX KEYWORDS: Bench-mark problems; Binary programming; Branch and cut; Cell
formation problem; Exact methods; Grouping efficiency; Manufacturing cell
formation; Optimality, Heuristic methods; Linear programming, Cellular
manufacturing
REFERENCES: Adil, G.K., Mathematical model for cell formation considering
investment and operational costs (1993) European Journal of Operational Research,
69 (3), pp. 330-341;
113;
pp. 2097-2116;
cellular manufacture (1982) Journal of Manufacturing Systems, 1 (1), pp. 65-75;
Research, 24 (5), pp. 1221-1233;
Research, 24 (2), pp. 451-464;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC: An algorithm for concurrent
formation of part-families and machine-cells (1987) International Journal of
Chandrasekharan, M.P., Rajagopalan, R., GROUPABILITY: An analysis of the properties
Cheng, C.H., TSP-based heuristic for forming machine groups and part families
Dimopoulos, C., Mort, N., A hierarchical clustering methodology based on genetic
Dimopoulos, C., Zalzala, A.M.S., Recent developments in evolutionary computations
for manufacturing optimization: Problems, solutions, and comparisons (2000) IEEE
Transactions on Evolutionary Computations, 4 (2), pp. 93-113;
Ghosh, T., Genetic rule based techniques in cellular manufacturing (1992-2010): A
systematic survey (2010) International Journal of Engineering Science and
Technology, 2 (5), pp. 198-215;
Goncalves, J., Resende, M.G.C., An evolutionary algorithm for manufacturing cell
James, T.L., A hybrid grouping genetic algorithm for the cell formation problem
(2007) Computers & Operations Research, 34 (7), pp. 2059-2079;
Research, 18 (2), pp. 213-232;
pp. 117-133;
Kumar, C., Chandrasekharan, M., Grouping efficiency: A quantitative criterion for
1715-1728;
Kumar, K.R., Grouping of parts and components in flexible manufacturing systems
(1986) European Journal of Operational Research, 24 (3), pp. 387-397;
pp. 2633-2646;
Lin, S.W., Part-machine cell formation in group technology using a simulated
annealing-based meta-heuristic (2010) International Journal of Production Research,
48 (12), pp. 3579-3591;
Mahdavi, I., Designing a new mathematical model for a cellular manufacturing system
based on cell utilization (2007) Applied Mathematics and Computation, 190 (1), pp.
662-670;
Mahdavi, I., Genetic algorithm approach for solving a cell formation problem in
cellular manufacturing (2009) Expert Systems With Applications, 36 (3), pp. 6598-
6604;
McCormick, W.T., Problem decomposition and data reorganization by a clustering
technique (1972) Operations Research, 20 (5), pp. 993-1009;
Nokhtehdan, A., A differential evolution algorithm for the manufacturing cell
formation problem using group based operators (2010) Expert Systems With
Applications, 37 (7), pp. 4822-4829;
Papaioannou, G., Wilson, J.N., The evolution of cell formation problem
Rajamani, D., Selection of parts and machines for cellularization: A mathematical
programming approach (1992) European Journal of Operational Research, 62 (3), pp.
47-54;
new grouping efficiency measure (2001) IIE Transactions, 33 (1), pp. 11-27;
Srinivasan, G., A clustering-algorithm for machine cell-formation in group
technology using minimum spanning-trees (1994) International Journal of Production
Research, 32 (9), pp. 2149-2158;
Srinivasan, G., Narendran, T.T., GRAPHICS: A nonhierarchical clustering algorithm
pp. 463-478;
Srinivasan, G., An assignment model for the part-families problem in group
technology (1990) International Journal of Production Research, 28 (1), pp. 145-
152;
and Production Economics, 9 (1-3), pp. 73-81;
Tunnukij, T., Hicks, C., An enhanced genetic algorithm for solving the cell
formation problem (2009) International Journal of Production research, 47 (7), pp.
1989-2007;
MACE (1984) International Journal of Production Research, 22 (6), pp. 937-948;
Xiangyong, L., An ant colony optimization metaheuristic for machine-part cell
formation problems (2010) Computers & Operations Research, 37 (12), pp. 2071-2081;
Ying, K.C., Lin, S.W., Lu, C.C., Cell formation using a simulated annealing
problems (2002) International Journal of Production Research, 40 (9), pp. 2141-2158
CORRESPONDENCE ADDRESS: Ferland, J.A.; Département d'Informatique et de Recherche
Opérationnelle, Université de MontréalCanada; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Fan, J., Cao, M., Feng, D.

36185126800;55881673000;7401981221;
Multi-objective dual resource-constrained model for cell formation problem
(2010) 5th IEEE International Conference on Management of Innovation and
Technology, ICMIT2010, art. no. 5492881, pp. 1031-1036. Cited 7 times.
77954898989&doi=10.1109%2fICMIT.2010.5492881&partnerID=40&md5=33cb948bab24eddb69879
83ffba79cb5
DOI: 10.1109/ICMIT.2010.5492881
AFFILIATIONS: School of Economics and Managenemt, Zhejiang University of Science
and Technology, Hangzhou, China;
College of Mechnical Engineering, Zhejiang University of Technology, Hangzhou,
China
ABSTRACT: The cell manufacturing was played close attention widely by the
enterprises and academe in the last 30 years. And cell formation is a key factor to
implement cell manufacturing effectively. In the recently research of cell
formation problem, the researchers mainly focus on the parts families and machines
grouping, but forget another important factor-operators. A multi-objective dual
resourceconstrained system model for cell formation problem is considered in this
paper, in which the part routing, cell number and annual demand of each part type,
is known. This problem is characterized as optimally determining part-machine cell
set and corresponding operators hired so that total intercellular part and operator
movement, total operator hired and total operator workload imbalances are
simultaneously minimized. Then this paper use the GA (Genetic Algorithm) to
solution this model. At last a simple numerical example is given and it proves that
the model is effective. © 2010 IEEE.
AUTHOR KEYWORDS: Cell formation problem; DRCS; Multiobjective function
INDEX KEYWORDS: Cell formation; Cell formation problem; Cell manufacturing; Cell
number; Dual resource; GA (genetic algorithm); Key factors; Machine cell; Multi
objective; Multi-objective functions; Numerical example; Operator workload; Parts
families; Resource-constrained; System models, Cells; Cellular manufacturing;
Engineering research; Genetic algorithms; Innovation; Mathematical operators; Model
structures; Multiobjective optimization, Cytology
REFERENCES: Kubeling, A., The generalized group technology concept (1987)
systems an integer programming approach (1989) International Journal of Production
Research, 27, pp. 1465-1473;
Gunasingh, K.R., Lashkari, R.S., The cell formation problem in cellular
manufacturing systems a sequential modeling approaches (1989) Computers and
Rajamani, D., Singh, N., Aneja, Y.P., Selection of parts and machines for
cellularization: A mathematical programming approach (1990) European Journal of
Operational Research, 62, pp. 47-54;
Economics, 103, pp. 185-198;
Dahel, N.E., Design of cellular manufacturing systems in tandem conjurations (1995)
Kang, S.L., Wemmerloe, V.U., A work load-oriented heuristic methodology for
manufacturing cell formation allowing reallocation of operations (1993) European
Wicks, E.M., Reasor, R.J., Resignning cellular manufacturing systems with dynamic
Defersha, F.M., Chen, M., Machine cell formation using a mathematical model and a
genetic-algorithm-based heuristic (2006) International Journal of Production
Research, 44 (12), pp. 2421-2444;
Safaei, N., Avakkoli, T.M.R., Jabal, A.S., (2006) A Generalized Cell Formation
Problem in Dynamic Environment with Different Inter and Intra-cell Batch Sizes;
Safaei, Moghaddam, R.T., Integrated multi-period cell formation and subcontracting
production planning in dynamic cellular manufacturing systems (2008) International
Journal of Production Economics;
Rheault, M., Dolet, J., Abdulnour, G., Physically reconfigurable virtual cells: A
dynamic model for a highlydynamic environment (1995) Computers and Industrial
Engineering, 29 (1-4), pp. 221-225;
Balakrishnan, J., Cheng, C.H., Dynamic cellular manufacturing under multi-period
pp. 516-530;
Tavakkoli, M.R., Aryanezhad, M.B., Safaei, N., Azaron, A Solving a dynamic cell
formation problem using metaheuristics (2005) Applied Mathematics and Computation,
170 (2), pp. 761-780;
Saidi, M., Safaei, N., A new model of dynamic cell formation by a neural approach
International Journal of Advanced Manufacturing Technology, , doi:10.1007/s00170-
006-0518-2, 2007;
Ebeling, A.C., Lee, C.Y., Cross-training activeness and probability (1994)
Suresh, N.C., Slomp, J., A multi-objective procedure for labour assignments and
grouping incapacitated cell formation problems (2001) International Journal of
Satoglu, S., Suresh, N.C., A goal-programming approach for design of hybrid
cellular manufacturing systems in dual resource-constrained environments (2009)
Computers & Industrial Engineering, 56, pp. 560-575;
Zamiska, J.R., Jaber, M.Y., Kher, H.V., Worker deployment in dual resource
constrained systems with a task-type factor (2007) European Journal of Operational
Research, 177, pp. 1507-1519;
Aryanezhad, M.B., Mirzapour, S.M.J., Dynamic cell formation and the worker
assignment problem: A new model (2009) International Jouranl of Advanced
CORRESPONDENCE ADDRESS: Fan, J.; School of Economics and Managenemt, Zhejiang
University of Science and Technology, Hangzhou, China; email: [email protected]
ISBN: 9781424465675
ABBREVIATED SOURCE TITLE: IEEE Int. Conf. Manage. Innov. Technol., ICMIT
SOURCE: Scopus
Ozcelik, F., Saraç, T.

55912902400;15072920400;
A genetic algorithm extended modified sub-gradient algorithm for cell formation
problem with alternative routings
12 times.
84864837378&doi=10.1080%2f00207543.2011.588264&partnerID=40&md5=b2f117a276fb18a5d05
142e876899861
DOI: 10.1080/00207543.2011.588264
AFFILIATIONS: Industrial Engineering Department, Eskisehir Osmangazi University,
Eskisehir, Turkey
ABSTRACT: This paper addresses the cell formation problem with alternative part
routes. The problem is considered in the aspect of the natural constraints of real-
life production systems such as cell size, separation and co-location constraints.
Co-location constraints were added to the proposed model in order to deal with the
necessity of grouping certain machines in the same cell for technical reasons, and
separation constraints were included to prevent placing certain machines in close
vicinity. The objective is to minimise the weighted sum of the voids and the
exceptional elements. A hybrid algorithm is proposed to solve this problem. The
proposed algorithm hybridises the modified sub-gradient (MSG) algorithm with a
genetic algorithm. MSG algorithm solves the sharp augmented Lagrangian dual
problems, where zero duality gap property is guaranteed for a wide class of
optimisation problems without convexity assumption. Generally, the dual problem is
solved by using GAMS solvers in the literature. In this study, a genetic algorithm
has been used for solving the dual problem at the first time. The experimental
results show the advantage of combining the MSG algorithm and the genetic
algorithm. Although the MSG algorithm, whose dual problem is solved by GAMS solver,
and the genetic algorithm cannot find feasible solutions, hybrid algorithm
generates feasible solutions for all of the test problems. © 2012 Copyright Taylor
and Francis Group, LLC.
AUTHOR KEYWORDS: alternative routings; cell formation problem; cellular
manufacturing; genetic algorithms; modified sub-gradient algorithm
INDEX KEYWORDS: Alternative routings; Augmented Lagrangians; Cell formation
problem; Cell formation problem with alternative routings; Cell size; Colocations;
Dual problem; Duality gap; Exceptional elements; Feasible solution; Hybrid
algorithms; Optimisations; Production system; Separation constraints; Sub-gradient
algorithm; Test problem; Weighted Sum, Cellular manufacturing; Genetic algorithms;
Size separation, Problem solving
REFERENCES: Adenso-Diáz, B., Machine cell formation in generalised group technology
1380;
manufacturing cell formation (2006) Computers and Operations Research, 33 (8), pp.
2219-2245;
Gasimov, R., Augmented Lagrangean duality and nondifferantiable optimization
methods in non-convex programming (2002) Journal of Global Optimization, 24 (2),
pp. 187-203;
Gasimov, R.N., Ustun, O., Solving the quadratic assignment problems using modified
subgradient algorithm (2005) Proceedings of 35th International Conference on
Computers & Industrial Engineering, 19-22 June, Istanbul, Turkey, pp. 757-762;
Gasimov, R.N., Ustun, O., Solving the quadratic assignment problem using F-MSG
algorithm (2007) Journal of Industrial and Management Optimization, 3 (2), pp. 173-
191;
Gen, M., Cheng, R., (1997) Genetic Algorithms and Engineering Design, , New York:
John Wiley & Sons;
Goldberg, D.E., (1989) Genetic Algorithms in Search, Optimization, and Machine
Learning, , Reading: Addison-Wesley;
Gonçalves, J.F., Resende, M.G.C., An evolutionary algorithm for manufacturing cell
formation (2004) Computers & Industrial Engineering, 47 (2-3), pp. 247-273;
pp. 423-431;
pp. 2633-2646;
formation in generalised group technology (2005) International Journal of
manufacturing cell formation (2009) Computers & Industrial Engineering, 57 (3), pp.
1008-1014;
routing in group technology (1990) Engineering Optimization, 16 (3), pp. 235-245;
Saraç, T., Özçelik, F., A genetic algorithm for cell formation problem with
alternative routes (in Turkish (2006) Endüstri Mühendislig?i Dergisi, 17 (4), pp.
22-36;
manufacturing cell formation problems (2010) Journal of Intelligent
Manufacturing, , DOI: 10.1007/S10845-010-0446-8;
Sipahioglu, A., Saraç, T., The performance of the modified subgradient algorithm on
solving the 0-1 quadratic knapsack problem (2009) Informatica, 20 (2), pp. 1-12;
707-720;
routings in generalised group technology: Reducing the complexity of the solution
simulated annealing (1998) International Journal of Production Research, 36 (8),
pp. 2185-2207;
Vakharia, A.J., Wemmerlov, U., Designing a cellular manufacturing system: A
material flow approach based on operation sequences (1990) IIE Transactions, 22
(1), pp. 84-97;
problem in the presence of multiple process routes (1994) Engineering Optimisation,
22 (3), pp. 231-240;
Engineering, 32 (1), pp. 207-220;
(2009) Expert Systems with Applications, 36 (2), pp. 3652-3661
CORRESPONDENCE ADDRESS: Ozcelik, F.; Industrial Engineering Department, Eskisehir
Osmangazi University, Eskisehir, Turkey; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Safaei, N., Saidi-Mehrabad, M., Tavakkoli-Moghaddam, R., Sassani, F.

8886880300;18435197300;56491438400;6603781510;
A fuzzy programming approach for a cell formation problem with dynamic and
uncertain conditions
(2008) Fuzzy Sets and Systems, 159 (2), pp. 215-236. Cited 53 times.
35648995322&doi=10.1016%2fj.fss.2007.06.014&partnerID=40&md5=9778bb16d844fe04e3c205
dcf17faeef
DOI: 10.1016/j.fss.2007.06.014
Tehran, Iran;
Department of Mechanical Engineering, The University of British Columbia,
Vancouver, Canada
ABSTRACT: This paper presents an integration of explicit uncertainty for a cell
formation problem (CFP) with a dynamic condition in cellular manufacturing systems
(CMS). The dynamic condition indicates a multi-period planning horizon, in which
product mix and demand in each period are different. As a result, the best cells
designed for one period may not be the most efficient for subsequent periods and
thus require reconfigurations. Moreover, in real manufacturing systems, some input
parameters are fuzzy in nature. In such cases, the fluctuation in part demand and
the availability of manufacturing facilities in each period can also be regarded as
fuzzy. In this paper, a fuzzy programming-based approach is developed to solve an
extended mixed-integer programming model of the dynamic CFP, in which there are
piecewise fuzzy numbers as coefficients in the objective function and the
technological matrix. The main purpose of this paper is to determine the optimal
cell configuration in each period with the maximum degree of satisfying the fuzzy
objective under the given constraints. To illustrate the behavior of the proposed
model and verify the performance of the developed fuzzy programming-based approach,
we introduce a number of numerical examples to illustrate the use of the foregoing
approach. Finally, the related computational results are reported and discussed. ©
2007 Elsevier B.V. All rights reserved.
AUTHOR KEYWORDS: Dynamic cell formation problem; Fuzzy programming; Uncertain
condition
INDEX KEYWORDS: Computational methods; Mathematical models; Mathematical
programming; Matrix algebra; Parameter estimation; Problem solving, Cell
configuration; Cell formation problems; Cellular manufacturing systems;
Reconfigurations, Fuzzy systems
REFERENCES: Arikan, F., Gungor, Z., A parametric model for cell formation and
exceptional elements' problems with fuzzy parameters (2005) J. Intell.
Manufacturing, 16 (1), pp. 103-114;
cellular manufacturing systems (1997) IIE Trans., 29 (7), pp. 599-610;
planning horizons (2005) J. Manufacturing Technol. Management, 16 (5), pp. 516-530;

cellular manufacturing: A review and future directions (2007) European J. Oper.
Res., 177 (1), pp. 281-309;
Bellman, R.E., Zadeh, L.A., Decision-making in a fuzzy environment (1970)
Management Sci., 17 (4), pp. 141-164;
cell formation condition (1998) Ann. Oper. Res., 77, pp. 109-128;
genetic-algorithm-based heuristic (2006) Internat. J. Production Res., 44 (12), pp.
2421-2444;
Comput. Ind. Eng., 31 (1), pp. 139-142;
Gasimov, R.N., Yenilmez, K., Solving fuzzy linear programming problems with linear
membership functions (2002) Turkish J. Math., 26, pp. 375-396;
Harhalakis, G., Nagi, R., Proth, J.M., An effective heuristic in manufacturing cell
formation for group technology applications (1990) Internat. J. Production Res., 28
(1), pp. 185-198;
Herrera, F., Verdegay, J.L., Zimmermann, H.J., Boolean programming problems with
fuzzy constraints (1993) Fuzzy Sets and Systems, 55 (3), pp. 285-293;
designing machine cells under demand changes (2006) Comput. Oper. Res., 33 (1), pp.
263-283;
Kannan, V., Ghosh, S., Using dynamic cellular manufacturing to simplify scheduling
in cell based production systems (1995) Omega, 23 (4), pp. 443-452;
Klir, G.J., Yuan, B., (1995) Fuzzy Sets and Fuzzy Logic-Theory and Applications, ,
Prentice-Hall, Englewood Cliffs, NJ;
Lai, Y.-J., Hwang, C.-L., (1992) Fuzzy Mathematical Programming: Methods and
Applications, , Springer, Heidelberg;
cellular manufacturing system (1997) Comput. Ind. Eng., 33 (1), pp. 239-242;
dynamic model for a highly dynamic environment (1995) Comput. Ind. Eng., 29 (1-4),
pp. 221-225;
approach (2007) Internat. J. Adv. Manufacturing Technol., 33 (9-10), pp. 1001-1009;
programming approach (1999) Internat. J. Production Res., 37 (11), pp. 2545-2563;
Song, S.-J., Hitomi, K., Integrating the production planning and cellular layout
for flexible cellular manufacturing (1996) Prod Plan Control, 7 (6), pp. 585-593;
dynamic cell formation problem using metaheuristics (2005) Appl. Math. Comput., 170
(2), pp. 761-780;
Tsai, C.-C., Chu, C.-H., Barta, T.A., Modeling and analysis of a manufacturing cell
formation problem with fuzzy mixed integer programming (1997) IIE Trans., 29 (7),
pp. 533-547;
long-term demand changes: a methodology and investigation (1993) Decision Sci., 24
(5), pp. 909-929;
part populations (1999) IIE Trans., 31 (1), pp. 11-20;
Wilhelm, W., Chou, C.C., Chang, D.B., Integrating design and planning
considerations in cell formation (1998) Ann. Oper. Res., 77 (1), pp. 97-107;
CORRESPONDENCE ADDRESS: Safaei, N.; Department of Industrial Engineering, Iran
ISSN: 01650114
CODEN: FSSYD
ABBREVIATED SOURCE TITLE: Fuzzy Sets Syst
SOURCE: Scopus
Kamalakannan, R., Sudhakara Pandian, R.

57193093056;24173456100;
A Tabu Search strategy to solve cell formation problem with ratio level data
(2018) International Journal of Business Intelligence and Data Mining, 13 (1-3),
pp. 209-220. Cited 1 time.
85038412093&doi=10.1504%2fIJBIDM.2017.10004684&partnerID=40&md5=30d35e457f39a9f606d
5001fd3ba5dee
DOI: 10.1504/IJBIDM.2017.10004684
AFFILIATIONS: Department of Mechanical Engineering, Vickram College of Engineering,
Madurai, Tamil Nadu 630 561;
Department of Mechanical Engineering, SACS MAVMM Engineering College, Madurai,
Tamil Nadu 625 301, India
ABSTRACT: This paper concentrates on the cell formation problem for the ratio level
data to the design of cellular manufacturing system. The aim of this paper is to
identify the machine cells and part family and as a result to create production
cells in order to reduce the cell load variation. A competent Tabu Search (TS)
algorithm is proposed to investigate the search space of all possible solutions
with a chain of moves. This method is an iterative process for seeking a global
optimum for the discrete combinatorial optimisation problems. The ratio level data
is calculated in terms of time in seconds based on the data collected from the
processing time of the part, production volume of the part and availability of the
machine. A modified grouping efficiency (MGE) is used to compute the cell formation
problem. The results clearly indicated that this proposed TS yield good results
compared to the chosen benchmark problems. Copyright © 2018 Inderscience
Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation problem; MGE; Modified grouping efficiency;
Ratio level data; Tabu search algorithm
REFERENCES: Askin, R.G., Subramanian, S.P., A cost based heuristic for grouping
technology configuration (1987) International Journal of Production Research, 25
(1), pp. 101-113;
cellular manufacturing (1982) Journal of Manufacturing Systems, 1, pp. 65-75;
Research, 24 (2), pp. 451-464;
Research, 24 (5), pp. 1221-1233;
Foulds, L.R., French, A.P., Wilson, J.M., The sustainable cell formation problem:
Manufacturing cell creation with machine modification costs (2006) Computers &
George, A.P., Rajendran, C., Ghosh, S., An analytical-iterative clustering
algorithm for cell formation in cellular manufacturing systems with ordinal-level
and ratio-level data (2003) International Journal of Advanced Manufacturing
Technology, 22 (1), pp. 125-133;
Kashan, A.H., Karimi, B., Noktehdan, A., A novel discrete particle swarm
optimization algorithm for the manufacturing cell formation problem (2014)
King, J.R., Nakornchai, V., Machine- Component group formation in group technology:
pp. 117-133;
Kusiak, A., Chung, Y., GT/ART: Using neural networks to form machine cells (1992)
Manufacturing Review, 44, pp. 293-301;
Logendran, R., Karim, Y., Design of manufacturing cells in the presence of
alternative cell locations and material transporters (2003) Journal of The
Operational Research Society, 54 (10), pp. 1059-1075;
Mahapatra, S., Sudhakara, S., Pandian, R., Genetic cell formation using ratio level
data in cellular manufacturing systems (2008) International Journal of Advanced
McCormick, W.T., Schweitzer, J.P.J., White, T.W., Problem decomposition and data
reorganization by a clustering technique (1972) Operations Research, 20 (5), pp.
993-1009;
Mosier, C.T., Taube, L., Weighted similarity measure heuristics for the group
Onwubolu, G.C., Songore, V., A tabu search approach to cellular manufacturing
systems (2000) Production Planning and Control, 11 (2), pp. 153-164;
using neural networks (2009) Computers and Industrial Engineering, 56 (4), pp.
1340-1347;
Seifoddini, H., Duplication process in machine cells formation in group technology
(1989) IIE Transactions, pp. 382-388;
group technology (1986) IIE Transactions, 183, pp. 271-277;
Solimanpur, M., Elimi, A., A tabu search approach for cell scheduling problem with
makespan criterion (2013) International Journal of Production Economics, 141 (2),
pp. 639-645;
Srinivasan, G., Narendran, T.T., Mahedevan, M., An assignment model for the part-
Research, 29, pp. 463-478;
Venugopal, V., Narendran, T.T., A genetic algorithm approach to the machine-
Engineering, 22 (4), pp. 469-480;
MACE (1984) International Journal of Production Research, 22 (6), pp. 937-948
CORRESPONDENCE ADDRESS: Kamalakannan, R.; Department of Mechanical Engineering,
Vickram College of EngineeringIndia; email: [email protected]
PUBLISHER: Inderscience Enterprises Ltd.
ISSN: 17438187
ABBREVIATED SOURCE TITLE: Int. J. Bus. Intell. Data Min.
SOURCE: Scopus
Mahdavi, I., Tahami Baher, N., Teymourian, E.

16417373200;36702215800;36702181300;
A new cell formation problem with the consideration of multifunctional machines and
in-route machines dissimilarity - A two phase solution approach
(2010) Proceedings - 2010 IEEE 17th International Conference on Industrial
Engineering and Engineering Management, IE and EM2010, art. no. 5646569, pp. 475-
479. Cited 3 times.
78650616978&doi=10.1109%2fICIEEM.2010.5646569&partnerID=40&md5=9f618119992e169504d2
6dd932b50bab
DOI: 10.1109/ICIEEM.2010.5646569
AFFILIATIONS: Department of Industrial Engineering, Mazandaran University of
Science and Technology, Babol 47166-95635, Iran
ABSTRACT: The purpose of this paper is to develop a variety of cell formation
problem (CFP) that considers new concepts. Due to utilizing the machine flexibility
causing system flexibility, multifunctional machines are used in the CFP. Machine-
operation and part-operation are defined to introduce machine capabilities and part
requirements, respectively. A novel solution approach with two phases is presented
to solve the considered problem. First phase is a mathematical model proposed to
define machines grouping. This model is seeking to minimize in-route machines
dissimilarity. Second phase allocated to a heuristic method which assigns parts to
corresponding cells. For validation the presented solution approach some test
instances are solved: Two critical examples of CFP in [5], and a new one that
design to illustrate the complete characteristics of the considered problem.
Results show the capability of proposed approach in comparison with other methods
to solve the variety of cell formation problems. © 2010 IEEE.
AUTHOR KEYWORDS: Cell formation problem; Flexibility; Heuristic method; In-route
machines dissimilarity; Mathematical model
INDEX KEYWORDS: Cell formation problem; Flexibility; In-route machines
dissimilarity; Machine capabilities; Machine flexibility; Multifunctional machines;
Novel solutions; Second phase; Solution approach; System flexibility; Test
instances; Two phase, Cellular manufacturing; Heuristic methods; Industrial
engineering, Mathematical models
formation of manufacturing cells (2005) Computers and Industrial Engineering, 48
(1), pp. 3-21;
Chandrasekharan, M., Rajagopalan, R., Groupability: An analysis of the properties
Collet, S., Spicer, R., Improving productivity through cellular manufacturing
(1995) Production and Inventory Management Journal, 36 (1), pp. 71-75;
Mahdavi, I., Kaushal, O.P., Chandra, M., Graph-neural network approach in cellular
manufacturing on the basis of a binary system (2001) International Journal of
Papaioannou, Gr., Wilson, J.M., The evolution of cell formation problem
research European Journal of Operational Research, , in press;
Decision Sciences, 21, pp. 416-433;
Wemmerloï, U., Hyer, N.L., Cellular manufacturing in US industry: A survey of users
Won, Y.K., New p-median approach to cell formation with alternative process plans
Won, Y., Lee, K.C., Modified p-median approach for efficient GT cell formation
(2004) Computers and Industrial Engineering, 46, pp. 495-510;
(2009) Expert Systems with Applications, 36, pp. 3652-3661
CORRESPONDENCE ADDRESS: Mahdavi, I.; Department of Industrial Engineering,
Mazandaran University of Science and Technology, Babol 47166-95635, Iran; email:
[email protected]
ISBN: 9781424464814
ABBREVIATED SOURCE TITLE: Proc. - IEEE Int. Conf. Ind. Eng. Eng. Manage., IE EM
SOURCE: Scopus
Tunnukij, T., Hicks, C.

26031767200;7102667331;
An Enhanced Grouping Genetic Algorithm for solving the cell formation problem
32 times.
60749100440&doi=10.1080%2f00207540701673457&partnerID=40&md5=5010bb6845c9f4df9bf319
0437b0eed8
DOI: 10.1080/00207540701673457
AFFILIATIONS: Newcastle University Business School, Newcastle University, Newcastle
upon Tyne NE1 7RU, United Kingdom
ABSTRACT: Cell formation is often the first step in solving facility layout design
problems. The objective is to group part families and machines so that they can be
assigned to manufacturing cells. The cell formation problem is a non-deterministic
polynomial (NP) complete problem which means that the time taken to produce
solutions increases exponentially with problem size. This paper presents the
Enhanced Grouping Genetic Algorithm (EnGGA) that has been developed for solving the
cell formation problem. The EnGGA replaces the replacement heuristic in a standard
Grouping Genetic Algorithm with a Greedy Heuristic and employs a rank-based
roulette-elitist strategy, which is a new mechanism for creating successive
generations. The EnGGA was tested using well-known data sets from the literature.
The quality of the solutions was compared with those produced by other methods
using the grouping efficacy measure. The results show that the EnGGA is effective
and outperforms or matches the other methods.
AUTHOR KEYWORDS: Cell formation; Cellular manufacture; Clustering; Genetic
Algorithms; Group Technology; Meta-heuristics
INDEX KEYWORDS: Cellular manufacturing; Clustering algorithms; Flexible
manufacturing systems; Genetic algorithms; Heuristic algorithms; Heuristic methods;
Plant layout, Cell formation; Cell formation problems; Cellular manufacture;
Clustering; Complete problems; Data sets; Facility layout designs; Greedy
heuristic; Grouping genetic algorithms; Manufacturing cells; Meta-heuristics; New
mechanisms; Part families; Problem sizes, Group technology
REFERENCES: Adenso-Diaz, B., Lozano, S., Racero, J., Guerrero, F., Machine cell
formation in generalized Group Technology (2001) Computers & Industrial
Adil, G.K., Rajamani, D., Strong, D., Cell formation considering alternate routings
Aljaber, N., Baek, W., Chen, C.-L., Tabu search approach to the cell formation
problem (1997) Computers & Industrial Engineering, 32, pp. 169-185;
Askin, R.G., Subramanian, S.P., Cost-based heuristic for Group Technology
configuration (1987) International Journal of Production Research, 25, pp. 101-113;

systems, , New York: Wiley;
Aytug, H., Khouja, M., Vergara, F.E., Use of Genetic Algorithms to solve production
and operations management problems: A review (2003) International Journal of
Ballakur, A., Stendel, H.J., A within-cell utilization based heuristic for
Research, 25, pp. 639-665;
Boctor, F.F., Minimum-cost, machine-part cell formation problem (1996)
Boe, W.J., Cheng, C.H., Close neighbour algorithm for designing cellular
2097-2116;
Brown, E.C., Sumichrast, R.T., CF-GGA: A Grouping Genetic Algorithm for the cell
3651-3669;
Brown, E.C., Sumichrast, R.T., Impact of the replacement heuristic in a Grouping
Genetic Algorithm (2003) Computers & Operations Research, 30, pp. 1575-1593;
Brown, E.C., Sumichrast, R.T., Evaluating performance advantages of Grouping
Genetic Algorithms (2005) Engineering Applications of Artificial Intelligence, 18,
p. 12;
Carrie, A.S., Numerical taxonomy applied to Group Technology and plant layout
Chandrasekharan, M.P., Rajagopalan, R., Ideal seed non-hierarchical clustering
Research, 24, pp. 451-464;
Chandrasekharan, M.P., Rajagopalan, R., MODROC: An extension of Rank Order
Clustering for Group Technology (1986) International Journal of Production
Research, 24, pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC-an algorithm for concurrent
of binary data matrices for Group Technology (1989) International Journal of
Cheng, C.H., Gupta, Y.P., Lee, W.H., Wong, K.F., TSP-based heuristic for forming
Research, 36, pp. 1325-1337;
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., (2001) Introduction to
algorithms, , Cambridge, MA: MIT Press;
De Lit, P., Falkenauer, E., Delchambre, A., Grouping Genetic Algorithms: An
efficient method to solve the cell formation problem (2000) Mathematics and
Computers in Simulation, 51, pp. 257-271;
Dimopoulos, C., Zalzala, A.M.S., Recent developments in evolutionary computation
Transactions on Evolutionary Computations, 4, pp. 93-113;
Falkenauer, E., (1998) Genetic algorithms and grouping problems, , New York: Wiley;
Gallagher, C.C., Knight, W.A., (1973) Group technology, , London: Butterworth;

Gallagher, C.C., Knight, W.A., (1986) Group technology production methods in
manufacture, , New York: Wiley;
Glover, F., Tabu search-Part I (1989) ORSA Journal of Computers, 1, pp. 190-206;
Goldberg, D.E., (1989) Genetic algorithms in search, optimisation and machine
learning, , Reading, MA: Addison-Wesley;
Goncalves, J.F., Resende, M.G.C., An evolutionary algorithm for manufacturing cell
Gupta, T., Seifoddini, H., Production data based similarity coefficient for
machinecomponent grouping decisions in the design of a cellular manufacturing
system (1990) International Journal of Production Research, 28, pp. 1247-1269;
Gupta, Y., Gupta, M., Kumar, A., Sundaram, C., A Genetic Algorithm-based approach
to cell composition and layout design problems (1996) International Journal of
Heragu, S.S., Gupta, Y.P., Heuristic for designing cellular manufacturing
facilities (1994) International Journal of Production Research, 32, pp. 125-140;
Hicks, C., A Genetic Algorithm tool for designing manufacturing facilities in the
capital goods industry (2004) International Journal of Production Economy, 90, pp.
199-211;
Holland, J.H., (1975) Adaptation in natural and artificial systems, , Ann Arbor,
MI: University of Michigan Press;
Hu, L., Yasuda, K., Minimising material handing cost in cell formation with
alternative processing routes by Grouping Genetic Algorithm (2006) International
Hwang, H., Sun, J.-U., Genetic-algorithm-based heuristic for the GT cell formation
problem (1996) Computers & Industrial Engineering, 30, pp. 941-955;
Hyer, N.L., Wemmerlov, U., Group Technology and productivity (1984) Harvard
Business Review, 62, pp. 140-149;
Islam, K.M.S., Sarker, B.R., A similarity coefficient measure and machine-parts
grouping in cellular manufacturing systems (2000) International Journal of
James, T.L., Brown, E.G., Keeling, K.B., A hybrid Grouping Genetic Algorithm for
the cell formation problem (2007) Computers & Operations Research, 34, pp. 2059-
2079;
Joines, J.A., Culbreth, C.T., King, R.E., Manufacturing cell design: An integer
programming model employing Genetic Algorithms (1996) HE Transactions (Institute of
Industrial Engineerings), 28, pp. 69-85;
King, J.R., Machine-component grouping in production flow-analysis - an approach
using a Rank Order Clustering-Algorithm (1980) International Journal of Production
Research, 18, pp. 213-232;
King, J.R., Nakornchai, V., Machine-component group formation in Group Technology -
review and extension (1982) International Journal of Production Research, 20, pp.
117-133;
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., Optimization by Simulated Annealing
(1983) Science, 220, pp. 671-680;
Kumar, C.S., Chandrasekharan, M.P., Grouping efficacy-a quantitative criterion for
goodness of block diagonal forms of binary matrices in Group Technology (1990)
International Journal of Production research, 28, pp. 233-243;
Kumar, K.R., Vannelli, A., Strategic subcontracting for efficient disaggregate
1728;
Kusiak, A., Generalized Group Technology concept (1987) International Journal of
Kusiak, A., Cho, M., Similarity coefficient algorithms for solving the Group
Technology problem (1992) International Journal of Production Research, 30, pp.
2633-2646;
McAuley, J., Machine grouping for efficiency production (1972) Product Engineering,
51, pp. 53-57;
McCormick, W.T., Schweitzer, P.J., White, T.W., Problem decomposition and data
1009;
Mitchell, M., (1996) An introduction to genetic algorithms, , Cambridge, MA: MIT
Press;
Moon, C., Gen, M., A Genetic Algorithm-based approach for design of independent
manufacturing cells (1999) International Journal of Production economy, 60, pp.
421-426;
Pierreval, H., Caux, C., Paris, J.L., Viguier, F., Evolutionary approaches to the
design and organization of manufacturing systems (2003) Computers & Industrial
Plaquin, M.-F., Pierreval, H., Cell formation using evolutionary algorithms with
certain constraints (2000) International Journal of Production Economy, 64, pp.
267-278;
Rajagopalan, R., Batra, J.L., Design of cellular production systems: A graph-
theoretic approach (1975) International Journal of Production Research, 13, pp.
567-579;
Rao, H.A., Pham, S.N., Gu, P., Genetic Algorithms-based approach for design of
manufacturing systems: An industrial application (1999) International Journal of
Reeves, C.R., Genetic Algorithm for flowshop sequencing (1995) Computers &
Operations Rcesearch, 22, pp. 5-13;
Sarker, B.R., Resemblance coefficients in Group Technology: A survey and
comparative study of relational metrics (1996) Computers & Industrial Engineerings,
30, pp. 103-116;
Seifoddini, H., Note on the similarity coefficient method and the problem of
Seifoddini, H., Wolfe, P.M., Application of the Similarity Coefficient Method in
Group Technology (1986) HE Transactions, 18, pp. 271-277;
manufacturing. Part I. A survey (1993) International Journal of Production
Research, 31, pp. 1133-1142;
Singh, N., Design of cellular manufacturing systems: An invited review (1993)
707-720;
Srinivasan, G., A clustering-algorithm for machine cell-formation in Group
Technology using minimum spanning-trees (1994) International Journal of Production
Research, 32, pp. 2149-2158;
Srinivasan, G., Narendran, T.T., Mahadevan, B., An assignment model for the part-
families problem in Group Technology (1990) International Journal of Production
Research, 28, pp. 145-152;
Srinivasan, G., Narendran, T.T., GRAFICS. A nonhierarchical clustering algorithm
for Group Technology (1991) International Journal of Production Research, 29, pp.
463-478;
Tsai, C.-C., Chu, C.-H., Barta, T.A., Modeling and analysis of a manufacturing cell
formation problem with fuzzy mixed-integer programming (1997) IIE Transactions
(Institute of Industrial Engineerings), 29, pp. 533-547;
Uddin, M.K., Shanker, K., Grouping of parts and machines in presence of alternative
process routes by Genetic Algorithm (2002) International Journal of Production
Economy, 76, pp. 219-228;
Venugopal, V., Narendran, T.T., Genetic Algorithm approach to the machine-component
grouping problem with multiple objectives (1992) Computers & Industrial
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the US industry: A survey of
users (1989) International Journal of Production Research, 27, pp. 1511-1530;
part populations (1999) HE Transactions (Institute of Industrial Engineerings), 31,
pp. 11-20;
Won, Y., Two-phase approach to GT cell formation using efficient p-median
formulations (2000) International Journal of Production Research, 38, pp. 1601-
1613;
Yasuda, K., Hu, L., Yin, Y., A Grouping Genetic Algorithm for the multi-objective
cell formation problem (2005) International Journal of Production Research, 43, pp.
829-853;
Zolfaghari, S., Liang, M., Comparative study of Simulated Annealing, Genetic
Algorithms and Tabu search for solving binary and comprehensive machine-grouping
problems (2002) International Journal of Production Research, 40, pp. 2141-2158
CORRESPONDENCE ADDRESS: Hicks, C.; Newcastle University Business School, Newcastle
University, Newcastle upon Tyne NE1 7RU, United Kingdom; email:
[email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Wu, T.-H., Chung, S.-H., Chang, C.-C.

7404814990;12239511500;57142825500;
A water flow-like algorithm for manufacturing cell formation problems
times.
76949085945&doi=10.1016%2fj.ejor.2010.01.020&partnerID=40&md5=cb7906541c3812c98362c
97f8cccecfc
DOI: 10.1016/j.ejor.2010.01.020
ABSTRACT: Available research on the manufacturing cell formation problem shows that
most solution approaches are either single- or multiple-solution-agent-based, with
a fixed size of solution agents. Frequent problems encountered during the process
of solving the cell formation problem include solutions being easily trapped in
local optima and bad solution efficiency. Yang and Wang [Yang, F.-C., Wang, Y.-P.,
2007. Water flow-like algorithm for object grouping problems. Journal of the
Chinese Institute of Industrial Engineers, 24 (6), 475-488] proposed the water
flow-like algorithm (WFA) to overcome the shortcomings of single- and multiple-
solution -agent-based algorithms. WFA has the features of multiple and dynamic
numbers of solution agents, and its mimicking of the natural behavior of water
flowing from higher to lower levels coincides exactly with the process of searching
for optimal solutions. This paper therefore adopts the WFA logic and designs a
heuristic algorithm for solving the cell formation problem. Computational results
obtained from running a set of 37 test instances from the literature and newly
created have shown that the proposed algorithm has performed better than other
benchmarking approaches both in solution effectiveness and efficiency, especially
in large-sized problems. The superiority of the proposed WFACF over other
approaches from the literature should be attributed to the collaboration of the WFA
logic, the proposed prior estimation of the cell size, and the insertion-move. The
WFA is a novel heuristic approach that deserves more attention. More attempts on
adopting the WFA logic to solve many other combinatorial optimization problems are
highly recommended. © 2010 Elsevier B.V. All rights reserved.
AUTHOR KEYWORDS: Cell formation; Heuristics; Manufacturing; Meta-heuristics
INDEX KEYWORDS: Agent based; Cell formation; Cell formation problem; Cell size;
Combinatorial optimization problems; Computational results; Fixed size; Grouping
problem; Heuristic approach; Institute of Industrial Engineers; Local optima;
Manufacturing cell formation; Meta heuristics; Optimal solutions; Solution
approach; Test instances; Water flows, Combinatorial optimization; Computational
efficiency; Flexible manufacturing systems; Flow of water; Heuristic algorithms;
Heuristic methods; Hydraulics; Industrial research, Cellular manufacturing
REFERENCES: Askin, R.G., Subramanian, S., A cost-based heuristic for group
technology configuration (1987) International Journal of Production Research, 25,
pp. 101-113;
Boe, W., Cheng, C.H., A close neighbor algorithm for designing cellular
pp. 2097-2116;
Cao, D., Chen, M., Using penalty function and Tabu search to solve cell formation
problems with fixed cell cost (2004) Computers and Operations Research, 31, pp. 21-
37;
Carrie, S., Numerical taxonomy applied to group technology and plant layout (1973)
cellular manufacture (1982) Journal of Manufacturing System, 1, pp. 65-75;
Research, 24 (2), pp. 451-464;
Chandrashekharan, M.P., Rajagopalan, R., MODROC: An extension of rank order
Research, 24 (5), pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC - An algorithm for concurrent
formation of part families and machine cells (1987) International Journal of
Production Research., 25 (6), pp. 835-850;
Chandrasekharan, M.P., Rajagopalan, R., Groupability: An analysis of the properties
Chen, J.-S., Heragu, S.S., Stepwise decomposition approaches for large scale cell
formation problems (1999) European Journal of Operational Research, 113, pp. 64-79;
Research, 36, pp. 1325-1337;
Dougherty, D.E., Marryott, R.A., Optimal groundwater management (1991) Water
Resources Research, 27, pp. 2493-2508;
formation problem (2006) International Journal of Production Economics, 102, pp. 1-
21;
Gen, M., Cheng, R., (2000) Genetic Algorithm and Engineering Optimization, , John
Wiley and Sons pp. 8-16;
2079;
Research, 18 (2), pp. 213-232;
pp. 117-133;
1715-1728;
397;
2633-2646;
McAuley, J., Machine grouping for efficient production (1972) Production
1009;
implementation (1985) Omega, 13 (6), pp. 381-391;
Onwubulo, G.C., Mutingi, M., A genetic algorithm approach to cellular manufacturing
systems (2001) Computers and Industrial Engineering, 39, pp. 125-144;
Seifoddini, H., Single linkage versus average linkage clustering in machine cells
formation applications (1989) Computers and Industrial Engineering, 16 (3), pp.
419-426;
Seifoddini, H., Wolfe, P.M., Selection of a threshold value based on material
handling cost in the machine-component grouping (1987) IIE Transactions, 19, pp.
266-270;
Srinivasan, G., Narendran, T., Mahadevan, B., An assignment model for part-families
problem in group technology (1990) International Journal of Production Research,
28, pp. 145-152;

pp. 1609-1617;
Yang, F.-C., Wang, Y.-P., Water flow-like algorithm for object grouping problems
(2007) Journal of the Chinese Institute of Industrial Engineers, 24 (6), pp. 475-
488;
152;
Yasuda, K., Yin, Y., A dissimilarity measure for solving the cell formation problem
in cellular manufacturing (2001) Computers and Industrial Engineering, 39, pp. 1-
17;
Economics, 101, pp. 329-352
[email protected]
ISSN: 03772217
CODEN: EJORD
SOURCE: Scopus
Husseinzadeh Kashan, A., Karimi, B., Noktehdan, A.

57205429605;57193142554;35520149000;
A novel discrete particle swarm optimization algorithm for the manufacturing cell
formation problem
1543-1556. Cited 19 times.
84905679323&doi=10.1007%2fs00170-014-5906-
4&partnerID=40&md5=5b221e336f48e00bbd85909eb8ab14e3
DOI: 10.1007/s00170-014-5906-4
AFFILIATIONS: Department of Industrial Engineering, Faculty of Engineering, Tarbiat
Modares University, Tehran, Iran;
Department of Industrial Engineering, Amirkabir University of Technology, P.O. box:
15875-4413, Tehran, Iran;
Department of Industrial Engineering, Iran University of Science and Technology
(IUST), Tehran, Iran
ABSTRACT: The manufacturing cell formation problem, with the aim of grouping parts
into families and machines into cells, is considered with the objective of
maximizing grouping efficacy. A new solution approach based on the particle swarm
optimization (PSO) algorithm is presented for the problem. Unlike the original PSO
algorithm which works with arithmetic operators and scalars, the new algorithm uses
group-based operators, in place of arithmetic operators, in the body of the
updating equations analogous to those of the classical PSO equations (given the
fact that the cell formation problem is essentially a grouping problem, all
operators in the new algorithm work with constructed cells (groups) rather than
parts/machines (objects), isolatedly). We benchmark a set of 40 test problem
instances from previous researches and do comparisons between the new algorithm and
existing algorithms. We also compare the performance of our algorithm when it is
hybridized with a local search module. Our computations reveal that the proposed
algorithm performs well on all test problems, exceeding or matching the best
solution's quality presented in the literature. © 2014 Springer-Verlag London.
AUTHOR KEYWORDS: Cell formation problem; Group technology; Grouping genetic
algorithm; Particle swarm optimization
INDEX KEYWORDS: Cellular manufacturing; Flexible manufacturing systems; Genetic
algorithms; Group technology; Particle swarm optimization (PSO), Cell formation
problem; Discrete particle swarm optimization algorithm; Grouping efficacy;
Grouping genetic algorithms; Grouping problem; Manufacturing cell formation;
Particle swarm optimization algorithm; Solution approach, Algorithms
REFERENCES: De Lit, P., Falkenauer, E., Delchambre, A., Grouping genetic
algorithms: An efficient method to solve the cell formation problem (2000) Math
Comput Simul, 51, pp. 257-271., 10.1016/S0378-4754(99)00122-6;
Brown, E.C., Sumichrast, R., CF-GGA: A grouping genetic algorithm for the cell
formation problem (2001) Int J Prod Res, 36, pp. 3651-3669.,
10.1080/00207540110068781;
Vin, E., De Lit, P., Delchamber, A., A multiple-objective grouping genetic
algorithm for the cell formation problem with alternative routings (2005) J Intell
Manuf, 16, pp. 189-205., 10.1007/s10845-004-5888-4;
the cell formation problem (2007) Comput Oper Res, 34, pp. 2059-2079., 1189.90210
10.1016/j.cor.2005.08.010;
Falkenauer, E., New representation and operators for GAs applied to grouping
problems (1994) Evol Comput, 2, pp. 123-144., 10.1162/evco.1994.2.2.123;
(1991) Int J Prod Res, 29, pp. 343-356., 10.1080/00207549108930075;
Wu, T.H., Chang, C.C., Chung, S.H., A simulated annealing algorithm to
manufacturing cell formation problems (2008) Expert Syst Appl, 34, pp. 1609-1617.,
10.1016/j.eswa.2007.01.012;
Kumar, C., Chandrasekharan, M.P., Grouping efficacy: A quantitative criterion for
goodness of block diagonal forms of binary matrix in group technology (1990) Int J
Prod Res, 28, pp. 233-243., 10.1080/00207549008942706;
formation (2004) Comput Ind Eng, 47, pp. 247-273., 10.1016/j.cie.2004.07.003;
Evaluation and directions for future research (1998) Comput Ind Eng, 34, pp. 3-20.,
10.1016/S0360-8352(97)00147-2;
users (1989) Int J Prod Res, 27, pp. 1511-1530., 10.1080/00207548908942637;
Krushinsky, D., Goldengorin, B., An exact model for cell formation in group
technology (2012) Comput Manag Sci, 9, pp. 323-338., 1273.05177 2967539;
Goldengorin, B., Krushinsky, D., Slomp, J., Flexible PMP approach for large size
cell formation (2012) Oper Res, 60, pp. 1157-1166., 1262.90202 2998886
10.1287/opre.1120.1108;
Ghosh, T., Sengupta, S., Chattopadhyay, M., Dan, K.P., Meta-heuristics in cellular
manufacturing: A state-of-art review (2011) Int J Ind Eng Comput, 2, pp. 87-122;
Eng, 28, pp. 485-494., 10.1016/0360-8352(94)00185-P;
formation in generalized group technology (2005) Int J Prod Res, 19, pp. 4035-
4047., 10.1080/00207540500151283;
Pailla, A., Trindade, A., Parada, V., Ochi, L., A numerical comparison between
(2010) Expert Syst Appl, 37, pp. 5476-5483., 10.1016/j.eswa.2010.02.064;
Stawowy, A., Evolutionary strategy for manufacturing cell design (2006) Omega, Int
J Manag Sci, 34, pp. 1-18., 10.1016/j.omega.2004.07.016;
Elbenani, B., Ferland, J., Bellemare, J., Genetic algorithm and large neighborhood
search to solve the cell formation problem (2012) Expert Syst Appl, 39, pp. 2408-
2414., 10.1016/j.eswa.2011.08.089;
Cheng, C., Gupa, Y., Lee, W.A., TSP-based heuristic for forming machine groups and
part families (1998) Int J Prod Res, 36, pp. 1325-1337., 0947.90567
10.1080/002075498193345;
Boulif, M., Atif, K., A new branch-&-bound-enhanced genetic algorithm for the
manufacturing cell formation problem (2006) Comput Oper Res, 33, pp. 2219-2245.,
1086.90057 10.1016/j.cor.2005.02.005;
Ateme-Nguema, B., Dao, T., Optimization of cellular manufacturing systems design
using the hybrid approach based on the ant colony and tabu search techniques (2007)
Proceedings of the IEEE IEEM, pp. 668-673;
Ateme-Nguema, B., Dao, T., Quantized Hopfield networks and tabu search for
manufacturing cell formation problems (2009) Int J Prod Econ, 121, pp. 88-98.,
10.1016/j.ijpe.2008.04.015;
Anvari, M., Mehrabad, M., Barzinpour, F., Machine-part cell formation using a
hybrid particle swarm optimization (2010) Int J Adv Manuf Technol, 47, pp. 745-
754., 10.1007/s00170-009-2202-9;
cell formation problems (2010) Eur J Oper Res, 205, pp. 346-360., 1188.90281
10.1016/j.ejor.2010.01.020;
manufacturing using ant-colony-based optimization (2010) Int J Adv Manuf Technol,
50, pp. 1135-1144., 10.1007/s00170-010-2587-5;
Prabhaharan, G., Muruganandam, A., Asokan, P., Girish, B.S., Machine cell formation
for cellular manufacturing systems using an ant colony system approach (2005) Int J
Adv Manuf Technol, 25, pp. 1013-1019., 10.1007/s00170-003-1927-0;
heuristic for the cell formation problem in Group Technology (2013) Springer
Proceedings in Mathematics & Statistics, 32, pp. 11-50., Goldengorin B et al (eds)
Models, algorithms, and technologies for network analysis;
Kennedy, J., Eberhard, R.C., Particle swarm optimization (1995) Proceedings of IEEE
International Conference on Neural Networks, pp. 1942-1948., Piscataway, NJ, USA;
Kennedy, J., Eberhard, R.C., A discrete binary version of the particle swarm
algorithm (1997) Proceedings of IEEE Conference on Systems, Man, and Cybernetics,
pp. 4104-4109., Piscataway, NJ, USA;
Laskari, E.C., Parsopoulos, K.E., Vrahatis, M.N., Particle swarm optimization for
integer programming (2002) Proceedings of the IEEE 2002 Congress on Evolutionary
Computation, pp. 1582-1587., Honolulu (HI);
Heragu, S.S., (1997) Facility Design, , PWS Publishing Company Boston;
Husseinzadeh Kashan, A., Karimi, B., Jolai, F., Effective hybrid genetic algorithm
for minimizing makespan on a single-batch-processing machine with non-identical job
sizes (2006) Int J Prod Res, 44, pp. 2337-2360., 10.1080/00207540500525254;
Review and extension (1982) Int J Prod Res, 20, pp. 117-133.,
10.1080/00207548208947754;
MACE (1984) Int J Prod Res, 22, pp. 937-948., 10.1080/00207548408942513;
Seifiddini, H., A note on the similarity coefficient method and the problem of
improper machine assignment in group technology applications (1989) Int J Prod Res,
27, pp. 1161-1165., 10.1080/00207548908942614;
technology problem (1992) Int J Prod Res, 30, pp. 2633-263346.,
10.1080/00207549208948181;
Manuf Syst, 6, pp. 117-124., 10.1016/0278-6125(87)90035-5;
Seifiddini, H., Wolf, P.M., Application of the similarity coefficient method in
group technology (1986) IIIE Trans, 18, pp. 271-277., 10.1080/07408178608974704;
clustering for group technology (1986) Int J Prod Res, 24, pp. 1221-1233.,
10.1080/00207548608919798;
algorithm for cellular manufacturing (1986) Int J Prod Res, 24, pp. 451-463.,
0582.90050 10.1080/00207548608919741;
implementation (1985) OMEGA, 13, pp. 381-391., 10.1016/0305-0483(85)90066-0;
cellular manufacturing (1982) J Manuf Syst, 1, pp. 65-74., 10.1016/S0278-
6125(82)80068-X;
configuration (1987) Int J Prod Res, 25, pp. 101-113., 10.1080/00207548708919825;
Econ, 9, pp. 73-81., 10.1016/0167-188X(85)90012-6;
reorganization by a clustering technique (1972) Oper Res, 20, pp. 993-1009.,
0249.90046 10.1287/opre.20.5.993;
Srinivasan, G., Narendran, T., Mahadevan, B., An assignment model for the Part-
families problem in group technology (1990) Int J Prod Res, pp. 145-152;
using a rank order clustering algorithm (1980) Int J Prod Res, 18, pp. 213-232.,
10.1080/00207548008919662;
(1973) Int J Prod Res, 11, pp. 399-416., 10.1080/00207547308929988;
technology machine clustering problem (1985) OMEGA, 13, pp. 577-583., 10.1016/0305-
0483(85)90046-5;
manufacturing systems (1986) Eur J Oper Res, 24, pp. 387-397., 10.1016/0377-
2217(86)90032-9;
manufacturing systems (1991) Int J Prod Res, 29, pp. 2097-2116., 0729.90577
10.1080/00207549108948069;
of binary data matrices for group technology (1989) Int J Prod Res, 27, pp. 1035-
1052., 10.1080/00207548908942606;
manufacturing (1983) Int J Prod Res, 25, pp. 1715-1728;
formation of part families and machine cells (1987) Int J Prod Res, 25, pp. 835-
850., 0623.90030 10.1080/00207548708919880;
systems (2001) Comput Ind Eng, 39, pp. 125-144., 10.1016/S0360-8352(00)00074-7;
Srinivasan, G., Narendran, T., GRAFICS - A nonhierarchical clustering-algorithm for
group technology (1991) Int J Prod Res, 29, pp. 463-478., 10.1080/00207549108930083
CORRESPONDENCE ADDRESS: Karimi, B.; Department of Industrial Engineering, Amirkabir
University of Technology, P.O. box: 15875-4413, Tehran, Iran; email:
[email protected]
PUBLISHER: Springer-Verlag London Ltd
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Wu, T.-H., Chang, C.-C., Chung, S.-H.

7404814990;57142825500;12239511500;
A simulated annealing algorithm for manufacturing cell formation problems
(2008) Expert Systems with Applications, 34 (3), pp. 1609-1617. Cited 116 times.
37349104750&doi=10.1016%2fj.eswa.2007.01.012&partnerID=40&md5=3f4767ad71939cb548d92
bc109467f76
DOI: 10.1016/j.eswa.2007.01.012
AFFILIATIONS: Department of Industrial Engineering and Systems Management, Feng
Chia University, 100, Wenhwa Road, Seatwen, Taichung 407, Taiwan;
ABSTRACT: The cell formation problem determines the decomposition of the
cells to process one or more part families so that each cell is operated
independently and the intercellular movements are minimized or the number of parts
flow processed within cells is maximized. In this study, a simple yet effective
simulated annealing-based approach, SACF, is proposed to solve the cell formation
problem. Considerable efforts are devoted to the design of parts and machine
assignment procedures to direct SACF to converge to solutions with good values of
grouping efficacy. A set of 25 test problems with various sizes drawn from the
literature is used to test the performance of the proposed heuristic algorithm. The
corresponding results are compared to several well-known algorithms published. The
comparative study shows that the proposed SACF algorithm improves the grouping
efficacy for 72% of the test problems. The proposed algorithm should thus be useful
to both practitioners and researchers. © 2007 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Cell formation problem; Grouping efficacy; Simulated annealing
INDEX KEYWORDS: Agile manufacturing systems; Problem solving; Production control;
Simulated annealing, Cell formation problem; Grouping efficacy; Intercellular
movements, Algorithms
REFERENCES: Aljaber, N., Baek, W., Chen, C.-L., A tabu search approach to the cell
formation problem (1997) Computers and Industrial Engineering, 32, pp. 169-185;
pp. 2097-2116;
Research, 24 (2), pp. 451-464;
Research, 24 (5), pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., Groupability: an analysis of the properties
Research, 36, pp. 1325-1337;
Research, 18 (2), pp. 213-232;
397;
1715-1728;
2633-2646;
manufacturing cell design (1999) Computers and Industrial Engineering, 36, pp. 379-
389;
theoretical approach (1975) International Journal of Production Research, 13, pp.
256-268;
419-426;
cellular manufacturing (1990) International Journal of Production Research, 28, pp.
2075-2084;
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the US industry: a survey of
1409-1421
CORRESPONDENCE ADDRESS: Wu, T.-H.; Department of Industrial Engineering and Systems
Management, Feng Chia University, 100, Wenhwa Road, Seatwen, Taichung 407, Taiwan;
email: [email protected]
ISSN: 09574174
CODEN: ESAPE
SOURCE: Scopus
Ahi, A., Ashtiani, B., Aryanezhad, M.-B., Makui, A.

23974500100;23007891600;35615819500;23975046700;
An investigation on the Multiple Attribute Decision Making (MADM) methods for
solving the cell formation problem
(2007) IEEM 2007: 2007 IEEE International Conference on Industrial Engineering and
Engineering Management, art. no. 4419282, pp. 709-712.
40649127237&doi=10.1109%2fIEEM.2007.4419282&partnerID=40&md5=34b50ce187acb6fd80977d
d336683956
DOI: 10.1109/IEEM.2007.4419282
AFFILIATIONS: Young Researchers Club (YRC), Islamic Azad University, Tehran, Iran;
Tehran, Iran
ABSTRACT: This paper deals with the cell formation problem that is the first step
in designing cellular manufacturing system (CMS). The previous methods that were
based on the array-based clustering for solving the cell formation problem have
used the part-machine incidence matrix (PMIM) which was indicated the set of
machines for processing each part. The main problem of these methods is the
grouping parts and machines regardless of production volume, operational sequences,
production cost, inventory and other production system's limitations. In this paper
we intend to implement the multiple attribute decision making (MADM) concepts for
covering the cause of drawback in the previous array-based clustering methods by
considering two definitions of the arrays in PMIM. Four methods are presented that
two methods are related to the binary arrays in PMIM and other two methods are
considered the operational time as well as the operational sequencing in the
definition of the arrays in PMIM. The results of the presented methods that are
compared with a well-known approach are also reported. © 2007 IEEE.
AUTHOR KEYWORDS: Cell formation; Multiple attribute decision making (MADM); SAW;
TOPSIS
INDEX KEYWORDS: Cluster analysis; Decision making; Operating costs; Problem
solving; Production engineering, Cell formation problem; Multiple attribute
decision making (MADM), Cellular manufacturing
REFERENCES: McCormick, W.T., Schweitzer, P.J., White, T.W., Problem decomposition
data reorganization by a clustering technique (1972) Operation Research, 20 (5),
pp. 993-1009;
Research, 18 (2), pp. 213-232;
manufacturing (1982) Journal of Manufacturing Systems, 1 (1), pp. 65-67;
manufacturing cell formation problem (2006) Computers & operations research, 33,
pp. 2219-2245;
Chandrasekharan, M.P., Rajagopolan, R., An ideal seed non-hierarchical clustering
Research, 24 (2), pp. 451-464;
Kumar, C.S., Chandrasekharan, M.P., Grouping efficacy a quantitative criterion for
International Journal of Production Research, 28 (2), pp. 233-243
CORRESPONDENCE ADDRESS: Ahi, A.; Young Researchers Club (YRC), Islamic Azad
University, Tehran, Iran
ISBN: 1424415292; 9781424415298

ABBREVIATED SOURCE TITLE: IEEM IEEE Int. Conf. Ind. Eng. Eng. Manage.
SOURCE: Scopus
Zettam, M.
57188555455;
A discrete gravitational search algorithm for solving the cell formation problem
(2018) Intelligent Decision Technologies, 12 (3), pp. 335-348.
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85058958121&doi=10.3233%2fIDT-
180339&partnerID=40&md5=203998a81908623c4af5dc05f0371983
DOI: 10.3233/IDT-180339
AFFILIATIONS: Informatics, Systems and Optimization Laboratory, Department of
Computer Science, Faculty of Science, Ibn Tofail University, Kenitra, Morocco
ABSTRACT: Nowadays, the cellular manufacturing system is thriving into the
industrial field due to the higher provided profits and quality of products.
Moreover, the manufacturing cell formation problem is considered as the most
studied implementation of the cellular manufacturing system. Therefore, a novel
gravitational Search Algorithm was introduced and applied to the cell formation
problem in this paper. According to the obtained results, the novel gravitational
Search Algorithm provides good quality solutions with a reasonable computational
time. In the original discrete Gravitational Search Algorithm the exploration
strategy was performed by means of a mutation operator applied several times to a
solution. To decrease the complexity of the algorithm and the computational time a
crossover operator; equivalent to the application of the mutation operator for a
number of times; is presented. A modified Local Search algorithm is performed to
seek more extensively the solution space. The performance of the novel
Gravitational Search Algorithm adaptation was evaluated on a set of 35 benchmarks
from the literature. According to the obtained results and to the comparative
study, the novel Gravitational Search Algorithm is considered as one of the best
algorithms. © 2018 - IOS Press and the authors. All rights reserved.
AUTHOR KEYWORDS: Cell formation problem; gravitational search algorithm; local
search
INDEX KEYWORDS: Benchmarking; Cells; Computational complexity; Cytology; Learning
algorithms; Local search (optimization), Cell formation problem; Comparative
studies; Exploration strategies; Gravitational search algorithms; Local search;
Local search algorithm; Manufacturing cell formation; Mutation operators, Cellular
manufacturing
REFERENCES: Parashar, B.S.N., (2008) Cellular Manufacturing Systems: An Integrated
Approach, , PHI Learning Pvt. Ltd;
Suresh, N.C., Kay, J.M., Group technology and cellular manufacturing: Updated
perspectives (1998) Group Technology and Cellular Manufacturing, pp. 1-14., Suresh
NC, Kay JM, eds, Springer US;
research (2010) Eur. J. Oper. Res, 206 (3), pp. 509-521;
Singh, N., Design of cellular manufacturing systems: An invited review (1993) Eur.
J. Oper. Res. Sep, 69 (3), pp. 284-291;
Ghosh, T., Sengupta, S., Chattopadhyay, M., Dan, P.K., Metaheuristics in cellular
manufacturing: A state-of-The-art review (2011) Int. J. Ind. Eng. Comput. Jan, 2
(1), pp. 87-122;
technology (2012) Comput. Manag. Sci. Aug, 9 (3), pp. 323-338;
cell formation (2012) Oper. Res. Oct, 60 (5), pp. 1157-1166;
Elbenani, B., Ferland, J.A., Centre interuniversitaire de recherche sur les réseaux
d'entreprise, la logistique et le transport (2012) Cell Formation Problem Solved
Exactly with the Dinkelbach Algorithm, , Montréal: CIRRELT;
Ballakur, A., Steudel, H.J., A within-cell utilization based heuristic for
designing cellular manufacturing systems (1987) Int. J. Prod. Res, 25 (5), pp. 639-
665;
Dowlatshahi, M.B., Nezamabadi-Pour, H., Mashinchi, M., A discrete gravitational
search algorithm for solving combinatorial optimization problems (2014) Inf. Sci.
Feb, 258, pp. 94-107;
Chandrasekharan, M.P., Rajagopalan, R., Zodiac-An algorithm for concurrent
formation of part-families and machine-cells (1987) Int. J. Prod. Res, 25 (6), pp.
835-850;
Srinivasan, G., Narendran, T.T., Grafics-A nonhierarchical clustering algorithm for
group technology (1991) Int. J. Prod. Res, 29 (3), pp. 463-478;
cell formation problems (2010) Eur. J. Oper. Res. Sep, 205 (2), pp. 346-360;
formation (2004) Comput Ind Eng, 47 (2-3), pp. 247-273;
formation problem (2012) TOP. Oct, 20 (3), pp. 679-706;
machine groups and part families (1998) Int. J. Prod. Res, 36 (5), pp. 1325-1337;
grouping (2009) Comput. Ind. Eng. Feb, 56 (1), pp. 347-356;
systems (2001) Comput. Ind. Eng. Feb, 39 (1-2), pp. 125-144;
Noktehdan, A., Karimi, B., Kashan, A.H., A differential evolution algorithm for the
manufacturing cell formation problem using group based operators (2010) Expert
Syst. Appl. Jul, 37 (7), pp. 4822-4829;
machine-part cell formation problems (2010) Comput. Oper. Res. Dec, 37 (12), pp.
2071-2081;
the cell formation problem (2007) Comput. Oper. Res. Jul, 34 (7), pp. 2059-2079;
Wu, T.H., Chang, C.C., Chung, S.H., A simulated annealing algorithm for
manufacturing cell formation problems (2008) Expert Syst. Appl. Apr, 34 (3), pp.
1609-1617;
Expert Syst. Appl. Apr, 36 (3), pp. 6598-6604;
Wu, T.H., Chang, C.C., Yeh, J.Y., A hybrid heuristic algorithm adopting both
Boltzmann function and mutation operator for manufacturing cell formation problems
(2009) Int. J. Prod. Econ. Aug, 120 (2), pp. 669-688;
Tunnukij, C.H.T., An enhanced grouping genetic algorithm for solving the cell
formation problem (2009) Int. J. Prod. Res, 47, pp. 1989-2007;
(2010) Expert Syst. Appl. Jul, 37 (7), pp. 5476-5483;
algorithm with variable neighbourhood (2011) Eur. J. Ind. Eng. Jan, 5 (1), pp. 22-
42;
Keeling, K.B., Brown, E.C., James, T.L., Grouping efficiency measures and their
impact on factory measures for the machinepart cell formation problem: A simulation
study (2007) Engineering Applications of Artificial Intelligence, 20 (1), pp. 63-
78;
Sarker, B.R., Measures of grouping efficiency in cellular manufacturing systems
Elbenani, B., Ferland, J.A., Bellemare, J., Genetic algorithm and large
neighbourhood search to solve the cell formation problem (2012) Expert Systems with
Applications, 39 (3), pp. 2408-2414;
Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S., GSA: A gravitational search
algorithm (2009) Information Sciences, 179 (13), pp. 2232-2248;
Krause, J., Cordeiro, J., Parpinelli, R.S., Lopes, H.S., A survey of swarm
algorithms applied to discrete optimization problems (2013) Swarm Intelligence and
Bio-inspired Computation: Theory and Applications. Elsevier Science and Technology
Books, pp. 169-191;
Dowlatshahi, M.B., Nezamabadi-Pour, H., Mashinchi, M., A discrete gravitational
search algorithm for solving combinatorial optimization problems (2014) Information
Sciences, 258, pp. 94-107;
(2004) The International Journal of Advanced Manufacturing Technology, 23 (11-12),
pp. 916-924;
Rojas, W., Solar, M., Chacon, M., Ferland, J., An efficient genetic algorithm to
solve the manufacturing cell formation problem (2004) Adaptive Computing in Design
and Manufacture VI. Springer, London, pp. 173-183;
Glover, F., Tabu search-part I (1989) ORSA Journal on Computing, 1 (3), pp. 190-
206;
Glover, F., Tabu search-part II (1990) ORSA Journal on Computing, 2 (1), pp. 4-32;
835-850;
cell formation problems (2010) Eur. J. Oper. Res. Sep, 205 (2), pp. 346-360;
formation (2004) Comput Ind Eng, 47 (2-3), pp. 247-273;
formation problem (2012) TOP. Oct, 20 (3), pp. 679-706;
grouping (2009) Comput. Ind. Eng. Feb, 56 (1), pp. 347-356;
systems (2001) Comput. Ind. Eng. Feb, 39 (1-2), pp. 125-144;
Syst. Appl. Jul, 37 (7), pp. 4822-4829;
machine-part cell formation problems (2010) Comput. Oper. Res. Dec, 37 (12), pp.
2071-2081;
the cell formation problem (2007) Comput. Oper. Res. Jul, 34 (7), pp. 2059-2079;
manufacturing cell formation problems (2008) Expert Syst. Appl. Apr, 34 (3), pp.
1609-1617;
Expert Syst. Appl. Apr, 36 (3), pp. 6598-6604;
(2009) Int. J. Prod. Econ. Aug, 120 (2), pp. 669-688;
Tunnukij, C.H.T., An enhanced grouping genetic algorithm for solving the cell
formation problem (2009) Int. J. Prod. Res, 47, pp. 1989-2007;
(2010) Expert Syst. Appl. Jul, 37 (7), pp. 5476-5483;
algorithm with variable neighbourhood (2011) Eur. J. Ind. Eng. Jan, 5 (1), pp. 22-
42;
Zettam, M., Elbenani, B., Gravitational search algorithm applied to the cell
formation problem (2016) Nature-Inspired Computation in Engineering. Springer
International Publishing, pp. 251-266;
Zettam, M., An hybrid gravitational method for solving the cell formation problem
(2017) Journal of Theoretical and Applied Information Technology, 95 (20)
CORRESPONDENCE ADDRESS: Zettam, M.; Informatics, Systems and Optimization
Laboratory, Department of Computer Science, Faculty of Science, Ibn Tofail
UniversityMorocco; email: [email protected]
PUBLISHER: IOS Press
ISSN: 18724981
ABBREVIATED SOURCE TITLE: Intelligent Decis. Technol
SOURCE: Scopus
Aliasgari, M., Kazemi, M., Kia, R., Ebrahimi, A.

57210614436;53881475500;24461690200;57188831515;
Minimizing exceptional elements and voids in a cell formation problem with optimal
number of cells
84963642239&partnerID=40&md5=4f51994cd615fb9cfb6c9dde0d42ad93
AFFILIATIONS: Department of Mathematics, Roudehen Branch, Islamic Azad University,

Roudehen, Iran;
Department of Industrial Engineering, Birjand University of Technology, Birjand,
Iran;
Department of Industrial Engineering, Firoozkooh Branch, Islamic Azad University,
Firoozkooh, Iran
ABSTRACT: In this paper, a mathematical model with a weighted multi-objective
function is formulated to find the machine cells and part families in a cell
formation problem. Three considered objectives are minimizing the total number of
exceptional elements and voids and total forming costs of cells. These objectives
are combined with giving weights to them. Simultaneously minimizing both of
exceptional elements and voids within the objective function makes a trade-off
between inter-cell and intra-cell movements to decrease the dependence of cells and
to increase the utilization of the machines. The proposed model has the advantage
of finding the optimal number of cells which has not yet considered in the most
studies implemented in the literature of cell formation problem. This feature
provides the flexibility for the model to from cells in different numbers to reach
the minimum sum of exceptional elements and voids. Several numerical test problems
taken from the literature are performed to verify the performance of the proposed
model in comparison to the previous models. The numerical examples show that
obtained results are better than those in the literature in terms of the sum of
exceptional elements and voids or grouping efficacy.
AUTHOR KEYWORDS: Cell formation problem; Exceptional elements; Mathematical
model; Voids
INDEX KEYWORDS: Cells; Cytology; Economic and social effects; Functions;
Mathematical models, Cell formation problem; Exceptional elements; Grouping
efficacy; Multi-objective functions; Numerical tests; Objective functions; Optimal
number; Voids, Cellular manufacturing
REFERENCES: Arkat, A., Hosseini, L., Hosseinabadi Farahani, M., Minimization of
exceptional elements and voids in the cell formation problem using a multi-
objective genetic algorithm (2011) Expert Systems with Applications, 38, pp. 9597-
9602;
Ban Banerjee, I., Das, P., Group technology based adaptive cell formation using
predator-prey genetic algorithm (2012) Applied Soft Computing, 12, pp. 559-572;
Boctor, F.F., A linear formulation of the machine-part cell formation for articles:
Problem (1991) International Journal of Production Research, 29 (2), pp. 343-356;
Chen, S.J., Cheng, C.S., A neural network based cell formation algorithm in
cellular manufacturing (1995) International Journal of Production Research, 33 (2),
pp. 293-318;
Chandrasekharan, M.P., Rajagopalan, R., MODROC: An extension of rankorder
Research, 24 (5), pp. 1221-1264;
Research, 24 (2), pp. 451-464;
Ham, I., Hitomi, K., Yashida, T., (1985) Group Technology Applications to
Production Management, , Kluwer-Nijho: Boston, MA;
Research, 18, pp. 213-232;
King, R.E., Nakornchai, V., Machine-component group formation in group technology:
pp. 117-133;
pp. 2633-2646;
Mahdavi, I., Aalaei, A., Paydar, M.M., Solimanpur, M., A new mathematical model for
integrating all incidence matrices in multi-dimensional cellular manufacturing
system (2011) Journal of Manufacturing Systems;
Expert Systems with Applications, 36, pp. 6598-6604;
Mansouri, S.A., Moattar-Hussein, S.M., Newman, S.T., A review of the modern
Research, 38 (5), pp. 1201-1218;
Moiser, C.T., Taube, L., Weighted similarity measure heuristics for the group
Seifodini, H., Wolfe, P.M., Application of the similarity coefficient method in
Review, evaluation and direction for research (1998) Computers and Industrial
EDITORS: Kacem I.

SOURCE: Scopus
Arkat, J., Hosseini, L., Farahani, M.H.

55912953100;36925239500;36990344200;
Minimization of exceptional elements and voids in the cell formation problem using
a multi-objective genetic algorithm
79953703677&doi=10.1016%2fj.eswa.2011.01.161&partnerID=40&md5=ecbb3eb667ab3e53e9c96
c8a633dd967
DOI: 10.1016/j.eswa.2011.01.161
AFFILIATIONS: Department of Industrial Engineering, University of Kurdistan,
Pasdaran Blvd., Sanandaj, Iran
ABSTRACT: Cell formation problem is the main issue in designing cellular
manufacturing systems. The most important objective in the cell formation problem
is to minimize the number of exceptional elements which helps to reduce the number
of intercellular movements. Another important but rarely used objective function is
to minimize the number of voids inside of the machine cells. This objective
function is considered in order to increase the utilization of the machines. We
present a bi-objective mathematical model to simultaneously minimize the number of
exceptional elements and the number of voids in the part machine incidence matrix.
An -constraint method is then applied to solve the model and to generate the
efficient solutions. Because of the NP-hardness of the model, the optimal
algorithms can not be used in large-scale problems and therefore, we have also
developed a bi-objective genetic algorithm. Some numerical examples are considered
to illustrate the performance of the model and the effectiveness of the solution
algorithms. The results demonstrate that in comparison with the -constraint method,
the proposed genetic algorithm can obtain efficient solution in a reasonable run
time. © 2011 Published by Elsevier Ltd.
AUTHOR KEYWORDS: -constraint method; Cell formation problem; Exceptional
elements; Multi-objective genetic algorithm; Voids
INDEX KEYWORDS: Cell formation problem; Constraint methods; Exceptional elements;
Multi-objective genetic algorithm; Voids, Genetic algorithms; Mathematical models;
Multiobjective optimization, Cellular manufacturing
REFERENCES: Adil, G.K., Rajamani, D., Strong, D., Cell formation considering
alternate routeings (1996) International Journal of Production Research, 34 (5),
pp. 1361-1380;
Ballakur Arvind, Steudel Harold, J., A within-cell based heuristic for designing
25 (5), pp. 639-665;
Burbidge, J.L., (1979) Group Technology in Engineering Industry, , Mechanical
Engineering Publications, Ltd. London;
Chankong, V., Haimes, Y., (1983) Multiobjective Decision Making: Theory and
Methodology, , Elsevier Science New York;
Cohon, J.L., (1978) Multiobjective Programming and Planning, , Academic New York;
S0925527306001137;
Deb, K., (2001) Multi-objective Optimization Using Evolutionary Algorithms, , Wiley
New York;
Ehrgott, M., (2005) Multicriteria Optimization, , 2nd ed. Springer Berlin
Heidelberg New York;
Gao, L., Zhang, J., Li, P., Shao, X., Manufacturing cell formation using genetic
algorithm (2001) Proceeding of the 17th International Conference on Computer-aided
Production Engineering, pp. 419-422;
Haimes, Y., Lasdon, L., Wismer, D., On a bicriterion formulation of the problems of
integrated system identification and system optimization (1971) IEEE Transactions
on Systems, Man and Cybernetics, 1 (3), pp. 296-297;
Jabalameli, M.S., Arkat, J., Barzinpour, F., Modelling the effects of machine
of Advanced Manufacturing Technology, 39 (7), pp. 838-850;
(2007) Applied Mathematics and Computation, 190 (1), pp. 662-670., DOI
10.1016/j.amc.2007.01.060, PII S0096300307001014;
Expert Systems with Application, 36 (3), pp. 6598-6604;
Economics, 101 (2), pp. 329-352., DOI 10.1016/j.ijpe.2005.01.014, PII
S0925527305000496
CORRESPONDENCE ADDRESS: Arkat, J.; Department of Industrial Engineering, University
of Kurdistan, Pasdaran Blvd., Sanandaj, Iran; email: [email protected]
ISSN: 09574174
CODEN: ESAPE
SOURCE: Scopus
Utkina, I., Batsyn, M.

57191223664;37111907600;
A branch and bound algorithm for the cell formation problem
(2016) Springer Proceedings in Mathematics and Statistics, 156, pp. 115-124. Cited
1 time.
3-319-29608-1_7&partnerID=40&md5=33bcee6712d5cfb9e5a367b12bc45304
DOI: 10.1007/978-3-319-29608-1_7
AFFILIATIONS: Laboratory of Algorithms and Technologies for Networks Analysis,
National Research University Higher School of Economics, 136, Rodionova Str.,
Nizhny Novgorod, Russian Federation
ABSTRACT: The cell formation problem (CFP) is an NP-hard optimization problem
considered for cell manufacturing systems. Because of its high computational
complexity several heuristics have been developed for solving this problem. In this
paper we present a branch and bound algorithm which provides exact solutions of the
CFP. This algorithm finds optimal solutions for 13 problems of the 35 popular
benchmark instances from the literature. © Springer International Publishing
Switzerland 2016.
AUTHOR KEYWORDS: Branch and bound algorithm; Cell formation problem;
Combinatorial optimization; Exact solution; NP-hard problems; Upper bound
INDEX KEYWORDS: Benchmarking; Branch and bound method; Cells; Cellular
manufacturing; Combinatorial optimization; Complex networks; Computational
complexity; Cytology; Manufacture; Problem solving, Branch-and-bound algorithms;
Cell formation problem; Exact solution; NP-hard; Optimal solutions; Optimization
problems; Upper Bound, Optimization
REFERENCES: Askin, R.G., Subramanian, S.P., A cost-based heuristic for group
technology configuration (1987) Int. J. Prod. Res, 25 (1), pp. 101-113;
designing cellular manufacturing systems (1987) Int. J. Prod. Res, 25, pp. 639-655;

(1991) Int. J. Prod. Res, 29 (2), pp. 343-356;
Burbidge, J.L., The new approach to production (1961) Prod. Eng, 40, pp. 3-19;
Bychkov, I., Batsyn, M., Pardalos, P., Exact model for the cell formation problem
(2014) Optim. Lett, 8, pp. 2203-2210;
cellular manufacture (1982) J. Manuf. Syst, 1 (1), pp. 64-76;
clustering for group technology (1986) Int. J. Prod. Res, 24 (5), pp. 1221-1233;
algorithm for cellular manufacturing (1986) Int. J. Prod. Res, 24 (2), pp. 451-464;
Chandrasekharan, M.P., Rajagopalan, R., Groupability: Analysis of the properties of

binary data matrices for group technology (1989) Int. J. Prod. Res, 27 (6), pp.
1035-1052;
Flanders, R.E., Design manufacture and production control of a standard machine
(1925) Trans. ASME, 46, pp. 691-738;
Hsu, C.P., (1990) Similarity Coefficient Approaches to Machine-Component Cell
Formation in Cellular Manufacturing: A Comparative Study, , Ph.D. Thesis,
Department of Industrial and Manufacturing Engineering, University of Wisconsin
Milwaukee;
the cell formation problem (2007) Comput. Oper. Res, 34 (7), pp. 2059-2079;
using a rank order clustering algorithm (1925) Int. J. Prod. Res, 18 (2), pp. 213-
232;
goodness of block diagonal forms of binary matrices in group technology (1990) Int.
J. Prod. Res, 28 (2), pp. 233-243;
Kusiak, A., The generalized group technology concept (1987) Int. J. Prod. Res, 25
(4), pp. 561-569;
Manuf. Syst, 6 (2), pp. 117-124;
Mitrofanov, S.P., (1959) Nauchnye Osnovy Gruppovoy Tekhnologii, 435p., Lenizdat,
Leningrad, (in Russian);
improper machine assignment in group technology applications (1989) Int. J. Prod.
Res, 27 (7), pp. 1161-1165;
Stanfel, L., Machine clustering for economic production (1985) Eng. Costs Prod.
Econ, 9, pp. 73-81;
MACE (1984) Int. J. Prod. Res, 22, pp. 937-948
CORRESPONDENCE ADDRESS: Utkina, I.; Laboratory of Algorithms and Technologies for
Networks Analysis, National Research University Higher School of Economics, 136,
Rodionova Str., Russian Federation; email: [email protected]
EDITORS: Kalyagin V.A., Koldanov P.A., Pardalos P.M.
PUBLISHER: Springer New York LLC
ISSN: 21941009
ISBN: 9783319296067
ABBREVIATED SOURCE TITLE: Springer Proc. Math. Stat.
SOURCE: Scopus
Yin, Y., Xu, C., Hu, L.

35739337500;55245057300;55470175000;
Some insight into Yasuda et al 's. "a grouping genetic algorithm for the multi-
objective cell formation problem"
(2009) International Journal of Production Research, 47 (7), pp. 2009-2010. Cited 2
times.
60749096344&doi=10.1080%2f00207540701805661&partnerID=40&md5=f12a0dd45fa895e93d70a8
61e01cc983
DOI: 10.1080/00207540701805661
AFFILIATIONS: Department of Economics and Business Management, Yamagata University,
1-4-12 Kojirakawa-cho, Yamagata-shi 990-8560, Japan;
Department of Management Information Science, Chiba Institute of Technology, Chiba
275-0016, Japan;
Graduate School of Economics and Management, Tohoku University, Kawauchi, Aoba-ku,
Sendai 980-8576, Japan
ABSTRACT: Yasuda et al. (2005, International Journal of Production Research, 43,
829-853) proposed an efficient method for solving the multi-objective cell
formation problem. The objectives of their model are to minimize both the cell load
variation and intercell flows. In this technical note, we point out and correct an
error in their model. The efficacy of their grouping genetic algorithm is not
influenced by the modified model.
AUTHOR KEYWORDS: Cell formation; Cellular manufacture; Genetic algorithm; Group
technology
INDEX KEYWORDS: Cellular manufacturing; Genetic algorithms; Mobile
telecommunication systems; Multiobjective optimization; Wireless telecommunication
systems, Cell formation; Cell load variations; Cellular manufacture; Efficient
methods; Grouping genetic algorithms; Intercell; Modified models; Multi-objective
cell formation problems; Production researches; Technical notes, Group technology
REFERENCES: Yasuda, K., Hu, L., Yin, Y., A grouping genetic algorithm for the
multi-objective cell formation problem (2005) International Journal of Production
Research, 43, pp. 829-853
CORRESPONDENCE ADDRESS: Yin, Y.; Department of Economics and Business Management,
Yamagata University, 1-4-12 Kojirakawa-cho, Yamagata-shi 990-8560, Japan; email:
[email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Bychkov, I., Batsyn, M.

55842563400;37111907600;
An efficient exact model for the cell formation problem with a variable number of
production cells
(2018) Computers and Operations Research, 91, pp. 112-120. Cited 6 times.
85034441173&doi=10.1016%2fj.cor.2017.11.009&partnerID=40&md5=ce5ffdb59e433e3c71a3e8
e684922833
DOI: 10.1016/j.cor.2017.11.009
AFFILIATIONS: Laboratory of Algorithms and Technologies for Network Analysis,
National Research University Higher School of Economics, 136 Rodionova, Nizhniy
Novgorod, 603093, Russian Federation
ABSTRACT: The Cell Formation Problem has been studied as an optimization problem in
manufacturing for more than 90 years. It consists of grouping machines and parts
into manufacturing cells in order to maximize loading of cells and minimize
movement of parts from one cell to another. Many heuristic algorithms have been
proposed which are doing well even for large-sized instances. However, only a few
authors have aimed to develop exact methods and most of these methods have some
major restrictions such as a fixed number of production cells for example. In this
paper we suggest a new mixed-integer linear programming model for solving the cell
formation problem with a variable number of manufacturing cells. The popular
grouping efficacy measure is used as an objective function. To deal with its
fractional nature we apply the Dinkelbach approach. Our computational experiments
are performed on two testsets: the first consists of 35 well-known instances from
the literature and the second contains 32 instances less popular. We solve these
instances using CPLEX software. Optimal solutions have been found for 63 of the 67
considered problem instances and several new solutions unknown before have been
obtained. The computational times are greatly decreased comparing to the state-of-
art approaches. © 2017 Elsevier Ltd
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing; Fractional
objective; Grouping efficacy; Two-index model
INDEX KEYWORDS: Cells; Cytology; Flexible manufacturing systems; Heuristic
algorithms; Integer programming; Manufacture; Optimization, Cell formation problem;
Computational experiment; Fractional objective; Grouping efficacy; Index models;
Mixed integer linear programming model; Objective functions; Optimization problems,
Cellular manufacturing
alternate routeings (1996) Int. J. Prod. Res., 34 (5), pp. 1361-1380;
Askin, R.G., Subramanian, S., A cost-based heuristic for group technology
configuration (1987) Int. J. Prod. Res., 25 (1), pp. 101-113;
Boctor, F., A jinear formulation of the machine-part cell formation problem (1991)
Int. J. Prod. Res., 29 (2), pp. 343-356;
manufacturing systems (1991) Int. J. Prod. Res., 29 (10), pp. 2097-2116;
Boutsinas, B., Machine-part cell formation using biclustering (2013) Eur. J. Oper.
Res., 230, pp. 563-572;
Brown, E.C., Sumichrast, R.T., CF-GGA: a grouping genetic algorithm for the cell
Brusco, M.J., An exact algorithm for maximizing grouping efficacy in part-machine
clustering (2015) IIE Trans., 47 (6), pp. 653-671;
Burbidge, J.L., The new approach to production (1961) Prod. Eng, , December, 3-19;
Bychkov, I., Batsyn, M., Sukhov, P., Pardalos, P.M., Heuristic algorithm for the
cell formation problem (2013) Models, Algorithms, and Technologies for Network
Analysis, Springer Proceedings in Mathematics & Statistics, 59, pp. 43-69;
Bychkov, I.S., Batsyn, M.V., Pardalos, P.M., Exact model for the cell formation
problem (2014) Optim. Lett., 8 (8), pp. 2203-2210;
(1973) Int. J. Prod. Res., 11, pp. 399-416;
cellular manufacture (1982) J. Manuf. Syst., 1 (1), pp. 64-76;
Chandrasekaran, M.P., Rajagopalan, R., An ideal seed non-hierarchical clustering
algorithm for cellular manufacturing (1986) Int. J. Prod. Res., 24, pp. 451-463;
Chandrasekaran, M.P., Rajagopalan, R., MODROC: an extension of rank order
clustering of group technology (1986) Int. J. Prod. Res., 24 (5), pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC - an algorithm for concurrent
formation of part families and machine cells (1987) Int. J. Prod. Res., 25 (6), pp.
835-850;
of binary data matrices for group technology (1989) Int. J. Prod. Res., 27 (6), pp.
1035-1052;
Dinkelbach, W., On nonlinear fractional programming (1967) Manage. Sci., 13 (7),
pp. 492-498;
Elbenani, B., Ferland, J.A., Cell Formation Problem Solved Exactly with the
Dinkelbach Algorithm (2012), pp. 1-14., CIRRELT-2012-07. Montreal. Quebec;
formation (2004) Comput. Ind. Eng., 47 (2-3), pp. 247-273;
Ham, I., Hitomi, K., Yoshida, T., Layout planning for group technology (1985) Group
Technology, International Series in Management Science/Operations Research, pp.
153-169;
under random product demand (1994) Int. J. Prod. Res., 32 (1), pp. 47-64;
grouping in cellular manufacturing systems (2000) Int. J. Prod. Res., 38 (3), pp.
699-720;
using a rank order clustering algorithm (1980) Int. J. Prod. Res., 18 (2), pp. 213-
232;
review and extension (1982) Int. J. Prod. Res., 20 (2), pp. 117-133;
technology (1984) Comput. Manag. Sci., 9 (3), pp. 323-338;
Kumar, K.R., Chandrasekharan, M.P., Grouping efficacy: a quantitative criterion for
J. Prod. Res., 28 (2), pp. 233-243;
manufacturing systems (1986) Eur. J. Oper. Res., 24, pp. 387-397;
manufacturing (1987) Int. J. Prod. Res., 25 (12), pp. 1715-1728;
technology problem (1992) Int. J. Prod. Res., 30, pp. 2633-2646;
Kusiak, A., Chow, W., Efficient solving of the group technology problem (1987) J.
Manuf. Syst., 6 (2), pp. 117-124;
Li, M.L., The algorithm for integrating all incidence matrices in multi-dimensional
group technology (2003) Int. J. Prod. Econ., 86, pp. 121-131;
reorganization by a clustering technique (1972) Oper. Res., 20 (5), pp. 993-1009;
Mitrofanov, S.P., The Scientific Principles of Group Technology (1966), National
Lending Library Translation Boston Spa, Yorkshire Translation of Mitrofanov (1959);
techniques (1992) J. Manuf. Syst., 11 (3), pp. 149-159;
Nair, G.J., Accord: a Bicriterion algorithm for cell formation using ordinal and
ratio-level data (1999) Int. J. Prod. Res., 37 (3), pp. 539-556;
Pa Rkin, R.E., Li, M.-L., The multi-dimensional aspects of a group technology
algorithm (1997) Int. J. Prod. Res., 35 (8), pp. 2345-2358;
Pinheiro, R.G.S., Martins, I.C., Protti, F., Ochi, L.S., Simonetti, L.G.,
Subramanian, A., On solving manufacturing cell formation via bicluster editing
(2016) Eur. J. Oper. Res., 254 (3), pp. 769-779;
Nagi, R., Harhalakis, G., Proth, J.-M., Multiple routings and capacity
considerations in group technology applications (1990) Int. J. Prod. Res., 28 (12),
pp. 1243-1257;
Sandbothe, R.A., Two observations on the grouping efficacy measure for goodness of
block diagonal forms (1998) Int. J. Prod. Res., 36 (11), pp. 3217-3222;
(2001) Eur. J. Oper. Res., 130, pp. 588-611;
Sarker, B.R., Khan, M., A comparison of existing grouping efficiency measures and a
new weighted grouping efficiency measure (2001) IIE Trans., 33, pp. 11-27;
Seifoddini, H., Comparison between single linkage and average linkage clustering
techniques in forming machine cells (1988) Comput. Indus. Eng., 15, pp. 210-216;
Res., 27 (7), pp. 1161-1165;
Seifoddini, H., Djassemi, M., The production data-based similarity coefficient
versus Jaccard's similarity coefficient (1991) Comput. Indus. Eng., 21, pp. 263-
266;
Seifoddini, H., Djassemi, M., The threshold value of a quality index for formation
of cellular manufacturing systems (1996) Int. J. Prod. Res., 34 (12), pp. 3401-
3416;
group technology (1986) IIE Trans., 18 (3), pp. 271-277;
Shargal, M., Shekhar, S., Irani, S.A., Evaluation of search algorithms and
clustering efficiency measures for machine-part matrix clustering (1995) IIE
Trans., 27 (1), pp. 43-59;
families problem in group technology (1990) Int. J. Prod. Res., 28 (1), pp. 145-
152;
Econ., 9, pp. 73-81;
Viswanathan, S., A new approach for solving the p-median problem in group
technology (1996) Int. J. Prod. Res., 34 (10), pp. 2691-2700;
MACE (1984) Int. J. Prod. Res., 22, pp. 937-948;
technology problem with multiple process routings (1997) Comput. Ind. Eng., 32 (1),
pp. 207-220;
modified ART1 method (2008) Eur. J. Oper. Res., 188, pp. 140-152;
Zolfaghari, S., Liang, M., An objective-guided ortho-synapse hopfield network
approach to machine grouping problems (1997) Int. J. Prod. Res., 35 (10), pp. 2773-
2792;
problems (2002) Int. J. Prod. Res., 40 (9), pp. 2141-2158
CORRESPONDENCE ADDRESS: Bychkov, I.; Laboratory of Algorithms and Technologies for
Network Analysis, National Research University Higher School of Economics, 136
Rodionova, Russian Federation; email: [email protected]
ISSN: 03050548
CODEN: CMORA
SOURCE: Scopus
Rabbani, M., Habibnejad-Ledari, H., Rafiei, H., Farshbaf-Geranmayeh, A.

57208701862;57126456600;27967949000;54896341800;
A bi-objective mathematical model for dynamic cell formation problem considering
learning effect, human issues, and worker assignment
(2016) Scientia Iranica, 23 (5), pp. 2341-2354. Cited 1 time.
85013841189&partnerID=40&md5=f8444975d81e2b656bfe88b1f01ba65a
AFFILIATIONS: School of Industrial Engineering, College of Engineering, University

of Tehran, Tehran, Iran
ABSTRACT: One of the important aspects neglected in the literature related to cell
formation problem is human issues. In this study, a bi-objective mathematical model
is developed in which human issues and dynamic cell formation are taken into
consideration simultaneously. The first objective function deals with costs
associated with machines and human issues. The costs of human issues relate to
salary, hiring, firing, reward/penalty policy, and worker assignment. The second
objective function takes into account labor utilization as a criterion for
reward/penalty policy. Since the available time in different real conditions is not
constant, we include learning effect to consider the real workers time. The nature
of dynamic cell formation problem is NP-hard, and thus a Linear Programming
embedded Genetic Algorithm (LP-GA) is employed to solve the model. In order to
improve the performance of the applied GA, its parameters are tuned by means of
Central Composite Design (CCD) method. Moreover, to validate the LP-GA, some test
problems are solved and the results are compared with those obtained from an exact
method and GA. The computational results show that the near optimal solutions
yielded by LP-GA are better than GA in large-sized problems. © 2016 Sharif
University of Technology. All rights reserved.
AUTHOR KEYWORDS: Central composite design; Dynamic cell formation; Genetic
algorithm; Human issues; Linear programming
INDEX KEYWORDS: Cells; Compensation (personnel); Cytology; Genetic algorithms;
Linear programming, Cell formation problem; Central composite designs;
Computational results; Dynamic cell formation; Human issues; Near-optimal
solutions; Objective functions; Worker assignments, Cellular manufacturing, genetic
algorithm; labor; learning; linear programing; model validation; numerical model;
policy analysis
REFERENCES: Aryanezhad, M.B., Deljoo, V., Mirzapour Al-E-Hashem, S.M.J., Dynamic
cell formation and the worker assignment problem: A new model (2009) Int. J. Adv.
Manuf. Tech., 41 (3-4), pp. 329-342;
formation considering labor utilization (2013) Appl. Math. Model., 37 (4), pp.
2308-2316;
Rafiei, H., Rabbani, M., Koushan, M., Effect of motivation and learning curve in
dynamic cell formation and the worker assignment problem (2012) Int. J. Eng. Sci.
Res. Tech., 1 (9), pp. 481-497;
Bidanda, B., Ariyawongrat, P., Needy, K.L., Norman, B.A., Tharmmaphornphilas, W.,
Human related issues in manufacturing cell design, implementation, and operation: A
review and survey (2005) Comput. Ind. Eng., 48 (3), pp. 507-523;
genetic algorithm-based heuristic (2006) Int. J. Prod. Res., 44 (12), pp. 2421-
2444;
generalized cell formation problem considering machine layout and supplier
selection (2014) Int. J. Comput. Integr. Manuf., 27 (8), pp. 772-786;
Jabal-Ameli, M.S., Moshref-Javadi, M., Concurrent cell formation and layout design
using scatter search (2014) Int. J. Adv. Manuf. Tech., 71 (1-4), pp. 1-22;
approach (2014) Int. J. Adv. Manuf. Tech., 70 (9-12), pp. 1635-1652;
Bootaki, B., Mahdavi, I., Paydar, M.M., A hybrid GA-AUGMECON method to solve a
cubic cell formation problem considering different worker skills (2014) Comput.
Ind. Eng., 75, pp. 31-40;
Paydar, M.M., Saidi-Mehrabad, M., A hybrid genetic-variable neighborhood search
algorithm for the cell formation problem based on grouping efficacy (2013) Comput.
Oper. Res., 40 (4), pp. 980-990;
manufacturing using ant-colony-based optimization (2010) Int. J. Adv. Manuf. Tech.,
50 (9-12), pp. 1135-1144;
Lian, J., Liu, G., Li, W., Evans, S., Yin, Y., Formation of independent
manufacturing cells with the consideration of multiple identical machines (2014)
Int. J. Prod. Res., 52 (5), pp. 1363-1400;
Rezazadeh, H., Mahini, R., Zarei, M., Solving a dynamic virtual cell formation
problem by linear programming embedded particle swarm optimization algorithm (2011)
Appl. Soft. Comput., 11 (3), pp. 3160-3169;
optimization algorithm for the manufacturing cell formation problem (2014) Int. J.
Adv. Manuf. Tech., 73 (9-12), pp. 1543-1556;
Saxena, L.K., Jain, P.K., Dynamic cellular manufacturing systems design: A
comprehensive model (2011) Int. J. Adv. Manuf. Tech., 53 (1-4), pp. 11-34;
objective scatter search for a dynamic cell formation problem (2009) Comput. Oper.
Res., 36 (3), pp. 777-794;
grouping efficacy-based genetic algorithm (2014) Int. J. Prod. Res., 52 (12), pp.
3504-3517;
Wang, X., Tang, J., Yung, K.L., Optimization of the multi-objective dynamic cell
formation problem using a scatter search approach (2009) Int. I. Adv. Manuf. Tech.,
44 (3-4), pp. 318-329;
Norman, B.A., Tharmmaphornphilas, W., Needy, K.L., Bidanda, B., Warner, R.C.,
Worker assignment in cellular manufacturing considering technical and human skills
(2002) Int. J. Prod. Res., 40 (6), pp. 1479-1492;
formation design: Benders' decomposition approach (2011) Expert. Syst. AppL, 38
(3), pp. 2478-2488;
Defersha, F.M., Chen, M., A linear programming embedded genetic algorithm for an
integrated cell formation and lot sizing considering product quality (2008) Eur. J.
Oper. Res., 187 (1), pp. 46-69;
Cao, D., Defersha, F.M., Chen, M., Grouping operations in cellular manufacturing
considering alternative routings and the impact of run length on product quality
(2009) Int. J. Prod. Res., 47 (4), pp. 989-1013;
Egilmez, G., Süer, G.A., Huang, J., Stochastic cellular manufacturing system design
subject to maximum acceptable risk level (2012) Comput. Ind. Eng., 63 (4), pp. 842-
854;
Sudhakara Pandian, R., Mahapatra, S.S., Manufacturing cell formation with
production data using neural networks (2009) Comput. Ind. Eng., 56, pp. 1340-1347;
Chung, S., Wub, T., Chang, G., An efficient tabu search algorithm to the cell
(2011) Comput. Ind. Eng., 60 (1), pp. 7-15;
Arikan, F., Güngör, Z., Modeling of a manufacturing cell design problem with fuzzy
multi-objective parametric programming (2009) Math. Comput. Model., 50 (3-4), pp.
407-420;
Ferioli, F., Schoots, K., Zwaan, B.C.C., Use and limitations of learning curves for
energy technology policy: A component-learning hypothesis (2009) Energy Policy, 37
(7), pp. 2525-2535;
Morrison, J.B., Putting the learning curve in context (2008) J. Bus. Res., 61 (11),
pp. 1182-1190;
Expert. Syst. AppL, 36 (3), pp. 6598-6604;
Essafi, I., Mati, Y., Pérès, S.D., A genetic local search algorithm for minimizing
total weighted tardiness in the job-shop scheduling problem (2008) Comput. Oper.
Res., 35 (8), pp. 2599-2616;
Ahmadizar, F., Farahani, M.H., A novel hybrid genetic algorithm for the open shop
scheduling problem (2012) Int. I. Adv. Manuf. Tech., 62 (5-8), pp. 775-787;
Bashiri, M., Farshbaf Geranmayeh, A., Tuning the parameters of an artificial neural
network using central composite design and genetic algorithm (2011) Scientia
Iranica, 18 (6), pp. 1600-1608;
Heizer, J., Render, B., (2001) Operations Management, , Prentice-Hall;
Li, D.C., Hsu, P.H., Solving a two-agent single-machine scheduling problem
considering learning effect (2012) Comput. Oper. Res., 39 (7), pp. 1644-1651;
Hosseini, N., Tavakkoli-Moghaddam, R., Two meta-heuristics for solving a new two
machine flow-shop scheduling problem with the learning effect and dynamic arrivals
(2013) Int. I. Adv. Manuf. Tech., 65 (5-8), pp. 771-786
CORRESPONDENCE ADDRESS: Rabbani, M.; School of Industrial Engineering, College of
Engineering, University of TehranIran; email: [email protected]
PUBLISHER: Sharif University of Technology
ISSN: 10263098
ABBREVIATED SOURCE TITLE: Sci. Iran.
SOURCE: Scopus
Martins, I.C., Pinheiro, R.G.S., Protti, F., Ochi, L.S.

56182064500;56181982400;6602277527;8935888900;
A hybrid iterated local search and variable neighborhood descent heuristic applied
to the cell formation problem
84940460418&doi=10.1016%2fj.eswa.2015.07.050&partnerID=40&md5=0078064b97b84220cfc80
271cfda1d10
DOI: 10.1016/j.eswa.2015.07.050
AFFILIATIONS: Fluminense Federal University, Institute of Computing, Niterói, RJ,
Brazil;
Federal Rural University of Pernambuco, Garanhuns, PE, Brazil
ABSTRACT: The Cell Formation Problem is an NP-hard optimization problem that
consists of grouping machines into cells dedicated to producing a family of product
parts, so that each cell operates independently and inter-cellular movements are
minimized. Due to its high computational complexity, several heuristic methods have
been developed over the last decades. Hybrid methods based on adaptations of
popular metaheuristic techniques have shown to provide good performance in terms of
solution quality. This paper proposes a new approach for solving the Cell Formation
Problem using the group efficacy objective function. Our method is based on the
Iterated Local Search metaheuristic coupled with a variant of the Variable
Neighborhood Descent method that uses a random ordering of neighborhoods in local
search phase. We consider two types of constraints on the minimum cell size,
comparing them with several well-known algorithms in the literature. Computational
experiments have been performed on 35 widely used benchmark instances with up to 40
machines and 100 parts. The proposed algorithm, besides obtaining solutions at
least as good as any reported results, was able to find several optimal solutions
and improve the group efficacy for some instances with unknown optima. © 2015
Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Cellular manufacturing; Group technology; Metaheuristics
INDEX KEYWORDS: Benchmarking; Cells; Cellular manufacturing; Cytology; Group
technology; Heuristic methods; Local search (optimization), Cell formation problem;
Computational experiment; Iterated local search; Meta heuristics; Meta-heuristic
techniques; Objective functions; Optimization problems; Variable neighborhood
descents, Optimization
p. 101;
Benlic, U., Hao, J.-K., Hybrid metaheuristics for the graph partitioning problem
(2013) Hybrid Metaheuristics, 434, pp. 157-185., Talbi E.-G. Studies in
computational intelligence Springer;
pp. 2097-2116;
Burbidge, J., (1975) The Introduction of Group Technology, , John Wiley & Sons New
York;
cellular manufacture (1982) Journal of Manufacturing Systems, 1, p. 63;
Research, 24 (2), pp. 451-464;
Research, 24 (2), pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., Zodiac - An algorithm for concurrent
Production Research, 27, p. 1035;
Chen, P., Kuan Huang, H., Dong, X.-Y., Iterated variable neighborhood descent
algorithm for the capacitated vehicle routing problem (2010) Expert Systems with
Applications, 37 (2), pp. 1620-1627;
Economics, 103 (2), pp. 767-783;
Derbel, H., Jarboui, B., Hanafi, S., Chabchoub, H., Genetic algorithm with iterated
local search for solving a location-routing problem (2012) Expert Systems with
Applications, 39 (2), pp. 2865-2871;
Dimopoulos, C., Zalzala, A., Recent developments in evolutionary computations for
manufacturing optimization: Problem, solutions, and comparisons (2000) IEEE
Transactions on Evolutionary Computation, 4 (2), pp. 93-113;
Applications, 39 (2), pp. 2408-2414;
Flanders, R.E., Design, manufacture and production control of a standard machine
(1924) Transactions of the American Society of Mechanical Engineers, 46, pp. 691-
738;
manufacturing: A state-of-art review (2011) International Journal of Industrial
Engineering Computations, 2, pp. 87-122;
Gonçalves, J., Resende, M., An evolutionary algorithm for manufacturing cell
the cell formation problem (2007) Computers & Operations Research, 34 (2), pp.
2059-2079;
Research, 18 (2), pp. 213-232;
pp. 117-133;
Kumar, C.S., Chandrasekharan, M.P., Group efficacy: A quantitative criterion for
manufacturing systems (1986) European Journal of Operational Research, 24 (2), pp.
387-397;
1715-1728;
technology problem (1992) International Journal of Production Research, 30 (2), pp.
2633-2646;
Lourenço, H.R., Martin, O.C., Sttzle, T.E., Iterated local search (2002) Handbook
of Metaheuristics, pp. 321-353., Kluwer Academic Publishers;
Masson, R., Vidal, T., Michallet, J., Penna, P.H.V., Petrucci, V., Subramanian, A.,
Dubedout, H., An iterated local search heuristic for multi-capacity bin packing and
machine reassignment problems (2013) Expert Systems with Applications, 40 (2), pp.
5266-5275;
993-1009;
Mitrofanov, S.P., (1966) The Scientific Principles of Group Technology, , National
Lending Library for Science and Technology;
Mladenovic, N., Hansen, P., Variable neighborhood search (1997) Computers and
Operations Research, 24 (2), pp. 1097-1100;
Morais, V.W.C., Mateus, G.R., Noronha, T.F., Iterated local search heuristics for
the vehicle routing problem with cross-docking (2014) Expert Systems with
Applications, 41 (2), pp. 7495-7506;
implementation - A state-of-The-art survey (1985) Omega, 13 (2), pp. 381-391;
Noktehdan, A., Seyedhosseini, S., Saidi-Mehrabad, M., A metaheuristic algorithm for
the manufacturing cell formation problem based on grouping efficacy (2015) The
International Journal of Advanced Manufacturing Technology;
manufacturing cell formation (2009) Computers & Industrial Engineering, 57, pp.
1008-1014;
methodologies based on recent studies (1997-2008): Review and direction for future
search (2010) European Journal of Operational Research, 206, pp. 509-521;
Pardalos, P.M., Sun, H., Pei, J., Zhang, Y., Iterated local search embedded
adaptive neighborhood selection approach for the multi-depot vehicle routing
problem with simultaneous deliveries and pickups (2015) Expert Systems with
Applications, 42 (2), pp. 3551-3561;
Paydar, M.M., Mahdavi, I., Sharafuddin, I., Solimanpur, M., Applying simulated
annealing for designing cellular manufacturing systems using MDmTSP (2010)
Penna, P.H.V., Subramanian, A., Ochi, L.S., An iterated local search heuristic for
the heterogeneous fleet vehicle routing problem (2013) Journal of Heuristics, 19
(2), pp. 201-232;
Subramanian, A., On solving manufacturing cell formation via bicluster editing
(2013) Technical Report, , http://arxiv.org/abs/arXiv:1312.3288, Cornell University
Library;
Rajagopalan, R., Batra, J.L., Design of cellular production systems a graph-
theoretic approach (1975) International Journal of Production Research, 13 (2), pp.
567-579;
formation applications (1989) Computers & Industrial Engineering, 16 (2), pp. 419-
426;
Review, evaluation and directions for future research (1998) Computers & Industrial
Silva, G.C., Bahiense, L., Ochi, L.S., Boaventura, P.O., The dynamic space
allocation problem: Applying a hybrid grasp and tabu search metaheuristics (2012)
Srinivasan, G., Narendran, T.T., Grafics - A nonhierarchical clustering-algorithm
pp. 463-478;
Srinivasan, G., Narendran, T.T., Mahadevan, B., Assignment model for the part-
Research, 28 (2), pp. 145-152;
and Production Economics, 9 (2), pp. 73-81;
Subramanian, A., Uchoa, E., Ochi, L.S., A hybrid algorithm for a class of vehicle
routing problems (2013) Computers & Operations Research, 40, pp. 2519-2531;
manufacturing cell formation problems (2008) Expert Systems with Applications, 34
(2), pp. 1609-1617;
(2009) International Journal of Production Economics, 120 (2), pp. 669-688;
pp. 346-360
CORRESPONDENCE ADDRESS: Martins, I.C.; Fluminense Federal University, Institute of
Computing, Niterói, Brazil
ISSN: 09574174
CODEN: ESAPE
SOURCE: Scopus
Bychkov, I., Batsyn, M., Pardalos, P.M.

55842563400;37111907600;7005330875;
Exact model for the cell formation problem
(2014) Optimization Letters, 8 (8), pp. 2203-2210. Cited 13 times.
84911986748&doi=10.1007%2fs11590-014-0728-
8&partnerID=40&md5=d32edd2d07814598c209794b63f24df4
DOI: 10.1007/s11590-014-0728-8
National Research University Higher School of Economics, 136 Rodionova, Nizhniy
Novgorod, 603093, Russian Federation;
Center of Applied Optimization, University of Florida, 401 Weil Hall, P.O. Box
116595, Gainesville, FL 32611-6595, United States
ABSTRACT: The cell formation problem (CFP) consists in an optimal grouping of the
given machines and parts into cells, so that machines in every cell process as much
as possible parts from this cell (intra-cell operations) and as less as possible
parts from other cells (inter-cell operations). The grouping efficacy is the
objective function for the CFP which simultaneously maximizes the number of intra-
cell operations and minimizes the number of inter-cell operations. Currently there
are no exact approaches (known to the authors) suggested for solving the CFP with
the grouping efficacy objective. The only exact model which solves the CFP in a
restricted formulation is due to Elbenani and Ferland (Cell formation problem
solved exactly with the dinkelbach algorithm. Montreal. Quebec. CIRRELT-2012-07, 1–
14, 2012). The restriction consists in fixing the number of production cells. The
main difficulty of the CFP is the fractional objective function—the grouping
efficacy. In this paper we address this issue for the CFP in its common formulation
with a variable number of cells. Our computational experiments are made for the
most popular set of 35 benchmark instances. For the 14 of these instances using
CPLEX software we prove that the best known solutions are exact global optimums. ©
2014, Springer-Verlag Berlin Heidelberg.
AUTHOR KEYWORDS: Cell formation problem; Exact model; Fractional objective
function; Grouping efficacy
INDEX KEYWORDS: Aluminum metallography; Benchmarking; Cellular manufacturing;
Cytology, Cell formation problem; Computational experiment; Global optimum;
Grouping efficacy; Objective functions; Production cells; Restricted formulation;
Variable number, Cells
technology configuration (1987) Int. J. Prod. Res, 25 (1), pp. 101-113;
(1991) Int. J. Prod. Res, 29 (2), pp. 343-356;
manufacturing systems (1991) Int. J. Prod. Res, 29 (10), pp. 2097-2116;
Int. J. Prod. Res, 11, pp. 399-416;
Chandrasekharan, M.P., Rajagopalan, R., MODROC: an extension of rank order
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC: an algorithm for concurrent

formation of part families and machine cells (1987) Int. J. Prod. Res, 25 (6), pp.
835-850;
Chandrasekharan, M.P., Rajagopalan, R., Groupability: analysis of the properties of
1035-1052;
Dinkelbach Algorithm (2012) Montreal. Quebec. CIRRELT-2012-07, pp. 1-14;
Ghosh, S., Mahanti, A., Nagi, R., Nau, D.S., Manufacturing cell formation by state-
space search (1996) Ann. Oper. Res, 65 (1), pp. 35-54;
formation (2004) Comput. Ind. Eng, 47, pp. 247-273;
232;
review and extension (1982) Int. J. Prod. Res, 20 (2), pp. 117-133;
manufacturing systems (1986) Eur. J. Oper. Res, 24, pp. 387-397;
Kumar, K.R., Chandrasekharan, M.P., Grouping efficacy: a quantitative criterion for
J. Prod. Res, 28 (2), pp. 233-243;
manufacturing (1987) Int. J. Prod. Res, 25 (12), pp. 1715-1728;
(4), pp. 561-569;
Manuf. Syst, 6 (2), pp. 117-124;
reorganization by a clustering technique (1972) Oper. Res, 20 (5), pp. 993-1009;
Oper. Res, 40 (4), pp. 980-990;
Res, 27 (7), pp. 1161-1165;
families problem in group technology (1990) Int. J. Prod. Res, 28 (1), pp. 145-152;
Econ, 9, pp. 73-81;
MACE (1984) Int. J. Prod. Res, 22, pp. 937-948
CORRESPONDENCE ADDRESS: Batsyn, M.; Laboratory of Algorithms and Technologies for
Rodionova, Russian Federation
ISSN: 18624472
ABBREVIATED SOURCE TITLE: Optim. Lett.
SOURCE: Scopus
Pailla, A., Trindade, A.R., Parada, V., Ochi, L.S.

35724734000;14829578700;6602599875;8935888900;
A numerical comparison between simulated annealing and evolutionary approaches to
the cell formation problem
77950189308&doi=10.1016%2fj.eswa.2010.02.064&partnerID=40&md5=f805a0e9fcd53b6154569
d8cc9f3c095
DOI: 10.1016/j.eswa.2010.02.064
AFFILIATIONS: Departamento de Ingeniería Informática, Universidad de Santiago de
Chile, Av. Ecuador 3659, Santiago, Chile;
Instituto de Computaçao, Universidade Federal de Fluminense, Rua Passo da Patria
156, Bloco E, 3 andar, Sao Domingos, Niterói, RJ CEP 24210-240, Brazil
ABSTRACT: The cell formation problem is a crucial component of a cell production
design in a manufacturing system. This problem consists of a set of product parts
to be manufactured in a group of machines. The objective is to build manufacturing
clusters by associating part families with machine cells, with the aim of
minimizing the inter-cellular movements of parts by grouping efficacy measures. We
present two approaches to solve the cell formation problem. First, we present an
evolutionary algorithm that improves the efficiency of the standard genetic
algorithm by considering cooperation with a local search around some of the
solutions it visits. Second, we present an approach based on simulated annealing
that uses the same representation scheme of a feasible solution. To evaluate the
performance of both algorithms, we used a known set of CFP instances. We compared
the results of both algorithms with the results of five other algorithms from the
literature. In eight out of 36 instances we considered, the evolutionary method
outperformed the previous results of other evolutionary algorithms, and in 26
instances it found the same best solutions. On the other hand, simulated annealing
not only found the best previously known solutions, but it also found better
solutions than existing ones for various problems. © 2010 Elsevier Ltd. All rights
reserved.
AUTHOR KEYWORDS: Cell formation problem; Clustering; Evolutionary algorithms;
Heuristics; Simulated annealing
INDEX KEYWORDS: Cell formation problem; Cell production; Clustering; Evolutionary
approach; Evolutionary method; Feasible solution; Grouping efficacy; Local search;
Machine cell; Manufacturing system; Numerical comparison; Other algorithms; Part
family; Representation schemes; Standard genetic algorithm, Annealing; Cellular
manufacturing; Clustering algorithms; Genetic algorithms; Multiobjective
optimization, Simulated annealing
REFERENCES: Brown, E.C., Sumichrast, R.T., CF-GGA: A grouping genetic algorithm for
the cell formation problem (2001) International Journal of Production Research, 39
(16), pp. 3651-3669;
Chandrasekharan, M.P., ZODIAC: An algorithm for concurrent formation of part-
families and machine-cells (1987) International Journal of Production Research, 25
(6), pp. 835-885;
Research, 36 (5), pp. 1325-1337;
Economics, 103 (2), pp. 767-783;
Drummond, L.M.A., Ochi, L.S., Vianna, D.S., An asynchronous parallel metaheuristic
for the period vehicle routing problem (2001) Future Generation Computer Systems,
17 (4), pp. 379-386;
Glover, F.W., Laguna, M., (1998) Tabu search, , (1st ed., p. 408), Springer;
Goldberg, D., (1989) Genetics algorithms in search, optimization and machine
learning, , Addison-Wesley Professional, Reading;
Goncalves, J.F., Resende, M.G., An evolutionary algorithm for manufacturing cell
2059-2079;
programming model employing genetic algorithms (1996) IIE Transactions, 28 (1), pp.
69-85;
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., Optimization by simulated annealing
(1983) Science, 220, pp. 671-680;
16 (7), pp. 491-497;
approach to the cell formation problem (2005) International Journal of Advanced
Silver, E.A., An overview of heuristic solution methods (2004) Journal of the
Srinivasan, G., Narendran, T., Grafics - A nonhierarchical clustering-algorithm for
463-478;
Part A - Systems and Humans, 29 (1), pp. 100-104;
cell formation problems (2008) Expert Systems with Applications, 34 (3), pp. 1609-
1617;
Economics, 101 (2), pp. 329-352
CORRESPONDENCE ADDRESS: Parada, V.; Departamento de Ingeniería Informática,
Universidad de Santiago de Chile, Av. Ecuador 3659, Santiago, Chile; email:
[email protected]
ISSN: 09574174
CODEN: ESAPE
SOURCE: Scopus
Gunasingh, K.R., Lashkari, R.S.

6507241752;6701624021;
The cell formation problem in cellular manufacturing systems-A sequential modelling
approach
8352%2889%2990164-2&partnerID=40&md5=941aba97636da1ce814b8c6530450746
DOI: 10.1016/0360-8352(89)90164-2
AFFILIATIONS: Department of Industrial Engineering, University of Windsor, Windsor,
Ont. N9B 3P4, Canada
ABSTRACT: A sequential modelling approach to the cell formation problem in cellular
manufacturing systems is presented in this paper. First, the machines are grouped
into cells based on their similarity in parts processing; next the parts are
allocated to appropriate machine groups based on the processing requirements. The
machine grouping and the parts allocation problems are modelled as 0-1 integer
programs. The application of the models is illustrated using a numerical example. ©
1989.
INDEX KEYWORDS: Mathematical Models; Mathematical Techniques--Algorithms, Cell
Formation Problem; Cellular Manufacturing Systems; Parts Allocation Problem;
Sequential Modelling Approach; Similarity Index, Industrial Plants
REFERENCES: Burbidge, Production flow analysis (1963) Prodn Engnr, 42 (12), pp.
742-752;
Dutta, Lashkari, Padhye, Nadoli, Ravi, The cell formation problem in FMSs (1985)
Proc. 4th Int. Conf. on flexible manufacturing systems, pp. 199-207., Stockholm,
Sweden;
Kusiak, Part families selection model for FMSs (1983) Proc. A. Ind. Engng Conf.,
pp. 575-580., Louisville, Kentucky;
Kusiak, The part families problem in flexible manufacturing systems (1985) Annals
of Operations Research, 3, pp. 279-300;
Dutta, Lashkari, Nadoli, Ravi, A heuristic procedure for determining manufacturing
families from design based grouping for FMS (1986) Computers Ind. Engng, 10 (3),
pp. 193-201;
Han, Ham, Multiobjective cluster analysis for part family formations (1986) J.
Manuf. Syst., 5 (4), pp. 223-230;
Wu, Venugopal, Barash, Design of a cellular manufacturing system: a syntactic
pattern recognition approach (1986) J. Manuf. Syst., 5 (2), pp. 81-88;
Lashkari, Dutta, Nadoli, Part family formation in FMSs—An integer programming
approach (1987) Proc. 3rd Int. Conf. on Advances in Production Management Systems,
pp. 627-635., Winnipeg, Canada;
McAuley, Machine grouping for efficient production (1972) Prodn Engnr, 51 (2), pp.
53-57;
Rajagopalan, Batra, Design of cellular production systems: a graph-theoretic
approach (1975) J. Prodn Res., 13 (6), pp. 567-579;
Steudel, Ballakur, A dynamic programming based heuristic for machine grouping in
manufacturing cell formation (1987) Computers Ind. Engng, 12 (3), pp. 215-222;
King, Machine-component grouping in production flow analysis: an approach using
rank order clustering algorithm (1980) Int. J. Prodn Res., 18 (1), pp. 213-232;
Chan, Milner, Direct clustering algorithm for group formation in cellular
manufacture (1982) Journal of Manufacturing Systems, 1 (1), pp. 64-76;
King, Nakornchai, Machine-component group formation in group technology review and
extension (1982) International Journal of Production Research, 20 (2), pp. 117-133;
Khator, Irani, Cell formation in GT: A new approach (1987) Computers Ind. Engng, 12
(2), pp. 131-142;
Kusiak, Chow, Efficient solving of the group technology problem (1987) J. Manuf.
Syst., 6 (2), pp. 117-124;
McCormick, Schweitzer, White, Problem decomposition and data reorganization by a
clustering technique (1972) Opns Res., 20 (5), pp. 993-1009;
Slagle, Chang, Heller, A clustering and data reorganization algorithm (1975) IEEE
Trans. Syst. Man and Cybernetics, 5 SMC (1), pp. 125-128;
Bhat, Haupt, An efficient clustering algorithm (1976) IEEE Transactions on Systems,
Man, and Cybernetics, 6 SMC (1), pp. 61-64;
Chandrasekeran, Rajagopalan, An ideal seed non-hierarchical clustering for cellular
manufacturing (1986) International Journal of Production Research, 24 (2), pp. 451-
464;
Kumar, Kusiak, Vanneli, Grouping of parts and components in FMSs (1986) European
Choobineh, A framework for the design of cellular manufacturing systems (1988) Int.
J. Prodn Res., 26 (7), pp. 1161-1172;
Co, Araar, Configuring cellular manufacturing systems (1988) Int. J. Prodn Res., 26
(9), pp. 1511-1522;
SAS Institute Inc., (1985) SAS/OR User's Guide, , Version 5 Edition, SAS Institute
Inc, Cary, N.C;
Wemmerlov, Hyer, Cellular manufacturing in the US industry: a survey of users
(1987) Working paper, Graduate School of Business Administration, , University of
Wisconsin, Madison, Wisconsin;
Fisher, The lagrangean relaxation method for solving integer programming problems
(1981) Mgmt Sci., 27 (1), pp. 1-18
CORRESPONDENCE ADDRESS: Gunasingh, K.R.; Department of Industrial Engineering,
University of Windsor, Windsor, Ont. N9B 3P4, Canada
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Wu, T.-H., Yeh, J.-Y., Chang, C.-C.

7404814990;7201896104;57142825500;
A hybrid simulated annealing algorithm to the cell formation problem with
alternative process plans
(2007) 2007 International Conference on Convergence Information Technology, ICCIT
2007, art. no. 4420260, pp. 199-203. Cited 1 time.
49049097889&doi=10.1109%2fICCIT.2007.4420260&partnerID=40&md5=0b47e350c7833967eb699
60dff003108
DOI: 10.1109/ICCIT.2007.4420260
Taiwan;
Department of Information Management, National Chiayi University, Taiwan;
Department of Information Management, Jen-Te Junior College of Medicine, Nursing
and Management
ABSTRACT: In this study, a simulated annealing algorithm with mutation operator is
proposed to solve the manufacturing cell formation problem considering multiple
process routings for part. The proposed algorithm is designed mainly to explore
solution regions efficiently and to expedite the solution search process. The
performance of the proposed algorithm is tested by a range of test problems from
the literature. The comparative study shows that the proposed algorithm is capable
of obtaining quick and favorable solutions. © 2007 IEEE.
INDEX KEYWORDS: Algorithms; Annealing; Cellular manufacturing; Flexible
manufacturing systems; Information technology; Solutions; Technology, Alternative
process plans; Cell formation problems; Comparative studies; International
conferences; Manufacturing cell formation; Mutation operators; Routings; Search
processes; Simulated annealing algorithm; Test problems, Simulated annealing
alternate routeings (1996) International Journal of Production Research, 34, pp.
1361-1380;
Control, 2, pp. 135-141;
2633-2646;
Logendram, R., Ramakrishna, P., Sriskandarajah, C., Tabu search-based heuristics
(1994) International Journal of Production Research, 32, p. 273297;
space (2007) International Journal of Production Research, 45, pp. 1355-1367;
Wong, S.Y.W., Hybrid simulated annealing /genetic algorithm approach to short-term
hydro-thermal scheduling with multiple thermal plants (2001) International Journal
of Electrical Power and Energy Systems, 23, pp. 565-575;
Taipei UniversityTaiwan; email: [email protected]
ISBN: 0769530389; 9780769530383

ABBREVIATED SOURCE TITLE: Int. Conf. Convergence Inf. Technol., ICCIT
SOURCE: Scopus
Noktehdan, A., Seyedhosseini, S., Saidi-Mehrabad, M.

35520149000;36148394400;18435197300;
A Metaheuristic algorithm for the manufacturing cell formation problem based on
grouping efficacy
84953837179&doi=10.1007%2fs00170-015-7052-
z&partnerID=40&md5=443a3a0b8288311404a183d46bfef6f1
DOI: 10.1007/s00170-015-7052-z
AFFILIATIONS: Department of Industrial Engineering, Iran University of Science &
Technology, Narmak, Tehran, Iran
ABSTRACT: The cell formation problem determines decomposition of the manufacturing
cells of a production system. Machines are assigned to the cells to process one or
more part families so that each cell is operated independently and the inter-
cellular movements are minimized. This paper proposes a new algorithm for grouping
problems (bin packing, graph coloring, scheduling, etc.) which is a grouping
version of an almost new algorithm (league championship algorithm (LCA)), and we
used it to solve benchmarked instances of cell formation problem posing as a
grouping problem. To evaluate the effectiveness of our approach, we borrow a set of
35 most widely used benchmark problem instances from literature and compare the
performance of grouping LCA (GLCA) and several well-known algorithms published. The
proposed algorithm can reach the best solution for 29 of the 35 benchmark problems
and differs with the best-known solution of three benchmark problems only with 0.7
% average gap. We also used a new method to find the number of initial cells. The
results show that GLCA may hopefully be a new approach for such kinds of difficult-
to-solve problems. Moreover, a real-world industrial case is provided to show how
the proposed algorithm works. Considering the performance of the GLCA algorithm on
all test problems, the proposed algorithm should thus be useful to both
practitioners and researchers. © 2015, Springer-Verlag London.
AUTHOR KEYWORDS: Cell formation problem; Grouping genetic algorithm; League
championship algorithm
INDEX KEYWORDS: Algorithms; Benchmarking; Cells; Cellular manufacturing; Cytology;
Flexible manufacturing systems; Genetic algorithms; Life cycle; Manufacture; Mobile
security, Bench-mark problems; Benchmark-problem instances; Cell formation problem;
Grouping genetic algorithms; League championship algorithms; Manufacturing cell
formation; Meta heuristic algorithm; Production system, Problem solving
REFERENCES: Anvari, M., Mehrabad, M., Barzinpour, F., Machine-part cell formation
using a hybrid particle swarm optimization (2010) Int J Adv Manuf Technol, 2010,
pp. 745-754;
configuration (1987) Int J Prod Res, 25, pp. 101-113;
Ateme-Nguem, B., Dao, T., Optimization of cellular manufacturing systems design
using the hybrid approach based on the ant colony and tabu search techniques (2007)
In Proceedings of the IEEE IEEM, pp. 668-673;
Ateme-Nguema, B., Dao, T., Quantized Hopfield networks and tabu search for
manufacturing cell formation problems (2009) Int J Prod Res, 121, pp. 88-98;
algorithms, and technologies for network analysis, Springer Proceedings in
Mathematics & Statistics, 32;
(1991) Int J Prod Res, 29, pp. 343-356;
manufacturing cell formation problem (2006) Comput Oper Res, 33, pp. 2219-2245;
Boutsinas, B., Machine-part cell formation using biclustering (2013) Eur J Oper
Res, 230, pp. 563-572;
Brown, E., James, T., A hybrid grouping genetic algorithm for the cell formation
problem (2007) Comput Oper Res, 34, pp. 2059-2079;
Brown, E., Sumichrast, R., CF-GGA: a grouping genetic algorithm for the cell
formation problem (2001) Int J Prod Res, 36, pp. 3651-3669;
(1973) Int J Prod Res, pp. 399-416;
clustering for group technology (1986) Int J Prod Res, 24, pp. 1221-1233;
algorithm for cellular manufacturing (1986) Int J Prod Res, 24, pp. 451-463;
1052;
part families (1998) Int J Prod Res, 36, pp. 1325-1337;
DeLit, P., Falkenauer, E., Delchambre, A., Grouping genetic algorithms: an
efficient method to solve the cell formation problem (2000) Math Comput Simul, 51,
pp. 257-271;
search to solve the cell formation problem (2012) Expert Syst Appl;
Falkenauer, E., (1998) Genetic algorithm for grouping problems, , Wiley, New York;
manufacturing: a state-of-art review (2011) Int J Ind EngComput, 2, pp. 87-122;
cell formation (2012) Oper Res, 60, pp. 1157-1166;
formation (2004) Comput Ind Eng, 47, pp. 247-273;
Heragu, S.S., (1997) Facility design, , PWS Publishing Company, Boston;
Husseinzadeh Kashan, A., League championship algorithm: a new algorithm for
numerical function optimization (2009) International Conference of Soft Computing
and Pattern Recognition;
sizes (2006) Int J Prod Res, 44, pp. 2337-2360;
Husseinzadeh Kashan, A., (2014) Karimi B, , Noktehdan A: A novel discrete particle
swarm optimization algorithm for the manufacturing cell formation problem. Int J
Adv Manuf Technol;
using a rank order clustering algorithm (1980) Int J Prod Res, pp. 213-232;
review and extension (1982) Int J Prod Res, 20, pp. 117-131;
technology (2012) Comput Manag Sci, 9, pp. 323-338;
Kumar, C., Chandrasekharan, M.P., Grouping efficacy: a quantitative criterion for
Prod Res, 28, pp. 233-243;
manufacturing systems (1986) Eur J Oper Res, 24, pp. 387-397;
technology problem (1992) Int J Prod Res, 30, pp. 2633-263346;
Manuf Syst, 6, pp. 117-124;
formation in generalized group technology (2005) Int J Prod Res, 19, pp. 4035-4047;
Int J Adv Manuf Technol, 28, pp. 950-956;
reorganization by a clustering technique (1972) Oper Res, 20, pp. 993-1009;
implementation (1985) OMEGA;
technology machine clustering problem (1985) OMEGA;
Noktehdan, A., Karimi, B., Husseinzadehkashan, A., A differential evolution
Noktehdan, A., (2015) Seyedhosseini SM, , Saidi-Mehrabad M: A Metaheuristic
algorithm for the manufacturing cell formation problem based on grouping efficacy.
Int J Adv Manuf Technol;
Pailla, A., Trindade, A., Parada, V., Ochi, L., A numerical comparison between
Prabhaharan, G., Muruganandam, A., Asokanm, P., Girish, B.S., Machine cell
formation for cellular manufacturing systems using an ant colony system approach
(2005) Int J Adv Manuf Technol, 25, pp. 1013-1019;
Rao, P.K., A multi stage heuristic for manufacturing cell formation (2014) Int J
Res EngTechnol, 1163, pp. 2308-2321;
Roy, N., Komma, V.R., Cellular manufacturing through composite part formation: a
genetic algorithm approach. International Conference on Industrial Engineering and
Operations Management, Bali, Indonesia (2014) January, pp. 7-9;
Sarker, B., Measures of grouping efficacy in cellular manufacturing systems (2001)
Eur J Oper Res, 130, pp. 588-611;
Sayadi, M.K., Hafezalkotob, A., Jalali naini, S.G., Firefly-inspired algorithm for
discrete optimization problems: an application to manufacturing cell formation
(2013) J Manuf Syst, 32, pp. 78-84;
27, pp. 1161-1165;
Seifoddini, H., Wolf, P.M., Application of the similarity coefficient method in
group technology (1986) IIIE Transaction, 18, pp. 271-277;
evaluation and directions for future research (1998) Comput Ind Eng, 34, pp. 3-20;
50, pp. 1135-1144;
Econ, 9, pp. 73-81;
Stawowy, A., Evolutionary strategy for manufacturing cell design (2006) Omega, Int
J Manag Sci, 34, pp. 1-18;
Eng, 28, pp. 485-494;
Vin, E., DeLit, P., Delchamber, A., A multiple-objective grouping genetic algorithm
for the cell formation problem with alternative routings (2005) J Intell Manuf, 16,
pp. 189-205;
MACE (1984) Int J Prod Res, 22, pp. 937-948;
users (1989) Int J Prod Res, 27, pp. 1511-1530;
cell formation problems (2008) Expert Syst Appl;
function and mutation operator for manufacturing cell formation problems (2009) Int
J Prod Econ, 120, pp. 669-688;
Wu, T., Chung, S., Chang, C., A water flow-like algorithm for manufacturing cell
formation problems (2010) Eur J Oper Res, 205, pp. 346-360
CORRESPONDENCE ADDRESS: Seyedhosseini, S.; Department of Industrial Engineering,
Iran University of Science & TechnologyIran; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Bychkov, I., Batsyn, M., Sukhov, P., Pardalos, P.M.

55842563400;37111907600;55842116600;7005330875;
Heuristic algorithm for the Cell Formation Problem
(2013) Springer Proceedings in Mathematics and Statistics, 59, pp. 43-69. Cited 5
times.
1-4614-8588-9_4&partnerID=40&md5=2f461141ff49823e11452d5a6840d392
DOI: 10.1007/978-1-4614-8588-9_4
National Research University Higher School of Economics, 136 Rodionova Street,
Nizhny Novgorod, 603093, Russian Federation;
Center of Applied Optimization, University of Florida, 401 Weil Hall, P.O. Box
116595, Gainesville, FL, 32611-6595, United States
ABSTRACT: In this chapter, we introduce a new heuristic for Cell Formation Problem
in its most general formulation with grouping efficiency as an objective function.
Suggested approach applies an improvement procedure to obtain solutions with high
grouping efficiency. This procedure is repeated until efficiency can be increased
for randomly generated configurations of cells. We consider our preliminary results
for 10 popular benchmark instances taken from the literature. Also source instances
with the solutions we got can be found in the Appendix. © Springer Science+Business
Media New York 2013.
AUTHOR KEYWORDS: Cell formation; Grouping efficiency; Improvement heuristic
INDEX KEYWORDS: Benchmarking; Cellular manufacturing; Heuristic algorithms, Cell
formation; Cell formation problem; Grouping efficiency; Improvement heuristic;
Objective functions, Efficiency
REFERENCES: Ghosh, S., Mahanti, A., Nagi, R., Nau, D.S., Cell formation problem
solved exactly with the Dinkelbach algorithm (1996) Ann. Oper. Res., 65 (1), pp.
35-54;
Burbidge, J.L., The new approach to production (1961) SPE Prod. Eng., 40 (12), pp.
769-784;
Burbidge, J.L., (1975) The Introduction of Group Technology, , Wiley, New York;
Int. J. Prod. Res., 11, pp. 399-416;
binary data matrices for group technology (1989) Int. J. Prod. Res., 27 (6), pp.
1035-1052;
(1925) Trans. Am. Soc. Mech. Eng., 46, pp. 691-738;
cell formation (2012) Oper. Res., 60 (5), pp. 1157-1166;
Mitrofanov, S.P., (1959) Nauchnye Osnovy Gruppovoy Tekhnologii, p. 435., Lenizdat,
Leningrad, (in Russian);
Mitrofanov, S.P., (1959) The Scientific Principles of Group Technology, , Boston
Spa, Yorkshire (1966). National Lending Library Translation, translation of
Mitrofanov;
block diagonal forms (1998) Int. J. Prod. Res., 36, pp. 3217-3222;
based on TOPSIS method (2009) Comput. Oper. Res., 36 (5), pp. 1478-1496;
Bhatnagar, R., Saddikuti, V., Models for cellular manufacturing systems design:
Matching processing requirements and operator capabilities (2010) J. Oper. Res.
Soc., 61, pp. 827-839
Rodionova Street, Nizhny Novgorod, 603093, Russian Federation; email:
[email protected]
ISSN: 21941009
ISBN: 9781461485872
SOURCE: Scopus
Paydar, M.M., Mahdavi, I., Szabat, K.A.

23025569300;16417373200;55202196200;
Application of single depot multiple travelling salesman method to cell formation
problems
(2010) International Journal of Applied Decision Sciences, 3 (4), pp. 390-399.
Cited 4 times.
78349247557&doi=10.1504%2fIJADS.2010.036853&partnerID=40&md5=66c76bd541d25d14c31ba7
dcdc78b7ed
DOI: 10.1504/IJADS.2010.036853
Science and Technology, Babol, Iran;
Management Department, La Salle University, Philadelphia, PA 19141, United States
ABSTRACT: The cell formation problem (CFP) determines the decomposition of the
cells to process one or more part families. In this paper, the CFP is formulated as
a single depot multiple travelling salesman problem (SDmTSP). Computational results
comparing the model with a set of group technology (GT) problems available in the
literature are presented. The approach produced solutions with better grouping
efficacy than is reported in the literature. Copyright © 2010 Inderscience
Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing; CM; CFP; Group
technology; Grouping efficacy; GT; SDmTSP; Single depot multiple travelling
salesman problem
formation of manufacturing cells (2005) Computers & Industrial Engineering, 48, pp.
3-21;
Askin, R.G., Cresswell, S.H., Goldberg, J.B., Vakharia, A.J., A Hamiltonian path
approach to reordering the part-machine matrix for cellular manufacturing (1991)
Balakrishnan, J., Jog, P.D., Manufacturing cell formation using similarity
coefficients and a parallel genetic TSP algorithm: Formulation and comparison
(1995) Mathematical and Computer Modelling, 21, pp. 61-73;
Burbidge, J.L., Production flow analysis (1971) Production Engineer, 50, pp. 139-
152;
Research, 24 (5), pp. 1221-1264;
pp. 293-318;
Cheng, C., Gupta, Y., Lee, W., Wong, K., A TSP-based heuristic for forming machine
groups and part families (1998) International Journal of Production Research, 36,
pp. 1325-1337;
formation (2004) Computers& Industrial Engineering, 47, pp. 247-273;
Heragu, S.S., Group technology and cellular manufacturing (1994) IEEE Transactions
Kara, I., Bektas, T., Integer linear programming formulations of multiple salesman
problems and its variations (2006) European Journal of Operational Research, 174,
pp. 1449-1458;
Lenstra, J.K., KanRinnooy, A.H.G., Some simple applications of the travelling
salesman problem (1975) Operations Research Quarterly, 26, pp. 717-733;
Mahdavi, I., Javadi, B., F-alipour, K., Slomp, J., Designing a new mathematical
model for cellular manufacturing system based on cell utilization (2007) Applied
Mathematics and Computation, 190, pp. 662-670;
Lending Library Translation, Boston Spa, Yorks, UK;
systems (2001) Computers and Industrial Engineering, 39 (1-2), pp. 125-144;
Sarker, B., Mondal, S., Grouping efficiency measures in cellular manufacturing: A
survey and critical review (1999) International Journal of Production Research, 37,
pp. 285-314;
of cellular manufacturing systems (1996) International Journal of Production
Research, 34, pp. 3401-3416;
Soleymanpour, M., Vrat, P., Shanker, R., A transiently chaotic neural network
approach to the design of cellular manufacturing (2002) International Journal of
1615;
Wu, T-H., Chang, C-C., Chung, S-H., A simulated annealing algorithm for
pp. 1609-1617
Mazandaran University of Science and Technology, Babol, Iran; email:
[email protected]
ISSN: 17558077
ABBREVIATED SOURCE TITLE: Int. J. Appl. Decis. Sci.
SOURCE: Scopus
Wu, T.-H., Chen, J.-F., Yeh, J.-Y.

7404814990;8558429900;7201896104;
A decomposition approach to the cell formation problem with alternative process
plans
10844291767&doi=10.1007%2fs00170-003-1749-
0&partnerID=40&md5=3d94f1f4d74f8f35b0c7d22e63c14e8f
DOI: 10.1007/s00170-003-1749-0
AFFILIATIONS: Department of Industrial Engineering, Da-Yeh University, 112 Shan-
Jeau Rd., Da-Tsuen, Changhua, 515, Taiwan;
Department of Industrial Engineering, Feng-Chia University, Taichung, Taiwan
ABSTRACT: This paper considers the cell formation problem in which alternative
process plans exist for each part. A three-stage algorithm decomposing the original
problem into three subproblems, i.e., process plan selection, parts assignment, and
machines assignment problems, respectively, is proposed to solve this problem. Test
problems, both from the literature and those generated in this study, are used to
evaluate the performance of the proposed algorithm. The proposed algorithm can very
efficiently find good-quality solutions and should thus be useful to practitioners
and researchers.
AUTHOR KEYWORDS: Alternative process plans; Cell formation problem; Tabu search
INDEX KEYWORDS: Algorithms; Computational methods; Evaluation; Group technology;
Manufacture, Alternative process plans; Cell formation problem; Tabu search,
Process control
formation problem (1997) Comput Ind Eng, 32, pp. 169-185;
Chen, C.H., Algorithms for grouping machines groups in group technology (1992)
Omega, 20, pp. 493-501;
pp. 289-295;
Glover, F., Tabu search - Part I (1989) ORSA J Comput, 1, pp. 190-206;
Glover, F., Tabu search - Part II (1989) ORSA J Comput, 2, pp. 4-32;
Glover, F., Laguna, M., (1997) Tabu Search, , Kluwer, Boston;
alternative part process plans (1996) Comput Ind Eng, 30, pp. 423-431;
Kusiak, A., The generalized group technology concept (1987) Int J Prod Res, 25, pp.
561-569;
(1994) Int J Prod Res, 32, pp. 273-297;
57;
Nagi, R., Harlarakis, G., Proth, J.M., Multiple routeings and capacity
considerations in group technology applications (1990) Int J Prod Res, 28, pp.
2243-2257;
the p-Median problem (1996) Eur J Oper Res, 96, pp. 329-342;
routing in group technology (1990) Eng Optim, 16, pp. 235-245;
procedure for the fixed charge transportation problem (1998) Eur J Oper Res, 106,
pp. 441-456;
in the presence of multiple process routes (1994) Eng Optim, 22, pp. 231-240;
technology problem with multiple process routings (1997) Comput Ind Eng, 32, pp.
207-220;
Wu, T.-H., Low, C., Wu, W.-T., A tabu search approach for the cell formation
problem (2004) Int J Adv Manuf Technol, , Published online: 27 March
CORRESPONDENCE ADDRESS: Wu, T.-H.; Department of Industrial Engineering, Da-Yeh
University, 112 Shan-Jeau Rd., Da-Tsuen, Changhua, 515, Taiwan; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Zettam, M.
57188555455;
An hybrid gravitational method for solving the cell formation problem
(2017) Journal of Theoretical and Applied Information Technology, 95 (20), pp.
5506-5516. Cited 1 time.
85032804748&partnerID=40&md5=ff293f5bd92b389d47e2123260fb672d

computer Science, Faculty of Science, Ibn Tofail University Kenitra, Morocco
ABSTRACT: The Cellular Manufacturing System has emerged as a strategy capable of
improving the manufacturing cost and decreasing the lead time with no negative
impacts on the product quality. One of the fundamental problems of this strategy is
known as the Cell Formation Problem, which consists of defining cells including a
machine group and a product (part) family. In this paper, we consider the
Manufacturing Cell Formation Problem where the objective is to maximize the
Grouping Efficacy measure. We introduce a hybrid gravitational method (HGM)
combining a population based algorithm and a local search procedure. This hybrid
metaheuristic is a variant of the Discrete Gravitational Search Algorithm (DGSA).
It allows searching extensively the feasible domain of a problem during the early
iterations. It also includes a well-balanced mechanism for enhancing exploration
and exploitation strategies. Several modifications were necessary to adapt the DGSA
in order to maintain similar performance when dealing with the CFP. The major ones
consist in modifying the population of solutions and in performing the exploration
phase. The Path Relinking process used in DGSA to modify the solution is replaced
by a crossover strategy derived from concepts of the Gravitational Search Algorithm
(GSA). The performance of this hybrid variant of the Gravitational Search Algorithm
is evaluated using a set of 35 benchmarks from the literature. The numerical
results confirm that our hybrid metaheuristic could be considered as one of the
best algorithms. © 2005 – ongoing JATIT & LLS.
AUTHOR KEYWORDS: Cell formation problem; Gravitational search algorithm; Grouping
efficacy; Hybrid gravitational method; Tabu search
REFERENCES: Dowlatshahi, M.B., Nezamabadi-Pour, H., Mashinchi, M., A discrete
gravitational search algorithm for solving combinatorial optimization problems
(2014) Information Sciences, 258, pp. 94-107;
Applications, 39 (3), pp. 2408-2414., http://dx.doi.org/10.1016/j.eswa.2011.08.089;
Glover, F., Tabu Search—Part I (1989) ORSA Journal on Computing, 1 (3), pp. 190-
206;
Glover, F., Tabu Search—Part II (1990) ORSA Journal on Computing, 2 (1), pp. 4-32;
Goldengorin, B., Krushinsky, D., Slomp, J., Flexible PMP Approach for Large-Size
Cell Formation (2012) Operations Research, 60 (5), pp. 1157-1166;
formation (2004) Computers & Industrial Engineering, 47 (23), pp. 247-273.,
http://dx.doi.org/10.1016/j.cie.2004.07.003;
2059-2079., http://dx.doi.org/10.1016/j.cor.2005.08.010;
impact on factory measures for the machine-part cell formation problem: A
simulation study (2007) Engineering Applications of Artificial Intelligence, 20
(1), pp. 63-78;
Krause, J., Cordeiro, J., Parpinelli, R.S., Lopes, H.S., 7 - A Survey of Swarm
Algorithms Applied to Discrete Optimization Problems (2013) Swarm Intelligence and
Bio-Inspired Computation, pp. 169-191., X.-S. Y. C. X. H. G. Karamanoglu, Oxford:
Elsevier;
technology (2012) Computational Management Science, 9 (3), pp. 323-338;
Hansen, P., (1986) The Steepest Ascent Mildest Descent Heuristic for Combinatorial
Programming, , Presented at the Proceedings of the Congress on Numerical Methods in
Combinatorial Optimization;
machine–part cell formation problems (2010) Computers & Operations Research, 37
(12), pp. 2071-2081., http://dx.doi.org/10.1016/j.cor.2010.02.007;
Luo, J., Tang, L., A hybrid approach of ordinal optimization and iterated local
search for manufacturing cell formation (2009) The International Journal of
Expert Systems with Applications, 36 (3), pp. 6598-6604.,
http://dx.doi.org/10.1016/j.eswa.2008.07.054;
Mitrofanov, S.P., (1966) Scientific Principles of Group Technology: National
methodologies based on recent studies (1997– 2008): Review and directions for
future research (2010) European Journal of Operational Research, 206 (3), pp. 509-
521;
Parashar, B.S.N., (2008) CELLULAR MANUFACTURING SYSTEMS, , An Integrated Approach:
PHI Learning;
Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S., GSA: A Gravitational Search
Algorithm (2009) Information Sciences, 179 (13), pp. 2232-2248;
Rojas, W., Solar, M., Chacón, M., Ferland, J., An Efficient Genetic Algorithm to
Solve the Manufacturing Cell Formation Problem (2004) Adaptive Computing in Design
and Manufacture VI, pp. 173-183., I. C. Parmee (Ed.), Springer London;
(2001) European Journal of Operational Research, 130 (3), pp. 588-611.,
http://dx.doi.org/10.1016/S0377-2217(99)00419-1;
Suresh, N.C., Kay, J.M., (1998) Group Technology and Cellular Manufacturing: State-
Of-The-Art Synthesis of Research and Practice: Kluwer Academic Pub;
Tunnukij, T., Hicks, C., An Enhanced Grouping Genetic Algorithm for solving the
pp. 1989-2007;
(2004) The International Journal of Advanced Manufacturing Technology, 23 (11-12);
Algorithms, and Technologies for Network Analysis, pp. 11-50., Springer, New York,
NY;
Sarker, B.R., Li, Z., Job routing and operations scheduling: A network-based
virtual cell formation approach (2001) Journal of the Operational Research Society,
pp. 673-681;
Zettam, M., Elbenani, B., Gravitational Search Algorithm Applied to the Cell
Formation Problem (2016) Nature-Inspired Computation in Engineering, pp. 251-266.,
Springer International Publishing
Laboratory, Department of computer Science, Faculty of Science, Ibn Tofail
University KenitraMorocco; email: [email protected]
PUBLISHER: Asian Research Publishing Network
ISSN: 19928645
ABBREVIATED SOURCE TITLE: J. Theor. Appl. Inf. Technol.
SOURCE: Scopus
Pinheiro, R.G.S., Martins, I.C., Protti, F., Ochi, L.S.

56181982400;56182064500;6602277527;8935888900;
A matheuristic for the cell formation problem
(2018) Optimization Letters, 12 (2), pp. 335-346. Cited 1 time.
85029494841&doi=10.1007%2fs11590-017-1200-
3&partnerID=40&md5=10aa2d479a803e86ce5de8986638f300
DOI: 10.1007/s11590-017-1200-3
AFFILIATIONS: Federal Rural University of Pernambuco, Garanhuns, PE, Brazil;
Instituto de Computação, Universidade Federal Fluminense, Rua Passo da Pátria 156,
Bloco E - 3ºandar, São Domingos, Niterói, RJ 24210-240, Brazil
ABSTRACT: In this paper we propose a GRASP matheuristic coupled with an Integer
Programming refinement based on Set Partitioning to solve the Cell Formation
Problem. We use the grouping efficacy measure to evaluate the solutions. As this
measure is nonlinear, we propose a fractional Set Partitioning approach and its
linearization. Our method is validated on a set of 35 instances from the
literature. The experiments found four unknown solutions. For all instances with
known optima, our method is able to determine the optimum solutions. © 2017,
Springer-Verlag GmbH Germany.
AUTHOR KEYWORDS: Cellular manufacturing; Combinatorial optimization; Group
technology; Hybrid heuristics; Matheuristics
INDEX KEYWORDS: Combinatorial optimization; Group technology; Integer programming;
Optimization, Cell formation problem; Grouping efficacy; Hybrid heuristics;
Matheuristics; Optimum solution; Set partitioning, Cellular manufacturing
REFERENCES: Agarwal, Y., Mathur, K., Salkin, H.M., A set-partitioning-based exact
algorithm for the vehicle routing problem (1989) Networks, 19 (7), pp. 731-749;
Balas, E., Padberg, M.W., Set partitioning: a survey (1976) SIAM Rev., 18 (4), pp.
710-760;
Bastos, L., Ochi, L.S., Protti, F., Subramanian, A., Martins, I.C., Pinheiro,
R.G.S., Efficient algorithms for cluster editing (2016) J. Comb. Optim., 31 (1),
pp. 347-371;
Boschetti, M.A., Maniezzo, V., Roffilli, M., Bolufé Röhler, A., (2009)
Matheuristics: Optimization, Simulation and Control, pp. 171-177., Springer,
Berlin;
Daz, J., Luna, D., Zetina, C., A hybrid algorithm for the manufacturing cell
formation problem (2013) J. Heuristics, 19 (1), pp. 77-96;
Dimopoulos, C., Zalzala, A., Recent developments in evolutionary computations for
manufacturing optimization: problem, solutions, and comparisons (2000) IEEE Trans.
Evol. Comput., 4 (2), pp. 93-113;
neighbourhood search to solve the cell formation problem (2012) Expert Syst. Appl.,
39 (3), pp. 2408-2414;
Feo, T., Resende, M., Greedy randomized adaptive search procedures (1995) J. Glob.
Optim., 6, pp. 109-133;
manufacturing: a state-of-art review (2011) Int. J. Ind. Eng. Comput., 2, pp. 87-
122;
formation (2004) Comput. Ind. Eng., 47 (2-3), pp. 247-273;
Kumar, C.S., Chandrasekharan, M.P., Group efficacy: a quantitative criterion for
J. Prod. Res., 28 (2), pp. 233-243;
Maniezzo, V., Stützle, T., Voß, S., (2009) Matheuristics: Hybridizing
Metaheuristics and Mathematical Programming, , 1, Springer, Berlin;
Martins, I.C., Pinheiro, R.G.S., Protti, F., Ochi, L.S., A hybrid iterated local
search and variable neighborhood descent heuristic applied to the cell formation
problem (2015) Expert Syst. Appl., 42 (22), pp. 8947-8955;
Mladenovic, N., Hansen, P., Variable neighborhood search (1997) Comput. Oper. Res.,
24 (11), pp. 1097-1100;
(2010) Expert Syst. Appl., 37, pp. 5476-5483;
Oper. Res., 40 (4), pp. 980-990;
Penna, P.H.V., Subramanian, A., Ochi, L.S., An iterated local search heuristic for
the heterogeneous fleet vehicle routing problem (2013) J. Heuristics, 19 (2), pp.
201-232;
Pinheiro, R.G., Martins, I.C., Protti, F., Ochi, L.S., Simonetti, L.G.,
Subramanian, A., (2016) Eur. J. Oper. Res., 254 (3), pp. 769-779;
new weighted grouping efficiency measure (2001) IIE Trans., 33, pp. 11-27;
Subramanian, A., Uchoa, E., Ochi, L.S., A hybrid algorithm for a class of vehicle
routing problems (2013) Comput. Oper. Res., 40, pp. 2519-2531;
boltzmann function and mutation operator for manufacturing cell formation problems
(2009) Int. J. Prod. Econ., 120 (2), pp. 669-688
CORRESPONDENCE ADDRESS: Protti, F.; Instituto de Computação, Universidade Federal
Fluminense, Rua Passo da Pátria 156, Bloco E - 3ºandar, São Domingos, Brazil;
ISSN: 18624472
ABBREVIATED SOURCE TITLE: Optim. Lett.
SOURCE: Scopus
Soto, R., Crawford, B., Almonacid, B., Paredes, F.

24403038600;23395875300;56407124500;24773930800;
A migrating birds optimization algorithm for machine-part cell formation problems
(2015) Lecture Notes in Computer Science (including subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics), 9413, pp. 270-281.
Cited 12 times.
3-319-27060-9_22&partnerID=40&md5=e502d856e5607281e0e0a0085675a68b
DOI: 10.1007/978-3-319-27060-9_22
AFFILIATIONS: Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile;
Universidad Autónoma de Chile, Santiago, Chile;
Universidad Científica Del Sur, Lima, Peru;
Universidad Central de Chile, Santiago, Chile;
Universidad San Sebastián, Santiago, Chile;
Escuela de Ingeniería Industrial, Universidad Diego Portales, Santiago, Chile
ABSTRACT: Machine-Part Cell Formation Problems consists in organizing a plant as a
set of cells, each one of them processing machines containing the same type of
parts. In recent years, different meta-heuristic have been used to solve this
problem. This paper addresses the problem of Machine-Part Cell Formation by using
the Migrating Birds Optimization algorithm. The computational experiments show that
in most of the benchmark problems the results obtained from the proposed approach
are better than those obtained by other methods which are reported in the
literature. © Springer International Publishing Switzerland 2015.
AUTHOR KEYWORDS: Cell formation problem; Meta-heuristics; Migrating birds
optimization; Nature-inspired algorithms
INDEX KEYWORDS: Algorithms; Artificial intelligence; Birds; Cells; Cellular
manufacturing; Cytology; Machinery; Problem solving; Soft computing, Bench-mark
problems; Cell formation problem; Computational experiment; Meta heuristics;
Migrating birds; Nature inspired algorithms; Optimization algorithms; Processing
machines, Optimization
REFERENCES: Alkaya, A.F., Algin, R., Metaheuristic based solution approaches for
the obstacle neutralization problem (2015) Expert Syst. Appl, 42 (3), pp. 1094-
1105;
Badgerow, J.P., Hainsworth, F.R., Energy savings through formation flight? A
reexamination of the vee formation (1981) J. Theor. Biol, 93 (1), pp. 41-52;
Bajec, I.L., Heppner, F.H., Organized flight in birds (2009) Anim. Behav, 78 (4),
pp. 777-789;
Int. J. Prod. Res, 29 (2), pp. 343-356;
Burbidge, J.L., Production flow analysis (1963) Prod. Eng, 42 (12), pp. 742-752;
Crawford, B., Soto, R., Zuñiga, G., Monfroy, E., Paredes, F., Modeling
manufacturing cell design problems: CP vs. MH (2014) HCI 2014, Part I. CCIS, 434,
pp. 498-502., In: Stephanidis, C. (ed.), Springer, Heidelberg;
Inf. Sci, 217, pp. 65-77;
Duran, O., Rodriguez, N., Consalter, L.A., Hybridization of PSO and a discrete
position update scheme techniques for manufacturing cell design (2008) MICAI 2008,
5317, pp. 503-512., In: Gelbukh, A., Morales, E.F. (eds.), Springer, Heidelberg;
Durán, O., Rodriguez, N., Consalter, L.A., Collaborative particle swarm opti
mizationwith a data mining technique for manufacturing cell design (2010) Expert
Syst. Appl, 37 (2), pp. 1563-1567;
Gunasingh, K.R., Lashkari, R., Simultaneous grouping of parts and machines in
cellular manufacturing systemsan integer programming approach (1991) Comput. Ind.
Eng, 20 (1), pp. 111-117;
Hummel, D., Beukenberg, M., Aerodynamische interferenzeffekte beim formationsflug
von vögeln (1989) J. für Ornithologie, 130 (1), pp. 15-24;
Joines, J.A., Kay, M.G., King, R.E., Thomas Culbreth, C., A hybrid genetic
algorithm for manufacturing cell design (2000) J. Chin. Inst. Ind. Eng, 17 (5), pp.
549-564;
Kusiak, A., The part families problem in flexible manufacturing systems (1985) Ann.
Oper. Res, 3 (6), pp. 277-300;
machine-part cell formation problems (2010) Comput. Oper. Res, 37 (12), pp. 2071-
2081;
Lissaman, P., Shollenberger, C.A., Formation flight of birds (1970) Science, 168
(3934), pp. 1003-1005;
algorithm for manufacturing cell design (1999) J. Oper. Res. Soc, 50 (5), pp. 509-
516;
implementationa state-of-the-art survey (1985) Omega, 13 (5), pp. 381-391;
Niroomand, S., Hadi-Vencheh, A., Sahin, R., Vizvari, B., Modified migrating birds
manufacturing systems (2015) Expert Syst. Appl, p. 42;
Pan, Q.K., Dong, Y., An improved migrating birds optimisation for a hybrid flowshop
scheduling with total flowtime minimisation (2014) Inf. Sci, 277, pp. 643-655;
Purcheck, G.F.K., A linear-programming method for the combinatorial grouping of an
incomplete power set (1975) J. Cybern, 5 (4), pp. 51-76;
Rayner, J., A new approach to animal flight mechanics (1979) J. Exp. Biol, 80 (1),
pp. 17-54;
Seifoddini, H., Hsu, C.P., Comparative study of similarity coefficients and
clustering algorithms in cellular manufacturing (1994) J. Manuf. Syst, 13 (2), pp.
119-127;
Selim, H., Askin, R., Vakharia, A., Cell formation in group technology: Review,
evaluation and directions for future research (1998) Comput. Ind. Eng, 34 (1), pp.
3-20;
Shafer, S.M., Rogers, D.F., A goal programming approach to the cell formation
problem (1991) J. Oper. Manage, 10 (1), pp. 28-43;
Soto, R., Kjellerstrand, H., Durán, O., Crawford, B., Monfroy, E., Paredes, F.,
Cell formation in group technology using constraint programming and boolean
satisfiability (2012) Expert Syst. Appl., 39 (13), pp. 11423-11427;
Soto, R., Kjellerstrand, H., Gutiérrez, J., López, A., Crawford, B., Monfroy, E.,
Solving manufacturing cell design problems using constraint programming (2012)
IEA/AIE 2012, 7345, pp. 400-406., In: Jiang, H., Ding, W., Ali, M., Wu, X. (eds.),
Springer, Heidelberg;
Venugopal, V., Narendran, T., A genetic algorithm approach to the machinecomponent
grouping problem with multiple objectives (1992) Comput. Ind. Eng, 22 (4), pp. 469-
480;
(2004) Int. J. Adv. Manuf. Technol, 23 (11), pp. 916-924;
manufacturing cell formation problems (2008) Expert Syst. Appl, 34 (3), pp. 1609-
1617
CORRESPONDENCE ADDRESS: Almonacid, B.; Pontificia Universidad Católica de
ValparaísoChile; email: [email protected]
EDITORS: Sidorov G., Galicia-Haro S.N.
ISSN: 03029743
ISBN: 9783319270593
ABBREVIATED SOURCE TITLE: Lect. Notes Comput. Sci.
SOURCE: Scopus
Thanh, L.T., Ferland, J.A., Thuc, N.D., Nguyen, V.H.

55249417500;57193718834;6508065364;7203068700;
Simulated annealing method with different neighborhoods for solving the cell
formation problem
(2011) ECTA 2011 FCTA 2011 - Proceedings of the International Conference on
Evolutionary Computation Theory and Applications and International Conference on
Fuzzy Computation Theory and Applications, pp. 525-533.
84862222847&partnerID=40&md5=a06e70f31d32c5c3f102ff419f5b2516
AFFILIATIONS: (ICST HCMC), Institute for Computational Science and Technology, Ho

Chi Minh City, Viet Nam;
Department of Computer Science and Operations Research, University of Montreal,
Montreal, Canada;
Faculty of Information Technology, University of Science, Vietnam National
University, Ho Chi Minh City, Viet Nam;
Department of Mathematics, University of Namur (FUNDP), Namur, Belgium
ABSTRACT: In this paper we solve the cell formation problem with different variants
of the simulated annealing method obtained by using different neighborhoods of the
current solution. The solution generated at each iteration is obtained by using a
diversification of the current solution combined with an intensification to improve
this solution. Different diversification and intensification strategies are
combined to generate different neighborhoods. The most efficient variant allows
improving the best-known solution of one of the 35 benchmark problems commonly used
by authors to compare their methods, and reaching the best-known solution of 30
others.
AUTHOR KEYWORDS: Cell formation problem; Diversification; Intensification;
Metaheuristic; Neighborhood; Simulated annealing
INDEX KEYWORDS: Cell formation problem; Diversification; Intensification;
Metaheuristic; Neighborhood, Cellular manufacturing, Simulated annealing
pp. 101-113;
2097-2116;
Cerny, V., Thermodynamical approach to the traveling salesman problem: An efficient
simulation algorithm (1985) Journal of Optimization Theory and Application, 45, pp.
41-51;
Research, 24, pp. 1221-1233;
Research, 24, pp. 451-464;
Applications, , to appear;
Ferland, J.A., Costa, D., (2001) Heuristic Search Methods for Combinatorial
Programming Problems, , Publication # 1193, Department of computer science and
operation research, University of Montreal, Canada;
Ghosh, T., Dan, P.K., Sengupta, S., Chattopadhyay, M., Genetic rule based
techniques in cellular manufacturing (1992-2010): A systematic survey (2010)
International Journal of Engineering Science and Technology, 2, pp. 198-215;
James, T.L., Brown, E.C., Keeling, K.B., A hybrid Grouping Genetic Algorithm for
2079;
Khoa, T., Ferland, J.A., Tien, D., A randomized local search algorithm for the
machine-part cell formation problem (2011) Advanced Intelligent Computing
Technology and Applications-ICIC2011, , to appear;
Research, 18, pp. 213-232;
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P., Optimization by simulated
annealing (1983) Science, 220, pp. 671-680;
King, J.R., Nakornchai, V., Machinecomponent group formation in group technology:
117-133;
Kumar, C., Chandrasekharan, M., Grouping efficiency: A quantitative criterion for
1728;
397;
2633-2646;
Luo, L., Tang, L., A hybrid approach of ordinal optimization and iterated local
search for manufacturing cell formation (2009) International Journal of Advanced
1009;
implementation (1985) OMEGA, 13, pp. 381-391;
technology machine clustering problem (1985) OMEGA, 13, pp. 577-583;
Papaioannou, G., Wilson, J.N., The evolution of cell formation problem
Rojas, W., Solar, M., Chacon, M., Ferland, J.A., An efficient genetic algorithm to
and Manufacture VI, pp. 173-184., I.C. Parmee (ed), Springer-Verlag;
new grouping efficiency measure (2001) IIE Transactions, 33, pp. 11-27;
Research, 28, pp. 145-152;
Tunnukij, T., Hicks, C., An Enhanced Genetic Algorithm for solving the cell
1989-2007;
Waghodekar, P.H., Sahu, S., Machinecomponent cell formation in group technology
Engineering, 5, pp. 22-42
CORRESPONDENCE ADDRESS: Thanh, L.T.; (ICST HCMC), Institute for Computational
Science and Technology, Ho Chi Minh City, Viet Nam; email: [email protected]
ISBN: 9789898425836
ABBREVIATED SOURCE TITLE: ECTA FCTA - Proc. Int. Conf. Evol. Comput. Theory Appl.
Int. Conf. Fuzzy Comput. Theory Appl.
SOURCE: Scopus
Tavakkoli-Moghaddam, R., Ghodratnama, A., Makui, A., Khazaei, M.

56491438400;9843487600;23975046700;57210092001;
Solving a new bi-objective model for a cell formation problem considering labor
allocation by multi-objective particle swarm optimization
84455189105&doi=10.5829%2fidosi.ije.2011.24.03a.04&partnerID=40&md5=a57b16611c0cade
aca64eb2db96ead56
DOI: 10.5829/idosi.ije.2011.24.03a.04
University of Tehran, P.O. Box 11155-4563, Tehran, Iran;
Postal Code 1684613114, Tehran, Iran;
Department of Industrial Engineering, University of Payam Noor, Postal Code
1084668611, Tehran, Iran
ABSTRACT: Mathematical programming and artificial intelligence (AI) methods are
known as the most effective and applicable procedures to form manufacturing cells
in designing a cellular manufacturing system (CMS). In this paper, a bi-objective
programming model is presented to consider the cell formation problem that is
solved by multi-objective particle swarm optimization (MOPSO) algorithm. The model
contains two conflicting objectives, namely optimal labor allocation and
maximization of cell utilization. In order to verify its effectiveness of the MOPSO
algorithm, the results are compared with those obtained from a well-known
evolutionary procedure, called NSGA-II.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing system; Labor allocation;
Multi-objective particle swarm optimization
INDEX KEYWORDS: Algorithms; Artificial intelligence; Cells; Cellular manufacturing;
Computer programming; Flexible manufacturing systems; Mathematical programming;
Particle swarm optimization (PSO), Biobjective model; Cell formation; Cell
formation problem; Cellular manufacturing system; Labor allocation; Multi objective
particle swarm optimization; NSGA-II; Programming models, Multiobjective
optimization
REFERENCES: Joines, J.A., Culbreth, C.T., King, R.E., A comprehensive review of
production oriented manufacturing cell formation technique (1996) Technical Report,
NCSU-IE Technical Report, , Raleigh, NC: North Carolina State University;
Onwunbolu, C., Mutingi, M., A genetic algorithm approach to cellular manufacturing
Rogers, D.F., Kulkarni, S.S., Optimal bivariate clustering and a genetic algorithm
with an application in cellular manufacturing (2005) European Journal of
Peker, A., Kara, Y., Parameter setting of the fuzzy ART neural network to part-
machine cell formation problem (2004) International Journal of Production Research,
42 (6), pp. 1257-1278;
Manufacturing cell creation with machine modification costs (2006) Computers and
Operations Research, 33 (4), pp. 1010-1032., DOI 10.1016/j.cor.2004.09.001, PII
S0305054804002230, Part Special Issue: Optimization Days 2003;
Yang, M.S., Hung, W.L., Cheng, F.C., Mixed-variable fuzzy clustering approach to
part family and machine cell formation for GT applications (2006) International
Journal of Production Economic, 103, pp. 185-198;
the cell formation problem (2007) Computers and Operations Research, 34 (7), pp.
2059-2079., DOI 10.1016/j.cor.2005.08.010, PII S0305054805002649;
Ozdemir, R.G., Gencyilmaz, G., Aktin, T., The modified fuzzy art and a two-stage
clustering approach to cell design (2007) Information Sciences, 177 (23), pp. 5219-
5236., DOI 10.1016/j.ins.2007.06.027, PII S0020025507003234, Including: Mathematics
of Uncertainty;
Expert Systems with Applications, 36 (3), pp. 6598-6604;
grouping (2009) Computers and Industrial Engineering, 56 (1), pp. 347-356;
Andres, C., Lozano, S., A particle swarm optimization algorithm for part-machine
grouping (2006) Robotics and Computer-Integrated Manufacturing, 22 (5-6), pp. 468-
474., DOI 10.1016/j.rcim.2005.11.013, PII S0736584506000597;
Tavakkoli-Moghadam, R., Rabbani, M., Godratnama, A., Safaei, N., An efficient
algorithm to allocate parts to cells maximizing cell efficiency (2004)
International Journal of Engineering, Transactions B: Applications, 17 (4), pp.
381-388., http://www.ijeir.info/fulltext/
{58b2f91dd97ca245637823c1916d4137}/682/17/;
Kim, C.O., Baek, J.G., Baek, J.K., A two-phase heuristic algorithm for cell
Lei, D., Wu, Z., Tabu search-based approach to multi-objective machine-part cell
formation (2005) International Journal of Production Research, 43 (24), pp. 5241-
5252;
Tavakkoli-Moghaddam, R., Minaeian, S., Rabbani, M., A new multi-objective model for
dynamic cell formation problem with fuzzy parameters (2008) International Journal
of Engineering, 21 (2), pp. 159-172;
Dimopoulos, C., Multi-objective optimization of manufacturing cell design (2006)
International Journal of Production Research, 44 (22), pp. 4855-4875., DOI
10.1080/00207540600620773, PII U427LP7550425410;
manufacturing design and layo1ut (2007) European Journal of Operational Research,
181, pp. 156-167;
Bajestani, M.A., Rabbani, M., A multi-objective scatter search for a dynamic cell
formation problem (2009) Computers and Operations Research, 36, pp. 777-794;
Tavakkoli-Moghaddam, R., Ranjbar-Bourani, M., Mirzahosseinian, H., Aryanezhad,
M.B., A new multi-objective model for a cell formation problem considering machine
utilization and alternative process routes (2009) International Journal of
Cesani, V.I., Steudel, H.J., A study of labor assignment flexibility in cellular
manufacturing systems (2005) Computers and Industrial Engineering, 48 (3), pp. 571-
591., DOI 10.1016/j.cie.2003.04.001, PII S0360835204002037,
GroupTechnology/Cellular Manufacturing;
Suer, G.A., Cosner, J., Models for cell loading and product sequencing in labor-
intensive cells (2009) Computers and Industrial Engineering, 56 (1), pp. 97-105;
review and survey (2005) Computers and Industrial Engineering, 48 (3), pp. 507-
523., DOI 10.1016/j.cie.2003.03.002, PII S0360835204001998,
Slomp, J., Chowdary, B.V., Suresh, N.C., Design of virtual manufacturing cells: A
S0736584504001036;
Slomp, J., Bokhorst, J.A.C., Molleman, E., Cross-training in a cellular
manufacturing environment (2005) Computers and Industrial Engineering, 48 (3), pp.
609-624., DOI 10.1016/j.cie.2003.03.004, PII S0360835204002050,
Suer, G.A., Arikan, F., Babayigit, C., Effects of different fuzzy operators On
fuzzy bi-objective cell loading problem in labor-intensive manufacturing cells
Satoglu, S.I., Suresh, N.C., A goal programming approach for design of hybrid
cellular manufacturing (2009) Systems in Dual Resource Constrained Environments, 56
(2), pp. 560-575;
Abraham, A., Jain, L., Goldberg, R., Evolutionary Multi-objective Optimization:
Theoretical Advances and Applications, , Springer;
Deb, K., (2003) Multi-Objective Optimization using Evolutionary Algorithms, , John
Willey and Sons;
Kennedy, J., Eberhart, R.C., Particle swarm optimization (1995) Proceedings of the
IEEE International Conference on Neural Networks, pp. 1942-1948;
Kennedy, J., Eberhart, R.C., Shi, Y., (2001) Swarm Intelligence, , San Francisco,
CA: Morgan Kaufmann;
algorithm (1997) Proceedings of the IEEE International Conference on Neural
Networks, pp. 4104-4109;
Coello Coello, C.A., Lechuga, M.S., MOPSO: A proposal for multiple objective
particle swarm optimization (2002) IEEE, pp. 1051-1056;
Reyes-Sierra, M., Coello Coello, C.A., Multi-objective particle swarm optimizers: A
survey of the state-of- The-art (2006) International Journal of Computational
Intelligence Research, 2 (3), pp. 287-308;
Coello Coello, C.A., Lechuga, M.S., Handling multiple objectives with particle
swarm optimization (2004) IEEE Transactions on Evolutionary Computation, 8 (3), pp.
256-279;
Coello Coello, C.A., Lamont, G.B., (2007) Evolutionary Algorithms for Solving
Multi-objective Problems, , Springer, Second Edition;
Poli, R., Kennedy, J., Blackwell, T., Particle swarm optimization: An overview
(2007) Swarm Intelligence, 1, pp. 33-57
Engineering, College of Engineering, University of Tehran, P.O. Box 11155-4563,
ISSN: 17281431
SOURCE: Scopus
Boctor, F.F.
7005106094;
The minimum-cost, machine-part cell formation problem
40 times.
0030127862&doi=10.1080%2f00207549608904949&partnerID=40&md5=5364f28af2f1a28713ff1be
c7d71827e
DOI: 10.1080/00207549608904949
AFFILIATIONS: Facultié des Sciences de L’Administration, Universite Laval, QC, GI K
7P4, Canada
ABSTRACT: This paper argues that it is essential to consider explicitly the main
elements of manufacturing costs in designing cellular manufacturing systems.
Consequently, a mixed linear program is introduced to help solve the cell formation
problem where the objective is to minimise the sum of these cost elements. A method
to determine its optimal solution is proposed as well as an adaptation of the
simulated annealing algorithm designed to achieve good approximate solutions.
Finally, a quick assessment of the performance of this simulated annealing
adaptation is provided. © 1996 Taylor and Francis Group, LLC.
INDEX KEYWORDS: Algorithms; Costs; Linear programming; Machinery; Performance;
Scheduling; Simulated annealing, Machine part cell formation problem; Simulated
annealing algorithm, Manufacture
REFERENCES: Askin, R.G., Chiu, K.S., A graph partitioning procedure for machine
assignment and cell formation in group technology (1990) International Journal of
113;
Balasubramanlan, K.N., Panneerselvam, R., Covering technique-based algorithm for
machine grouping to form manufacturing cells (1993) International Journal of
Research, 25 (5), pp. 639-665;
Boctor, F.F., Alternative formulations of the machine-part cell formation problem
(1989) Flexible Manufacturing Systems: Operations Research Models and Applications,
pp. 133-140., K. Stecke and R. Suri (eds) (North Holland: Elsevier;
Research, 24 (2), pp. 451-464;
Chandrasekharan, M.P., Rajagopalan, R., MODROC: An extension to rank order
Research, 24 (5), pp. 1221-1233;
Chow, W.S., Kusiak, A., Cluster analysis for group technology (1988) Industrial
Chu, C.-H., Clustering analysis in manufacturing cell formation (1989) OMEGA, 17
(2), pp. 289-295;
Chu, C.-H., Tsai, M., A comparison of three array-based clustering techniques for
manufacturing cell formation (1990) International Journal of Production Research,
28 (8);
Co, H.C., Araar, A., Configuring cellular manufacturing systems (1988)
Faber, Z., Carter, M.W., A new graph theory approach for forming machine cells
(1986) Flexible Manufacturing Systems: Methods and Studies A, pp. 301-318., Kusiak
(ed) (Norlh-Holland: Elsevier;
Ferreira-Ribeiro, J.F., Pradin, B., A methodology for cellular manufacturing design
(1993) Internationa! Journal of Production Research, 31 (1), pp. 235-250;
Garcia, H., Mutel, B., Proth, J.-M., (1985) Families De Produits Et Ilots De
Fabrication: Cas Des Machines Multiples, , Research report 469, 1NR1A, France;
manufacturing systems-A sequential modeling approach (1989) Computers and
machine-component grouping decisions in the design of a cellular manufacturing
system (1990) International Journal of Production Research, 28 (7), pp. 1247-1269;
Harhalakis, G., Proth, J.M., Xie, X.L., Manufacturing cell design using simulated
annealing: An industrial approach (1991) Journal of Intelligent Manufacturing, 1
(2), pp. 185-191;
Jacobs, F.R., Muth, J.F., Large scale clustering for group technology part family
and tooling analysis (1988) Orsajtlms Meeting, , Denver, Colorado;
Kaparthi, S., Suresh, N.C., Machine-component cell formation in group technology: A
neural network approach (1992) International Journal of Production Research, 30
(6), pp. 1353-1367;
Khator, S.K., Irani, S.A., Cell formation in group technology: A new approach
Research, 18 (2), pp. 213-232;
King, J.R., Nakornchai, V., Machine-component group formalion in group technology:
pp. 117-133;
manufacturing systems (1986) European Journal of Operations Research, 24 (3), pp.
387-397;
Kusiak, A., The part families problem in flexible manufacturing systems (1985)
Annals of Operations Research, 3, pp. 279-300;
Kusiak, A., An expert system for group technology (1987) Industrial Engineering, 19
(10), pp. 56-61;
Kusiak, A., Boe, W.J., Cheng, C.H., Designing cellular manufacturing systems:
Branch-and-bound and A* approaches (1993) HE Transactions, 25 (4), pp. 46-56;
Kusiak, A., Cheng, C.H., A branch-and-bound algorithm for solving the group
technology problem (1990) Annals of Operations Research, 26, pp. 415-431;
Lee, H.C., Malave, C.O., Ramachandran, S., A self-reorganizing neural network
approach for the design of cellular manufacturing systems (1992) Journal of
Intelligent Manufacturing, 3 (2), pp. 325-332;
603-612;
Lemoinh, Y., Mutee, B., Automatic recognition of production cells and part families
(1983) Advances in CAD/CAM, p. 239., (T. M. R. Ellis and O. 1. Semenkov) (eds)
(North-Holland: Elsevier;
Logendran, R., A workload based model for minimizing total intercell and intracell
moves in cellular manufacturing (1990) International Journal of Production
Research, 28 (5), pp. 913-925;
Mc Aueay, J., Machine grouping for efficient production (1972) Production
Engineering, 51, p. 54;
data reorganization by a clustering technique (1972) Operations Research, 20 (5),
pp. 993-1009;
Mutee, B., Computer-aided group technology integrated system (1988) Annals of the
CIRP, 37 (1), pp. 425-428;
Purcheck, G., Machine-component group formation: An heuristic method for flexible
production cells and flexible manufacturing systems (1985) International Journal of
Rajagoplan, R., Batra, J.L., Design of cellular production systems-a graph-
567-579;
Seieoddini, H., A note on the similarity coefficient method and the problem of
Seieoddini, H., Duplication process in machine cells formation in group technology
(1989) HE Transactions, 21 (4), pp. 382-388;
Seieoddini, H., Wolee, P.M., Selection of a threshold value based on material
handling cost in machine-component grouping (1987) HE Transactions, 19 (3), pp.
266-270;
Siiaeer, S.M., Rogers, D.F., A goal programming approach to the cell formation
problem (1991) Journal of Operations Management, 10 (1), pp. 28-43;
Shaeer, S.M., Rogers, D.F., Similarity and distance measures for cellular
manufacturing: I. Survey (1993) International Journal of Production Research, 31
(5), pp. 1133-1142;
Shai-Er, S.M., Rogers, D.F., Similarity and distance measures for cellular
manufacturing: 11. An extension and comparison (1993) International Journal of
Shrijver, A., (1986) Theory of Linear and Integer Programming, , New York: Wiley);
Siituh, A., Modelling group technology cell formation as a generalized assignment
problem (1989) International Journal of Production Research, 27 (5), pp. 775-782;
Research, 28 (1), pp. 145-152;
Srinivasan, G., Narendran, T.T., GRAFICS-A nonhierarchical clustering algorithm for
463-478;
Stanfel, L.E., Machine clustering for economic production (1985) Engineering Cost
Tremoeieres, R., Group Technology by natural clustering (1987) Proceedings of the
29Th CORS Conference, , Calgary, Canada;
Vakharia, A., Methods of cell formation in group technology: A framework for
evaluation (1986) Journal of Operations Management, 6 (3), pp. 257-271;
materials flow approach based on operation sequences (1990) HE Transactions, 22
(1), pp. 84-97;
Vannelli, A., Hall, R.G., An eigenvector solution methodology for finding part
machine families (1993) International Journal of Production Research, 31 (2), pp.
325-349;
Vannelli, A., Kumar, K.R., A method for finding minimal bottle-neck for grouping
part-machine families (1986) International Journal of Production Research, 24 (2),
pp. 387-400;
Ventura, J.A., Chen, F.F., Wu, C.-H., Grouping parts and tools in flexible
manufacturing systems production planning (1990) International Journal of
Venugopal, V., Narendran, T.T., Cell formation in manufacturing systems through
simulated annealing: An experimental evaluation (1992) European Journal of
Wei, J.C., Kern, G.M., Communality analysis: A linear cell clustering algorithm for
2053-2062;
pp. 1409-1421;
Xu, H., Wang, H.-P., Part family formation for GT applications based on fuzzy
mathematics (1989) International Journal of Production Research, 27 (9), pp. 1637-
1651
CORRESPONDENCE ADDRESS: Boctor, F.F.; Facultié des Sciences de L’Administration,
Universite Laval, QC, GI K 7P4, Canada
ISSN: 00207543
SOURCE: Scopus
Dinh, T., Dinh, T., Ferland, J.

24764504900;36470004000;57193718834;
A meta-heuristic approach for cell formation problem
(2011) ACM International Conference Proceeding Series, pp. 11-18.
82955187004&doi=10.1145%2f2069216.2069223&partnerID=40&md5=a9d4aa254686737c37c9d8fa
46dc7fac
DOI: 10.1145/2069216.2069223
AFFILIATIONS: Faculty of Information Technology, University of Science, VNU-HCMC,
227 Nguyen Van Cu, Ho Chi Minh City, Viet Nam;
Interuniversity Research Center on Enterprise Networks, Logistics and
Transportation, Université de Montréal, Succ. Centre-Ville, Montréal, QC, Canada
ABSTRACT: Cell Formation Problem (CFP) is used widely in Cellular Manufacturing.
However, until now very few test cases out of 35 cases have been proved optimality
[8]. The others are just feasible. In this paper, we apply 2 different meta-
heuristic approaches which are Simulated Annealing and Tabu Search to find feasible
solutions in a reasonable time. Then, we compare our results with that of the
Genetic Algorithm [7] on the same 35 test data. In our experiments, the Tabu Search
approach shows equal or better solutions than Genetic Algorithm and Simulated
Annealing on all test data. © 2011 ACM.
AUTHOR KEYWORDS: cell formation problem; meta-heuristic; simulated annealing;
tabu search
INDEX KEYWORDS: Cell formation problem; Feasible solution; Meta-heuristic approach;
Metaheuristic; Optimality; Test case; Test data, Cells; Cellular manufacturing;
Communication; Genetic algorithms; Heuristic methods; Information technology; Tabu
search, Simulated annealing
REFERENCES: Bajestani, A.M., Rabbani, M., Rahimi-Vahed, A.R., Khoshkhou, G.B., A
multi objective scatter search for a dynamic cell formation problem (2009)
Computers and Operations Research, 36, pp. 777-794;
Chan, W.M., Chan, C.Y., Ip, W.H., A heuristic algorithm for machine assignment in
cellular layout (2003) Computers and Industrial Engineering, 44 (1), pp. 49-73.,
DOI 10.1016/S0360-8352(02)00184-5, PII S0360835202001845;
Research, 44 (12), pp. 2421-2444;
integrated cell formation and lot sizing considering product quality (2008)
European Journal of Operational Research, 187 (1), pp. 46-69., DOI
10.1016/j.ejor.2007.02.040, PII S037722170700272X;
Diaby, M., Nsakanda, A.L., Large-scale capacitated part-routing in the presence of
process and routing flexibilities and setup costs (2006) Journal of the Operational
Research Society, 57 (9), pp. 1100-1112., DOI 10.1057/palgrave.jors.2602072, PII
2602072;
Elbenani, B., Ferland, J.A., Bellemare, J., (2010) Genetic Algorithm and Large
Neighborhood Search to Solve the Cell Formation Problem, , Technical report,
Publication CIRRELT, Universite de Montreal, Quebec, Canada;
Elbenani, B., Ferland, J.A., (2010) An Exact Method for Solving the Manufacturing
Cell Formation Problem, , Technical report, Publication CIRRELT, Universite de
Montreal, Quebec, Canada;
Operations Research, 33 (4), pp. 1010-1032., DOI 10.1016/j.cor.2004.09.001, PII
S0305054804002230, Part Special Issue: Optimization Days 2003;
Glover, F., Tabu search-Part I (1989) ORSA Journal on Computing, 1 (3), pp. 190-
206;
Glover, F., Tabu search-Part II (1990) ORSA Journal on Computing, 2 (1), pp. 4-32;
Golcalves, J., Resende, M.G.C., An evolutionary algorithm for manufacturing cell
formation (2004) Computer and Industrial Engineering, 47, pp. 247-273;
2059-2079., DOI 10.1016/j.cor.2005.08.010, PII S0305054805002649;
Lou, L., Tang, L., A hybrid approach of ordinal optimization and iterated local
search for manufacturing cell formation (2009) Internal Journal of Advance
Manufacturing Technology;
Mahdavi, I., Paydar, M.M., Solimanpur, M., Heidarzade, A., Genetic Approach for
solving a Cell Formation Problem in cellular manufacturing (2009) Expert Systems
Mukattash, A.M., Adil, M.B., Tahboub, K.K., Heuristic approaches for part
assignment in cell formation (2002) Computers and Industrial Engineering, 42, pp.
329-341;
Nsakanda, A.L., Diaby, M., Price, W.L., Hybrid genetic approach for solving large-
scale capacitated cell formation problems with multiple routings (2006) European
Journal of Operational Research, 171 (3), pp. 1051-1070., DOI
10.1016/j.ejor.2005.01.017, PII S0377221705001268, Feature Cluster: Heuristic and
Stochastic Methods in Optimization;
Papaioannou, G., Wilson, J.M., Fuzzy extensions to integer programming models of
cell-formation problems in machine scheduling (2008) Annals of Operations Research,
, Available online 10.1007/s10479-008-0423-1;
research (2010) European Journal of Operational Research, pp. 509-521;
707-720;
0862-2;
Tavakkoli-Moghaddam, R., Aryanezhad, M.B., Safaei, N., Vasei, M., Azaron, A., A new
approach for the cellular manufacturing problem in fuzzy dynamic conditions by a
genetic algorithm (2007) Journal of Intelligent and Fuzzy Systems, 18 (4), pp. 363-
376;
Tunnukij, T., Hicks, C., An Enhanced Genetic Algorithm for solving Cell Formation
Problem (2009) International Journal of Production Research, 47, pp. 1989-2007;
Venkumar, P., Haq, A.N., Complete and fractional cell formation using Kohonen self-
organizing map networks in a cellular manufacturing system (2006) International
10.1080/00207540500507450, PII NUQ6025836653G03;
Wu, X., Chao-Hsien, C., Wang, Y., Yan, W., A genetic algorithm for cellular
181, pp. 156-167;
(12), pp. 2071-2081;
152
CORRESPONDENCE ADDRESS: Dinh, T.; Faculty of Information Technology, University of
Science, VNU-HCMC, 227 Nguyen Van Cu, Ho Chi Minh City, Viet Nam; email:
[email protected]
ISBN: 9781450308809
ABBREVIATED SOURCE TITLE: ACM Int. Conf. Proc. Ser.
SOURCE: Scopus
Wu, T.-H., Chang, C.-C., Yeh, J.-Y.

7404814990;57142825500;7201896104;
A hybrid heuristic algorithm adopting both Boltzmann function and mutation operator
for manufacturing cell formation problems
(2009) International Journal of Production Economics, 120 (2), pp. 669-688. Cited
30 times.
67749139452&doi=10.1016%2fj.ijpe.2009.04.015&partnerID=40&md5=7eb6fef1da956e942e7b0
b623badad2d
DOI: 10.1016/j.ijpe.2009.04.015
Department of Information Management, Jen-Teh Junior College of Medicine, Nursing
and Management, 79-9, Shijou Li, Houlong, Miaoli 356, Taiwan;
Department of Information Management, National Chiayi University, 300, Syuefu Road,
Chiayi City 600, Taiwan
ABSTRACT: This study proposes a hybrid heuristic algorithm employing both the
Boltzmann function from simulated annealing and the mutation operator from the
genetic algorithm to explore the unvisited solution region and expedite the
solution searching process for the cell formation problem, so that grouping
efficacy is maximized. Test problems drawn from the literature are used to test the
performance of the proposed heuristic algorithm. The comparative study shows that
the proposed algorithm improves the best results found in the literature for 36% of
the test problems in the case when singletons solutions are allowed. © 2009
Elsevier B.V. All rights reserved.
AUTHOR KEYWORDS: Boltzmann function; Cell formation problem; Hybrid heuristic;
Mutation operator
INDEX KEYWORDS: Boltzmann function; Cell formation problem; Comparative studies;
Grouping efficacy; Hybrid heuristic; Hybrid heuristic algorithms; Manufacturing
cell formation; Mutation operator; Mutation operators; Test problem, Cell
membranes; Cellular manufacturing; Flexible manufacturing systems; Heuristic
methods; Portals; Simulated annealing; Steel structures, Heuristic algorithms
pp. 2097-2116;
Research, 24 (2), pp. 451-464;
Chandrashekharan, M.P., Rajagopalan, R., MODROC: an extension of rank order
Research, 24 (5), pp. 1221-1233;
Research, 36, pp. 1325-1337;
Heragu, S., (1997) Facilities Design, , PWS Publishing Company, Boston, MA;
Research, 18 (2), pp. 213-232;
review and extension (1982) International Journal of Production Research, 20 (2),
pp. 117-133;
Kumar, C.S., Chandrasekharan, M.P., Grouping efficacy: a quantitative criterion for
397;
1715-1728;
2633-2646;
1009;
theoretical approach (1975) International Journal of Production Research, 13, pp.
256-268;
419-426;
handling cost in the machine-component grouping (1987) IIE Transactions, 19, pp.
266-270;
Srinivasan, G., Narendran, T., Mahadevan, B., An assignment model for part-families
problem in group technology (1990) International Journal of Production Research,
28, pp. 145-152;
2075-2084;
1409-1421;
Wu, T.-H., Chang, C.-C., Chung, S.-H., A simulated annealing algorithm for
pp. 1609-1617;
17;
problem: a taxonomy and review (2006) International Journal of Production
[email protected]
ISSN: 09255273
CODEN: IJPCE
ABBREVIATED SOURCE TITLE: Int J Prod Econ
SOURCE: Scopus
Hwang, H., Ree, P.

57013250000;7801595573;
Routes selection for the cell formation problem with alternative part process plans
(1996) Computers and Industrial Engineering, 30 (3 SPEC. ISS.), pp. 423-431. Cited
39 times.
8352%2896%2900011-3&partnerID=40&md5=35837ca0b760fc76c3c20449bb6f1072
DOI: 10.1016/0360-8352(96)00011-3
AFFILIATIONS: Department of Industrial Engineering, Korea Adv. Inst. Sci. and
Technol., 373-1 Kusong-dong, Yusong-gu, Taejon 305-701, South Korea;
Department of Industrial Engineering, College of Engineering, Keimyung University,
1000 Shindang-dong, Dalseo-gu, Taegu 704-701, South Korea
ABSTRACT: This article proposes a two stage procedure for the cell formation
problem with alternative process plans. At the first stage of the procedure, the
route selection problem is solved with the objective of maximizing the sum of
compatibility coefficients among selected process plans. At the second stage, part
families are formed based on the result of the first stage using the p-median
problem. The grouping solutions based on the proposed procedure are compared with
those of the generalized p-median model in terms of the number of exceptional
elements, grouping efficiency and grouping efficacy. Copyright © 1996 Elsevier
Science Ltd.
INDEX KEYWORDS: Integer programming; Machine tools; Mathematical models;
Optimization; Planning; Productivity, Cell formation problem; Part process plans;
Route selection problem, Manufacture
REFERENCES: Wemmerov, U., Hyer, N.L., Research issues in cellular manufacturing
(1987) Int. J. Prod. Res., 25, pp. 413-431;
pp. 289-295;
Offodile, O.F., Mehrez, A., Grznar, J., Cellular manufacturing: A taxonomic review
framework (1994) J. Manufact. Syst., 13, pp. 196-220;
Kusiak, A., The generalized group technology concept (1987) Int. J. Prod. Res., 25,
pp. 561-569;
in the presence of multiple processing routes (1994) Engng. Optimization, 22, pp.
231-240;
Choobineh, F., A framework for the design of cellular manufacturing system (1988)
Int. J. Prod. Res., 26, pp. 1161-1172;
Sundaram, R.M., Doshi, K., Formation of part families to design cells with
alternative routing consideration (1992) Comp. Ind. Engng., 23, pp. 59-62;
Sundaram, R.M., Doshi, K., Cellular manufacturing system design with alternative
routing consideration (1993) Comp. Ind. Engng., 25, pp. 477-480;
Gupta, T., Design of manufacturing cells for flexible environment considering
alternative routing (1993) Int. J. Prod. Res., 31, pp. 1259-1273;
Sankaran, S., Kasilingam, R., An integrated approach to cell formation and part
routing in group technology manufacturing system (1990) Engng. Optimization, 16,
pp. 235-245;
Nagi, R., Harhalakis, G., Proth, J., Multiple routings and capacity consideration
in group technology applications (1990) Int. J. Prod. Res., 28, pp. 2243-2257;
Rajamani, D., Singh, N., Aneja, P., Integrated design of cellular manufacturing
systems in the presence of alternative process plans (1990) Int. J. Prod. Res., 28,
pp. 1541-1554;
Kang, S.L., Wemmerlov, U., A work load-oriented heuristic methodology for
manufacturing cell formation allowing reallocation of operations (1993) Eur. J.
Oper. Res., 69, pp. 292-311;
J. Prod. Res., 28, pp. 233-243;
(1994) Int. J. Prod. Res., 32, pp. 273-297
CORRESPONDENCE ADDRESS: Hwang, H.; Department of Industrial Engineering, Korea Adv.
Inst. Sci. and Technol., 373-1 Kusong-dong, Yusong-gu, Taejon 305-701, South Korea
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Hosseinabadi Farahani, M., Hosseini, L.

36990344200;36925239500;
An ant colony optimization approach for the machine–part cell formation problem
(2011) International Journal of Computational Intelligence Systems, 4 (4), pp. 486-
496. Cited 8 times.
80052140906&doi=10.1080%2f18756891.2011.9727807&partnerID=40&md5=0906ca1b6d83f59459
98faf26ff6868a
DOI: 10.1080/18756891.2011.9727807
Pasdaran Boulevard, Sanandaj, Iran
ABSTRACT: In this paper, the problem of grouping machines and parts into cells
(machine-part cell formation problem) is considered with the objective of
minimizing grouping efficacy. An ant colony optimization algorithm is developed to
solve such problem. In the proposed algorithm, solutions are constructed in a new
manner, two heuristic algorithms are used to determine part families and machine
cells and the similarity between parts is used as heuristic information. The
proposed algorithm is experimented on 35 test problems from the literature which
shows its advantage over existing algorithms. The algorithm improves the best known
values of the grouping efficacy for 5 problems. © 2011 Taylor & Francis Group, LLC.
AUTHOR KEYWORDS: Ant colony optimization; Cellular manufacturing; Grouping
efficacy; Heuristics; Machine-part cell formation
INDEX KEYWORDS: Ant Colony Optimization algorithms; Ant-colony optimization; Cell
formation problem; Grouping efficacy; Heuristic information; Heuristics; Machine
cell; Machine-part cell formation; Part family; Test problem, Cellular
manufacturing; Heuristic algorithms; Optimization, Problem solving
REFERENCES: Selim, H.M., Askin, R.G., Vakharia, A.J., Cell formation in group
technology: Review, evaluation and directions for future research (1998) Comput.
Ind. Eng., 34 (1), pp. 3-20;
McAuley, J., Machine grouping for efficient production (1972) Prod. Eng., 51 (2),
pp. 53-57;
Romesburg, H.C., (1984) Cluster analysis for Researchers, , Belmont, CA: Lifetime
Learning Publications;
Seifoddini, H.K., Incorporation of the production volume in machine cells formation
in group technology applications, pp. 2348-2356., Proc. 9th Int. Conf. Production
Research, Cincinnati, Ohio;
in cellular manufacturing (2004) Comput. Ind. Eng., 47, pp. 247-273;
using a rank order clustering algorithm (1980) Int. J. Prod. Res., 18, pp. 213-232;

Review and extension (1982) Int. J. Prod. Res., 20 (2), pp. 117-133;
cellular manufacture (1982) J. Manuf. Syst., 1, pp. 65-75;
clustering for group technology (1986) Int. J. Prod. Res., 24 (5), pp. 1221-1264;
Chandrasekharan, M.P., Rajagopalan, R., An ideal seed nonhierarchical clustering
algorithm for cellular manufacturing (1986) Int. J. Prod. Res., 24 (2), pp. 451-
464;
formation of part-families and machine-cells (1987) Int. J. Prod. Res., 25 (6), pp.
835-850;
Srinivasan, G., Narendran, T., GRAFICS: A nonhierarchical clustering algorithm for
group technology (1991) Int. J. Prod. Res., 29, pp. 463-478;
Vannelli, A., Kumar, K.R., A method for finding minimal bottle-neck cells for
grouping part-machine families (1986) J. Intell. Manuf., 24 (2), pp. 387-400;
Askin, R.G., Cresswell, S.H., Goldberg, J.B., Vakharia, A.J., A hamiltonian path
Int. J. Prod. Res., 29 (6), pp. 1081-1100;
Ng, S., On the characterization and measure of machine cells in group technology
(1996) Oper. Res., 44 (5), pp. 735-744;
manufacturing cell formation (2009) Comput. Ind. Eng., 57 (3), pp. 1008-1014;
Kusiak, A., The generalized group technology concept (1987) Int. J. Prod. Res., 25
(4), pp. 561-569;
formulations (2000) Int. J. Prod. Res., 38 (7), pp. 1601-1613;
Int. J. Prod. Res., 26 (7), pp. 1161-1172;
systems: An integer programming approach (1989) Int. J. Prod. Res., 27 (9), pp.
1465-1473;
Shtub, A., Modeling group technology cell formation as a generalized assignment
problem (1989) Int. J. Prod. Res., 27 (5), pp. 775-782;
families problem in group technology (1990) Int. J. Prod. Res., 28, pp. 145-152;
formation (2004) Comput. Ind. Eng., 47, pp. 247-273;
machine groups and part families (1998) Int. J. Prod. Res., 36 (5), pp. 1325-1337;
systems (2001) Comput. Ind. Eng., 39 (1-2), pp. 125-144;
(2004) Int. J. Adv. Manuf. Tech., 23, pp. 916-924;
approach to the cell formation problem (2005) Int. J. Adv. Manuf. Tech., 25, pp.
988-997;
Stawowy, A., Evolutionary strategy for manufacturing cell design (2006) OMEGA, 34,
pp. 1-18;
the cell formation problem (2007) Comput. Oper. Res., 34, pp. 2059-2079;
manufacturing cell formation problems (2008) Expert. Syst. Appl., 34, pp. 1609-
1617;
grouping (2009) Comput, Ind. Eng., 56, pp. 347-356;
(2009) Int. J. Prod. Econ., 120, pp. 669-688;
Expert. Syst. Appl., 36, pp. 6598-6604;
modified ART1 method (2008) Eur. J. Oper. Res., 188 (1), pp. 140-152;
for the manufacturing cells formation problem (2008) Int. J. Adv. Manuf. Tech., 36
(5-6), pp. 589-597;
Hung, W.L., Yang, M.S., Lee, E.S., Cell formation using fuzzy relational clustering
algorithm (2011) Math. Comput. Model., 53 (9-10), pp. 1776-1787;
J. Prod. Res., 28, pp. 233-243;
Bullnheimer, B., Hartl, R.F., Strauss, C., An improved ant system algorithm for the
vehicle routing problem (1999) Ann. Oper. Res., 89, pp. 319-328;
Ahmadizar, F., Barzinpour, F., A hybrid algorithm to minimize makespan for the
permutation flow shop scheduling problem (2010) Int. J. Comput. Int. Sys., 3, pp.
853-861;
Dorigo, M., Gambardella, L.M., Ant colony system: A cooperative learning approach
to the traveling salesman problem (1997) IEEE T. Evolut. Comput., 1, pp. 53-66;
Jaccard, P., Novelles recgerches sur la distribution florale (1908) Bulletin de la
Societe Vaudoise des Sciences Naturelles, 44, pp. 223-270;
Blum, C., ACO Applied to Group Shop Scheduling: A Case Study on Intensification and
Diversification (2002) Lecture Notes in Computer Science, pp. 149-180., Berlin:
Springer-Verlag;
technology using minimum spanning trees (1994) Int. J. Prod. Res., 32, pp. 2149-
2158;
programming for the solution of simple cell formation (2001) Int. J. Prod. Res., 39
(1), pp. 1-19;
Res., 27 (7), pp. 1161-1165;
technology problem (1992) Int. J. Prod. Res., 30 (11), pp. 2633-2646;
Manuf. Syst., 6 (2), pp. 117-124;
(1991) Int. J. Prod. Res., 29 (2), pp. 343-356;
configuration (1987) Int. J. of Prod. Res., 25 (1), pp. 101-113;
Stanfel, L.E., Machine clustering for economic production (1985) Eng. Cost. Prod.
Econ., 9, pp. 73-81;
reorganization by a clustering technique (1972) Oper. Res., 20, pp. 993-1009;
(1973) Int. J. Prod. Res., 11 (4), pp. 399-416;
of binary data matrices for group technology (1989) Int. J. Prod. Res., 27 (6), pp.
1035-1052;
manufacturing (1987) Int. J. Prod. Res., 25 (12), pp. 1715-1728
CORRESPONDENCE ADDRESS: Hosseinabadi Farahani, M.; Department of Industrial
Engineering, University of Kurdistan, Pasdaran Boulevard, Sanandaj, Iran; email:
[email protected]
ISSN: 18756891
ABBREVIATED SOURCE TITLE: Int. J. Comput. Intell. Syst.
SOURCE: Scopus
Saraç, T., Ozcelik, F.

15072920400;55912902400;
Subgradient based solution approach for cell formation problem with alternative
routes
(2010) 24th Mini EURO Conference on Continuous Optimization and Information-Based
Technologies in the Financial Sector, MEC EurOPT 2010, pp. 81-86.
84905493524&partnerID=40&md5=70a2193475ea63a655d5348fd59b4f3a

Eskisehir, Turkey
ABSTRACT: Cell formation is an important, critical and difficult step in cellular
manufacturing. While forming the cells, generally the part routes are used.
Introducing high capacity machines capable of performing different manufacturing
operations makes it possible to manufacture parts according to several alternative
part routes. By ignoring alternative routes, one may miss possibly more effective
manufacturing cell groupings. On the other hand, considering alternative routes
increases the complexity of the problem. In this study, we used modified
subgradient algorithm to solve the continuous form of cell formation problem with
alternative routes. Computational experiments are conducted to verify the
performance of the algorithm. © Izmir University of Economics, Turkey, 2010.
AUTHOR KEYWORDS: Alternative routes; Cell formation problem; Cellular
manufacturing; Modified subgradient algorithm
INDEX KEYWORDS: Optimization, Alternative routes; Cell formation; Cell formation
problem; Computational experiment; High capacity; Manufacturing operations;
Solution approach; Sub-gradient algorithm, Cellular manufacturing
Engineering, 41, pp. 227-240., doi:10.1016/S0360-8352(01)00056-0;
routeings (1996) International Journal of Production Research, 34, pp. 1361-1380.,
doi:10.1080/00207549608904970;
Gasimov, R., Augmented lagrangean duality and nondifferantiable optimization
methods in non-convex programming (2002) Journal of Global Optimization, 24, pp.
187-203., doi:10.1023/A:1020261001771;
Gasimov, R.N., Ustun, O., Solving the quadratic assignment problems using modified
subgradient algorithm (2005) Proceedings of 35th International Conference on
Computers & Industrial Engineering, pp. 757-762., Ed. by M. Bulent Durmusoglu. June
19-22, 2005, Istanbul, Turkey. Cengiz Kahraman;
formation (2004) Computers & Industrial Engineering, 47, pp. 247-273.,
doi:10.1016/j.cie.2004.07.003;
alternative part process plans (1996) Computers and Industrial Engineering, 30, pp.
423-431., doi:10.1016/0360-8352(96)00011-3;
Kasimbeyli, R., Ustun, O., Rubinov, A.M., The modified subgradient algorithm based
on feasible values (2009) Optimization, 58 (5), pp. 535-560.,
doi:10.1080/02331930902928419;
of Production Research, 25, pp. 561-569., doi:10.1080/00207548708919861;
2633-2646., doi:10.1080/00207549208948181;
Production Research, 43, pp. 4035-4047., doi:10.1080/00207540500151283;
techniques (1992) Journal of Manufacturing Systems, 11, pp. 149-159.,
doi:10.1016/0278-6125(92)90001-V;
Production Research, 28, pp. 2243-2257., doi:10.1080/00207549008942864;
Qiao, L.H., Yang, Z.B., Wang, H.P., A computer-aided process planning methodology
(1994) Computers in Industry, 255, pp. 83-94., doi:10.1016/0166-3615(94)90035-3;
routing in group technology (1990) Engineering Optimization, 16, pp. 235-245.,
doi:10.1080/03052159008941175;
Saraç, T., Sipahioglu, A., The performance of the modified subgradient algorithm on
solving the 0-1 quadratic knapsack problem (2009) Informatica, 20 (2), pp. 1-12;
707-720., doi:10.1080/002075499191742;
space (2007) International Journal of Production Research, 45, pp. 1355-1367.,
doi:10.1080/00207540600719674;
(2000) International Journal of Production Research, 38, pp. 229-240.,
doi:10.1080/002075400189662;
22, pp. 231-240., doi:10.1080/03052159408941336;
Engineering, 32, pp. 207-220., doi:10.1016/S0360-8352(96)00209-4;
(2009) Expert Systems with Applications, 36, pp. 3652-3661.,
doi:10.1016/j.eswa.2008.02.060;
Manufacturing Technology, 24, pp. 834-840., doi:10.1007/s00170-003-1749-0
PUBLISHER: Vilnius Gediminas Technical University
ISBN: 9789955285977
ABBREVIATED SOURCE TITLE: Mini EURO Conf. Continuous Optim. Inf.-Based Technol.
Financ. Sect., MEC EurOPT
SOURCE: Scopus
Car, Z., Mikac, T.

24464778100;6505841965;
Evolutionary approach for solving cell-formation problem in cell manufacturing
(2006) Advanced Engineering Informatics, 20 (3), pp. 227-232. Cited 24 times.
33747190672&doi=10.1016%2fj.aei.2006.01.005&partnerID=40&md5=556e519d91a42c75b8a0f3
2657b593f2
DOI: 10.1016/j.aei.2006.01.005
AFFILIATIONS: Industrial Engineering and Management Department, Faculty of
Engineering, University of Rijeka, Vukovarska 58, 51000 Rijeka, Croatia
ABSTRACT: New environmental characteristics and requirements have challenged
manufacturing enterprises to improve the efficiency and productivity of their
production activities. Cellular manufacturing (CM) as one of the solutions to this
problem, as implementation of Group technology (GT), was proposed. Performance of
cellular manufacturing systems depends heavily on the cell structure. In this paper
we present and evaluate a novel approach for solving the cell-formation problem
based on implementation of a GA, called modified genetic algorithm (MGA).
Implementation of the GA in here presented simulation model is based on Emergent
Synthesis idea, of top-down problem decomposition and emerging solution from
bottom-up feedback. © 2006 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Artificial neural network; Cell-formation problem; Cellular
manufacturing system; Genetic algorithm
INDEX KEYWORDS: Computer simulation; Genetic algorithms; Group technology; Problem
solving; Production control, Cell-formation problem; Cellular manufacturing system;
Emergent Synthesis; Modified genetic algorithm (MGA), Cellular manufacturing
REFERENCES: Buzacott, J.A., A perspective on new paradigms in manufacturing (1995)
J. Manuf. Syst., 14 (2), pp. 118-125;
Tharumarajah, A., Wells, J.A., Nemes, L., Comparison of the bionic, fractal and
holonic manufacturing system concepts (1996) Int. J. Comp. Integ. M., 9 (3), pp.
217-226;
Kusiak, A., (1990) Intelligent Manufacturing Systems, , Prentice-Hall, New Jersey;
Car, Z., Hatono, I., Ueda, K., Reconfiguration of manufacturing systems based on
virtual BMS (2004) The CIRP - J. Manuf. Syst., 33 (1), pp. 11-18;
232;
Chan, F.T.S., Mak, K.L., Luong, L.H.S., Ming, X.G., Machine-component grouping
using genetic algorithms (1998) Robot CIM - Int. Manuf., 14 (5-6), pp. 339-346;
Ueda, K., Markus, A., Monostori, L., Kals, H.J.J., Arai, T., Emergent synthesis
methodologies for manufacturing (2001) Ann. CIRP, 50 (2), pp. 535-551;
Ueda, K., Synthesis and emergence - research overview. Artificial intelligence in
engineering (2001) Adv. Eng. Inform., 15 (4), pp. 321-327;
Gen, M., Cheng, R., (1997) Genetic Algorithm and Engineering Design, , John Wiley &
Sons, New York;
Pinedo, M., (1995) Scheduling: Theory, Algorithms and Systems, , Prentice-Hall, New
Jersey;
cellular manufacturing (1995) Int. J. Prod. Res., 33 (2), pp. 293-318;
CORRESPONDENCE ADDRESS: Car, Z.; Industrial Engineering and Management Department,
Faculty of Engineering, University of Rijeka, Vukovarska 58, 51000 Rijeka, Croatia;
ISSN: 14740346
ABBREVIATED SOURCE TITLE: Adv. Eng. Inf.
SOURCE: Scopus
Karoum, B., El Khattabi, N., Elbenani, B., Ameur El Imrani, A.

57188978487;6508368495;36147113000;56285826800;
An efficient artificial immune system algorithm for the cell formation problem
(2016) Journal of Computational Methods in Sciences and Engineering, 16 (4), pp.
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85012206669&doi=10.3233%2fJCM-
160687&partnerID=40&md5=115d4def40f61e9026865995353fbef1
DOI: 10.3233/JCM-160687
AFFILIATIONS: Research Computer Science Laboratory, Faculty of Science, Mohammed v
University, B.P. 1014 Rabat, Rabat, Morocco;
Conception and Systems Laboratory, Faculty of Science, Mohammed v University,
Rabat, Morocco
ABSTRACT: The cell formation problem is one of the first issues faced in the
designing of cellular manufacturing systems. In this paper, a new solution approach
based on the artificial immune system algorithm is presented for the problem with
the aim of maximizing the grouping efficacy. To intensify the search, the proposed
method is refined by a tabu search algorithm. Numerical results confirm the
effectiveness of the method since it can reach the best known solutions of 30 most
widely used benchmark problems in short computational time. Compared with different
methods collected from the literature, the proposed algorithm performs well on all
test problems. © 2016 - IOS Press and the authors. All rights reserved.
AUTHOR KEYWORDS: Cell formation; clonal selection; grouping efficacy; receptor
editing; tabu search
INDEX KEYWORDS: Clone cells; Immune system; Manufacture; Numerical methods; Tabu
search, Artificial immune system algorithms; Bench-mark problems; Cell formation;
Cell formation problem; Clonal selection; Grouping efficacy; Receptor editing; Tabu
search algorithms, Cellular manufacturing
REFERENCES: Dimopoulos, C., Zalzala, A.M., Recent developments in evolutionary
computation for manufacturing optimization: Problems, solutions, and comparisons
(2000) IEEE Transactions on Evolutionary Computation, 4 (2), pp. 93-113;
Chandrasekharan, M.P., Rajagopalon, R., Zodiac-an algorithm for concurrent
Srinivasan, G., Narendran, T.T., Grafics-a nonhierarchical clustering algorithm for
463-478;
formation problem (2012) Applied Mathematical Modelling, 36 (10), pp. 5091-5100;
Elbenani, B., Ferland, J.A., Cell formation problem solved exactly with the
Dinkelbach algorithm (2012) CIRRELT, pp. 1-14;
Solimanpur, M., Elmi, A., A tabu search approach for cell scheduling problem with
pp. 639-645;
Applications, 39 (3), pp. 2408-2414;
optimization algorithm for the manufacturing cell formation problem (2014) The
Manimaran, A., Prabhakaran, G., Venkumar, P., Manufacturing cell formation using
artificial immune system (2011) International Journal of Computer Aided Engineering
and Technology, 3 (5-6), pp. 547-558;
Glover, F., Tabu search: Part i (1989) ORSA Journal of Computing, 1 (3), pp. 190-
206;
Hsu, C.-P., (1990) The Similarity Coefficient Approaches of Machine-component Cell
Formation in Cellular Manufacturing: A Comparative Study, , University of
Wisconsin-Milwaukee;
Nair, G.J.K., Narendran, T.T., Grouping index: A new quantitative criterion for
goodness of block-diagonal forms in group technology (1996) International Journal
(1), pp. 63-78;
Bagheri, A., Zandieh, M., Mahdavi, I., Yazdani, M., An artificial immune algorithm
for the flexible job-shop scheduling problem (2010) Future Generation Computer
Systems, 26 (4), pp. 533-541;
Tan, K.C., Goh, C.K., Mamun, A.A., Ei, E.Z., An evolutionary artificial immune
system for multi-objective optimization (2008) European Journal of Operational
Research, 187 (2), pp. 371-392;
De Castro, L.N., Timmis, J., Artificial immune systems: A novel approach to pattern
recognition (2002) Artificial Neural Networks in Pattern Recognition, pp. 67-84.,
J. M. Corchado, L. Alonso and C. Fyfe, eds, SOCO-2002, University of Paisley, UK;
King, J.R., Nakornachai, V., Machine-component group formation in group technology:
pp. 117-133;
pp. 2633-2646;
Chandrasekharan, M.P., Rajagopalon, R., MODROC: An extension of rank order
Research, 24 (5), pp. 1221-1233;
Research, 24 (2), pp. 451-463;
113;
993-1009;
Research, 28 (1), pp. 145-152;
Research, 18 (2), pp. 213-232;
387-397;
1715-1728;
(12), pp. 2071-2081;
Diaz, J.A., Luna, D., Luna, R., A GRASP heuristic for the manufacturing cell
Computers & Operations Research, 40 (4), pp. 980-990
CORRESPONDENCE ADDRESS: Karoum, B.; Research Computer Science Laboratory, Faculty
of Science, Mohammed v University, B.P. 1014 Rabat, Morocco; email:
[email protected]
ISSN: 14727978
ABBREVIATED SOURCE TITLE: J. Comput. Methods Sci. Eng.
SOURCE: Scopus
Díaz, J.A., Luna, D.E., Zetina, C.A.

7401603810;36504290300;57204381464;
A hybrid algorithm for the manufacturing cell formation problem
(2013) Journal of Heuristics, 19 (1), pp. 77-96. Cited 4 times.
84874655778&doi=10.1007%2fs10732-013-9216-
z&partnerID=40&md5=7d4312087f856543c73bf692c353411b
DOI: 10.1007/s10732-013-9216-z
AFFILIATIONS: Departamento de Ingeniería Industrial y Mecánica, Universidad de Las
Américas, Ex. Hda. Santa Catarina Mártir, 72820 Cholula, Puebla, Mexico
ABSTRACT: In this paper we compare different heuristic methods for the
manufacturing cell formation problem considering part process sequence: a GRASP
algorithm, a reactive GRASP algorithm and a hybrid algorithm which combines
reactive GRASP and tabu search. All algorithms are tested with a set of instances
from the literature. The results from the GRASP algorithm are compared to those of
the reactive GRASP in order to evaluate the advantages of automatically adjusting
the parameter value within the randomized greedy procedure. Also the reactive GRASP
results are compared to those of the hybrid algorithm to evaluate the contribution
to solution quality of replacing the local search phase of the GRASP algorithm with
tabu search. © 2013 Springer Science+Business Media New York.
AUTHOR KEYWORDS: GRASP; Manufacturing cell formation problem; Tabu Search
INDEX KEYWORDS: GRASP; Grasp algorithms; Hybrid algorithms; Local search;
Manufacturing cell formation; Parameter values; Reactive GRASP; Solution quality,
Cellular manufacturing; Flexible manufacturing systems; Heuristic methods; Quality
control; Tabu search, Algorithms
REFERENCES: Abdinnour-Helm, S., Hadley, S.W., Tabu search based heuristic for
multi-floor facitily layout (2000) Int. J. Prod. Res., 38, pp. 365-383., 0944.90512
10.1080/002075400189464;
Blum, C., Hybrid metaheuristics (2010) Comput. Oper. Res., 37 (3), pp. 430-431.,
2579769 1173.90301 10.1016/j.cor.2009.03.002;
Blum, C., Roli, A., Sampels, M., (2008) Hybrid Metaheuristics: An Emerging Approach
to Optimization, , Springer New York 1143.90001 10.1007/978-3-540-78295-7;
Burbidge, J.L., (1975) The Introduction of Group Technology, , Halsted Press and
John Wiley, New York;
Colomé, R., Serra, D., Consumer choice in competitive location models: Formulations
and heuristics (2001) Pap. Reg. Sci., 80, pp. 439-464., 10.1007/PL00013632;
Delmaire, H., Díaz, J.A., Fernandez, E., Reactive GRASP and tabu search based
heuristics for the single source capacitated plant location problem (1999) Inf.
Syst. Oper. Res., 37 (3), pp. 194-225;
Demsìar, J., Statistical comparisons of classifiers over multiple data sets (2006)
J. Mach. Learn. Res., 7, pp. 1-30., 2274360;
formation problem (2012) TOP, 20, pp. 679-706., 2974709 06139276 10.1007/s11750-
010-0159-3;
Díaz, J.A., Heurística multi-arranque para el problema de formación de células
demanufactura (2011) Memorias Taller Latino Iberoamericano de Investigación de
Operaciones, , ISBN 978-607-7760-56-6;
Duarte, A., Martí, R., Tabu search and GRASP for the maximum diversity problem
(2007) Eur. J. Oper. Res., 178 (1), pp. 71-84., 1109.90081
10.1016/j.ejor.2006.01.021;
Feo, T.A., Resende, M.G., Greedy ramdomized adaptive search procedures (1995) J.
Glob. Optim., 6, pp. 109-133., 1322875 0822.90110 10.1007/BF01096763;
(1925) Trans. ASME, 46, pp. 691-738;
García, S., Molina, D., Lozano, M., Herrera, F., A study on the use of non-
parametric tests for analyzing the evolutionare algorithms' behavior: A case study
on the CEC'2005 special session on real parameter optimization (2009) J.
Heuristics, 15, pp. 617-644., 1191.68828 10.1007/s10732-008-9080-4;
Glover, F., Tabu search - Part I (1989) ORSA J. Comput., 1 (3), pp. 190-206.,
0753.90054 10.1287/ijoc.1.3.190;
formation (2004) Comput. Ind. Eng., 47, pp. 247-273., 10.1016/j.cie.2004.07.003;
Ham, I., Hitomi, K., Yoshida, T., (1985) Group Technology, , Kluwer-Nijhoff
Publishing Boston 10.1007/978-94-009-4976-8;
Kusiak, A., The generalized group technology concept (1987) Int. J. Prod. Res., 24
(4), pp. 561-569., 10.1080/00207548708919861;
Laguna, M., González-Velarde, J.L., A search heuristic for Just-in-time Scheduling
in parallel machines (1991) J. Intell. Manuf., 2, pp. 253-260;
Lim, A., Wang, F., A smoothed dynamic tabu search embedded GRASP for m-VRPTW (2004)
Proceedings of ICTAI, pp. 704-708;
Lozano, M., García-Martínez, C., Hybrid metaheuristics with evolutionary algorithms
specializing in intensification and diversification: Overview and progress report
(2010) Comput. Oper. Res., 37 (3), pp. 481-497., 2579774 1173.90590
10.1016/j.cor.2009.02.010;
Mitrofanov, S.P., (1933) Group Technology in Industry, 1-2., Mashinostroienie,
Leningrad;
approach to the cell formation problem (2005) Int. J. Adv. Manuf. Technol., 25, pp.
988-997., 10.1007/s00170-003-1912-7;
Resende, M.G., Gonzalez, J.L., GRASP: Procedimientos de busqueda miopes
aleatorizados y adaptativos (2003) Inteligencia Artificial, Revista Iberoamericana
de Inteligencia Artificial, 19, pp. 61-76;
Prais, M., Ribeiro, C., Reactive GRASP: An application to a matrix decomposition in
TDMA traffic assignment (2000) INFORMS J. Comput., 12 (3), pp. 164-176., 1779335
1040.90504 10.1287/ijoc.12.3.164.12639;
formulation of machine cells in group technology (1997) Int. J. Prod. Res., 35 (2),
pp. 501-511., 0940.90539 10.1080/002075497195876;
Sorensen, M.M., (1995) A Polyhedral Approach to Graph Partitioning, , Ph. D.
Thesis, The Aarus School of Business;
Spiliopoulos, K., Sofianopoulou, S., Designing manufacturing cells: A staged
approach and a tabu search algorithm (2003) Int. J. Prod. Res., 41 (11), pp. 2531-
2546., 1052.90546 10.1080/0020754031000088156;
for the manufacturing cells formation problem (2008) Int. J. Adv. Manuf. Technol.,
36, pp. 589-597., 10.1007/s00170-006-0862-2;
Talbi, E.G., A taxonomy of hybrid metaheuristics (2002) J. Heuristics, 8 (5), pp.
541-565., 10.1023/A:1016540724870;
Vaughn, A., Fernandes, P., Shields, T., (2002) Manufacturing Systems Design
Framework Manual, , Masachusetts Institute of Technology Cambridge
CORRESPONDENCE ADDRESS: Díaz, J.A.; Departamento de Ingeniería Industrial y
Mecánica, Universidad de Las Américas, Ex. Hda. Santa Catarina Mártir, 72820
Cholula, Puebla, Mexico; email: [email protected]
ISSN: 13811231
CODEN: JOHEF
ABBREVIATED SOURCE TITLE: J Heuristics
SOURCE: Scopus
Trinh, K., Ferland, J., Dinh, T.

37062092600;57193718834;36470004000;
A stochastic optimization method for solving the machine-part cell formation
problem
Artificial Intelligence and Lecture Notes in Bioinformatics), 6838 LNCS, pp. 162-
169. Cited 2 times.
3-642-24728-6_22&partnerID=40&md5=89076bf90996f354f57853e912faaae2
DOI: 10.1007/978-3-642-24728-6_22
AFFILIATIONS: Faculty of Information Technology, University of Science, VNU-HCMC,
227 Nguyen Van Cu, Ho Chi Minh City, Viet Nam;
Interuniversity Research Center on Enterprise Networks, Logistics and
Transportation, Université de Montréal, Succ. Centre-Ville, Montréal, QC, Canada
ABSTRACT: In this paper, we study the machine-part cell formation problem. The
problem is to assign the given machines and parts into cells so that the grouping
efficacy, a measure of autonomy, is maximized. First, we introduce a new randomized
local search algorithm which requires solving another subproblem for assigning
optimally parts into cells on the basis of given groups of machines. Second, we
propose an exact, polynomial-time algorithm to solve this subproblem. Finally, we
provide the numerical results of our proposed algorithm, using a popular set of
benchmark problems. Comparisons with other recent algorithms in the literature show
that our algorithm can improve the current best-known solutions for some instances.
© 2011 Springer-Verlag.
AUTHOR KEYWORDS: Cell Formation Problem; Fractional Programming; Randomized Local
Search Algorithm
INDEX KEYWORDS: Bench-mark problems; Cell formation problem; Fractional
programming; Grouping efficacy; Numerical results; Polynomial-time algorithms;
Randomized local search; Stochastic optimization methods, Intelligent computing;
Learning algorithms, Cellular manufacturing
REFERENCES: Wemmerlov, U., Hyer, N., Research Issues in Cellular Manufacturing
Ogoubi, E., Ferland, J.A., Hafid, A., Turcotte, M., Bellemare, J., (2010) A Multi-
Constraint Cell Formation Problem for Large Scale Application Decomposition, ,
Working paper, DIRO, Universit de Montral, Qubec, Canada;
Papaioannou, G., Wilson, J.M., The Evolution of Cell Formation Problem
Methodologies Based on Recent Studies (1997-2008): Review and Directions for Future
Research (2010) European Journal of Operational Research, 206, pp. 509-521;
Sarker, B.R., Khan, M., A Comparison of Existing Grouping Efficiency Measures and a
New Weighted Grouping Efficiency Measure (2001) IIE Transactions, 33, pp. 11-27;
Dimopoulos, C., Zalzala, A.M.S., Recent Developments in Evolutionary Computation
for Manufacturing Optimization: Problems, Solutions and Comparisons (2000) IEEE
Srinivasana, G., Narendrana, T.T., A Nonhierarchical Clustering Algorithm for Group
Technology (1991) International Journal of Production Research, 29 (3), pp. 463-
478;
Tunnukij, T., Hicks, C., An Enhanced Grouping Genetic Algorithm for solving the
cell formation problem (2010) International Journal of Production Research;
Zolfaghari, S., Liang, M., Comparative Study of Simulated Annealing, Genetic
Algorithms and Tabu Search for Solving Binary and Comprehensive Machine-Grouping
Problems (2002) International Journal of Production Research, 40 (9), pp. 2141-
2158;
Cell Formation Problem, , Publication CIRRELT, Universit de Montral, Qubec, Canada;
Elbenani, B., Ferland, J.A., Bellemare, J., (2010) Genetic Algorithm and Large
Neighborhood Search to Solve the Cell Formation Problem, , Publication CIRRELT,
Universit de Montral, Qubec, Canada;
Matsui, T., Saruwatari, Y., Shigeno, M., (1992) An Analysis of Dinkelbach's
Algorithm for 0-1 Fractional Programming Problems, , Dept. Math. Eng. Inf. Phys.,
University of Tokyo;
Crouzeix, J.P., Ferland, J.A., Hien, N., Revisiting Dinkelbach-Type Algorithms for
Generalized Fractional Programs (2008) Operational Research Society of India, p.
45;
Tunnukij, T., Hicks, C., An Enhanced Genetic Algorithm for Solving the Cell
Formation Problem (2009) International Journal of Production Research, p. 47;
Mahdavi, I., Paydar, M.M., Solimanpur, M., Heidarzade, A., Genetic Algorithm
Approach for Solving a Cell Formation Problem in Cellular Manufacturing (2009)
James, T.J., Brown, E.C., Keeling, K.B., A Hybrid Grouping Genetic Algorithm for
the Cell Formation Problem (2007) Computers & Operations Research, 34, pp. 2059-
2079;
Luo, L., Tang, L., A Hybrid Approach of Ordinal Optimization and Iterated Local
Search for Manufacturing Cell Formation (2009) International Journal of Advance
Goncalves, J., Resende, M.G.C., An Evolutionary Algorithm for Manufacturing Cell
Formation (2004) Computers & Industrial Engineering, 47, pp. 247-273
CORRESPONDENCE ADDRESS: Trinh, K.; Faculty of Information Technology, University of
Science, VNU-HCMC, 227 Nguyen Van Cu, Ho Chi Minh City, Viet Nam; email:
[email protected]
ISSN: 03029743
ISBN: 9783642247279
SOURCE: Scopus
Selim, H.M.
55142046600;
Manufacturing cell formation problem: A graph partitioning approach
(2002) Industrial Management and Data Systems, 102 (5-6), pp. 341-352. Cited 4
times.
0036330805&partnerID=40&md5=bda16bbe1a3ceda335eef21a71902828
AFFILIATIONS: Dept. of Business Administration, College of Business and Economics,

United Arab Emirates University, Al Ain, United Arab Emirates
ABSTRACT: The design of a cellular manufacturing system requires that a machine
population be partitioned into machine groups called manufacturing cells. A new
graph partitioning heuristic is proposed to solve the manufacturing cell formation
problem (MCFP). In the proposed heuristic, The MCFP is represented by a graph whose
node set represents the machine cluster and edge set represents the machine-pair
association weights. A graph partitioning approach is used to form the
manufacturing cells. This approach offers improved design flexibility by allowing a
variety of design parameters to be controlled during cell formation. The
effectiveness of the heuristic is demonstrated by comparing it to two MCFP
published solution methods using several problems from the literature.
AUTHOR KEYWORDS: Cellular manufacturing; Heuristics; Manufacturing strategy;
Manufacturing systems
INDEX KEYWORDS: Algorithms; Graph theory; Heuristic programming; Industrial
management; Machinery; Optimization; Scheduling, Graph partitioning approach;
Manufacturing cell formation problem; Manufacturing strategy; Manufacturing
systems, Cellular manufacturing
REFERENCES: Askin, R.G., Chui, K.S., A graph partitioning procedure for machine
Askin, R.G., Creswell, J.B., Goldberg, J.B., Vakharia, A.J., A Hamiltonian path
approach to reordering the machine-part matrix for cellular manufacturing (1991)
cellular manufacturing systems (1997) IIE Transactions, 29, pp. 599-610;
Burbidge, J.L., (1975) The Introduction of Group Technology, , John Wiley & Sons,
New York, NY;
Research, 24 (1), pp. 451-464;
Faber, Z., Carter, M.W., A new graph theoretic approach for forming machine cells
in cellular production systems (1986) Flexible Manufacturing Systems: Methods and
Studies, pp. 301-318., Kusiak, A. (Ed.), North Holland, Amsterdam;
Fjallstromas, P., Algorithms for graph partitioning: A survey (1998) Linkoping
Electronic Articles in Computer and Information Science, 3 (10);
Geoffrey, O.O., Chen, M., Chanagchit, C., Richard, L.S., Manufacturing system cell
formation and evaluation using a new inter-cell reduction heuristic (1992)
Jaccard, P., Nouvelles recherches sur la distribution florale (1908) Bull. Soc.
Vaud. Sce., 44, pp. 223-270;
Joines, J.A., King, R.E., Culbreth, C.T., Comprehensive review of production
oriented cell formation techniques (1996) International Journal of Flexible
Automation and Integrated Manufacturing, 3 (3-4), pp. 161-200;
Kern, G.M., Wei, J.C., The cost of eliminating exceptional elements in group
technology cell formation (1991) International Journal of Production Research, 29
(8), pp. 1535-1547;
(1970) AT&T Bell Labs Technical Journal, 49 (2), pp. 291-307;
King, J.R., Machine-component group formation in group technology (1980) OMEGA-
International Journal of Management Science, 8 (2), pp. 193-199;
using rank order clustering algorithm (1980) International Journal of Production
Research, 18 (2), pp. 213-232;
King, J.R., Nakornchai, V., Machine-component group formation in group technology -
pp. 117-133;
397;
Research, 28 (5), pp. 913-925;
Rajagopalan, R., Batra, J., Design of cellular production systems - A graph
567-579;
Review, evaluation and directions for future research (1998) International Journal
of Computers and Industrial Engineering, 34 (1), pp. 3-20;
grouping part-machine families (1986) International Journal of Production Research,
24 (2), pp. 387-400;
Vohra, T., Chen, D.S., Chang, J.C., Chen, H.C., A network approach to cell
Research, 28 (11), pp. 2075-2084;
pp. 1409-1421
CORRESPONDENCE ADDRESS: Selim, H.M.; Dept. of Business Administration, College of
Business and Economics, United Arab Emirates University, Al Ain, United Arab
Emirates
ISSN: 02635577
CODEN: IMDSD
ABBREVIATED SOURCE TITLE: Ind Manage Data Sys
SOURCE: Scopus
Mosier, C.T.
6701802350;
An experiment investigating the application of clustering procedures and similarity
coefficients to the GT machine cell formation problem
96 times.
0024748705&doi=10.1080%2f00207548908942656&partnerID=40&md5=1e5dc7e3e0ff5ce96ae4abd
b500f95b6
DOI: 10.1080/00207548908942656
AFFILIATIONS: School of Management, Clarkson University, Potsdam, NY, 13676, United
States
ABSTRACT: This paper reports the development of a number of similarity-based
coefficients designed for applying hierarchical cluster analysis to the group
technology machine cell formation problem. The paper also discusses an experimental
investigation applying these and other well-known similarity coefficients in
conjunction with some well-known clustering algorithms. The mixture model
experimental approach is used for the investigation. A number of problems were
generated via simulation, randomly ‘mixed’ to hide the original cellular structure,
and the clustering techniques applied. Extensions of prior research include the
development of new similarity coefficients, their comparative evaluation, and the
incorporation of the concept of part ‘weighting’ into the cluster analysis, and
hence, cell formation © 1989 Taylor & Francis Group, LLC.
INDEX KEYWORDS: Mathematical Statistics--Monte Carlo Methods; Mathematical
Techniques--Heuristic; Production Control--Management, Clustering Procedures; Group
Technology; Machine Cell Formation Problem, Industrial Plants
REFERENCES: Anderberg, M.R., (1973) Cluster Analysis for Application, , New York:
Academic Press);
Bishop, Y., Fienberg, S.E., Holland, P.W., (1975) Discrete Multivariate Analysis:
Theory and Practice, , (Cambridge, Massachusetts: MIT Press);
Carrie, A.S., Numerical taxonomy applied to group technology and plant lay-out
Chandrasekharan, M.P., Rajagopalan, R., Anideal seed non-hierarchical cluster
Research, 25, pp. 451-464;
Dewitte, J., The use or similarity coefficients in production flow analysis (1980)
Duncan, D.B., Multiple range and multiple F-tests (1955) Biometrics, 11 (1), pp. 1-
42;
Fazakerly, G., Aresearch report on the humanaspects ofgroup technology and cellular
manufacturing (1976) International Journal of Production Research, 14, pp. 123-134;
Hartigan, J.A., (1975) Clustering Algorithms, , New York: John Wiley & Sons);
Holley, J.W., Guilford, J.P., Anote on the G index or agreement (1964) Education
and Psychological Measurement, 24, pp. 749-753;
King, J.R., Machine-eomponent groupformation in group technology (1979) Proceedings
Ofthe International Conference on Production Research, , Holland Organ Center, The
Hague;
King, J.R., Nakornchai, Y., Machine-component group formation in group technology:
117-213;
Klastorin, T.D., Thep-median problemfor clusteranalysis: A comparative test
usingthe mixture model approach (1985) Management Science, 31, pp. 84-95;
Kusiak, A., (1984) Thepart Families.Problem in Flexible Manufacturing Systems, ,
Workingpaper 06/84’ Technical University of Nova Scotia, Department of Industrial
Engineering;
Kusiak, A., Chow, W.S., Efficient solving other group technology problem (1987)
McLachlan, G.J., Basford, K.E., (1988) Mixture Models, Inference and Applications
to Clustering, , (New York: Marcel Dekker, Inc.);
Mosier, C.T., A weighted similarity coefficient for use in addressing the group
technology part-machine clustering problem (1985) Proceedings of the American
Institute of Decision Sciences Annual Meeting, pp. 812-815., Las Vegas;
Mosier, C.T., Hoyler, B., Machine cell formation for FMS design (1986) Proceedings
of FMS ‘86, , Chicago, Illinois;
technology machine clustering problem (1985) OM EGA, 13, pp. 577-579;
Parsons, R., (1978) Statistical Analysis: A Decision-Making Approach, , second
edition, New York: Harper & Row);
Portmann, M.C., Proth, J.M., Spatial and temporal decomposition method in
production management (1988) Proceedings of the 1988 International Conference on
Computer Integrated Manufacturing, , Troy, New York;
Purcheck, G., Machine-eomponent group formation: An heuristic method for flexible
Romesburg, H.C., (1984) Cluster Analysis for Researchers, , (Belmon, California:
Lifetime Learning Publications);
(1982) SAS User’s Guide: Statistics, , (Cary, North Carolina: SAS Institute, Inc.);
Selvam, R.P., Balasubramaniam, K.N., Algorithmic grouping of operation sequences

(1985) Engineering Costs and Production Economics, 9, pp. 125-134;
Sokal, R.R., Michener, C.D., A statistical method for evaluating systematic
relationships (1958) University of Kansas Scientific Bulletin, 38, pp. 1409-1438;
Vakharia, A.J., Wemmerlov, U., Designing a cellular manufacturing system: A cell
layout approach using operation sequences (1986) Proceedings of the Decision
Sciences Institute Hawaii Meeting, 1147p;
Wemmerlov, U., Hyer, N.L., Research issues in cellular manufacturing (1987)
International Journal of Production Research, 25, pp. 413-431
CORRESPONDENCE ADDRESS: Mosier, C.T.; School of Management, Clarkson University,
Potsdam, NY, 13676, United States
ISSN: 00207543
SOURCE: Scopus
Mahmoodian, V., Jabbarzadeh, A., Rezazadeh, H., Barzinpour, F.

56521715000;35189134400;56462607000;22957278500;
A novel intelligent particle swarm optimization algorithm for solving cell
formation problem
(2019) Neural Computing and Applications, 31, pp. 801-815. Cited 1 time.
85019563622&doi=10.1007%2fs00521-017-3020-
x&partnerID=40&md5=bb3199325175a3cbcbae4ac685995d77
DOI: 10.1007/s00521-017-3020-x
Department of Industrial Engineering, University of Tabriz, Tabriz, Iran
ABSTRACT: The formation of manufacturing cells forms the backbone of designing a
cellular manufacturing system. In this paper, we present a novel intelligent
particle swarm optimization algorithm for the cell formation problem. The proposed
solution method benefits from the advantages of particle swarm optimization
algorithm (PSO) and self-organization map neural networks by combining artificial
individual intelligence and swarm intelligence. Numerical examples demonstrate that
the proposed intelligent particle swarm optimization algorithm significantly
outperforms PSO and yields better solutions than the best solutions existed in the
literature of cell formation. The application of the proposed approach is examined
in a case problem where real data is utilized for cell reconfiguration of an actual
company involved in agricultural manufacturing sector. © 2017, The Natural
Computing Applications Forum.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing; Discrete
learning; Neural networks; Particle swarm optimization
INDEX KEYWORDS: Cells; Cellular manufacturing; Cellular neural networks; Cytology;
Engineering education; Neural networks; Problem solving; Swarm intelligence,
Artificial individual; Cell formation; Cell formation problem; Discrete learning;
Manufacturing sector; Particle swarm optimization algorithm; Self-organization
maps; Solution methods, Particle swarm optimization (PSO)
REFERENCES: Soleymanpour, M., Vrat, P., Shankar, R., A transiently chaotic neural
network approach to the design of cellular manufacturing (2002) Int J Prod Res, 40
(10), pp. 2225-2244;
Wemmerlöv, U., Hyer, N.L., Cellular manufacturing in the US industry: a survey of
users (1989) Int J Prod Res, 27 (9), pp. 1511-1530;
formation in generalized group technology (2005) Int J Prod Res, 43 (19), pp. 4035-
4047;
designing cellular manufacturing systems (1987) Int J Prod Res, 25 (5), pp. 639-
665;
Mirzapour Al-e-hashem, S.M.J., Aryanezhad, M.B., Jabbarzadeh, A., A new approach to
solve a mixed-model assembly line with a bypass subline sequencing problem (2011)
Int J Adv Manuf Technol, 52 (9-12), pp. 1053-1066;
Aryanezhad, M.-B., Naini, S.G.J., Jabbarzadeh, A., An integrated location inventory
model for designing a supply chain network under uncertainty (2011) Life Science
Journal-Acta Zhengzhou University Overseas Edition, 8 (4), pp. 670-679;
Potočnik, P., Berlec, T., Starbek, M., Govekar, E., Self-organizing neural network-
based clustering and organization of production cells (2013) Neural Comput and
Applic, 22 (1), pp. 113-124;
Liao, T.W., Chen, L., An evaluation of ART1 neural models for GT part family and
machine cell forming (1993) J Manuf Syst, 12 (4), pp. 282-290;
Dagli, C., Huggahalli, R., Machine-part family formation with the adaptive
resonance theory paradigm (1995) Int J Prod Res, 33 (4), pp. 893-913;
Burke, L., Kamal, S., Neural networks and the part family/machine group formation
problem in cellular manufacturing: a framework using fuzzy ART (1995) J Manuf Syst,
14 (3), pp. 148-159;
Chen, D.-S., Chen, H.-C., Park, J.-M., An improved ART neural net for machine cell
formation (1996) J Mater Process Technol, 61 (1), pp. 1-6;
(1995) I Design of Cellular Manufacturing Systems: I Hopfield Neural Network
Approach, 467., Recent Trends In Applied Systems Research;
Zolfagha Ri, S., Liang, M.A., Hopfield neural network approach to machine grouping
problem (1995) 14Th Industrial Engineering Research Conference, pp. 542-549.,
Nashville, TN, USA;
Zolfagha Ri, S., Liang, M., An objective-guided ortho-synapse Hopfield network
approach to machine grouping problems (1997) Int J Prod Res, 35 (10), pp. 2773-
2792;
Onwubolu, G.C., Design of parts for cellular manufacturing using neural network-
based approach (1999) J Intell Manuf, 10 (3-4), pp. 251-265;
Lozano, S., Canca, D., Guerrero, F., Garcia, J., Machine grouping using sequence-
based similarity coefficients and neural networks (2001) Robot Comput Integr Manuf,
17 (5), pp. 399-404;
formation using a new self-organizing neural network (2002) Comput Ind Eng, 42 (2),
pp. 377-382;
Venkumar, P., Haq, A.N., Manufacturing cell formation using modified ART1 networks
(2005) Int J Adv Manuf Technol, 26 (7-8), pp. 909-916;
organizing map networks in a cellular manufacturing system (2006) Int J Prod Res,
44 (20), pp. 4257-4271;
modified ART1 method (2008) Eur J Oper Res, 188 (1), pp. 140-152;
Poli, R., Analysis of the publications on the applications of particle swarm
optimisation (2008) Journal of Artificial Evolution and Applications, 2008, p. 3;
Poli, R., (2007) An Analysis of Publications on Particle Swarm Optimization
Applications, , Department of Computer Science, University of Essex, Essex,
Colchester;
Sheikhan, M., Garoucy, S., Substitution of G.728 vocoder’s codebook search module
with SOM array trained by PSO-optimized supervised algorithm (2013) Neural Comput
and Applic, 23 (7-8), pp. 2309-2321;
Andrés, C., Lozano, S., A particle swarm optimization algorithm for part–machine
grouping (2006) Robot Comput Integr Manuf, 22 (5), pp. 468-474;
Duran, O., Rodriguez, N., Consalter, L.A., A PSO-based clustering algorithm for
manufacturing cell design (2008) Knowledge Discovery and Data Mining, 2008, pp. 72-
75., WKDD 2008. First International Workshop on, IEEE, USA;
manufacturing cell formation problems (2008) Expert Syst Appl, 34 (3), pp. 1609-
1617;
Chandrasekharan, M., Rajagopalan, R., GROUPABIL1TY: an analysis of the properties
1035-1052;
Suresh Kumar, C., Chandrasekharan, M., Grouping efficacy: a quantitative criterion
for goodness of block diagonal forms of binary matrices in group technology (1990)
Int J Prod Res, 28 (2), pp. 233-243;
Cheng, C.H., Gupta, Y., Lee, W., Wong, K., A TSP-based heuristic for forming
machine groups and part families (1998) Int J Prod Res, 36 (5), pp. 1325-1337;
Chung, S.-H., Wu, T.-H., Chang, C.-C., An efficient tabu search algorithm to the
cell formation problem with alternative routings and machine reliability
considerations (2011) Comput Ind Eng, 60 (1), pp. 7-15;
machine–part cell formation problems (2010) Comput Oper Res, 37 (12), pp. 2071-
2081;
Hakimi-Asiabar, M., Ghodsypour, S.H., Kerachian, R., Multi-objective genetic local
search algorithm using Kohonen’s neural map (2009) Comput Ind Eng, 56 (4), pp.
1566-1576;
Jabbarzadeh, A., Jalali Naini, S.G., Davoudpour, H., Azad, N., Designing a supply
chain network under the risk of disruptions (2012) Math Probl Eng, 2012;
Jabbarzadeh, A., Fahimnia, B., Seuring, S., Dynamic supply chain network design for
the supply of blood in disasters: a robust model with real world application (2014)
Transportation Research Part E: Logistics and Transportation. Review, 70, pp. 225-
244;
Zokaee, S., Jabbarzadeh, A., Fahimnia, B., Sadjadi, S.J., Robust supply chain
network design: An optimization model with real world application (2014) Ann Oper
Res, pp. 1-30;
Fahimnia, B., Jabbarzadeh, A., Ghavamifar, A., Bell, M., Supply chain design for
efficient and effective blood supply in disasters (2017) Int J Prod Econ, 183, pp.
700-709;
Jabbarzadeh, A., Fahimnia, B., Sheu, J.-B., An enhanced robustness approach for
managing supply and demand uncertainties (2017) Int J Prod Econ, 183, pp. 620-631;
Jabbarzadeh, A., Fahimnia, B., Sheu, J.-B., Moghadam, H.S., Designing a supply
chain resilient to major disruptions and supply/demand interruptions (2016) Transp
Res B Methodol, 94, pp. 121-149;
Fahimnia, B., Jabbarzadeh, A., Marrying supply chain sustainability and resilience:
a match made in heaven (2016) Transportation Research Part E: Logistics and
Transportation Review, 91, pp. 306-324;
Shishebori, D., Jabalameli, M.S., Jabbarzadeh, A., Facility location-network design
problem: Reliability and investment budget constraint (2013) J Urban Plann Dev,
140;
Diabat, A., Dehghani, E., Jabbarzadeh, A., Incorporating location and inventory
decisions into a supply chain design problem with uncertain demands and lead times
(2017) J Manuf Syst, 43, pp. 139-149;
Zadeh, L.A., Fuzzy sets (1965) Inf Control, 8 (3), pp. 338-353;
Liu, B., (1999) Uncertain Programming a Wiley-Interscience Publication, , New York;
Zimmermann, H.-J., (2001) Fuzzy set theory—and its applications, , Springer Science
and Business Media, Berlin;
conditions (2008) Fuzzy Sets Syst, 159 (2), pp. 215-236;
Tavakkoli-Moghaddam, R., Safaei, N., Babakhani, M., Solving a dynamic cell
formation problem with machine cost and alternative process plan by memetic
algorithms (2005) Stochastic algorithms: foundations and applications, pp. 213-
227., Springer, Berlin;
Torabi, S.A., Hassini, E., An interactive possibilistic programming approach for
multiple objective supply chain master planning (2008) Fuzzy Sets Syst, 159 (2),
pp. 193-214;
Paydar, M.M., Saidi-Mehrabad, M., Revised multi-choice goal programming for
integrated supply chain design and dynamic virtual cell formation with fuzzy
parameters (2015) Int J Comput Integr Manuf, 28 (3), pp. 251-265;
Arikan, F., Güngör, Z., A parametric model for cell formation and exceptional
elements’ problems with fuzzy parameters (2005) J Intell Manuf, 16 (1), pp. 103-
114;
Barua, A., Mudunuri, L.S., Kosheleva, O., Why trapezoidal and triangular membership
functions work so well: Towards a theoretical explanation (2014) Journal of
Uncertain Systems, 8 (3), pp. 164-168;
Sugeno, M., An introductory survey of fuzzy control (1985) Inf Sci, 36 (1), pp. 59-
83;
Ross, T.J., (2016) Fuzzy Logic with Engineering Applications, , John Wiley & Sons,
New Mexico;
Kennedy, J., Eberhart, R., Particle swarm optimization Proceedings of IEEE
International Conference On. Neural Networks, 1995, pp. 1942-1948., Perth,
Australia;
Kirkpatrick, S., Jr., Optimization by simulated annealing (1983) Science, 220
(4598), pp. 671-680;
Shafer, S., Rogers, D., Similarity and distance measures for cellular
manufacturing. Part I. A survey (1993) Int J Prod Res, 31 (5), pp. 1133-1142;
Kohonen, T., (2001) Self-organizing maps, 30., Springer, Berlin;
P Chandrasekharan, M., Rajagopalan, R., An ideal seed non-hierarchical clustering
Ravi Kumar, K., Kusiak, A., Vannelli, A., Grouping of parts and components in
flexible manufacturing systems (1986) Eur J Oper Res, 24 (3), pp. 387-397;
(1973) Int J Prod Res, 11 (4), pp. 399-416;
27 (7), pp. 1161-1165;
Chandrasekharan, M.P., Rajagopalan, R., GROUPABIL1TY: an analysis of the properties
1035-1052;
Manuf Syst, 6 (2), pp. 117-124;
Boctor, F.F., A Jinear formulation of the machine-part cell formation problem
(1991) Int J Prod Res, 29 (2), pp. 343-356;
clustering for group technology (1986) Int J Prod Res, 24 (5), pp. 1221-1233;
implementation—a state-of-the-art survey (1985) Omega, 13 (5), pp. 381-391;
Ravi Kumar, K., Vannelli, A., Strategic subcontracting for efficient disaggregated
manufacturing (1987) Int J Prod Res, 25 (12), pp. 1715-1728;
Srinl Vasan, G., Narendran, T.T., Mahadevan, B., An assignment model for the part-
implementation experiences and performance improvements (1997) Int J Prod Res, 35
(1), pp. 29-49;
Singh, N., Rajamani, D., (2012) Cellular manufacturing systems: design, planning
and control, , Springer Science and Business Media, Berlin;
Haykin, S.S., (2009) Neural networks and learning machines, 3., Pearson Education,
Upper Saddle River
CORRESPONDENCE ADDRESS: Jabbarzadeh, A.; Department of Industrial Engineering, Iran
University of Science and TechnologyIran; email: [email protected]
ISSN: 09410643
ABBREVIATED SOURCE TITLE: Neural Comput. Appl.
SOURCE: Scopus
Bychkov, I., Batsyn, M., Pardalos, P.M.

55842563400;37111907600;7005330875;
Heuristic for maximizing grouping efficiency in the cell formation problem
(2017) Springer Proceedings in Mathematics and Statistics, 197, pp. 11-26.
3-319-56829-4_2&partnerID=40&md5=235c1aebe36755c50b53266781850f54
DOI: 10.1007/978-3-319-56829-4_2
Nizhny Novgorod, 603093, Russian Federation;
Center for Applied Optimization, University of Florida, 401 Weil Hall, P.O. Box
116595, Gainesville, 32611-6595, United States
ABSTRACT: In our paper, we consider the Cell Formation Problem in Group Technology
with grouping efficiency as an objective function. We present a heuristic approach
for obtaining high-quality solutions of the CFP. The suggested heuristic applies an
improvement procedure to obtain solutions with high grouping efficiency. This
procedure is repeated many times for randomly generated cell configurations. Our
computational experiments are performed for popular benchmark instances taken from
the literature with sizes from 10×20 to 50×150. Better solutions unknown before are
found for 23 instances of the 24 considered. The preliminary results for this paper
are available in Bychkov et al. (Models, algorithms, and technologies for network
analysis, Springer, NY, vol. 59, pp. 43–69, 2013, [7]). © Springer International
Publishing AG 2017.
INDEX KEYWORDS: Benchmarking; Cellular manufacturing; Group technology; Heuristic
methods, Cell configurations; Cell formation problem; Computational experiment;
Grouping efficiency; Heuristic approach; High-quality solutions; Objective
functions, Efficiency
REFERENCES: Ahi, A., Mir, B., Aryanezhad, B., Ashtiani, A.M., Anovel approach to
determine cell formation, intracellular machine layout and cell layout in the CMS
problem based on TOPSIS method (2009) Comput. Oper. Res, 36 (5), pp. 1478-1496;
Askin, R.G., Chiu, K.S., A graph partitioning procedure for machine assignment and
cell formation in group technology (1990) Int. J. Prod. Res, 28 (8), pp. 1555-1572;
Matching processing requirements and operator capabilities (2010) J. Opl. Res. Soc,
61, pp. 827-839;
Burbidge, J.L., The new approach to production (1961) Prod. Eng, , (Dec. 3-19);
Bychkov, I., Batsyn, M., Sukhov, P., Ch. 4., Heuristic algorithm for the cell
formation problem (2013) Models, Algorithms, and Technologies for Network Analysis,
59, pp. 43-69., Goldengorin, B.I., Kalyagin, V.A., Pardalos, P.M. (eds.), Springer,
NY;
Int. J. Prod. Res, 11, pp. 399-416;
Chandrasekaran, M.P., Rajagopalan, R., MODROC: An extension of rank order
clustering of group technology (1986) Int. J. Prod. Res, 24 (5), pp. 1221-1233;
835-850;
1035-1052;
Elbenani, B., Ferland, J.A., (2012) Manufacturing Cell Formation by State-Space
Search, p. 14., Montreal, Quebec. CIRRELT-2012-07;
(1925) Trans. ASME, 46, pp. 691-738;
Ghosh, S., Mahanti, A., Nagi, R., Nau, D.S., Cell formation problem solved exactly
with the dinkelbach algorithm (1996) Ann. Oper. Res, 65 (1), pp. 35-54;
cell formation (2012) Oper. Res, 60 (5), pp. 1157-1166;
Goncalves, J.F., Resende, M.G.C., An evolutionary algorithm formanufacturing cell
Hsu, C.P., (1990) Similarity Coefficient Approaches to Machine-Component Cell
Formation in Cellular Manufacturing: A Comparative Study, , Ph.D. Thesis,
Department of Industrial and Manufacturing Engineering, University of Wisconsin
Milwaukee;
232;
Review and extension (1982) Int. J. Prod. Res, 20 (2), pp. 117-133;
technology (2012) CMS, 9, pp. 323-338;
J. Prod. Res, 28 (2), pp. 233-243;
(4), pp. 561-569;
Lei, D., Wu, Z., Tabu search formultiple-criteriamanufacturing cell design (2006)
Int. J. Adv. Manuf. Technol, 28, pp. 950-956;
Liang, M., Zolfaghari, S., Machine cell formation considering processing times and
machine capacities: An ortho-synapse Hopfield neural netowrk approach (1999) J.
Intell. Manuf, 10, pp. 437-447;
McAuley, J., Machine grouping for efficient production (1972) Prod. Eng. Res. Dev,
51 (2), pp. 53-57;
Mitrofanov, S.P., (1959) Nauchnye Osnovy Gruppovoy Tekhnologii, 435p., Lenizdat,
Leningrad, Russia, (in Russian);
Mitrofanov, S.P., The Scientific Principles ofGroup Technology (1966) Boston
Spa.National Lending Library Translation, Yorkshire, , (Translation of Mitrofanov
(1959));
Mosier, C.T., An experiment investigating the application of clustering procedures
and similarity coefficients to the GTmachine cell formation problem (1989) Int. J.
Prod. Res, 27 (10), pp. 1811-1835;
goodness of block-diagonal forms in group technology (1996) Int. J. Prod. Res, 34
(10), pp. 2767-2782;
Ng, S., Worst-case analysis of an algorithm for cellularmanufacturing (1993) Eur.
J. Oper. Res, 69 (3), pp. 384-398;
(1996) Oper. Res, 44 (5), pp. 735-744;
theoretic approach (1975) Int. J. Prod. Res, 13 (6), pp. 567-579;
block diagonal forms (1998) Int. J. Prod. Res, 36, pp. 3217-3222;
Shtub, A., Modelling group technology cell formation as a generalized assignment
problem (1989) Int. J. Prod. Res, 27 (5), pp. 775-782;
Srinivasan, G., Narendran, T.T., GRAFICS-A nonhierarchical clustering-algorithm for
Econ, 9, pp. 73-81;
MACE (1984) Int. J. Prod. Res, 22, pp. 937-948;
(2004) Comput. Ind. Eng, 46, pp. 495-510;
manufacturing design and layout (2007) Eur. J. Oper. Res, 181, pp. 156-167;
cell formation with multiple identical machines (2003) Eur. J. Oper. Res, 151, pp.
434-446;
modified ART1 method (2008) Eur. J. Oper. Res, 188 (1), pp. 140-152
Rodionova Street, Russian Federation; email: [email protected]
EDITORS: Pardalos P.M., Kalyagin V.A., Nikolaev A.I., Prokopyev O.A.
ISSN: 21941009
ISBN: 9783319568287
SOURCE: Scopus
Ree, P., Hwang, H.

7801595573;57013250000;
Two-stage procedure for the cell formation problem with alternative part processing
routes
(1996) Engineering Optimization, 26 (3), pp. 159-170. Cited 2 times.
0029705483&doi=10.1080%2f03052159608941115&partnerID=40&md5=519b6b03555da49c4ec53f9
e5d5e4cfb
DOI: 10.1080/03052159608941115
Keimyung University, 1000 Shindang-dong, Dalseo-gu, Taegu 704-701, South Korea;
Department of Industrial Engineering, Korea Adv. Inst. Sci. and Technol., 373-1
Kusong-dong, Yusong-gu, Taejon 305-701, South Korea
ABSTRACT: This paper proposes a two stage procedure for the cell formation problem
with alternative processing routes. Previously, Kusiak1 provided the generalized p-
median model in which route selection and part family formation problems are solved
simultaneously. In the proposed procedure, the two problems are solved separately
whose objective functions are formulated based on different similarity measures. In
the first stage, the route selection problem is solved using a newly defined
similarity measure, called the compatibility coefficient. The generated set of
routes tends to result in a grouping solution with highly independent manufacturing
cells. In the second stage, part families are formed using the p-median model.
Computational results by the proposed procedure are presented and compared to those
by the generalized p-median model.
AUTHOR KEYWORDS: Cell formation; Compatibility coefficients; Group technology;
Manufacturing; p-median model
INDEX KEYWORDS: Computational methods; Functions; Manufacture; Mathematical models;
Optimization; Problem solving, Alternative part processing routes; Cell formation
problem; Compatibility coefficient; Generalized p median model; Manufacturing
cells; Similarity measure, Production control
REFERENCES: Kusiak, A., Generalized group technology concept (1987) International
Wemmerov, U., Hyer, N.L., Research issues in cellular manufacturing (1987)
pp. 289-295;
framework (1994) Journal of Manufacturing Systems, 13, pp. 196-220;
in the presence of multiple processing routes (1994) Engineering Optimization, 22,
pp. 231-240;
Choobineh, F., A framework for the design of cellular manufacturing system (1988)
Sundaram, R.M., Doshi, K., Formation of part families to design cells with
alternative routing consideration (1992) Computers and Industrial Engineering, 23,
pp. 59-62;
routing consideration (1993) Computers and Industrial Engineering, 25, pp. 477-480;

alternative routeing (1993) International Journal of Production Research, 31, pp.
1259-1273;
Sankaran, S., Kasilingam, R., An integrated approach to cell formation and partr
routing in group technology manufacturing system (1990) Engineering Optimization,
16, pp. 235-245;
Nagi, R., Harhalakis, G., Proth, J., Multiple routing and capacity considerations
in group technology applications (1990) International Journal of Production
Research, 28, pp. 2243-2257;
Rajamani, D., Singh, N., Aneja, P., Integrated design of cellular manufacturing
Research, 24, pp. 451-464;
International Journal of Production Rrsearch, 28, pp. 233-243;
(1994) International Journal of Production Research, 32, pp. 273-297
CORRESPONDENCE ADDRESS: Ree, P.; Department of Industrial Engineering, College of
Engineering, Keimyung University, 1000 Shindang-dong, Dalseo-gu, Taegu 704-701,
South Korea
PUBLISHER: Taylor and Francis Inc.
ISSN: 0305215X
CODEN: EGOPA
ABBREVIATED SOURCE TITLE: Eng Optim
SOURCE: Scopus
Kamalakannan, R., Pandian, R.S., Sivakumar, P.

57193093056;24173456100;57213212883;
A simulated annealing for the cell formation problem with ratio level data
(2019) International Journal of Enterprise Network Management, 10 (1), pp. 78-90.
Cited 1 time.
85062569033&partnerID=40&md5=75ed453b7f01fd91fb6b5f6afcf1fc47
AFFILIATIONS: Department of Mechanical Engineering, M. Kumarasamy College of

Engineering, Tamil Nadu, 639113, India;
Department of Mechanical Engineering, SACS MAVMM Engineering College, Madurai, 625
301, India;
Faculty of Engineering, Mahsa University, Kuala Lumpur, 59100, Malaysia
ABSTRACT: In this paper, the cell formation problem is considered with ratio level
data with an objective of minimising the cell load variation. The attempt has been
made to propose a simulated annealing (SA) based on the perturbation scheme as
random insertion perturbation scheme (RIPS). The ratio level data is distinguished
by utilising the workload information gathered from process times, production
quantity of parts and also from the capacity of the machines. A modified grouping
efficiency (MGE) is used to measure the performance of the system. From the results
it is observed that the simulated annealing produces the solution does not differ
significantly from the optimal solutions for the benchmark problems. The algorithms
which we have chosen the benchmark problems are K-means, modified ART1 and genetic
algorithm taken from the literature. © 2019 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation problem; Ratio level data; Simulated annealing
REFERENCES: Adil, G.K., Rajamani, D., Strong, D., Assignment allocation and
simulated annealing algorithms for cell formation (1997) IIE Transactions, 29 (1),
pp. 53-67;
manufacturing system design (2007) The International Journal of Advanced
Arora, P.K., Haleem, A., Singh, M.K., Recent development of cellular manufacturing
systems (2013) Indian Academy of Sciences, 38 (3), pp. 421-428;
Chen, W.H., Srivastava, B., Simulated annealing procedures for forming machine
cells in group technology (1994) European Journal of Operations Research, 75 (1),
pp. 100-111;
Technology, 22 (1), pp. 125-133;
Kamalakannan, R., Pandian, R.S.S., A tabu search strategy for the cell formation
problem with ratio level data (2018) International Journal of Business Intelligence
and Data Mining, 13 (1-3), pp. 209-220;
Khabat, A., Mohammad, F., Ehram, S., A novel algorithm based on hybridization of
artificial immune system and simulated annealing for clustering problem (2012)
International Journal of Advanced Manufacturing Technology, 60 (5-8), pp. 723-732;
Li, X., Baki, M.F., Aneja, Y.P., An ant colony optimization meta-heuristic for
machine - part cell formation problems (2010) Computers and Operations Research, 37
(1), pp. 2071-2081;
Mahapatra, S.S., Pandian, R.S., Genetic cell formation using ratio level data in
cellular manufacturing systems (2008) International Journal of Advanced
Mahesh, O., Srinivasan, G., Multi-objectives for incremental cell formation problem
(1996) Annals of Operations Research, 143 (1), pp. 157-170;
1340-1347;
Parthasarathy, S., Rajendran, C., An experimental evaluation of heuristics for
scheduling in a real life flow shop with sequence dependent setup time of jobs
Ponnambalam, S.G., Sudhakara Pandian, R., Mahapatra, S.S., Saravanasankar, S., Cell
Formation with workload data in cellular manufacturing system using genetic
algorithm (2007) IEEE International Conference on Industrial Engineering and
Engineering Management, pp. 674-678;
Sivakumar, P., Ganesh, K., Arunachalam, S., Mathematical model and genetic
algorithm for distribution logistics problem with maximum route length (2008)
International Journal of Logistics and Globalisation, 1 (3), pp. 307-329;
Sivakumar, P., Ganesh, K., Koh, S.C.L., Multi-objective mathematical model for
order quantity allocation in multiple discount environments for health care supply
chain (2009) International Journal of Enterprise Network Management, 3 (2), pp.
130-156;
Sivakumar, P., Ganesh, K., Parthiban, P., Multi-phase composite analytical model
for integrated allocation-routing problem-application of blood bank logistics
(2008) International Journal of Logistics and Globalisation, 1 (3), pp. 251-281;
Sivakumar, P., Ganesh, K., Punnniyamoorthy Koh, S.C.L., Genetic algorithm for
inventory levels and routing structure optimization in two stage supply chain
(2013) International Journal of Information Systems and Supply Chain Management, 6
(2), pp. 33-49;
Sivakumar, P., Ganesh, K., Ducq, Y., Anbuudayasankar, S.P., Class of sustainable
supply chain routing problems - framework and comprehensive review (2012)
International Journal of Services and Operations Management, 12 (2), pp. 188-220;
Sofianopoulou, S., Manufacturing cells design with alternative process plans and or
707-720;
Tatjana, V.S., Vidosav, D.M., An integrated simulated annealing based method for
robust multi response process optimization (2012) International Journal of Advanced
Venugopal, V., Narendran, T.T., A Genetic algorithm approach to the machine
Engineering, 22 (4), pp. 469-480;
manufacturing cell formation problem (2008) Expert Systems with Applications, 34,
pp. 1609-1617;
problem involving processing times and lot sizes (2003) Computers and Industrial
Engineering, 45 (4), pp. 713-731
CORRESPONDENCE ADDRESS: Kamalakannan, R.; Department of Mechanical Engineering, M.
Kumarasamy College of EngineeringIndia; email: [email protected]
ISSN: 17481252
ABBREVIATED SOURCE TITLE: Int. J. Enterp. Network Manage.
SOURCE: Scopus
Babazadeh, R., Rafiei, H., Rabbani, M.

55154890000;27967949000;57208701862;
A dynamic sustainable cell formation problem in agile production systems
(2013) International Journal of Operational Research, 16 (4), pp. 448-464. Cited 3
times.
84875665067&doi=10.1504%2fIJOR.2013.052714&partnerID=40&md5=e4d511745d7054c31f3ee4a
1177043c1
DOI: 10.1504/IJOR.2013.052714
University of Tehran, P.O. Box 11155-45632, Tehran, Iran
ABSTRACT: This paper addresses cell formation problem in an agile production
environment considering machine modification. Having modifications applied, inter-
cell movements and costs of purchasing new machines are considerably reduced. Using
machine modification technology in cellular manufacturing system reduces the inter-
cell movement and costs of purchasing new machines. Parts' demands determine the
number of required machines in each period and thereby a proper decision can be
made in regards to purchasing new machines and/or machine modification. Considering
the customer satisfaction issue in the agile production systems, response time to
customers is very important, machine modification approach can be applied with
fewer costs and high degree of response (quick response) in these systems.
Sensitivity analysis on the machine modification benefits shows the sensitivity of
proposed model to this benefit. Copyright © 2013 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Agile production system; Cellular manufacturing; Dynamic cell
formation problem; Machine modification
REFERENCES: Ahi, A., Aryanezhad, M.B., Ashtiani, B., Makui, A., A novel approach to
problem based on TOPSIS method (2009) Computers & Operations Research, 36, pp.
1478-1496;
Anvari, M., Saidi Mehrabad, M., Barzinpour, F., Machine-part cell formation using a
hybrid particle swarm optimization (2010) Int. J. Advanced Manufacturing
Asif, H.M., Shankar, R., Sarkis, J., Suhail, A., Virtual company formation for
agile manufacturing using ANP and goal programming (2009) Int. J. Operational
Research, 4, pp. 422-445;
Azadeh, A., Pourvalikhan, N.B., Asadzadeh, S.M., Fathi, E., Optimal allocation of
operators in a cellular manufacturing system by an integrated computer simulation-
genetic algorithm approach (2011) Int. J. Operational Research, 10, pp. 333-360;
Bajestani, A., Rabbani, M., Rahimi-Vahed, A., Baharian Khoshkhou, G., Intra-cell
manpower transfers and cell loading in labor-intensive manufacturing cells (2009)
planning horizons (2005) Journal of Manufacturing Technology Management, 16, pp.
516-530;
Das, K., Abdul-Kader, W., Consideration of dynamic changes in machine reliability
and part demand: A cellular manufacturing systems design model (2011) Int. J.
cellular manufacturing systems (2006) Int. J. Production Economics, 103, pp. 767-
783;
Deljoo, V., Al-E-Hashem, S.M.J.M., Deljoo, F., Aryanezhad, M.B., Using genetic
algorithm to solve dynamic cell formation problem (2010) Applied Mathematical
Modelling, 34, pp. 1078-1092;
Diaby, M., Nsakanda, A.L., Large scale capacitated part-routing in the presence of
Research Society, 57, pp. 1100-1112;
Dreyfuss, J., Profit machine (2003) Bloomberg Markets, pp. 29-38., October;
Fan, J., Cao, M., Feng, D., Multi-objective dual resource-constrained model for
cell formation problem (2010) Proceedings of the IEEE ICMIT, pp. 1031-1036;
Manufacturing cell creation with losses because of not applying machine
modification approach (2006) Computers & Operations Research, 33, pp. 1010-1032;
Fung, R.Y.K., Liang, F., Jiang, Z., Wong, T.N., A multi-stage methodology for
virtual cell formation oriented agile manufacturing (2008) Int. J. Advanced
manufacturing: A state-of-The-Art review (2011) Int. J. Industrial Engineering
Computations, 2, pp. 87-122;
formation design: Benders' decomposition approach (2011) Expert Systems with
Applications, 38, pp. 2478-2488;
Heragu, S.S., Chen, J.R., Optimal solution of cellular manufacturing system design:
Benders decomposition approach (1998) European Journal of Operational Research,
107, pp. 175-192;
Jayaswal, S., Adil, G.K., Efficient algorithm for cell formation with sequence
data, machine replications and alternative process routings (2004) Int. J.
Research, 33, pp. 263-283;
using a rank order clustering algorithm (1980) Int. J. Production Research, 18, pp.
213-232;
Kioon, S.A., Bulgak, A.A., Bektas, T., Integrated cellular manufacturing systems
design with production planning and dynamic system reconfiguration (2009) European
Kristianto, Y., Helo, P., Takala, J., Manufacturing capabilities reconfiguration in
manufacturing strategy for sustainable competitive advantage (2011) Int. J.
Lozano, S., Canca, D., Guerrero, F., Garcia, J.M., Machine grouping using
sequencebased similarity coefficients and neural networks (2001) Robotics and
Computer-Integrated Manufacturing, 17, pp. 399-404;
cellular manufacturing system (1997) Computers & Industrial Engineering, 33 (1),
pp. 239-242;
Marsh, R.F., Meredith, J.R., McCutcheon, D.M., The life cycle of manufacturing
cells (1997) Int. J. Operations and Production Management, 17, pp. 1167-1182;
Mungwattana, A., (2000) Design of Cellular Manufacturing Systems for Dynamic and
Uncertain Production Requirement with Presence of Routing Flexibility, , PhD
Thesis, Blacksburg State University, Virginia;
Naadimuthu, G., Gultom, P., Lee, E.S., Cell formation design using fuzzy relations
based on a similarity coefficient (2011) Advances in Production Engineering &
Management, 6, pp. 77-86;
Nagel, R., Dove, R., (1991) 21st Century Manufacturing Enterprise Strategy, ,
Iccoca Institute, Leigh University;
Paydar, M.M., Mahdavi, I., Valipoor Khonakdari, S., Solimanpur, M., Developing a
mathematical model for cell formation in cellular manufacturing systems (2011) Int.
J. Operational Research, 11, pp. 408-424;
Pillai, V.M., Subbarao, K., A robust cellular manufacturing system design for
dynamic part population using a genetic algorithm (2007) Int. J. Production
Research, 46, pp. 5191-5210;
Rafiee, K., Rabbani, M., Rafiei, H., Rahimi-Vahed, A., A new approach towards
integrated cell formation and inventory lot sizing in an unreliable cellular
manufacturing system (2011) Applied Mathematical Modeling, 35, pp. 1810-1819;
Rheault, M., Drolet, J., Abdulnour, G., Physically reconfigurable virtual cells: A
dynamic model for a highly dynamic environment (1995) Computers & Industrial
Safaei, N., Saidi-Mehrabad, M., Jabal-Ameli, M.S., A hybrid simulated annealing for
solving an extended model of dynamic cellular manufacturing system (2008) European
Safaei, N., Tavakkoli-Moghaddam, R., Integrated multi-period cell formation and
subcontracting production planning in dynamic cellular manufacturing (2009) Int. J.
Production Economics, 120, pp. 301-314;
Satoglu, S., Suresh, N.C., A goal-programming approach for design of hybrid
cellular manufacturing systems in dual resource-constrained environments (2009)
24, pp. 909-929;
Wemmerlov, U., Hyer, N.L., Procedures for the part family/machine group
identification problem in cellular manufacture (1986) Journal of Operations
Wicks, E.M., Reasor, R.J., Designing cellular manufacturing system with dynamic
part populations (1999) IIE Transaction, 31, pp. 11-20;
Zhao, C., Wu, Z., A genetic algorithm for manufacturing cell formation problem with
multiple routs and multiple objectives (2000) Int. J. Production Research, 38, pp.
385-395
CORRESPONDENCE ADDRESS: Rabbani, M.; Department of Industrial Engineering, College
of Engineering, University of Tehran, P.O. Box 11155-45632, Tehran, Iran; email:
[email protected]
ISSN: 17457645
ABBREVIATED SOURCE TITLE: Int. J. Oper. Res.
SOURCE: Scopus
Paydar, M.M., Saidi-Mehrabad, M.

23025569300;18435197300;
A hybrid genetic-variable neighborhood search algorithm for the cell formation
problem based on grouping efficacy
84872422771&doi=10.1016%2fj.cor.2012.10.016&partnerID=40&md5=db66255004991fb1226339
13f7bd4bb9
DOI: 10.1016/j.cor.2012.10.016
ABSTRACT: Cell formation problem attempts to group machines and part families in
dedicated manufacturing cells such that the number of voids and exceptional
elements in cells are minimized. In this paper, we presented a linear fractional
programming model with the objective of maximizing the grouping efficacy while the
number of cells is unknown. To show the effectiveness of the proposed model, two
test problems were applied. Then, to solve the model for real-sized applications, a
hybrid meta-heuristic algorithm in which genetic algorithm and variable
neighborhood search are combined. Using the grouping efficacy measure, we have also
compared the performance of the proposed algorithm on a set of 35 test problems
from the literature. The results show that the proposed GA-VNS method outperforms
the state-of-the-art algorithms. © 2012 Elsevier Ltd.
AUTHOR KEYWORDS: Cell formation problem; Grouping efficacy; Hybrid genetic
algorithm
INDEX KEYWORDS: Cell formation problem; Exceptional elements; Grouping efficacy;
Hybrid genetic algorithms; Linear fractional programming; Meta heuristic algorithm;
Neighborhood search algorithms; Part family; State-of-the-art algorithms; Test
problem; Variable neighborhood search, Cellular manufacturing; Heuristic
algorithms, Genetic algorithms
REFERENCES: Agarwal, A., Sarkis, J., A review and analysis of comparative
performance studies on functional and cellular manufacturing layouts (1997)
Anvari, M., Saidi Mehrabad, M., Barzinpour, F., Machine-part cell formation using a
hybrid particle swarm optimization (2010) International Journal of Advanced
Alba, E., (2005) Parallel Metaheuristics: A New Class of Algorithms, , John Wiley
and Sons, Inc. Hoboken, New Jersey;
Arkat, A., Hosseini, L., Hosseinabadi Farahani, M., Minimization of exceptional
algorithm (2011) Expert Systems with Applications, 38, pp. 9597-9602;
113;
Back, T., Fogel, D., Michalawecz, Z., (1997) Handbook of Evolutionary
Computation, , Oxford University Press Oxford;
Banerjee, I., Das, P., Group technology based adaptive cell formation using
predator-prey genetic algorithm (2012) Applied Soft Computing, 12 (1), pp. 559-572;
Ballakur, A., (1985) An Investigation of Part Family/machine Group Formation in

Designing A Cellular Manufacturing System, , PhD thesis. University of Wisconsin,
Madison, WI;
Research, 25, pp. 639-655;
Behnamian, J., Zandieh, M., Fatemi Ghomi, S.M.T., Parallel-machine scheduling
problems with sequence-dependent setup times using an ACO, SA and VNS hybrid
pp. 2097-2116;
manufacturing cell formation problem (2006) Computer & Operation Research, 33, pp.
2219-2245;
Bortolini, M., Manzini, R., Accorsi, R., Mora, C., An hybrid procedure for machine
duplication in cellular manufacturing systems (2011) International Journal of
Research, 24 (5), pp. 1221-1233;
Research, 24 (2), pp. 451-464;
pp. 293-318;
groups and part families (1998) International Journal of Production Research, 1998
(36), pp. 1325-1337;
Durán, O., Rodriguez, N., Consalter, L.A., Collaborative particle swarm
optimization with a data mining technique for manufacturing cell design (2010)
Feng, Y.X., Pheng, K.L., An exact schema theorem for adaptive genetic algorithm and
its application to machine cell formation (2011) Expert Systems with Applications,
38, pp. 8538-8552;
Ghosh, T., Sengupta, S., Chattopadhyay, M., Dan, P.D., Meta-heuristics in cellular
manufacturing: A state-of-the-art review (2010) International Journal of Industrial
Ghosh, T., Dan, P.D., Sengupta, S., Chattopadhyay, M., Genetic rule based
techniques in cellular manufacturing (1992-2010): A systematic survey (2010)
International Journal of Engineering, Science and Technology, 2 (5), pp. 198-215;
Goldberg, D.E., (1989) Genetic Algorithms: In Search, Optimization & Machine
Learning, , Addison-Wesley, Inc. MA;
Greene, T., Sadowski, R., A review of cellular manufacturing assumptions,
advantages, and design techniques (1984) Journal of Operations Management, 4 (2),
pp. 85-97;
Hsu, C.P., (2002) Similarity Coefficient Approaches to Machine Component Cell
Formation in Cellular Manufacturing: A Comparative Study, , PhD thesis. Department
of Industrial and Systems Engineering, University of Wisconsin, Milwaukee, WI;
algorithm (2011) Mathematical and Computer Modelling, 53 (910), pp. 1776-1787;
2059-2079;
Kamraniand, A., Parsaie, H., Chaudhry, M., A survey of design methods for
manufacturing cells (1993) Computers & Industrial Engineering, 25 (14), pp. 487-
490;
Research, 18, pp. 213-232;
King, R.E., Nakornchai, V., Machine-component group formation in group technology:
pp. 117-133;
397;
1715-1728;
pp. 2633-2646;
Mahdavi, I., Javadi, B.F., Alipour, K., Slomp, J., Designing a new mathematical
Mansouri, A., Moattar-Husseini, S.M., Newman, S.T., A review of the modern
Research, 38 (5), pp. 1201-1218;
McCormick, W.T., Schweitzer, P.J., White TW. Problem decomposition and data
1009;
Lending Library Translation Boston Spa, Yorks, UK;
Mladenović, N., Hansen, P., Variable neighborhood search (1997) Computers &
machine-part cell formation problems (2010) Computers &operations Research, 37, pp.
2071-2081;
Offodile, O., Mehrez, A., Grznar, J., Cellular manufacturing: A taxonomic review
framework (1994) Journal of Manufacturing Systems, 13 (3), pp. 196-220;
systems (2001) Computers & Industrial Engineering, 39 (12), pp. 125-144;
Pailla, A., Trindade, A.R., Parada, V., Ochi, V.L., A numerical comparison between
Paydar, M.M., Mahdavi, I., Szabat, K.A., Application of single depot multiple
travelling salesman method to cell formation problems (2010) International Journal
of Applied Decision Sciences, 3 (4), pp. 390-399;
mathematical model for cell formation in cellular manufacturing systems (2011)
International Journal of Operational Research, 11 (4), pp. 408-424;
Salehipour, A., Sörensen, K., Goos, P., Bräysy, O., Efficient GRASP+VND and
GRASP+VNS metaheuristics for the traveling repairman problem (2011) 4OR - A
Quarterly Journal of Operations Research, 9 (2), pp. 189-209;
Research, 28 (1), pp. 145-152;
463-478;
pp. 1989-2007;
Unler, A., Gungo, Z., Applying K-harmonic means clustering to the part-machine
classification problem (2009) Expert Systems with Applications, 36, pp. 1179-1194;
Wen, Y., Xu, H., Yang, J., A heuristic-based hybrid genetic-variable neighborhood
search algorithm for task scheduling in heterogeneous multiprocessor system (2011)
Wu, A., Yu, H., Jin, S., Lin, K., Schiavone, G., An incremental genetic algorithm
approach to multiprocessor scheduling (2004) IEEE Transactions on Parallel and
Distributed Systems, 15, pp. 824-834;
pp. 1609-1617;
(2009) International Journal of Production Economics, 120, pp. 669-688;
cell formation problems (2010) European Journal of Operational Research, 205, pp.
346-360;
152;
Economics, 101, pp. 329-352;
CORRESPONDENCE ADDRESS: Paydar, M.M.; Department of Industrial Engineering, Iran
ISSN: 03050548
CODEN: CMORA
SOURCE: Scopus
Lin, C.-C., Chang, C.-C., Li, F.-C.

55268256200;57142825500;35262123900;
An efficient tabu search approach to determine cell formation problem with
consideration of cell layout
Management, art. no. 6118155, pp. 1441-1445.
84863082523&doi=10.1109%2fIEEM.2011.6118155&partnerID=40&md5=a4fa735040b9540386f1eb
6bb32ff082
DOI: 10.1109/IEEM.2011.6118155
AFFILIATIONS: Department of Applied English, Yu Da University, Taiwan;
Department of Information Management, Jen-Teh Junior College of Medicine, Nursing
and Management, Taiwan
ABSTRACT: In this paper, a mathematical model is formulated to integrate cell
formation and cell layout simultaneously with considerations of alternative process
routings, operation sequences, production volume and different cellular layout
type. Due to the combinatorial nature of cell formation problem and cell layout
problem, an efficient tabu search (TS) approach has been proposed to address these
issues. Several test instances from the literature are employed to illustrate the
effectiveness of the proposed solution algorithm. Computational experiences from
test problems show that the proposed approach is extremely effective and efficient.
When compared with the mathematical programming approach which took 34 hours to
solve problems, the proposed algorithm is able to produce optimal solutions in less
than 1 second. These comparisons show that the proposed approach is very effective,
efficient and practical. © 2011 IEEE.
AUTHOR KEYWORDS: Cell formation; Cell layout; Tabu search
INDEX KEYWORDS: Alternative process routings; Cell formation; Cell formation
problem; Cell layout; Cell layout problem; Cellular layout; Operation sequences;
Optimal solutions; Production volumes; Solution algorithms; Test instances; Test
problem, Algorithms; Cells; Cellular manufacturing; Industrial engineering;
Mathematical models; Mathematical programming; Tabu search, Problem solving
REFERENCES: Wemmerlov, U., Hyer, N., Research issues in cellular manufacturing
Research, 25, pp. 639-655;
manufacturing cells (2005) Computers and Industrial Engineering, 48 (1 SPEC. ISS.),
pp. 3-21., DOI 10.1016/j.cie.2004.06.008, PII S0360835204001330;
pp. 1609-1617;
grouping (2009) Computers and Industrial Engineering, 56, pp. 347-356;
346-360;
52, pp. 53-57;
problem: A comparative investigation (2005) Computers and Industrial Engineering,
48, pp. 471-489;
pp. 509-516;
707-720
CORRESPONDENCE ADDRESS: Lin, C.-C.; Department of Applied English, Yu Da
UniversityTaiwan; email: [email protected]
ISSN: 21573611
ISBN: 9781457707391
SOURCE: Scopus
Mahdavi, I., Paydar, M.M., Solimanpur, M., Heidarzade, A.

16417373200;23025569300;35615315700;24398898300;
Genetic algorithm approach for solving a cell formation problem in cellular
manufacturing
(2009) Expert Systems with Applications, 36 (3 PART 2), pp. 6598-6604. Cited 97
times.
58349114021&doi=10.1016%2fj.eswa.2008.07.054&partnerID=40&md5=c770cc7fa1949f7fcdb7a
3e811ce7bc3
DOI: 10.1016/j.eswa.2008.07.054
Science and Technology, Tabarsi Street, Babol, 47166-95635, Iran;
Faculty of Engineering, Urmia University, Urmia, Iran;
Department of Industrial Engineering, Payame Noor University, Sari, Iran
ABSTRACT: Cellular manufacturing (CM) is an industrial application of group
technology concept. One of the problems encountered in the implementation of CM is
the cell formation problem (CFP). The CFP attempted here is to group machines and
parts in dedicated manufacturing cells so that the number of voids and exceptional
elements in cells are minimized. The proposed model, with nonlinear terms and
integer variables, cannot be solved for real sized problems efficiently due to its
NP-hardness. To solve the model for real-sized applications, a genetic algorithm is
proposed. Numerical examples show that the proposed method is efficient and
effective in searching for optimal solutions. The results also indicate that the
proposed approach performs well in terms of group efficacy compared to the well-
known existing cell formation methods. © 2008 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Genetic algorithm;
Group efficacy; Mathematical model
INDEX KEYWORDS: Cells; Cytology; Genetic algorithms; Group technology; Mathematical
models; Numerical methods, Cell formation; Cell formation problem; Exceptional
elements; Genetic algorithm approach; Group efficacy; Integer variables; Nonlinear
terms; Optimal solutions, Cellular manufacturing
REFERENCES: Back, T., Fogel, D., Michalawecz, Z., (1997) Handbook of evolutionary
computation, , Oxford University Press, Oxford;
Brown, E., Sumichrast, R., CF-GGA: A grouping genetic algorithm for the cell
3651-3669;
Research, 24 (5), pp. 1221-1264;
Research, 24 (2), pp. 451-464;
pp. 293-318;
pp. 1325-1337;
Chu, C. H. & Tsai, C. C. (2001). A heuristic algorithm for grouping manufacturing
cells. In Proceedings of the 2001 IEEE Congress on Evolutionary Computation, Seoul,
Korea (pp. 310-317); Davis, L., (1991) Handbook of genetic algorithms, , Van
Nostrand, New York;
Gen, M., Cheng, R., (1997) Genetic algorithms and engineering design, , Wiley
Interscience Publication, MA;
Goldberg, D.E., (1989) Genetic algorithms: Search, optimization & machine learning,
, Addison-Wesley, Inc., MA;
Holland, J.H., (1975) Adaptation in natural and artificial system, , University of
Michigan Press, Ann Arbor, MI;
Ji, P., Yongzhong, W. & Haozhao. L. (2006). A solution method for the quadratic
assignment problem (QAP). Presented at the Sixth International Symposium on
Operations Research and Its Applications (ISORA'06), Xinjiang, China, August 2006;
Joines, J.A., King, R.E., Culbreth, C.T., A comprehensive review of production
oriented manufacturing cell formation techniques (1996) International Journal of
Flexible Automation and Integrated Manufacturing, 3, pp. 225-265;
programming model employing genetic algorithms (1996) IIE Transactions, 28, pp. 69-
85;
Research, 18, pp. 213-232;
pp. 2633-2646;
Mahdavi, I., Javadi, B.F., Alipour, K., Slomp, J., Designing a new mathematical
Man, K.F., Tang, K.S., Kwong, S., (1999) Genetic algorithms: Concepts and design, ,
Springer, London;
463-478;
process routes by genetic algorithm (2002) International Journal of Production
Economics, 76 (3), pp. 219-228;
Venugopal, V., Narendran, T.T., A genetic algorithm approach to the machining
Engineering, 22 (4), pp. 469-480;
1615;
pp. 1609-1617;
Research, 38 (2), pp. 385-395;
Zolfaghari, S., Liang, M., An objective-guided ortho-synapse Hopfield network
approach to machine grouping problems (1997) International Journal of Production
Research, 35 (10), pp. 2773-2792
Mazandaran University of Science and Technology, Tabarsi Street, Babol, 47166-
95635, Iran; email: [email protected]
ISSN: 09574174
CODEN: ESAPE
SOURCE: Scopus
Bajestani, M.A., Rabbani, M., Rahimi-Vahed, A.R., Baharian Khoshkhou, G.

23097099600;57208701862;15048438700;23097190300;
A multi-objective scatter search for a dynamic cell formation problem
53749083609&doi=10.1016%2fj.cor.2007.10.026&partnerID=40&md5=52a45f52bbfab5bc5bbd16
b5ac44eabc
DOI: 10.1016/j.cor.2007.10.026
AFFILIATIONS: Department of Industrial Engineering. University of Tehran, P.O. Box
11365, 4563 Tehran, Iran
ABSTRACT: Cellular manufacturing system-an important application of group
technology (GT)-has been recognized as an effective way to enhance the productivity
in a factory. Consequently, a multi-objective dynamic cell formation problem is
presented in this paper, where the total cell load variation and sum of the
miscellaneous costs (machine cost, inter-cell material handling cost, and machine
relocation cost) are to be minimized simultaneously. Since this type of problem is
NP-hard, a new multi-objective scatter search (MOSS) is designed for finding
locally Pareto-optimal frontier. To demonstrate the efficiency of the proposed
algorithm, MOSS is compared with two salient multi-objective genetic algorithms,
i.e. SPEA-II and NSGA-II based on some comparison metrics and statistical approach.
The computational results indicate the superiority of the proposed MOSS compared to
these two genetic algorithms. © 2007 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Dynamic cell formation; Multi-objective cell formation problem;
Multi-objective genetic algorithms; Multi-objective scatter search
INDEX KEYWORDS: Algorithms; Cells; Costs; Cytology; Genetic algorithms; Group
technology; Industrial engineering; Manufacture; Materials handling; Multiobjective
optimization; Nuclear propulsion, Dynamic cell formation; Multi-objective cell
formation problem; Multi-objective genetic algorithms; Multi-objective scatter
search, Cellular manufacturing
REFERENCES: McAuley J. Machine grouping for efficient production. Production
Engineer 1972; 53-57; King, J.R., Machine-component group formation in group
technology, OMEGA (1979) International Journal of Management Science, 7, pp. 193-
199;
Ham, I., Hitomi, K., Yoshida, T., (1985) Group technology application to production
management, , Kluwer, Nijhoff, Dordrecht;
Askin, R.G., Estrada, S., Investigation of cellular manufacturing practices (1999)
Handbook of cellular manufacturing systems, pp. 25-34., Irani S.A. (Ed), John
Wiley, New York [Chapter 1];
Chen, M., A mathematical programming model for system reconfiguration in a dynamic
cellular manufacturing environment (1998) Annals of operation research, 74, pp.
179-284;
752;
Rosenblatt, M.J., The dynamic of plant layout (1986) Management Science, 32 (1),
pp. 76-86;
part populations (1999) IIE Transaction, 31, pp. 11-20;
pp. 516-530;
cellular manufacturing: a review and future directions (2007) European Journal of
Saidi-Mehrabad M, Safaei N. A new model of dynamic cell formation by a neural
approach. International Journal Advanced Manufacturing Technology 2007;33:1001-9;
research, 44 (12), pp. 2421-2444;
Wei, J.C., Gaither, N., A capacity constrained multi-objective cell formation
method (1990) Journal of Manufacturing Systems, 9, pp. 222-232;
problem (1991) Journal of Operations Management, 10, pp. 28-43;
simulated annealing: an experimental evaluation (1992) European Journal of
Dahel, N.E., Smith, S.B., Designing flexibility into cellular manufacturing systems
Liang, M., Taboun, S.M., Converting functional manufacturing systems into focused
machine cells-a bi-criterion approach (1995) International Journal of Production
Research, 33, pp. 2147-2161;
Gupta, Y., Gupta, M., Kumar, A., Sundaram, C., A genetic algorithm-based approach
Shang, J.S., Tadikamalla, P.R., Multi-criteria design and control of a cellular
manufacturing system through simulation and optimization (1998) International
multiple routs and multiple objectives (2000) International Journal of Production
Research, 38 (2), pp. 385-395;
Mansouri, S.A., Moattar-Husseini, S.H., Zegordi, S.H., A genetic algorithm for
multiple objective dealing with exceptional elements in cellular manufacturing
(2003) Production Planning & Control, 14 (5), pp. 437-446;
pp. 829-853;
Collette, Y., Siarry, P., (2003) Multi-objective optimization: principles and case
studies, , Springer, New York;
Suppapitnarm A, Seffen KA, Parks GT, Clarkson PJ, Liu JS. Design by multi-objective
optimization using simulated annealing. In: First international conference on
engineering design ICED 99, Munich, Germany; 1999; Fonseca CM, Fleming PJ, Multi-
objective genetic algorithms made easy: selection, sharing and mating restriction.
In: First IEE/IEEE international conference on genetic algorithms in engineering
systems, Sheffield, England; 1995; Schaffer J. Multiple objective optimization with
vector evaluated genetic algorithms. In: First international conference on genetic
algorithms, Pittsburgh; 1985; Horn, J., Nafploitis, N., Goldberg, D.E., A niched
Pareto genetic algorithm for multi-objective optimization (1994) Proceedings of the
first IEEE conference on evolutionary computation, pp. 82-87., Michalewicz Z. (Ed),
IEEE Press, Piscataway, NJ;
Knowles, J., Corne, D., The Pareto archived evolution strategy: a new baseline
algorithm for multi-objective optimization (1999) Proceedings of the 1999 Congress
on Evolutionary Computation, pp. 98-105., IEEE Press, Piscataway, NJ;
Srinivas, N., Deb, K., Multi-objective function optimization using non-dominated
sorting genetic algorithms (1995) Evolutionary Computation, 2 (3), pp. 221-248;
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T., A fast and elitist multi-objective
genetic algorithm: NSGA-II (2002) IEEE Transactions on Evolutionary Computation, 6
(2), pp. 182-197;
Zitzler E, Evolutionary algorithms for multi-objective optimization: methods and
applications, Doctoral dissertation ETH 13398, Swiss Federal Institute of
Technology (ETH), Zurich, Switzerland; 1999; Zitzler E, Laumanns M, Thiele L.
SPEA2: improving the strength Pareto evolutionary algorithm. In: Giannakoglou K,
Tsahalis D, Periaux J, Papailou P, Fogarty T. (Eds.), EUROGEN 2001, evolutionary
methods for design, optimization and control with applications to industrial
problems, Athens, Greece, 2001, pp. 95-100; Jaszkiewicz A. Genetic local search for
multiple objective combinatorial optimization. Technical Report RA-014/98,
Institute of Computing Science, Poznan University of Technology; 1998; Jaszkiewicz,
A., Do multiple-objective metaheuristics deliver on their promises? A computational
experiment on the set-covering problem (2003) IEEE Transactions on Evolutionary
Computation, 7 (2), pp. 133-143;
Beausoleil, R.P., "MOSS" multi-objective scatter search applied to non-linear
multiple criteria optimization (2006) European Journal of Operational Research,
169, pp. 426-449;
Marti, R., Scatter search-wellsprings and challenges (2006) European Journal of
Marti, R., Laguna, M., Glover, F., Principles of scatter search (2006) European
Glover, F., Laguna, M., Marti, R., (2000) "Scatter search," to appear in theory and
application of evolutionary computation: recent trends, , Ghosh A., and Tsutsui S.
(Eds), Springer, New York;
Hwang, C.L., Lin, M.L., (1987) Group decision making under multiple criteria, ,
Springer, New York
CORRESPONDENCE ADDRESS: Rabbani, M.; Department of Industrial Engineering.
University of Tehran, P.O. Box 11365, 4563 Tehran, Iran; email: [email protected]
ISSN: 03050548
CODEN: CMORA
SOURCE: Scopus
Khamseh, A.A., Paydar, M.M., Sahebjamnia, N., Mofidi, M.

55533063500;23025569300;23986437400;55938538400;
A mathmatical model for cell formation problem with operation sequence
(2008) 38th International Conference on Computers and Industrial Engineering 2008,
3, pp. 2169-2174.
84888229969&partnerID=40&md5=62c357eee4bbdc2081c6d0d662727fe6

Young Researchers Club, Babol Branch, Islamic Azad University, Iran
ABSTRACT: Cell formation problem (CFP) is an important problem in the design of a
cellular manufacturing system. Most of the methods have been proposed to solve the
CFP based on machine-part incidence alone. However, other factors such as
production sequence and product volumes, if incorporated, can enhance the quality
of the solutions. So an attempt have been made to take into account the natural
constraints of real-life production systems, such as operation sequences, minimum
and maximum numbers of cells and cell sizes. This paper presents a new mathematical
model to solve a CFP based on operation sequence with varied number of the cell
that minimized the sum total cost of inter-cell and intra-cell movements
simultaneously. To validate the proposed model, some numerical example from existed
literature has been solved with the linearized formulation. Copyright©(2008) by
Computers & Industrial Engineering.
AUTHOR KEYWORDS: Cell formation problem; Inter-cell and intra-cell movement;
Operation sequence
INDEX KEYWORDS: Cell formation problem; Cell size; Inter-cell and intra-cell
movement; Mathmatical models; New mathematical model; Operation sequences;
Production sequences; Production system, Cellular manufacturing; Cytology;
Production engineering, Cells
REFERENCES: Adil, G.K., Rajamani, D., The trade-off between intracell and intercell
moves in group technology cell formation (2000) Journal of Manufacturing Systems,
19 (5), pp. 305-317;
Boilif, M., Atif, K., A new branch-&-boundenhanced genetic algorithm for the
manufacturing cell formation problem (2006) Computers & Operations Research, 33,
pp. 2219-2245;
Jayakrishnan Nair, G.J., Narendran, T.T., CASE: A clustering algorithm for cell
formation with sequence data (1998) International Journal of Production Research,
36, pp. 157-179;
data, machine replications and alternative process routings (2004) International
Logendran, R., Impact of sequence of operations and layout of cells in cellular
Javadi, B., Mahdavi, I., Fallah-Alipour, K., Shirazi, B., Slomp, J., Designing anew
mathematical model for cell formation in CMS using sequence data (2007) Proceedings
of the 37th International Conference on Computers and Industrial Engineering, ,
October 20- 23;
attractiveness of group technology cellular layouts (1990) Management Science, 36
(12), pp. 1567-1578;
Sankaran, S., Kasilingam, R.G., On cell size and machine requirements planning in
group technology systems (1993) European Journal of Operations Research, 69, pp.
373-383;
Sarker, B.R., Xu, Y., Operation sequencesbased cell formation methods: A critical
survey (1998) Production Planning and Control, 9, pp. 771-783;
functional mathematical programming model (2006) International Journal Advanced
materials flow approach based on operation sequences (1990) IEE Transactions, 22,
pp. 84-97;
WemmerloK, U., Hyer, V.N., Cellular manufacturing in the us Industry: A survey of
users (1989) International Journal of Computer Integrated Manufacturing, 27 (9),
pp. 1511-1530;
1409-1421
CORRESPONDENCE ADDRESS: Department of Industrial Engineering, Mazandaran University
of Science and Technology, Babol, Iran
ISBN: 9781627486828
ABBREVIATED SOURCE TITLE: Int. Conf. Comput. Ind. Eng.
SOURCE: Scopus
Ulutas, B.
6602524363;
Assessing the number of cells for a cell formation problem
(2015) IFAC-PapersOnLine, 28 (3), pp. 1122-1127. Cited 2 times.
84953877482&doi=10.1016%2fj.ifacol.2015.06.234&partnerID=40&md5=acf742465d5a1f03f28
acecf0c380115
DOI: 10.1016/j.ifacol.2015.06.234
AFFILIATIONS: Department of Industrial Engineering, Eskisehir Osmangazi University,
Eskisehir, 26480, Turkey
ABSTRACT: Cellular manufacturing design is concerned with the creation and
operation of manufacturing cells to take the advantage of flexibility, efficient
flow and high production rate. Cell formation problem (CFP) is the assignment of
part types and machines to specific cells based on their similarity. Several exact
and heuristic methods are provided in literature to solve the problem and test
problems in literature are commonly used for comparison. This study presents a
Clonal Selection Algorithm (CSA) to solve a classical CFP that outperforms current
available heuristics in the literature. The number of cells may be critical in the
environments where cell formation costs are high and singletons occur in a design.
It is concluded that the CFP results should be assessed not only based on efficacy
values but also the number of cells. © 2015, IFAC (International Federation of
Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Artificial immune systems; Cell formation problem; Clonal
selection algorithm; Group technology
INDEX KEYWORDS: Cells; Clone cells; Cytology; Flexible manufacturing systems; Group
technology; Heuristic methods; Manufacture; Problem solving, Artificial Immune
System; Cell formation; Cell formation problem; Cellular manufacturing designs;
Clonal selection algorithms; High production rate; Test problem, Cellular
manufacturing
REFERENCES: Arvindh, B., Irani, S.A., CF: The need for an integrated solution of
the sub problem (1994) International Journal of Production Research, p. 1197;
Askin, R.G., Standrige, C.R., (1993) Modeling and Analysis of Manufacturing
Systems, , Wiley: New York;
Boctor, F.A., Linear formulation of the machine-part cell formation problem (1991)
pp. 2097-2116;
3651-3669;
Burbidge, J.L., (1979) Group Technology in Engineering Industry, , London:
Mechanical Engineering Publications;
binary data matrices for group technology (1989) International Journal of
Dasgupta, D., Ji, Z., Gonzalez, F., Artificial immune systems research in the last
five years (2003) Proceedings of the 2003 Congress on Evolutionary Computation
Conference, pp. 123-130., Canberra. Australia. December 8-13;
De Castro, L., Von Zuben, (1999) Artificial Immune Systems: Part I: Basic Theory
and Applications, , http://.dca.fee.uni-camp.br/~Inunes/immune.html, FEEC Univ.
Campnas, Campinas, Brasil;
De Witte, L., The use of similarity coefficients in production flow analysis (1980)
Islier, A.A., Forming manufacturing cells by using genetic algorithm (2001) Anadolu
University Journal of Science and Technology, 2, pp. 137-157;
Islier, A.A., Group technology by ants (2005) International Journal of Production
Research, 43 (5), pp. 913-932;
James, T., Brown, E.C., Keeling, K.B., A hybrid grouping genetic algorithm for the
cell formation problem (2007) Computers and Operations Research, 34, pp. 2059-2079;
Joines, J., Culberth, C.T., King, R.E., Manufacturing cell design: An integer
programming model employing genetic algorithms (1996) IEE Transactions, 28, pp. 69-
85;
Research, 18 (2), pp. 213-232;
pp. 117-133;
1715-1728;
397;
2633-2646;
1009;
systems (2001) Computers & Industrial Engineering, 39, pp. 125-144;
Ozturk, G., Ozturk, Z.K., Islier, A.A., A comparison of competitive neural network
with other AI techniques in manufacturing cell formation (2006) ICNC 2006, pp. 575-
583., L. Jiao et al. (Eds.) LNCS 4221;
Papaionnaou, G., Wilson, J.M., The evolution of cell formation problem
Sarker, B.R., Mondai, S., Grouping efficiency measures of cellular manufacturing
419-426;
group technology (1986) HE Transactions, 18 (3), pp. 266-270;
Research, 28, pp. 145-152;
cell formation problem (2008) International Journal of Production Research, pp. 1-
19;
Ulutas, B.H., Kulturel-Konak, S., A review of clonal selection algorithm and its
applications (2011) Artificial Intelligence Review, 36 (2), pp. 117-138;
(1984) MACE. International Journal of Production Research, 22, pp. 937-948;
algorithms and tabu search for binary and comprehensive machine-grouping problems
CORRESPONDENCE ADDRESS: Ulutas, B.; Department of Industrial Engineering, Eskisehir
Osmangazi UniversityTurkey; email: [email protected]
EDITORS: Dolgui A., Sasiadek J., Zaremba M.
ISSN: 24058963
ABBREVIATED SOURCE TITLE: IFAC-PapersOnLine
SOURCE: Scopus
Mar-Ortiz, J., González-Velarde, J.L., Adenso-Díaz, B.

56013630300;6505804080;7004391860;
A VNS algorithm for a disassembly cell formation problem with demand variability
(2014) European Journal of Industrial Engineering, 8 (1), pp. 22-49. Cited 2 times.
84894616070&doi=10.1504%2fEJIE.2014.059347&partnerID=40&md5=fe065651c71a37e05341764
b0d8ecb69
DOI: 10.1504/EJIE.2014.059347
AFFILIATIONS: Department of Logistics and Manufacturing Systems, Faculty of
Engineering, Universidad Autónoma de Tamaulipas, 89140 Tampico Tamaulipas, Mexico;
Tecnológico de Monterrey, 64849 Monterrey, Nuevo León, Mexico;
Engineering School, Universidad de Oviedo, 33203 Gijón, Spain
ABSTRACT: A disassembly cell formation problem with demand variability is addressed
in this paper under a reconfigurable approach. The reconfigurable approach allows
the cells to be rearranged periodically to deal with demand variability in a multi-
period planning horizon. We present a first mathematical programming model for this
new problem as well as a solution method based on the variable neighbourhood search
(VNS) methodology. Computational results on a set of random instances show the
convenience of the proposed algorithm to reach near optimal solutions in short
computing times. When compared with the solutions found by CPLEX after 5 hrs of CPU
time, on average our proposed algorithm obtained solutions improved by 7.96%. When
our VNS solution is provided to CPLEX as the starting solution, these are improved
by 2.75% on average. The comparison shows that our heuristic algorithms reach high
quality solutions in very short computing times. Copyright © 2014 Inderscience
Enterprises Ltd.
AUTHOR KEYWORDS: Cellular manufacturing; DCFP; Disassembly cell formation
problem; Integer optimisation; Reverse logistics; Variable neighbourhood search;
VNS
REFERENCES: Adenso-Diaz, B., Lozano, S., A model for the design of dedicated
manufacturing cells (2008) International Journal of Production Research, 46 (2),
pp. 301-319., DOI 10.1080/00207540601138395, PII 777072176, Selected papers from
the 2nd Group Technology/Cellular Manufacturing World Symposium;
Adenso-Díaz, B., Lozano, S., Andrés, C., García, J.M., Disassembly cells design
(2006) Proceedings of the Group Technology/Cellular Manufacturing Conference, pp.
443-450., University of Gröningen, The Netherlands;
Andres, C., Lozano, S., Adenso-Diaz, B., Disassembly sequence planning in a
disassembly cell context (2007) Robotics and Computer-Integrated Manufacturing, 23
(6), pp. 690-695., DOI 10.1016/j.rcim.2007.02.012, PII S0736584507000270;
113;
cellular manufacturing systems (1997) IIE Transactions (Institute of Industrial
Engineers), 29 (7), pp. 599-610;
problems with fixed cell cost (2004) Computer & Operations Research, 31 (1), pp.
21-31;
10.1080/00207540412331327754;
S0925527306000995;
Technology, 22 (1-2), pp. 125-133;
Gonzalez, B., Adenso-Diaz, B., A scatter search approach to the optimum disassembly
sequence problem (2006) Computers and Operations Research, 33 (6), pp. 1776-1793.,
DOI 10.1016/j.cor.2004.11.018, PII S030505480400320X;
Hansen, P., Mladenović, N., Moreno-Perez, J.A., Variable neighborhood search:
Methods and applications (2010) Annals of Operations Research, 175 (1), pp. 367-
407;
Ilgin, M.A., Gupta, S.M., Comparison of economic benefits of sensor embedded
products and conventional products in a multi-roduct disassembly line (2010)
Kopacek, B., Kopacek, P., Intelligent disassembly of electronic equipment (1999)
Annual Reviews in Control, 23, pp. 165-170;
Mar-Ortiz, J., Lozano, S., Adenso-Díaz, B., González, B., González-Velarde, J.L.,
Heuristic procedure for the disassembly cells formation problem (2009) Proceedings
of the 5th International Conference on Intelligent Manufacturing and Logistics
Systems, , Kitakyushu, Japan;
Mladenović, N., Hansen, P., Variable neighborhood search (1997) Computers &
Uncertain Production Requirements with Presence of Routing Flexibility, ,
Unpublished doctoral dissertation, Virginia Polytechnic Institute and State
University;
1340-1347;
Ramabhatta, V., Nagi, R., An integrated formulation of manufacturing cell formation
with capacity planning and multiple routings (1998) Annals of Operations Research,
77, pp. 79-95;
Schaller, J., Designing and redesigning cellular manufacturing systems to handle
demand changes (2007) Computers and Industrial Engineering, 53 (3), pp. 478-490.,
DOI 10.1016/j.cie.2007.05.006, PII S0360835207000848;
Selim, H.M., Manufacturing cell formation problem: A graph partitioning approach
(2002) Industrial Management and Data Systems, 102 (5-6), pp. 341-352;
European Journal of Operational Research, 69 (3), pp. 281-511;
0862-2;
S0096300305000238;
Teunter, R.H., Determining optimal disassembly and recovery strategies (2006)
Omega, 34 (6), pp. 533-537., DOI 10.1016/j.omega.2005.01.014, PII
S0305048305000216, Reverse Production Systems;
Wemmerlöv, U., Hyer, N., Cellular manufacturing in the US industry: A survey of
CORRESPONDENCE ADDRESS: Mar-Ortiz, J.; Department of Logistics and Manufacturing
Systems, Faculty of Engineering, Universidad Autónoma de Tamaulipas, 89140 Tampico
Tamaulipas, Mexico; email: [email protected]
ISSN: 17515254
ABBREVIATED SOURCE TITLE: Eur. J. Ind. Eng.
SOURCE: Scopus
Solimanpur, M., Foroughi, A.

35615315700;49561125400;
A new approach to the cell formation problem with alternative processing routes and
operation sequence
27 times.
80051747314&doi=10.1080%2f00207543.2010.528060&partnerID=40&md5=fe99af8b9644d0377bb
7329ce98b6410
DOI: 10.1080/00207543.2010.528060
AFFILIATIONS: Faculty of Engineering, Urmia University, Urmia, Iran;
Department of Industrial Engineering, Azad University, Arak, Iran
ABSTRACT: Cellular manufacturing (CM) is an important application of group
technology in manufacturing systems. One of the crucial steps in the design of CM
is the identification of part families and manufacturing cells. This problem is
referred to as cell formation problem (CFP) in the literature. In this article, a
solution approach is proposed for CFP, which considers many parameters such as
machine requirement, sequence of operations, alternative processing routes,
processing time, production volume, budget limitation, cost of machines, etc. Due
to the NP-hardness of CFP, it cannot be efficiently solved for medium- to large-
sized problems. Thus, a genetic algorithm (GA) is proposed to solve the formulated
model. Comparison of the results obtained from the proposed GA to the globally
optimum solutions obtained by Lingo Software and those reported in the literature
reveals the effectiveness and efficiency of the proposed approach. © 2011 Taylor &
Francis.
AUTHOR KEYWORDS: alternative routes; cell formation problem; cellular
manufacturing; mathematical programming
INDEX KEYWORDS: Alternative processing routes; Alternative routes; cell formation
problem; Machine requirements; NP-hardness; Operation sequences; Optimum solution;
Part family; Processing Time; Production volumes; Solution approach, Flexible
manufacturing systems; Genetic algorithms; Group technology; Mathematical
programming, Cellular manufacturing
REFERENCES: Arkat, J., Saidi, M., Abbasi, B., Applying simulated annealing to
cellular manufacturing system design (2006) International Journal of Advanced
Askin, R., Standridge, C., (1993) Modeling and Analysis of Manufacturing Systems, ,
New York: John Wiley & Sons;
Atashpaz, G.E., Colonial competitive algorithm: A novel approach for PID controller
design in MIMO distillation column process (2008) International Journal of
Intelligent Computing and Cybernetics (IJICC), 1 (3), pp. 337-355;
Ballakur Arvind, Steudel Harold, J., A within-cell utilization based heuristic for
Research, 25 (5), pp. 639-665;
Burbidge, J.L., Dale, B.G., Planning the introduction and predicting the benefits
of group technology (1984) Engineering costs and production economics, 8 (1-2), pp.
117-128., DOI 10.1016/0167-188X(84)90019-3;
International Journal of Production Economics, 64 (1), pp. 279-284., DOI
10.1016/S0925-5273(99)00065-1;
Chu, C., Recent advances in mathematical programming for cell formation (1995)
Planning, Design, and Analysis of Cellular Manufacturing Systems, pp. 1-46., In:
A.K. Kamrani, H.R. Parsaei, and D.H. Liles, eds. Amsterdam, The Netherlands:
Elsevier;
Felix, T.S., Two stage approach for machine-part grouping and cell layout problems
(2006) Robotics and Computer Integrated Manufacturing, 22 (3), pp. 217-238;
Fry Timothy, D., Wilson Martin, G., Breen Michael, A successful implementation of
group technology and cell manufacturing (1987) Production and inventory management
Washington, D.C., 28 (3), pp. 4-6;
Learning, , Boston, MA: Addison-Wesley;
Holland, J.H., (1975) Adaption in Natural and Artificial Systems, , Ann Arbor, MI:
The University of Michigan Press;
Howard, M., Newman, R., From job shop to just-in-time-a successful conversion
Kamel, M., Ghenniwa, H., Liu, T., Machine-part assignment and part-families
formation using group technology (1994) Journal of Intelligent Manufacturing
Systems, 5 (4), pp. 225-234;
Kamel, M., Liu, T., Machine-part assignment for group technology (1992) Proceedings
of the international conference on robotics and manufacturing (ISRAM92), 10-12
November, Santa Fe, NM, pp. 811-817;
10 (2), pp. 93-107;
Research, 18 (2), pp. 213-232;
Kizil, M., Özbayrak, M., A trade-off analysis between process plan selection and
cell formation in cellular manufacturing (2004) International Journal of Advanced
Kusiak, A., Cheng, C., A branch-and-bound algorithm for solving the group
technology problem (1990) Annals of Operational Research, 26 (1-4), pp. 415-431;
Levasseur, G., Helms, M., Zink, A., A conversion from a functional to a cellular
manufacturing layout at Steward, Inc (1995) Production and Inventory Management
Journal, 36 (3), pp. 37-42;
Levenshtein, V.I., Binary codes capable of correcting deletions, insertions, and
reversals (1966) Soviet Physics Doklady, 10 (8), pp. 707-710;
machines (2002) International Journal of Production Research, 40 (14), pp. 3291-
3310;
Michalewicz, Z., (1992) Genetic Algorithms+data Structures=evolution Programs, ,
New York: Springer;
Rajamani Divakar, Singh, N., Aneja, Y.P., Integrated design of cellular
manufacturing systems in the presence of alternative process plans (1990)
Reeves, C.R., Genetic algorithms for the operations researcher (1997) INFORMS
Journal on Computing, 9 (3), pp. 231-250;
Reeves, C., Genetic algorithms (2003) Handbook of Metaheuristics, pp. 55-82., F.
Glover and G.A. Kochenberger, eds. Dordrecht: Kluwer Academic;
routing in group technology (1990) Engineering Optimization, 16 (3), pp. 235-245;
Sarker, B.R., Xu, Y.I., Designing multi-product lines: Job routing in cellular
manufacturing systems (2000) IIE Transactions (Institute of Industrial Engineers),
32 (3), pp. 219-235., DOI 10.1023/A:1007642413799;
Singh, N., Design of cellular manufacturing systems: an invited review (1993)
Singh, N., Rajamani, D., (1996) Cellular Manufacturing Systems: Design, Planning
and Control, , New York: Chapman and Hall;
Tam, K.Y., An operation sequence based similarity coefficient for part families
formation (1990) Journal of Manufacturing Systems, 9 (1), pp. 55-68;
Wemmerlöv, U., Hyer, N., Cellular manufacturing in the US industry: A survey of
Engineering, 32 (1), pp. 207-220;
Yin, Y., Yasuda, K., Hu, L., Formation of manufacturing cells based on material
flows (2005) International Journal of Advanced Manufacturing Technology, 27 (1-2),
pp. 159-165., DOI 10.1007/s00170-004-2143-2;
Research, 38 (2), pp. 385-395., DOI 10.1080/002075400189473
CORRESPONDENCE ADDRESS: Solimanpur, M.; Faculty of Engineering, Urmia University,
Urmia, Iran; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Salehi, M., Tavakkoli-Moghaddam, R.

26634273500;56491438400;
A genetic algorithm-based grouping method for a cell formation problem with the
efficacy measure
(2010) International Journal of Industrial and Systems Engineering, 6 (3), pp. 340-
359. Cited 8 times.
77956379951&doi=10.1504%2fIJISE.2010.035016&partnerID=40&md5=262ac3e35d33ae6659432a
27ae34d60b
DOI: 10.1504/IJISE.2010.035016
AFFILIATIONS: Department of Industrial Engineering, University of Bojnourd,
Bojnourd, Khorasane Shomali, Iran;
Department of Industrial Engineering, College of Engineering, University of Tehran,
Enghelab, Amir Abad, Tehran, Iran
ABSTRACT: Over the past 25 years, the machine-part cell formation problem (CFP) has
been the subject of numerous studies. The CFP consists of constructing a set of
machine cells and their corresponding product families with the objective of
minimising the inter-cell movement of parts while maximising the machine
utilisation. This article presents a grouping genetic algorithm for the CFP that
uses the grouping efficacy measure. We solve the CFP without pre-determining the
number of cells. We also make some effort to improve the efficiency of our
algorithm with respect to initialisation of the population, keeping a crossover
operator from cloning. The computational results using the grouping efficacy
measure for a set of CFPs from the literature are presented. The proposed algorithm
performs well on all the test problems, exceeding or matching the solution quality
of the results presented in the previous literature for most problems. © 2010
Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing systems; Genetic
algorithm; Grouping efficacy; Grouping efficiency; Grouping technology; Inter-
cellular movement; Machine utilisation
INDEX KEYWORDS: Cell formation problem; Cellular manufacturing systems; Grouping
efficacy; Grouping efficiency; Grouping technology; Inter-cellular movement;
Machine utilisation, Cloning; Genetic algorithms; Mathematical operators, Cellular
manufacturing
REFERENCES: Albadawia, Z., Bashirb, H.A., Chenc, M., A mathematical approach for
the formation of manufacturing cells (2005) Computers and Industrial Engineering,
48 (1), pp. 3-21;
planning Horizons (2005) Journal of Manufacturing Technology Management, 16, pp.
516-530;
Billo, R.E., Bidanda, B., Tate, D., A genetic cluster algorithm for the
machinecomponent grouping problem (1996) Journal of Intelligent Manufacturing, 7,
pp. 229-241;
manufacturing cell formation problem (2006) Computers and Operations Research, 33
(8), pp. 2219-2245;
Burbidge, J.L., Production flow analysis (1963) The Production Engineer, 42, pp.
742-752;
Chandrasekharan, M.P., Rajagopalan, R., GROUPABILITY: Analysis of the properties of
binary data matrices for group technology (1989) Int. J. Production Research, 27
(6), pp. 1035-1052;
formation of part families and machine cells (1987) Int. J. Production Research, 26
(5), pp. 835-850;
algorithm for cellular manufacturing (1986) Int. J. Production Research, 24 (2),
pp. 451-464;
clustering for group technology (1986) Int. J. Production Research, 24 (5), pp.
1221-1233;
machine groups and part families (1998) Int. J. Production Research, 36, pp. 1325-
1337;
De Lit, P., Falkenauer, E., Delchambre, A., Grouping genetic algorithms: An
cellular manufacturing system (2006) Int. J. Production Economics, 103, pp. 767-
783;
Eduardo Vila, G.F., Alexandre, J.T., A group genetic algorithm for the machine cell
formation problem (2006) Int. J. Production Economics, 102, pp. 1-21;
Falkenauer, E., (1998) Genetic Algorithms and Grouping, , New York, NY: Wiley;
Goldberg, D., (1989) Genetic Algorithms in Search, Optimization, and Machine
Learning, , Reading. Philadelphia, PA: Addison-Wesley;
Holland, J.H., (1975) Adaptation in Natural and Artificial Systems, , Ann Arbor,
alternative processing routes by grouping genetic algorithm (2006) Int. J.
designing machine cells under demand changes (2006) Computers and Operations
Research, 33, pp. 263-283;
using rank order clustering algorithm (1980) Int. J. Production Research, 18, pp.
213-232;
Review and extensions (1982) Int. J. Production Research, 20, pp. 117-133;
J. Production Research, 28 (2), pp. 233-243;
Kusiak, A., The generalized group technology concept (1986) Int. J. Production
Research, 25, pp. 561-569;
Mukattash, A.M., Abbasi, G.Y., Tahboub, K.K., Adil, M.B., A modified revised p-
median approach to cell formation (2007) Int. J. of Industrial and Systems
Offodile, F.O., Mehrez, A., Grznar, J., Cellular manufacturing: A taxonomic review
Rao, H.A., Pham, S.N., Gu, P., A genetic algorithm-based approach for design of
manufacturing systems: An industrial application (1999) Int. J. Production
Research, 37, pp. 557-580;
Sarker, B., Measures of grouping efficiency in cellular manufacturing systems
(2001) European Journal of Operational Research, 130, pp. 588-611;
Sarker, B., Mondal, S.N., Grouping efficiency measures in cellular manufacturing: A
survey and critical review (1999) Int. J. Production Research, 37, pp. 285-314;
of cellular manufacturing systems (1996) Int. J. Production Research, 34, pp. 3401-
3416;
Sridhar, J., Rajendran, C., Scheduling in a cellular manufacturing system: A
simulated annealing approach (1993) Int. J. Production Research, 31, pp. 2927-2945;
Srinivasan, G., Narendran, T.T., GRAFICS - A nonhierarchical clustering algorithm

for group technology (1991) Int. J. Production Research, 29 (3), pp. 463-478;
Shunk, D.L., Group technology provides organized approach to realizing benefits of
CIMS (1985) Journal of Industrial Engineering, 17, pp. 74-81;
Süer, G.A., Vazquez, R., Cortes, M., A hybrid approach of genetic algorithms and
local optimizers in cell loading (2005) Computers and Industrial Engineering, 48
(3), pp. 625-641;
Süer, G.A., Dagli, C., Intra-cell manpower transfers and cell loading in
laborintensive manufacturing cells (2005) Computers and Industrial Engineering, 48
(3), pp. 643-655;
Tabitha, L.J., Brown, E.C., Kellie, B.K., A hybrid grouping genetic algorithm for
2079;
376;
Tavakkoli-Moghaddam, R., Minaeian, S., Rabbani, S., A new multi-objective model for
dynamic cell formation problem with fuzzy parameters (2008) Int. J. Engineering:
Transactions A - Basic, 21 (2), pp. 1-14;
Venugopal, V., Narendran, T.T., A genetic algorithm approach to the
machinecomponent grouping problem with multiple objectives (1992) Computers and
Vin, E., De Lit, P., Delchambre, A., A multiple-objective grouping genetic
algorithm for the cell formation problem with alternative routings (2005) Journal
of Intelligent Manufacturing, 16 (2), pp. 189-205;
cell formation problem (2005) Int. J. Production Research, 43 (4), pp. 829-853;
problem: A taxonomy and review (2006) Int. J. Production Economics, 101 (2), pp.
329-352
CORRESPONDENCE ADDRESS: Salehi, M.; Department of Industrial Engineering,
University of Bojnourd, Bojnourd, Khorasane Shomali, Iran; email:
[email protected]
ISSN: 17485037
ABBREVIATED SOURCE TITLE: Int. J. Ind. Syst. Eng.
SOURCE: Scopus
Jabal Ameli, M.S., Arkat, J., Barzinpour, F.

21834329200;55912953100;22957278500;
Modelling the effects of machine breakdowns in the generalized cell formation
problem
56749182771&doi=10.1007%2fs00170-007-1269-
4&partnerID=40&md5=d4b61946e3b55ebebf23ef68d30d8c46
DOI: 10.1007/s00170-007-1269-4
AFFILIATIONS: Industrial Engineering, Iran University of Science and Technology,
Narmak, Farjam, Tehran 16846-13114, Iran;
Industrial Engineering, University of Kurdistan, Sanandaj, Kurdistan, Iran
ABSTRACT: Machines are key elements in manufacturing systems and their breakdowns
can dramatically affect system performance measures. This paper proposes a new
multi-objective pure integer linear programming approach for the cell formation
problem with alternative process routings and machine reliability consideration.
The model minimizes total cost and maximizes system reliability simultaneously.
Traditional reliability evaluation approaches attempt to model the reliability of
the manufacturing system as a function of its elements. These approaches have some
negative aspects; therefore, instead of modeling the system reliability as an
explicit objective function, we use an approach to model the effects of the machine
unreliability in terms of cost and time-based effects. Using the É-constraint
method as an optimization tool for multi-objective programming, a numerical example
is solved to demonstrate the capability of the proposed model in evaluating various
effects of the reliability consideration. © 2007 Springer-Verlag London Limited.
AUTHOR KEYWORDS: Alternative process routings; Cell formation; É-constraint
method; Multi-objective programming; Production sequence; Reliability
INDEX KEYWORDS: Cellular manufacturing; Computer software selection and evaluation;
Constrained optimization; Fischer-Tropsch synthesis; Integer programming; Linear
programming; Linearization; Multiobjective optimization; Probability density
function, Alternative process routings; Cell formation; Cell formation problems;
Constraint methods; Generalized cells; Integer Linear programmings; Key elements;
Machine breakdowns; Machine reliabilities; Manufacturing systems; Multi-objective
programming; Numerical examples; Objective functions; Objective programmings;
Optimization tools; Production sequence; Reliability evaluations; System
performance measures; System reliabilities; Total costs, Reliability
REFERENCES: Kazerooni, M., Luong, H.S., Abhary, K., A genetic algorithm based cell
design considering alternative routing (1997) Comput Integr Manuf Syst, 10, pp. 93-
107., 2;
manufacturing system design (2006) Int J Adv Manuf Technol, 32, p. 531., 6;
multiple routes and multiple objectives (2000) Int J Prod Res, 38, pp. 385-395., 2;
Int J Prod Res, 42, pp. 3911-3927., 18;
presence of alternative routing (1999) Int J Prod Res, 37, pp. 3289-3304., 14;
(1996) Int J Prod Res, 34, pp. 1361-1380., 5;
plans and machine capacity constraints: A new combined approach (2000) Int J Prod
Econ, 64, pp. 279-284;
alternative routings (1993) Int J Prod Res, 31, pp. 1259-1273., 6;
flows (2005) Int J Adv Manuf Technol, 27, pp. 159-165;
generalized group technology (2001) Comput Ind Eng, 41, pp. 227-240;
replicate machines (1999) Int J Prod Res, 37, pp. 707-720., 3;
Sarker, B.R., Li, Z., Measuring matrix-based cell formation with alternative
routings (1998) J Oper Res Soc, 49, pp. 953-965., 9;
considerations in group technology application (1990) Int J Prod Res, 28, pp. 2243-
2257., 12;
(2000) Int J Prod Res, 38, pp. 229-240., 1;
alternative part process plans (1996) Comput Ind Eng, 30, pp. 423-431., 3;
Seifoddini, H., Djassemi, M., The effect of reliability on the application of
quality index (2001) Comput Ind Eng, 40, pp. 65-77., 1-2;
Chan, F.T.S., Lau, K.W., Chan, P.L.Y., Choy, K.L., Two-stage approach for machine-
part grouping and cell layout problems (2006) Robot CIM-Int Manuf, 22, p. 217;
Jeon, G., Leep, H.R., Parsaei, H.A., A cellular manufacturing system based on new
similarity coefficient which considers alternative routes during machine failure
(1998) Comput Ind Eng, 34, pp. 21-36., 1;
problem with alternative process plans (2004) Int J Adv Manuf Technol, 24, pp. 834-
840;
Vin, E., Delit, P., Delchamber, A., A multiple-objective grouping genetic algorithm
pp. 189-205;
plans (2005) J Intell Manuf, 16, pp. 53-65;
Sundaram, M., Doshi, K., Formation of part families to design cells with
alternative routing consideration (1993) Comput Ind Eng, 23, pp. 59-62., 1;
data, machine replications and alternative process routings (2004) Int J Prod Res,
42, pp. 2419-2433., 12;
scale capacitated cell formation problems with multiple routings (2006) Eur J Oper
Res, 171, p. 1051;
Mahesh, O., Srinivasan, Incremental cell formation considering alternative machines
(2002) Int J Prod Res, 40, pp. 3291-3310., 14;
Logendran, R., Sirikrai, V., Machine duplication and part subcontracting in the
presence of alternative cell locations in manufacturing cell design (2000) J Oper
Res Soc, 51, pp. 609-624;
(2001) Eur J Oper Res, 130, pp. 588-611;
simulated annealing (1998) Int J Prod Res, 36, pp. 2185-2207., 8;
Jeon, G., Breering, M., Leep, H.R., Parsaei, H.R., Wong, J.P., Part family
formation based on alternative routes during machine failure (1998) Comput Ind Eng,
35, pp. 73-76., 1;
Sarker, B., Li, K., Simultaneous route selection and cell formation: A mixed-
integer programming time-cost model (1997) Integr Manuf Syst, 8, pp. 374-377., 6;
Ho, Y.C., Moodie, C.L., Solving cell formation problems in a manufacturing
environment with flexible processing and routing capabilities (1996) Int J Prod
Res, 34, pp. 2901-2923., 10;
(1994) Int J Prod Res, 32, pp. 273-297., 2;
Manufacturing cell creation with machine modification costs (2006) Comput Oper Res,
33, p. 1010., 4;
block diagonal forms (1998) Int J Prod Res, 36, pp. 3217-3222., 11;
561-569;
routing capability in presence of unreliable machines (2001) Int J Prod Econ, 74,
pp. 175-182., 1-3;
Gupta, S.M., Kavusturucu, A., Modeling of finite buffer cellular manufacturing
systems with unreliable machines (1998) Int J Ind Eng, 5, pp. 265-277., 4;
system in the presence of machine breakdown (1997) Int J Prod Econ, 53, pp. 239-
256., 3;
Zakarian, A., Kusiak, A., Modeling manufacturing dependability (1997) IEEE Trans
Robot Autom, 13, pp. 161-168., 2;
analysis of cellular manufacturing systems (2007) Int J Prod Econ, 105, pp. 243-
262;
machine reliability consideration Int J Adv Manuf Technol, , (in press). DOI
10.1007/s00170-006-0753-6;
Savsar, M., Reliability analysis of a flexible manufacturing cell (2000) Reliab Eng
Syst Saf, 67, pp. 147-152;
Aldaihani, M.M., Savsar, M., A stochastic model for the analysis of a two-machine
flexible manufacturing cell (2005) Comput Ind Eng, 49, pp. 600-610;
Ebeling, C.E., (1997) An Introduction to Reliability and Maintainability
Engineering, , McGraw-Hill New York;
New York;
Cohon, J.L., (1978) Multiobjective Programming and Planning, , Academic New York;
Ehrgott, M., (2005) Multicriteria Optimization, , 2 Springer Berlin Heidelberg New
York;
integrated system identification and system optimization (1971) IEEE Trans Syst Man
Cybern, 1, pp. 296-297;
Methodology, , Elsevier Science New York
CORRESPONDENCE ADDRESS: Arkat, J.; Industrial Engineering, University of Kurdistan,
Sanandaj, Kurdistan, Iran; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Nasiri, M.M., Naseri, F.

56397851900;54790058100;
Metaheuristic algorithms for the generalised cell formation problem considering
machine reliability
(2019) International Journal of Process Management and Benchmarking, 9 (4), pp.
469-484.
85074774556&doi=10.1504%2fIJPMB.2019.103426&partnerID=40&md5=6a4a8d55b724d732be5872
bba243de06
DOI: 10.1504/IJPMB.2019.103426
of Tehran, Tehran, Iran;
Department of Industrial Engineering, Alzahra University, Tehran, Iran
ABSTRACT: In this paper, we use two metaheuristic algorithms, i.e., artificial bee
colony (ABC) and covariance matrix adaptation revolution strategies (CMA-ES), for
solving the generalised cell formation problem considering machine reliability. The
purpose is to choose the best process routing for each part and to allocate the
machines to the manufacturing cells in order to minimise the total cost, which is
composed of intracellular movement cost, intercellular movement cost and machines
breakdown cost. To evaluate the metaheuristic algorithms, eight numerical examples
in three different sizes are solved. The results of the two algorithms are compared
with each other and with the results of solving the MIP model. Both the MIP solver
and metaheuristics find the optimal solutions for the small size problem instances
while by increasing the problem size, metaheuristics show higher performance. The
results illustrate that the CMA-ES algorithm outperforms the ABC algorithm in both
solution quality and CPU time. Copyright © 2019 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: ABC; Artificial bee colony; CMA-ES; Covariance matrix
adaptation revolution strategies; Generalised cell formation problem; Group
technology; Reliability
REFERENCES: Alhourani, F., Cellular manufacturing system design considering
machines reliability and parts alternative process routings (2016) International
Arkat, J., Naseri, F., Ahmadizar, F., A stochastic model for the generalised cell
formation problem considering machine reliability (2011) International Journal of
Computer Integrated Manufacturing, 24 (12), pp. 1095-1102;
designing cellular manufacturing systems (1987) International Journal of
Productions Research, 25 (5), pp. 639-655;
Basirat, P., Fazlollahtabar, F., Mahdavi, I., System dynamics meta-modelling for
reliability considerations in maintenance (2013) International Journal of Process
Management and Benchmarking, 3 (2), pp. 136-153;
Charnes, A., Cooper, W.W., Chance-constrained programming (1959) Management
Science, 6 (1), pp. 73-79;
Chung, S.-H., Wub, T.-H., Chang, C.-C., An efficient tabu search algorithm to the
considerations (2011) Computers and Industrial Engineering, 60 (1), pp. 7-15;
Dion, M., Blomeley, L., Radford, D.D., Radiation source reconstruction based on a
covariance matrix adaptation evolution strategy and the adjoint flux and forward
source inner product evaluation method (2016) Annals of Nuclear Energy, 99, pp.
292-300;
Esmailnezhad, B., Fattahi, P., Kheirkhah, A.S., A stochastic model for the cell
formation problem considering machine reliability (2015) Journal of Industrial
Engineering International, 11 (3), pp. 375-389;
Ganguly, A., Patel, S.K., Joint economic design of X-bar and R charts using
simulated annealing (2014) International Journal of Process Management and
Benchmarking, 4 (3), pp. 305-323;
Hansen, N., (2016) The CMA Evolution Strategy: A Tutorial, ,
https://arxiv.org/abs/1604.00772, Technical Report, 1604.00772 online accessed 12
October 2016;
Jabal-Ameli, M.S., Arkat, J., Cell formation with alternative process routings and
Jabal-Ameli, M.S., Arkat, J., Cell formation with alternative process routings and
Jabal-Ameli, M.S., Arkat, J., Barzinpour, F., Modelling the effects of machine
Jharotia, P., Sharma, D.C., Mathematical analysis of machining system with warm
spares and vareiable service rate (2017) International Journal of Process
Management and Benchmarking, 7 (2), pp. 141-157;
Jouzdani, J., Barzinpour, F., Shafia, M.A., Fathian, M., Applying simulated
annealing to a generalized cell formation problem considering alternative routings
and machine reliability (2014) Asia- Pacific Journal of Operational Research, 3
(4), pp. 1-26;
Karaboga, D., (2005) An Idea Based on Honey Bee Swarm for Numerical Optimization, ,
Erciyes University, Kayseri\Türkiye, Technical report-TR06;
Karoum, B., Bouazza Elbenani, Y., A clonal selection algorithm for the generalized
cell formation problem considering machine reliability and alternative routings
(2017) Production Management, 11 (4-5), pp. 545-556;
Mohammadi, M., Forghani, K., Designing cellular manufacturing systems considering
S-shaped layout (2016) Computers and Industrial Engineering, 98, pp. 221-236;
Nasiri, M.M., A pseudo particle swarm optimization for the RCPSP (2013) The
Nasiri, M.M., A modified ABC algorithm for the stage shop scheduling problem (2015)
Applied Soft Computing, 28, pp. 81-89;
Nurmi, N., Kyngäs, J., Kyngäs, N., The PEAST algorithm – the key to optimising
workforce management and professional sports league schedules (2014) International
Journal of Process Management and Benchmarking, 4 (4), pp. 406-423;
Rabbani, M., Elahi, S., Rafiei, H., Farshbaf-Geranmayeh, A., A genetic algorithm
approach for a dynamic cell formation problem considering machine breakdown and
buffer storage (2015) Journal of Quality Engineering and Production Optimization, 1
(2), pp. 1-18;
Review, evaluation and directions for future research (1998) Computer and
Yadollahi, M.S., Mahdavi, I., Paydar, M.M., Jouzdani, J., Designing a bi-objective
mathematical model for cellular manufacturing systems considering variable failure
rate of machines (2014) International Journal of Production Research, 52 (24), pp.
7401-7415;
pp. 159-165;
Zhi-Gang, W., Modified artificial bee colony algorithm for numerical function
optimization (2017) Journal of Scientific and Engineering Research, 4 (3), pp. 37-
43
CORRESPONDENCE ADDRESS: Nasiri, M.M.; School of Industrial Engineering, College of
ISSN: 14606739
ABBREVIATED SOURCE TITLE: Int. J. Process Manage. Benchmarking
SOURCE: Scopus
Batsyn, M.V., Batsyna, E.K., Bychkov, I.S.

37111907600;44461079500;55842563400;
NP-completeness of cell formation problem with grouping efficacy objective
(2019) International Journal of Production Research, .
85073943137&doi=10.1080%2f00207543.2019.1668072&partnerID=40&md5=3992568c7f4c167d44
adb24a601cf66e
DOI: 10.1080/00207543.2019.1668072
National Research University Higher School of Economics, Nizhny Novgorod, Russian
Federation;
Department of Applied Mathematics and Informatics, National Research University
Higher School of Economics, Nizhny Novgorod, Russian Federation
ABSTRACT: In the current paper we provide a proof of NP-completeness for the Cell
Formation Problem (CFP) with the fractional grouping efficacy objective function.
First the CFP with a linear objective function is considered. Following the ideas
of Pinheiro et al. (2016) we show that it is equivalent to the Bicluster Graph
Editing Problem (BGEP), which is known to be NP-complete due to the reduction from
the 3-Exact 3-Cover Problem–3E3CP (Amit, 2004). Then we suggest a polynomial
reduction of the CFP with the linear objective to the CFP with the grouping
efficacy objective. It proves the NP-completeness of this fractional CFP
formulation. Along with the NP-status our paper presents important connections of
the CFP with the BGEP and 3E3CP. Such connections could be used for ”transferring”
of known theoretical properties, efficient algorithms, polynomial cases, and other
features of well-studied graph editing and exact covering problems to the CFP. ©
2019, © 2019 Informa UK Limited, trading as Taylor & Francis Group.
AUTHOR KEYWORDS: bicluster graph editing problem; cell formation problem;
grouping efficacy; np-complete
INDEX KEYWORDS: Mathematical models; Production engineering, Bi clusters; Cell
formation problem; Covering problems; Grouping efficacy; Linear objective
functions; NP Complete; Objective functions; Polynomial reduction, Cellular
manufacturing
REFERENCES: Ailon, N., Avigdor-Elgrabli, N., Liberty, E., van Zuylen, A., (2011)
Algorithms–ESA 2011. 19th Annual European Symposium, , Improved Approximation
Algorithms for Bipartite Correlation Clustering. edited by Camil Demetrescu, and
Magnús M. Halldórsson, Lecture Notes Computer Science 6942, 25–36. Cham: Springer
International;
Alhourani, F., Cellular Manufacturing System Design Considering Machines
Reliability and Parts Alternative Process Routings (2016) International Journal of
Amit, N., (2004), The Bicluster Graph Editing Problem. MS diss., Tel Aviv
University; Arkat, J., Abdollahzadeh, H., Ghahve, H., A New Branch-and-bound
Algorithm for Cell Formation Problem (2012) Applied Mathematical Modelling, 36, pp.
5091-5100;
Ballakur, A., (1985), An Investigation of Part Family/Machine Group Formation for
Designing Cellular Manufacturing Systems. PhD diss., University of Wisconsin-
Madison; Ballakur, A., Steudel, H.J., A Within Cell Utilization Based Heuristic for
Designing Cellular Manufacturing Systems (1987) International Journal of Production
Research, 25, pp. 639-665;
Battaïa, O., Dolgui, A., Guschinsky, N., Decision Support for Design of
Reconfigurable Rotary Machining Systems for Family Part Production (2017)
Battaïa, O., Dolgui, A., Heragu, S.S., Meerkov, S.M., Tiwari, M.K., Design for
Manufacturing and Assembly/disassembly: Joint Design of Products and Production
Systems (2018) International Journal of Production Research, 56 (24), pp. 7181-
7189;
Bonnet, E., Paschos, V., Sikora, F., Parameterized Exact and Approximation
Algorithms for Maximum K -set Cover and Related Satisfiability Problems (2016)
RAIRO–Theoretical Informatics and Applications, 50 (3), pp. 227-240;
Brusco, M.J., An Exact Algorithm for Maximizing Grouping Efficacy in Part-machine
Clustering (2015) IIE Transactions, 47 (6), pp. 653-671;
Burbidge, J.L., (1975) The Introduction of Group Technology, , New York: John Wiley
& Sons;
Busygin, S., Prokopyev, O., Pardalos, P.M., Biclustering in Data Mining (2008)
Bychkov, I., Batsyn, M., An Efficient Exact Model for the Cell Formation Problem
with a Variable Number of Production Cells (2018) Computers & Operations Research,
91, pp. 112-120;
Bychkov, I., Batsyn, M., Pardalos, P.M., Exact Model for the Cell Formation Problem
(2014) Optimization Letters, 8 (8), pp. 2203-2210;
Chan, F.T.S., Lau, K.W., Chan, L.Y., Lo, V.H.Y., Cell Formation Problem with
Consideration of Both Intracellular and Intercellular Movements (2008)
Chung, S.-H., Wu, T.-H., Chang, C.-C., An Efficient Tabu Search Algorithm to the
Cell Formation Problem with Alternative Routings and Machine Reliability
Considerations (2011) Computers & Industrial Engineering, 60 (1), pp. 7-15;
De Sousa Filho, G.F., Júnior, T.L.B., Cabral, L.A.F., Satoru Ochi, L., Protti, F.,
New Heuristics for the Bicluster Editing Problem (2017) Annals of Operations
Research, 258 (2), pp. 781-814;
Dimopoulos, C., Zalzala, A., Recent Developments in Evolutionary Computation for
Manufacturing Optimization: Problems, Solutions and Comparisons (2000) IEEE
Dolgui, A., Proth, J.-M., (2010) Supply Chain Engineering: Useful Methods and
Techniques, , London: Springer-Verlag;
Drange, P.G., Reidl, F., Sánchez Villaamil, F., Sikdar, S., (2015) 10th
International Symposium on Parameterized and Exact Computation (IPEC 2015), , Fast
Biclustering by Dual Parameterization. edited by Thore Husfeldt and Iyad Kanj,
Leibniz International Proceedings Informatics, 402–413. Saarbrücken: Dagstuhl;
Egilmez, G., Erenay, B., Suer, G.A., Stochastic Skill-based Manpower Allocation in
a Cellular Manufacturing System (2014) Journal of Manufacturing Systems, 33 (4),
pp. 578-588;
Eguia, I., Carlos Molina, J., Lozano, S., Racero, J., Cell Design and Multi-period
Machine Loading in Cellular Reconfigurable Manufacturing Systems with Alternative
Routing (2017) International Journal of Production Research, 55 (10), pp. 2775-
2790;
Elbenani, B., Ferland, J.A., An Exact Method for Solving the Manufacturing Cell
Formation Problem (2012) International Journal of Production Research, 50 (15), pp.
4038-4045;
Theory of NP-Completeness, , New York: Freeman;
Ghosh, S., Mahanti, A., Nagi, R., Nau, D.S., Manufacturing Cell Formation by State-
space Search (1996) Annals of Operations Research, 65 (1), pp. 35-54;
Golhar, D.Y., Stamm, C.L., The Just-in-time Philosophy: A Literature Review (1991)
Goncalves, J.F., Resende, M.G.C., An Evolutionary Algorithm for Manufacturing Cell
Formation (2004) Computers & Industrial Engineering, 47, pp. 247-273;
Gunasekaran, A., Goyal, S.K., Virtanen, I., Yli-Olli, P., An Investigation Into the
Application of Group Technology in Advanced Manufacturing Systems (1994)
International Journal of Computer Integrated Manufacturing, 7 (4), pp. 215-228;
Guo, J., Hüffner, F., Komusiewicz, C., Zhang, Y., (2008) Theory and Applications of
Models of Computation. 5th International Conference TAMC 2008, , Improved
Algorithms for Bicluster Editing. edited by Manindra Agrawal, Dingzhu Du, Zhenhua
Duan, and Angsheng Li, Lecture Notes Computer Science 4978, 445–456, Cham: Springer
International;
James, T.L., Brown, E.C., Keeling, K.B., A Hybrid Grouping Genetic Algorithm for
the Cell Formation Problem (2007) Computers & Operations Research, 34 (7), pp.
2059-2079;
Krushinsky, D., Goldengorin, B., An Exact Model for Cell Formation in Group
Technology (2012) Computational Management Science, 9 (3), pp. 323-338;
Kumar, K.R., Chandrasekharan, M.P., Grouping Efficacy: A Quantitative Criterion for
Goodness of Block Diagonal Forms of Binary Matrices in Group Technology (1990)
Kuo, Y., Chen, Y.-P., Wang, Y.-C., Operator Assignment with Cell Loading and
Product Sequencing in Labour-intensive Assembly Cells–A Case Study of a Bicycle
Assembly Company (2018) International Journal of Production Research, 56 (16), pp.
5495-5510;
Kusiak, A., Boe, J.W., Cheng, C., Designing Cellular Manufacturing Systems: Branch-
and-bound and A* Approaches (1993) IIE Transactions, 25 (4), pp. 46-56;
Liu, C., Wang, J., Leung, J.Y.T., Li, K., Solving Cell Formation and Task
Scheduling in Cellular Manufacturing System by Discrete Bacteria Foraging Algorithm
Mak, K.L., Wong, Y.S., Wang, X.X., An Adaptive Genetic Algorithm for Manufacturing
Cell Formation (2000) The International Journal of Advanced Manufacturing
Technology, 16 (7), pp. 491-497;
Mitrofanov, S.P., (1959) Nauchnye Osnovy Gruppovoy Tekhnologii [Scientific
Foundations of Group Technology, , Leningrad: Lenizdat;
Nishino, M., Yasuda, N., Minato, S.-I., Nagata, M., Efficient Algorithm for
Enumerating All Solutions to An Exact Cover Problem (2017) NTT Technical Review, 15
(11), pp. 1-5;
Norman, B.A., Tharmmaphornphilas, W., Lascola Needy, K., Bidanda, B., Colosimo
Warner, R., Worker Assignment in Cellular Manufacturing Considering Technical and
Human Skills (2002) International Journal of Production Research, 40 (6), pp. 1479-
1492;
Paydar, M.M., Saidi-Mehrabad, M., A Hybrid Genetic-variable Neighborhood Search
Algorithm for the Cell Formation Problem Based on Grouping Efficacy (2013)
Subramanian, A., On Solving Manufacturing Cell Formation Via Bicluster Editing
Protti, F., Dantas da Silva, M., Luiz Szwarcfiter, J., Applying Modular
Decomposition to Parameterized Cluster Editing Problems (2009) Theory of Computing
Systems, 44 (1), pp. 91-104;
Rezaei-Malek, M., Razmi, J., Tavakkoli-Moghaddam, R., Taheri-Moghaddam, A., Towards
a Psychologically Consistent Cellular Manufacturing System (2017) International
Solimanpur, M., Saeedi, S., Mahdavi, I., Solving Cell Formation Problem in Cellular
Manufacturing Using Ant-colony-based Optimization (2010) The International Journal
Spiliopoulos, K., Sofianopoulou, S., An Optimal Tree Search Method for the
Manufacturing Systems Cell Formation Problem (1998) European Journal of Operational
Research, 105, pp. 537-551;
Sun, P., Guo, J., Baumbach, J., (2014) Computing and Combinatorics. 20th
International Conference COCOON 2014, , Complexity of Dense Bicluster Editing
Problems. edited by Zhipeng Cai, Alex Zelikovsky, Anu Bourgeois, Lecture Notes
Computer Science 8591, 154–165. Cham: Springer International;
Sun, P., Speicher, N.K., Röttger, R., Guo, J., Baumbach, J., Bi-Force: Large-scale
Bicluster Editing and Its Application to Gene Expression Data Biclustering (2014)
Nucleic Acids Research, 42 (9), p. e78;
Tunnukij, T., Hicks, C., An Enhanced Grouping Genetic Algorithm for Solving the
pp. 1989-2007;
Utkina, I., Batsyn, M., Batsyna, E., (2016) Discrete Optimization and Operations
Research. 9th International Conference DOOR 2016, , A Branch and Bound Algorithm
for a Fractional 0-1 Programming Problem. edited by Y. Kochetov, M. Khachay, V.
Beresnev, E. Nurminski, and P. Pardalos, Lecture Notes Computer Science 9869, 244–
255, Cham: Springer International;
Utkina, I.E., Batsyn, M.V., Batsyna, E.K., A Branch-and-bound Algorithm for the
pp. 3262-3273;
Won, Y., Logendran, R., Effective Two-phase P-median Approach for the Balanced Cell
Formation in the Design of Cellular Manufacturing System (2015) International
Zeng, C., Tang, J., Fan, Z.-P., Auction-based Cooperation Mechanism for Cell Part
Scheduling with Transportation Capacity Constraint (2019) International Journal of
Žilinskas, J., Goldengorin, B., Pardalos, P.M., Pareto-optimal Front of Cell
Formation Problem in Group Technology (2015) Journal of Global Optimization, 61
(1), pp. 91-108
CORRESPONDENCE ADDRESS: Batsyn, M.V.; Laboratory of Algorithms and Technologies for
Network Analysis, National Research University Higher School of EconomicsRussian
Federation; email: [email protected]
PUBLISHER: Taylor and Francis Ltd.
ISSN: 00207543
CODEN: IJPRB
PUBLICATION STAGE: Article in Press
SOURCE: Scopus
Karoum, B., Elbenani, Y.B.

57188978487;36147113000;
Discrete cuckoo search algorithm for solving the cell formation problem
(2019) International Journal of Manufacturing Research, 14 (3), pp. 245-264. Cited
1 time.
85069772285&doi=10.1504%2fIJMR.2019.100991&partnerID=40&md5=5c6550c0f1b360b58bf4654
15ead3316
DOI: 10.1504/IJMR.2019.100991
AFFILIATIONS: Research Computer Science Laboratory (LRI), Faculty of Science,
Mohammed V University of Rabat, Rabat, Morocco;
Conception and Systems Laboratory (LCS), Faculty of Science, Mohammed V University
of Rabat, Rabat, Morocco
ABSTRACT: The manufacturing cell formation problem is considered one of the first
issues in the designing of cellular manufacturing systems, that attempts to
construct a set of machine cells and their corresponding product families. The aim
is to minimise the inter-cell movements of the products while maximising the
machine utilisation. Recently developed cuckoo search algorithm is introduced in
this paper to solve this kind of problems which is discrete in nature. The proposed
method is combined with a local search mechanism in order to intensify the search
and improve the quality of the solutions. In order to demonstrate the effectiveness
of the proposed algorithm, a set of 35 benchmark problems is used; the results are
then compared to different methods collected from the literature. The results
demonstrate that the proposed algorithm is a very effective and performs well on
all test problems since it can reach 32 out of 35 benchmark problems (91.43%).
Copyright © 2019 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing; CFP; Cuckoo
search algorithm; Grouping efficacy; Lévy flights
INDEX KEYWORDS: Benchmarking; Cells; Cytology; Learning algorithms; Optimization;
Product design, Bench-mark problems; Cell formation problem; Cell movement; Cuckoo
search algorithms; Grouping efficacy; Manufacturing cell formation; Product
families; Test problem, Cellular manufacturing
REFERENCES: Benbouzid-Sitayeb, F., Guebli, S.A., Bessadi, Y., Varnier, C.,
Zerhouni, N., Joint scheduling of jobs and preventive maintenance operations in the
flowshop sequencing problem: A resolution with sequential and integrated strategies
(2011) International Journal of Manufacturing Research, 6 (1), pp. 30-48;
Bychkov, I., Batsyn, M., (2017) An Efficient Exact Model for the Cell Formation
Problem with a Variable Number of Production Cells, pp. 1-12;
Bychkov, I., Batsyn, M., Pardalos, P.M., Exact model for the cell formation problem
Diaz, J.A., Luna, D., Luna, R., A GRASP heuristic for the manufacturing cell (2012)
Top, 20 (3), pp. 679-706;
manufacturing optimization: Problems, solutions, and comparisons (2000) IEEE
Applications, 39 (3), pp. 2408-2414;
Elleuch, M., Ben Bacha, H., Masmoudi, F., Maalej, A.Y., Maintenance policy
selection for cellular manufacturing: A simulation study (2007) International
Journal of Manufacturing Research, 2 (3), pp. 329-341;
formation (2004) Computers and Industrial Engineering, 47 (2-3), pp. 247-273., Nos;
Husseinzadeh Kashan, A., Karimi, B., Noktehdan, A., A novel discrete particle swarm
optimization algorithm for the manufacturing cell formation problem (2014) The
1556., Nos;
2059-2079;
and machine reliability (2014) Asia-Pacific Journal of Operational Research, 31
(4), p. 1450021;
Kamalakannan, R., Sudhakara Pandian, R., Sornakumar, T., Mahapatra, S.S., An ant
colony optimization algorithm for cellular manufacturing system (2017) Applied
Mechanics and Materials, 854 (1), pp. 133-141;
Karoum, B., Elbenani, B., El Imrani, A.A., Clonal selection algorithm for the cell
formation problem (2016) Proceedings of the Mediterranean Conference on Information
and Communication Technologies, Lecture Notes in Electrical Engineering, 380, pp.
319-326;
Karoum, B., El Khattabi, N., Elbenani, B., El Imrani, A.A., An efficient artificial
immune system algorithm for the cell formation problem (2016) Journal of
Computational Methods in Sciences and Engineering, 16 (4), pp. 733-744;
Karoum, B., Elbenani, Y.B., A hybrid clonal algorithm for the cell formation
problem with variant number of cells (2017) Production Engineering, 11 (1), pp. 19-
28;
Karoum, B., Elbenani, Y.B., A clonal selection algorithm for the generalized cell
formation problem considering machine reliability and alternative routings (2017)
Production Engineering, 11 (4-5), pp. 545-556., Nos;
Masmoudi, F., Hachicha, W., A simulation approach for cellular manufacturing design
from initial cell formation solutions (2013) International Journal of Manufacturing
Research, 8 (1), pp. 85-102;
Moradgholi, M., Paydar, M.M., Mahdavi, I., Jouzdani, J., A genetic algorithm for a
bi-objective mathematical model for dynamic virtual cell formation problem (2016)
Journal of Industrial Engineering International, 12 (3), pp. 343-359;
approach (2014) The International Journal of Advanced Manufacturing Technology, 70
(9-12), pp. 1635-1652., Nos;
23, pp. 1047-1061;
Sayadi, M.K., Hafezalkotob, A., Naini, S.G., Firefly-inspired algorithm for
(2013) Journal of Manufacturing Systems, 32 (1), pp. 78-84;
Seyedhosseini, S.M., Badkoobehi, H., Noktehdan, A., Machine-part cell formation
problem using a group-based league championship algorithm (2015) Journal of
Promotion Management, 21 (1), pp. 55-63;
pp. 639-645;
Xin-She, Y., Suash, D., Cuckoo search via Lévy flights (2009) Proc. Of NaBIC 2009:
Proceedings of the World Congress on Nature and Biologically Inspired Computing,
pp. 210-214., Coimbatore, India;
Yadollahi, M.S., Mahdavi, I., Paydar, M.M., Jouzdani, J., Design a bi-objective
rate of machines (2014) International Journal of Production Research, 52 (24), pp.
7401-7415;
problem (2016) The International Journal of Advanced Manufacturing Technology, 86
(5-8), pp. 2243-2254., Nos
CORRESPONDENCE ADDRESS: Karoum, B.; Research Computer Science Laboratory (LRI),
Faculty of Science, Mohammed V University of RabatMorocco; email:
[email protected]
ISSN: 17500591
ABBREVIATED SOURCE TITLE: Int. J. Manuf. Res.
SOURCE: Scopus
Azadeh, A., Moghaddam, M., Nazari-Doust, B., Jalalvand, F.

56268189600;9633489100;56515476900;57202855885;
Fuzzy and stochastic mathematical programming for optimisation of cell formation
problems in random and uncertain states
times.
84922759946&doi=10.1504%2fIJOR.2015.067341&partnerID=40&md5=e8e8be3aea099e4e30f9a45
69ca7908d
DOI: 10.1504/IJOR.2015.067341
AFFILIATIONS: Department of Engineering Optimization, College of Engineering,
University of Tehran, P.O. Box 11365/4563, Tehran, Iran;
School of Industrial Engineering, Purdue University, 315 N., Grant Street, West
Lafayette, IN 47907-2023, United States
ABSTRACT: Applying mathematical programming models to solve the cellular
manufacturing problems is a challenging task as decision makers find it difficult
to specify goals and constraints because some of the involved parameters cannot be
estimated precisely. This study presents a modelling approach for design of a
dynamic cellular manufacturing system with uncertain characteristics and
parameters. It provides mathematical models for solving cell formation problems
(CFPs) in three different conditions: 1) crisp state in which all parameters are
known and fixed; 2) fuzzy state in which setup cost, outsourcing cost and capacity
of machines are considered as fuzzy parameters; 3) stochastic state in which
probability distributions are used to model the assumed randomness. The general
algebraic modelling system (GAMS) software is used to solve all test problems by
CPLEX solver. This is the first study that presents mathematical programming models
for solving CMS problems in crisp, stochastic and fuzzy states. © 2015 Inderscience
Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation problem; CFP; Fuzzy mathematical programming;
Optimisation; Stochastic mathematical programming; Uncertain environments.
REFERENCES: Ariafar, S., Ismail, N., Tang, S.H., Ariffin, M.K.A.M., Firoozi, Z.,
The reconfiguration issue of stochastic facility layout design in cellular
manufacturing systems (2012) International Journal of Services and Operations
Management, 11 (3), pp. 255-266;
50 (3-4), pp. 407-420;
Handbook of Cellular Manufacturing Systems, pp. 25-34., Irani, S (Ed.) John Wiley &
Sons, New York;
cell formation problem considering passive and active strategies (2008)
International Journal of Approximate Reasoning, 47 (2), pp. 141-165;
Chu, C.H., Recent advances in mathematical programming for cell formation (1995)
Planning, Design, and Analysis of Cellular Manufacturing Systems, Manufacturing
Research and Technology, 24, pp. 3-46., in Kamrani, A.K., Parsaei, H.R. and Liles,
D.H. (Eds.) Elsevier;
on number and average length of intra and intercellular movements (2013) Applied
Mathematical Modelling, 37 (4), pp. 1884-1896;
Dubois, D., Prade, H., Operations on fuzzy numbers (1978) International Journal of
Systems Science, 9 (6), pp. 613-626;
Ghezavati, V.R., Saidi-Mehrabad, M., Designing integrated cellular manufacturing
systems with scheduling considering stochastic processing time (2010) The
Applications, 38 (3), pp. 2478-2488;
Hachicha, W., Masmoudi, F., Haddar, M., Combining axiomatic design and designed
experiments for cellular manufacturing systems design framework (2008)
International Journal of Agile Systems and Management, 3 (3-4), pp. 306-319;
Heilpern, S., The expected valued of a fuzzy number (1992) Fuzzy Sets and Systems,
47 (1), pp. 81-86;
Jiménez, M., Arenas, M., Bilbao, A., Rodriguez, M.V., Linear programming with fuzzy
parameters: An interactive method resolution (2007) European Journal of Operational
Research, 177 (3), pp. 1599-1609;
Lai, Y.J., Hwang, C.L., (1994) Fuzzy Multiple Objective Decision Making, Methods
and Applications, , Springer, Berlin;
Li, J., Chu, C.H., Wang, Y., Yan, W., An improved fuzzy clustering method for
pp. 1049-1062;
Lozano, S., Dobado, D., Larrañeta, J., Onieva, L., Modified fuzzy C-means algorithm
for cellular manufacturing (2002) Fuzzy Sets and Systems, 126 (1), pp. 23-32;
Naadimuthu, G., Gultom, P., Lee, E.S., Fuzzy clustering in cell formation with
multiple attributes (2010) Computers and Mathematics with Applications, 59 (9), pp.
3137-3147;
Özdemir, R.G., Gençyilmaz, G., Aktin, T., The modified fuzzy art and a two-stage
5236;
cell-formation problems in machine scheduling (2009) Annals of Operations Research,
166 (1), p. 166181;
formation considering labor utilization (2013) Applied Mathematical Modelling, 37
(4), pp. 2308-2316;
Ravichandran, K.S., Chandra Sekhararao, K., A new approach to fuzzy part-family
formation in cellular manufacturing systems (2001) The International Journal of
Advanced Manufacturing Technology, 18 (8), pp. 591-597;
Safaei, N., Tavakkoli-Moghaddam, R., An extended fuzzy parametric programming-based
approach for designing cellular manufacturing systems under uncertainty and dynamic
conditions (2009) International Journal of Computer Integrated Manufacturing, 22
(6), pp. 538-548;
conditions (2008) Fuzzy Sets and Systems, 159 (2), pp. 215-236;
Sengupta, S., Ghosh, T., Dan, P.K., A hybrid neural network approach to cell
formation in cellular manufacturing (2011) International Journal of Intelligent
Systems Technologies and Applications, 10 (4), pp. 360-376;
and machine capacity (1997) The International Journal of Advanced Manufacturing
Technology, 13 (2), pp. 134-147;
Computation, 170 (2), pp. 761-780;
Torkul, O., Cedimoglou, I.H., Geyik, A.K., An application of fuzzy clustering to
manufacturing cell design (2006) Journal of Intelligent and Fuzzy Systems, 17 (2),
pp. 173-181;
formation problem using a scatter search approach (2009) The International Journal
Won, Y., Currie, K.R., Fuzzy ART/RRR-RSS: A two-phase neural network algorithm for
part machine grouping in cellular manufacturing (2007) International Journal of
Journal of Production Economics, 103 (1), pp. 185-198;
Zadeh, L.A., Fuzzy sets as a basis for a theory of possibility (1978) Fuzzy Sets
and Systems, 100 (1), pp. 9-34
CORRESPONDENCE ADDRESS: Azadeh, A.; Department of Engineering Optimization, College
of Engineering, University of Tehran, P.O. Box 11365/4563, Iran
ISSN: 17457645
SOURCE: Scopus
Saraç, T., Ozcelik, F.

15072920400;55912902400;
A genetic algorithm with proper parameters for manufacturing cell formation
problems
(2012) Journal of Intelligent Manufacturing, 23 (4), pp. 1047-1061. Cited 17 times.
84865202312&doi=10.1007%2fs10845-010-0446-
8&partnerID=40&md5=a427adf5e1d3dfb906b419abd3ca585b
DOI: 10.1007/s10845-010-0446-8
Eskisehir, Turkey
ABSTRACT: One fundamental problem in cellular manufacturing is the formation of
product families and machine cells. Many solution methods have been developed for
the cell formation problem. Since efficient grouping is the prerequisite of a
successful Cellular Manufacturing installation the research in this area will
likely be continued. In this paper, we consider the problem of cell formation in
cellular manufacturing systems with the objective of maximizing the grouping
efficacy. We propose a Genetic Algorithm (GA) to obtain machine-cells and part-
families. Developed GA has three different selection and crossover operators. The
proper operators and parameters of the GA were determined by design of experiments.
A set of 15 test problems with various sizes drawn from the literature is used to
test the performance of the proposed algorithm. The corresponding results are
compared to several well-known algorithms published. The comparative study shows
that the proposed GA improves the grouping efficacy for 40% of the test problems. ©
2010 Springer Science+Business Media, LLC.
AUTHOR KEYWORDS: Cell formation problem; Design of experiments; Genetic
algorithms; Grouping efficacy
INDEX KEYWORDS: Cell formation; Cell formation problem; Comparative studies;
Crossover operator; Grouping efficacy; Machine cell; Manufacturing cell formation;
Product families; Solution methods; Test problem, Design of experiments; Genetic
algorithms, Cellular manufacturing
REFERENCES: Arikan, F., Gungor, Z., A parametric model for cell formation and
exceptional elements' problems with fuzzy parameters (2005) Journal of Intelligent
Manufacturing, 16, pp. 103-114., 10.1007/s10845-005-4827-3;
Askin, R.G., Standrige, C.R., (1993) Modeling and Analysis of Manufacturing
Journal of Intelligent Manufacturing, 15 (6), pp. 753-759.,
10.1023/B:JIMS.0000042661.56171.bb;
International Journal of Production Research, 29, pp. 343-356.,
10.1080/00207549108930075;
3651-3669., 10.1080/00207540110068781;
Burbidge, J.L., A manual method for production flow analysis (1977) The Production
Engineering, 57, pp. 34-38., 10.1049/tpe.1977.0129;
(1973) International Journal of Production Research, 11 (4), pp. 399-416.,
10.1080/00207547308929988;
Chan, H.W., Milner, D.A., Direct clustering algorithm for group formation in
cellular manufacture (1982) Journal of Manufacturing Systems, 1, pp. 65-74.,
10.1016/S0278-6125(82)80068-X;
Research, 24 (5), pp. 1221-1264., 10.1080/00207548608919798;
Research, 24 (2), pp. 451-464., 10.1080/00207548608919741;
Production Research, 25 (6), pp. 835-850., 10.1080/00207548708919880;
of binary data for group technology (1989) International Journal of Production
Research, 27 (6), pp. 1035-1052., 10.1080/00207548908942606;
pp. 1325-1337., 10.1080/002075498193345;
De Witte, I., The use of similarity coefficients in production flow analysis (1980)
10.1080/00207548008919686;
Doulabi, S.H.H., Hojabri, H., Davoudpour, H., Seyed-Alagheband, S.A., Jaafari,
A.A., Two-phase approach for solving cell-formation problem in cell manufacturing
(2009) Proceedings of the World Congress on Engineering and Computer Science, 2.,
October 20-22, 2009, San Francisco;
Gen, M., Cheng, R., (1997) Genetic Algorithms and Engineering Design, , Wiley New
York;
Learning, , Addison-Wesley Reading;
formation (2004) Computers & Industrial Engineering, 47, pp. 247-273.,
10.1016/j.cie.2004.07.003;
Guerrero, F., Lozano, S., Smith, K., Canca, D., Kwok, T., Manufacturing cell
formation using a new self-organizing neural network (2002) Computers, 42, pp. 377-
382;
Journal of Production Research, 43 (5), pp. 913-932., 10.1080/0020754047000298566;
Joines, J., Culbreth, C., King, R., Manufacturing cell design: An integer
85., 10.1080/07408179608966253;
simulation study (2007) Engineering Applications of Artificial Intelligence, 20,
pp. 63-78., 10.1016/j.engappai.2006.04.001;
Research, 18, pp. 213-232., 10.1080/00207548008919662;
King, J.R., Nakornchai, V., Machine component group formation in group technology:
Review and extensions (1982) International Journal of Production Research, 20 (2),
pp. 117-133., 10.1080/00207548208947754;
of Production Research, 25, pp. 561-569., 10.1080/00207548708919861;
algorithm for manufacturing cell design (1999) Journal of the Operational Research
Society, 50, pp. 509-516;
Mak, K., Wong, Y., Wang, X., An adaptive genetic algorithm for manufacturing cell
formation (2000) International Journal of Advanced Manufacturing Technology, 16,
pp. 491-497., 10.1007/s001700070057;
993-1009., 10.1287/opre.20.5.993;
Ozturk, G., Ozturk, Z.K., Islier, A.A., A comparison of competitive neural network
with other AI techniques in manufacturing cell formation (2006) Lecture Notes in
Computer Science, pp. 575-583;
Rajagopalan, R., Batra, J., Design of cellular production systems: A graph-
567-579., 10.1080/00207547508943029;
Production Research, 35, pp. 501-511., 10.1080/002075497195876;
Research, 32, pp. 2149-2158., 10.1080/00207549408957064;
Srinivasan, G., Narendran, T., GRAPHICS-A non-hierarchical clustering algorithm for
478., 10.1080/00207549108930083;
Research, 28 (1), pp. 145-152., 10.1080/00207549008942689;
Vannelli, A., Kumar, K., A method for finding minimal bottleneck cells for grouping
part-machine families (1986) International Journal of Production Research, 24, pp.
387-400., 10.1080/00207548608919736;
MACE (1984) International Journal of Production Research, 22, pp. 937-948.,
10.1080/00207548408942513;
(2004) International Journal OfAdvanced Manufacturing Technology, 23, pp. 916-924;
(2009) Expert Systems with Applications, 36, pp. 3652-3661.,
10.1016/j.eswa.2008.02.060;
Xu, H., Wang, H., Part family formation for GT applications based on fuzzy
mathematics (1989) International Journal of Production Research, 27, pp. 1637-
1651., 10.1080/00207548908942644;
(2002) International Journal of Production Research, 40, pp. 2141-2158.,
10.1080/00207540210131851
CORRESPONDENCE ADDRESS: Saraç, T.; Industrial Engineering Department, Eskisehir
Osmangazi University, Eskisehir, Turkey; email: [email protected]
ISSN: 09565515
CODEN: JIMNE
ABBREVIATED SOURCE TITLE: J Intell Manuf
SOURCE: Scopus
Elbenani, B., Ferland, J.A., Bellemare, J.

36147113000;57193718834;56291938500;
Genetic algorithm and large neighbourhood search to solve the cell formation
problem
80255131398&doi=10.1016%2fj.eswa.2011.08.089&partnerID=40&md5=bd73182e2c22714296fe5
c1046c626a6
DOI: 10.1016/j.eswa.2011.08.089
AFFILIATIONS: Département d'Informatique et de Recherche Opérationnelle, Université
de Montréal, C.P. 6228, Succ. Centre-Ville, Montréal, QC H3C 3J7, Canada
ABSTRACT: We first introduce a local search procedure to solve the cell formation
problem where each cell includes at least one machine and one part. The procedure
applies sequentially an intensification strategy to improve locally a current
solution and a diversification strategy destroying more extensively a current
solution to recover a new one. To search more extensively the feasible domain, a
hybrid method is specified where the local search procedure is used to improve each
offspring solution generated with a steady state genetic algorithm. The numerical
results using 35 most widely used benchmark problems indicate that the line search
procedure can reduce to 1% the average gap to the best-known solutions of the
problems using an average solution time of 0.64 s. The hybrid method can reach the
best-known solution for 31 of the 35 benchmark problems, and improve the best-known
solution of three others, but using more computational effort. © 2011 Elsevier Ltd.
All rights reserved.
AUTHOR KEYWORDS: Cell formation problem; Destroy & recover strategy; Grouping
efficiency; Local search; Steady state genetic algorithm; Uniform crossover
INDEX KEYWORDS: Cell formation problem; Grouping efficiency; Local search; Steady-
state genetic algorithms; Uniform crossover, Cellular manufacturing; Numerical
methods, Genetic algorithms
(1), pp. 101-113;
pp. 2097-2116;
Research, 24 (5), pp. 1221-1233;
Research, 24 (2), pp. 451-464;
Davis, L., (1991) Handbook of Genetic Algorithms, , Van Nostrand Reinhold New York;
Dees Jr., W.A., Karger, P.G., Automated rip-up and reroute techniques (1982)
Proceedings of the 19th Conference on Design Automation, pp. 432-439., IEEE Press
New York;
Cell Formation Problem, , Publication # 2010-37, CIRRELT, Université de Montréal,
Montréal, Canada;
Falkenauer, E., (1998) Genetic Algorithms for Grouping Problems, , Wiley New York;
2059-2079., DOI 10.1016/j.cor.2005.08.010, PII S0305054805002649;
using a rank order clusterng algorithm (1980) International Journal of Production
Research, 18 (2), pp. 213-232;
pp. 117-133;
Kumar, C.S., Chandrasekharan, M., Grouping efficiency: A quantitative criterion for
Kumar K.Ravi, Kusiak Andrew, Vannelli Anthony, Grouping of parts and components in
flexible manufacturing systems (1986) European Journal of Operational Research, 24
(3), pp. 387-397., DOI 10.1016/0377-2217(86)90032-9;
Ravi Kumar, K., Vannelli, A., Strategic subcontracting for efficient disaggregate
1715-1728;
pp. 2633-2646;
Kusiak Andrew, Chow Wing, S., Efficient solving of the group technology problem
Luo, L., Tang, L., A hybrid approach of ordinal optimization and iterated local
search for manufacturing cell formation (2009) The International Journal of Advance
1009;
Ng, S., Worst-Case Analysis of an Algorithm for Cellular Manufacturing Systems
Pisinger, D., Ropke, S., A general heuristic for vehicle routing problems (2007)
Computers and Operations Research, 34 (8), pp. 2403-2435., DOI
10.1016/j.cor.2005.09.012, PII S0305054805003023;
and Manufacture, 6, pp. 173-184., I.C. Parmee, Springer-Verlag;
new grouping efficiency measure (2001) IIE Transactions, 33, pp. 11-27;
Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G., Record breaking
optimization results using the ruin and recreate principle (2000) Journal of
Computational Physics, 159 (2), pp. 139-171;
Shaw, P., Using Constraint Programming and Local Search Methods to Solve Vehicle
Routing Problems (1998) Lecture Notes in Computer Science, (1520), pp. 417-431.,
Principles and Practice of Constraint Programming - CP98;
Research, 28 (1), pp. 145-152;
Syswerda, G., A study of reproduction in generational and steady-state genetic
algorithms (1992) Foundations of Genetic Algorithms, pp. 4-101., G.J.E. Rawlings,
Morgan Kaufmann San Mateo, CA;
1989-2007;
Mace (1984) International Journal of Production Research, 22 (6), pp. 937-948
CORRESPONDENCE ADDRESS: Ferland, J.A.; Département d'Informatique et de Recherche
Opérationnelle, Université de Montréal, C.P. 6228, Succ. Centre-Ville, Montréal, QC
H3C 3J7, Canada; email: [email protected]
ISSN: 09574174
CODEN: ESAPE
SOURCE: Scopus
Javadian, N., Seyyedi, I., Rezaeian, J.

23485559000;44861695600;15078048200;
A genetic algorithm approach for a dynamic cell formation problem
(2009) IFAC Proceedings Volumes (IFAC-PapersOnline), 42 (4 PART 1), pp. 1055-1060.
79960915229&doi=10.3182%2f20090603-3-RU-
2001.0121&partnerID=40&md5=ab0ae6cdd887f1543c8c5c789364fb25
DOI: 10.3182/20090603-3-RU-2001.0121
AFFILIATIONS: Department of Industrial Engineering, College of Technology,
Mazandaran University of Science and Technology, PO Box 734, Babol, Iran
ABSTRACT: Over the past three decades considerable amount of research work has been
reported in the literature of Group Technology (GT). Cellular Manufacturing System-
an important application of Group Technology (GT) - has been recognized as an
effective way to enhance the productivity in a factory. Cellular manufacturing is
one of the most powerful management innovations in actualizing mass customization.
Most of the research work is concerned with formation of machine cells and part
families. This is because cell formation is considered to be the most complex and
the most important aspect of Cellular Manufacturing System (CMS). Due to NP
completeness of cell formation problem (CFP), many heuristics have been developed.
In this paper, an integer programming model is constructed to design a cellular
manufacturing system with independent cells. A genetic algorithm is developed to
solve the cell design problem. The results from the investigations show that the
genetic algorithm often finds better solutions than the exact algorithms. © 2009
IFAC.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing; Genetic
algorithm; Integer programming
INDEX KEYWORDS: Cells; Cytology; Genetic algorithms; Group technology; Integer
programming, Cell formation problem; Dynamic cell formation; Exact algorithms;
Genetic algorithm approach; Integer programming models; Management innovation; Mass
customization; Np-completeness, Cellular manufacturing
19 (5), pp. 305-317;
Engineers), 29 (7), pp. 599-610;
International Journal of Approximate Reasoning, 47 (2), pp. 141-165., DOI
10.1016/j.ijar.2007.03.003, PII S0888613X07000266;
10.1016/S0925-5273(99)00065-1;
problems with fixed cell cost (2004) Computers and Operations Research, 31 (1), pp.
21-37., DOI 10.1016/S0305-0548(02)00144-2, PII S0305054802001442;
formation (2004) Computers and Industrial Engineering, (47), pp. 247-273;
Eline, M.W., Roderick, J.R., Designing cellular manufacturing systems with dynamic
part population (1999) IIE Transaction, (31), pp. 21-29;
genetic-algorithm-based heuristic (2006) Internat. J. Production Res., 44 (12), pp.
2421-2444;
Holland, J., Adaptation in natural and artificial systems: An introductory analysis
with applications in biology (1975) Control, and Artificial Intelligence, , Ann
Arbor, MI: University of Michigan Press;
Review and extension (1982) International Journal of Production Research, (20), pp.
117-133;
cellular manufacturing environment (1998) Ann. Oper. Res., (77), pp. 109-128;
Mitrofanov, S.P., (1966) Scientific Principles of Group Technology, Part I, ,
National Lending Library of Science and Technology, Boston, MA;
Onwubolu, G.C., Mutingi, M., Genetic algorithm approach to cellular manufacturing
systems (2001) Computers and Industrial Engineering, 39 (1-2), pp. 125-144., DOI
10.1016/S0360-8352(00)00074-7;
Opitz, H., Eversheim, W., Wienhal, H.P., Work-piece classification and its
industrial applications (1969) International Journal of Machine Tool Design and
Research, (9), pp. 39-50;
Reisman, A., Kumar, A., Motwani, J., Cheng, C.H., Cellular manufacturing: A
statistical review of the literature (1965-1995) (1997) Operations Research, 45
(4), pp. 508-520;
approach (2007) International Journal of Advanced Manufacturing Technology, 33 (9-
10), pp. 1001-1009., DOI 10.1007/s00170-006-0518-2;
Soleja, V.B., Urosevic, S.M., Optimization of group technology lines by methods
developed in IAMA, belgrade (1969) Proceedings of the International Conference on
GT, , ILO, Turin;
S0096300305000238;
long-period demand changes: A methodology and investigation (1993) Decision
Science, (24), pp. 909-930;
Wemmerlö, V., Hyer, U.N.L., Procedures for the part family/machine group
identification problem in cellular manufacturing (1986) Journal of Operations
Management, 6 (2), pp. 125-147;
Research, 38 (2), pp. 385-395., DOI 10.1080/002075400189473
CORRESPONDENCE ADDRESS: Javadian, N.; Department of Industrial Engineering, College
of Technology, Mazandaran University of Science and Technology, PO Box 734, Babol,
Iran; email: [email protected]
PUBLISHER: IFAC Secretariat
ISSN: 14746670
ISBN: 9783902661432
SOURCE: Scopus
Tavakkoli-Moghaddam, R., Safaei, N., Sassani, F.

56491438400;8886880300;6603781510;
A new solution for a dynamic cell formation problem with alternative routing and
machine costs using simulated annealing
(2008) Journal of the Operational Research Society, 59 (4), pp. 443-454. Cited 30
times.
41149113856&doi=10.1057%2fpalgrave.jors.2602436&partnerID=40&md5=da1f331a58945bc00e
6ea62b0b819916
DOI: 10.1057/palgrave.jors.2602436
AFFILIATIONS: University of Tehran, Tehran, Iran;
Iran University of Science and Technology, Tehran, Iran;
University of British Columbia, Vancouver, Canada;
P.O. Box: 11365/4563, Tehran, Iran
ABSTRACT: This paper presents an integer-linear programming approach for a cell
formation problem (CFP) in a dynamic environment with a multi-period planning
horizon. The objectives are to minimize the inter-cell movement and machine costs
simultaneously. In dynamic environments, the product mix and demand are different
but deterministic in each period. As a consequence, the formed cells in the current
period may not be optimal for the next period. Thus, the reconfiguration of cells
is required. Reconfiguration consists of re-forming part families, machine groups,
and machine relocation. The CFP belongs to the category of NP-hard problems, thus
we develop an efficient simulated annealing (SA) method to solve such a problem.
The proposed mathematical model is optimally solved and the associated results are
compared with the results obtained by the SA run. The results show that the gap
between optimal and SA solutions is less than 4%, which indicates the efficiency of
the developed SA scheme. © 2008 Operational Research Society Ltd. All rights
reserved.
AUTHOR KEYWORDS: Dynamic cell formation problem; Mixed-integer programming;
Simulated annealing
INDEX KEYWORDS: Computational complexity; Linear programming; Problem solving;
Product development, Dynamic cell formation problem; Inter-cell movement; Mixed-
integer programming, Integer programming
formation in generalized group technology (2001) Comput Ind. Eng, 41, pp. 227-240;
Adil, G.K., Rajamani, D., Strong, D., A mathematical model for cell formation
considering investment and operational costs (1993) Eur J Opl Res, 69, pp. 330-341;
Adil, G.K., Rajamani, D., Strong, D., Assignment allocation and simulated annealing
algorithms for cell formation (1997) IIE Trans, 29, pp. 53-67;
Akturk, M.S., A note on the within-cell layout problem based on operation sequences
(1996) Prod Plann Control, 7, pp. 99-105;
cellular manufacturing systems (1997) IIE Trans, 29, pp. 599-610;
planning Horizons (2005) J Manuf Technol Mngt, 16, pp. 516-530;
Baykasoǧlu, A., A meta-heuristic algorithm to solve quadratic assignment
formulations of cell formation problems without presetting number of cells (2004) J
Intell Manuf, 15, pp. 753-759;
Baykasoglu, A., Gindy, N., A simulated annealing algorithm for dynamic layout
problem (2001) Comput Opns Res, 28, pp. 1403-1426;
Black, J.T., (1991) The Design of the Factory with a Future, , McGraw-Hill: New
York;
Bofill, P., Guimerà, R., Torras, C., Comparison of simulated annealing and mean
field annealing as applied to the generation of block designs (2003) Neural
Network, 16, pp. 1421-1428;
Econ, 64, pp. 279-284;
cellular manufacturing environment (1998) Ann Opns Res, 77, pp. 109-128;
Chen, C.L., Cotruvo, N.A., Back, W., A simulated annealing solution to the cell
Foulds, L.R., Neumann, K., A network flow model of group technology (2003) Math
Comput Model, 38, pp. 623-635;
Gutzmann, K.M., Combinatorial optimization using a continuous state Boltzmann
machine (1987) Proceedings of IEEE First International Conference of Neural
Networks, 3, pp. 721-728., San Diego, CA, pp;
under random product demand (1994) Int J Prod Res, 32, pp. 47-64;
(1983) Science, 220, pp. 671-680;
Lacksonen, T.A., Static and dynamic layout problems with varying areas (1994) J Opl
Res Soc, 45, pp. 59-69;
Lacksonen, T.A., Preprocessing for static and dynamic facility layout problems
(1997) Int J Prod Res, 35, pp. 1095-1106;
Logendran, R., Ramakrishna, P., Srikandarajah, C., Tabu search based heuristic for
cellular manufacturing systems in the presence of alternative process plans (1994)
Int J Prod Res, 32, pp. 273-297;
Montreuil, B., Laforge, A., Dynamic layout design given a scenario tree of probable
futures (1992) Eur J Opl Res, 63, pp. 271-286;
Rogers, G., Bottaci, L., Modular production systems: A new manufacturing paradigm
(1997) J Intell Manuf, 8, pp. 147-156;
Schaller, J.E., Erenguc, S.S., Vakharia, A.J., A mathematical approach for
integrating the cell design and production planning decision (2000) Int J Prod Res,
38, pp. 3953-3971;
Shafer, S., Rogers, D., A goal programming approach to the cell formation problem
(1991) J Opns Mngt, 10, pp. 28-43;
formulation of machine cells in group technology (1997) Int J Prod Res, 35, pp.
501-511;
Song S and Hitomi K (1996). Integrating the production planning and cellular layout
for flexible cellular manufacturing. Int J Prod. Plann Control 7: 585-593; Su,
C.T., Hsu, C.M., Multi-objective machine-part cell formation through parallel
simulated annealing (1998) Int J Prod. Res, 36, pp. 2185-2207;
dynamic cell formation problem using meta-heuristics (2005) Appl Math Comput, 170,
pp. 761-780;
algorithms (2005) Lecture Notes in Computer Science, 3777, pp. 213-227., Lupanov
OB, Kasim-Zade OM, Chaskin AV and Steinhofel K, eds, Stochastic Algorithms:
Foundation and Applications, Springer-Verlag: Berlin, pp;
long-term demand changes: A methodology and investigation (1993) Decis Sci, 24, pp.
909-929;
Wemmerlov, U., Hyer, N., Cellular manufacturing in the US industry: A survey of
Implementation experiences and performance improvements (1997) Int J Prod Res, 35,
pp. 29-49;
Wilhelm, W., Chiou, C., Chang, D., Integrating design and planning considerations
in cellular manufacturing (1998) Ann Opns Res, 77, pp. 97-107;
cell formation with multiple identical machines (2003) Eur J Opl Res, 15, pp. 434-
446
Engineering, Faculty of Engineering, University of Tehran, P.O. Box: 11365/4563,
ISSN: 01605682
CODEN: JORSD
ABBREVIATED SOURCE TITLE: J.Oper.Res.Soc.
SOURCE: Scopus
Jabalameli, M.S., Arkat, J., Sakri, M.S.

21834329200;55912953100;52763752000;
Applying metaheuristics in the generalized cell formation problem considering
machine reliability
274. Cited 2 times.
50949101987&doi=10.1080%2f10170660809509090&partnerID=40&md5=bef9498dd0ec72efd668a4
0d2e3b2d6e
DOI: 10.1080/10170660809509090
AFFILIATIONS: Department of Industrial Engineering-Iran, University of Science and
Technology, Iraq;
Department of Industrial Engineering, University of Kurdistan, Iraq;
Department of Planning, Kurdistan Tractor Manufacturing Co., Iraq
ABSTRACT: Machines are the major component of the cellular manufacturing systems
(CMS). Usually, it is difficult to handle machine breakdowns as quickly as the
production requirement dictates and therefore, the reliability consideration plays
an important role in the overall performance of the CMS. We present a mathematical
model of the cell formation problem with alternative process routings (APR) and
machine reliability consideration. The proposed model tries to simultaneously
minimize the intercellular movement costs and to maximize the reliability of the
manufacturing system. In addition, we develop three sets of metaheuristics, namely
simulated annealing, genetic algorithm and memetic algorithm to solve the proposed
model. Using some numerical examples, we compare the performance of the proposed
algorithms with an optimum algorithm, namely the branch and bound algorithm. The
results show that in comparison with the branch and bound algorithm, the proposed
metaheuristics can obtain better objective function values in less computational
time. © 2008, Taylor & Francis Group, LLC.
AUTHOR KEYWORDS: Alternative process routings; Cell formation; Genetic algorithm;
Machines reliability; Memetic algorithm; Simulated annealing
INDEX KEYWORDS: Branch and bound method; Genetic algorithms; Heuristic algorithms;
Manufacture; Reliability; Simulated annealing, Alternative process routings;
Branch-and-bound algorithms; Cell formation; Cell formation problem; Intercellular
movement; Memetic algorithms; Objective function values; Production requirements,
alternate routings (1996) International Journal of Production Research, 34, pp.
1361-1380;
Agarwal, A., Sarkis, J.A., Review and analysis of comparative performance studies
of functional and cellular manufacturing layouts (1998) Computers and Industrial
Akturk, M.S., A note on the whiten-cell layout problem based on operation sequences
(1996) Production Planning & Control, 7, pp. 99-103;
Handbook of Cellular Manufacturing Systems, , Irani S.A., (ed), New York: John
Wiley;
Boughton, N.J., Arokiam, I.C., The application of the cellular manufacturing: a
regional small to medium enterprise perspective (2000) Proceedings of the
Institution of the Mechanical Engineers, 214, pp. 751-754;
plans and machine capacity constraints: a new combined approach (2000)
Cerny, V., A thermodynamical approach to the travelling salesman problem: an
efficient simulation algorithm (1985) Journal of Optimization Theory and
Choobineh, F.A., Framework for the design of cellular manufacturing systems (1988)
Dawkins, R., (1976) The Selfish Gene, , Oxford: Clarendon Press;
227-240;
Eid, M.S., Kamel, M., A part-machine assignment algorithm for cellular
manufacturing with machine capacity constraints (1998) Computers and Industrial
Felix, T.S.C., Lau, K.W., Chan, P.L.Y., Choy, K.L., Two-stage approach for machine-
part grouping and cell layout problems (2006) Robotics and Computer Integrated
Ferreira Ribeiro, J.F., Pradin, B., A methodology for cellular manufacturing design
Flynn, B.B., Jacobs, F.R., A simulation comparison of group technology with
traditional job shop manufacturing (1986) International Journal of Production
Research, 24, pp. 1171-1192;
Goldberg, D.E., (1989) Genetic Algorithms in Search, Optimization and Machine
Learning, , Boston, MA: Kluwer Academic Publishers;
Goldberg, D.E., (2002) The Design of Innovation: Lessons from and for Competent
Genetic Algorithms, , MA: Addison-Wesley Reading;
alternative routings (1993) International Journal of Production Research, 31, pp.
1259-1273;
machine-component grouping decision in the design of a cellular manufacturing
423-431;
36, pp. 157-179;
Jayakrishnan Nair, G., Narendran, T.T., ACCORD: a bicriterion algorithm for cell
formation using ordinal and ratio-level data (1999) International Journal of
considering alternative routing (1997) Computer Integrated Manufacturing System,
10, pp. 93-107;
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., Optimization by Simulated Annealing
(1983) Science, 220, pp. 671-680;
Kitaoka, M., Nakamura, R., Serizawa, S., Usuki, J., Multivariate analysis model for
machine-part cell formation problem in group technology (1999) International
Journal of Production Economics, 60, pp. 433-438;
systems in the presence of machine breakdown (1997) International Journal of
Research, 37, pp. 3289-3304;
Morris, S.J., Tersine, R.J., A simulation analysis of factors influencing the
attractiveness of group technology cellular layouts (1990) Management Science, 36,
pp. 1567-1578;
considerations in group technology application (1990) International Journal of
Pablo, M.S., (2001) NP Optimization Problems, Approximability and Evolutionary
Computation: From Practice to Theory, , Brazil: Universidade Estadual de Campinas,
Ph.D. Dissertation;
Reisman, A., Kumar, A., Motwani, J., Cheng, C., Cellular manufacturing: a
statistical review of the literature (1997) Operations Research, 45, pp. 508-520;
routings (1998) Journal of Operational Research Society, 49, pp. 953-965;
Sarker, B.R., Xu, Y., Designing multi-product lines: job routing in cellular
manufacturing systems (2000) IIE Transactions, 32, pp. 219-235;
review evaluation and directions for future research (1998) Computers and
707-720;
Sofianopoulou, S., Manufacturing cells design with alternative process plans and or
707-720;
Steudel, H.J., Ballakur, A., A dynamic programming based heuristic for machine
grouping in manufacturing cell formation (1987) Computers and Industrial
Sule, D.R., Machine capacity planning in group technology (1991) International
Suresh, N.C., Meredith, J.R., Coping with the Loss of pooling synergy in cellular
manufacturing Systems (1994) Management Science, 40, pp. 466-483;
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the U.S. industry: a survey of
flows (2005) International Journal of Advanced Manufacturing Technology, 27, pp.
159-165;
Economics, 101, pp. 329-352;
Transactions on Robotics and Automation, 13, pp. 161-168;
Zhao, C., Wu, Z.A., Genetic algorithm for manufacturing cell formation with
of KurdistanIraq; email: [email protected]
ISSN: 10170669
ABBREVIATED SOURCE TITLE: J. Chin. Inst. Ind. Eng.
SOURCE: Scopus
Thanh, L.T., Ferland, J.A., Elbenani, B., Dinh Thuc, N., Hien Nguyen, V.
55249417500;57193718834;36147113000;55618176500;24495574200;
A computational study of hybrid approaches of metaheuristic algorithms for the cell
formation problem
times.
84950274038&doi=10.1057%2fjors.2015.46&partnerID=40&md5=2c77e25ee85aa8728b5af1eca5b
a1303
DOI: 10.1057/jors.2015.46
AFFILIATIONS: Institute for Computational Science and Technology at Ho Chi Minh
City, Viet Nam;
Department of Computer Science and Operations Research, University of Montreal,
Pavillon André-Aisenstadt, 2920 chemin de la Tour, Montreál, H3C 3J7, Canada;
Research Laboratory of Informatics, Mohammed v University-Agdal, Morocco, United
States;
University of Science, VNU-HCM, Viet Nam;
University of Namur, Namur, Belgium
ABSTRACT: In this paper we solve the 0-1 cell formation problem where the number of
cells is fixed a priori and where the objective is to maximize the overall
efficiency of a production system by grouping together machines providing service
to similar parts into a subsystem (denoted cell). Three different methods are
introduced and compared numerically. The first local search method is an
implementation of simulated annealing (SA) where the definition of the
neighbourhood is specific to the application and requires using a diversification
and intensification strategies. The second local search method is an adaptive
simulated annealing method where the neighbourhood is selected randomly at each
iteration. The procedure is adaptive in the sense that the probability of selecting
a neighbourhood is updated during the process. The third method is a hybrid method
(HM) of a population-based method and a local search method. To improve the
solution obtained with HM, we apply a SA method afterward. The best variants are
very efficient to solve the 35 benchmark problems commonly used in the literature.
© 2016 Operational Research Society Ltd.
AUTHOR KEYWORDS: combinatorial optimization; Evolutionary computation; fractional
programming; genetic algorithm; simulated annealing
INDEX KEYWORDS: Algorithms; Cells; Cellular manufacturing; Combinatorial
optimization; Cytology; Evolutionary algorithms; Genetic algorithms; Local search
(optimization); Mathematical programming; Optimization; Simulated annealing,
Adaptive simulated annealing; Bench-mark problems; Cell formation problem;
Computational studies; Diversification and intensification strategies; Fractional
programming; Local search method; Meta heuristic algorithm, Iterative methods
(1), pp. 101-113;
Boe, W.J., Ch, C., A close neighbour algorithm for designing cellular manufacturing
2116;
3651-3669;
Carrie, A.S., Numerical taxonomy applied to group technology, plant layout (1973)
Cerný, V., Thermodynamical approach to the traveling salesman problem: An efficient
simulation algorithm (1985) Journal of Optimization Theory, Application, 45 (1),
pp. 41-51;
Chandrasekharan, M.P., Rajagopalan, R., Zodiac: An algorithm for concurrent
formation of part-families, machine-cells (1987) International Journal of
Research, 24 (5), pp. 1221-1233;
Research, 24 (2), pp. 451-463;
Crouzeix, J.P., Ferland, J.A., Nguyen, V.H., Revisiting dinkelbachtype algorithms
for generalized fractional programs (2008) Journal of the Operational Research
Society of India, 45 (2), pp. 96-110;
for manufacturing optimization: Problems, solutions, comparisons (2000) IEEE
Transactions on Evolutionary Computations, 4 (2), pp. 93-113;
programming for the solution of simple cellformation problems (2001) International
Dinkelbach, W., On nonlinear fractional programming (1967) Management Science
Series A, Sciences, 13 (7), pp. 492-498;
Elbenani, B., Ferland, J.A., Bellemare, J., Genetic algorithm, large neighborhood
search to solve the cell formation problem (2012) Expert Systems with Applications,
39 (3), pp. 2408-2414;
Elbenani, B., Ferland, J.A., (2012) Cell Formation Problem Solved Exactly with the
Dinkelbach Algorithm, , Publication CIRRELT-2012-07, CIRRELT. University of
Montreal: Canada;
Farahani, M.H., Hosseini, L., An ant colony optimization approach for the machine-
part cell formation problem (2011) International Journal of Computational
Intelligence Systems, 4 (4), pp. 486-496;
Ferland, J.A., Costa, D., Heuristic search methods for combinatorial programming
problems (2001) Department of Computer Science, , Publication DIRO-1193 Operations
Research University of Montreal: Canada;
Ghosh, T., Dan, P.K., Sengupta, S., Chattopadhyay, M., Genetic rule based
techniques in cellular manufacturing 1992-2010): A systematic survey (2010)
International Journal of Engineering Science, Technology, 2 (5), pp. 198-215;
Ghosh, T., Sengupta, S., Chattopadhyay, M., Dan, P.K., Metaheuristic in cellular
manufacturing: A state-of-the-art (2011) International Journal of Industrial
Engineering Computations, 2 (1), pp. 87-122;
Goncąlves, J.F., Resende, M.G.C., An evolutionary algorithm for manufacturing cell
Hsu, C.P., (1990) Similarity Coefficient Approaches to Machine-component Cell
Formation in Cellular Manufacturing: A Comparative Study, , PhD thesis Department
of Industrial, Manufacturing Engineering, University of Wisconsin-Milwaukee,
Wisconsin, USA;
2059-2079;
69-85;
Research, 18 (2), pp. 213-232;
Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P., Optimization by simulated
annealing (1983) Science, 220 (4598), pp. 671-680;
Review, Extension (1982) International Journal of Production Research, 20 (2), pp.
117-133;
1715-1728;
Kumar, K.R., Kusiak, A., Vannelli, A., Grouping of parts, components in flexible
387-397;
pp. 2633-2646;
(12), pp. 2071-2081;
Lin, S.W., Ying, K.C., Lee, Z.J., Part-machine cell formation in group technology
using a simulated annealing-based meta-heuristic (2010) International Journal of
Luo, L., Tang, L., A hybrid approach of ordinal optimization, iterated local search
for manufacturing cell formation (2009) International Journal of Advanced
Manimaran, A., Prabhakaran, G., Venkumar, P., Manufacturing cell formation using
artificial immune system (2011) International Journal of Computer Aided
Engineering, Technology, 3 (5-6), pp. 547-558;
McCormick, W.T., Jr., Schweitzer, P.J., White, T.W., Problem decomposition, data
reorganization by a clustering technique (1972) Operations Research 20(, 5 (993-
1009);
Mosier, C., Taube, L., The facets of group technology, their impacts on
methodologies based on recent studies 1997-2008): Review, directions for future
Pisinger, D., Ropke, S., A general heuristic for vehicle routing problems (2007)
solve the manufacturing cell formation problem (2004) Adaptive Computing in Design,
Manufacture VI, pp. 173-184., Parmee IC (ed) Springer-Verlag: Heidelberg;
23 (4), pp. 1047-1061;
Sarker, B.R., Khan, M., A comparison of existing grouping efficiency measures, a
new grouping efficiency measure (2001) IIE Transactions, 33 (1), pp. 11-27;
survey, critical review (1999) International Journal of Production Research, 37
(2), pp. 285-314;
Seifoddini, H., A note on the similarity coefficient method, the problem of
Research, 28 (1), pp. 145-152;
Stanfel, L.E., Machine clustering for economic production (1985) Engineering Costs,
Production Economics, 9 (1-3), pp. 73-81;
Syswerda, G., A study of reproduction in generational, steady state genetic
algorithms (1992) Foundations of Genetic Algorithms, pp. 94-101., Rawlings GJE (ed)
Morgan Kaufmann: San Mateo, CA;
1989-2007;
Vannelli, A., Kumar, K.R., A method for finding minimal bottleneck cells for
24 (2), pp. 387-400;
CORRESPONDENCE ADDRESS: Ferland, J.A.; Department of Computer Science and
Operations Research, University of Montreal, Pavillon André-Aisenstadt, 2920 chemin
de la Tour, Canada; email: [email protected]
PUBLISHER: Palgrave Macmillan Ltd.
ISSN: 01605682
CODEN: JORSD
SOURCE: Scopus
Shahparvari, S., Chiniforooshan, P.

56236833900;56237370200;
Hybridization of genetic algorithm and linear programming for solving cell
formation problem with alternative process routings
(2012) Lecture Notes in Engineering and Computer Science, 1, pp. 167-172. Cited 1
time.
85049894712&partnerID=40&md5=1d639cf6813227f243eeecdd060bb0a5
AFFILIATIONS: Department of Industrial Engineering, Kish International Campus,

University of Tehran, Tehran, Iran;
Science and Research Branch, Department of Industrial Engineering, Islamic Azad
University, Tehran, Iran
ABSTRACT: In this paper, a mathematical model is proposed to solve cell formation
problem considering alternative process routings in which more than one process
route for each part can be selected. The model attempts to minimize intercellular
movements and incorporates several real-life production factors and practical
constraints. In order to increase the flexibility provided by the multiplicity of
routings, the model distributes production volume of each part among alternative
routes. Also, a constraint enforcing work load balancing among machines is included
in the model. Due to the complexity and combinatorial nature of this model, an
enhanced algorithm comprised of a genetic algorithm (GA) and a linear programming
(LP) is proposed for solving the model. At each iteration, the algorithm identifies
the machine cells by GA. Consequently, the production quantity of each part in each
route is determined by LP sub-problem. A numerical example is solved and compared
with the solution approach from the literature that selects only one route for each
part. The computational results show that the proposed approach offers better
solution. © 2012 Newswood Limited. All rights reserved.
AUTHOR KEYWORDS: Alternative process routings; Cell formation; Genetic algorithm;
Hybrid meta-heuristic; Linear programming
INDEX KEYWORDS: Cells; Cytology; Genetic algorithms; Heuristic programming;
Iterative methods; Linear programming; Problem solving, Alternative process
routings; Cell formation; Cell formation problem; Computational results; Enhanced
algorithms; Hybrid Meta-heuristic; Intercellular movement; Production quantity,
REFERENCES: Wemmerlov, U.J., Johnson, D.J., Cellular manufacturing at 46 user
plants: Implementation experiences and Performance Improvements (1997)
Morris, J.S., Tersine, R.J., A simulation analysis of: Factors influencing the
attractiveness of group technology layouts (1990) Management Science, 36 (12), pp.
1567-1578;
Suresh, N.C., Meredith, J.R., Coping with the loss of pooling synergy in cellular
manufacturing systems (1994) Management Science, 40 (4), pp. 466-483;
Jensen, J.B., Malhotra, M.K., Philipoom, P.R., Machine dedication and process:
Flexibility in a group technology enviroment (1996) Journal of Operations
Adenso-Diaz, B., Lozano, S., Racero, J., Guerrero, F., Machine cell: Formation in
227-240;
Kim, C.O., Baek, J.G., Baek, J.K., A two-phase heuristic algorithm: For cell:
Formation problems considering alternative part routes and machine sequences (2004)
Selim, H.M., Askin, R.G., Vakharia, A.J., Cell: Formation in group technology:
Review, evaluation and direction: For: Future research (1998) Computers &
Liu, C., Yasuda, K., Yin, Y., Tanaka, K., Uncertain association rule mining
algorithm: For the cell: Formation problem in cellular manufacturing systems (2009)
Hwang, H., Ree, P., Routes selection: For the cell: Formation problem with
alternate part process plan (1996) Computers & Industrial Engineering, 30 (3), pp.
423-431;
Caux, C., Bruniaux, R., Pierreval, H., Cell: Formation with alternative process
Zhao, C., Wu, Z., A genetic algorithm: For manufacturing cell: Formation with
Research, 38 (2), pp. 385-395;
production: Factors (2002) International Journal of Production Economics, 40 (4),
pp. 885-906;
Dimopoulos, C., Zalzala, A.M., Recent developments in evolutionary computation: For
manufacturing optimization: Problems, solutions, and comparison (2000) IIE
Pierreval, H., Caux, C., Pairs, J.L., Viguier, F., Evolutionary approaches to the
design and organization of manufacturing systems (2003) Computers & Industrial
Hu, L., Yasuda, K., Minimising material handling cost in cell: Formation with
Tunnukij, T., Hicks, C., An enhanced grouping genetic algorithm: For solving the
cell: Formation problem (2009) International Journal of Production Research, 47
(7), pp. 1989-2007
CORRESPONDENCE ADDRESS: Shahparvari, S.; Department of Industrial Engineering, Kish
International Campus, University of TehranIran; email: [email protected]
EDITORS: Burgstone J., Ao S.I., Douglas C., Grundfest W.S.
PUBLISHER: Newswood Limited
ISSN: 20780958
ISBN: 9789881925169; 9789881925114
ABBREVIATED SOURCE TITLE: Lect. Notes Eng. Comput. Sci.
SOURCE: Scopus
Noktehdan, A., Karimi, B., Husseinzadeh Kashan, A.
35520149000;57193142554;57205429605;
A differential evolution algorithm for the manufacturing cell formation problem
using group based operators
77950188721&doi=10.1016%2fj.eswa.2009.12.033&partnerID=40&md5=822beb09842ded43778c2
7b33abdedfb
DOI: 10.1016/j.eswa.2009.12.033
AFFILIATIONS: Department of Industrial Engineering, Amirkabir University of
Technology, P.O. Box 15875-4413, Tehran, Iran
technology (GT), a manufacturing philosophy in which parts are grouped into part
families, and machines are allocated into machine cells to take advantage of the
similarities among parts in manufacturing. The target is to minimize inter-cellular
movements. Inspired by the rational behind the so called grouping genetic algorithm
(GGA), this paper proposes a grouping version of differential evolution (GDE)
algorithm and its hybridized version with a local search algorithm (HGDE) to solve
benchmarked instances of cell formation problem posing as a grouping problem. To
evaluate the effectiveness of our approach, we borrow a set of 40 problem instances
from literature and compare the performance of GGA and GDE. We also compare the
performance of both algorithms when they are tailored with a local search
algorithm. Our computations reveal that the proposed algorithm performs well on all
test problems, exceeding or matching the best solution quality of the results
presented in previous literature. © 2009 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Cell formation problem; Differential evolution algorithm;
Grouping genetic algorithm
INDEX KEYWORDS: Cell formation problem; Differential Evolution; Differential
evolution algorithms; Group-based; Grouping genetic algorithms; Grouping problem;
Local search algorithm; Machine cell; Manufacturing cell formation; Part family;
Problem instances; Solution quality; Test problem, Damping; Flexible manufacturing
systems; Genetic algorithms; Group technology; Learning algorithms; Mathematical
operators; Mobile telecommunication systems; Philosophical aspects, Cellular
manufacturing
REFERENCES: Aljaber, N., Baek, W., Chen, C., A tabu search approach to the cell
cell formation in group technology (1990) International Journal of Production
Research, 28, pp. 1555-1572;
Askin, R.G., Vakharia, A.J., Group technology - Cell formation and operation (1991)
The automated factory handbook: Technology and management, pp. 317-336., Cleland
D.I., and Bidanda B. (Eds), TAB Books, New York;
Research, 25, pp. 639-655;
Boe, W.J., Cheng, CH., A close neighbor algorithm for designing cellular
pp. 2097-2116;
manufacturing cell formation problem (2006) Computers and Operation Research, 33,
pp. 2219-2245;
problem (2007) Computers and Operation Research, 34, pp. 2059-2079;
3651-3669;
(1973) International Journal of Production Research, pp. 399-416;
Research, 24, pp. 1221-1233;
Research, 24, pp. 451-463;
part families (1998) International Journal of Production Research, 36, pp. 1325-
1337;
Falkenauer, E., The grouping genetic algorithms-widening the scope of the GAs
(1992) Belgian Journal of Operation Research, Statistics and Computer Science, pp.
33-79., 102;
Falkenauer, E., (1998) Genetic algorithm for grouping problems, , Wiley, New York;
Heragu, S.S., (1997) Facility design, , PWS Publishing Company, Boston, MA;
sizes (2006) International Journal of Production Research, 44, pp. 2337-2360;
Joines, J., Culbrethe, C., King, R., Manufacturing cell design: An integer
85;
Research, pp. 213-232;
pp. 117-131;
goodness of block diagonal forms of binary matrix in group technology (1990)
397;
1728;
Kusiak, A., Cho, W.S., Efficient solving of the group technology problem (1987)
Journal of Manufacturing system, pp. 117-124;
pp. 2633-2646;
reorganization by a clustering technique (1972) Operation Research, 20, pp. 993-
1009;
Purcheck, G.F.K., A linear programming method for the combinatorial grouping of an
incomplete power set (1975) Journal of Cybernetics, pp. 51-76;
statistical review of the literature (1965-1995) (1997) Operations Research, 45,
pp. 508-520;
European Journal of Operation Research, 130, pp. 588-611;
Seifiddini, H., A note on the similarity coefficient method and the problem of
Seifiddini, H., Wolf, P.M., Application of the similarity coefficient method in
group technology (1986) IIIE Transaction;
Shafer, S.M., Kern, G., A Mathematical programming approach for dealing with
exceptional elements in cellular manufacturing (1992) International Journal of
Shafer, S.M., Rogers, D.F., A goal programming approach to cell formation problems
(1991) Journal of Operations Management, 10, pp. 28-43;
problem (1989) International Journal of Production Research, 27, pp. 775-782;
Research, 28, pp. 145-152;
and Production Economies, 9, pp. 73-81;
Storn, R., Price, K., Differential evolution - A simple and efficient adaptive
scheme for global optimization over continues spaces (1995) Technical Report TR
(pp, , 95-102;
Vin, E., Delit, P., Delchamber, A., A multiple-objective grouping genetic algorithm
for the cell formation problem with alternative routings (2005) Journal of
Intelligent Manufacturing, 16, pp. 189-205;
cell formation problems (2007) Expert System with Applications
CORRESPONDENCE ADDRESS: Karimi, B.; Department of Industrial Engineering, Amirkabir
University of Technology, P.O. Box 15875-4413, Tehran, Iran; email:
[email protected]
ISSN: 09574174
CODEN: ESAPE
SOURCE: Scopus
Nsakanda, A.L., Price, W.L., Diaby, M., Gravel, M.

6506046784;7201638614;6603557151;7003490395;
Ensuring population diversity in genetic algorithms: A technical note with
application to the cell formation problem
times.
33751011921&doi=10.1016%2fj.ejor.2006.02.012&partnerID=40&md5=9e81d45c47fb39ee2c04b
eeea87d7947
DOI: 10.1016/j.ejor.2006.02.012
AFFILIATIONS: Sprott School of Business, Carleton University, 1125 Colonel By
Drive, Ottawa, Ont. K1S 5B6, Canada;
Faculté des sciences de l'administration, Département Opérations and Systèmes de
décision, Université Laval, Que. G1K 7P4, Canada;
Operations and Information Management Department, School of Business
Administration, University of Connecticut, Storrs, CT 06269-2041, United States;
Département d'informatique et de mathématique, Université de Québec à Chicoutimi,
Que. G7H 2B1, Canada
ABSTRACT: The entropy-based measure has been used in previous works to compute the
population diversity in solving the cell formation problem with the genetic
algorithm. Population diversity is crucial to the genetic algorithm's ability to
continue fruitful exploration as it may be used in choosing an initial population,
in defining a stopping criterion, in evaluating the population convergence, and in
making the search more efficient throughout the selection of crossover operators or
the adjustment of various control parameters (e.g., crossover or mutation rate,
population size). We show in this note that, when a non-ordinal chromosome
representation corresponding to the allocation of machines to cells is used, the
current way of measuring the population diversity is inaccurate. Consequently, it
leads to wrong conclusions when, at various iterations, carrying out fruitful
exploration or an efficient search of the solution space is guided by the perceived
population diversity degree. An alternative approach based on computing the
distance and the similarity between chromosomes is discussed. © 2006 Elsevier B.V.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing systems; Genetic
algorithm; Population diversity; Population heterogeneity
INDEX KEYWORDS: Cellular manufacturing; Chromosomes; Convergence of numerical
methods; Mathematical operators; Population statistics; Problem solving, Cell
formation problem; Population diversity; Population heterogeneity, Genetic
algorithms
REFERENCES: Arzi, Y., Bukchin, J., Masin, M., An efficiency frontier approach for
the design of cellular manufacturing systems in a lumpy demand environment (2001)
Billo, R., Tate, E., Bidanda, B., A genetic cluster algorithm for the machine-
component grouping problem (1996) Journal of Intelligent Manufacturing, 7, pp. 229-
241;
Dorigo, M., Di Caro, G., The Ant colony optimization meta-heuristics (1999) New
Ideas in Optimization, pp. 11-32., Corne D., Dorigo M., and Glover F. (Eds),
McGraw-Hill, London;
Gravel, M., Nsakanda, A.L., Price, W.L., Efficient solution to the cell formation
problem with multiple routing via a double-loop genetic algorithm (1998) European
Grefenstette, J.J., Incorporating problem specific knowledge into genetic
algorithms (1987) Genetic Algorithms and Simulated Annealing, pp. 122-128., Davis
L. (Ed), Morgan Kauffman, Los Altos;
Gupta, Y., Gupta, M., Kumar, A., Sundaram, C., Minimizing total intercell and
intracell moves in cellular manufacturing: A genetic algorithm approach (1995)
International Journal of Computer Integrated Manufacturing, 9, pp. 92-101;
Hertz, A., Kobler, D., A framework for the description of evolutionary algorithms
Joines, J.A., King, R.E., Cultbreth, T.C., Manufacturing cell design: An integer
programming approach model employing genetic algorithms intelligent search for the
cell formation problem (1996) IIE Transactions, 28 (1), pp. 69-85;
Pierreval, H., Plaquin, M.F., An evolutionary approach of multicriteria
manufacturing cell formation (1998) International Transactions in Operational
Research, 5 (1), pp. 13-25;
Solimanpur, M., Vrat, P., Shankar, R., Ant colony optimization algorithm to the
inter-cell layout problem in cellular manufacturing (2004) European Journal of
CORRESPONDENCE ADDRESS: Nsakanda, A.L.; Sprott School of Business, Carleton
University, 1125 Colonel By Drive, Ottawa, Ont. K1S 5B6, Canada; email:
[email protected]
ISSN: 03772217
CODEN: EJORD
SOURCE: Scopus
Hazarika, M., Laha, D.

56241400000;16643276600;
Application of genetic algorithm in generalized machine cell formation problem
(2018) 2017 International Conference on Energy, Communication, Data Analytics and
Soft Computing, ICECDS 2017, pp. 1855-1860.
85050120415&doi=10.1109%2fICECDS.2017.8389770&partnerID=40&md5=99735d51aac50a57ecc6
0f3fd52a0a54
DOI: 10.1109/ICECDS.2017.8389770
AFFILIATIONS: Department of Mechanical Engineering, Assam Engineering College,
Guwahati, 781013, India
ABSTRACT: In automated batch type production systems, machine-part cell formation
problems (CFP) have long drawn attention of researchers. The objective of CFP in
cellular manufacturing system (CMS) is to identity machine cells and part families
in order to minimize the intercellular movements of parts as well as maximize the
utilization of machines. Optimum cell formation results reduction in total
production times, in-process inventories, material handling cost, labor cost/times,
paper works, number of machine set-ups, set-up times. It also simplifies process
plans, management and improves product quality, productivity, utilization of
resources. Since the modern manufacturing machines are generally multifunctional,
so the processing of parts can be performed by number of alternative routes. The
objectives of this study is to determine the optimal processing route and balanced
machine cells (to minimize cell load variation) incorporation with parts volume,
process sequence for minimum intercellular movements of parts. A genetic algorithm
metaheuristic approach is presented for a benchmark CFP. Computational results show
that the proposed approach gives better result comparatively with the well-known
existing methods in terms of total intercellular movements. © 2017 IEEE.
AUTHOR KEYWORDS: Alternative process routings; Cellular manufacturing system;
Genetic algorithm; Intercellular movement of parts; Route selection
INDEX KEYWORDS: Cells; Cytology; Genetic algorithms; Materials handling; Soft
computing; Transportation routes; Wages, Alternative process routings; In-process
inventories; Intercellular movement; Machine cell formation problems; Material
handling costs; Meta-heuristic approach; Route Selection; Utilization of resources,
REFERENCES: Ballakur, A., Steudel, H., A within-cell utilization based heuristic
for designing cellular manufacturing systems (1987) International Journal of
2079;
optimization algorithm for the manufacturing cell formation problem (2014) Int J
Adv Manuf Technol, 73, pp. 1543-1556;
Laha, D., Hazarika, M., A heuristic approach based on Euclidean distance matrix for
the machine-part cell formation problem (2017) Materials Today: Proceedings, 4 (2),
pp. 1442-1451;
Hazarika, M., Laha, D., Machine-part cell formation for maximum grouping efficacy
based on genetic algorithm (2015) 2015 IEEE Workshop on Computational Intelligence:
Theories, Applications and Future Directions (WCI), pp. 1-6;
Wafik, Y., Kim, S., Multiple criteria clustering algorithm for solving the group
technology problem with multiple process routings (1997) Comput & Ind Eng, 32, pp.
207-220;
2633-2646;
Chow, W.S., Hawaleshka, O., An effective algorithm for solving the machine chaining
problem in cellular manufacturing (1992) Comput & Ind Eng, 22, pp. 95-100;
alternative routing (1993) International Journal of Production Research, 31, pp.
1259-1273;
Yin, Y., Yasuda, K., Manufacturing cells design of various production factors
(2002) Int J Prod Res, 40, pp. 885-906;
Farouq, A., Clustering algorithm for solving group technology problem with multiple
process routings (2013) Comput & Ind Eng, 66, pp. 781-790;
Hazarika, M., Laha, D., A Heuristic approach for Machine Cell Formation problems
with Alternative Routings (2016) Procedia Computer Science, 89, pp. 228-242;
Kusiak, A., (1990) Intelligent Manufacturing Systems, , (Prentice Hall: Englewood
Cliffs, NJ);
Li, J., Ding, Z., Fuzzy clustering analysis and fuzzy pattern recognition method
for formation of part families (1988) 16th North American Manufacturing Research
Conference (NAMRC) Proceeding, Society of Manufacturing Engineers, pp. 558-563;
manufacturing cell formation problems (2008) Expert Syst Appl, 34, pp. 1609-1617;
Xing, B., Nelwamondo, F.V., Battle, K., Gao, W., Marwala, T., Application of
artificial intelligence (AI) methods for designing and analysis of reconfigurable
cellular manufacturing system (RCMS) (2009) International Conference on Adaptive
Science and Technology, pp. 402-409;
Miljkovic, Z., Babic, B., Machine-part family formation by using ART-1 simulator
and FLEXY (2005) FME Transactions, 33 (3), pp. 157-162;
2158;
Ali, H.K., Behrooz, K., Azadeh, N., A novel discrete particle swarm optimization
algorithm for the manufacturing cell formation problem (2014) Int J Adv Manuf
Technol, 73, pp. 1543-1556;
Tabitha, L.J., Evelyn, C.B., Kellie, B.K., A hybrid grouping genetic algorithm for
2079;
Juan, A.D., Dolores, L., Ricardo, L., A GRASP heuristic for the manufacturing cell
Gupta, N.S., Devika, D., Valarmathi, B., Sowmiya, N., Apoorv, S., CARI-a heuristic
approach to machine-part cell formation using correlation analysis and relevance
index (2014) International Journal of Production Research, 52 (24), pp. 7297-7309;
formulation of machine cells in group technology (1997) International Journal of
Chen, C.L., Cotruvo, N.A., Baek, W., A simulated annealing solution to the cell
2601-2614;
Sun, D., Lin, L., Batta, R., Cell formation using tabu search (1995) Comput & Ind
Eng, 28, pp. 485-494;
manufacturing systems cell formation problem (1998) European Journal of Operations
Research, 105, pp. 537-551;
Hazarika, M., Laha, D., Genetic algorithm approach for machine cell formation with
alternative routings (2016) Material Today: Proceedings, , (in press);
Chang, O.K., Jun-Geol, B., Jong-Kwan, B., A two-phase heuristic algorithm for cell
Research, 38 (2), pp. 385-395
ISBN: 9781538618868
ABBREVIATED SOURCE TITLE: Int. Conf. Energy, Commun., Data Anal. Soft Comput.,
ICECDS
SOURCE: Scopus
Utkina, I.E., Batsyn, M.V., Batsyna, E.K.

57191223664;37111907600;44461079500;
A branch-and-bound algorithm for the cell formation problem
times.
85043303034&doi=10.1080%2f00207543.2018.1444811&partnerID=40&md5=d50e54ebf717b3a682
8e200fbe28af3e
DOI: 10.1080/00207543.2018.1444811
National Research University Higher School of Economics, Nizhny Novgorod, Russian
Federation;
Department of Applied Mathematics and Informatics, National Research University
Higher School of Economics, Nizhny Novgorod, Russian Federation
ABSTRACT: The Cell Formation Problem (CFP) is an important optimisation problem in
manufacturing. It has been introduced in the Group Technology (GT) and its goal is
to group machines and parts processed on them into production cells minimising the
movement of parts to other cells for processing and maximising for each cell the
loading of its machines with operations on its parts. We consider one of the
computationally hardest formulations of this problem–the CFP with a variable number
of cells and the grouping efficacy objective, which is a fractional function. The
CFP literature contains many heuristic algorithms, but only a small number of exact
approaches especially for this formulation. In the current paper, we present an
exact branch-and-bound algorithm for the same hard CFP formulation. To linearise
the fractional objective function, we apply the Dinkelbach approach. We have been
able to solve 24 of the 35 instances from the well known GT benchmark. For the
remaining 11 instances, the difference in the grouping efficacy with the best known
solutions is less than 2.6%. © 2018 Informa UK Limited, trading as Taylor & Francis
Group.
AUTHOR KEYWORDS: biclustering; branch-and-bound; cell formation problem;
Dinkelbach approach; exact solution
INDEX KEYWORDS: Branch and bound method; Cellular manufacturing; Cytology; Group
technology; Heuristic algorithms, Bi-clustering; Branch-and-bound algorithms; Cell
formation problem; Dinkelbach approach; Exact solution; Grouping efficacy;
Objective functions; Optimisation problems, Cells
REFERENCES: Arkat, J., Abdollahzadeh, H., Ghahve, H., A New Branch-and-bound
Algorithm for Cell Formation Problem (2012) Applied Mathematical Modelling, 36, pp.
5091-5100;
Askin, R.G., Subramanian, S.P., A Cost-based Heuristic for Group Technology
Configuration (1987) International Journal of Production Research, 25 (1), pp. 101-
113;
Boctor, F.F., A Linear Formulation of the Machine-part Cell Formation Problem
Boe, W., Cheng, C.H., A Close Neighbor Algorithm for Designing Cellular
Manufacturing Systems (1991) International Journal of Production Research, 29 (10),
pp. 2097-2116;
Brusco, M.J., An Exact Algorithm for Maximizing Grouping Efficacy in Part-machine
Clustering (2015) IIE Transactions, 47 (6), pp. 653-671;
Brusco, M.J., An Iterated Local Search Heuristic for Cell Formation (2015)
Burbidge, J.L., A New Approach to Production Control (1958) Institution of
Production Engineers Journal, 37 (5), pp. 288-302;
Busygin, S., Prokopyev, O., Pardalos, P.M., Biclustering in Data Mining (2008)
Bychkov, I., Batsyn, M., Sukhov, P., Pardalos, P.M., Heuristic Algorithm for the
Cell Formation Problem (2013) Models, Algorithms, and Technologies for Network
Analysis, 59, pp. 43-69., Goldengorin B.I., Kalyagin V.A., Pardalos P.M., (eds),
New York: Springer, and,.” In,., edited by;
Bychkov, I., Batsyn, M., Pardalos, P., Exact Model for the Cell Formation Problem
Carrie, S., Numerical Taxonomy Applied to Group Technology and Plant Layout (1973)
Chan, H.M., Milner, D.A., Direct Clustering Algorithm for Group Formation in
Cellular Manufacture (1982) Journal of Manufacturing Systems, 1 (1), pp. 64-76;
Chandrasekharan, M.P., Rajagopalan, R., MODROC: An Extension of Rank Order
Research, 24 (5), pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., An Ideal Seed Non-hierarchical Clustering
Algorithm for Cellular Manufacturing (1986) International Journal of Production
Research, 24 (2), pp. 451-464;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC: An Algorithm for Concurrent
Formation of Part Families and Machine Cells (1987) International Journal of
Chandrasekharan, M.P., Rajagopalan, R., Groupability: Analysis of the Properties of
Binary Data Matrices for Group Technology (1989) International Journal of
Dell’Amico, M., Toth, P., Algorithms and Codes for Dense Assignment Problems: The
State of the Art (2000) Discrete Applied Mathematics, 100 (1-2), pp. 17-48;
Dinkelbach, W., On Nonlinear Fractional Programming (1967) Management Science, 13,
pp. 492-498;
Eckstein, J., Hart, W.E., Phillips, C.A., PEBBL: An Object-oriented Framework for
Scalable Parallel Branch and Bound (2015) Mathematical Programming Computation, 7
(4), pp. 429-469;
4038-4045;
Flanders, R.E., Design Manufacture and Production Control of a Standard Machine
(1925) Transactions of ASME, 46, pp. 691-738;
Goldengorin, B., Krushinsky, D., Pardalos, P.M., (2013) Cell Formation in
Industrial Engineering. Theory, Algorithms and Experiments, , New York: Springer,
206 p, and;
Goncalves, J.F., Resende, M.G.C., An Evolutionary Algorithm for Manufacturing Cell
James, T.L., Brown, E.C., Keeling, K.B., A Hybrid Grouping Genetic Algorithm for
the Cell Formation Problem (2007) Computers & Operations Research, 34 (7), pp.
2059-2079;
Jonker, R., Volgenant, A.A., Shortest Augmenting Path Algorithm for Dense and
Sparse Linear Assignment Problems (1987) Computing, 38, pp. 325-340;
King, J.R., Machine-component Grouping in Production Flow Analysis: An Approach
Using a Rank Order Clustering Algorithm (1980) International Journal of Production
Research, 18 (2), pp. 213-232;
King, J.R., Nakornchai, V., Machine-component Group Formation in Group Technology:
Review and Extension (1982) International Journal of Production Research, 20 (2),
pp. 117-133;
Kumar, K.R., Kusiak, A., Vannelli, A., Grouping of Parts and Components in Flexible
Manufacturing Systems (1986) European Journal of Operations Research, 24, pp. 387-
397;
Kumar, K.R., Chandrasekharan, M.P., Grouping Efficacy: A Quantitative Criterion for
Kumar, K.R., Vannelli, A., Strategic Subcontracting for Efficient Disaggregated
Manufacturing (1987) International Journal of Production Research, 25 (12), pp.
1715-1728;
Kusiak, A., Chow, W.S., Efficient Solving of the Group Technology Problem (1987)
Kusiak, A., Boe, J.W., Cheng, C., Designing Cellular Manufacturing Systems: Branch-
and-bound and A* Approaches (1993) IIE Transactions, 25 (4), pp. 46-56;
McCormick, W.T., Schweitzer, P.J., White, T.W., Problem Decomposition and Data
Reorganization by a Clustering Technique (1972) Operations Research, 20 (5), pp.
993-1009;
Mitrofanov, S.P., (1933) Nauchnye osnovy gruppovoy tekhnologii, , Leningrad:
Lenizdat, 435 p (in Russian);
Mosier, C.T., Taube, L., The Facets of Group Technology and their Impact on
Implementation (1985) OMEGA, 13 (6), pp. 381-391;
Mosier, C.T., Taube, L., Weighted Similarity Measure Heuristics for the Group
Technology Machine Clustering Problem (1985) OMEGA, 13 (6), pp. 577-583;
Paydar, M.M., Saidi-Mehrabad, M., A Hybrid Genetic-variable Neighborhood Search
Pietracaprina, A., Pucci, G., Silvestri, F., Vandin, F., Space-efficient Parallel
Algorithms for Combinatorial Search Problems (2015) Journal of Parallel and
Distributed Computing, 76, pp. 58-65;
Seifoddini, H., A Note on the Similarity Coefficient Method and the Problem of
Improper Machine Assignment in Group Technology Applications (1989) International
Group Technology (1986) IIE Transactions, 18 (3), pp. 271-277;
Spiliopoulos, K., Sofianopoulou, S., An Optimal Tree Search Method for the
Manufacturing Systems Cell Formation Problem (1998) European Journal of Operational
Research, 105, pp. 537-551;
Srinivasan, G., Narendran, T.T., Mahadevan, B., An Assignment Model for the Part-
families Problem in Group Technology (1990) International Journal of Production
Research, 28 (1), pp. 145-152;
Stanfel, L., Machine Clustering for Economic Production (1985) Engineering Costs
Utkina, I., Batsyn, M., A Branch and Bound Algorithm for the Cell Formation Problem
(2016) Springer Proceedings in Mathematics & Statistics, 156, pp. 115-126;
Utkina, I., Batsyn, M., Batsyna, E., A Branch and Bound Algorithm for a Fractional
0–1 Programming Problem (2016) Lecture Notes in Computer Science, 9869, pp. 244-
255;
Waghodekar, P.H., Sahu, S., Machine-component Cell Formation in Group Technology
Zilinskas, J., Goldengorin, B., Pardalos, P.M., Pareto-optimal Front of Cell
Formation Problem in Group Technology (2015) Journal of Global Optimization, 61
(1), pp. 91-108
CORRESPONDENCE ADDRESS: Batsyn, M.V.; Laboratory of Algorithms and Technologies for
Network Analysis, National Research University Higher School of EconomicsRussian
Federation; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Mohammadi, M., Forghani, K.

57200105597;56003407100;
A hybrid method based on genetic algorithm and dynamic programming for solving a
bi-objective cell formation problem considering alternative process routings and
machine duplication
(2017) Applied Soft Computing Journal, 53, pp. 97-110. Cited 13 times.
85008877586&doi=10.1016%2fj.asoc.2016.12.039&partnerID=40&md5=7956a1e38606ca723cd51
b5d0944e78b
DOI: 10.1016/j.asoc.2016.12.039
AFFILIATIONS: Department of Industrial Engineering, Faculty of Engineering,
Kharazmi University, Tehran, Iran;
Department of Industrial Engineering, Amirkabir University of Technology, Tehran,
Iran
ABSTRACT: Cell formation is one of the first and most important steps in designing
a cellular manufacturing system. It consist of grouping parts with similar design
features or processing requirements into part families and associated machines into
machine cells. In this study, a bi-objective cell formation problem considering
alternative process routings and machine duplication is presented. Manufacturing
factors such as part demands, processing times and machine capacities are
incorporated in the problem. The objectives of the problem include the minimization
of the total dissimilarity between the parts and the minimization of the total
investment needed for the acquisition of machines. A normalized weighted sum method
is applied to unify the objective functions. Due to the computational complexity of
the problem, a hybrid method combining genetic algorithm and dynamic programming is
developed to solve it. In the proposed method, the dynamic programming is
implemented to evaluate the fitness value of chromosomes in the genetic algorithm.
Computational experiments are conducted to examine the performance of the hybrid
method. The computations showed promising results in terms of both solution quality
and computation time. © 2016 Elsevier B.V.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing system; Dynamic
programming; Genetic algorithm; Hybrid method
INDEX KEYWORDS: Cells; Cytology; Dynamic programming; Genetic algorithms;
Investments; Manufacture, Alternative process routings; Cell formation; Cell
formation problem; Computational experiment; Hybrid method; Objective functions;
Total investment; Weighted sum method, Cellular manufacturing
REFERENCES: Kioon, S.A., Bulgak, A.A., Bektas, T., Integrated cellular
manufacturing systems design with production planning and dynamic system
reconfiguration (2009) Eur. J. Oper. Res., 192, pp. 414-428;
users (1989) Int. J. Prod. Res., 27, pp. 1511-1530;
Mungwattana, A., Design of Cellular Manufacturing Systems for Dynamic and Uncertain
Production Requirements with Presence of Routing Flexibility (2000), Ph.D. Thesis
submitted to the Faculty of the Virginia Polytechnic Institute and State University
Blackburg, VA; Jeon, G., Leep, H.R., Forming part families by using genetic
algorithm and designing machine cells under demand changes (2006) Comput. Oper.
Res., 33, pp. 263-283;
technology problem with multiple process routings (1997) Comput. Ind. Eng., 32, pp.
207-220;
King, J., Nakornchai, V., Machine component group formation in group technology:
review and extensions (1982) Int. J. Prod. Res., 20, pp. 117-133;
Ballakur, A., An Investigation of Part Family/machine Group Formation in Designing
a Cellular Manufacturing System, Ph.D Thesis (1985), University of Wisconsin
Madison, WI; Boctor, F.F., A linear formulation of the machine-part cell formation
problem (1991) Int. J. Prod. Res., 29, pp. 343-356;
cells in group technology (1994) Eur. J. Oper. Res., 75, pp. 100-111;
coefficients and a parallel genetic TSP algorithm: formulation and comparison
(1995) Math. Comput. Modell., 21, pp. 61-73;
cell formation with multiple identical machines (2003) Eur. J. Oper. Res., 151, pp.
434-446;
Boutsinas, B., Machine-part cell formation using biclustering (2013) Eur. J. Oper.
Res., 230, pp. 563-572;
Aktürk, M.S., Turkcan, A., Cellular manufacturing system design using a holonistic
Kao, Y., Lin, C.H., A PSO-based approach to cell formation problems with
alternative process routings (2012) Int. J. Prod. Res., 50, pp. 4075-4089;
Chang, C.C., Wu, T.H., Wu, C.W., An efficient approach to determine cell formation,
cell layout and intracellular machine sequence in cellular manufacturing systems
(2013) Comput. Ind. Eng., 66, pp. 438-450;
Mohammadi, M., Forghani, K., A novel approach for considering layout problem in
cellular manufacturing systems with alternative processing routings and
subcontracting approach (2014) Appl. Math. Modell., 38, pp. 3624-3640;
to the design of cellular manufacturing systems (2004) Int. J. Prod. Res., 42, pp.
1419-1441;
problem with multiple routings via a double-loop genetic algorithm (1998) Eur. J.
Oper. Res., 109, pp. 286-298;
systems (2001) Comput. Ind. Eng., 39, pp. 125-144;
Arkat, J., Hosseinabadi Farahani, M., Ahmadizar, F., Multi-objective genetic
algorithm for cell formation problem considering cellular layout and operations
scheduling (2012) Int. J. Computer Integr. Manuf., 25, pp. 625-635;
Aghajani, A., Ahmadi Didehbani, S., Zadahmad, M., Seyedrezaei, M.H., Mohsenian, O.,
A multi-objective mathematical model for cellular manufacturing systems design with
probabilistic demand and machine reliability analysis (2014) Int. J. Adv. Manuf.
Technol., 75, pp. 755-770;
plans and machine capacity constraints: a new combined approach (2000) Int. J.
Prod. Econ., 64, pp. 279-284;
Chiang, C.P., Lee, S.D., Joint determination of machine cells and linear intercell
layout (2004) Comput. Oper. Res., 31, pp. 1603-1619;
Saghafian, S., Akbari Jokar, M.R., Integrative cell formation and layout design in
cellular manufacturing systems (2009) J. Ind. Syst. Eng., 3, pp. 97-115;
scale capacitated cell formation problems with multiple routings (2006) Eur. J.
Oper. Res., 171, pp. 1051-1070;
duplication in cellular manufacturing systems (2011) Int. J. Adv. Manuf. Technol.,
57, pp. 1155-1173;
stochastic cellular manufacturing problem: a queuing-based analysis (2011) Expert
Syst. Appl., 38, pp. 1326-1335;
(2011) Comput. Ind. Eng., 60, pp. 7-15;
predator-prey genetic algorithm (2012) Appl. Soft Comput., 12, pp. 559-572;
Javadi, B., Jolai, F., Slomp, J., Rabbani, M., Tavakkoli-Moghaddam, R., A hybrid
electromagnetism-like algorithm for dynamic inter/intra-cell layout problem (2014)
Int. J. Comput. Integr. Manuf., 27, pp. 501-518;
Sharifi, S., Chauhan, S.S., Bhuiyan, N., A dynamic programming approach to GA-based
heuristic for multi-period CF problems (2014) J. Manuf. Syst., 33, pp. 366-375;
Pachayappan, M., Panneerselvam, R., Hybrid genetic algorithm for machine-component
cell formation (2015) Intell. Inf. Manage., 7, pp. 107-122;
alternative part process plans (1996) Comput. Ind. Eng., 30, pp. 423-431;
McAuley, J., Machine grouping for efficient production (1972) Prod. Eng., 51, pp.
53--557;
problem: a comparative investigation (2005) Comput. Ind. Eng., 48, pp. 471-489;
Valdez, F., Melin, P., Castillo, O., A survey on nature-inspired optimization
algorithms with fuzzy logic for dynamic parameter adaptation (2014) Expert Syst.
Appl., 41, pp. 6459-6466;
Holland, J.H., Adaptation in Natural and Artificial Systems (1975), The University
of Michigan Press Ann Arbor, MI; Wu, X., Chu, C.H., Wang, Y., Yan, W., A genetic
algorithm for cellular manufacturing design and layout (2007) Eur. J. Oper. Res.,
181, pp. 156-167;
Goldberg, D.E., Genetic Algorithms in Search Optimization & Machine Learning
(1989), Addison-Wesley Massachusetts; Pérez, J., Valdez, F., Castillo, O.,
Modification of the Bat algorithm using fuzzy logic for dynamical parameter
adaptation (2015) CEC, pp. 464-471;
Olivas, F., Valdez, F., Castillo, O., Dynamic parameter adaptation in ant colony
optimization using a fuzzy system for TSP problems (2015) IFSA-EUSFLAT, pp. 765-
770;
Arıkan, F., Güngör, Z., Modeling of a manufacturing cell design problem with fuzzy
multi-objective parametric programming (2009) Math. Comput. Modell., 50, pp. 407-
420;
Chang, P.T., Lee, E.S., Multisolution method for cell formation exploring practical
alternatives in group technology manufacturing (2000) Comput. Math. Appl., 40, pp.
1285-1296;
Akturk, M.S., Balkose, H.O., Part-machine grouping using a multi-objective cluster
analysis (1996) Int. J. Prod. Res., 34, pp. 2299-2315;
Adil, G.K., Rajamani, D., The trade-off between intracell and intercell moves in
group technology cell formation (2000) J. Manuf. Syst., 19, pp. 305-317;
Saeedi, S., Solimanpur, M., Mahdavi, I., Javadian, N., Heuristic approaches for
cell formation in cellular manufacturing (2010) J. Softw. Eng. Appl., 3, pp. 674-
682;
formation problem (2006) Int. J. Prod. Econ., 102, pp. 1-21;
part grouping and cell layout problems (2006) Rob. Comput. Integr. Manuf., 22, pp.
217-238
CORRESPONDENCE ADDRESS: Mohammadi, M.; Department of Industrial Engineering,
Faculty of Engineering, Kharazmi UniversityIran; email: [email protected]
ISSN: 15684946
ABBREVIATED SOURCE TITLE: Appl. Soft Comput. J.
SOURCE: Scopus
Soto, R., Crawford, B., Almonacid, B., Paredes, F.

24403038600;23395875300;56407124500;24773930800;
Efficient Parallel Sorting for Migrating Birds Optimization When Solving Machine-
Part Cell Formation Problems
(2016) Scientific Programming, 2016, art. no. 9402503, . Cited 12 times.
84971393498&doi=10.1155%2f2016%2f9402503&partnerID=40&md5=40ce31c9ad736193e29aa9a60
6ab0802
DOI: 10.1155/2016/9402503
AFFILIATIONS: Pontificia Universidad Católica de Valparaíso, Valparaíso, 2362807,
Chile;
Universidad Autónoma de Chile, Santiago, 7500138, Chile;
Universidad Científica del Sur, Lima 18, Peru;
Universidad Central de Chile, Santiago, 8370178, Chile;
Universidad San Sebastián, Santiago, 8420524, Chile;
Universidad Diego Portales, Santiago, 8370109, Chile
ABSTRACT: The Machine-Part Cell Formation Problem (MPCFP) is a NP-Hard optimization
problem that consists in grouping machines and parts in a set of cells, so that
each cell can operate independently and the intercell movements are minimized. This
problem has largely been tackled in the literature by using different techniques
ranging from classic methods such as linear programming to more modern nature-
inspired metaheuristics. In this paper, we present an efficient parallel version of
the Migrating Birds Optimization metaheuristic for solving the MPCFP. Migrating
Birds Optimization is a population metaheuristic based on the V-Flight formation of
the migrating birds, which is proven to be an effective formation in energy saving.
This approach is enhanced by the smart incorporation of parallel procedures that
notably improve performance of the several sorting processes performed by the
metaheuristic. We perform computational experiments on 1080 benchmarks resulting
from the combination of 90 well-known MPCFP instances with 12 sorting
configurations with and without threads. We illustrate promising results where the
proposal is able to reach the global optimum in all instances, while the solving
time with respect to a nonparallel approach is notably reduced. © 2016 Ricardo Soto
et al.
INDEX KEYWORDS: Birds; Cells; Cellular manufacturing; Cytology; Energy
conservation; Linear programming; Machinery, Cell formation problem; Computational
experiment; Flight formation; Improve performance; Optimization metaheuristic;
Optimization problems; Parallel sorting; Parallel version, Optimization
REFERENCES: Mosier, C., Taube, L., The facets of group technology and their impacts
on implementation-a state-of-the-art survey (1985) Omega, 13 (5), pp. 381-391;
Durán, O., Rodriguez, N., Consalter, L.A., Collaborative Particle swarm
Soto, R., Crawford, B., Vega, E., Paredes, F., Solving manufacturing cell design
problems using an artificial fish swarm algorithm (2015) Advances in Artificial
Intelligence and Soft Computing, pp. 282-290., Springer;
incomplete power set (1975) Journal of Cybernetics, 5 (4), pp. 51-76;
problem (1991) Journal OfOperationsManagement, 10 (1), pp. 28-43;
Joines, J.A., Kay, M.G., King, R.E., Culbreth, C.T., Ahybrid genetic algorithm for
manufacturing cell design (2000) Journal of the Chinese Institute of Industrial
Engineers, 17 (5), pp. 549-564;
satisfiability (2012) Expert Systems with Applications, 39 (13), pp. 11423-11427;
Advanced Research in Applied Artificial Intelligence, pp. 400-406., H. Jiang, W.
Ding, M. Ali, and X. Wu, Eds. vol. 7345 of Lecture Notes in Computer Science,
Springer;
Kirkpatrick, S., Gelatt, J., Vecchi, M.P., Optimization by simulated annealing
(1983) Science, 220 (4598), pp. 671-680;
Cerný, V., Thermodynamical approach to the traveling salesman problem: An efficient
simulation algorithm (1985) Journal of Optimization Theory and Applications, 45
(1), pp. 41-51;
(3), pp. 1609-1617;
intelligence (1986) Computers and Operations Research, 13 (5), pp. 533-549;
Society, 50 (5), pp. 509-516;
pp. 916-924;
Lourenco, H.R., Martin, O.C., Stützle, T., (2003) Iterated Local Search, ,
Springer;
Lourenco, H.R., Martin, O.C., Stützle, T., Iterated local search: Framework and
applications (2010) Handbook of Metaheuristics, pp. 363-397., Springer;
Hansen, P., Mladenovíc, N., Pérez, J.A.M., Variable neighbourhood search: Methods
and applications (2010) Annals of Operations Research, 175 (1), pp. 367-407;
Colorni, A., Dorigo, M., Maniezzo, V., Distributed optimization by ant colonies
(1991) Proceedings of the First European Conference on Artificial Life (ECAL '91),
142, pp. 134-142., Paris, France;
machine-part cell formation problems (2010) Computers& Operations Research, 37
(12), pp. 2071-2081;
Kennedy, J., Particle swarm optimization (2010) Encyclopedia of Machine Learning,
pp. 760-766., Springer;
Shi, Y., Eberhart, R., A modified particle swarm optimizer (1998) Proceedings of
the IEEE World Congress on Computational Intelligence, IEEE International
Conference on Evolutionary Computation, pp. 69-73., May;
Chu, S.-C., Tsai, P.-W., Pan, J.-S., Cat swarm optimization (2006) PRICAI 2006:
Trends in Artificial Intelligence, pp. 854-858., Q. Yang andG. Webb, Eds. vol. 4099
of Lecture Notes in Computer Science, Springer;
Tsai, P.-W., Istanda, V., Review on cat swarm optimization algorithms (2013)
Proceedings of the 3rd International Conference on Consumer Electronics,
Communications and Networks (CECNet '13), pp. 564-567., IEEE, Xianning, China,
November;
Duman, E., Uysal, M., Alkaya, A.F., Migrating birds optimization: A
newmetaheuristic approach and its performance on quadratic assignment problem
Pan, Q.-K., Dong, Y., An improved migrating birds optimisation for a hybrid
flowshop scheduling with total flowtime minimisation (2014) Information Sciences,
277, pp. 643-655;
Niroomand, S., Hadi-Vencheh, A., Sahin, R., Vizvári, B., Modified migrating birds
manufacturing systems (2015) Expert Systems with Applications, 42 (19), pp. 6586-
6597;
algorithm for machinepart cell formation problems (2015) Advances in Artificial
Intelligence and Soft Computing, 9413, pp. 270-281., Springer, Berlin, Germany;
Fister, I., Jr., Yang, X.-S., Fister, I., Brest, J., Fister, D., A brief review of
nature-inspired algorithms for optimization (2013) Electrotechnical Review, 80 (3),
pp. 116-122;
Almeida-Luz, S.M., Rodríguez-Hermoso, M.M., Vega-Rodríguez, M.A., Gómez-Pulido, J.,
Sánchez-Pérez, J.M., GRASP and grid computing to solve the location area problem
(2009) Proceedings of the World Congress on Nature & Biologically Inspired
Computing (NaBIC '09), pp. 164-169., Coimbatore, India, December;
Byun, J.-H., Datta, K., Ravindran, A., Mukherjee, A., Joshi, B., Performance
analysis of coarse-grained parallel genetic algorithms on themulti-core Sun
UltraSPARC T1 (2009) Proceedings of the IEEE (SOUTHEASTCON '09), pp. 301-306.,
IEEE, Atlanta, Ga, USA, March;
Homberger, J., A parallel genetic algorithm for the multilevel unconstrained lot-
sizing problem (2008) INFORMS Journal on Computing, 20 (1), pp. 124-132;
Leon, C., Miranda, G., Segura, C., A memetic algorithm and a parallel
hyperheuristic island-based model for a 2D packing problem (2009) Proceedings of
the 11th Annual Genetic and Evolutionary Computation Conference (GECCO '09), pp.
1371-1378., ACM, July;
Jin, J., Crainic, T.G., Lokketangen, A., A cooperative parallel metaheuristic for
the capacitated vehicle routing problem (2014) Computers & Operations Research, 44,
pp. 33-41;
Cutillas-Lozano, J.-M., Giménez, D., Optimizing sharedmemory hyperheuristics on top
of parameterized metaheuristics (2014) Procedia Computer Science, 29, pp. 20-29;
Alba, E., Luque, G., Nesmachnow, S., Parallel metaheuristics: Recent advances and
new trends (2013) International Transactions in Operational Research, 20 (1), pp.
1-48;
Albutiu, M.-C., Kemper, A., Neumann, T., Massively parallel sort-merge joins
inmainmemorymulti core database systems (2012) Proceedings of the VLDB Endowment, 5
(10), pp. 1064-1075;
Davidson, A., Tarjan, D., Garland, M., Owens, J.D., Efficient parallel merge sort
for fixed and variable length keys (2012) Proceedings of the Innovative Parallel
Computing (InPar '12), pp. 1-9., IEEE, San Jose, Calif, USA, May;
Helman, D.R., Bader, D.A., Jájá, J., A randomized parallel sorting algorithm with
an experimental study (1998) Journal of Parallel and Distributed Computing, 52 (1),
pp. 1-23;
Peters, H., Schulz-Hildebrandt, O., Luttenberger, N., Anovel sorting algorithm for
many-core architectures based on adaptive bitonic sort (2012) Proceedings of the
IEEE 26th International Parallel & Distributed Processing Symposium (IPDPS '12),
pp. 227-237., IEEE;
Rajput, I.S., Kumar, B., Singh, T., Performance comparison of sequential quick sort
and parallel quick sort algorithms (2012) International Journal of Computer
Applications, 57 (9), pp. 14-22;
Prifti, V., Bala, R., Tafa, I., Saatciu, D., Fejzaj, J., The time profit obtained
by parallelization of quicksort algorithm used for numerical sorting (2015)
Proceedings of the Science and Information Conference (SAI '15), pp. 897-901.,
London, UK, July;
Sanders, P., Hansch, T., Efficient massively parallel quicksort (1997) Solving
Irregularly Structured Problems in Parallel Vol. 1253 of Lecture Notes in Computer
Science, pp. 13-24., Springer, Berlin, Germany;
Tsigas, P., Zhang, Y., A simple, fast parallel implementation of quicksort and its
performance evaluation on sun enterprise 10000 (2003) Proceedings of the 11th
Euromicro Conference on Parallel, Distributed and Network-Based Processing, pp.
372-381., IEEE, Genova, Italy, Feburary;
Duman, E., Elikucuk, I., Solving credit card fraud detection problem by the new
metaheuristics migrating birds optimization (2013) Advances in Computational
Intelligence Vol. 7903 of Lecture Notes in Computer Science, pp. 62-71., Springer,
Berlin, Germany;
Gao, K., Suganthan, P., Chua, T., An enhanced migrating birds optimization
algorithm for no-wait ow shop scheduling problem (2013) Proceedings of the IEEE
Symposium on Computational Intelligence in Scheduling (SCIS '13), pp. 9-13., IEEE;
Shen, L.W., Asmuni, H., Weng, F.C., A modified migrating bird optimization for
university course timetabling problem (2014) Jurnal Teknologi, 72 (1);
Lissaman, P.B.S., Shollenberger, C.A., Formation flight of birds (1970) Science,
168 (3934), pp. 1003-1005;
Badgerow, J.P., Hainsworth, F.R., Energy savings through formation flight? A re-
examination of the vee formation (1981) Journal OfTheoretical Biology, 93 (1), pp.
41-52;
Bajec, I.L., Heppner, F.H., Organized flight in birds (2009) Animal Behaviour, 78
(4), pp. 777-789;
von Vögeln (1989) Journal of Ornithology, 130 (1), pp. 15-24;
Rayner, J., A new approach to animal flight mechanics (1979) Journal of
Experimental Biology, 80 (1), pp. 17-54;
Almonacid, B., (2016) Dataset-Efficient Parallel Sorting for Migrating Birds
Optimization When Solving Machine-Part Cell Formation Problems, ,
http://www.inf.ucv.cl/?balmonacid/MPCFP/ParallelMBO2016, Pontificia Universidad
Católica de Valparaíso, Valparaíso, Chile
PUBLISHER: Hindawi Limited
ISSN: 10589244
CODEN: SCIPE
ABBREVIATED SOURCE TITLE: Sci. Program
SOURCE: Scopus
Paydar, M.M., Saidi-Mehrabad, M., Teimoury, E.

23025569300;18435197300;25652394500;
A robust optimisation model for generalised cell formation problem considering
machine layout and supplier selection
(2014) International Journal of Computer Integrated Manufacturing, 27 (8), pp. 772-
786. Cited 26 times.
84900833306&doi=10.1080%2f0951192X.2013.834476&partnerID=40&md5=5371817960f59e972c5
eb4f429365877
DOI: 10.1080/0951192X.2013.834476
AFFILIATIONS: School of Industrial Engineering, Iran University of Science and
ABSTRACT: Cell formation problem (CFP), as one of the most important decision-
making problems in designing a cellular manufacturing system (CMS), includes
grouping the machines in cells and the parts as part families. In CFP, machines and
their capacity are of the most important issues being considered carefully. Another
significant aspect of the problem is material handling costs, namely intercellular
and intracellular movement costs with respect to machines layout. On the other
hand, supplier selection process has acquired importance recently; this is mainly
because the raw material cost has a major share in total cost of final products and
most of the factories have to spend substantial amount of their resources on
purchasing and transportation. In this article, a new mixed integer linear
programming model is proposed for integrating procurement and production planning
in supply chain and design of cell formation simultaneously as well as the
imprecise nature of some critical parameters such as customer demands and machine
capacities. Then, a robust optimisation model is developed to solve the proposed
model and finding best solution. The robustness and effectiveness of the proposed
model are illustrated in an industrial case inspired form a typical equipment
manufacturer. © 2013 Taylor & Francis.
AUTHOR KEYWORDS: cell formation problem; machine layout; robust optimisation;
supplier selection
INDEX KEYWORDS: Costs; Linear programming; Optimization; Production control; Supply
chains, Cell formation problem; Decision-making problem; Machine layout; Material
handling costs; Mixed integer linear programming model; Robust optimisation;
Supplier selection; Supplier selection process, Cellular manufacturing
REFERENCES: Adenso-Diaz, B., Lozano, S., A model for the design of dedicated
pp. 301-319., DOI 10.1080/00207540601138395, PII 777072176, Selected papers from
the 2nd Group Technology/Cellular Manufacturing World Symposium;
Ahi, A., Aryanezhad, M.B., Ashtianim, B., Makui, A., A novel approach to determine
based on TOPSIS method (2009) Computers & Operations Research, 36 (5), pp. 1478-
1496;
Aissaoui, N., Haouari, M., Hassini, E., Supplier selection and order lot sizing
modeling: A review (2007) Computers and Operations Research, 34 (12), pp. 3516-
3540., DOI 10.1016/j.cor.2006.01.016, PII S0305054806000153;
50 (3-4), pp. 407-420;
scheduling (2012) International Journal of Computer Integrated Manufacturing, 25
(7), pp. 625-635;
Arkat, J., Naseri, F., Ahmadizar, F., A stochastic model for the generalised cell
formation problem considering machine reliability (2011) International Journal of
10.1080/00207540412331327754;
Chung, S., Wub, T., Chang, C., An efficient tabu search algorithm to the cell
subject to maximum acceptable risk level (2012) Computers & Industrial Engineering,
63 (4), pp. 842-854;
Eski, O., Ozkarahan, I., Design of manufacturing cells for uncertain production
requirements with presence of routing flexibility (2007) Proceedings of the 3rd
International Conference on Intelligent Computing (ICIC 2007), pp. 670-681., LNAI
4682, Berlin: Springer-Verlag;
Hassanzadeh, A.S., Zhang, G., An integrated model for closed-loop supply chain
configuration and supplier selection: Multi-objective approach (2012) Expert
Jolai, F., Tavakkoli-Moghaddam, R., Golmohammadi, A., Javadi, B., An
electromagnetism-like algorithm for cell formation and layout problem (2012) Expert
Leung, S.C.H., Tsang, S.O.S., Ng, W.L., Wu, Y., A robust optimization model for
multi-site production planning problem in an uncertain environment (2007) European
Liang, F., Fung, R.Y.K., Jiang, Z., Modelling approach and behavior analysis of
manufacturing resources in virtual cellular manufacturing systems using resource
element concept (2011) International Journal of Computer Integrated Manufacturing,
24 (12), pp. 1168-1182;
(2004) Extended Lingo: Version 9.0 Users Guide, , http://www.lindo.com, LINDO
Systems Inc., Chicago, IL: LINDO Systems;
10.1080/09511920600596821, PII 780858702;
Mirzapoural-E-Hashem, S.M.J., Malekly, H., Aryanezhad, M.B., A multi-objective
planning in a supply chain under uncertainty (2011) International Journal of
Spa: National Lending Library Translation;
Mulvey, J.M., Ruszczynski, A., A new scenario decomposition method for large-scale
stochastic optimization (1995) Operations Research, 43 (3), pp. 477-490;
systems (1995) Operations Research, 43 (2), pp. 264-281;
Muralidharan, C., Anantharaman, S.P., Deshmukh, S.G., A multi criteria group
decision making model for supplier rating (2002) Journal of Supply Chain
Management, 38 (4), pp. 22-35;
Pan, F., Nagi, R., Robust supply chain design under uncertain demand in agile
manufacturing (2010) Computers & Operations Research, 37 (4), pp. 668-683;
(6), pp. 538-548;
programming approach (1999) International Journal of Production Research, 37 (11),
pp. 2545-2563;
Solimanpur, M., Elmi, A., A tabu search approach for group scheduling in buffer-
constrained flow shop cells (2011) International Journal of Computer Integrated
manufacturing using ant-colony-based optimization (2010) International Journal of
production data using neural networks (2009) Computers & Industrial Engineering,
56, pp. 1340-1347;
Applied Mathematics and Computation, 184 (2), pp. 721-728., DOI
10.1016/j.amc.2006.05.172, PII S009630030600748X;
Tavakkoli-Moghaddam, R., Ranjbar-Bourani, M., Amin, G.R., Siadat, A., A cell
scatter search (2012) Journal of Intelligent Manufacturing, 23 (4), pp. 1127-1139;
Torabi, S.A., Shamekhi Amiri, A., A possibilistic approach for designing hybrid
50 (15), pp. 4090-4104;
181 (1), pp. 156-167;
pp. 159-165., DOI 10.1007/s00170-004-2143-2;
(2000) International Journal of Production Economics, 64 (1-3), pp. 385-397;
Zouggari, A., Benyoucef, L., Simulation based fuzzy TOPSIS approach for group
multi-criteria supplier selection problem (2012) Engineering Applications of
Artificial Intelligence, 25 (3), pp. 507-519
CORRESPONDENCE ADDRESS: Paydar, M.M.; School of Industrial Engineering, Iran
ISSN: 0951192X
CODEN: ICIME
ABBREVIATED SOURCE TITLE: Int J Computer Integr Manuf
SOURCE: Scopus
Jouzdani, J., Barzinpour, F., Shafia, M.A., Fathian, M.

24463419200;22957278500;26423242300;12765946400;
Applying simulated annealing to a generalized cell formation problem considering
alternative routings and machine reliability
(2014) Asia-Pacific Journal of Operational Research, 31 (4), art. no. 1450021, .
Cited 9 times.
84907599688&doi=10.1142%2fS0217595914500213&partnerID=40&md5=6bd05aff02c110fd73faa6
e962e3eba9
DOI: 10.1142/S0217595914500213
AFFILIATIONS: School of Industrial Engineering, Iranian University of Science and
Technology, Narmak, Tehran, Iran
ABSTRACT: One of the most important steps in designing a cellular manufacturing
system is cell formation which includes grouping the machines in cells and the
parts as part families, so that the costs are minimized. Several aspects of the
problem should be taken into account in cell formation; more specifically, machines
and their reliability are among the most important issues that should be modelled
correctly. Another important facet of a cellular manufacturing system is material
handling cost consisting of inter-cellular and intra-cellular movement costs. In
addition, setup cost may play a significant role in decision-making in many real
world problems of cell formation. Obviously, cell formation cannot be completed
without considering the demands for parts. Considering all these aspects of the
problem in this research, a generalized model for solving cell formation problem is
proposed. Exact methods, e.g., B&B, are cumbersome in solving such complex models
for large-size problems. Therefore, in this paper, a modified version of simulated
annealing algorithm is designed and numerical examples are provided to show that
the proposed method is efficient and effective. © 2014 World Scientific Publishing
Co. & Operational Research Society of Singapore.
AUTHOR KEYWORDS: alternative process routings; Cell formation problem; machine
reliability; material handling costs; simulated annealing
INDEX KEYWORDS: Cellular manufacturing; Costs; Materials handling; Reliability;
Simulated annealing, Alternative process routings; Alternative routings; Cell
formation problem; Generalized models; Machine reliability; Material handling
costs; Real-world problem; Simulated annealing algorithms, Problem solving
REFERENCES: Arikan, F., Güngör, Z., Modeling of a manufacturing cell design problem
with fuzzy multi-objective parametric programming (2009) Mathematical and Computer
Modelling, pp. 407-420;
Designing A Cellular Manufacturing System, , Ph.D. Thesis, University of Wisconsin,
Madison, WI;
Chung, S., Wu, T., Chang, C., An efficient tabu search algorithm to the cell
Das, K., Lashkari, R., Sengupta, S., Reliability consideration in the design and
of Production Economics, 74 (1-3), pp. 175-182;
Haibo, W., Bahram, A., Fred, G., Gary, K., Solving group technology problems via
clique partitioning (2006) International Journal of Flexible Manufacturing Systems,
18 (2), pp. 77-97;
Joc Cing, T., Nhu Binh, H., Evolving dispatching rules using genetic programming
for solving multi-objective flexible job-shop problems (2008) Computers and
Kazerooni, M., Luong, H.S.L., Abhary, K., A genetic algorithm based cell design
10 (2), pp. 93-108;
(1983) Science, 220 (4598), pp. 671-680;
Li, J., Chu, C.-H., Wang, Y., Yan, W., An improved fuzzy clustering method for
pp. 1049-1062;
Lin, S., Gupta, N.D.J., Kuo-Ching, Y., Zne-Jung, L., Using simulated annealing to
schedule a flow shop manufacturing cell with sequence-dependent family setup times
system in the presence of machine breakdown (1997) International Journal of
pp. 509-516;
Research, 37, pp. 3289-3304;
system (2012) Journal of Manufacturing Systems, 31, pp. 214-223;
and worker assignment (2010) Computers and Mathematics with Applications, 60 (4),
pp. 1014-1025;
Malave, C.O., Ramachandran, S., Neural network-based design of cellular
manufacturing systems (1991) Journal of Intelligent Manufacturing, 2, pp. 305-314;
Mitrofanov, S.P., (1966) The Scientific Principles of Group Technology, , Yorks:
Boston Spa, UK: National Lending Library Translation;
Mukhopadhyay, S.K., Ramesh, B.K., Sai, K., Vijai, V., A note on modified
Hamiltonian chain: A graph theoretic approach to group technology (2009)
considering operation time (2012) Journal of Manufacturing Systems, ,
doi:10.1016/j.jmsy.2012.03.001;
Nsakanda, A.L., Diaby, M., Price, W.L., Hybrid genetic approach for solving
largescale capacitated cell formation problems with multiple routings (2006)
Osman, I.B., Metaheuristics: Models, design and analysis (2004) Fifth Asia Pacific
Industrial Engineering and Management Systems Conf., , Asia Pacific Industrial
Engineering and Management Society, Gold Coast, Australia;
(2010) Expert Systems with Applications, pp. 5476-5483;
Computers and Industrial Engineering, 59 (4), pp. 929-936;
dynamic part population using a genetic algorithm (2008) International Journal of
Reisman, A., Kumar, A., Motwani, J., Cheng, C., Cellular manufacturing: A
Silver, E.A., An overview of heuristic solution methods (2004) Journal of the
Operational Research Society, pp. 936-956;
and Control, , London: Chapman and Hall;
of Production Research, , doi:10.1080/00207543.2010.528060;
manufacturing using ant-colony-based optimization (2010) International Journal of
Advanced Manufacturing Technology, pp. 1135-1144;
production data using neural networks (2009) Computers and Industrial Engineering,
pp. 1340-1347;
genetic algorithm (2007) Journal of Intelligent Fuzzy Systems, 18 (4), pp. 363-376;
Venkumar, P., Haq, A.N., Fractional cell formation in group technology using
modified ART1 neural networks (2006) International Journal of Advanced
pp. 1609-1617;
Economics, 101 (2), pp. 329-352;
159-165;
Transactions Robotics and Automation, 13 (2), pp. 161-168
CORRESPONDENCE ADDRESS: Jouzdani, J.; School of Industrial Engineering, Iranian
University of Science and Technology, Narmak, Tehran, Iran; email:
[email protected]
PUBLISHER: World Scientific Publishing Co. Pte Ltd
ISSN: 02175959
CODEN: APJRE
ABBREVIATED SOURCE TITLE: Asia Pac J Oper Res
SOURCE: Scopus
Ateme-Nguema, B., Dao, T.-M.

23974482600;23011197400;
Quantized Hopfield networks and tabu search for manufacturing cell formation
problems
(2009) International Journal of Production Economics, 121 (1), pp. 88-98. Cited 16
times.
69249230869&doi=10.1016%2fj.ijpe.2008.04.015&partnerID=40&md5=6fdaeb9e5a4dccb5aaf91
8600e85b85c
DOI: 10.1016/j.ijpe.2008.04.015
AFFILIATIONS: Management Sciences Department, University of Quebec in Abitibi-
Temiscamingue, Rouyn-Noranda, Canada;
Mechanical and Manufacturing Engineering Department, École de Technologie
Supérieure, Montreal, Canada
ABSTRACT: The use of neural networks in the design of cellular manufacturing system
is not new. This paper presents an application of modified Hopfield neural networks
in order to solve cell formation problems: the quantized and fluctuated Hopfield
neural networks (QFHN). This kind of Hopfield network combined with the "tabu
search" approach were primarily used in a hybrid procedure in order to solve the
cell formation for big sizes industrial data set. The problem is formulated as a
0/1 linear and integer programming model in order to minimize the dissimilarities
between machines and/or parts. Our hybrid approach allows us to obtain optimal or
nearly optimal solutions very frequently and much more quickly than traditional
Hopfield networks. It is also illustrated that the fluctuation associated with this
quantization may enable the network to escape from local minima, to converge to
global minima, and consequently to obtain optimal solutions very frequently and
much more quickly than pure quantized Hopfield networks (QHN). The effectiveness of
the proposed approach is flexibility it gives us, for example, in time problem-
solving for large-scale and speed of execution when we apply it. © 2009 Elsevier
B.V. All rights reserved.
AUTHOR KEYWORDS: Hybrid approach; Manufacturing cells; Metaheuristic; Quantized
networks
INDEX KEYWORDS: Cell formation; Cell formation problem; Cellular manufacturing
systems; Data sets; Global minima; Hopfield Networks; Hybrid approach; Hybrid
procedure; Integer programming models; IS flexibility; Local minimums;
Manufacturing cell formation; Manufacturing cells; Metaheuristic; Optimal
solutions; Quantized networks, Cell membranes; Cellular manufacturing; Cellular
neural networks; Flexible manufacturing systems; Heuristic methods; Integer
programming; Optimal systems; Problem solving; Tabu search, Hopfield neural
networks
REFERENCES: Boktor, F., A linear formulation of the machine-part cell formation
(1992) Proceedings of the First European Conference on Artificial Life, pp. 134-
142., Paris, France, pp;
Farahani, R.Z., Elahipanah, M., A genetic algorithm to optimize the total cost and
service level for just-in-time distribution in a supply chain (2008) International
manufacturing systems: a sequential modelling approach (1989) Computers and
Hendizadeha, S.H., Hamidreza, F., Mansouri, S.A., Gupta, J.N.D., ElMekkawya, T.Y.,
Meta-heuristic for scheduling a flowline manufacturing cell with sequence dependent
family setup times (2008) International Journal of Production Economics, 111, pp.
593-605;
Holland, J.H., (1975) Adaptation in Natural and Artificial Systems, , The
University of Michigan Press, Ann Arbor, MI;
Hopfield, J.J., Neurons with graded response have collective computational
properties like those of two state neurons (1984) Proceedings of National Academy
of Sciences USA, pp. 3088-3092;
Hopfield, J.J., Tank, D.W., Neural computation of decisions in optimization
problems (1985) Biological Cybernetics, 52, pp. 141-152;
Islam, K.M., Sarker, B.R., A similarity coefficient measure and machine-part
Journal of Production Research, 42;
Kennedy, J., Eberhart, R., Particle swarm optimization (1995) Proceedings of IEEE
International Conference on Neural Network, pp. 1942-1948;
117-133;
(1983) Sciences, 220, pp. 671-680;
Mak, K.L., Wong, Y.S., Wang, X.X., An adaptative genetic algorithm for
manufacturing cell formation (2000) International Journal of Advanced Manufacturing
Matsuda, S., Optimal Hopfield network for combinatorial optimization with linear
cost function (1998) IEEE Transactions on Neural Networks, 9 (6), pp. 1319-1330;
Matsuda, S., Quantized Hopfield networks for integer programming (1999) Systems and
Computers in Japan, 30 (6), pp. 1354-1364;
McAuley, J., Machine grouping for efficient production (1972) The Production
Engineer, 52, pp. 53-57;
scale capacitated cell formation problem with multiple routings (2006) European
Offodile, O.F., Mehrez, A., Grznar, J., Cellular manufacturing: a taxonomic review
Production Research, 35;
Tagliarini, G., Christ, J., Page, E.W., Optimization using neural networks (1991)
IEEE Transactions on Computers, 40 (12), pp. 1347-1358;
component grouping problem (1992) Computers and Industrial Engineering, 22, pp.
469-480
CORRESPONDENCE ADDRESS: Ateme-Nguema, B.; Management Sciences Department,
University of Quebec in Abitibi-Temiscamingue, Rouyn-Noranda, Canada; email:
[email protected]
ISSN: 09255273
CODEN: IJPCE
SOURCE: Scopus
Ulutas, B.H.
6602524363;
An immune system based algorithm for cell formation problem
(2019) Journal of Intelligent Manufacturing, 30 (8), pp. 2835-2852. Cited 1 time.
85045063218&doi=10.1007%2fs10845-018-1407-
x&partnerID=40&md5=f54af18821b993fd3f68c466f05d784e
DOI: 10.1007/s10845-018-1407-x
Eskisehir, 26480, Turkey
ABSTRACT: Technological developments enable the design and manufacturing of
products tailored to individual consumers. Cellular Manufacturing Systems (CMS) can
be considered as to ease flexibility, to reduce setup time, throughput time, work-
in-process inventories, and material handling costs. Cell formation problem (CFP)
that is one of the critical CMS design problems is the assignment of parts and
machines to specific cells based on their similarity. This study introduces a
Clonal Selection Algorithm (CSA) with a novel encoding structure that is efficient
to solve real-sized problems. Unlike the methods in literature that define the
number of cells as a constant number, this algorithm is significant because it can
obtain the optimum number of cell to generate best efficacy value. Proposed CSA is
tested by using 67 (35 well-known and 32 less-known) test problems. CSA obtains the
same 63 best-known optimal solutions, provides solutions for the 3 of the well-
known test problem and a new solution for the largest test problem (50 machine 150
part) that was not possible to be solved by the mixed integer linear programming
model due to the high computational complexity. Final CSA grouping results are
illustrated with figures to attract attention to the singleton and residual cells.
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
AUTHOR KEYWORDS: Artificial immune systems; Cell formation problem; Clonal
selection algorithm; Group technology
INDEX KEYWORDS: Cellular manufacturing; Clone cells; Cytology; Group technology;
Immune system; Integer programming; Materials handling; Product design, Artificial
Immune System; Cell formation problem; Clonal selection algorithms; Encoding
structure; Material handling costs; Mixed integer linear programming model;
Technological development; Work in process inventories, Problem solving
alternate routings (1996) International Journal of Production Research, 34 (5), pp.
1361-1380;
Arkat, A., Hosseini, L., Hosseinabadi, F.M., Minimization of exceptional elements
and voids in the cell Formation problem using a multi-objective genetic algorithm
the sub problem (1994) International Journal of Production Research, 32 (5), pp.
1197-1218;
Boctor, F.A., Linear formulation of the machine-part cell formation problem (1991)
pp. 2097-2116;
Brownlee, J., Clever algorithms: Nature-inspired programming recipes (2011)
Creative Commons, 280., http://www.cleveralgorithms.com/, Last accessed February
2018;
3651-3669;
with a variable number of production cells (2018) Computers and Operations
Research, 91, pp. 112-120;
Bychkov, I.S., Batsyn, M.V., Pardalos, P.M., Exact model for the cell formation
problem (2014) Optimization Letters, 8 (8), pp. 2203-2210;
cell formation problem. Models, algorithms, and technologies for network analysis
(2013) Springer Proceedings in Mathematics & Statistics, 59, pp. 43-69;
Carrie, S., Numerical taxonomy applied to group technology & plant layout (1973)
Chandrasekaran, M.P., Rajagopalan, R., An ideal seed nonhierarchical clustering
Research, 24, pp. 451-463;
clustering of group technology (1986) International Journal of Production Research,
24 (5), pp. 1221-1233;
pp. 1325-1337;
Dasgupta, D., Ji, Z., Gonzalez, F., Artificial immune systems research in the last
five years (2003) Proceedings of the 2003 Congress on Evolutionary Computation
Conference. Canberra. Australia, pp. 123-130., December 8–13;
de Castro, L., von Zuben, F.J., Artificial immune systems: Part I: Basic theory &
applications (1999) FEEC Univ. Campnas, Campinas, Brasil, ,
ftp://ftp.dca.fee.unicamp.br/pub/docs/vonzuben/tr_dca/trdca0199.pdf, Last accessed
January 2018;
Dimopoulos, C., Zalzala, A., Recent developments in evolutionary computation for
manufacturing optimization: problems, solutions, and comparisons (2000) IEEE
Transactions on Evolutionary Computatio, 4 (2), pp. 93-113;
Farahani, M.H., Hosseini, L., An ant colony optimization for the machine-part cell
formation problem (2011) International Journal of Computational Intelligence
Systems, 4, pp. 486-496;
Goldberg, D.E., (1989) Genetic algorithms: Search, optimization and machine
learning, , Addison-Wesley Longman Publishing Co. Inc., Boston, MA;
Ham, I., Hitomi, K., Yoshida, T., Layout planning for group technology. In Group
technology (1985) International Series in Management Science/Operations Research,
pp. 153-169., Dordrecht: Springer;
under random product demand (1994) International Journal of Production Research, 32
(1), pp. 47-64;
Hyer, N., Wemmerlov, U., Group technology and productivity (1984) Harvard Business
Review, 62 (4), pp. 140-149;
Islam, K.M.S., Sarker, B.R., A similarity coefficient measure and machine parts
Islier, A.A., Group technology by ants (2005) International Journal of Production
Research, 43 (5), pp. 913-932;
James, T., Brown, E.C., Keeling, K.B., A hybrid grouping genetic algorithm for the
cell formation problem (2007) Computers and Operations Research, 34, pp. 2059-2079;
Joines, J., Culberth, C.T., King, R.E., Manufacturing cell design: an integer
85;
Kamel, M., Ghenniwa, H., Liu, T., Machine assignment and part-families formation
using group technology (1994) Journal of Intelligent Manufacturing, 5, pp. 225-234;

Research, 18 (2), pp. 213-232;
pp. 117-133;
397;
1715-1728;
2633-2646;
Lee, H., Malavi, C.O., Ramachandran, S., A self-organizing neural network approach
for the design of cellular manufacturing systems (1992) Journal of Intelligent
Li, M.L., The algorithm for integrating all incidence matrices in multidimensional
group technology (2003) International Journal Production Economics, 86, pp. 121-
131;
Malavi, C.O., Ramachandran, S., Neural network-based design of cellular
1009;
Moon, Y.B., Establishment of a neurocomputing model for part family/machine group
identification (1992) Journal of Intelligent Manufacturing, 3, pp. 173-182;
Mosier, C.T., Taube, L., The facets of group technology & their impact on
Nagi, R., Harhalakis, G., Proth, J.M., Multiple routeings and capacity
Nair, G.J., Accord: A bicriterion algorithm for cell formation using ordinal and
ratio level data (1999) International Journal of Production Research, 37 (3), pp.
539-556;
Onwubalu, G.C., Design of parts for cellular manufacturing using neural network-
based approach (1999) Journal of Intelligent Manufacturing, 10, pp. 251-265;
Onwubalu, G.C., Mutingi, M., A genetic algorithm approach to cellular manufacturing
Pa Rkin, R.E., Li, M.L., The multi-dimensional aspects of a group technology
algorithm (1997) International Journal of Production Research, 35 (8), pp. 2345-
2358;
Papaionnaou, G., Wilson, J.M., The evolution of cell formation problem
methodologies based on recent studies (1997–2008): Review and directions for future
block diagonal forms (1998) International Journal of Production Research, 36 (11),
pp. 3217-3222;
Sarker, B.R., Khan, M., A comparison of existing grouping eciency measures and a
new weighted grouping eciency measure (2001) IIE Transactions, 33, pp. 11-27;
419-426;
Seifoddini, H., Djassemi, M., The production data based similarity coefficient
versus Jaccard’s similarity coefficient (1991) Computers Industrial Engineering,
21, pp. 263-266;
Research, 34 (12), pp. 3401-3416;
Transactions, 27 (1), pp. 43-59;
Research, 32 (9), pp. 2149-2158;
Research, 28 (1), pp. 145-152;
Talbi, E., (2009) Metaheuristics: From design to implementation, p. 267., Wiley,
New Jersey;
pp. 1989-2007;
Ulutas, B., Sarac, T., A clonal selection algorithm for cell formation problem with
alternative routings (2009) 4 Th International Conference of Group
Technology/Cellular Manufacturing 2009 (GT/CM 2009), pp. 10-14., 16–18 February
2009, Japan, Kitakyishu;
Ulutas, B., Assessing the number of cells for a cell formation problem (2015) IFAC
Proceedings Volumes, 48 (3), pp. 1122-1127;
Ulutas, H.B., Islier, A.A., A parameter setting for clonal selection algorithm in
facility layout problems (2007) LNCS Springer, pp. 886-899., Gervasi O, Gavrilova
M, (eds), Springer, Berlin: 4705/2007;
Ulutas, H.B., Islier, A.A., A clonal selection algorithm for dynamic facility
layout problems (2009) Journal of Manufacturing Systems, 28 (4), pp. 123-131;
Ulutas, B., Islier, A.A., (2009) The performance of clonal selection algorithm for
cell formation problem compared to other nature based methods, 4th International
Conference of Group Technology/Cellular Manufacturing 2009 (GT/CM 2009), 16–18
February 2009, pp. 15-22., Kitakyishu, Japan;
Ulutas, B.H., Kulturel-Konak, S., A review of clonal selection algorithm and its
applications (2011) Artificial Intelligence Review, 36 (2), pp. 117-138;
Ulutas, H.B., Kulturel-Konak, S., An artificial immune system based algorithm to
solve unequal area facility layout problem (2012) Expert Systems with Applications,
39 (5), pp. 5384-5395;
Ulutas, H.B., Kulturel-Konak, S., Assessing hypermutation operators of clonal
selection algorithm for the unequal area facility layout problem (2013) Engineering
Optimization, 45 (3), pp. 375-395;
Viswanathan, S., A new approach for solving the P-median problem in group
2700;
Waghodekar, P.H., Sahu, S., Machine-component cell formation in group technology,
Wemmerlov, U., Hyer, N., Cellular manufacturing in the US industry: a survey of
Engineering, 32 (1), pp. 207-220;
Xiangyong, L., Baki, M.F., Aneja, Y.P., An ant colony optimization metaheuristic
for machine-part cell formation problem (2010) Computers and Operations Research,
37, pp. 2071-2081;
modified ART1 method (2008) European Journal of Operations Research, 188 (1), pp.
140-152;
pp. 829-853;
Research, 35 (10), pp. 2773-2792;
CORRESPONDENCE ADDRESS: Ulutas, B.H.; Department of Industrial Engineering,
Eskisehir Osmangazi UniversityTurkey; email: [email protected]
ISSN: 09565515
CODEN: JIMNE
SOURCE: Scopus
Buruk Sahin, Y., Alpay, S.

57190608797;23090108500;
A metaheuristic approach for a cubic cell formation problem
(2016) Expert Systems with Applications, 65, pp. 40-51. Cited 7 times.
84981531919&doi=10.1016%2fj.eswa.2016.08.034&partnerID=40&md5=7c1e855d361bb350d9635
b53ec1ee1eb
DOI: 10.1016/j.eswa.2016.08.034
Eskisehir, Turkey
ABSTRACT: The minimizations of voids and exceptional elements by considering the
part-machine incidence matrix of the cell formation problem have been discussed in
the literature. In recent years, a few mathematical models considering the
assignment of workers to cells in addition to part and machine have been proposed
to fully utilize manufacturing systems. Although the proposed mathematical models
can produce the best solutions for small sized problems within reasonable times,
they are inadequate to produce the best solutions for large sized real life cases
due to the NP-hard nature of the problem. In this study, a genetic algorithm has
been proposed for the problem of part-machine-worker cell formation. Furthermore,
the Taguchi method, as a statistical optimization technique, has been used to
determine the appropriate levels of the parameters. The performance of the proposed
genetic algorithm has been tested using test data from the literature for small
sized problems and using data that was generated in this study for large sized
problems. The experimental results of this study show that the proposed genetic
algorithm can produce the optimal solutions for small sized problems and that the
proposed algorithm can yield optimal or near-optimal solutions for large sized
problems within reasonable times. © 2016 Elsevier Ltd
AUTHOR KEYWORDS: Cellular manufacturing system; Genetic algorithm; Mathematical
model; Part-machine-worker cell formation
Mathematical models; Optimal systems; Optimization; Taguchi methods, Cell
formation; Cell formation problem; Exceptional elements; Incidence matrices; Meta-
heuristic approach; Near-optimal solutions; Optimal solutions; Statistical
optimization, Cellular manufacturing
REFERENCES: Aalaei, A., Shavazipour, B., The tchebycheff norm for ranking dmus in
cellular manufacturing systems with assignment worker (2013) International Journal
of Applied Operational Research, 3 (3), pp. 41-57;
Andres, C., Lozano, S., A particle swarm optimization algorithm for part–machine
grouping (2006) Robotics and Computer-Integrated Manufacturing, 22 (5), pp. 468-
474;
Anvari, M., Mehrabad, M.S., Barzinpour, F., Machine–part cell formation using a
hybrid particle swarm optimization (2010) The International Journal of Advanced
Aryanezhad, M., Deljoo, V., Mirzapour Al-e-Hashem, S., Dynamic cell formation and
the worker assignment problem: a new model (2009) The International Journal of
formation with operator assignment and inter-cell layout problems in a dynamic
environment (2014) Applied Mathematical Modelling, 38 (4), pp. 1237-1254;
Human related issues in manufacturing cell design, implementation, and operation: a
review and survey (2005) Computers & Industrial Engineering, 48 (3), pp. 507-523;
cubic cell formation problem considering different worker skills (2014) Computers &
Candan, G., Yazgan, H.R., Genetic algorithm parameter optimisation using Taguchi
method for a flexible manufacturing system scheduling problem (2015) International
Chakrabortty, R., Hasin, M., Solving an aggregate production planning problem by
using multi-objective genetic algorithm (MOGA) approach (2013) International
Journal of Industrial Engineering Computations, 4 (1), pp. 1-12;
considerations (2011) Computers & Industrial Engineering, 60 (1), pp. 7-15;
Črepinšek, M., Liu, S.-H., Mernik, M., Exploration and exploitation in evolutionary
algorithms: a survey (2013) ACM Computing Surveys (CSUR), 45 (3), p. 35;
Economics, 103 (2), pp. 767-783;
Research, 44 (12), pp. 2421-2444;
Deljoo, V., Mirzapour Al-e-hashem, S., Deljoo, F., Aryanezhad, M., Using genetic
Modelling, 34 (4), pp. 1078-1092;
Egilmez, G., Erenay, B., Süer, G.A., Stochastic skill-based manpower allocation in
a cellular manufacturing system (2014) Journal of Manufacturing Systems, 33 (4),
pp. 578-588;
Ertay, T., Ruan, D., Data envelopment analysis based decision model for optimal
operator allocation in CMS (2005) European Journal of Operational Research, 164
(3), pp. 800-810;
Gen, M., Cheng, R., Genetic algorithms and engineering optimization (Vol. 7)
(2000), John Wiley & Sons; Ghosh, T., Dan, P., Sengupta, S., Chattopadhyay, M.,
Genetic rule based techniques in cellular manufacturing (1992-2010): A systematic
survey (2010) International Journal of Engineering, Science and Technology, 2 (5),
pp. 198-215;
Golberg, D.E., Genetic algorithms in search, optimization, and machine learning
(1989), Addion Wesley Longman Publishing Co., Inc New York, NY, USA;
Gopalakrishnan, H., Kosanovic, D., Operational planning of combined heat and power
plants through genetic algorithms for mixed 0–1 nonlinear programming (2015)
Groover, M.P., Automation, production systems, and computer-integrated
manufacturing (2007), Prentice Hall Press Upper Saddle River, NJ, USA; Hamedi, M.,
Esmaeilian, G., Ismail, N., Ariffin, M., Capability-based virtual cellular
manufacturing systems formation in dual-resource constrained settings using Tabu
Search (2012) Computers & Industrial Engineering, 62 (4), pp. 953-971;
Hansheng, L., Lishan, K., Balance between exploration and exploitation in genetic
search (1999) Wuhan University Journal of Natural Sciences, 4 (1), pp. 28-32;
Harik, G.R., Lobo, F.G., A parameter-less genetic algorithm (1999) GECCO, 99, pp.
258-267;
Holland, J.H., Adaptation in natural and artificial systems: an introductory
analysis with applications to biology, control, and artificial intelligence (1975),
U Michigan Press Oxford, England; Hosseinabadi Farahani, M., Hosseini, L., An Ant
Colony Optimization Approach for the Machine–Part Cell Formation Problem (2011)
International Journal of Computational Intelligence Systems, 4 (4), pp. 486-496;
Flexible Automation and Intelligent Manufacturing, 3 (3-4), pp. 161-200;
Kesen, S.E., Das, S.K., Güngör, Z., A genetic algorithm based heuristic for
scheduling of virtual manufacturing cells (VMCs) (2010) Computers & Operations
Research, 37 (6), pp. 1148-1156;
Kucukkoc, I., Karaoglan, A.D., Yaman, R., Using response surface design to
determine the optimal parameters of genetic algorithm and a case study (2013)
Li, M., The algorithm for integrating all incidence matrices in multi-dimensional
group technology (2003) International Journal of Production Economics, 86 (2), pp.
121-131;
machine–part cell formation problems (2010) Computers & Operations Research, 37
(12), pp. 2071-2081;
Liu, C., Wang, J., Leung, J.Y.-T., Worker assignment and production planning with
learning and forgetting in manufacturing cells by hybrid bacteria foraging
algorithm (2016) Computers & Industrial Engineering, 96, pp. 162-179;
Liu, C., Wang, J., Leung, J.Y.-T., Li, K., Solving cell formation and task
scheduling in cellular manufacturing system by discrete bacteria foraging algorithm
and worker assignment (2010) Computers & Mathematics with Applications, 60 (4), pp.
1014-1025;
Mahdavi, I., Aalaei, A., Paydar, M.M., Solimanpur, M., Multi-objective cell
formation and production planning in dynamic virtual cellular manufacturing systems
system (2012) Journal of Manufacturing Systems, 31 (2), pp. 214-223;
Metternich, J., Bechtloff, S., Seifermann, S., Efficiency and Economic Evaluation
of Cellular Manufacturing to Enable Lean Machining (2013) Procedia CIRP, 7, pp.
592-597;
Min, H.K., Shin, D.Y., Simultaneous formation of machine and human cells in group
technology: A multiple objective approach (1993) International Journal of
Niakan, F., Baboli, A., Moyaux, T., Botta-Genoulaz, V., A bi-objective model in
sustainable dynamic cell formation problem with skill-based worker assignment
Nikoofarid, E., Aalaei, A., Production planning and worker assignment in a dynamic
virtual cellular manufacturing system (2012) International Journal of Management
Science and Engineering Management, 7 (2), pp. 89-95;
Nouri, H., Hong, T.S., Development of bacteria foraging optimization algorithm for
cell formation in cellular manufacturing system considering cell load variations
Nourie, H., Tang, S.H., Tuah, B.H., Ariffin, M., Samin, R., Metaheuristic
techniques on cell formation in cellular manufacturing system (2013) Journal of
Automation and Control Engineering, 1 (1), pp. 49-54;
Peker, A., Kara, Y., Parameter setting of the Fuzzy ART neural network to part–
42 (6), pp. 1257-1278;
Prabhaharan, G., Asokan, P., Girish, B., Muruganandam, A., Machine cell formation
for cellular manufacturing systems using an ant colony system approach (2005) The
1019;
(4), pp. 2308-2316;
statistical review of the literature (1965–1995) (1997) Operations research, 45
(4), pp. 508-520;
(9-12), pp. 1635-1652;
Safaei, N., Saidi-Mehrabad, M., Jabal-Ameli, M., A hybrid simulated annealing for
Saxena, L.K., Jain, P.K., Dynamic cellular manufacturing systems design—a
comprehensive model (2011) The International Journal of Advanced Manufacturing
Technology, 53 (1-4), pp. 11-34;
Shahnaghi, K., Shahmoradi-Moghadam, H., Noroozi, A., Mokhtari, H., A robust
modelling and optimisation framework for a batch processing flow shop production
system in the presence of uncertainties (2016) International Journal of Computer
Integrated Manufacturing, 29 (1), pp. 92-106;
Shiyas, C., Pillai, V.M., A mathematical programming model for manufacturing cell
formation to develop multiple configurations (2014) Journal of Manufacturing
Systems, 33 (1), pp. 149-158;
European journal of operational research, 69 (3), pp. 284-291;
Süer, G.A., Bera, I.S., Optimal operator assignment and cell loading when lot-
splitting is allowed (1998) Computers & Industrial Engineering, 35 (3), pp. 431-
434;
Süer, G.A., Cosner, J., Patten, A., Models for cell loading and product sequencing
in labor-intensive cells (2009) Computers & Industrial Engineering, 56 (1), pp. 97-
105;
scatter search (2012) Journal of Intelligent Manufacturing, 23 (4), pp. 1127-1139;
(3), pp. 1609-1617;
Yang, M., Yang, J., Machine-part cell formation in group technology using a
modified ART1 method (2008) European Journal of Operational Research, 188 (1), pp.
140-152;
Zolfaghari, S., Liang, M., Comprehensive machine cell/part family formation using
genetic algorithms (2004) Journal of Manufacturing Technology Management, 15 (6),
pp. 433-444
CORRESPONDENCE ADDRESS: Buruk Sahin, Y.; Department of Industrial Engineering,
Eskisehir Osmangazi UniversityTurkey; email: [email protected]
ISSN: 09574174
CODEN: ESAPE
SOURCE: Scopus
56241400000;16643276600;
A Heuristic Approach for Machine Cell Formation Problems with Alternative Routings
(2016) Procedia Computer Science, 89, pp. 228-242. Cited 4 times.
84986548159&doi=10.1016%2fj.procs.2016.06.049&partnerID=40&md5=6e2c8c82b059ec331445
e75a4419c301
DOI: 10.1016/j.procs.2016.06.049
AFFILIATIONS: Jadavpur University, Kolkata, 700 032, India
ABSTRACT: Cell Formation (CF) is an important problem in today's automated batch
type production systems. It reduces material handling cost, processing time, labor
requirement, in-process inventories, number of set-ups, simplifies process plan,
and increases quality of product. Manufacturing equipments of automated
manufacturing systems are highly multifunctional. As a result, production processes
can be done by multiple process routes. Optimum cell formation can lead to more
independent cells and less intercellular movement of parts. Previous research
reveals that most of the researchers considered single route, unique volume of
parts, non-sequential Cell Formation Problem (CFP). However, intercellular
movements of parts depend on parts volume, sequence of processes, and routes. In
this paper, a heuristic approach based on Euclidean Distance matrix is proposed for
CF in multiple routes, process sequential and parts volume (included with batch
size and number of batches) problems. Computational experiments were performed with
five benchmark problem sets taken from the literature and the results demonstrate
that the performances of the proposed heuristic in terms of intercellular movements
of parts are either better than or competitive with the well-known existing
algorithms. © 2016 The Authors. Published by Elsevier B.V. This is an open access
article under the CC BY-NC-ND license.
AUTHOR KEYWORDS: Internet of Things (IOT); Open Flow; SDN Controller; Software
Defined Network (SDN)
INDEX KEYWORDS: Cells; Cytology; Data mining; Heuristic algorithms; Heuristic
methods; Image processing; Manufacture; Materials handling; Signal processing;
Warehouses, Automated manufacturing systems; Computational experiment; Euclidean
distance matrices; Internet of Things (IOT); Machine cell formation problems;
Manufacturing equipment; Material handling costs; Open flow, Cellular manufacturing
REFERENCES: Spiliopoulos, K., Sofianopoulou, S., Manufacturing Cell Design with
Alternative Routings in Generalized Group Technology: Reducing Complexity of
Solution Space (2007) Int. J. Prod. Res., 45, pp. 1355-1367;
Ballakur, A., Steudal, H.J., A Within-Cell Utilization Based Heuristic for
Designing Cellular Manufacturing Systems (1987) Int. J. Prod. Res., 25, pp. 639-
665;
Farouq, A., Clustering Algorithm for Solving Group Technology Problem with Multiple
Process Routings (2013) Comput. Ind. Eng., 66, pp. 781-790;
Suer, G.A., Huang, J., Maddisetty, S., Design of Dedicated, Shared and Reminder
Cells in a Probabilistic Demand Environment (2011) Int. J. Prod. Res., 48, pp.
5613-5646;
Hwang, H., Ree, P., Routes Selection for the Cell Formation Problem with
Alternative Part Process Plans (1996) Comput. Ind. Eng., 30, pp. 423-431;
McAuley, J., Machine Grouping for Efficient Production (1972) The Production
Seifoddini, H., Single Linkage Versus Average Linkage Clustering in Machine Cells
Formation Applications (1989) Comput. Ind. Eng., 16, pp. 419-426;
Gupta, T., Seifoddini, H., Production Data Based Similarity Coefficient for Machine
Component Grouping Decisions in the Design of Cellular Manufacturing System (1990)
Int. J. Prod. Res., 28, pp. 1247-1269;
Srinivasan, G., Narendran, T.T., GRAFICS - A Nonhierarchical Clustering Algorithm
for Group Technology (1991) Int. J. Prod. Res., 29, pp. 463-478;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC - An Algorithm for Concurrent
Formation of Part-families and Machine-Cells (1987) Int. J. Prod. Res., 25, pp.
835-850;
King, J.R., Machine-Component Grouping in Production Flow Analysis: An Approach
Using a Rank Order Clustering Algorithm (1980) Int. J. Prod. Res., 18, pp. 213-232;

Clustering for Group Technology (1986) Int. J. Prod. Res., 24, pp. 1221-1233;
Reorganization by a Clustering Technique (1972) Operations Research, 20, pp. 993-
1009;
Chan, H., Milner, D., Direct Clustering Algorithm for Group Formation in Cellular
Manufacture (1982) Journal of Manufacturing Systems, 1, pp. 65-75;
Saeed, J., Ameli, M., Arkat, J., Cell Formation with Alternative Process Routings
and Machine Reliability Consideration (2008) The Int. J. Adv. Manuf. Technol., 35,
pp. 761-768;
Kusiak, A., Cho, M., Similarity Coefficient Algorithm for Solving the Group
Technology Problem (1992) Int. J. Prod. Res., 30, pp. 2633-2646;
Chow, W.S., Hawaleshka, O., An Effective Algorithm for Solving the Machine Chaining
Problem in Cellular Manufacturing (1992) Comput. Ind. Eng., 22, pp. 95-100;
Gupta, T., Design of Manufacturing Cells for Flexible Environment Considering
Alternative Routing (1993) Int. J. Prod. Res., 31, pp. 1259-1273;
Wafik, Y., Kim, S., Multiple Criteria Clustering Algorithm for Solving the Group
Technology Problem with Multiple Process Routings (1997) Comput. Ind. Eng., 32, pp.
207-220;
Yin, Y., Yasuda, K., Manufacturing Cells Design of Various Production Factors
(2002) Int. J. Prod. Res., 40, pp. 885-906;
Sofianopoulou, S., Manufacturing Cells Design with Alternative Process Plans and/or
Replicate Machines (1999) Int. J. Prod. Res., 37, pp. 707-720;
Chu, C., Hayya, J.C., A Fuzzy Clustering Approach to Manufacturing Cell Formation
(1991) Int. J. Prod. Res., 29, pp. 1475-1487;
Chung, S.H., Wu, T.H., Chang, C.C., An Efficient Tabu Search Algorithm to the Cell
Formation Problem with Alternative Routings and Machine Reliability Considerations
(2011) Comput. Ind. Eng., 60, pp. 7-15;
Saeidi, S., Solimanpur, M., Mahdavi, I., Javadian, N., A Multi-Objective Genetic
Algorithm for Solving Cell Formation Problem Using a Fuzzy Goal Programming
Approach (2014) Int. J. Adv. Manuf. Technol., 70, pp. 1635-1652;
Garbie, I.H., Parsaei, H.R., Leep, H.R., Introducing New Parts into Existing
Cellular Manufacturing Systems Based on a Novel Similarity Coefficient (2005) Int.
J. Prod. Res., 43, pp. 1007-1037;
Wafik, H., Faouzi, M., Mohamed, H., Formation of Machine Groups and Part Families
in Cellular Manufacturing Systems Using a Correlation Analysis Approach (2008) Int.
J. Adv. Manuf. Technol., 36, pp. 1157-1169;
Wafik, Y., Lee, K.C., Group Technology Cell Formation Considering Operation
Sequences and Production Volumes (1991) Int. J. Prod. Res., 39, pp. 2755-2768;
Kumar, S., Sharma, R.K., Cell Formation Heuristic Procedure Considering Production
Data (2014) International Journal of Production Management and Engineering, 2, pp.
75-84;
Nair, G.J., Narendran, T.T., Case: A Clustering Algorithm for Cell Formation with
Sequence Data (1998) Int. J. Prod. Res., 36, pp. 157-179;
Alhourani, F., Seifoddini, H., Machine Cell Formation for Production Management in
Cellular Manufacturing Systems (2007) Int. J. Prod. Res., 45, pp. 913-934
CORRESPONDENCE ADDRESS: Hazarika, M.; Jadavpur UniversityIndia; email:
[email protected]
EDITORS: Iyengar S.S., Venugopal K.R., Raja K.B., Buyya R., Patnaik L.M., Deepa
Shenoy P.
PUBLISHER: Elsevier B.V.
ISSN: 18770509
ABBREVIATED SOURCE TITLE: Procedia Comput. Sci.
SOURCE: Scopus
Tavakkoli-Moghaddam, R., Safaei, N., Babakhani, M.

56491438400;8886880300;13606700900;
Solving a dynamic cell formation problem with machine cost and alternative process
plan by memetic algorithms
33646749725&doi=10.1007%2f11571155_18&partnerID=40&md5=155218e008e441a758ec07f3f749
4f63
DOI: 10.1007/11571155_18
University of Tehran, P.O. Box: 11365/4563, Tehran, Iran;
P.C. 16846/13114, Tehran, Iran
ABSTRACT: In this paper, we present a new model of a cell formation problem (CFP)
for a multi-period planning horizon where the product mix and demand are different
in each period, but they are deterministic. As a consequence, the formed cells in
the current period may be not optimal for the next period. This evolution results
from reformulation of part families, manufacturing cells, and reconfiguration of
the CFP as required. Reconfiguration consists of reforming part families, machine
groups, and machine relocations. The objective of the model is to determine the
optimal number of cells while minimizing the machine amortization/relocation costs
as well as the inter-cell movements in each period. In the proposed model, parts
have alternative process plans, operation sequence, and produce as batch. The
machine capacity is also limited and machine duplication is allowed. The proposed
model for real-world instances cannot be solved optimally within a reasonable
amount of computational time. Thus, we propose an efficient memetic algorithm (MA)
with a simulated annealing-based local search engine for solving the proposed
model. This model is solved optimally by the Lingo software then the optimal
solution is compared with the MA implementation. © Springer-Verlag Berlin
Heidelberg 2005.
AUTHOR KEYWORDS: Alternative process plan; Dynamic cell formation; Machine
relocation; Memetic algorithm
INDEX KEYWORDS: Algorithms; Computer software; Costs; Search engines; Simulated
annealing; Strategic planning, Alternative process plan; Cell formation problem
(CFP); Dynamic cell formation; Machine amortization; Machine relocation; Memetic
algorithm (MA); Relocation costs, Problem solving
REFERENCES: Wemmerlov, U., Hyer, N., Cellular manufacturing in the US industry: A
survey of users (1989) Int. J. of Production Research, 27, pp. 1511-1530;
integrating the cell design and production planning decision (2000) Int. J. of
Chen, M., A model for integrated production planning in cellular manufacturing
systems (2001) Integrated Manufacturing Systems, 12, pp. 275-284;
Foulds, L.R., Neumann, K., Techniques for machine group formation in manufacturing
cells (2003) Mathematical and Computer Modeling, 38, pp. 623-635;
(1991) J. of Operations Management, 10, pp. 28-43;
Wilhelm, W., Chou, C., Chang, D., Integrating design and planning considerations in
cell formation (1998) Annals of Operations Research, 77, pp. 97-107;
cell formation condition (1998) Annals of Operations Research, 77, pp. 109-128;
Monteruiln, B., Laforge, A., Dynamic layout design given a scenario tree of
probable future (1992) Eur. J. of Operational Research, 63, pp. 271-286;
(1997) J. of Intelligent Manufacturing, 8, pp. 147-156;
Black, J.T., (1991) The Design of the Factory with a Future, , McGraw-Hill, New
York;
Baykasogylu, A., Gindy, N., A simulated annealing algorithm for dynamic layout
Lacksonen, T.A., Static and dynamic layout problems with varying areas (1994) J. of
Lacksonen, T.A., Preprocessing for static and dynamic layout problems (1997) Int.
J. of Production Research, 35, pp. 1095-1106;
flexible cellular manufacturing (1996) Int. J. of Production Planning and Control,
7, pp. 585-593;
formation for group technology applications (1990) Int. J. of Production Research,
28, pp. 185-198;
Caux, C., Bruniaux, R., Pierreval, H., Manufacturing cell formation with
alternative process plans and machine capacity constraints: A new combined approach
(2000) Int. J. of Production Economics, 64, pp. 279-284;
Kollen, A., Pesch, E., Genetic local search in combinatorial optimization (1994)
Discrete Applied Mathematics and Combinatorial Operation Research and Computer
Science, 48, pp. 273-284;
Merz, P., Freisieben, B., Fitness landscapes and memetic algorithm design (1999)
New Ideas in Optimization, , Corne, D., Dorigo, M., Glover, F. (Eds.), McGraw-Hill,
London;
Moscato, P., Cotta, C., A gentle introduction to memetic algorithms (1999) Handbook
of Metaheuristics, pp. 1-56., Glower, F., Kochenberger, G. (Eds.), Kluwer;
Moscato, P., On evolution, search, optimization, genetic algorithms and martial
arts: Toward memetic algorithms (1989) Technical Report, 790., Caltech Concurrent
Computation Program, California Institute of Technology, Pasadena;
Moscato, P., A memetic approach for the traveling salesman problem implementation
of a computational ecology for combinatorial optimization on message-passing
systems (1992) Parallel Computing and Transporter Applications, pp. 176-177.,
Valero, M., Onate, E., Jane, M., Larriba, J.L., Suarez, B. (Eds.), IOS Press,
Amsterdam, The Netherlands;
Dawkins, R., (1976) The Selfish Gene, , Oxford University Press, Oxford;
Moscato, P., Norman, M.G., A memetic approach for the Traveling Salesman Problem
implementation of a computational ecology for combinatorial optimization on
message-passing systems (1992) Parallel Computing and Transporter Applications, pp.
177-186., Valero, M., Onate, E., Jane, M., Larriba, J.L., Suarez, B. (Eds.), IOS
Press, Amsterdam, The Netherlands;
Berretta, R.E., Moscato, P., The number partitioning problem: An open challenge for
evolutionary computation? (1999) New Ideas in Optimization, pp. 261-278., Corne,
D., Glover, F., Dorigo, M. (Eds.), McGraw-Hill, Maidenhead, UK, (Chapter 17);
Holstein, D., Moscato, P., Memetic algorithms using guided local search: A case
study (1999) New Ideas in Optimization, pp. 235-244., Corne, D., Glover, F.,
Dorigo, M. (Eds.), McGraw-Hill, Maidenhead, UK, (Chapter 15);
Merz, P., Analysis of gene expression profiles: An application of memetic
algorithms to the minimum sum-of-squares clustering problem (2003) BioSystems, 72,
pp. 99-109;
Merz, P., Katayama, K., Memetic algorithms for the unconstrained binary quadratic
programming problem (2004) BioSystems, 78, pp. 99-118;
Berrettaa, R., Rodrigues, L.F., A memetic algorithm for a multistage capacitated
lot-sizing problem (2004) Int. J. Production Economics, 87, pp. 67-81;
Lacomme, P., Prins, C., Ramdane, W., Cherif. Competitive memetic algorithms for arc
routing problems (2004) Annals of Operations Research, 131, pp. 159-185;
Buriol, L., Franca, P.M., Moscato, P., A New Memetic Algorithm for the asymmetric
traveling salesman problem (2004) J. of Heuristics, 10, pp. 483-506;
Computation, , Article in press;
Glover, F., Greenberg, H., New approach heuristic search: A bilateral linkage with
artificial intelligence (1989) Eur. J. Oper. Res., 39 (2), pp. 119-130;
Krasnogor, N., (2002) Studies on the Theory and Design Space of Memetic Algorithms,
, Ph.D. dissertation, Univ. of the West of England, Bristol, U.K;
Gen, M., Cheng, R., (1997) Genetic Algorithms and Engineering Design, , New York:
Wiley
Engineering, Faculty of Engineering, University of Tehran, P.O. Box: 11365/4563,
ISSN: 03029743
ISBN: 3540294988; 9783540294986
SOURCE: Scopus
Almonacid, B., Soto, R.

56407124500;24403038600;
Andean Condor Algorithm for cell formation problems
(2019) Natural Computing, 18 (2), pp. 351-381. Cited 2 times.
85064650336&doi=10.1007%2fs11047-018-9675-
0&partnerID=40&md5=af86ca8723be8d8d9e662225baac5519
DOI: 10.1007/s11047-018-9675-0
ABSTRACT: This paper proposes a novel population based optimization algorithm
called Andean Condor Algorithm (ACA) for solving cell formation problems. The ACA
metaheuristic is inspired by the movement pattern of the Andean Condor when it
searches for food. This pattern of movement corresponds to the flight distance
traveled by the Andean Condor from its nest to the place where food is found. This
distance varies depending on the seasons of the year. The ACA metaheuristic
presents a balance of its population through a performance indicator based on the
average quality of the population’s fitness. This balance determines the number of
Andean Condors that will perform an exploration or intensification movements. ACA
metaheuristics have a flexible design. It allows to easily integrate specific
heuristics according to the optimization problem to be solved. Two types of
computational experiments have been performed. According to the results obtained it
has been possible to determine that ACA is an algorithm with an outstanding RPD% in
relation to the algorithms BAT, MBO and PSO, robust and with a convergence which
tends not to be trapped in the local optimums. Besides, according to the non-
parametric multiple comparison, results have been obtained in which the ACA
metaheuristic has significant differences in relation to the BAT, MBO and PSO
algorithms. © 2018, Springer Science+Business Media B.V., part of Springer Nature.
AUTHOR KEYWORDS: Andean Condor Algorithm; Animal behavior; Cell formation
problem; Metaheuristics; Nature-inspired algorithms
INDEX KEYWORDS: Cellular manufacturing; Heuristic algorithms; Particle swarm
optimization (PSO), Animal behavior; Cell formation problem; Computational
experiment; Meta heuristics; Nature inspired algorithms; Optimization problems;
Performance indicators; Population-based optimization, Problem solving, animal
behavior; article; heuristics; season
REFERENCES: Almonacid, B., (2018) Appendix: Andean Condor Algorithm for cell
formation problems, , https://doi.org/10.6084/m9.figshare.5805360, Accessed 21 Jan
2018;
Almonacid, B., (2018) Dataset: Andean Condor Algorithm for cell formation problems,
, https://doi.org/10.6084/m9.figshare.5808780,
https://figshare.com/s/b6dfee83cd7d619339ce . Accessed 21 Jan 2018;
Almonacid, B., Aspée, F., Soto, R., Crawford, B., Lama, J., (2016) Solving
manufacturing cell design problem using modified binary firefly algorithm and
Egyptian vulture optimization algorithm, , IET Software, London;
Badgerow, J.P., Hainsworth, F.R., Energy savings through formation flight? a re-
examination of the vee formation (1981) J Theor Biol, 93 (1), pp. 41-52;
Int J Prod Res, 29 (2), pp. 343-356;
Boctor, F.F., A jinear formulation of the machine-part cell formation problem
(1991) Int J Prod Res, 29 (2), pp. 343-356;
Breves, C., Plumaje de color anormal en Cóndor Andino (Vultur gryphus) en Chile
central. Abnormal plumage color in Andean Condor (Vultur gryphus) in central Chile
(2008) Boletin Chileno de Ornitología, 14 (1), pp. 52-55;
Int J Prod Res, 11 (4), pp. 399-416;
manufacture (1982) J Manuf Syst, 1 (1), pp. 65-75;
Chandrasekar, C., An optimized approach of modified bat algorithm to record
deduplication (2013) Int J Comput Appl, 62 (1), pp. 10-15;
Chandrasekharan, M., Rajagopalan, R., Modroc: an extension of rank order clustering
Chandrasekharan, M., Rajagopalan, R., Zodiac-an algorithm for concurrent formation
of part-families and machine-cells (1987) Int J Prod Res, 25 (6), pp. 835-850;
Chandrasekharan, M., Rajagopalan, R., Groupabil1ty: an analysis of the properties
1035-1052;
manufacturing cell design problems: Cp vs mh (2014) International Conference on
human–computer Interaction, pp. 498-502., Springer;
Donázar, J., Feijóo, J.E., Social structure of Andean Condor roosts: influence of
sex, age, and season (2002) The Condor, 104 (4), p. 832;
Duman, E., Uysal, M., Alkaya, A.F., Migrating birds optimization: a new
Inf Sci, 217, pp. 65-77;
Fister, I., Rauter, S., Yang, X.S., Ljubič, K., Planning the sports training
sessions with the bat algorithm (2015) Neurocomputing, 149, pp. 993-1002;
Gaing, Z.L., Particle swarm optimization to solving the economic dispatch
considering the generator constraints (2003) IEEE Trans Power Syst, 18 (3), pp.
1187-1195;
Gao, X., Alvo, M., Nonparametric multiple comparison procedures for unbalanced two-
way layouts (2008) J Stat Plan Inference, 138 (12), pp. 3674-3686;
Gao, X., Alvo, M., Chen, J., Li, G., Nonparametric multiple comparison procedures
for unbalanced one-way factorial designs (2008) J Stat Plan Inference, 138 (8), pp.
2574-2591;
Hollander, M., Wolfe, D.A., Chicken, E., (2013) Nonparametric statistical
methods, , Wiley, New York;
von vögeln (1989) Journal für Ornithologie, 130 (1), pp. 15-24;
Kennedy, J., Particle swarm optimization (2011) Encyclopedia of machine learning,
pp. 760-766., Sammut C, Webb G, (eds), Springer, Berlin;
Kennedy, J., Eberhart, R., Particle swarm optimization (1995) IEEE International
Conference on Neural Networks, 1995. Proceedings, 4, pp. 1942-1948;

Kumar, K.R., Vannelli, A., (1986) Strategic Subcontracting for Efficient
Disaggregated Manufacturing, , BEBR faculty working paper no. 1252;
manufacturing systems (1986) Eur J Oper Res, 24 (3), pp. 387-397;
Manuf Syst, 6 (2), pp. 117-124;
Lambertucci, S.A., Trejo, A., Di Martino, S., Sánchez-zapata, J.A., Donázar, J.A.,
Hiraldo, F., Spatial and temporal patterns in the diet of the Andean condor:
ecological replacement of native fauna by exotic species (2009) Anim Conserv, 12
(4), pp. 338-345;
Lemma, T.A., Hashim, F.B.M., Use of fuzzy systems and bat algorithm for exergy
modeling in a gas turbine generator (2011) IEEE Colloquium on Humanities, Science
and Engineering (CHUSER), 2011. IEEE, pp. 305-310;
Lissaman, P., Shollenberger, C.A., Formation flight of birds (1970) Science, 168
(3934), pp. 1003-1005;
McGahan, J., Flapping flight of the Andean condor in nature (1973) J Exp Biol, 58,
pp. 239-253;
implementation-a state-of-the-art survey (1985) Omega, 13 (5), pp. 381-391;
Naveda-Rodríguez, A., Andean Condor (Vultur gryphus) in Ecuador: geographic
distribution, population size and extinction risk (2016) PLOS One, 11 (3);
Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.,
Minizinc: towards a standard cp modelling language (2007) Principles and practice
of constraint programming—CP 2007, pp. 529-543., Bessière C, (ed), Springer,
Berlin, Heidelberg;
Niroomand, S., Hadi-Vencheh, A., Şahin, R., Vizvari, B., Modified migrating birds
manufacturing systems (2015) Expert Syst Appl, 42, pp. 6586-6597;
Pan, Q.K., Dong, Y., An improved migrating birds optimisation for a hybrid flowshop
scheduling with total flowtime minimisation (2014) Inf Sci, 277, pp. 643-655;
Park, J.B., Lee, K.S., Shin, J.R., Lee, K.Y., A particle swarm optimization for
economic dispatch with nonsmooth cost functions (2005) IEEE Trans Power Syst, 20
(1), pp. 34-42;
Pavez, E.F., Patrón de movimiento de dos cóndores andinos vultur gryphus (aves:
Cathartidae) en los andes centrales de chile y argentina (2008) Boletín Chileno de
Ornitología, 20 (1-2), pp. 1-12;
Rayner, J., A new approach to animal flight mechanics (1979) J Exp Biol, 80 (1),
pp. 17-54;
Reddy, V.U., Manoj, A., Optimal capacitor placement for loss reduction in
distribution systems using bat algorithm (2012) IOSR J Eng, 2 (10), pp. 23-27;
Robinson, J., Rahmat-Samii, Y., Particle swarm optimization in electromagnetics
(2004) IEEE Trans Antennas Propag, 52 (2), pp. 397-407;
Royston, J.P., An extension of Shapiro and Wilk’s W test for normality to large
samples (1982) J R Stat Soc Ser C (Appl Stat), 2, pp. 115-124;
Royston, J.P., Algorithm as 181: the w test for normality (1982) J R Stat Soc Ser C
(Appl Stat), 31 (2), pp. 176-180;
Royston, P., Approximating the Shapiro–Wilk W-test for non-normality (1992) Stat
Comput, 2 (3), pp. 117-119;
Royston, P., Remark as r94: a remark on algorithm as 181: the w-test for normality
(1995) J R Stat Soc Ser C (Appl Stat), 44 (4), pp. 547-551;
Salman, A., Ahmad, I., Al-Madani, S., Particle swarm optimization for task
assignment problem (2002) Microprocessors Microsyst, 26 (8), pp. 363-371;
27 (7), pp. 1161-1165;
Selvakumar, A.I., Thanushkodi, K., A new particle swarm optimization solution to
nonconvex economic dispatch problems (2007) IEEE Trans Power Syst, 22 (1), pp. 42-
51;
Shen, L., Asmuni, H., Weng, F., A modified migrating bird optimization for
university course timetabling problem (2014) Jurnal Teknologi, 72 (1), pp. 89-96;
satisfiability (2012) Expert Syst. Appl., 39 (13), pp. 11423-11427;
International Conference on Industrial, Engineering and Other Applications of
Applied Intelligent Systems, pp. 400-406., Springer;
algorithm for machine-part cell formation problems (2015) Advances in artificial
intelligence and soft computing, pp. 270-281., (, a,),. In:,. Springer;
problems using an artificial fish swarm algorithm (2015) Mexican International
Soto, R., Crawford, B., Alarcón, A., Zec, C., Vega, E., Reyes, V., Araya, I.,
Olguín, E., Solving manufacturing cell design problems by using a bat algorithm
approach (2016) International Conference in Swarm Intelligence, pp. 184-191.,
Springer;
Soto, R., Crawford, B., Almonacid, B., Efficient leader exchange for migrating
birds optimization when solving machine-part cell formation problems (2016) 11Th
Iberian Conference on Information Systems and Technologies (CISTI), 2016. IEEE, pp.
1-7;
(2016) Sci Program, 2016, p. 21;
Soto, R., Crawford, B., Carrasco, C., Almonacid, B., Reyes, V., Araya, I., Misra,
S., Olguín, E., Solving manufacturing cell design problems by using a dolphin
echolocation algorithm (2016) International Conference on Computational Science and
Its Applications, pp. 77-86., Springer;
Soto, R., Crawford, B., Castillo, C., Paredes, F., Solving the manufacturing cell
design problem via invasive weed optimization (2016) Artificial Intelligence
Perspectives in Intelligent Systems, pp. 115-126., Springer;
Soto, R., Crawford, B., Lama, J., Almonacid, B., A firefly algorithm to solve the
manufacturing cell design problem (2016) 11Th Iberian Conference on Information
Systems and Technologies (CISTI), 2016. IEEE, pp. 1-7;
Soto, R., Crawford, B., Vega, E., Johnson, F., Paredes, F., Solving manufacturing
cell design problems using a shuffled frog leaping algorithm (2016) The 1St
International Conference on Advanced Intelligent System and Informatics (AISI2015),
pp. 253-261., 28–30 Nov 2015, Beni Suef, Egypt. Springer;
Speziale, K.L., Lambertucci, S.A., Olsson, O., Disturbance from roads negatively
affects Andean condor habitat use (2008) Biol Conserv, 141 (7), pp. 1765-1772;
Srinlvasan, G., Narendran, T., Mahadevan, B., An assignment model for the part-
Econ, 9 (1), pp. 73-81;
Stuckey, P.J., Feydy, T., Schutt, A., Tack, G., Fischer, J., The MiniZinc challenge
2008–2013 (2014) AI Mag, 35 (2), pp. 55-60;
Tsai, P.W., Pan, J.S., Liao, B.Y., Tsai, M.J., Istanda, V., Bat algorithm inspired
algorithm for solving numerical optimization problems (2012) Applied Mechanics and
Materials, 148, pp. 134-137., Chang G, Trans Tech Publ;
Waghodekar, P., Sahu, S., Machine-component cell formation in group technology:
mace (1984) Int J Prod Res, 22 (6), pp. 937-948;
Yang, X.S., A new metaheuristic bat-inspired algorithm (2010) Nature Inspired
Cooperative Strategies for Optimization (NICSO 2010), pp. 65-74., Springer;
Yang, X.S., Bat algorithm for multi-objective optimisation (2011) Int J Bio Inspir
Comput, 3 (5), pp. 267-274;
Yang, X.S., He, X., Bat algorithm: literature review and applications (2013) Int J
Bio Inspir Comput, 5 (3), pp. 141-149;
Yang, X.S., Hossein Gandomi, A., Bat algorithm: a novel approach for global
engineering optimization (2012) Eng Comput, 29 (5), pp. 464-483;
Zhang, J.W., Wang, G.G., Image matching using a bat algorithm with mutation (2012)
Applied Mechanics and Materials, 203, pp. 88-93., Du Z, Liu B, Trans Tech Publ;
Zhang, B., Pan, Q., Gao, L., Zhang, X., Sang, H., Li, J., An effective modified
migrating birds optimization for hybrid flowshop scheduling problem with lot
streaming (2017) Appl Soft Comput, 52, pp. 14-27
PUBLISHER: Springer Netherlands
ISSN: 15677818
CODEN: NCAOA
ABBREVIATED SOURCE TITLE: Nat. Comput.
SOURCE: Scopus
Karthikeyan, S., Saravanan, M., Rajkumar, M.

57034338500;55410779600;35254197100;
Minimizing production costs in dynamic cellular manufacturing systems of cell
formation problem by using hybrid particle swarm optimization
(2015) International Journal of Applied Engineering Research, 10 (49), pp. 564-568.
84944884835&partnerID=40&md5=ac03b68fb495f369c40988b63779a810
AFFILIATIONS: Department of Mechanical Engineering, Christian College of

Engineering and TechnologyTamil Nadu, India;
Department of Mechanical Engineering, Sri subramanya College of Engineering and
TechnologyTamil Nadu, India;
Department of Mechanical Engineering, RVS College of Engineering and
TechnologyTamil Nadu, India
ABSTRACT: Cellular Manufacturing systems can be defined as an application of the
group Technology (GT) that allows decomposing a manufacturing system into
subsystems to make it easier to manage than the entire manufacturing systems. In
this paper, a method using the concept of particle swarm optimization algorithms is
proposed as an important but simple means of scheduling the manufacturing
operations of dynamic cellular manufacturing systems (DCMS). The mathematical model
developed already defines the characteristics of DCMS, which contains the limits
relate to the manufacturing cost of the several products and the maximum volumes of
the manufacturing resources. The objectives are to set up dynamic cellular
manufacturing cells and to formulate feasible production schedules for all
manufacturing operation, in order to minimize the total sum of the machine purchase
cost, the operating cost, in inter-cell material handling cost and the machine
relocation cost over the planning. A Hybrid based scheduling particle swarm
optimization (HPSO) is proposed as an optimization tool to determine the solution.
The proposed algorithm varies from the conventional algorithm in that the
population of the candidate solution contains of feasibility. The superiority of
the proposed algorithms is demonstrated by solving the production scheduling and
cell formation problem for a dynamic cellular manufacturing system, and the results
are compared with those attained by using an optimization techniques. © Research
India Publications.
AUTHOR KEYWORDS: Cell formation problem; Dynamic cellular manufacturing systems;
Hybrid particle swarm optimization; Production cost
REFERENCES: Ahmed, P., Tavakkoli, R., Moghaddam, N.S., (2004) A Comparision of
Heuristic Methods for Solving a Cellular Manufacturing Model in a Dynamic
Environment, , Bussiness school;
Anandaraman, C., An improved sheep flock heredity algorithm for job shop scheduling
and flow shop scheduling problems (2011) Int J Ind Eng Comp, 2, pp. 749-764;
Dasgupta, D., (2000) Artificial Immune Systems and Their Applications, , Springer
verlag, Berlin Heidelberg;
Decastro, L.N., Timinis, J., (2000) Artificial Immune System: A New Computational
Approach, , Springer-Verlag, London;
De Castro, L.N., Zuben, F., The clonal selection algorithm with engineering
applications Workshop on Artificial System and Their Applications, Workshop
Proceedings of GECCO’00 2000, pp. 36-37., Las Vegas, USA;
El-Baz, M.A., A genetic algorithm for facility layout problems of different
manufacturing environments (2004) Comp & Ind Eng, 47, pp. 233-246;
Ficko, M., Brezoenik, M., Balie, J., Designing the layout of single and multiple-
rows flexible manufacturing system by genetic algorithms (2004) J Mat Proc Tech,
157-158, pp. 150-158;
Francis, R.L., McGinns, L.F., White, J.A., Jr., Facility layout and location 1992.
2nd edn. Prentice Hall, Englewood cliffs, New Jersey; Heargu, S., Alfa, A.S.,
Experimental analysis of simulated annealing based annealing algorithms for the
layout problem (1992) Euro. J. Oper. Res, 57, pp. 190-192;
Heragu, S.S., Kusiak, A., Efficient models for the facility layout problem (1991)
Euro. J. Oper. Res, 53, pp. 1-13;
Kumar, R., Asokan, P., Kumanan, S., Artificial immune system based algorithm to
solve linear and loop layout problems in flexible manufacturing systems (2010) Int
J Prod Dev, 10, pp. 165-179;
Nara, K., Takeyama, T., Kim, H., A new evolutionary algorithm based on sheep flocks
heredity model and its application to scheduling problem (1974) IEEE Transcations,
6, pp. 503-508
PUBLISHER: Research India Publications
ISSN: 09734562
ABBREVIATED SOURCE TITLE: Int. J. Appl. Eng. Res.
SOURCE: Scopus
Shishebori, D., Dehnavi-Arani, S.

25928834300;56521529300;
A multi-stage stochastic programming approach in a dynamic cell formation problem
with uncertain demand: A case study
(2019) International Journal of Supply and Operations Management, 6 (1), pp. 67-87.
85066255782&doi=10.22034%2f2019.1.6&partnerID=40&md5=b0978b6ac0895d24f904788b2d8f1d
4b
DOI: 10.22034/2019.1.6
AFFILIATIONS: Department of Industrial Engineering, Yazd University, Yazd, Iran
ABSTRACT: This paper addresses a dynamic cell formation problem (DCFP) including a
multi-period planning horizon in which demands for each product in each period are
different and uncertain. Because the demand uncertainty is considered as stochastic
data by discrete scenarios on a scenario tree, a multi-stage nonlinear mixed-
integer stochastic programming is applied so that the objective function minimizes
machine purchase costs, the operating costs, both inter and intra-cell material
handling costs, and the machine relocation costs over the planning horizon. The
main goal of the current study is to determine the optimal cell configuration in
each period in order to achieve the total minimum expected costs under the given
constraints. The nonlinear model is transformed into a linear form. That is why
GAMS can provide global optimal solutions in linear models. In order to find the
optimal solutions, by using the GAMS for small and medium-sized problems, the
optimal solutions are obtained. They applied in two bounds, namely the Sum of Pairs
Expected Values (SPEV) and the Expectation of Pairs Expected Value (EPEV). Also,
according to the scenario-based model, the efficiency of two suggested bounds is
shown in terms of the computational time. Finally, a practical case study is
presented in detail to illustrate the application of the proposed model and it's
solving method. The results show the efficiency of using SPEV and EPEV for several
random examples as well as the proposed case study. © 2019 Kharazmi University. All
rights reserved.
AUTHOR KEYWORDS: Dynamic cell formation problem; Expectation of pair expected
value; Multi-stage stochastic programming; Sum of pair expected values
REFERENCES: Aryanezhad, M.B., Deljoo, V., Mirzapour-Al-E-Hashem, S.M.J., Dynamic
cell formation and the worker assignment problem: A new model (2009) The
Arzi, Y., Bukchin, J., Masin, M., An efficiency frontier approach for the design of
cellular manufacturing systems in a lumpy demand environment (2001) European
cellular manufacturing systems (1997) IIE Transactions, 29 (7), pp. 599-610;
objective scatter search for a dynamic cell formation problem (2009) Computers &
Balakrishnan, J., Hung-Cheng, C., Dynamic cellular manufacturing under multiperiod
pp. 516-530;
Birge, J.R., Louveaux, F., (1997) Introduction to Stochastic Programming, , Series
in Operations Research and Financial Engineering;
Bulgak, A.A., Bektas, T., Integrated cellular manufacturing systems design with
production planning and dynamic system reconfiguration (2009) European Journal of
cellular manufacturing environment (1998) Annals of Operations Research, 77, pp.
109-128;
Research, 44 (12), pp. 2421-2444;
Dupačová, J., Consigli, G., Wallace, S.W., Scenarios for multistage stochastic
programs (2000) Annals of Operations Research, 100 (1-4), pp. 25-53;
Farunghi, H., Mostafayi, S., Robust optimization approach for design for a dynamic
cell formation considering labor utilization: Bi-objective mathematical model
(2016) International Journal of Supply and Operations Management, 3 (1), pp. 1143-
1167;
Applications, 38 (3), pp. 2478-2488;
Egilmez, G., Singh, S., Ozguner, O., Cell formation in a cellular manufacturing
system under uncertain demand and processing times: A stochastic genetic algorithm
approach (2017) International Journal of Services and Operations Management, 26
(2), pp. 162-185;
Esmaeilbeigi, R., Naderi, B., Arshadikhamseh, A., Loni, P., An estimated
formulation for the capacitated single allocation p-hub median problem with fixed
costs of opening facilities (2017) International Journal of Supply and Operations
Javadian, N., Aghajani, A., Rezaeian, J., Sebdani, M.J.G., A multi-objective
integrated cellular manufacturing systems design with dynamic system
reconfiguration (2011) The International Journal of Advanced Manufacturing
Technology, 56 (1-4), pp. 307-317;
Kall-Peter, S., Wallace, W., (1994) Stochastic Programming, , Jonh Wiley & Sons,
Chichester;
Kall, P., Mayer, J., (1976) Stochastic Linear Programming, 7., Berlin: Springer-
Verlag;
Kia, R., Khaksar-Haghani, F., Javadian, N., Tavakkoli-Moghaddam, R., Solving a
multi-floor layout design model of a dynamic cellular manufacturing system by an
efficient genetic algorithm (2014) Journal of Manufacturing Systems, 33 (1), pp.
218-232;
simulated annealing (2012) Computers & Operations Research, 39 (11), pp. 2642-2658;
Koushki, F., Performance measurement and productivity management in production

units with network structure by identification of the most productive scale size
pattern (2018) International Journal of Supply and Operations Management, 5 (4),
pp. 379-395;
Maggioni, F., Allevi, E., Bertocchi, M., Measures of information in multistage
stochastic programming (2012) STOPROG-2012-Stochastic Programming for
Implementation and Advanced Applications, pp. 78-82., The Association of Lithuanian
Serials;
Maggioni, F., Allevi, E., Bertocchi, M., Bounds in multistage linear stochastic
programming (2014) Journal of Optimization Theory and Applications, 163 (1), pp.
200-229;
1014-1025;
Mahmoodian, V., Jabbarzadeh, A., Rezazadeh, H., Barzinpour, F., A novel intelligent
particle swarm optimization algorithm for solving cell formation problem (2017)
Neural Computing and Applications, pp. 1-15;
Moslemipour, G., A hybrid CS-SA intelligent approach to solve uncertain dynamic
facility layout problems considering dependency of demands (2018) Journal of
Industrial Engineering International, 14 (2), pp. 429-442;
Rabbani, M., Farrokhi-Asl, H., Ravanbakhsh, M., Dynamic cellular manufacturing
system considering machine failure and workload balance (2019) Journal of
Industrial Engineering International, 15 (1), pp. 25-40;
Rabbani, M., Ravanbakhsh, M., Farrokhi-Asl, H., Taheri, M., Using metaheuristic
algorithms for solving a hub location problem: Application in passive optical
network planning (2017) International Journal of Supply and Operations Management,
4 (1), pp. 15-32;
Rezaie, K., Gereie, A., Ostadi, B., Shakhseniaee, M., Safety interval analysis: A
risk-based approach to specify low-risk quantities of uncertainties for
contractor's bid proposals (2009) Computers & Industrial Engineering, 56 (1), pp.
152-156;
Rheault, M., Drolet, J.R., Abdulnour, G., Dynamic cellular manufacturing system
(DCMS) (1996) Computers & Industrial Engineering, 31 (1-2), pp. 143-146;
subcontracting production planning in dynamic cellular manufacturing systems (2009)
International Journal of Production Economics, 120 (2), pp. 301-314;
(9-10), pp. 1001-1009;
Saxena, L.K., Jain, P.K., An integrated model of dynamic cellular manufacturing and
supply chain system design (2012) The International Journal of Advanced
Shakhsi-Niaei, M., Iranmanesh, S.H., Torabi, S.A., A review of mathematical
optimization applications in oil-and-gas upstream & midstream management (2013)
International Journal of Energy and Statistics, 1 (2), pp. 143-154;
Shishebori, D., Study of facility location-network design problem in presence of
facility disruptions: A case study (research note) (2014) International Journal of
Engineering-Transactions A: Basics, 28 (1), pp. 97-108;
Shishebori, D., Akhgari, M.J., Noorossana, R., Khaleghi, G.H., An efficient
integrated approach to reduce scraps of industrial manufacturing processes: A case
study from gauge measurement tool production firm (2015) The International Journal
Shishebori, D., Ghaderi, A., An integrated approach for reliable facility
location/network design problem with link disruption (2015) International Journal
of Supply and Operations Management, 2 (1), pp. 633-640;
Taboun, S.M., Merchawi, N.S., Ulger, T., Part family and machine cell formation in
multiperiod planning horizons of cellular manufacturing systems (1998) Production
Planning & Control, 9 (6), pp. 561-571;
Computation, 170 (2), pp. 761-780;
formation problem using a scatter search approach (2009) The International Journal
Wang, Y., Tang, J., Cost and service-level-based model for a seru production system
formation problem with uncertain demand (2018) Journal of Systems Science and
Systems Engineering, 27 (4), pp. 519-537;
Wemmerlöv, U., Hyer, N.L., Research issues in cellular manufacturing (1987)
Zarrinpoor, N., An exploration of evolutionary algorithms for a Bi-objective
competitive facility location problem in congested systems (2018) International
Journal of Supply and Operations Management, 5 (3), pp. 266-282;
Zohrevand, A.M., Rafiei, H., Zohrevand, A.H., Multi-objective dynamic cell
formation problem: A stochastic programming approach (2016) Computers & Industrial
s://www.deprem.afad.gov.tr/deprem-bolgeleri-haritasi?lang=enCORRESPONDENCE ADDRESS:
Shishebori, D.; Department of Industrial Engineering, Yazd UniversityIran; email:
[email protected]
PUBLISHER: Kharazmi University
ISSN: 23831359
ABBREVIATED SOURCE TITLE: Int. J. Supply Oper. Manag.
SOURCE: Scopus
Zeb, A., Khan, M., Khan, N., Tariq, A., Ali, L., Azam, F., Jaffery, S.H.I.
57213063927;7410319363;24923195000;55409746600;55646005400;9639414800;55394682600;
problem
2243-2254. Cited 16 times.
84955273172&doi=10.1007%2fs00170-015-8288-
3&partnerID=40&md5=a2f3e61fccda1e6b02a1fce754571f8f
DOI: 10.1007/s00170-015-8288-3
AFFILIATIONS: Department of Engineering Management, College of Electrical and
Mechanical Engineering (EME), National University of Sciences and Technology
(NUST), Islamabad, 44000, Pakistan;
School of Mechanical and Manufacturing Engineering (SMME), National University of
Sciences and Technology (NUST), Sector H-12, Islamabad, 44000, Pakistan;
Department of Mechanical Engineering, Wah Engineering College (WEC), University of
Wah, Wah Cantt, Taxila, Pakistan
ABSTRACT: The grouping of parts and machines into manufacturing cells with the
objective to improve grouping efficacy is the prime focus of cell formation
problem. This paper presents the hybridization of simulated annealing (SA) with
genetic algorithm (GA), where exploration power of GA, to broaden the search space,
is combined with the intensification power of SA. A certain percentage of best
solution in each generation of GA is sent, for further intensification and
trajectory search, to SA. In intensification phase (with SA), Boltzmann probability
distribution functions are used to allow a downhill move, with variable
temperature. Starting temperature is chosen to be a small value with rapid cooling
rate to keep search in a narrow region. If same solution is repeated for a certain
number of generations, then shake-off is given to escape local maxima. During this
shake-off, the SA parameters are relaxed to broaden the search for best
neighbourhood solution. The effectiveness of proposed hybrid heuristic algorithm is
evaluated through 35 benchmark problems from the literature. The GA with
intensification through SA along with shake-off performed well in terms of solution
quality, i.e. produced 24 best results with overall mean of 66.20. The overall
comparative study shows that the proposed approach not only achieves the best
solutions consistently, with minimum computational time, but also improves the
results of two problems (problems 29 and 33), reporting it for the first time. ©
2016, Springer-Verlag London.
AUTHOR KEYWORDS: Cell formation; Genetic algorithm (GA); Group efficacy (GE);
Hybrid heuristic algorithm; Simulated annealing (SA)
INDEX KEYWORDS: Cells; Cellular manufacturing; Cytology; Distribution functions;
Heuristic algorithms; Probability distributions; Simulated annealing, Bench-mark
problems; Boltzmann probability; Cell formation; Cell formation problem;
Comparative studies; Group efficacy (GE); Hybrid heuristic algorithms; Variable
temperature, Genetic algorithms
REFERENCES: Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the US industry: a
survey of users (1989) Int J Prod Res, 27 (9), pp. 1511-1530;
programming for the solution of simple cell formation problems (2001) Comp Ind En,
47, pp. 247-273;
Boulif, M., Atif, K., A new branch and bound enhanced genetic algorithm for the
Hsu, C.P., Similarity coefficient approaches to machine component cell formation in
cellular manufacturing: a comparative study. PhD thesis (2002) Department of
Industrial and System Engineering, , University of Wisconsin, Milwaukee, WI;
Chandrasekharan, M.P., Rajagopalan, R., GROUPABILITY: an analysis of the properties
1035-1052;
Kumar, C., Chandrasekharan, M., Group efficacy: a quantitative criteria for the
goodness of block diagonal; forms of binary matrices in group technology (1990) Int
J Prod Res, 28, pp. 233-243;
Sarker, B., Measure of grouping efficiency in cellular manufacturing systems (2001)
Eur J Oper Res, 130, pp. 588-611;
Ghosh, T., Dan, P.D., Sengupta, S., Chattopadhyay, M., Genetic rule based
techniques in cellular manufacturing (1992–2010): a systematic survey (2010) Int J
Eng Sci Technol, 2 (5), pp. 198-215;
King, J.R., Nakoranchai, V., Machine-component group formation in group technology:
in cellular manufacturing (2001) Comput Ind Eng, 39, pp. 1-17;
57;
Boe, W., Cheng, C.H., A close neighbour algorithm for designing cellular
cellular manufacture (1982) J Manuf Syst, 1, pp. 65-75;
mathematical model for cell formation in cellular manufacturing systems (2011) Int
J Oper Res, 11 (4), pp. 408-424;
Int J Prod Res, 29 (2), pp. 343-356;
Kusiak, A., Chow, W., Efficient solving of the group technology problem (1987) J
Manuf Syst, 6 (2), pp. 117-124;
Silver, E.A., An overview of heuristic solution methods (2004) J Oper Res Soc, 55
(9), pp. 936-956;
Eng, 28, pp. 485-494;
approach to the cell formation problem (2005) Int J Adv Manuf Technol, 25 (9-10),
pp. 988-997;
Paydar, M.M., Siadi-Mehrabad, M., A hybrid genetic-variable neighborhood search
algorithm for the cell formation problem based on grouping efficacy (2013) Comput
Oper Res, 40, pp. 980-990;
algorithm with variable neighbourhood (2011) Eur J Ind Eng, 5 (1), pp. 22-42;
(2009) Int J Prod Econ, 120, pp. 669-688;
grouping (2009) Comput Ind Eng, 56, pp. 347-356;
the cell formation problem (2007) Comput Oper Res, 34 (7), pp. 2059-2079;
predator–prey genetic algorithm (2012) Appl Soft Comput, 12 (1), pp. 559-572;
Duran, O., Rodriguez, N., Consalter, L.A., Collaborative particles warm
optimizations with a data mining technique for manufacturing cell design (2010) Exp
Syst Appl, 37, pp. 1563-1567;
Xiangyong, L., Baki, M.F., Aneja, Y.P., An ant colony optimization metaheuristic
for machine–part cell formation problems (2010) Comput Oper Res, 37, pp. 2071-2081;
(2010) Exp Syst Appl, 37, pp. 5476-5483;
(2010) Exp Syst Appl, 37, pp. 4822-4829;
Yang, M.S., Yang, J.H., Machine–part cell formation in group technology using a
modified ART1 method (2008) Eur J Oper Res, 188, pp. 140-152;
algorithm (2011) Math Comput Model, 53 (9-10), pp. 1776-1787;
(2012) AGRASP heuristic for the manufacturing cell formation problem, , Díaz JA,
Luna D, Luna R (2012) ; 20(3): 679–706 10.1007/s11750-010-0159-3;
Ashkan, H., Maryam, A.T., FatemehSarani, M.K., An improved DPSO algorithm for cell
formation problem (2015) J Ind Syst Eng, 8 (2), pp. 30-53;
Martins, I.C., Pinheiro, R.G.S., Protti, F., Ochi, L.S., A hybrid iterated local
problem (2015) Exp Syst Appl, 42 (22), pp. 8947-8955;
(1973) Int J Prod Res, 11 (4), pp. 399-416;
systems (2001) Comput Ind Eng, 39 (1-2), pp. 125-144;
approach for solving a cell formation problem in cellular manufacturing (2009) Exp
Syst Appl, 36, pp. 6598-6604;
manufacturing cell formation problems (2008) Exp Syst Appl, 34, pp. 1609-1617;
27 (7), pp. 1161-1165;
Econ, 9, pp. 73-81;
manufacturing systems (1986) Eur J Oper Res, 24, pp. 387-397
CORRESPONDENCE ADDRESS: Zeb, A.; Department of Engineering Management, College of
Electrical and Mechanical Engineering (EME), National University of Sciences and
Technology (NUST)Pakistan; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Batsyn, M., Bychkov, I., Goldengorin, B., Pardalos, P., Sukhov, P.

37111907600;55842563400;6506538311;7005330875;55842116600;
Pattern-based heuristic for the cell formation problem in group technology
(2013) Springer Proceedings in Mathematics and Statistics, 32, pp. 11-50. Cited 8
times.
1-4614-5574-5_2&partnerID=40&md5=2b34a2ec4cf63b005f035347c89875c8
DOI: 10.1007/978-1-4614-5574-5_2
AFFILIATIONS: Laboratory of Algorithms and Technologies for Network Analysis, The
National Research University Higher School of Economics, 136, Rodionova Street,
Nizhny Novgorod, Russian Federation, 603093, Russian Federation;
Center of Applied Optimization, University of Florida, 401 Weil Hall, 116595,
Gainesville, FL, 32611-6595, United States
ABSTRACT: In this chapter we introduce a new pattern-based approach within the
linear assignment model with the purpose to design heuristics for a combinatorial
optimization problem (COP). We assume that the COP has an additive (separable)
objective function and the structure of a feasible (optimal) solution to the COP is
predefined by a collection of cells (positions) in an input file. We define a
pattern as a collection of positions in an instance problem represented by its
input file (matrix). We illustrate the notion of pattern by means of some well-
known problems in COP, among them are the linear ordering problem (LOP) and cell
formation problem (CFP), just to mention a couple. The CFP is defined on a Boolean
input matrix, the rows of which represent machines and columns - parts. The CFP
consists in finding three optimal objects: a block-diagonal collection of
rectangles, a row (machines) permutation, and a column (parts) permutation such
that the grouping efficacy is maximized. The suggested heuristic combines two
procedures: the pattern-based procedure to build an initial solution and an
improvement procedure to obtain a final solution with high grouping efficacy for
the CFP. Our computational experiments with the most popular set of 35 benchmark
instances show that our heuristic outperforms all well-known heuristics and returns
either the best known or improved solutions to the CFP. © Springer Science+Business
Media New York 2013.
AUTHOR KEYWORDS: Cell formation problem; Group technology; Heuristic
INDEX KEYWORDS: Benchmarking; Cellular manufacturing; Optimization, Cell formation
problem; Combinatorial optimization problems; Computational experiment; Design
heuristics; Heuristic; Linear assignment; Linear ordering problems; Objective
functions, Group technology
assignment and cell formation in group technology (1990) Int. J. Prod. Res, 28 (8),
pp. 1555-1572;
configuration (1987) Int. J. Prod. Res, 25, pp. 101-113;
Int. J. Prod. Res, 29 (2), pp. 343-356;
Burbidge, J.L., The new approach to production (1961) Prod. Eng, 40, pp. 3-19;
Int. J. Prod. Res, 11, pp. 399-416;
algorithm for cellular manufacturing (1986) Int. J. Prod. Res, 24, pp. 451-464;
clustering of group technology (1986) Int. J. Prod. Res, 24 (5), pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC-An algorithm for concurrent
835-850;
1035-1052;
programming for the solution of simple cell-formation problems (2001) Int. J. Prod.
Res, 39 (1), pp. 1-19;
cell formation (2012) Oper. Res, 60 (5), pp. 1157-1166;
Gonccalves, J.F., Resende, M.G.C., An evolutionary algorithm for manufacturing cell
Formation In Cellular Manufacturing: A Comparative Study, , PhD Thesis, Department
of Industrial and Manufacturing Engineering, University of Wisconsin Milwaukee;
Jonker, R., Volgenant, A., A shortest augmenting path algorithm for dense and
sparse linear assignment problems (1987) Computing, 38 (4), pp. 325-340;
232;
technology (2012) Comp. Manag. Sci, ,
http://www.springerlink.com/content/ug2l55m46t554564/fulltext.pdf, within open
access at Springer-link.com, DOI 10.1007/s10287-012-0146-2, available at;
J. Prod. Res, 28 (2), pp. 233-243;
(4), pp. 561-569;
Manuf. Syst, 6 (2), pp. 117-124;
technology problem (1992) Int. J. Prod. Res, 30, pp. 2633-2646;
Int. J. Adv. Manuf. Tech, 28, pp. 950-956;
machine capacities: An ortho-synapse Hopfield neural network approach (1999) J.
Intell. Manuf, 10, pp. 437-447;
McAuley, J., Machine grouping for efficient production (1972) Prod. Engineer, 51
(2), pp. 53-57;
Mitrofanov, S.P., (1959) Nauchnye Osnovy Gruppovoy Tekhnologii, 435., Lenizdat,
Spa, Yorkshire: National Lending Library Translation (1966) Translation of
Mitrofanov;
and similarity coefficients to the GT machine cell formation problem (1989) Int. J.
Prod. Res, 27 (10), pp. 1811-1835;
Ng, S., Worst-case analysis of an algorithm for cellular manufacturing (1993) Eur.
J. Oper. Res, 69 (3), pp. 384-398;
(1996) Oper. Res, 44 (5), pp. 735-744;
systems (2001) Comput. Ind. Eng, 39 (1-2), pp. 125-144;
theoretic approach (1975) Int. J. Prod. Res, 13 (6), pp. 567-579;
formation applications (1989) Comput. Ind. Eng, 16 (3), pp. 419-426;
problem (1989) Int. J. Prod. Res, 27 (5), pp. 775-782;
technology using minimum spanning trees (1994) Int. J. Prod. Res, 32, pp. 2149-
2158;
families problem in group technology (1990) Int. J. Prod. Res, 28 (1), pp. 145-152;
Stanfel, L., Machine clustering for economic production (1985) Eng. Cost. Prod.
Econ, 9, pp. 73-81;
(2004) Comput. Ind. Eng, 46, pp. 495-510;
manufacturing design and layout (2007) Eur. J. Oper. Res, 181, pp. 156-167;
cell formation with multiple identical machines (2003) Eur. J. Oper. Res, 151, pp.
434-446;
modified ART1 method (2008) Eur. J. Oper.Res, 188 (1), pp. 140-152
CORRESPONDENCE ADDRESS: Batsyn, M.; Laboratory of Algorithms and Technologies for
Network Analysis, The National Research University Higher School of Economics, 136,
Rodionova Street, Nizhny Novgorod, Russian Federation, 603093, Russian Federation;
ISSN: 21941009
ISBN: 9781461455738
SOURCE: Scopus
Tavakkoli-Moghaddam, R., Rahimi-Vahed, A.R., Ghodratnama, A., Siadat, A.

56491438400;15048438700;9843487600;24438293900;
A simulated annealing method for solving a new mathematical model of a multi-
criteria cell formation problem with capital constraints
(2009) Advances in Engineering Software, 40 (4), pp. 268-273. Cited 15 times.
57949112342&doi=10.1016%2fj.advengsoft.2008.04.008&partnerID=40&md5=9c5b5fac1a6f3ee
5a69f6cffc48fa195
DOI: 10.1016/j.advengsoft.2008.04.008
AFFILIATIONS: Department of Industrial Engineering, Center of Excellence for
Intelligence Based Experimental Mechanics, College of Engineering, Tehran, Iran;
Département d'informatique et de recherche opérationnelle, Université of Montréal,
Montreal, Canada;
Arts et Métiers Paris Tech, LGIPM, Metz, France
ABSTRACT: One of the most important stages in the establishment of a cellular
manufacturing system is the formation of manufacturing cells in order to find out
which machines dedicated to each cell and part families corresponding to these
machines. In this paper, two kinds of cells are being considered: (1) general or
common cells which are able to manufacture different kinds of products and (2)
specific cells which are able to manufacture a specific type of product. To set up
cells for manufacturing, two kinds of capital constraints are observed: (1) capital
constraints for construction and formation of cells and (2) capital availability
constraints for the provision of tools and equipment to manufacture corresponding
commodities. To find cells and to specify the family of the assigned commodities to
each cell, different and various criteria exist. In this paper, three criteria are
taken into consideration simultaneously in order to minimize the sum of: (1) costs
of the delay in delivering a product to costumers by the above two cells in each
period, (2) costs of the common and specific cells to remain idle in each period
and (3) the unused capital. Since the cell formation problem is mostly time
consuming, i.e. these are NP-hard, then to solve the problem, an effective
algorithm of simulated annealing (SA) method is utilized. To verify and validate
the efficiency of the SA algorithm, from the standpoint of the quality of the
solution obtained and time of calculations, the results obtained are compared with
those of the Lingo 6 software. Results suggest that the SA algorithm have good
ability of solving the problem, especially in the case of large-sized problems for
which Lingo 6 cannot produce solutions. © 2008 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Mathematical model; Multi-criteria cell formation model;
Simulated annealing
INDEX KEYWORDS: Annealing; Cells; Cellular manufacturing; Construction equipment;
Cytology; Flexible manufacturing systems; Functions; Manufacture; Mathematical
models, Availability constraints; Cell formation problems; Cellular Manufacturing
systems; Effective algorithms; Manufacturing cells; Multi-criteria cell formation
model; New mathematical models; NP-hard; Part families; SA algorithms; Simulated
annealing methods; Time consuming, Simulated annealing
REFERENCES: Chu, C.H., Tsai, M., A comparison of three array-based clustering
techniques for manufacturing cell formation (1990) Int J Prod Res, 28 (8), pp.
1417-1433;
Li J, Ding Z. Fuzzy cluster analysis and fuzzy pattern recognition methods for
formation of part families. In: Proc 16th North American manufacturing research
conference (NAMRC) 1988. p. 563-88; Xu, H., Wang, H.P., Part family formation for
GT applications based on fuzzy mathematics (1989) Int J Prod Res, 27 (9), pp. 1637-
1651;
Int J Prod Res, 29 (2), pp. 343-356;
simulated annealing: an experimental evaluation (1992) Int J Prod Res, 63 (3), pp.
409-422;
Joines JA. Manufacturing cell design using genetic algorithms. MSc thesis, Raleigh,
NC: North Carolina State University, 1993; Venugopal, V., Narendran, T.T., A
genetic algorithm approach to the machine-component grouping problem with multiple
objectives (1992) Comput Indust Eng, 22 (4), pp. 469-480;
Joines JA, Culbreth CT, King RE. A comprehensive review of production oriented
manufacturing cell formation techniques. NCSU-IE Technical Report. Raleigh, NC:
North Carolina State University, 1996; Cheng, C.H., Gupta, Y.P., Lee, W.H., Wong,
K.F., A TSP-based heuristic for forming machine groups and part families (1998) Int
J Prod Res, 36 (5), pp. 1325-1337;
Plaquin, M., Pierreval, H., Cell formation using evolutionary algorithms with
certain constraints (2000) Int J Prod Econ, 64 (1-3), pp. 267-278;
multiple routes and multiple objectives (2000) Int J Prod Res, 38 (2), p. 385395;
Econ, 64 (1-3), pp. 279-284;
Brown, E.C., Sumichrast, R.C., CF-GGA: a grouping genetic algorithm for the cell
process routes by genetic algorithm (2002) Int J Prod Econ, 76 (3), pp. 219-228;
Süer GA, Saiz M. Cell loading in cellular manufacturing systems. in: Proc 15th Conf
on Computers and Industrial Engineering, March 8-10, Cocoa Beach, Florida, 1993;
Süer, G.A., Saiz, M., Dagli, C., Gonzalez, W., Manufacturing cell loading rules and
algorithms for connected cell (1995) Planning design and analysis of cellular
manufacturing system, , Kamrani A., Parsaei H., and Lies D. (Eds), Elsevier;
Süer, G.A., Vazquez, R., Cortes, M., A hybrid approach of genetic algorithms and
local optimizers in cell loading (2005) Comput Ind Eng, 48 (3), pp. 625-641;
Süer, G.A., Dagli, C., Intra-cell manpower transfers and cell loading in labor-
intensive manufacturing cells (2005) Comput Ind Eng, 48 (3), pp. 643-655;
dynamic cell formation problem using metaheuristics (2005) Appl Math Comput, 170
(2), pp. 761-780;
Tavakkoli-Moghaddam, R., Rabbani, M., Godratnama, A., Ahmed, P.K., Allocation of
parts to cells minimizing tardiness and idle time by simulated annealing (2005) Int
J Manufact Technol Manage, 7 (5-6), pp. 581-593;
algorithms (2005) Lecture notes in computer science, 3777, pp. 213-227., Stochastic
algorithms: foundation and applications. Lupanov O.B., Kasim-Zade O.M., Chaskin
A.V., and Steinhofel K. (Eds), Springer-Verlag, Berlin;
Tavakkoli-Moghaddam, R., Safaei, N., Sassani, F., A new solution for a dynamic cell
formation problem with alternative routing and machine costs using simulated
annealing (2008) J Oper Res Soc, 59 (4), pp. 443-454;
integrated cell formation and lot sizing considering product quality (2008) Eur J
Oper Res, 187 (1), pp. 46-69;
genetic algorithm (2007) J Intell Fuzzy Syst, 18 (4), pp. 363-376;
manufacturing cell formation problems (2008) Expert Syst Appl, 34 (3), pp. 1609-
1617;
Aramoon Bajestani M, Rabbani M, Rahimi-Vahed AR, Baharian Khoshkhou G. A multi-
objective scatter search for a dynamic cell formation problem. Comput Oper Res, in
press. doi:10.1016/j.cor.2007.10.026; Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.,
Optimization by simulated annealing (1983) Science, 220, pp. 671-679
Engineering, Center of Excellence for Intelligence Based Experimental Mechanics,
College of Engineering, Tehran, Iran; email: [email protected]
ISSN: 09659978
CODEN: AESOD
ABBREVIATED SOURCE TITLE: Adv Eng Software
SOURCE: Scopus
Chan, F.T.S., Lau, K.W., Chan, L.Y., Lo, V.H.Y.

7202586517;36722692600;7403540482;7005645868;
Cell formation problem with consideration of both intracellular and intercellular
movements
48 times.
40849088044&doi=10.1080%2f00207540500478843&partnerID=40&md5=77f1a00bbfacde33c1b61a
0c2064f877
DOI: 10.1080/00207540500478843
AFFILIATIONS: Department of Industrial and Manufacturing Systems Engineering,
University of Hong Kong, Pokfulam Road, Hong Kong, Hong Kong
ABSTRACT: The cellular manufacturing system (CMS) is a well-known strategy which
enhances production efficiency while simultaneously cutting down the system-wide
operation cost. Most of the researchers have been focused on developing different
approaches in order to identify machine-cells and part-families more efficiently.
In recent years, researchers have also focused their studies more scrupulously by
collectively considering CMS with production volume, operation sequence,
alternative routing or even more. However, very few of them have tried to
investigate both the allocation sequence of machines within the cells (intra-cell
layout) and the sequence of the formed cells (inter-cell layout). Solving this
problem is indeed very important in reducing the total intracellular and
intercellular part movements which is especially significant with large production
volume. In this paper, a two-phase approach has been proposed to tackle the cell
formation problem (CFP) with consideration of both intra-cell and inter-cell part
movements. In the first phase, a mathematical model with multi-objective function
is formed to obtain the machine cells and part families. Afterwards, in the second
phase, another mathematical model with single-objective function is presented which
optimizes the total intra-cell and inter-cell part movements. In other words, the
scope of problem has been identified as a CFP together with the background
objective of intra-cell and inter-cell layout problems (IAECLP). The primary
assumption for IAECLP is that only linear layouts will be considered for both
intra-cell and inter-cell. In other words, the machine within cells and the formed
cells are arranged linearly. This paper studies formation of two mathematical
models and used the part-machine incidence matrix with component operational
sequence. The IAECLP is considered as a quadratic assignment problem (QAP). Since
QAP and CFP are NP-hard, genetic algorithm (GA) has been employed as solving
algorithm. GA is a widespread accepted heuristic search technique that has proven
superior performances in complex optimization problems and further it is a popular
and well-known methodology. The proposed algorithms for CFP and IAECLP have been
implemented in JAVA programming language.
AUTHOR KEYWORDS: Cell formation problem; Genetic algorithm; Intra-cell and inter-
cell layout problem; Operational sequence; Sequencing; Travelling salesman
problem
INDEX KEYWORDS: Cellular manufacturing; Genetic algorithms; Java programming
language; Operating costs; Optimization, Cell formation problem; Intra-cell and
inter-cell layout problem; Operational sequence, Problem solving
REFERENCES: Al-Hakim, L., On solving facility layout problems using genetic
algorithms (2000) Int. J. Prod. Res, 38, pp. 2573-2582;
Alendar, J.T., An Indexed Bibliography of Genetic Algorithms: Years 1957-1993
(1994) Printed in Finland), , Compiled by J. T. Alendar;
Int. J. Prod. Res, 29, pp. 1081-1100;
(1995) Math. Comp. Model, 21 (12), pp. 61-73;
Bazargan-Lari, M., Kaebernick, H., Harraf, A., Cell formation and layout designs in
a cellular manufacturing environment - a case study (2000) Int. J. Prod. Res, 38,
pp. 1689-1709;
Brown, E.C., Sumichrast, R.T., Impact of the replacement heuristic in a grouping
genetic algorithm (2003) Int. J. Comp. & Op. Res, 30, pp. 1575-1593;
Chaieb, I., Korbaa, O., Intra-cell machine layout associated with flexible
production and transport systems (2003) J. Eng. Manuf, 217, pp. 883-897;
using genetic algorithms (1998) Int. J. Robot. Comp. Integ. Manuf, 14, pp. 339-346;
machine groups and part families (1998) Int. J. Prod. Res, 36, pp. 1325-1337;
Falkenauer, E., New Presentation and Operators for GA Applied to Grouping Problems
(1994) Evolutionary Computation, 2, pp. 123-144;
Goldberg, D.E., (1989) Genetic Algorithms in Search, Optimisation and Machine
Learning, , Addison Wesley: Reading, MA;
Gupta, Y., Gupta, M., Kumar, A., Sundram, C., Minimising total intercell and
intracell moves in cellular manufacturing: A genetic algorithm approach (1995) Int.
J. Comp. Integ. Manuf, 8, pp. 92-101;
machine-part grouping decisions in the design of a cellular manufacturing system
(1990) Int. J. Prod. Res, 28, pp. 1247-1269;
Production Management, , Kluwer-Nijho: Boston, MA;
Holland, J.H., (1992) Adaptation in Natural and Artificial Systems, , 2nd ed, The
University of Michigan Press: Ann Arbor, MI;
Hon, K.K.B., Chi, H., A new approach of group technology in part family
optimisation (1994) Ann. Tech CIRP, 43, pp. 425-428;
Hong, T.P., Wang, H.S., Lin, W.Y., Lee, W.Y., Evolution of appropriate crossover
and mutation operators in a genetic process (2002) Appl. Intel, 16, pp. 7-17;
alternative part process plans (1996) Comp. & Indust. Eng, 30, pp. 423-431;
Joines, J.A., (1993) Manufacturing cell design using genetic algorithms, , MS
thesis, North Carolina State University, Raleigh, NC;
Joines, J.A., Culbreth, C.T., King, R.E., A genetic algorithms based integer
program for manufacturing cell design (1995) International Conference on Flexible
Automation and Integrated Manufacturing, , Stuttgart: Germany;
Kazerooni, M.L., Luong, H.S., Abhary, K., A genetic algorithm based cell design
considering alternative routing (1997) Int. J. Comp. Integ. Manuf. Syst, 10, pp.
93-107;
using a rank order clustering algorithm (1980) Int. J. Prod. Res, 18, pp. 213-232;
cell formation (2000) Int. J. Adv. Manuf. Tech, 16, pp. 491-497;
McAuley, J., Machine grouping for efficient production (1972) Prod. Eng, 51, pp.
53-57;
Plaquin, M.F., Pierreval, H., Cell formation using evolutionary algorithms with
certain constraints (2000) Int. J. Prod. Econ, 64, pp. 267-278;
Rai, R., Kameshwaran, S., Tiwari, M.K., Machine-tool selection and operation
allocation in FMS: Solving a fuzzy Goa-programming model using a genetic algorithm
(2002) Int. J. Prod. Res, 40, pp. 641-665;
multi-period planning horizons of cellular manufacturing systems (1998) Prod. Plan.
& Cont, 9, pp. 561-571;
Tiwari, M.K., Vidyarthi, N.K., Solving machine loading problems in a flexible
manufacturing system using a genetic algorithm based heuristic approach (2000) Int.
J. Prod. Res, 38, pp. 3357-3384;
manufacturing systems (1993) Int. J. Prod. Research, 31, pp. 1409-1421;
production factors (2002) Int. J. Prod. Res, 40, pp. 885-906;
Zhao, C.W., Wu, Z.M., A genetic algorithm for manufacturing cell formation with
multiple routes and multiple objectives (2000) Int. J. Prod. Res, 38, pp. 385-395
CORRESPONDENCE ADDRESS: Chan, F. T. S.; Department of Industrial and Manufacturing
Systems Engineering, University of Hong Kong, Pokfulam Road, Hong Kong, Hong Kong;
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Chen, C.-L., Cotruvo, N.A., Baek, W.

7501952022;57030511700;7005596141;
A simulated annealing solution to the cell formation problem
50 times.
0001636090&doi=10.1080%2f00207549508904834&partnerID=40&md5=e60df1d74472e5b63c132c3
26433a1ac
DOI: 10.1080/00207549508904834
AFFILIATIONS: Department of Industrial Engineering, Mississippi State University,
P.O. Drawer U, MS, MS 39762, United States
ABSTRACT: This research develops a simulated annealing (SA) based heuristic for
cell formation problems. We apply the SA based heuristic to many popular examples
for cell formation problems. The computational results show that the SA based
heuristic performs very well in all these examples, and the SA based heuristic has
several advantages that most of the existing algorithms do not have. © 1995 Taylor
& Francis Group, LLC.
REFERENCES: Abramson, D., Constructing school timetables using simulated annealing:
Sequential and parallel algorithms (1991) Management Science, 37 (1), pp. 98-113;
Aheadi, R.H., Tang, C.S., An operation partitioning problem for automated assembly
system design (1991) Operations Research, 39 (5), pp. 824-835;
Alfa, A., Heragu, S., Chen, M., A 3-opt based simulated annealing algorithm for
vehicle routing problems (1991) Computers and Industrial Engineering, 21 (1-4), pp.
635-639;
Askin, R.G., Subramanian, S.P., A cost based heuristic for group technology
113;
Research, 25 (5), pp. 639-665;
Burbidge, J., Production Flow Analysis (1963) Production Engineer, 42 (12), pp.
742-752;
Research, 24 (2), pp. 451-464;
formulation of part families and machine cells (1987) International Journal of
Chandrasekharan, M.P., Rajagopalan, R., GROUPAB1LITY: An analysis of the properties
Chën, W., Stallmann, M., Gehringer, E., Hypercube embedding heuristics: An
evaluation (1989) International Journal of Parallel Programming, 18 (6), pp. 505-
549;
Das, R., Fay, D., Das, P.K., Allocation of precedence-constrained tasks to parallel
processors for optimal execution (1992) Microprocessing and Microprogramming, 35
(1-5), pp. 237-244;
De Witt, J., The use of similarity coefficients in production flow analysis (1980)
Isken, M.W., Hancock, W.M., A heuristic approach to nurse scheduling in hospital
units with non-stationary, urgent demand, and a fixed staff size (1990) Journal of
the Society for Health Systems, 2 (2), pp. 24-41;
Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevan, C., Optimization by simulated
annealing: And experimental evaluation pan 1, graph partitioning (1989) Operations
Research, 37 (6), pp. 865-892;
Kaparthi, S., Suresh, N., Machine-component cell formation in group technology: A
(6), pp. 1353-1367;
Research, 18 (2), pp. 213-232;
King, J., Nakornchai, V., Machine-component group formulation in group technology:
pp. 117-133;
(1983) Science, 220, pp. 671-680;
Kuik, R., Salomon, M., Multi-level lot-sizing problem: Evaluation of a simulated
annealing heuristic (1990) European Journal of Operations Research, 45 (1), pp. 25-
37;
Engineer, 51 (2), pp. 53-57;
53-57;
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E., Equations
of state calculations by fast computing machines (1953) Journal of Chemical
Physics, 21, pp. 1087-1092;
Mulvey, J.M., Crowder, H.P., Clustering analysis: An application of Langrangian
relaxation (1979) Management Science, 25 (4), pp. 329-340;
Schmitt, F.J., Module design for VLSl-heuristics to optimize layout topology (1987)
Microprocessing and Microprogramming (EUJ), 20 (1-3), pp. 189-193;
Seifoddine, H., A note on the similarity coefficient method and the problem of
Seikoddine, H., Wolf, P.M., Application of the similarity coefficient method (1986)
IIE Transactions, 18 (3), pp. 271-277;
Shahookar, K., Mazumder, P., VLSI cell placement techniques (1991) ACM Computing
Surveys, 23 (2), pp. 143-220;
Steudeal, H.J., Ballakur, A., A dynamic programming based heuristic for machine
grouping in manufacturing cell formation (1987) Computers and Engineering, 12 (3),
pp. 215-222;
Tabucannon, M.T., Ojha, R., ICRMA— a heuristic approach for intercell flow
reduction in cellular manufacturing systems (1987) Material Flow, 4, pp. 189-197;
Van Learhoven, P., Aarts, E., Lenstra, J., Job shop scheduling by simulated
annealing (1992) Operations Research, 40 (1), pp. 113-125;
24 (2), pp. 387-400;
Waghodekar, P.H., Sabu, S., Machine-component cell formation in group technology:
Decision Science, 21 (2), pp. 416-433;
Wilhelm, M.R., Ward, T.L., Solving quadratic assignment problems by simulated
annealing (1987) IIE Transactions, pp. 107-119;
Wolf, J., Dias, D., Lyer, B., Yu, P., Multisystem coupling by a combination of data
sharing and data partitioning (1989) IEEE Transactions on Software Engineering, 15
(7), pp. 854-860
CORRESPONDENCE ADDRESS: Chen, C.-L.; Department of Industrial Engineering,
Mississippi State University, P.O. Drawer U, MS, MS 39762, United States
ISSN: 00207543
SOURCE: Scopus
Solimanpur, M., Vrat, P., Shankar, R.

35615315700;7004178886;10638891800;
Feasibility and robustness of transiently chaotic neural networks applied to the
times.
1242265220&doi=10.1080%2f00207543.2004.10750072&partnerID=40&md5=0d75b23a34784f572f
95b63140b024ca
DOI: 10.1080/00207543.2004.10750072
AFFILIATIONS: Mechanical Engineering Department, Indian Institute of Technology
Delhi, New Delhi, Hauz Khas, 110016, India;
Department of Management Studies, Indian Institute of Technology Delhi, New Delhi,
110016, India
ABSTRACT: Cell formation is a key issue in the design of cellular manufacturing
systems. Effective grouping of parts and machines can improve considerably the
performance of manufacturing cells. The transiently chaotic neural network (TCNN)
is a recent methodology in intelligent computation that has the advantages of both
the chaotic neural network and the Hopfield neural network. The present paper
investigates the dynamics of the TCNN network and studies the feasibility and
robustness of final solutions of TCNN when applied to the cell formation problem.
The paper provides insight into the feasibility and robustness of TCNN for cell
formation problems. It also discusses how to set the initial values of the TCNN
parameters in the case of well-structured and ill-structured cell formation
problems. © 2004 Taylor & Francis Group, LLC.
INDEX KEYWORDS: Chaos theory; Computational methods; Convergence of numerical
methods; Damping; Neural networks; Parameter estimation; Robustness (control
systems), Cell-formation (CF) problems; Transiently chaotic neural network (TCNN),
REFERENCES: Adil, G.K., Rajamani, D., Strong, D., A mathematical model for cell
formation considering investment and operation costs (1993) European Journal of
Chandrasekhar An, M.P., Rajagopalan, R., An ideal seed nonhierarchical clustering
Research, 24, pp. 451-464;
Ciien, L., Aihara, K., Chaotic simulated annealing by a neural network model with
transient chaos (1995) Neural Networks, 8, pp. 915-930;
Ciifn, S.-J., Cheng, C.-S., A neural network-based cell formation algorithm in
293-318;
Chung, Y., Kdsiak, A., Grouping parts with a neural network (1994) Journal of
Manufacturing Systems, 13, pp. 262-275;
resonance theory paradigm (1995) International Journal of Production Research, 33,
pp. 893-913;
Hopeield, J.J., Tank, D.W., Neural computation of decisions in optimization
problems (1985) Biological Cybernetics, 52, pp. 141-152;
Joines, J.A., Kino, R.E., Culbreth, C.T., A comprehensive review of production-
Flexible Automation and Integrated Manufacturing, 3, pp. 225-265;
neural network approach (1992) International Journal of Production Research, 30,
pp. 1353-1367;
Kwok, T., Smith, K.A., Experimental analysis of chaotic neural network models for
combinatorial optimization under a unifying framework (2000) Neural Networks, 13,
pp. 731-744;
Liano, M., Zolfaghari, S., Machine cell formation considering processing times and
machine capacities: An ortho-synapse Hopfield neural network approach (1999)
52, pp. 53-57;
Olorijnniwo, F.O., A framework for measuring success of cellular manufacturing
implementation (1997) International Journal of Production Research, 35, pp. 3043-
3062;
Shankar, R., Vrat, P., Post design modeling for cellular manufacturing system with
cost uncertainty (1998) International Journal of Production Economics, 55, pp. 97-
109;
Soleymanpour, M., Vrat, P., Shankar, R., A transiently chaotic neural network
Srinivasan, G., Narfndran, T.T., Mahaoevan, B., An assignment model for part-
Research, 28, pp. 145-152;
Zolfaghari, S., Liang, M., (1995) A Hopfield Neural Network Approach to Machine
Grouping Problem. Proceedings of the 14Th Industrial Engineering Research
Conference, pp. 542-549., Nashville, TN;
Research, 35, pp. 2773-2792
CORRESPONDENCE ADDRESS: Vrat, P.; Department of Management Studies, Indian
Institute of Technology Delhi, New Delhi, 110016, India; email:
[email protected]
ISSN: 00207543
SOURCE: Scopus
James, T.L., Brown, E.C., Keeling, K.B.

8533468700;7404129184;6701760915;
A hybrid grouping genetic algorithm for the cell formation problem
33845334819&doi=10.1016%2fj.cor.2005.08.010&partnerID=40&md5=6dadf39cc459d7b7024a30
68cb5afb8f
DOI: 10.1016/j.cor.2005.08.010
AFFILIATIONS: Department of Business Information Technology, Pamplin College of
Business, Virginia Polytechnic Institute, Blacksburg, VA 24061, United States
ABSTRACT: The machine-part cell formation problem consists of constructing a set of
machine cells and their corresponding product families with the objective of
minimizing the inter-cell movement of the products while maximizing machine
utilization. This paper presents a hybrid grouping genetic algorithm for the cell
formation problem that combines a local search with a standard grouping genetic
algorithm to form machine-part cells. Computational results using the grouping
efficacy measure for a set of cell formation problems from the literature are
presented. The hybrid grouping genetic algorithm is shown to outperform the
standard grouping genetic algorithm by exceeding the solution quality on all test
problems and by reducing the variability among the solutions found. The algorithm
developed performs well on all test problems, exceeding or matching the solution
quality of the results presented in previous literature for most problems. © 2005
AUTHOR KEYWORDS: Grouping genetic algorithm; Heuristics; Machine-part cell
formation
INDEX KEYWORDS: Computational methods; Operations research; Problem solving,
Grouping efficacy measure; Grouping genetic algorithm; Machine part cell formation;
Machine utilization, Genetic algorithms
Holland, J., (1975) Adaptation in natural and artificial systems: an introductory
analysis with applications in biology, control, and artificial intelligence, ,
University of Michigan Press, Ann Arbor, MI;
Goldberg, D., (1989) Genetic algorithms in search, optimization, and machine
learning, , Addison-Wesley, Reading, PA;
(1992) Belgian Journal of Operations Research, Statistics and Computer Science, 33,
pp. 79-102;
Kumar, C., Chandrasekharan, M., Grouping efficacy: a quantitative criterion for
Burbidge, J., (1979) Group technology in the engineering industry, , Wiley, New
York;
Burbidge, J., Production flow analysis (1963) Production Engineer, 42, pp. 742-752;
reorganization using a clustering technique (1972) Operations Research, 20, pp.
993-1009;
Research, 18, pp. 213-232;
pp. 117-133;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC: an algorithm for concurrent
Research, 32, pp. 2149-2158;
Srinivasan, G., Narendran, T., GRAPHICS-a non-hierarchical clustering algorithm for
478;
Rajagopalan, R., Batra, J., Design of cellular production systems: a graph-
567-579;
Vannelli, A., Kumar, K., A method for finding minimal bottleneck cells for grouping
387-400;
Research, 28 (1), pp. 145-152;
Society, 50, pp. 509-516;
Joines, J., Culbreth, C., King, R., Manufacturing cell design: an integer
85;
pp. 1325-1337;
Mak, K., Wong, Y., Wang, X., An adaptive genetic algorithm for manufacturing cell
pp. 491-497;
3651-3669;
Guerrero, F., Lozano, S., Smith, K., Canca, D., Kwok, T., Manufacturing cell
formation using a new self-organizing neural network (2002) Computers, 42, pp. 377-
382;

Research, 34, pp. 3401-3416;
Sarker, B., Mondal, S., Grouping efficiency measures in cellular manufacturing: a
pp. 285-314;
Falkenauer, E., (1998) Genetic algorithms for grouping problems, , Wiley, New York;

Dimopoulos, C., Mort, N., (2001) A hierarchical clustering methodology based on
genetic programming for the solution of simple cell-formation problems.
pp. 2633-2646;
113;
1009;
397;
pp. 2097-2116;
1715-1728
CORRESPONDENCE ADDRESS: James, T.L.; Department of Business Information Technology,
Pamplin College of Business, Virginia Polytechnic Institute, Blacksburg, VA 24061,
United States; email: [email protected]
ISSN: 03050548
CODEN: CMORA
SOURCE: Scopus
Gong, J., Tang, J.

36241537800;55804452600;
Modeling of hybrid assembly cell formation problem
(2009) 2009 Chinese Control and Decision Conference, CCDC 2009, art. no. 5195049,
pp. 2715-2719. Cited 1 time.
70449380578&doi=10.1109%2fCCDC.2009.5195049&partnerID=40&md5=c9192aa77f368da254e794
ea7c020388
DOI: 10.1109/CCDC.2009.5195049
AFFILIATIONS: Institute of Systems Engineering, Northeastern University, Shenyang
110004, China
ABSTRACT: In this paper, an assembly cell formation problem is addressed, which has
been reported as a new technical innovation in the industry. First, a mathematical
model is proposed to describe the assembly cell formation problem. Some decisions
are made about the assembly cell formation problem, such as (1) how many cells
should be formatted, (2) how many workers should be assigned in each cell, and (3)
how many workers should be assigned on the shortened conveyor line when a part of
the conveyor assembly line should be converted to cells, in order to optimize the
system performance which is defined as the total throughput time. Then a comparison
analysis based on numerical experiments is addressed. The results indicate that the
traditional conveyor assembly line is not appropriate in the situation where the
number of product type is increasing, and the assembly cell system can achieve
higher system performance of productivity. © 2009 IEEE.
AUTHOR KEYWORDS: Assembly cell formation; Assembly line; Cross-trained; Line-
cell conversion; Total throughput time
INDEX KEYWORDS: Assembly cell formation; Assembly line; Cross-trained; Line-cell
conversion; Total throughput time, Assembly machines; Cells; Cellular
manufacturing; Conveyors; Cytology; Mathematical models, Assembly
REFERENCES: K. Isa, T. Tsuru. (1999) Cell production and workplace innovation in
Japan: Toward a new model for Japanese manufacturing?, Industrial Relations, 4(1),
Issue 4, 548-578; Johnson, D.J., Converting assembly lines to assembly cells at
sheet metal products: Insights on performance improvements (2005) International
Burbidge, J.L., (1989) Production Flow Analysis, , Oxford: Clarendon Press;
Sakazume, Y., (2005) Is Japanese cell manufacturing a new system?: A comparative
study between Japanese cell manufacturing and cellular manufacturing, Journal of
Japan Industrial Management Association, 12, pp. 89-94;
Dario Ikuo Miyake. (2006) The shift from belt conveyor line to work-cell based
assembly system to cope with increasing demand variation and fluctuation in the
Japanese electronics industries, Report paper of CIRJE-F-397; Wemmerlöv v, U.,
Hyer, N.L., Cellular manufacturing in the U.S. industry; A survey of users (1989)
Levin, D.P., Compaq storms the PC heights from its factory floor (1994) New York
Times, , 13 November;
Feare, T., (1995), Less automation means more productivity at Sun. Mod. Mat.
Handl., 50, 39-41; Bukchin, J., Darel, E., Rubinovitz, J., Team-oriented assembly
system design: A new approach (1997) International Journal of Production Economics,
51, pp. 47-57;
Wemmerlöv, U., Johnson, D.J., Cellular manufacturing at 46 user plants:
Takahashi, S., Tamiya, H., Tahoku, H., A miracle CANON production system: It is not
only Toyota (2003) Special report of Weekly Toyo Economics, , November 27-January
3, 123-136, in Japanese
CORRESPONDENCE ADDRESS: Gong, J.; Institute of Systems Engineering, Northeastern
University, Shenyang 110004, China; email: [email protected]
ISBN: 9781424427239
ABBREVIATED SOURCE TITLE: Chin. Control Decis. Conf., CCDC
SOURCE: Scopus
Vin, E., De Lit, P., Delchambre, A.

8360139700;6603067756;6603821707;
A multiple-objective grouping genetic algorithm for the cell formation problem with
alternative routings
17444388034&doi=10.1007%2fs10845-004-5888-
4&partnerID=40&md5=62184ba90f58e1364c5c082694b689af
DOI: 10.1007/s10845-004-5888-4
AFFILIATIONS: CAD/CAM Department, Université Libre De Bruxelles, 50 av. F. D.
Roosevelt, CP165/14B-1050 Brussels, Belgium
ABSTRACT: This paper addresses the cell formation problem with alternative part
routings, considering machine capacity constraints. Given processes, machine
capacities and quantities of parts to produce, the problem consists in defining the
preferential routing for each part optimising the grouping of machines into
manufacturing cells. The main objective is to minimise the inter-cellular traffic,
while respecting machine capacity constraints. To solve this problem, the authors
propose an integrated approach based on a multiple-objective grouping genetic
algorithm for the preferential routing selection of each part (by solving an
associated resource planning problem) and an integrated heuristic for the cell
formation problem. © 2005 Springer Science+Business Media, Inc.
AUTHOR KEYWORDS: Alternative routings; Cell formation; Group technology;
Grouping genetic algorithm; Multiple objectives
INDEX KEYWORDS: Algorithms; Data acquisition; Group technology; Heuristic methods;
Mathematical models; Matrix algebra; Problem solving, Alternative routings; Cell
formation; Grouping genetic algorithms; Multiple objectives, Genetic algorithms
REFERENCES: Askin, R., Selim, H., Vakharia, A., A methodology for designing
flexible cellular manufacturing systems (1997) IIE Transactions, 29 (7), pp. 599-
610;
Baykasoglu, A., Gindy, N., MOCACEF 1.0: Multiple objective capability based
approach to form part-machine groups for cellular manufac-turing application (2000)
Brandon, J.A., (1996) Cellular Manufacturing: Integrating Technology and
Management, , Taunton UK: Research Studies Press;
Brans, J.-P., Mareschal, B., The PROMCALC & GAIA decision support system for
multicriteria decision aid (1994) Decision Support Systems, 12, pp. 297-310;
Burbidge, J.L., Production flows analysis (1963) The Production Engineer, 42, pp.
742-752;
Burbidge, J.L., Production flows analysis (1971) The Production Engineer, 50 (4-5),
pp. 139-152;
Burbidge, J.L., (1975) The Introduction to Group Technology, , New York: John Wiley
& Sons;
Chandrasekharan, M.P., Rajagopalan, R., MOROC: An extension of rank order
Research, 24 (5), pp. 1221-1233;
De Witte, J., The use of similarity coefficient in production flows analysis (1980)
Diallo, M., Pierreval, H., Quilliot, A., Manufacturing cells design with flexible
Falkenauer, E., (1998) Genetic Algorithm and Grouping Problems, , Chichester, UK:
John Wiley & Sons;
(1925) Transactions of the American Society of Mechanical Engineers, 46, pp. 691-
738;
Goldberg, D.E., (1989) Genetic Algorithms in Search, Optimisation and Machine
Learning, , Reading, MA: Addison-Wesley;
alternative routing (1993) International Journal of Production Research, 31 (6),
pp. 1259-1273;
Harhalakis, G., Nagi, R., Proth, J.-M., An efficient heuristic in manufacturing
cell formation for group technology applications (1990) International Journal of
Irani, A., Huang, H., Custom design of facilities layouts for multi-product
facilities using layout modules (2000) IEEE Transaction on Robotics and Automation,
16 (3), pp. 259-267;
King, R., Machine-component grouping in production flow analysis: Approach using a
rank order clustering algorithm (1980) International Journal of Production
Research, 18 (2), pp. 213-232;
Kusiak, A., Chow, W.S., Decomposition of manufacturing systems (1988) IEEE Journal
of Robotics and Automation, RA-4 (5), pp. 457-471;
Logendran, R., Ramakrishna, P., Srikandarajah, C., Tabu search-based heuristics for
cellular manufaturing systems in the presence of alternative process plans (1994)
considering alternitive routings (1997) Computer-intergrated Manufacturing Systems,
10 (2), pp. 93-107;
machines (2002) International Journal of Production Research, 40 (14), pp. 3291-
3310;
Mitrofanov, S.P., (1966) The Scientific Principles of Group Technology, , British
Library Lending Division (translation of original Russian text);
Uncertain Production Requirements with Presence of Routing Flexibility, , PhD
thesis, Blacksburg, Virginia;
technology machine clustering problem (1985) OMEGA International Journal of
Management Sciences, 13 (6), pp. 577-583;
Rekiek, B., De Lit, P., Delchambre, A., Hybrid assembly line design and user's
preference (2002) International Journal of Production Research, 40 (5), pp. 1095-
1111;
Rekiek, B., De Lit, P., Pellichero, F., L'Eglise, T., Fouda, P., Falkenauer, E.,
Delchambre, A., A multiple objective grouping genetic algorithm for assembly line
design (2001) Journal of Intelligent Manufacturing, 12 (5-6), pp. 469-485;
Sathiaraj, D., Sarker, B.R., Common parts grouping heuristic: An iterative
procedure to cell formation (2002) Production Planning & Control, 13 (5), pp. 481-
489;
manufacture. Part II (1993) International Journal of Production Research, 31 (6),
pp. 1315-1326;
Srinivasan, G., Narendran, T.T., Grafics: A non technological clusrtreing algorithm
fgor group technology application (1991) International Journal of Production
Research, 29 (3), pp. 463-479;
Research, 32 (2), pp. 2149-2158;
Vivekanand, P., Narendran, T.T., Logical cell formation in FMS, using flexibility-
based criteria (1998) International Journal of Flexible Manufacturing Systems, 10,
pp. 163-181;
885-906
CORRESPONDENCE ADDRESS: Delchambre, A.; CAD/CAM Department, Université Libre De
Bruxelles, 50 av. F. D. Roosevelt, CP165/14B-1050 Brussels, Belgium; email:
[email protected]
ISSN: 09565515
CODEN: JIMNE
SOURCE: Scopus
Peker, A., Kara, Y.

56264611400;15834728900;
Parameter setting of the Fuzzy ART neural network to part-machine cell formation
problem
19 times.
1242332755&doi=10.1080%2f00207540310001632457&partnerID=40&md5=6008a30b4d7102fb2b9f
1a6023a3111f
DOI: 10.1080/00207540310001632457
AFFILIATIONS: Department of Industrial Engineering, Selcuk University, 42040
Campus, Konya, Turkey
ABSTRACT: The first step in cellular manufacturing system applications is the
solution of the cell-formation problem. Many researchers have investigated this
problem and a number of methods developed. In the present study, one of these
methods, the Fuzzy ART neural network, was investigated. This method can solve the
cell-formation problem using both binary and non-binary part-machine incidence
matrices. The neural network model was coded in PASCAL and applied to 26 test
problems to determine the efficient parameter combinations. Results show that the
Fuzzy ART neural network can solve both binary and non-binary problems effectively.
Results also show that parameter combinations for binary problems differ from
parameter combinations for non-binary problems.
INDEX KEYWORDS: Decision support systems; Fuzzy control; Learning algorithms;
Neural networks; Parameter estimation; Problem solving; Production engineering,
Cell-formation (CF) problems; Direct clustering algorithm (DCA), Cellular
manufacturing
REFERENCES: Aljaber, N., Baek, W., Chen, C.L., A tabu search approach to the cell-
Arbib, M.A., (1998) The Handbook of Brain Theory and Neural Networks, , London: MIT
Press;
Boctor, F.F., A linear formulation of the machine-part cell-formation problem
Carpenter, G.A., Grossberg, S., Rosen, D.B., Fuzzy ART: Fast stable learning and
categorizing of analog patterns by an adaptive resonance system (1991) Neural
Networks, 4, pp. 759-771;
Chen, S.J., Cheng, C.S., A neural network-based cell-formation algorithm in
293-318;
Chu, C.H., Manufacturing cell-formation by competitive learning (1993)
Chu, C.H., An improved neural network for manufacturing cell-formation (1997)
Decision Support Systems, 20, pp. 279-295;
pp. 893-913;
Kaparthi, S., Suresh, N.C., Machine-component cell-formation in group technology: A
pp. 1353-1367;
Leem, C.W., Chen, J.G., Fuzzy set based machine-cell-formation in cellular
manufacturing (1996) Journal of Intelligent Manufacturing, 7, pp. 355-364;
Liao, T.W., Chen, L., An evaluation of ART1 neural models for GT part family and
machine cell forming (1993) Journal of Manufacturing Systems, 12, pp. 282-290;
Lozano, S., Diaz, B.A., Eguia, I., Onieva, L., A one-step tabu search algorithm for
pp. 509-516;
Moon, Y.B., Forming part-machine families for cellular manufacturing: A neural
5, pp. 278-291;
Mukhopadhyay, S.K., Sarkar, P., Panda, R.P., Machine-component grouping in cellular
manufacturing by multidimensional scaling (1994) International Journal of
Suresh, N.C., Kaparthi, S., Performance of Fuzzy ART neural network for group
technology cell-formation (1994) International Journal of Production Research, 32,
pp. 1693-1713
CORRESPONDENCE ADDRESS: Peker, A.; Department of Industrial Engineering, Selcuk
University, 42040 Campus, Konya, Turkey; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Cao, Q., McKnew, M.A.

7202487590;6603151943;
Partial termination rule of Lagrangian relaxation for manufacturing cell formation
problems
0548%2897%2900004-X&partnerID=40&md5=f794a19757e606b7623c36f7b543bfb2
DOI: 10.1016/S0305-0548(97)00004-X
AFFILIATIONS: Dept. Comp. Sci. Quantit. Methods, Winthrop University, Rock Hill, SC
Management Department, 407 Sirrine Hall, Clemson University, P.O. Box 341305,
Clemson, SC 29634-1305, United States
ABSTRACT: Mathematical programming models for manufacturing cell formation problems
are primarily integer programming models with the special structure of being
"multidivision problems". Lagrangian relaxation has been one of the best
decomposition approaches and enabled the solution of problems of practical size.
This research develops a partial termination rule for the Lagrangian relaxation
algorithm. While the existing algorithm solves all submodels in each iteration, the
partial termination rule recognizes early termination of some submodels. This
results in a substantial reduction of computation while generating the same
solution. The new termination rule is proven mathematically. Thus, its
applicability extends beyond the solution of the manufacturing cell formation
problem. © 1998 Published by Elsevier Science Ltd. All rights reserved.
INDEX KEYWORDS: Algorithms; Cellular manufacturing; Computational methods; Integer
programming; Iterative methods; Mathematical models; Problem solving, Lagrangian
relaxation, Operations research
REFERENCES: Wemmerlöv, U., Hyer, N.L., Research issues in cellular manufacturing
Wemmerlöv, U., Hyer, N.L., Cellular manufacturing in the U.S. industry: A survey of
user (1989) International Journal of Production Research, 27, pp. 1511-1530;
Cao, Q., McKnew, M.A., On modeling the design of cellular manufacturing systems
(1994) International Journal of Flexible Manufacturing Systems, 6, pp. 155-172;
Lee, S.M., Moore, L.J., Taylor, B.W., (1990) Management Science, , Allyn and Bacon,
Maryland;
Fisher, M.L., The Lagrangian relaxation method for solving integer programming
problems (1981) Management Science, 26, pp. 1-18;
systems - An integer programming approach (1989) International Journal of
Denardo, E.V., (1982) Dynamic Programming: Models and Applications, , Prentice-
Hall, New Jersey
CORRESPONDENCE ADDRESS: McKnew, M.A.; Management Department, 407 Sirrine Hall,
Clemson University, P.O. Box 341305, Clemson, SC 29634-1305, United States
ISSN: 03050548
CODEN: CMORA
ABBREVIATED SOURCE TITLE: Comput Oper Res
SOURCE: Scopus
Chen, Ming-Laing, Chen, Chuen-Lung
57209988933;7501952022;
Solving cell formation problems using ART1&TS
(1996) Industrial Engineering Research - Conference Proceedings, pp. 43-48.
0030373735&partnerID=40&md5=bd8ee62c0dc8b7f269f6eb24d583b86f
ABSTRACT: Adaptive resonance theory (ART1) network is one of the popular neural
networks used to solve the cell formation problem. Several modifications of ART1
for the same problem have been published lately. In this paper, we integrate an
ART1 model modified by Rao and Gu with a basic tabu search (TS) heuristic to solve
the cell formation problem with intercell moves (or exception elements) as the
objective. This approach (ART1&TS) first constructs component clusters using the
ART1 network, then refines the solution using the basic tabu search heuristic. This
algorithm is applied to many popular examples for the candidate problem, and the
experiments show that the algorithm resulted in an outstanding performance without
limitations in problem size and in structure of data.
INDEX KEYWORDS: Algorithms; Data structures; Heuristic methods; Manufacturing data
processing; Mathematical models; Neural networks; Problem solving, Adaptive
resonance theory; Cell formation; Tabu search, Manufacture
CORRESPONDENCE ADDRESS: Chen, Ming-Laing
EDITORS: Askin R.G., Bidanda B., Jagdale S.
PUBLISHER: IIE, Norcross, GA, United States
CODEN: IERCE
ABBREVIATED SOURCE TITLE: Ind Eng Res Conf Proc
SOURCE: Scopus
Boulif, M., Atif, K.

10045183300;7801495770;
A new fuzzy genetic algorithm for the dynamic bi-objective cell formation problem
considering passive and active strategies
(2008) International Journal of Approximate Reasoning, 47 (2), pp. 141-165. Cited
18 times.
36248989733&doi=10.1016%2fj.ijar.2007.03.003&partnerID=40&md5=a1223ccd4cd4b4e04e1c5
f8045b1dbc8
DOI: 10.1016/j.ijar.2007.03.003
AFFILIATIONS: Département d'Informatique, Faculté des Sciences, Université M'hamed
Bouguerra à Boumerdès, Avenue de l'indépendance, 35000 Boumerdès, Algeria;
Département d'Informatique, Faculté Génie Electrique et Informatique, Université
des Sciences et de la Technologie Houari Boumediene, BP 32, El-Alia, 16111
Babezzouar, Alger, Algeria
ABSTRACT: This paper deals with manufacturing cell formation considering the
dynamic behavior of the production system. First, we discuss the importance of
taking into account the dynamic aspect of the problem that has been poorly studied
in the related literature. We argue that by considering a multi-periodic planning
horizon, we can tackle the problem according to two strategies: passive and active.
The first strategy consists of maintaining the same composition of machines during
the overall planning horizon, while the second allows performing a different
composition for each period. We present a graph theory model for the problem. For
the passive cell formation problem (PCFP), we prove that it amounts to a cell
formation problem in a static system. In order to solve the active cell formation
problem (ACFP), we propose a Shortest Path heuristic (SP) and a Genetic Algorithm
(GA) based method. When the decision maker wants to choose the most adequate
strategy for its environment, we state that the decision problem between active and
passive strategies can be solved by solving ACFP. However, the complexity of ACFP
justifies the need to control the presented solving approaches. In this situation,
we propose a new fuzzy logic enhancement to the GA. The results, using this
enhancement, are better than those obtained using the SP method or the GA alone. ©
2007 Elsevier Inc. All rights reserved.
AUTHOR KEYWORDS: Active and passive strategies; Dynamic production system;
Genetic algorithm; Graph partitioning; Linguistic fuzzy modeling; Manufacturing
cell formation
INDEX KEYWORDS: Chemical analysis; Genetic algorithms; Graph theory, Cell
formation; Dynamic production system; Graph partitioning; Linguistic Fuzzy
modeling, Fuzzy systems
REFERENCES: Batta, R., Comment on the dynamics of plant layout (1987) Manage. Sci.,
33 (8), p. 1065;
Boulif, M., Atif, K., A new Branch-&-Bound-enhanced genetic algorithm for the
manufacturing cell formation problem (2006) Comput. Operat. Res., 33, pp. 2219-
2245;
cellular manufacturing environment (1998) Ann. Oper. Res., 77, pp. 109-128;
Chen, S.J., Hearagu, S., Stepwise decomposition approaches for large scale cell
formation problems (1999) Eur. J. Oper. Res., 113, pp. 64-79;
Garey, D.L., Johnson, D.S., (1979) Computers and Intractability: A Guide to the
Theory of NP-completeness, , W.H. Freeman & Co., San Francisco;
Learning, , Addison Wesley, Reading, MA;
system (1990) Int. J. Prod. Res., 28, pp. 1247-1269;
Gupta, Y.P., Gupta, M.C., Kumar, A., Sundram, C., Minimizing total intercell and
intracell moves in cellular manufacturing: a genetic algorithm approach (1995) Int.
J. Integ. Manuf., 8 (2), pp. 92-101;
Harhalakis, G., Proth, J.M., Xie, X., Manufacturing cell design using simulated
annealing: an industrial application (1990) J. Intell. Manuf., 1, pp. 185-191;
Michigan Press, Ann Arbor;
Hormozi, A., Khumawala, B., An improved algorithm for solving a multi-period
facility location problem (1996) IIE Trans., 28, pp. 105-114;
formation with sequence data (1998) Int. J. Prod. Res., 36, pp. 157-179;
using rank order clustering algorithm (1980) Int. J. Prod. Res., 18, pp. 213-232;
Kusiak, A., Chow, W.S., Efficient solving of The Group Technology Problem (1987) J.
Manuf. Sys., 6, pp. 117-124;
Lee, M., Takagi, H., A framework for studying the effects of dynamic crossover,
mutation, and population sizing in genetic algorithms (1995) IEEE World Wiseperson
Workshop on Fuzzy Logic and Neural Nets/Genetic Algorithms, pp. 111-126., Furuhashi
T. (Ed), Springer-Verlag (special issue);
Int. J. Prod. Res., 32 (2), pp. 273-297;
Logendran, R., Ramakrishna, P., Manufacturing cell formation in the presence of Lot
splitting and multiple units of same machine (1995) Int. J. Prod. Res., 33, pp.
675-693;
Mamdani, E.H., Application of fuzzy logic to approximate reasoning using linguistic
system (1977) Fuzzy Sets Systems, 26, pp. 1182-1191;
McAuley, J., Machine grouping for efficient production (1972) Prod. Engng., 52
(February), pp. 53-57;
Rajagopalan, R., Batra, J.L., Design of cellular production systems: A graph
theoretic approach (1975) Int. J. Prod. Res., 13 (6), pp. 567-579;
Rosenblatt, M.J., The dynamics of plant layout (1986) Manage. Sci., 9, pp. 76-86;
Sweeney, D.J., Tatham, R.L., An improved long-run model for multiple warehouse
location (1976) Manage. Sci., 22, pp. 748-758;
Taboun, S.M., Sharma, A., A weighted index for the design of Cellular Manufacturing
Systems (1991) Comp. Ind. Engng., 21 (1-4), pp. 273-277;
multi period planning horizons of cellular manufacturing systems (1998) Prod.
Plann. Control, 9 6, pp. 561-571;
material flow approach based on operation sequences (1990) IIE Trans., 22 (1), pp.
84-97;
Wicks, E., Reasor, R.J., Designing cellular manufacturing systems with dynamic part
populations (1999) IIE Trans., 31, pp. 11-20;
Ying, H., (2000) Fuzzy Control and Modelling, Analytical Foundations and
Applications, , IEEE Press, Berlin
CORRESPONDENCE ADDRESS: Boulif, M.; Département d'Informatique, Faculté des
Sciences, Université M'hamed Bouguerra à Boumerdès, Avenue de l'indépendance, 35000
Boumerdès, Algeria; email: [email protected]
ISSN: 0888613X
CODEN: IJARE
ABBREVIATED SOURCE TITLE: Int J Approximate Reasoning
SOURCE: Scopus
Chen, M.-L., Wu, C.-M., Chen, C.-L.

56886609300;7501668049;7501952022;
An integrated approach of art1 and tabu search to solve cell formation problems
(2002) Journal of the Chinese Institute of Industrial Engineers, 19 (3), pp. 62-74.
Cited 5 times.
24644495123&doi=10.1080%2f10170660209509205&partnerID=40&md5=2d59734d7f62df2383b44b
5681d18b98
DOI: 10.1080/10170660209509205
United States;
Department of Business Management, National Taipei University Technology, 1,
Section 3, Chung-Hsio East Road, Taipei, 106, Taiwan;
Department of Management Information Systems, National Chengchi University, Taiwan
ABSTRACT: Adaptive resonance theory (ART1) network is one of the many popular
neural networks used to solve the cell formation problem. Several modifications of
ART1 for the problem have recently been published. In this study, a modified ART1
network is integrated with an effective optimization technique, Tabu Search (TS),
to solve cell formation problems. The number of exceptional elements (EE) and group
efficiency (GE) are considered as the objectives for the problems under the
constraints of the number of cells and cell size. This proposed heuristic (ART1&TS)
first constructs a cell formation using a modified ART1, and then refines the
solution using a basic TS heuristic. ART1&TS has been applied to most popular
examples in the literature. The computational results showed that it generated the
best solutions in most of the examples. © 2002 Taylor & Francis Group, LLC.
AUTHOR KEYWORDS: Adaptive resonance theory (ART1); Cell formation; Tabu search
INDEX KEYWORDS: Computation theory; Constraint theory; Neural networks;
Optimization; Problem solving; Resonance, Adaptive resonance theory (ART1); Cell
formation; Cell size; Tabu search, Search engines
REFERENCES: Askin, R.G., Cresswell, S.H., Goldberg, J.B., Vkhariaa, A.J., A
hamiltonian path approach to reordering the part-machine matrix for cellular
1100;
Boctor, F.F., A liner formulation of the machine-part cell formation (1991)
2097-2116;
Buridge, J.L., (1975) The introduction of Group Technology, , New York: John Wiley;
Carpenter, G.A., Grossberg, S., Neural dynamics of category learning and

recognition: Attention, memory consolidation and amnesia (1986) Brain Structure,
Learning and memory, , Davis J.L., Newbrugh R.W., Wegman E.J., (eds), Boulder,
Colorado;
Research, 24, pp. 451-464;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAK-an algorithm for concurrent
Chen, C.L., Cotmvo, N.A., Baek, W., A simulated annealing solution to the cell
2601-2614;
293-318;
Dagli, C., Huggahalli, R., Neural network approach to group technology (1991)
Knowledge Based Systems and Neural Networks: Techniques and Applications, , Sharda
R., Cheung J.Y., Cochran W.J., Oklahoma S., (eds), New York: Elsevier;
Glover, F., Tabu search. part I (1989) ORSA Journal on Computing, 1, pp. 190-206;
Glover, F., Laguna, M., Tabu Search (1993) Morden Heuristic Techniques for
Combinatorial, , Reeves C.R., (ed), Oxford: Blackwell Scientific;
Heragu, S., Group technology and cellular manufacturing (1994) IEEE Transactions on
Systems, Man, and Cybernetics, 24, pp. 203-214;
pp. 1353-1367;
Kaparthi, S., Suresh, N.C., Cerveny, R.P., An improved neural network leader
algorithm for part-machine grouping in group technology (1993) European Journal of
King, J.R., Nakornchai, V., Machine component group formation in group technology-
117-133;
937-948;
implementation: A state-of-the-art survey (1985) Omega, 13, pp. 381-389;
Rao, H.A., Gu, P., Design of cellular manufacturing systems: A neural net approach
(1992) International Journal of System Automation: Research and Applications, 2,
pp. 407-424;
Research, 28, pp. 145-152;
Taillard, E., Some efficient heuristic methods for the flow shop sequencing problem
Widmer, M., Hertz, A., A new heuristic method for the flow shop sequencing problem
(1989) European Journal of Operational Research, 41, pp. 186-193
CORRESPONDENCE ADDRESS: Wu, C.-M.; Department of Business Management, National
Taipei University Technology, 1, Section 3, Chung-Hsio East Road, Taipei, 106,
Taiwan; email: [email protected]
ISSN: 10170669
SOURCE: Scopus
Muruganandam, A., Prabhaharan, G., Asokan, P., Baskaran, V.

8401657600;6506393742;6701567395;57196697141;
A memetic algorithm approach to the cell formation problem
18144418231&doi=10.1007%2fs00170-003-1912-
7&partnerID=40&md5=57a741c6a2d735c80b7fe163d420e6ed
DOI: 10.1007/s00170-003-1912-7
AFFILIATIONS: Department of Mechanical Engineering, PSNA Coll. of Eng. and
Technology, Dindigul, Tamil Nadu, India;
Department of Production Engineering, REC Tiruchirappalli, Tamil Nadu, India
ABSTRACT: In the past three decades many studies have been carried out on cellular
manufacturing. The main problem in the development of cellular manufacturing is
that of machine cell formation. In this paper a new metaheuristic called a memetic
algorithm (MA) is introduced to solve the machine cell formation problem in group
technology. The objective functions considered in this work are (a) minimization of
total number of moves and (b) minimization of cell load variation and the
constraints considered are minimum number of machines in each cell as two and each
machine should be assigned in one cell only. Effort has been made to develop an
algorithm that is more reliable than conventional methods and some non-traditional
optimization techniques like the genetic algorithm (GA) and the tabu search
algorithm (TS) for solving machine cell formation problem. In the memetic algorithm
approach local optimization is applied to each newly generated offspring at the end
of genetic algorithm. © Springer-Verlag London Limited 2004.
AUTHOR KEYWORDS: Cellular Manufacturing Systems; Genetic Algorithm; Group
Technology; Memetic Algorithm; Tabu Search Algorithm
INDEX KEYWORDS: Algorithms; Genetic algorithms; Group technology; Heuristic
methods; Integer programming; Linear programming; Optimization; Quadratic
programming; Traveling salesman problem, Cellular manufacturing systems; Machine
cells; Memetic algorithm; Tabu search algorithm, Cellular manufacturing
REFERENCES: Vakharia, A.J., Methods of cell formation in group technology: A
framework for evaluation (1986) J Oper Manage, 6 (3), pp. 257-271;
Opitz, H., (1970) A Classification System to Describe Work Pieces, , Pergamon, New
York;
Burbidge, L., Production flow analysis (1963) Prod Eng, 42, pp. 742-752;
King, J.R., Machine-component grouping in production flow analysis; an approach
using a rank order-clustering algorithm (1980) Int J Prod Res, 18 (2), pp. 213-232;
McCormick, W.T., Schweitzer, R.J., White, T.W., Problem decomposition and data
reorganization by clustering techniques (1972) Oper Res, 20, pp. 993-1009;
57;
Seifoddini, H., Wolfe, P., Application of similarity coefficient methods in GT
(1990) IIE Trans, 18 (3), pp. 271-277;
Rajagopalan, R., Batra, J.L., Design of cellular production systems - A graph
theory approach (1975) Int J Prod Res, 13 (6), pp. 567-579;
(1991) Int J Prod Res, 29 (2), pp. 343-356;
Vakharia, A.J., Chang, Y.L., Cell formation in group technology: A combinatorial
search approach (1997) Int J Prod Res, 35 (7), pp. 2025-2043;
Steudle, H., Ballakur, A., A dynamic programming based heuristic for machine
grouping in manufacturing cell formation (1987) Comput Ind Eng, 12 (3), pp. 215-
222;
(1991) J Oper Manage, 10 (1), pp. 28-43;
Chen, W.H., Srivstava, B., Simulated annealing procedures for forming machine cell
in-group technology (1994) Eur J Oper Res, 75 (1), pp. 100-111;
simulated annealing; an experimental evaluation (1992) Eur J Oper Res, 63, pp. 409-
422;
component grouping problems with multiple objectives (1992) Comput Ind Eng, 22 (4),
pp. 469-480;
Logendran, R., Ramakrishna, P., Manufacturing cell formation in the presence of lot
splitting and multiple units of the same machine (1995) Int J Prod Res, 31, pp.
657-693;
Asokan, P., Prabhakaran, G., Satheesh, K.G., Machine cell grouping in cellular
manufacturing systems using nontraditional optimization techniques - A comparative
study (2001) Int J Adv Manuf Technol, 18, pp. 140-147;
Basu, A., Hyer, N., Shtub, A., An expert system based approach to manufacturing
cell design (1995) Int J Prod Res, 33 (10), pp. 2739-2755;
Chow, W., Hawaleshka, O., A novel machine grouping and knowledge based approach for
cellular manufacturing (1993) Eur J Oper Res, 69, pp. 357-372;
Singh, N., Rajamaani, D., (1996) Cellular Manufacturing Systems Design Planning and
Control, , Chapman and Hall, New York;
Selim, H.M., Askin, R.G., Vakharia, A.J., Cell formation in group technology
evaluation and directions for future research (1998) Comput Ind Eng, 34 (1), pp. 3-
20;
Chen, C., Back, C.N., A simulated annealing solution to the cell formation problem
(1995) Int J Prod Res, 33 (9), pp. 2601-2614;
Guptha, Y., Guptha, M., Kumar, A., Sundram, C., Minimization of total intercell and
intra cell moves in cellular manufacturing: A genetic algorithms (1995) Int J
Comput Integr Manuf, 8 (2), pp. 92-101;
Joines, J.A., Culbreth, C.T., King, R.E., Manufacturing cell design an integer
programming model employing genetic algorithms (1996) IIE Trans, 28 (1), pp. 69-85;
Logendran, R., Ramakrishnan, P., Srikandarajah, C., Tabu search based heuristics
for cellular manufacturing system in the presence of alternative process plans
(1994) Int J Prod Res, 32 (2), pp. 273-297;
Moscato, P., Norman, M.G., Amemetic approach for the traveling salesman problem -
Implementation of a computational ecology for combinatorial optimization on
message-passing systems (1992) Proceedings of the International Conference on
Parallel Computing and Transporter Applications, pp. 187-194., IOS Press,
Amsterdam;
Radcliffe, N.J., Surry, P.D., Formal memetic algorithms (1994) Lecture Notes in
Computer Science (Lecture Notes in Evolutionary Computing), 865, pp. 250-263.,
Fogarty TC (ed) vol 865. Springer, Berlin Heidelberg New York;
Glover, F., Tabu search, part I (1989) ORSA J Comput, 1, pp. 190-206;
Glover, F., Tabu search, part II (1990) ORSA J Comput, 2, pp. 4-32;
Aljaber, N., Back, W., Chen, C.-L., A tabu search approach to the cell formation
Eng, 28 (3), pp. 485-494
CORRESPONDENCE ADDRESS: Muruganandam, A.; Department of Mechanical Engineering,
PSNA Coll. of Eng. and Technology, Dindigul, Tamil Nadu, India; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Zhu, Z., Heady, R.B., Reiners, S.

55721577100;6602816832;6601915523;
An efficient zero-one formulation of the cell formation problem
8352%2894%2900223-A&partnerID=40&md5=99b9251d7e58a7688237b06c76f0e151
DOI: 10.1016/0360-8352(94)00223-A
AFFILIATIONS: Department of Management and Quantitative Methods, The University of
Southwestern Louisiana, Lafayette, LA 70504-3570, United States
ABSTRACT: This paper presents a new zero-one integer linear programming formulation
of the machine cell formation problem for a cellular manufacturing environment.
This formulation has a lean structure and is demonstrated to provide optimal
solutions that require much less solution time than the previously published
formulation. © 1995.
INDEX KEYWORDS: Constraint theory; Graph theory; Heuristic methods; Manufacture;
Mathematical models; Matrix algebra; Problem solving, Cellular manufacturing; Group
technology; Machine cells formation; Machine component group analysis; Production
flow analysis; Wei-Gaither model, Linear programming
REFERENCES: Miltenburg, Zhang, A comparative evaluation of nine well-known
algorithms for solving the cell formation problem in group technology (1991) J.
Oper. Mgmt, 10, pp. 44-72;
Gaither, (1992) Prod. Oper. Mgmt., , HBJ, Fort Worth, TX;
B. Dale. GT reviewed. Mach. Prod. Engng 13, 372; N. Hyer. The potential of group
technology for US manufacturing. J. Oper. Mgmt 3, 183–189; S. Mehra and R. A.
Inman. Determining the critical elements of just-in-time implementation. Decis.
Sci. 23, 160–174; Evans, Anderson, Sweeney, Williams, (1990) Applied Production and
Operations Management, , West Publishing, St Paul, MN;
Burbidge, A manual method of production flow analysis (1977) Production Engineer,
56, pp. 34-44;
McAulley, Machine group for efficient production (1972) Production Engineer, 52,
pp. 53-63;
King, Nakoranchai, Machine-component group formation in group technology review and
Rajagopalan, Batra, Design of cellular production systems—a graph theoretic
Wei, Gaither, An optimal model for cell formation decisions (1990) Decision
Sciences, 21, pp. 416-433;
Gunasingh, Lashkari, Simultaneous group of parts and machines in cellular
manufacturing systems—an integer programming approach (1991) Computers & Industrial
Logendran, A binary integer programming approach for simultaneous machine-part
grouping in cellular manufacturing systems (1993) Computers Ind. Engng, 24, pp.
329-336;
Lashkari, Gunasingh, A Lagrangean relaxation approach to machine allocation in
cellular manufacturing systems (1990) Computers Ind. Engng, 19, pp. 442-446;
Pesch, Jarvis, Troyer, Turning around the rust-belt factory; the $1.98 solution
(1993) Prod. Inv. Mgmt. J., 34, pp. 57-62;
Camm, Dearing, Tadisina, The calhoun textile mill case: an exercise on the
significance of linear programming model formulation (1987) IIE Trans., 19, pp. 23-
28;
King, Machine-component group formation in group technology (1980) OMEGA, 8, pp.
193-199;
Kumar, Vannelli, Strategic subcontracting for efficient disaggregated manufacturing
CORRESPONDENCE ADDRESS: Zhu, Z.; Department of Management and Quantitative Methods,
The University of Southwestern Louisiana, Lafayette, LA 70504-3570, United States
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Moradgholi, M., Paydar, M.M., Mahdavi, I., Jouzdani, J.

57190394725;23025569300;16417373200;24463419200;
A genetic algorithm for a bi-objective mathematical model for dynamic virtual cell
formation problem
(2016) Journal of Industrial Engineering International, 12 (3), pp. 343-359. Cited
11 times.
84979688602&doi=10.1007%2fs40092-016-0151-
0&partnerID=40&md5=a3c5c7079b54c4c99072db532cfee14d
DOI: 10.1007/s40092-016-0151-0
Department of Industrial Engineering, Babol University of Technology, Babol, Iran;
Department of Industrial Engineering, Najafabad Branch, Islamic Azad University,
Najafabad, Iran
ABSTRACT: Nowadays, with the increasing pressure of the competitive business
environment and demand for diverse products, manufacturers are force to seek for
solutions that reduce production costs and rise product quality. Cellular
manufacturing system (CMS), as a means to this end, has been a point of attraction
to both researchers and practitioners. Limitations of cell formation problem (CFP),
as one of important topics in CMS, have led to the introduction of virtual CMS
(VCMS). This research addresses a bi-objective dynamic virtual cell formation
problem (DVCFP) with the objective of finding the optimal formation of cells,
considering the material handling costs, fixed machine installation costs and
variable production costs of machines and workforce. Furthermore, we consider
different skills on different machines in workforce assignment in a multi-period
planning horizon. The bi-objective model is transformed to a single-objective fuzzy
goal programming model and to show its performance; numerical examples are solved
using the LINGO software. In addition, genetic algorithm (GA) is customized to
tackle large-scale instances of the problems to show the performance of the
solution method. © 2016, The Author(s).
AUTHOR KEYWORDS: Bi-objective mathematical programming; Fuzzy goal programming;
Genetic algorithm; Virtual cell formation; Workforce assignment
REFERENCES: Back, T., Fogel, D., Michalawecz, Z., (1997) Handbook of evolutionary
computation, , Oxford University Press, Oxford;
cubic cell formation problem considering different worker skills (2014) Comput Ind
Eng, 75, pp. 31-40;
Davis, L., (1991) Handbook of genetic algorithms, , Van Nostrand, New York;
Goldberg, D.E., (1989) Genetic algorithms: search, optimization and machine
learning, , Addison-Wesley Inc, Boston;
Han, W., Wang, F., Lv, J., Virtual cellular multi-period formation under the
dynamic environment (2014) IERI Procedia, 10, pp. 98-104;
Heragu, S.S., Group technology and cellular manufacturing (1994) IEEE Trans Syst
Man Cybern, 24 (2), pp. 203-214;
Liang, F., Fung, R.Y.K., Jiang, Z., Modelling approach and behavior analysis of
manufacturing resources in virtual cellular manufacturing systems using resource
element concept (2011) Int J Comput Integr Manuf, 24 (12), pp. 1168-1182;
Expert Syst Appl, 36, pp. 6598-6604;
Mahdav, I., Aalaei, A., Paydar, M.M., Solimanpur, M., Multi-objective cell
(2011) Int J Prod Res, 49 (21), pp. 6517-6537;
Mahdavi, I., Paydar, M.M., Solimanpur, M., Solving a new mathematical model for
cellular manufacturing system: a fuzzy goal programming approach (2011) Iran J Oper
Res, 2 (2), pp. 35-47;
Mak, K.L., Peng, X.X., Lau, T.L., An ant colony optimization algorithm for
scheduling virtual cellular manufacturing systems (2007) Int J Comput Integr Manuf,
20 (6), pp. 524-537;
Narasimhan, R., Goal programming in a fuzzy environment (1980) Decis Sci, 11, pp.
325-326;
virtual cellular manufacturing system (2012) Int J Manag Sci Eng Manag, 7 (2), pp.
89-95;
Nomden, G., Slomp, J., Suresh, N.C., Virtual manufacturing cells: a taxonomy of
past research and identification of future research (2006) Int J Flex Manuf Syst,
17, pp. 71-92;
algorithm for the cell formation problem based on grouping efficacy (2013) Comput
Oper Res, 40, pp. 980-990;
Appl Soft Comput, 11, pp. 3160-3169;
221-225;
Slomp, J., Chowdary, B.V., Suresh, N.C., Design of virtual manufacturing cells: a
mathematical programming approach (2005) Robot Comput Integr Manuf, 21 (3), pp.
273-288;
Thomalla, C.S., Formation of virtual cells in manufacturing systems. In:
Proceedings of group technology/cellular manufacturing world symposium, San Juan
(2000) pp 13–16;
Yang, T., Ignizio, J.P., Kism, H.J., Fuzzy programming with nonlinear membership
functions: piecewise linear approximation (1991) Fuzzy Sets Syst, 11, pp. 39-53;
functions (1978) Fuzzy Sets Syst, 1, pp. 45-55
CORRESPONDENCE ADDRESS: Paydar, M.M.; Department of Industrial Engineering, Babol
University of TechnologyIran; email: [email protected]
ISSN: 17355702
SOURCE: Scopus
Erozan, I., Ustun, O., Torkul, O.

41261305600;55911445000;6507811230;
An improved fuzzy c-means algorithm for cell formation problems with alternative
routes
(2015) International Journal of Fuzzy System Applications, 4 (4), pp. 15-30.
84937777764&doi=10.4018%2fIJFSA.2015100102&partnerID=40&md5=fc1c1ab04b3139c50c5c076
1e4915de1
DOI: 10.4018/IJFSA.2015100102
AFFILIATIONS: Industrial Engineering Department, Dumlupinar University, Kutahya,
Turkey;
Industrial Engineering Department, Sakarya University, Sakarya, Turkey
ABSTRACT: Cell formation is one of the most important problems faced in designing
cellular manufacturing systems. Fuzzy c-means (FCM) has been successfully used to
solve a variety of the cell formation problems because it allows the representation
of uncertain information. Many products or parts to be manufactured in the real
world have alternative routes. To ignore the routes is not a realistic approach.
However, most FCM approaches used to form a cellular system in the literature have
ignored or avoided using the alternative routes because of its complexity. In this
paper, an improved FCM algorithm has been proposed to overcome the computational
complexity of the alternative routes. The improved algorithm presents an easy and
practical way to solve the cell formation problems with alternative routes. An
experiment was designed to test and compare the performance of the improved
algorithm. The results of the experiment have shown that most of the obtained
results are close to the test problems and better than the conventional crisp
methods in the literature. Copyright © 2015, IGI Global.
AUTHOR KEYWORDS: Alternative routes; Cell formation; Cellular manufacturing;
Fuzzy c-means
REFERENCES: Azadeh, A., Anvari, M., Ziaei, B., Sadeghi, K., An integrated fuzzy
DEA-fuzzy C-means-simulation for optimization of operator allocation in cellular
manufacturing systems (2010) International Journal of Advanced Manufacturing
Technology, 46 (1-4), pp. 361-375;
Bezdek, J.C., (1981) Pattern Recognition with Fuzzy Objective Function
Algorithms, , New York: Plenum Press;
Chan, F.T.S., Pau, K.W., Chan, L.Y., Lo, V.H.Y., Cell formation problem with
consideration of both intracellular and intercellular movements (2008)
Economics, 103 (2), pp. 767-783;
Gindy, N.N.Z., Ratchev, M., Case, K., Component grouping for GT applications-A
fuzzy clustering approach with validity measure (1995) International Journal of
Javadian, N., Rezaeian, J., Mali, Y., Multi-objective cellular manufacturing system
under machines with different life-cycle using genetic algorithm (2007) Proceedings
of World Academy of Science. Engineering and Technology, 30, pp. 247-251;
Kao, Y., Chen, C.C., A differential evolution fuzzy clustering approach to machine
65 (9-12), pp. 1247-1259;
Kor, H., Iranmanesh, H., Haleh, H., Hatefi, S.M., A Multi-objective Genetic
Algorithm for optimization of Cellular manufacturing system (2009) 2009
International Conference on Computer Engineering and Technology, pp. 252-256;
Li, L., Chu, C.H., Wang, Y., Yan, W., An improved fuzzy c-means algorithm for
manufacturing cell formation (2002) Fuzzy Systems, FUZZ-IEEE'02. Proceedings of the
2002 IEEE International Conference on;
pp. 1049-1062;
Li, J., Chu, C.P.L., Yunfeng, W., An in-depth analysis of fuzzy c-means clustering
for cellular manufacturing (2008) Fuzzy Systems and Knowledge Discovery, FSKD'08,
Fifth International Conference on, pp. 42-46;
Li, K.H., Stephen, S.F.P., Pi, C.K., Dawel, P., Application of fuzzy C-means
algorithm in SMT assembly grouping problem (2003) The HKIE Transactions, 10 (3),
pp. 20-25;
Pozano, S., Dobado, D., Parraneta, J., Onieva, P., Modified fuzzy C-means algorithm
Moghaddam, R.P., Bourani, M.R., Amin, G.R., Siadat, A., A cell formation problem
considering machine utilization and alternative process routes by scatter search
(2012) Journal of Intelligent Manufacturing, 23 (4), pp. 1127-1139;
Ponnambalam, S.G., Aravindan, P., Design of cellular manufacturing systems using
objective functional clustering algorithms (1994) International Journal of Advanced
Rajamani, D., Singh, N., Aneja, Y., Integrated design of cellular manufacturing
Ranjith, C.R., Ahmed, T.O., Genetic access on combinatorial problems (2009) 4.
International Conference on Information Technology, , Jun. 3-5, AL-Zaytoonah
University, Amman, Jordan;
Ravichandran, K.S., Rao, K.C.S., A new approach to fuzzy part-family formation in
routings (1998) The Journal of the Operational Research Society, 49 (9), pp. 953-
965;
Saxena, L.K., Jain, P.K., Dynamic cellular manufacturing systems design-A
comprehensive model (2011) International Journal of Advanced Manufacturing
Technology, 55 (1-4), pp. 11-34;
Susanto, S., Kennedy, R.D., Price, J.W.H., A new fuzzy-c-means and assignment
type clusters separately (1999) Production Planning and Control, 10 (4), pp. 375-
368;
Torkul, O., Cedimoglu, I.P.L., Geyik, A.K., An application of fuzzy clustering to
Wang, J., An approach to determining the optimal cell number of manufacturing cell
formation (2013) Telkomnika, 11 (4), pp. 1781-1786;
Wang, W., Zhang, Y.L.Y., Zhang, X., Lhe global fuzzy C-means clustering algorithm
(2006) Proceedings of the 6th World Congress on Intelligent Control and Automation,
, June 21-23;
Journal of Production Research, 55 (1), pp. 29-49., WemmerlSov;
Xu, H.P., Wang, H.P., Part family formation for GT application based on fuzzy
1651;
Yan, Z., Wang, J., Fan, J., Machine-cell and part-family formation in cellular
manufacturing using a two-phase clustering algorithm (2014) 19th World Congress the
International Federation of Automatic Control, pp. 2065-2610;
part family and machine cell formation for GL applications (2006) International
cell formation problem (2005) International Journal of Production Research, 43 (4-
15), pp. 829-853;
multiple routes and multipleobjectives (2000) International Journal of Production
Research, 38 (2), pp. 385-395
PUBLISHER: IGI Global
ISSN: 2156177X
ABBREVIATED SOURCE TITLE: Int. J. Fuzzy Syst. Appl.
SOURCE: Scopus
Sathish, S., Lakshmanan, A.R., Karuppuswamy, P., Bhagyanathan, C.

57200884681;56609920900;14009357900;56695226000;
An effective Sorensen-single linkage clustering hybrid algorithm for cell formation
problems in cellular manufacturing industry
(2019) Concurrency Computation, art. no. e5211, .
85062487632&doi=10.1002%2fcpe.5211&partnerID=40&md5=76eac9c7eb2c729dcf06e29054e4722
a
DOI: 10.1002/cpe.5211
AFFILIATIONS: Department of Mechanical Engineering, Sri Ramakrishna Engineering
College, Coimbatore, India;
Department of Mechanical Engineering, PSG College of Technology, Coimbatore, India
ABSTRACT: The paper presented here entails technique that is based upon Sorensen's
similarity coefficient as well as the Sorensen- Single Linkage Clustering (SLC)
algorithm, which essentially is a hybrid clustering approach that has been deployed
here to show issue related to cell formation during the process of cellular
engineering. In the following paper and study that has been presented here, the
suggested hybrid algorithm comparison has been drawn versus the existing clustering
algorithms and their performances have been compared specifically the MOD-SLC
modified single linkage or SLC also known as the single linkage clustering
algorithm. The Sorensen-SLC technique and the inferences drawn on the same show
that it performs comparatively better when compared with the MOD-SLC and SLC
algorithms. Additionally, the computation that is necessary for this hybrid
algorithm is absolutely a bare minimal and the computation processing is effective
and easy. © 2019 John Wiley & Sons, Ltd.
AUTHOR KEYWORDS: cell formation problem; cellular manufacturing; clustering
algorithm; machine cell; part family
INDEX KEYWORDS: Cell engineering; Cells; Cellular manufacturing; Cytology, Cell
formation problem; Cellular engineering; Hybrid algorithms; Hybrid clustering;
Machine cell; Part family; Similarity coefficients; Single linkage clustering,
Clustering algorithms
performance studies on functional and cellular manufacturing layouts (1998) Comput
Ind Eng, 34 (1), pp. 77-89;
Kusiak, A., Heragu, S.S., The facility layout problem (1987) Eur J Oper Res, 29
(3), pp. 229-251;
Balakrishnan, J., Cheng, C.H., Dynamic layout algorithms: a state-of-the-art survey
(1998) Omega, 26 (4), pp. 507-521;
Murugan, M., Selladurai, V., Optimization and implementation of cellular
manufacturing system in a pump industry using three cell formation algorithms
review evaluation and directions for future research (1998) Comput Ind Eng, 34 (1),
pp. 3-20;
Shambu, G., Suresh, N.C., Performance of hybrid cellular manufacturing systems: a
computer simulation investigation (2000) Eur J Oper Res, 120 (2), pp. 436-458;
Ghosh, T., Dan, P.K., (2011) An effective machine-part grouping algorithm to
construct manufacturing cells, , In Proceedings of Conference on Industrial
Engineering (NCIE 2011);, Kuala Lumpur, Malaysia;
Sengupta, S., Ghosh, T., Dan, P.K., A hybrid neural network approach to cell
formation in cellular manufacturing (2011) Int J Intell Syst Technol Appl, 10 (4),
pp. 360-376;
Boutsinas, B., Machine-part cell formation using biclustering (2013) Eur J Oper
Res, 230 (3), pp. 563-572;
formation in the design of cellular manufacturing system (2015) Int J Prod Res, 53
(9), pp. 2730-2750;
Mosier, C.T., Taube, L., The facets of group technology and their impacts on
implementation – a state of the art survey (1985) Omega, 13 (5), pp. 381-391;
and Control, , London, UK, Chapman and Hall;
Tariq, A., Hussain, I., Ghafoor, A., Hybrid genetic algorithm for machine-part
grouping (2009) Comput Ind Eng, 56 (1), pp. 347-356;
Chattopadhyay, M., Sengupta, S., Ghosh, T., Dan, P.K., Mazumdar, S., Neuro-genetic
impact on cell formation methods of cellular manufacturing system design: a
quantitative review and analysis (2013) Comput Ind Eng, 64 (1), pp. 256-272;
Dinh, T., Dinh, T., Ferland, J., (2011) A meta-heuristic approach for cell
formation problem, , In Proceedings of the Second Symposium on Information and
Communication Technology;, Hanoi, Vietnam;
Burbidge, J.L., Production flow analysis (1971) Prod Eng, 50 (4-5), pp. 139-152;
problem: a taxonomy and review (2006) Int J Prod Econ, 101 (2), pp. 329-352;
Chu, C.H., Tsai, M., A comparison of three array-based clustering techniques for
manufacturing cell formation (1990) Int J Prod Res, 28 (8), pp. 1417-1433;
Seifoddini, H.K., A note on the similarity coefficient method and the problem of
improper machine assignment in group technology problem (1989) Int J Prod Res, 27,
pp. 1161-1165;
manufacturing systems—a sequential modeling approaches (1989) Comput Ind Eng, 16
(4), pp. 469-476;
Selim, H.M., Abdel Aal, R.M.S., Mahdi, A.I., Formation of machine groups and part
families: a modified SLC method and comparative study (2003) Integr Manuf Syst, 14
(2), pp. 123-137;
cellular manufacturing systems (2007) Int J Prod Res, 45 (4), pp. 913-934;
Satheeshkumar, V., Karthikeyan, K., Renald, C.J.T., Jagadeesh, V., Silambarasan,
R., Bhagyanathan, C., Evaluation of cell formation algorithms and implementation of
MOD-SLC algorithm as an effective cellular manufacturing system in a manufacturing
industry (2014) Int J Curr Eng Technol, pp. 183-190., Special Issue-2;
Baroni-Urbani, C., Buser, M.W., Similarity of binary data (1976) Syst Zool, 25 (3),
pp. 251-259;
Sorensen, T., A method of establishing groups of equal amplitude in plant sociology
based on similarity of species content and its application to analyses of the
vegetation on Danish commons (1948) Videnski Selskab Biologiske Skrifter, 5, pp. 1-
34;
King, J.R., Machine-component group formation in group technology in production
flow analysis: an approach using a rank order clustering algorithm (1980) Int J
Prod Res, 18 (2), pp. 213-232;
Mukhopadhyay, S.K., Gopalakrishnan, A., A vector analytic (VECAN) method for
solving the machine-part grouping problem in GT (1995) Int J Prod Res, 33 (3), pp.
795-818
CORRESPONDENCE ADDRESS: Sathish, S.; Department of Mechanical Engineering, Sri
Ramakrishna Engineering CollegeIndia; email: [email protected]
PUBLISHER: John Wiley and Sons Ltd
ISSN: 15320626
CODEN: CCPEB
ABBREVIATED SOURCE TITLE: Concurr. Comput.
SOURCE: Scopus
Zhu, Y., Li, S.

57195540206;57203292648;
Simultaneous Hierarchical Clustering for Cell Formation Problems with Production
Information
(2018) Mathematical Problems in Engineering, 2018, art. no. 2841325, .
85048176515&doi=10.1155%2f2018%2f2841325&partnerID=40&md5=d74c51a3742826c2545995974
83ba563
DOI: 10.1155/2018/2841325
AFFILIATIONS: Department of Mechanical and Manufacturing Engineering, University of
CalgaryAB, Canada
ABSTRACT: The purpose of this paper is to advance the similarity coefficient method
to solve cell formation (CF) problems in two aspects. Firstly, while numerous
similarity coefficients have been proposed to incorporate different production
factors in literature, a weighted sum formulation is applied to aggregate them into
a nonbinary matrix to indicate the dependency strength among machines and parts.
This practice allows flexible incorporation of multiple production factors in the
resolution of CF problems. Secondly, a two-mode similarity coefficient is applied
to simultaneously form machine groups and part families based on the classical
framework of hierarchical clustering. This practice not only eliminates the
sequential process of grouping machines (or parts) first and then assigning parts
(or machines), but also improves the quality of solutions. The proposed clustering
method has been tested through twelve literature examples. The results demonstrate
that the proposed method can at least yield solutions comparable to the solutions
obtained by metaheuristics. It can yield better results in some instances, as well.
© 2018 Yingyu Zhu and Simon Li.
INDEX KEYWORDS: Engineering; Mathematical techniques, Cell formation problem;
Clustering methods; Hier-archical clustering; Production factors; Quality of
solution; Sequential process; Similarity coefficient methods; Similarity
coefficients, Cellular manufacturing
REFERENCES: McAuley, J., Machine grouping for efficient production (1972)
Production Engineering Research and Development, 51 (2), pp. 53-57;
Yin, Y., Yasuda, K., Similarity coefficientmethods applied to the cell formation
Economics, 101 (2), pp. 329-352;
180;
problems with consideration of multiple production factors (2010) The International
Journal of Advanced Manufacturing Technology, 46 (9-12), pp. 1201-1213;
clustering (2015) Institute of Industrial Engineers (IIE). IIE Transactions, 47
(6), pp. 653-671;
Brusco, M.J., An iterated local search heuristic for cell formation (2015)
Li, S., Mehrabadi, H., Generation of block diagonal forms using hierarchical
clustering for cell formation problems (2014) Proceedings of the 47th CIRP
Conference on Manufacturing Systems, CMS 2014, pp. 44-49., can, April;
manufacturing using ant-colonybased optimization (2010) The International Journal
Sneath, P.H.A., Sokal, R.R., (1973) Numerical Taxonomy: The Principles and Practice
of Numerical Classification, , Freeman, San Francisco;
Tversky, A., Features of similarity (1977) Psychological Review, 84 (4), pp. 327-
352;
Seifoddini, H., Wolfe, P.M., Selection of a threshold value based onmaterial
handling cost inmachine-component grouping (1987) Institute of Industrial Engineers
(IIE). IIE Transactions, 19 (3), pp. 266-270;
alternative routeing (1993) International Journal of Production Research, 31 (6),
pp. 1259-1273;
Chang, C.-C., Wu, T.-H., Wu, C.-W., An approach for multiple attribute group
decision making problems with intervalvalued intuitionistic trapezoidal fuzzy
numbers (2013) Computers & Industrial Engineering, 66 (2), pp. 438-450;
materials flow approach based on operation sequences (1990) Institute of Industrial
Engineers (IIE). IIE Transactions, 22 (1), pp. 84-97;
Askin, R.G., Zhou, M., Formation of independent flow-line cells based on operation
requirements and machine capabilities (1998) Institute of Industrial Engineers
(IIE). IIE Transactions, 30 (4), pp. 319-329;
Goyal, K.K., Jain, P.K., Jain, M., A comprehensive approach to operation sequence
similarity based part family formation in the reconfigurable manufacturing system
Ho, Y.-C., Lee, C.-E.C., Moodie, C.L., Two sequencepattern, matching-based, flow
analysis methods for multiflowlines layout design (1993) International Journal of
Sarker, B.R., Xu, Y., Designing multi-product lines: Job routing in cellular
manufacturing systems (2000) Institute of Industrial Engineers (IIE). IIE
Alhourani, F., Clustering algorithm for solving group technology problem with
multiple process routings (2013) Computers & Industrial Engineering, 66 (4), pp.
781-790;
Wu, L., Suzuki, S., Improved similarity coefficient method for cell formation with
considering operation sequences and times (2014) Innovation and Supply Chain
Wu, L., Suzuki, S., Cell formation design with improved similarity coefficient
method and decomposed mathematical model (2015) The International Journal of
technology problem with multiple process routings (1997) Computers & Industrial
Engineering, 32 (1), pp. 207-220;
Yin, Y., Yasuda, K., Manufacturing Cell's design in consideration of various
885-906;
Won, Y., Lee, K.C., Group technology cell formation considering operation sequences
and production volumes (2001) International Journal of Production Research, 39
(13), pp. 2755-2768;
Yuguang, Z., Kai, X., Dongyan, S., Clustering and group selection of interim
product in shipbuilding (2014) Journal of Intelligent Manufacturing, 25 (6), pp.
1393-1401;
Alhourani, F., Cellular manufacturing system design considering machines
reliability and parts alternative process routings (2016) International Journal of
Navaei, J., ElMaraghy, H., Grouping part/product variants based on networked
operations sequence (2016) Journal of Manufacturing Systems, 38, pp. 63-76;
Boutsinas, B., Machine-part cell formation using biclustering (2013) European
Renzi, C., Leali, F., Cavazzuti, M., Andrisano, A.O., A review on artificial
intelligence applications to the optimal design of dedicated and reconfigurable
manufacturing systems (2014) The International Journal of Advanced Manufacturing
Technology, 72 (1-4), pp. 403-418;
Economics, 103 (2), pp. 767-783;
Zhu, Z., Heady, R.B., Reiners, S., An efficient zero-one formulation of the cell
formation problem (1995) Computers & Industrial Engineering, 28 (4), pp. 911-916;
4038-4045;
Bychkov, I., Batsyn, M., Pardalos, P.M., Exact model for the cell formation problem
Blum, C., Roli, A., Metaheuristics in combinatorial optimi zation: Overview and
conceptual comparison (2003) ACMComputing Surveys, 35 (3), pp. 268-308;
Lee, S., Wang, H.P., Manufacturing cell formation: A dualobjective simulated
annealing approach (1992) The International Journal of Advanced Manufacturing
Technology, 7 (5), pp. 314-320;
annealing (2008) Journal of the Operational Research Society, 59 (4), pp. 443-454;
Research, 38 (2), pp. 385-395;
Defersha, F.M., Chen, M., A linear programming embedded genetic algorithmfor an
Stawowy, A., Evolutionary strategy for manufacturing cell design (2006) Omega, 34
(1), pp. 1-18;
Burbidge, J.L., Production flow analysis (1971) Production Engineer, 50 (4-5), pp.
139-152;
Research, 18 (2), pp. 213-232;
Moore, C., Mertens, S., (2011) The Nature of Computation, , Oxford University
Press, New York, NY, USA;
Wasserman, S., Faust, K., (1994) Social Network Analysis: Methods and Applications,
, Cambridge University Press;
Zhu, Y., (2017) Hierarchical Clustering and Similarity Statistics for Solving and
Investigating Cell Formation Problems, , http://dx.doi.org/10.5072/PRISM/26356,
(MScThesis), University of Calgary;
426;
Chen, L., Ding, Z., Li, S., Tree-based dependency analysis in decomposition and Re-
decomposition of complex design problems (2005) Journal of Mechanical Design, 127
(1), pp. 12-23;
Chandrasekharan, M.P., Rajagopalan, R., Zodiac-an algorithm for concurrent
formation of part-families and machinecells (1987) International Journal of
for the manufacturing cells formation problem (2008) The International Journal of
Boe, W.J., Cheng, C.H., A close neighbour algorithm for designing cellular-
manufacturing system (1991) International Journal of Production Research, 29 (10),
pp. 2097-2116;
Research, 32 (9), pp. 2149-2158;
Engineering, 53 (2), pp. 277-289;
functional mathematical programming model (2006) The International Journal of
production data using neural networks (2009) Computers & Industrial Engineering, 56
(4), pp. 1340-1347
CORRESPONDENCE ADDRESS: Li, S.; Department of Mechanical and Manufacturing
Engineering, University of CalgaryCanada; email: [email protected]
ISSN: 1024123X
ABBREVIATED SOURCE TITLE: Math. Probl. Eng.
SOURCE: Scopus
Sowmiya, N., Valarmathi, B., Srinivasa Gupta, N.

56427047100;43262151300;55295667200;
Solving machine part cell formation problem using genetic algorithm based
evolutionary computing
(2018) Advances in Intelligent Systems and Computing, 614, pp. 203-212.
3-319-60618-7_20&partnerID=40&md5=ad9398bd1a18355e3f5ef63e21e6fa79
DOI: 10.1007/978-3-319-60618-7_20
AFFILIATIONS: School of Information Technology and Engineering, VIT University,
Vellore, India;
Department of Software and Systems Engineering, School of Information Technology
and Engineering, VIT University, Vellore, India;
School of Mechanical Engineering, VIT University, Vellore, India
ABSTRACT: Machine part cell formation is the group technology problem, in which the
parts with near similar machining requirements are grouped into part families and
the corresponding machines into machine cells. In this paper, a genetic algorithm
with a fine tuning procedure is proposed to solve the group technology problem
considering only one process plan for each part. The grouping efficacy achieved by
the proposed method is comparable to the existing methods in general and better for
11.42% of the datasets. © Springer International Publishing AG 2018.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Clustering; Genetic
algorithm; Grouping efficacy
INDEX KEYWORDS: Cells; Clustering algorithms; Cytology; Genetic algorithms; Group
technology; Machinery; Pattern recognition; Soft computing, Cell formation; Cell
formation problem; Clustering; Evolutionary computing; Grouping efficacy; Machine
cell; Process plan; Technology problems, Cellular manufacturing
REFERENCES: Hyer, N., Wemmerlov, U., Group technology in the US manufacturing
industry: A survey of current practices (1989) Int. J. Prod. Res., 27, pp. 1287-
1304;
a rank order clustering algorithm (1980) Int. J. Prod. Res., 18, pp. 213-232;
McAuley, J., Machine grouping for efficient production (1972) Int. J. Prod. Eng.,
51, pp. 53-57;
pp. 561-569;
Darwin, C.R., (1859) On the Origin of Species by means of Natural Selection and the
Descent of Man and Selection in Relation to Sex, 49., Great Books of the Western
World, Editor in chief: M. J. Adler. Robert P. Gwinn, Chicago, I.L (1991). (First
edition John Murray, London;
formation problem (2001) Int. J. Prod. Res., 39, pp. 3651-3669;
Car, Z., Mikac, T., Evolutioary approach for solving cell-formation problem in
cellular manufacturing (2006) Adv. Eng. Inform., 20, pp. 227-232;
cellular manufacturing systems (2007) Atonal J. Adv. Manufact. Technol., 38, pp.
630-640;
Expert Syst. Appl, 36, pp. 6598-6604;
cell formation problem (2009) Int. J. Prod. Res., 47, pp. 1989-2007;
Gupta, N.S., Devika, D., A novel approach to machine-part cell formation using
mahalanobis distance (2011) Eur. J. Sci. Res, 62, pp. 43-47;
Shiyas, C.R., Pillai, V.M., Cellular manufacturing system design using grouping
efficacy-based genetic algorithm (2014) Int. J. Prod. Res., 52 (12), pp. 3504-3517;
Kumar, K.R., Chandrasekaran, M.P., A quantitative criterion for goodness of block

diagonal forms of binary matrices in group technology (1990) Int. J. Prod. Res, 28,
pp. 233-243;
Gupta, N.S., Devika, D., Valarmathi, B., Sowmiya, N., Shinde, A., CARI – a
heuristic approach to machine-part cell formation using correlation analysis and
relevance index (2014) Int. J. Prod. Res., 52 (24), pp. 7297-7309;
Review and extension (1982) Int. J. Prod. Res, 20, pp. 17-133;
formation applications (1989) Comput. Ind. Eng., 16, pp. 419-426;
Kusiak, A., Group technology (1992) Intelligent Design and Manufacturing, pp. 289-
302., Kusiak, A. (ed.), Wiley, New York;
Manufact. Syst., 6, pp. 117-124;
(1991) Int. J. Prod. Res., 29 (2), pp. 343-356;
group technology (1986) IIE Trans, 18, pp. 271-277;
clustering for group technology (1986) Int. J. Prod. Res., 24, pp. 1221-1233;
implementation – a state-of-the-art survey (1985) Omega, 13, pp. 381-391;
cellular manufacturing systems (1987) Int. J. Prod. Res., 25, pp. 639-665;
cellular manufacture (1982) J. Manufact. Sys., 1, pp. 65-75;
configuration (1987) Int. J. Prod. Res., 25, pp. 101-113;
Stanfel, L., Machine clustering for economic production (1985) Engg. Costs and
Prod. Eco., 9;
reorganization by a clustering technique (1972) Oper. Res., 20, pp. 993-1009;
a rank order clustering algorithm (1980) Int. J. Prod. Res., 18, pp. 213-232;
(1973) Int. J. Prod. Res., 11, pp. 399-416;
technology machine clustering problem (1985) Omega, 13, pp. 577-579;
Boe, W., Cheng, C.H., A close neighbour algorithm for designing cellular
manufacturing systems (1991) Int. J. Prod. Res., 29, pp. 2097-2116;
of binary data matrices for group technology (1989) Int. J. Prod. Res., 27, pp.
1035-1052;
manufacturing (1987) Int. J. Prod. Res, 25, pp. 1715-1728;
formation of part-families and machine-cells (1987) Int. J. Prod. Res., 25, pp.
835-850
CORRESPONDENCE ADDRESS: Srinivasa Gupta, N.; School of Mechanical Engineering, VIT
UniversityIndia; email: [email protected]
EDITORS: Madureira A.M., Cherukuri A.K., Abraham A., Muda A.K.
ISSN: 21945357
ISBN: 9783319606170
ABBREVIATED SOURCE TITLE: Adv. Intell. Sys. Comput.
SOURCE: Scopus

57188978487;36147113000;
A clonal selection algorithm for the generalized cell formation problem considering
machine reliability and alternative routings
(2017) Production Engineering, 11 (4-5), pp. 545-556. Cited 4 times.
85023204247&doi=10.1007%2fs11740-017-0751-
6&partnerID=40&md5=cae4d088b378797aa3bda0d2ed7b3644
DOI: 10.1007/s11740-017-0751-6
Mohammed V University of Rabat, B.P. 1014, Rabat, Morocco
ABSTRACT: The cell formation is the first step in the design of Cellular
Manufacturing systems. It consists of grouping parts with similar processing needs
into cells and identifying the set of machines needed to process these parts. The
aim is to minimize the material handling costs and maximize the use of the
machines. In this paper, the machine reliability and the alternative process
routings are taken into account to form the production cells. The presence of these
factors in addition to the production volume, operation sequence and production
time makes the problem more realistic but also more complex. Most authors solve
this kind of problems by mathematical programming approaches that require large
amounts of computational efforts. Therefore, a modified version of the Clonal
Selection Algorithm is introduced and a local search mechanism is adopted in this
paper. The obtained results are compared with those of the Branch and Bound (B&B)
method using LINGO software. The comparison reveals the effectiveness and the
efficiency of the proposed method in terms of both solution quality and computation
time required. © 2017, German Academic Society for Production Engineering (WGP).
AUTHOR KEYWORDS: Alternative routings; Cell formation problem; Clonal selection
algorithm; Machine reliability; Material handling costs; Production time;
Production volume
INDEX KEYWORDS: Cells; Cellular manufacturing; Clone cells; Cytology; Manufacture;
Materials handling; Mathematical programming; Reliability, Alternative routings;
Cell formation problem; Clonal selection algorithms; Machine reliability; Material
handling costs; Production time; Production volumes, Branch and bound method
REFERENCES: Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the US industry: a
survey of users (1989) Int J Prod Res, 27, pp. 1511-1530;
Evol Comput, 4, pp. 93-113;
561-569;
breakdowns in the generalized cell formation problem (2008) Int J Adv Manuf
Technol, 39, pp. 838-850;
D’Addona, D., Teti, R., Queuing network modelling techniques for response time
enhancement in electronics assembly (2011) Int J Comput Aided Eng Technol, 3, pp.
399-413;
machine reliability consideration (2008) Int J Adv Manuf Technol, 35, pp. 761-768;
analysis of cellular manufacturing systems (2007) Int J Prod Econ, 105, pp. 243-
262;
Jabal Ameli, M.S., Arkat, J., Sakri, M.S., Applying metaheuristics in the
generalized cell formation problem considering machine reliability (2008) J Chin
Inst Ind Eng, 25, pp. 261-274;
(2011) Comput Ind Eng, 60, pp. 7-15;
and machine reliability (2014) Asia Pac J Oper Res;
Technol, 6, p. 12011213;
alternative process routings (2012) Int J Prod Res, 50 (15), p. 40754089;
50, pp. 1135-1144;
Mohammadi, M., Forghani, K., A hybrid method based on genetic algorithm and dynamic
programming for solving a bi-objective cell formation problem considering
alternative process routings and machine duplication (2017) Appl Soft Comput, 53,
pp. 97-110;
Adenso-Diaz, B.L., Ozano, S., Racero, J., Guerrero, F., Machine cell formation in
Yin, Y., Yasuda, K., Manufacturing cells’ design in consideration of various
production factors (2002) Int J Prod Res, 40, pp. 885-906;
assignment in cell formation (2002) Comput Ind Eng, 42, pp. 329-341;
42, pp. 2419-2433;
Int J Prod Res, 42 (18), pp. 3911-3927;
44 (11), pp. 2133-2167;
Spiliopoulos, K., Sofianopoulou, S., Manufacturing cells design with alternative
routings in generalized group technology: reducing the complexity of the solution
space (2007) Int J Prod Res, 45, pp. 1355-1367;
Sormaz, D.N., Rajaraman, S.N., Problem space search algorithm for manufacturing
cell formation with alternative process plans (2008) Int J Prod Res, 46 (2), pp.
345-369;
solving an extended model of dynamic cellular manufacturing system (2008) Eur J
Oper Res, 185, pp. 563-592;
(2009) Int J Prod Res, 47 (4), pp. 989-1013;
Scatter search (2012) J Intell Manuf, 23, pp. 1127-1139;
Ozcelik, F., Sarac, T., A genetic algorithm extended modified sub-gradient
algorithm for cell formation problem with alternative routings (2012) Int J Prod
Res, 50, pp. 4025-4037;
Khaksar-Haghani, F., Kia, R., Mahdavi, I., Kazemi, M., A genetic algorithm for
solving a multi-floor layout design model of a cellular manufacturing system with
alternative process routings and flexible configuration (2013) Int J Adv Manuf
Technol, 66, pp. 845-865;
Vin, E., Delchambre, A., Generalized cell formation: iterative versus simultaneous
resolution with grouping genetic algorithm (2014) J Intell Manuf, 25, pp. 1113-
1124;
approach (2014) Int J Adv Manuf Technol, 70, pp. 1635-1652;
(2015) J Manuf Syst, 35, pp. 155-163;
reliability and parts alternative process routings (2016) Int J Prod Res, 54, pp.
846-863;
selection principle (2002) IEEE Trans Evol Comput, 6, pp. 239-251;
Karoum, B., Elbenani, B., El Imrani, A.A., Clonal selection algorithm for the cell
formation problem (2016) Proceedings of the mediterranean conference on information
and communication technologies 2015. Lecture notes in electrical engineering, pp.
319-326., Oualkadi A, Choubani F, Moussati A, (eds), 380, Springer, Cham;
Karoum, B., El Khattabi, N., Elbenani, B., El Imrani, A.A., An efficient artificial
immune system algorithm for the cell formation problem (2016) J Comput Methods Sci
Eng, 16, p. 733744;
Karoum, B., Elbenani, B., A hybrid clonal algorithm for the cell formation problem
with variant number of cells (2017) Prod Eng Res Devel, 11, pp. 19-28;
techniques (1992) J Manuf Syst, 11, pp. 149-159;
routing in group technology manufacturing systems (1990) Eng Optim, 16, pp. 235-
245;
Lee, M.K., Luong, H., Abhary, K., A genetic algorithm based cell design considering
alternative routing (1997) Comput Integr Manuf Syst, 10, pp. 93-108;
Ouk Kim, C., Baek, J.G., Baek, J.K., A two-phase heuristic algorithm for cell
Int J Prod Res, 42, pp. 3911-3927;
multiple process routings (2013) Comput Ind Eng, 66, pp. 781-790;
replicate machines (1999) Int J Prod Res, 37, pp. 707-720;
Nagi, R., Harhalakis, G., Proth, J.M., Multiple routings and capacity consideration
in group technology applications (1990) Int J Prod Res, 28, pp. 1243-1257;
207-220;
44, pp. 2133-2167
Faculty of Science, Mohammed V University of Rabat, B.P. 1014, Morocco; email:
[email protected]
ISSN: 09446524
ABBREVIATED SOURCE TITLE: Prod. Eng.
SOURCE: Scopus
Zhu, Y., Li, S.

57195540206;57203292648;
Statistical Analysis of Similarity Measures for Solving Cell Formation Problems
(2017) Procedia CIRP, 63, pp. 248-253. Cited 1 time.
85028682263&doi=10.1016%2fj.procir.2017.03.174&partnerID=40&md5=e746f28b2f039611480
14cf0afb1beef
DOI: 10.1016/j.procir.2017.03.174
AFFILIATIONS: University of Calgary, Calgary, AB, Canada
ABSTRACT: Hierarchical clustering (HC) has been used to solve cell formation (CF)
problem, which has advantages of solution convergence and not requiring the number
of cells as the input. While evolutionary algorithms (EA) are more common in recent
years due to their capability in solution searching, they also imply more time and
complexity involved in problem solving. At the same time, some studies have shown
that HC can give comparable results if the CF structures are not very "messy". The
term messiness is used to indicate the potential of a given CF problem to yield
nearly independent machine groups and part families. Then, the purpose of this
research is to distinguish whether a CF problem is "messy" or not so that the users
can decide whether using economical HC or relatively demanding EA for problem
solving. In the methodology, the similarity values of machine pairs are first
determined for a given incidence matrix for CF. Then, histogram is used to report
the distribution of similarity values. By analyzing this histogram, it is found
that the distribution of similarity values of a less messy problem often presents a
U-shape. To further quantify this observation, the Kolmogorov-Smirnov test (K-S
test) is applied to examine how well the distribution of similarity values fits the
normal cumulative distribution function (CDF). The result indicates that the
similarity values of messy CF problems tend to demonstrate normal distribution in
view of the K-S test. © 2017 The Authors. Published by Elsevier.
AUTHOR KEYWORDS: cell formation problem; Kolmogorov-Smirnov test; statistical
distribution of similarity values
INDEX KEYWORDS: Cells; Cellular manufacturing; Cytology; Distribution functions;
Graphic methods; Manufacture; Normal distribution, Cell formation; Cell formation
problem; Hierarchical Clustering; Incidence matrices; Kolmogorov-Smirnov test;
Normal cumulative distribution function; Similarity measure; Statistical
distribution, Problem solving
REFERENCES: Pandremenos, J., Chryssolouris, G., A neural network approach for the
development of modular product architectures (2011) International Journal of
Meller, R.D., Gau, K.Y., The facility layout problem: Recent and emerging trends
and perspectives (1996) Journal of Manufacturing Systems, 15 (5), pp. 351-366;
Drira, A., Pierreval, H., Hajri-Gabouj, S., Facility layout problems: A survey
(2007) Annual Reviews in Control, 31 (2), pp. 255-267;
Michalos, G., Makris, S., Mourtzis, D., An intelligent search algorithm-based
method to derive assembly line design alternatives (2012) International Journal of
51 (2), pp. 53-57;
component grouping problem with multiple objectives (1992) Computers & Industrial
Engineering, 22 (4), pp. 469-480;
2059-2079;
grouping (2009) Computers & Industrial Engineering, 56 (1), pp. 347-356;
Economics, 101 (2), pp. 329-352;
problem: A comparative investigation (2005) Computers & Industrial Engineering, 48
(3), pp. 471-489;
Jaccard, P., (1908) Nouvelles Recherches sur la Distribution Florale;
Bradley, A.P., ROC curve equivalence using the Kolmogorov-Smirnov test (2013)
Pattern Recognition Letters, 34 (5), pp. 470-475;
Justel, A., Peña, D., Zamar, R., A multivariate Kolmogorov-Smirnov test of goodness
of fit (1997) Statistics & Probability Letters, 35 (3), pp. 251-259;
Drezner, Z., Turel, O., Normalizing variables with too-frequent values using a
Kolmogorov-Smirnov test: A practical approach (2011) Computers & Industrial
Engineering, 61 (4), pp. 1240-1244;
(2009) International Journal of Production Economics, 120 (2), pp. 669-688
CORRESPONDENCE ADDRESS: Li, S.; University of CalgaryCanada; email:
[email protected]
EDITORS: Wang Y., Tseng M.M., Tsai H.-Y.
ISSN: 22128271
ABBREVIATED SOURCE TITLE: Procedia CIRP
SOURCE: Scopus
Chaudhuri, B., Jana, R.K., Dan, P.K.

7101623089;9639932600;26325403400;
A hybrid genetic algorithm for cell formation problems using operational time
(2017) Advances in Intelligent Systems and Computing, 515, pp. 127-134. Cited 1
time.
981-10-3153-3_13&partnerID=40&md5=8c97aca92b65d944bc94ab5f8311b3af
DOI: 10.1007/978-981-10-3153-3_13
AFFILIATIONS: Indian Institute of Social Welfare & Business Management, Kolkata,
India;
Indian Institute of Technology Kharagpur, Kharagpur, WB 721302, India
ABSTRACT: This paper presents a two-stage approach consisting of a real-coded
genetic algorithm and goal programming to obtain improved cell formation. In the
first stage, the minimum value of each objective is determined using a single-
objective genetic algorithm. In the second stage, goal programming is incorporated
and the final objective is constructed as the minimization of sum of deviational
variables of corresponding objectives. The proposed technique is implemented as a
software toolkit using C Sharp.net programming language. Modified grouping
efficiency is used as the performance measure to test the efficiency of the
proposed technique. Five problems with different sizes have been considered from
the literature to show the potentials of the proposed technique. © Springer Nature
Singapore Pte Ltd. 2017.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing system; Genetic
algorithm; Goal programming; Modified grouping efficiency
INDEX KEYWORDS: C (programming language); Computation theory; Efficiency; Genetic
algorithms; Intelligent computing; Linear programming; Manufacture; Multiobjective
optimization, Cell formation; Cell formation problem; Goal programming; Grouping
efficiency; Hybrid genetic algorithms; Performance measure; Real coded genetic
algorithm; Single-objective genetic algorithms, Cellular manufacturing
REFERENCES: Burbidge, J.L., (1975) The Introduction of Group Technology, ,
Heinemann Press, London;
Dimopoulos, C., Zalzala, A.M.S., Evolutionary Computation Approaches to Cell
Optimization (1998) Adaptive Computing in Design and Manufacture, pp. 69-83.,
Parmee, I. C., Springer-Verlag, London;
Mak, K.L., Wong, Y.S., Genetic design of cellular manufacturing systems (2000)
Human Factors and Ergonomics in Manufacturing, 10 (2), pp. 177-192;
cost uncertainty (1998) International Journal of Production Economics, 55, pp. 97-
109;
Chi, S.C., Yan, M.C., A fuzzy genetic algorithm for high-tech cellular
manufacturing system design (2004) IEEE Annual Meeting of the Fuzzy Information, 2,
pp. 907-912;
Pai, P.F., Chang, P.T., Lee, S.H., Part-machine family formation using genetic
algorithms in a fuzzy environment (2005) International Journal Advanced
cellular manufacturing systems (2008) The International Journal of Advanced
Research, 24 (2), pp. 451-464;
Kumar, C.S., Chandrasekharan, M.P., Grouping Efficacy: A quantitative criterion for
simulated annealing (1992) European Journal of Operations Research, 63, pp. 409-
422;
component and grouping problem with multiple objectives (1992) Computers and
Venugopal, V., Narendran, T.T., Neural network model for design retrieval in
manufacturing systems (1992) Computers in Industry, 1123, p. 20;
Srinivasan, G., Narendran, T.T., GRAFICS: A non-hierarchical clustering algorithm
pp. 463-478;
of Production Research, 25 (4), pp. 561-569
CORRESPONDENCE ADDRESS: Chaudhuri, B.; Indian Institute of Social Welfare &
Business ManagementIndia; email: [email protected]
EDITORS: Satapathy S.C., Bhateja V., Pattnaik P.K., Udgata S.K.
ISSN: 21945357
ISBN: 9789811031526
ABBREVIATED SOURCE TITLE: Adv. Intell. Sys. Comput.
SOURCE: Scopus
Mehdizadeh, E., Daei Niaki, S.V., Rahimi, V.

23974842600;57190983791;57195715872;
A vibration damping optimization algorithm for solving a new multi-objective
dynamic cell formation problem with workers training
(2016) Computers and Industrial Engineering, 101, pp. 35-52. Cited 4 times.
84984984840&doi=10.1016%2fj.cie.2016.08.012&partnerID=40&md5=5d519433ba9ea03eb39083
0691147b16
DOI: 10.1016/j.cie.2016.08.012
AFFILIATIONS: Faculty of Industrial and Mechanical Engineering, Qazvin Branch,
Islamic Azad University, Qazvin, Iran
ABSTRACT: This paper presents a comprehensive multi-objective mixed integer
mathematical programming model which considers cell formation and production
planning problems simultaneously. This comprehensive model includes dynamic system
reconfiguration, multi period production planning, operation sequence, alternative
process plans for part types, machine and worker flexibility, duplicate machines,
machine capacity, available time of workers and worker assignment. The aim of the
proposed model is to minimize inter and intra-cell movement costs, machine and
reconfiguration costs, setup costs, production planning costs (holding, backorder
and subcontracting costs) and workers hiring, firing, training and salary costs, as
well as minimizing summation of machines idle times as a second objective. Due to
NP-hardness of the problem, a recent and efficient meta-heuristic algorithm namely
multi-objective vibration damping optimization (MOVDO) is designed for finding
Pareto-optimal frontier. In order to check the efficiency of the developed
algorithm, it is compared with two salient multi-objective genetic algorithms named
NSGAII and NRGA. Finally, by generating some test problems in small and large
scales and using some multi-objective comparison metrics, the algorithms are
compared and analyzed statistically. © 2016 Elsevier Ltd
AUTHOR KEYWORDS: Cellular manufacturing system; Dynamic cell formation problem;
Multi-Objective mathematical programming; Production planning; Vibration damping
optimization algorithm
INDEX KEYWORDS: Algorithms; Cells; Cellular manufacturing; Compensation
(personnel); Costs; Cytology; Damping; Genetic algorithms; Heuristic algorithms;
Integer programming; Manufacture; Mathematical programming; Multiobjective
optimization; Pareto principle; Planning; Production control; Reconfigurable
hardware, Alternative process plans; Dynamic cell formation; Dynamic system
reconfigurations; Mathematical programming models; Multi-objective genetic
algorithm; Multi-objective mathematical programming; Optimization algorithms;
Production Planning, Optimization
REFERENCES: Al Jadaan, O., Rao, C.R., Rajamani, L., Non-dominated ranked genetic
algorithm for solving multi-objective optimization problems: NRGA (2008) Journal of
Theoretical and Applied Information Technology, pp. 60-67;
Aliabadi, M., Jolai, F., Mehdizade, E., Jenabi, M., A flow shop production planning
problem with basic period policy and sequence dependent set up times (2011) Journal
of Industrial and Systems Engineering, 5 (1), pp. 286-304;
Aryanezhad, M.B., Deljoo, V., Mirzapour Al-e-Hashem, S.M.J., Dynamic cell formation
and the worker assignment problem: A new model (2009) International Journal of
Bajestani, A.M., Rabbani, M., Rahimi-Vahed, A.R., Khoshkhou, G.B., A multi
objective scatter search for a dynamic cell formation problem (2009) Computers and
Bidanda, B., Ariyawongrat, P., Needy, K.L., Norman, B., Tharmmaphornphilas, W.,
review and survey (2005) Computers & Industrial Engineering, 48, pp. 507-523;
Chen, M., Cao, D., Coordinating production planning in cellular manufacturing
environment using tabu search (2004) Computers & Industrial Engineering, 46, pp.
571-588;
Coello, C.A., Van Veldhuizen, D.A., Lamont, G.B., Evolutionary algorithms for
solving multi objective problems (2002), Kluwer Academic Publishers; Daei Niaki,
S.V., Mehdizadeh, E., Tavakkoli-Moghaddam, R., A mathematical model for dynamic
cellular manufacturing systems with production planning and labor assignment (2011)
POMS 23rd annual conference, Chicago, Illinois, U.S.A., April 20 to April 23;
genetic algorithm: NSGA-II (2002) IEEE Transaction Evolutionary Computing, 6 (4),
pp. 182-197;
Defersha, F., Chen, M., A parallel genetic algorithm for dynamic cell formation in
46 (22), pp. 6389-6413;
Fattahi, P., Hajipour, V., Nobari, A., A bi-objective continuous review inventory
control model: Pareto-based meta-heuristic algorithms (2015) Applied Soft
Computing, 32, pp. 211-223;
Ghotboddini, M.M., Rabbani, M., Rahimian, H., A comprehensive dynamic cell design:
Bender's decomposition approach (2011) Expert Systems with Applications, 38, pp.
2478-2488;
Hajipour, V., Kheirkhah, A.S., Tavana, M., Absi, N., Novel Pareto-based meta-
heuristics for solving multi-objective multi-item capacitated lot-sizing problems
Hajipour, V., Mehdizadeh, E., Tavakkoli-Moghaddam, R., A novel Pareto-based multi-
objective vibration damping optimization algorithm to solve multi-objective
optimization problems (2014) Scientia Iranica. Transaction E, Industrial
Engineering, 21 (6), p. 2368;
Houshyar, A.N., Leman, Z., Moghadam, H.P., Ariffin, M.K.A.M., Ismail, N.,
Iranmanesh, H., Literature review on dynamic cellular manufacturing system (2014)
IOP conference series: Materials science and engineering, p. 012016., IOP
Publishing;
Flexible Automation and Intelligent Manufacturing, 3, pp. 254-264;
simulated annealing (2012) Computers & Operations Research, 39, pp. 2642-2658;
and worker assignment (2010) Computers and Mathematics with Applications, 60, pp.
1014-1025;
Majazi-Delfard, V., New mathematical model for problem of dynamic cell formation
based on number and average length of intra and intercellular movements (2013)
Applied Mathematical Modelling, 37, pp. 1884-1896;
Mehdizadeh, E., Fatehi Kivi, A., Three meta-heuristic algorithms for the single-
item capacitated lot-sizing problem (2014) IJE Transactions B: Application, 27 (8),
pp. 1223-1232;
Mehdizadeh, E., Rahimi, V., An integrated mathematical model for solving dynamic
cell formation problem considering operator assignment and inter/intra cell layouts
(2016) Applied Soft Computing, 42, pp. 325-341;
Mehdizadeh, E., Tavakkoli Moghaddam, R., Vibration damping optimization (2008)
Proceeding of the international conference operations research and global business,
Germany, September 3–5;
Mehdizadeh, E., Tavakkoli-Moghaddam, R., Vibration damping optimization algorithm
for a parallel machines scheduling problem (2009) The 2nd international conference
of Iranian operations research society, May 20–22, 2009 – Babolsar, Iran;
Mehdizadeh, E., Tavakkoli-Moghaddam, R., Yazdani, M., A vibration damping
optimization algorithm for a parallel machines scheduling problem with sequence-
independent family setup times (2015) Applied Mathematical Modelling, 39 (22), pp.
6845-6859;
Mehdizadeh, E., Tavarroth, M.R., Hajipour, V., A new hybrid algorithm to optimize
stochastic-fuzzy capacitated multi-facility location-allocation problem (2011)
Journal of Industrial Engineering, 7 (2011), pp. 77-86;
Mehdizadeh, E., Tavarroth, M.R., Mousavi, S.M., Solving the stochastic capacitated
location-allocation problem by using a new hybrid algorithm (2011) Applied
Mathematics, , ISBN: 978-960-474-263-9;
Mousavi, S.M., Akhavan Niaki, S.T., Mehdizade, E., The capacitated multi-facility
location–allocation problem with probabilistic customer location and demand: Two
hybrid meta-heuristic algorithms (2012) International Journal of Systems Science,
pp. 1-16;
formation considering labor utilization (2013) Applied Mathematical Modelling, 37,
pp. 2308-2316;
Reisman, A., Kumar, A., Motwani, J., Cheng, C.H., Cellular manufacturing: a
statistical review of the literature (1965–1995) (1997) Operations Research, 45
(4), pp. 508-520;
Rezaeian, J., Javadian, N., Tavakkoli-Moghaddam, R., Jolai, F., A hybrid approach
based on the genetic algorithm and neural network to design an incremental cellular
manufacturing system (2011) Applied Soft Computing, 11, pp. 4195-4202;
Engineering, 29 (1-4), pp. 221-225;
Journal of Operational Research, 185 (563), p. 592;
Sakhaii, M., A robust optimization approach for an integrated dynamic cellular
manufacturing system and production planning with unreliable machines (2015)
Applied Mathematical Modelling;
technology principles (1985) Journal of Operations Management, 5 (2), pp. 151-167;
Yazdani, M., Zandieh, M., Tavakkoli-Moghaddam, R., Jolai, F., Two meta-heuristic
algorithms for the dual-resource constrained exible job-shop scheduling problem
(2015) Scientia Iranica E, 22 (3), pp. 1242-1257
CORRESPONDENCE ADDRESS: Mehdizadeh, E.; Faculty of Industrial and Mechanical
Engineering, Qazvin Branch, Islamic Azad UniversityIran; email: [email protected]
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Soto, R., Crawford, B., Almonacid, B.

24403038600;23395875300;56407124500;
Efficient leader exchange for Migrating Birds Optimization when solving machine-
part cell formation problems [Un Eficiente Intercambio De Líder En El Algoritmo
Optimización De Migración de Aves en resolver el problema de Formación de Celdas
Máquina-Parte]
(2016) Iberian Conference on Information Systems and Technologies, CISTI, 2016-
July, art. no. 7521561, . Cited 2 times.
84982166832&doi=10.1109%2fCISTI.2016.7521561&partnerID=40&md5=f14e7e0991a9ff4a2b798
f7e5ec30955
DOI: 10.1109/CISTI.2016.7521561
AFFILIATIONS: Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile;
Universidad Autónoma de Chile, Santiago, Chile;
Universidad Científica Del sur, Lima, Peru;
Universidad San Sebastián, Santiago, Chile;
Universidad Central de Chile, Santiago, Chile
ABSTRACT: The machine-part cell formation (MPCF) problem is to organize an assembly
as a set of cells, where each cell contains certain machines that process a sub-set
of parts. In recent years, different types of metaheuristics have been used to
solve the problem of MPCF. This publication focuses on solving the MPCF problem
using a metaheuristic inspired on birds, called Migrating Birds Optimization (MBO)
algorithm. Experiments have been conducted to 180 test instances using 2 types of
leader exchange in the flock of birds. The results obtained using MBO are equal to
or better than other algorithms reported in the literature. © 2016 AISTI.
AUTHOR KEYWORDS: Cell formation problem; Metaheuristics; Migrating Birds
Optimization; Nature-Inspired Optimization Algorithms
INDEX KEYWORDS: Algorithms; Birds; Cells; Cellular manufacturing; Cytology;
Heuristic algorithms; Information systems; Machinery; Problem solving, Cell
formation; Cell formation problem; Flock of Birds; Meta heuristics; Metaheuristic;
Migrating birds; Optimization algorithms; Test instances, Optimization
REFERENCES: Kumar, C., Chandrasekharan, M.P., Grouping efficacy: A quantitative
243;
implementation-A state-of-The-Art survey (1985) Omega, 13 (5), pp. 381-391;
Niroomand, S., Hadi-Vencheh, A., Ahin, R.S., Vizvari, B., Modified migrating birds
manufacturing systems (2015) Expert Systems with Applications;
Lalla-Ruiz, E., Expósito-Izquierdo, C., De Armas, J., Melián-Batista, B., Moreno-
Vega, J.M., Migrating Birds Optimization for the Seaside Problems at Maritime
Container Terminals;
Tongur, V., Ü, L.E., The analysis of migrating birds optimization algorithm with
neighborhood operator on traveling salesman problem (2016) Intelligent and
Evolutionary Systems, pp. 227-237., Springer;
Gao, K., Suganthan, P., Chua, T., An enhanced migrating birds optimization
algorithm for no-wait flow shop scheduling problem (2013) Computational
Intelligence in Scheduling (SCIS) 2013 IEEE Symposium On. IEEE, pp. 9-13;
Shen, L.W., Asmuni, H., Weng, F.C., A modified migrating bird optimization for
university course timetabling problem (2014) Jurnal Teknologi, 72 (1);
Duman, E., Elikucuk, I., Solving credit card fraud detection problem by the new
metaheuristics migrating birds optimization (2013) Advances in Computational
Intelligence, pp. 62-71., Springer;
Soto, R., Kjellerstrand, H., Duŕan, O., Crawford, B., Monfroy, E., Paredes, F.,
Purcheck, G.F., (1975) A Linear-programming Method for the Combinatorial Grouping
of An Incomplete Power Set;
Advanced Research in Applied Artificial Intelligence, pp. 400-406., Springer;
Engineering, 22 (4), pp. 469-480;
algorithm for manufacturing cell design (2000) Journal of the Chinese Institute of
Durán, O., Rodriguez, N., Consalter, L.A., Hybridization of pso and a discrete
position update scheme techniques for manufacturing cell design (2008) MICAI 2008:
Advances in Artificial Intelligence, pp. 503-512., Springer;
(12), pp. 2071-2081;
problems using an artificial fish swarm algorithm (2015) Advances in Artificial
Intelligence and Soft Computing, pp. 282-290., Springer;
cell design problems using a shuffled frog leaping algorithm (2016) The 1st
pp. 253-261., November 28-30 2015, Beni Suef, Egypt Springer;
International Journal Production Research, 29 (2), pp. 343-356;
(3), pp. 1609-1617;
Almonacid, B., (2016) Machine-Part Cell Formation Problems Pontificia Universidad
Católica de Valparaíso Chile, , http://www.inf.ucv.cl/~balmonacid/MPCFP/CISTI2016-
MBO
EDITORS: Rocha A., Reis L.P., Cota M.P., Goncalves R., Suarez O.S.
ISSN: 21660727
ISBN: 9789899843462
LANGUAGE OF ORIGINAL DOCUMENT: Spanish
ABBREVIATED SOURCE TITLE: Iberian Conf. Inf. Syst. Technol., CISTI
SOURCE: Scopus
Sotoyz, R., Crawford, B., Almonacid, B., Paredes, F., Loyola, E.

57188841250;23395875300;56407124500;24773930800;57188839069;
Machine-part cell formation problems with constraint programming
(2016) Proceedings - International Conference of the Chilean Computer Science
Society, SCCC, 2016-February, art. no. 7416567, . Cited 1 time.
84963715540&doi=10.1109%2fSCCC.2015.7416567&partnerID=40&md5=626e36b5c2565155eac706
d517b9cc52
DOI: 10.1109/SCCC.2015.7416567
AFFILIATIONS: Pontificia Universidad Catolica de Valparaiso, Valparaiso, Chile;
Universidad Autónoma de Chile, Chile;
Universidad Científica Del sur, Lima, Peru;
Universidad Central de Chile, Chile;
Universidad San Sebastián, Chile;
Escuela de Ingeniería Industrial, Universidad Diego Portales, Chile;
Universidad Católica Del Norte, Chile
ABSTRACT: Machine-Part Cell Formation consists on organizing a plant as a set of
cells, each one of them processing machines containing different part types. In
recent years, different techniques have been used to solve this problem ranging
from exact to approximate methods. This paper focuses on solving new instances of
this problem for which no optimal value exists by using the classic Boctor's
mathematical model. We employ constraint programming as the underlying solving
technique illustrating that global optimums are achieved for the whole set of
tested instances. © 2015 IEEE.
AUTHOR KEYWORDS: Constraint Programming; Machine-Part Cell Formation;
Optimization
INDEX KEYWORDS: Cells; Cellular manufacturing; Computer programming; Constraint
theory; Cytology; Machinery; Optimization, Approximate methods; Cell formation;
Cell formation problem; Constraint programming; Global optimum; Optimal values;
Processing machines, Problem solving
REFERENCES: Mosier, C., Taube, L., The facets of group technology and their impacts
on implementationa state-of-the-art survey (1985) Omega, 13 (5), pp. 381-391;
Engineering, 22 (4), pp. 469-480;
algorithm for manufacturing cell design (2000) Journal of the Chinese Institute of
(12), pp. 2071-2081;
(3), pp. 1609-1617;
Advanced Research in Applied Artificial Intelligence, pp. 400-406., Springer;
Purcheck, G.F., (1975) A Linear-programming Method for the Combinatorial Grouping
of An Incomplete Power Set;
manufacturing cell design problems: Cp vs. Mh (2014) HCI International 2014-Posters
Extended Abstracts, pp. 498-502., Springer;
International Journal Production Research, 29 (2), pp. 343-356;
Bessière, C., (2006) Handbook of Constraint Programming, pp. 29-84., Elsevier ch.
Constraint Propagation;
Berger, N., Soto, R., Goldsztejn, A., Caro, S., Cardou, P., Finding the maximal
pose error in robotic mechanical systems using constraint programming (2010) Trends
in Applied Intelligent Systems, pp. 82-91., Springer;
De La Barra, C.L., Soto, R., Crawford, B., Allendes, C., Berendsen, H., Monfroy,
E., Modeling the portfolio selection problem with constraint programming (2013) HCI
International 2013-Posters Extended Abstracts, pp. 645-649., Springer;
Soto, R., Crawford, B., Monfroy, E., Palma, W., Paredes, F., Nurse and paramedic
rostering with constraint programming: A case study (2013) Romanian Journal of
Information Science and Technology, 16 (1), pp. 52-64;
Soto, R., Crawford, B., Misra, S., Monfroy, E., Palma, W., Castro, C., Paredes, F.,
Constraint programming for optimal design of architectures for water distribution
tanks and reservoirs: A case study (2014) Original Scientific Paper, pp. 99-105;
Soto, R., Crawford, B., Almonacid, B., Johnson, F., Olgun, E., Solving open-pit
long-term production planning problems with constraint programming-a performance
evaluation (2014) ICSOFT EA, pp. 70-77;
Prud'Homme, C., Fages, J.-G., Lorca, X., (2014) Choco3 Documentation, TASC, INRIA
Rennes, , http://www.choco-solver.org, LINA CNRS UMR 6241, COSLING S.A.S;
Almonacid, B., (2015) Machine-Part Cell Formation Problems, ,
http://www.inf.ucv.cl/balmonacid/MPCFP/JCC2015, Pontificia Universidad Católica de
Valparaso Chile;
Research, 18 (2), pp. 213-232;
Mace (1984) International Journal of Production Research, 22 (6), pp. 937-948;
pp. 2633-2646;
Research, 24 (2), pp. 451-463;
Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F., Parameter
tuning of a choice-function based hyperheuristic using particle swarm optimization
Crawford, B., Soto, R., Montecinos, M., Castro, C., Monfroy, E., A framework for
autonomous search in the eclipse solver (2011) Modern Approaches in Applied
Intelligence, pp. 79-84., Springer;
Crawford, B., Soto, R., Castro, C., Monfroy, E., Extensible cpbased autonomous
search (2011) HCI International 2011-Posters Extended Abstracts, pp. 561-565.,
Springer
ISSN: 15224902
ISBN: 9781467398176
ABBREVIATED SOURCE TITLE: Proc. Int. Conf. Chilean Comput. Sci. Soc. SCCC
SOURCE: Scopus
Bootaki, B., Mahdavi, I., Paydar, M.M.

56029842600;16417373200;23025569300;
New bi-objective robust design-based utilisation towards dynamic cell formation
problem with fuzzy random demands
592. Cited 9 times.
84988287791&doi=10.1080%2f0951192X.2014.880949&partnerID=40&md5=e2551ab86a78727f7c4
46b17f2c0e401
DOI: 10.1080/0951192X.2014.880949
School of Industrial Engineering, Iran University of Science and Technology,
Tehran, Iran
ABSTRACT: Generally, one of the most important issues which cause a production
system not to be an efficient one is unemployed capacities of both machines and
workers. On the other hand, adaptive designs most exploiting facilities are not
practical for any cases (huge machines). Hence, sometimes manufacturing firms are
in need of robust design. In this paper, a robust design is considered to configure
cells in a dynamic cellular manufacturing system to overcome the onerous machine
relocation costs. Most of researches on robust design are trying to reduce the
number of facilities while, here, this idea is adopted accompanying with practical
concepts of facility utilisation with new mathematical formulae. Then, a multi-
objective mathematical model containing the minimisation of the inter-cell
movements besides maximising the machine and worker utilisation is developed. Some
other supplements are the following: (1) considering a cubic space representation
for calculation of inter-cell movements and (2) fuzzy random nature of part
demands. Above all, a new goal programming method named percentage multi-choice
goal programming (PMCGP) is innovated to solve the proposed multi-objective model.
Finally, a comprehensive numerical example is generated randomly to verify the
proposed model. © 2014 Taylor & Francis.
AUTHOR KEYWORDS: dynamic cell formation problem; fuzzy random variable; multi-
choice goal programming; robust design
INDEX KEYWORDS: Cells; Cytology; Design; Fuzzy systems; Linear programming;
Manufacture; Mobile security; Multiobjective optimization, Dynamic cell formation;
Dynamic cellular manufacturing systems; Fuzzy random variable; Manufacturing firms;
Mathematical formulas; Multi-choice goal programming; Multi-objective modeling;
Robust designs, Cellular manufacturing
REFERENCES: Ahkioon, S., Bulgak, A.A., Bektas, T., Integrated cellular
reconfiguration (2009) European Journal of Operational Research, 192, pp. 414-428;
Aouni, B., Kettani, O., Goal programming model: A glorious history and a promising
future (2001) European Journal of Operational Research, 133 (2), pp. 225-231;
50, pp. 407-420;
scheduling (2012) International Journal of Computer Integrated Manufacturing, 25
(7), pp. 625-635;
cellular manufacturing systems in a lumpy demand environment (2001) European
Bag, S., Chakraborty, D., Roy, A.R., A production inventory model with fuzzy random
demand and with flexibility and reliability considerations (2009) Computers &
Chang, C.T., On the mixed binary goal programming problems (2004) Applied
Mathematics and Computation, 159 (3), pp. 759-768;
Chang, C.T., Multi-choice goal programming (2007) Omega, 35 (4), pp. 389-396;
Chang, C.T., Revised multi-choice goal programming (2008) Applied Mathematical
Modelling, 32, pp. 2587-2595;
Chang, C.T., Chen, H.M., Zhuang, Z.Y., Revised multi segment goal programming:
Percentage goal programming (2012) Computers & Industrial Engineering, 63, pp.
1235-1242;
Charnes, A., Cooper, W.W., (1961) Management Model and Industrial Application of
Linear Programming, , New York: Wiley;
Economics, 103, pp. 767-783;
Deljoo, V., Mirzapour Al-E-Hashem, S.M.J., Deljoo, F., Aryanezhad, M.B., Using
63, pp. 842-854;
Ignizio, J.P., (1976) Goal Programming and Extensions, , Lexington, MA: Lexington
Books;
Katagiri, H., Kato, K., Hasuike, T., A random fuzzy minimum spanning tree problem
through a possibility-based value at risk model (2012) Expert Systems with
Khaksar-Haghani, F., Kia, R., Javadian, N., Tavakkoli-Moghaddam, R., Baboli, A., A
comprehensive mathematical model for the design of a dynamic cellular manufacturing
system integrated with production planning and several manufacturing attributes
(2011) International Journal of Industrial Engineering & Production Research, 22
(3), pp. 199-212;
Kwakernaak, H., Fuzzy random variables - I: Definitions and theorems (1978)
Lee, S.M., (1972) Goal Programming for Decision Analysis, , Philadelphia, PA:
Auerbach;
Liu, B., Liu, Y.K., Expected value of fuzzy variable and fuzzy expected value
models (2002) IEEE Transactions on Fuzzy Systems, 10 (4), pp. 445-450;
Liu, Y.K., Liu, B., Fuzzy random variable: A scalar expected value operator (2003)
Fuzzy Optimization and Decision Making, 2, pp. 143-160;
Lopez-Diaz, M., Gil, M.A., Constructive definitions of fuzzy random variables
(1997) Statistics and Probability Letters, 36, pp. 135-143;
model for dynamic cellular manufacturing systems considering production, planning
1014-1025;
Majazi Dalfard, V., New mathematical model for problem of dynamic cell formation
Applied Mathematical Modelling, 37, pp. 1884-1896;
of Computer Integrated Manufacturing, 20 (6), pp. 524-537;
Mandal, S., Maity, A.K., Maity, K., Mondal, S., Maiti, M., Multi-item multi-period
optimal production problem with variable preparation time in fuzzy stochastic
environment (2011) Applied Mathematical Modelling, 35, pp. 4341-4353;
approach to multi-criteria cell design (2000) International Journal of Production
Research, 38, pp. 1201-1218;
Uncertain Production Requirements with Presence of Routing Flexibility, , Thesis
(PhD). Virginia Polytechnic Institute and State University, Blackburg, VA;
selection (2014) International Journal of Computer Integrated Manufacturing;
Prince, J., Kay, J.M., Combining lean and agile characteristics: Creation of
virtual groups by enhanced production flow analysis (2003) International Journal of
Puri, M.L., Ralescu, D.A., Fuzzy random variables (1986) Journal of Mathematical
Analysis and Applications, 114, pp. 409-422;
Rafiei, H., Ghodsi, R., A Bi-objective mathematical model toward dynamic cell
pp. 2308-2316;
Engineering, 29 (1-4), pp. 221-225;
Romero, C., Extended lexicographic goal programming: A unifying approach (2001)
Omega, 29 (1), pp. 63-71;
Rosenblatt, M.J., Lee, H.L., A robustness approach to facilities design (1987)
(6), pp. 538-548;
Tamiz, M., Jones, D., Romero, C., Goal programming for decision marking: An
overview of the current state-ofthe-art (1998) European Journal of Operational
Research, 111 (3), pp. 567-581;
Wen, M., Kang, R., Some optimal models for facility location-allocation problem
with random fuzzy demands (2011) Applied Soft Computing, 11, pp. 1202-1207;
Xu, J., He, Y., Gen, M., A class of random fuzzy programming and its application to
supply Chain design (2009) Computers & Industrial Engineering, 56, pp. 937-950;
Economics, 101, pp. 329-352;
functions (1978) Fuzzy Sets and Systems, 1, pp. 45-55;
Zimmermann, H.J., (1996) Fuzzy Set Theory and Its Application, , Boston, MA: Kluwer
Academic
Mazandaran University of Science and TechnologyIran
ISSN: 0951192X
CODEN: ICIME
SOURCE: Scopus
Seyedhosseini, S.M., Badkoobehi, H., Noktehdan, A.

36148394400;56538530600;35520149000;
Machine-Part Cell Formation Problem Using a Group Based League Championship
Algorithm
(2015) Journal of Promotion Management, 21 (1), pp. 55-63. Cited 5 times.
84924149047&doi=10.1080%2f10496491.2015.970878&partnerID=40&md5=f140fca89fd1d3dd7a6
49e1c29218445
DOI: 10.1080/10496491.2015.970878
AFFILIATIONS: Iran University of Science and Technology, Tehran, Iran;
National University, San Diego, CA, United States
ABSTRACT: This article proposes a new algorithm for grouping problems that is a
grouping version of league championship algorithm (GLCA). We compare the
performance of GLCA with several well-known algorithms published in the present
literature and select a set of 20 most widely used benchmarks of cell formation
sample problems posing as a grouping problem. We used a truncated geometric
algorithm to find the number of initial cells. Our computations reveal that GLCA
can reach the best-known solution for 17 of the 20 benchmark problems, and improve
the solution of three others with a 1.4% average gap. © 2015, Copyright © Taylor &
Francis Group, LLC.
AUTHOR KEYWORDS: cell formation problem; grouping genetic algorithm; league
championship algorithm
pp. 101-113;
3651-3669;
(1973) International Journal of Production Research, pp. 399-416;
Research, 24, pp. 451-463;
Research, 24, pp. 1221-1233;
search to solve the cell formation problem (2012) Expert Systems with Applications,
39, pp. 2408-2414;
(1992) Belgian Journal of Operation Research, Statistics and Computer Science, pp.
33-79;
Heragu, S.S., (1997) Facility design, , Boston, MA: PWS Publishing;
Husseinzadeh Kashan, A., League Championship Algorithm: A new algorithm for
numerical function optimization. SoCPaR 2009 IEEE International Conference of Soft
Computing and Pattern Recognition (2009), pp. 43-48; King, J.R., Machine-component
grouping in production flow analysis: an approach using a rank order clustering
algorithm (1980) International Journal of Production Research, 18, pp. 213-232;
Manufacturing systems (1986) European Journal of Operational Research, 24, pp. 387-
397;
1728;
reorganization by a clustering technique (1972) Operation Research, 20 (5), pp.
993-1009;
and Production Economies, 9, pp. 73-81;
pp. 1609-1617;
International Journal of Production Economics, 120, pp. 669-688
CORRESPONDENCE ADDRESS: Seyedhosseini, S.M.; Department of Industrial Engineering,
Iran University of Science and TechnologyIran
PUBLISHER: Routledge
ISSN: 10496491
ABBREVIATED SOURCE TITLE: J. Promot. Manage.
SOURCE: Scopus
Rafiei, H., Rabbani, M., Nazaridoust, B., Ramiyani, S.S.

27967949000;57208701862;56520392200;55523397100;
Multi-objective cell formation problem considering work-in-process minimization
84922971679&doi=10.1007%2fs00170-014-6419-
x&partnerID=40&md5=a450329fbec8ed17599b73ce9e8bc349
DOI: 10.1007/s00170-014-6419-x
AFFILIATIONS: School of Industrial & Systems Engineering, College of Engineering,
ABSTRACT: This paper addresses designing a dynamic cellular manufacturing system
which considers optimizing batch sizes for inter-cell moves in order to pursue
fundamentals of Just-In-Time production philosophy. To do so, a bi-objective mixed-
integer nonlinear programming model is proposed with two conflicting objective
functions: minimizing sum of machine purchasing, operating, inter-cell moves,
machine relocation, and machine transferring cost, and minimizing work-in-process
(WIP) with regard to inter-cell batch sizes. Also, the best time to sell unused
machines is obtained by calculating their salvage values. Finally, the proposed
model is validated using numerical experiments and hence, the resulted WIP
inventories are assessed through the conducted numerical experiments, and
sensitivity analysis is provided with respect to three major parameters (machine
purchasing cost, inter-cell material handling cost, and part demand) applied in the
proposed model. © 2014, Springer-Verlag London.
AUTHOR KEYWORDS: Dynamic cellular manufacturing; Mixed-integer nonlinear
programming; Multi-objective optimization; Work-in-process
INDEX KEYWORDS: Cells; Cost benefit analysis; Costs; Cytology; Integer programming;
Just in time production; Manufacture; Materials handling; Multiobjective
optimization; Nonlinear programming; Sales; Sensitivity analysis, Conflicting
objectives; Dynamic cellular manufacturing systems; Mixed integer nonlinear
programming models; Mixed-integer nonlinear programming; Multi-objective cell
formation problem; Numerical experiments; Purchasing costs; Work in process,
REFERENCES: Selim, M.S., Askin, R.G., Vakharia, A.J., Cell formation in group
technology: review evaluation and directions for future research (1998) Comput Ind
Eng, 34, pp. 3-20;
Aryanezhad, M.B., Deljoo, V., Mirzapour Al-e-hashem, S.M.J., Dynamic cell formation
and the worker assignment problem: a new model (2009) Int J Adv Manuf Technol, 41,
pp. 329-342;
cellular manufacturing systems (2006) Int J Prod Econ, 103, pp. 767-783;
Oper Res, 187, pp. 46-69;
Res, 171, pp. 1051-1070;
Ahkioon, S., Bulgak, A.A., Bektas, T., Cellular manufacturing system design with
routing flexibility, machine procurement, production planning and dynamic system
reconfiguration (2009) Int J Prod Res, 47 (6), pp. 1573-1600;
Ahkioon, S., Bulgak, A., Bektas, T., Integrated cellular manufacturing systems
design with production planning and dynamic system reconfiguration (2009) Eur J
Oper Res, 192, pp. 414-428;
manufacturing system (2011) Appl Math Model, 35, pp. 1810-1819;
formation considering labor utilization (2012) Appl Math Model, 37, pp. 2308-2316;
duplication in cellular manufacturing systems (2011) Int J Adv Manuf Technol, 57,
pp. 1155-1173;
Manzini, R., Bindi, F., Pareschi, A., The threshold value of group similarity in
the formation of cellular manufacturing systems (2010) Int J Prod Res, 48 (10), pp.
3029-3060;
dynamic cell formation problem using metaheuristics (2005) Appl Math Comput, 170,
pp. 761-780;
problem with multiple routings via a double-loop genetic algorithm (1998) Eur J
Oper Res, 109, pp. 286-298;
approach to the cell formation problem (2005) Int J Adv Manuf Technol, 25, pp. 988-
997;
Int J Prod Res, 44 (22), pp. 4855-4875;
manufacturing (2007) Eng Opt, 39 (5), pp. 551-565;
functional mathematical programming model (2006) Int J Adv Manuf Technol, 30, pp.
309-318;
Wu, X., Chu, C.-H., Wang, Y., Yan, W., A genetic algorithm for cellular
manufacturing design and layout (2007) Eur J Oper Res, 181, pp. 156-167;
Arkin, F., Güngör, Z., Modeling of a manufacturing cell design problem with fuzzy
multi-objective parametric programming (2009) Math Comput Model, 50, pp. 407-420;
formation design: Benders’ decomposition approach (2011) Expert Syst Appl, 38, pp.
2478-2488;
Wang, X., Tang, J., Yung, K.-L., Optimization of the multi-objective dynamic cell
formation problem using a scatter search approach (2009) Int J Adv Manuf Technol,
44, pp. 318-329;
Oper Res, 36, pp. 777-794;
Pitombeira Neto, A.R., Gonçalves Filho, E.V., A simulation-based evolutionary
multiobjective approach to manufacturing cell formation (2010) Comput Ind Eng, 59,
pp. 64-74;
Stawowy, A., Evolutionary strategy for manufacturing cell design (2006) Int J Manag
Sci Omega, 34, pp. 1-18
CORRESPONDENCE ADDRESS: Rabbani, M.; School of Industrial & Systems Engineering,
College of Engineering, University of TehranIran; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Saeidi, S., Solimanpur, M., Mahdavi, I., Javadian, N.

57197001555;35615315700;16417373200;23485559000;
A multi-objective genetic algorithm for solving cell formation problem using a
fuzzy goal programming approach
1635-1652. Cited 17 times.
84896708527&doi=10.1007%2fs00170-013-5392-
0&partnerID=40&md5=e16d0bdd093dd3fcbd7a3b7efcb2fc21
DOI: 10.1007/s00170-013-5392-0
AFFILIATIONS: Department of Computer Engineering, Tabriz Branch, Islamic Azad
University, Tabriz, Iran;
Faculty of Engineering, Urmia University, Urmia, Azerbaijan;
ABSTRACT: A comprehensive multi-objective mathematical programming model is
proposed in this paper to design a cellular manufacturing system. The model
considers machine redundancy, production volume, processing time, cost of machines,
sequence of operations, and alternative processing plans. A fuzzy goal programming
approach is used to convert the proposed multi-objective model into a single-
objective one. Due to NP-hard nature of the model, a genetic algorithm is developed
for solving the proposed model. Performance of the proposed genetic algorithm is
evaluated by adopting four problems from literature. The results indicate
effectiveness and efficiency of the proposed algorithm in comparison with those
obtained by Lingo and NSGA-II algorithm. © 2013 Springer-Verlag London.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing; Fuzzy goal
programming; Genetic algorithm; Group technology; NSGA-II
INDEX KEYWORDS: Cell formation problem; Effectiveness and efficiencies; Fuzzy goal
programming; Multi-objective genetic algorithm; Multi-objective mathematical
programming; Multi-objective modeling; NSGA-II; Production volumes, Cellular
manufacturing; Computer programming; Genetic algorithms; Group technology;
Mathematical programming, Problem solving
REFERENCES: Zhao, C., Wu, Z., A genetic algorithm for cell formation with multiple
routes and multiple objectives (2000) Int J Prod Res, 38, pp. 385-385.,
10.1080/002075400189473 0944.90508;
Gallagher, C.C., Knight, W.A., (1986) Group Technology: Production Methods in
Manufacture, , Prentice Hall, New Jersey;
Technol, 46 (9-12), pp. 1201-1213., 10.1007/s00170-009-2170-0;
Erhan, K.S., Das, S.K., Gungor, Z., A mixed integer programming for formulation for
scheduling of virtual manufacturing cells (VMCS) (2009) Int J Adv Manuf Technol, 47
(5-8), pp. 665-678;
Erhan, K.S., Toksari, M.D., Gungor, Z., Guner, E., Analyzing the behaviors of
virtual cells (VCs) and traditional manufacturing systems: Ant colony optimization
(ACO)-based metamodels (2009) Comput Oper Res, 36, pp. 2275-2285.,
10.1016/j.cor.2008.09.002 1158.90331;
Pai, P.F., Chang, P.T., Lee, S.Y., Part-machine family formation using genetic
algorithm in a fuzzy environment (2005) Int J Adv Manuf Technol, 25 (11-12), pp.
1175-1179., 10.1007/s00170-003-1944-z;
flows (2005) Int J Adv Manuf Technol, 27 (1-2), pp. 159-165., 10.1007/s00170-004-
2143-2;
Gajendra, K.A., Jay, B.G., Forming GT cell incrementally using GRASP (2005) Int J
997., 10.1007/s00170-003-1912-7;
Muruganandam, A., Prabhaharan, G., Asokan, P., Girish, B.S., Machine cell formation
Bhide, P., Bhandwale, A., Cell formation using multiple process plans (2005) J
Intell Manuf, 16, pp. 53-65., 10.1007/s10845-005-4824-6;
Wei, N.C., Mejabi, O.O., A clustering approach for minimizing intercell trips in
cell formation (2008) J Intell Manuf, 19 (1), pp. 13-20., 10.1007/s10845-007-0042-
8;
functional mathematical programming model (2006) Int J Adv Manuf Technol, 30 (3-4),
pp. 309-318., 10.1007/s00170-005-0056-3;
Wu, T.H., Low, C., Wu, W.T., A Tabu search approach to the cell formation problem
Heragu, S.S., Kakutur, S.R., Grouping and placement of machine cells (1997) IIE
Trans, 29, pp. 561-571;
Kim, C.O., Baek, J.G., Jun, J., A machine cell formation algorithm for
simultaneously minimizing machine workload imbalances and inter-cell part movements
(2005) Int J Adv Manuf Technol, 26 (3), pp. 268-275., 10.1007/s00170-003-1619-9;
Liang, M., Zolfagari, S., Machine cell formation considering processing times and
machine capacities: An Ortho-synapse Hopfield neural network approach (1999) J
Intell Manuf, 10, pp. 437-447., 10.1023/A:1008923114466;
Anvari, M., Saeidi, M.M., Barzinpour, F., Machine-part cell formation using a
hybrid particle swarm optimization (2010) Int J Adv Manuf Technol, 47 (5-8), pp.
745-754., 10.1007/s00170-009-2202-9;
Vin, E., Delit, P., Delchambre, A., A multiple-objective grouping genetic algorithm
pp. 189-205., 10.1007/s10845-004-5888-4;
Manuf Technol, 39 (9-10), pp. 943-953;
formulations of cell formation problem without presetting number of cells (2004) J
Intell Manuf, 15, pp. 753-759., 10.1023/B:JIMS.0000042661.56171.bb;
Satoglu, S., Suresh, N.C., A gal-programming approach for design of hybrid cellular
manufacturing system in dual resource constrained environment (2009) Comput Ind
Eng, 56, pp. 560-575., 10.1016/j.cie.2008.06.009;
using neural networks (2009) Comput Ind Eng, 56, pp. 1340-1347.,
10.1016/j.cie.2008.08.003;
Ah-Kioon, S., Bulgak, A.A., Bektas, T., Integrated cellular manufacturing systems
Oper Res, 192, pp. 414-428., 10.1016/j.ejor.2007.09.023 2454782;
cell formation, intercellular machine layout and cell layout in the CMS problem
based on TOPSIS method (2009) Comput Oper Res, 36, pp. 1478-1496.,
10.1016/j.cor.2008.02.012 1179.90101;
Mahdavi, I., Paydar, M.M., Solimanpur, M., Heidarzadeh, A., Genetic algorithm
Expert Syst Appl, 36, pp. 6598-6604., 10.1016/j.eswa.2008.07.054;
multi-objective parametric programming (2009) Math Comput Model, 50, pp. 407-420.,
10.1016/j.mcm.2009.04.017 1185.90215;
Tavakkoli-Moghaddam, R., Javadian, N., Khorrami, A., Gholipur-Kanani, Y., Design of
scatter search method for a novel multi-criteria group scheduling problem in a
cellular manufacturing system (2010) Expert Syst Appl, 37, pp. 2661-2669.,
10.1016/j.eswa.2009.08.012;
Safaei, N., Saidi-Mehrabad, M., Tavakkoli-Moghaddam, R., Sassani, F., A Fuzzy
conditions, problem (2008) Fuzzy Sets Syst, 159, pp. 215-236.,
10.1016/j.fss.2007.06.014 1170.90380 2372357;
Akturk, M., Turkcan, A., Cellular manufacturing system design using a holonistic
approach (2000) Int J Prod Res, 38 (10), pp. 2327-2347., 10.1080/00207540050028124
1012.90507;
Lokesh, K., Jain, P.K., Dynamic cellular manufacturing systems design - A
comprehensive model & HHGA (2010) Adv Prod Eng Manag, 5 (3), pp. 151-162;
cellular manufacturing systems (2006) Int J Prod Econ, 103, pp. 767-783.,
10.1016/j.ijpe.2005.10.008;
Bajestani, M.A., Rabbani, M., Rahimi-Vahed, A.R., Khoshkhou, G.B., A multi
Res, 36, pp. 777-794., 10.1016/j.cor.2007.10.026 1157.90384;
cell formation problem (2005) Int J Prod Res, 43 (4), pp. 829-853.,
10.1080/00207540512331311859;
formation design: Benders' decomposition approach (2010) Expert Syst Appl, ,
10.1016/j.eswa.2010.08.037;
Planning, Design, and Analysis of Cellular Manufacturing Systems, p. 18., A.K.
Kamrani H.R. Parsaei D.H. Liles (eds) Elsevier Amsterdam;
Yildiz, A.R., A novel particle swarm optimization approach for product design and
manufacturing (2009) Int J Adv Manuf Technol, 40 (5-6), pp. 617-628.,
10.1007/s00170-008-1453-1;
Yildiz, A.R., Multi-objective optimization of vehicle crash worthiness using a new
particle swarm based approach (2012) Int J Adv Manuf Technol, 59 (1-4), pp. 367-
376., 10.1007/s00170-011-3496-y;
Yildiz, A.R., A new hybrid particle swarm optimization approach for structural
design optimization in automotive industry (2012) J Automob Eng, 226 (10), pp.
1340-1351., 10.1177/0954407012443636;
Yildiz, A.R., A new hybrid bee colony optimization approach for robust optimal
design and manufacturing (2013) Appl Soft Comput, , 10.1016/j.bbr.2011.03.031;
Yildiz, A.R., Optimization of cutting parameters in multi-pass turning using
artificial bee colony-based approach (2013) Inf Sci, 220, pp. 399-407.,
10.1016/j.ins.2012.07.012 2993692;
Yildiz, A.R., Hybrid Taguchi-differential evolution algorithm for optimization of
multi-pass turning operations (2013) Appl Soft Comput, ,
10.1016/j.asoc.2012.01.012;
Yildiz, A.R., Comparison of evolutionary-based optimization algorithms for
structural design optimization (2013) Eng Appl Artif Intel, 26 (1), pp. 327-333;
Yildiz, A.R., A new hybrid differential evolution algorithm for the selection of
optimal machining parameters in milling operations (2013) Appl Soft Comput, ,
10.1016/j.asoc.2011.12.016;
Yildiz, A.R., Cuckoo search algorithm for the selection of optimal machining
parameters in milling operations (2013) Int J Adv Manuf Technol, , 10.1007/s00170-
012-4013-7;
Yildiz, A.R., An effective hybrid immune-hill climbing optimization approach for
solving design and manufacturing optimization problems in industry (2009) J Mater
Process Technol, 50 (4), pp. 224-228;
Yildiz, A.R., Hybrid immune-simulated annealing algorithm for optimal design and
manufacturing (2009) Int J Mater Prod Technol, 34 (3), pp. 217-226.,
10.1504/IJMPT.2009.024655;
Yildiz, A.R., A novel hybrid immune algorithm for global optimization in design and
manufacturing (2009) Robot Comput Integr Manuf, 25 (2), pp. 261-270.,
10.1016/j.rcim.2007.08.002;
Yildiz, A.R., A new design optimization framework based on immune algorithm and
taguchi method (2009) Comput Ind, 60 (8), pp. 613-620.,
10.1016/j.compind.2009.05.016;
Narasimhan, R., Goal programming in a fuzzy environment (1980) Decis Sci, 11, pp.
325-336., 10.1111/j.1540-5915.1980.tb01142.x 451779;
Deb, K., (2009) 2 Multi-objective Optimization Using Evolutionary Algorithms, ,
John Wiley & Sons UK;
Eski, O., Ozkarahan, I., A simulation based fuzzy goal programming model for cell
formation (2007) Fourth Int Conf Fuzzy Syst Knowl Discov, 3, pp. 493-498.,
10.1109/FSKD.2007.124;
Safaei, N., Javadian, N., Saidi-Mehrabad, M., A fuzzy goal programming based
approach to solve a dynamic cell formation problem (2006) Proceeding of the 36th
CIE Conference on Computers and Industrial Engineering, , 20-23 June 2006, Taipei,
Taiwan;
Jayachitra, R., Revathy, A., Prasad, P.S.S., A fuzzy programming approach for
formation of virtual cells under dynamic and uncertain conditions (2010) Int J Eng
Sci Technol, 2 (6), pp. 1708-1724;
for the design of cellular manufacturing systems (2004) Int J Prod Res, 42, pp.
1419-1441., 10.1080/00207540310001638073 1060.90084;
Gen, M., Cheng, R., (2000) Manufacturing Cell Design. In: Genetic Algorithm and
Engineering Optimization, pp. 390-450., John Wiley New York;
to cell composition and layout design problems (1996) Int J Prod Res, 34 (2), pp.
447-482., 10.1080/00207549608904913 0924.90081
CORRESPONDENCE ADDRESS: Saeidi, S.; Department of Computer Engineering, Tabriz
Branch, Islamic Azad University, Tabriz, Iran; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Gupta, N.S., Devika, D., Panpaliya, V.

55295667200;36634075600;56297361400;
Some clarifications on the use of Mahalanobis distance for the machine-part cell
formation problem
84905002928&doi=10.1007%2fs00170-014-5854-
z&partnerID=40&md5=31e27d11f4ede299a2126c69b594e5aa
DOI: 10.1007/s00170-014-5854-z
AFFILIATIONS: Manufacturing Engineering Division, School of Mechanical and Building
Sciences, VIT University, Vellore, India;
School of Mechanical and Building Sciences, VIT University, Vellore, India
ABSTRACT: In this paper, the clarifications regarding the usage of Mahalanobis
distance (MD) for the machine-part cell formation (MPCF) are demonstrated. Perhaps,
for the first time, part families are created using the correlation matrix derived
from the covariance matrix of the given incidence matrix. The proposed MD-based
method is compared with the existing popular methods for MPCF using the benchmark
data sets from the literature. Also, in the present work, the procedure for
calculation of MD for the purpose of machine-part cell formation in the event of
high correlations is explained. The comparative performance analysis reveals that
the grouping efficacy of the proposed MD-based method is at par or better when
compared with the other popular algorithms available in the literature. © 2014
Springer-Verlag London.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing system; Group
technology; Mahalanobis distance
INDEX KEYWORDS: Cellular manufacturing; Covariance matrix, Benchmark data; Cell
formation; Cell formation problem; Comparative performance analysis; Correlation
matrix; Grouping efficacy; Incidence matrices; Mahalanobis distances, Group
technology
pp. 1361-1380;
Askin, R.G., Subramanian, S., Cost-based heuristic for group technology
113;
Ballakur, A., Steudel, H.J., Within-cell utilization based heuristic for designing
25 (5), pp. 639-665;
Int J Prod Res, 29, pp. 343-356., 10.1080/00207549108930075;
Boe Warren, J., Cheng Chun Hung, Close neighbour algorithm for designing cellular
pp. 2097-2116;
Burbidge, J.L., Production flow analysis (1971) Prod Eng, 50, pp. 139-152.,
10.1049/tpe.1971.0022;
Burgess, A.G., Morgan, I., Vollmann, T.E., Cellular manufacturing: Its impact on
the total factory (1993) International Journal of Production Research, 31 (9), pp.
2059-2077;
Int J Prod Res, 11, pp. 399-416., 10.1080/00207547308929988;
algorithm for cellular manufacturing (1986) Int J Prod Res, 24, pp. 451-464.,
10.1080/00207548608919741 0582.90050;
Research, 24 (5), pp. 1221-1233;
1052., 10.1080/00207548908942606;
Chatttopadhyay, M., Chatttopadhyay, S., Dan, P.K., Machine-part cell formation
through visual decipherable clustering of self-organizing map (2011) Int J Adv
Manuf Tecnol, 52, pp. 1019-1030., 10.1007/s00170-010-2802-4;
Research, 36 (5), pp. 1325-1337;
Chu, C.H., Tsai, M.A., Comparison of three-array based clustering techniques for
manufacturing cell formation (1990) Int J Prod Res, 28 (8), pp. 1417-1433.,
10.1080/00207549008942802;
Diaz, J.A., Luna, D., Luna, R., GRASP heuristic for the manufacturing cell
formation problem (2012) TOP, 20 (3), pp. 679-706;
Journal of Production Research, 39 (1), pp. 1-19., DOI 10.1080/00207540150208835;
and ratio-level data (2003) Int J Adv Manuf Tecnol, 22, pp. 125-133.,
10.1007/s00170-002-1451-7;
Gupta, N.S., Devika, D., A novel approach to machine-part cell formation using
Mahalanobis distance (2011) Eur J Sci Res, 62 (1), pp. 43-47;
Hachicha, W., Masmoudi, F., Haddar, M., Formation of machine groups and part
families in cellular manufacturing systems using a correlation analysis approach
1157-1169., DOI 10.1007/s00170-007-0928-9;
Haibo, W., Bahram, A., Fred, G., Gary, K., Solving group technology problems via
clique partitioning (2006) Int J Flex Manuf Syst, 18 (2), pp. 77-97., 1141.90568;
Hyer, N., Wemmerlov, U., Group technology in the US manufacturing industry: A
survey of current practices (1989) Int J Prod Res, 27, pp. 1287-1304.,
10.1080/00207548908942623;
(2008) Int J Prod Res, 46 (15), pp. 4237-4258., 10.1080/00207540601078054
1153.90398;
Research, 18 (2), pp. 213-232;
Review and extension (1982) Int J Prod Res, 20, pp. 117-133.,
10.1080/00207548208947754;
Kumar, K.R., Chandrasekaran, M.P., A quantitative criterion for goodness of block
diagonal forms of binary matrices in group technology (1990) Int J Prod Res, 28
(2), pp. 233-243., 10.1080/00207549008942706;
387-397., DOI 10.1016/0377-2217(86)90032-9;
561-569., 10.1080/00207548708919861;
Kusiak, A., Group technology (1992) Intelligent Design and Manufacturing, pp. 289-
302., A. Kusiak (eds) Wiley New York;
cellular manufacturing (2007) Int J Prod Res, 45 (5), pp. 1049-1062.,
10.1080/00207540600634923 1128.90407;
McAuley, J., Machine grouping for efficient production (1972) Int J Prod Eng, 51,
pp. 53-57;
10.1287/opre.20.5.993 0249.90046;
Megala, N., Chandrasekharan, R., Ram, G., An ant colony algorithm for cell-
formation in cellular manufacturing systems (2008) European Journal of Industrial
Engineering, 2 (3), pp. 298-336., DOI 10.1504/EJIE.2008.017688;
implementation (1985) Omega, 13, pp. 381-391., 10.1016/0305-0483(85)90066-0;
technology machine clustering problem (1985) OMEGA, 13, pp. 577-583., 10.1016/0305-
0483(85)90046-5;
Mukhopadhyay, S.K., Ramesh, B.K., Sai, K., Vijay, V., A note on Modified
Hamiltonian chain: A graph theoretic approach to group technology (2009) Int J Prod
Res, 47 (1), pp. 289-298., 10.1080/00207540601164219;
135-149., DOI 10.1007/s00170-006-0710-4;
Jayakrishnan Nair, G., Narendran, T.T., CASE: A clustering algorithm for cell
36 (1), pp. 157-179;
10.1016/S0360-8352(00)00074-7;
Ozturk, G., Kamisli, Z., Islier, A., A comparison of competitive neural network
with other AI techniques in manufacturing cell formation (2006) LNCS 4221, ,
Springer-Verlag, Berlin Heidelberg;
Seifoddini Hamid, K., Single linkage versus average linkage clustering in machine
cells formation applications (1989) Computers and Industrial Engineering, 16 (3),
pp. 419-426., DOI 10.1016/0360-8352(89)90160-5;
Seifoddini, H., Wolfe, P., Application of similarity coefficient methods in GT
(1986) IIE Trans, 18, pp. 271-277., 10.1080/07408178608974704;
and Control, pp. 73-81., Chapman and Hall London 10.1007/978-1-4613-1187-4;
10.1080/00207549408957064 0897.90116;
Srinivasan, G., Narendran, T.T., GRAFICS - A non-hierarchical clustering algorithm
for group technology (1991) Int J Prod Res, 29, pp. 463-478.,
10.1080/00207549108930083;
Research, 28 (1), pp. 145-152;
Stanfel, L., Machine clustering for economic production (1985) Eng Costs Prod Econ,
9, pp. 73-78., 10.1016/0167-188X(85)90012-6;
Taguchi, G., Jugulum, R., (2002) The Mahalanobis-Taguchi Strategy: A Pattern
Technology System, , Wiley New York 10.1002/9780470172247;
modified ART1 neural networks (2006) Int J Adv Manuf Technol, 28 (7-8), pp. 761-
765., 10.1007/s00170-004-2421-z;
CORRESPONDENCE ADDRESS: Gupta, N.S.; Manufacturing Engineering Division, School of
Mechanical and Building Sciences, VIT University, Vellore, India; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Li, S., Mehrabadi, H.

57203292648;56277939800;
Generation of block diagonal forms using hierarchical clustering for cell formation
problems
(2014) Procedia CIRP, 17, pp. 44-49. Cited 3 times.
84904466864&doi=10.1016%2fj.procir.2014.01.143&partnerID=40&md5=ca9425c8d703488baf6
ba6cd9b54d192
DOI: 10.1016/j.procir.2014.01.143
AFFILIATIONS: University of Calgary, Calgary, AB, Canada;
Concordia University, Montreal, MO, Canada
ABSTRACT: While cell formation (CF) problems have been studied for few decades, the
purpose of this paper is to advance the solution technique using one classical
approach, hierarchical cluster analysis (HCA). In the application of HCA, one
technical challenge is to cluster both machines and parts simultaneously. In this
paper, this challenge is addressed by quantifying the coupling between machines and
parts in the clustering process. One feature of the proposed method is to generate
block diagonal forms that show some intermediate sorting of machines and parts
without specifying the structural criteria (e.g., the number of cells).
Consequently, engineers can specify the structural criteria after inspecting the
block diagonal forms instead of specifying them at the beginning. Some numerical
examples from literature are used to examine and verify the proposed method. © 2014
Elsevier B.V.
AUTHOR KEYWORDS: Cell formation problem; Hierarchical clustering; Simultaneous
clustering
INDEX KEYWORDS: Cells; Cluster analysis; Clustering algorithms; Couplings;
Cytology; Hierarchical systems; Manufacture; Numerical methods, Cell formation
problem; Classical approach; Hier-archical clustering; Hierarchical cluster
analysis; Simultaneous clustering; Solution techniques; Structural criterion;
Technical challenges; Clustering process, Cellular manufacturing
REFERENCES: King, J.R., Nakornchai, V., Machine-component group formation in group
technology: Review and extension (1982) International Journal of Production
Research, 20, pp. 117-133;
Economics, 101, pp. 329-352;
51, pp. 53-57;
2097-2116;
Daita, S.T.S., Irani, S.A., Kotamraju, S., Algorithms for production flow analysis
Josien, K., Liao, T.W., Simultaneous grouping of parts and machines with an
Chen, C.Y., Irani, S.A., Cluster first-sequence last heuristics for generating
block diagonal forms for a machine-part matrix (1993) International Journal of
Research, 28, pp. 145-152;
and production volumes (2001) International Journal of Production Research, 39, pp.
2755-2768;
Kumar, C.S., Chandrasekharah, M.P., Grouping efficacy: A quantitative criterion for
Sarker, B.R., The resemblance coefficients in group technology: A survey and
comparative study of relational metrics (1996) Computers and Industrial
48, pp. 471-489;
Wasserman, S., Katherine, F., (1994) Social Network Analysis: Methods and
Applications, , Cambridge: Cambridge University Press;
(2009) International Journal of Production Economics, 120, pp. 669-688
CORRESPONDENCE ADDRESS: Li, S.; University of Calgary, Calgary, AB, Canada; email:
[email protected]
ISSN: 22128271
SOURCE: Scopus
Jia, G.-Z., Luan, S.-C., Chen, L., Min, C.

34876688200;55511916500;57192612283;55512196600;
Cell formation problem for virtual cellular manufacturing based on the process
modularization
(2012) Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 32
(10), pp. 2111-2118. Cited 7 times.
84870586947&partnerID=40&md5=0f73f4adb8c7c05cb8462a4a0aa4f8b2
AFFILIATIONS: School of Economics and Management, Beihang University, Beijing

100191, China
ABSTRACT: In order to improve the agility of virtual cellular manufacturing in the
functional layout manufacturing system for multi-product and small-batch
manufacturing enterprise, it presents a novel method for virtual cell formation
based on process modularization. The integrated method which combines both parts-
based clustering analysis and process-based clustering analysis decomposes parts
process based on process modularization. And a process module warehouse for the
manufacturing system is formed, then we can construct virtual manufacturing cells.
The superiority of the novel clustering analysis is that it can reduce the control
difficulty of manufacturing system, improve the construction speed of virtual cell
of manufacturing system. Besides, the method also can reduce lead time and improve
the agility for virtual cellular manufacturing system.
AUTHOR KEYWORDS: Clustering analysis; Process modularization; Virtual
manufacturing cell
INDEX KEYWORDS: Cell formation problem; Clustering analysis; Construction speed;
Functional layout; Integrated method; Leadtime; Modularizations; Multi-products;
Novel clustering; Small-batch manufacturing; Virtual cells; Virtual cellular
manufacturing; Virtual cellular manufacturing system; Virtual manufacturing cell,
Computer aided manufacturing; Modular construction, Cellular manufacturing
REFERENCES: Voss, C., Blackmonr, K., Differences in manufacturing strategy
decisions between Japanese and Western manufacturing plants: The role of strategic
time orientation (1998) Journal of Operations Management, 16 (2), pp. 147-158;
Sherehiy, B., Karwowski, W., Layer, J.K., A review of enterprise agility: Concepts,
frameworks, and attributes (2007) International Journal of Industrial Ergonomics,
37 (5), pp. 445-460;
Wang, A.M., Xiao, T.Y., Fan, L.Y., Research on clustering planning of machine cell
for product family (2004) Computer Integrated Manufacturing Systems, 10 (10), pp.
1257-1262;
Wang, Z.L., Wang, H.F., Zhang, Y.L., An algorithm on the reconfiguration of agile
manufacturing cell (2003) Chinese Manufacturing's Informatization, 32 (6), pp. 96-
99;
Liang, F.J., Ning, R.X., Method of virtual manufacturing cell formation based on
similarity science in reconfigurable manufacturing system (2004) Computer
Integrated Manufacturing Systems, 10 (11), pp. 1370-1376;
Babu, A.S., Nandurkar, K.N., Thomas, A., Development of virtual cellular
manufacturing systems for SMEs (2000) Logistics Information Management, 13 (4), pp.
228-242;
52 (6), pp. 673-681;
Ratchev, S.M., Concurrent process and facility prototyping for formation of virtual
manufacturing cells (2001) Integrated Manufacturing Systems, 12 (4), pp. 306-315;
Ko, K.C., Egbelu, P.J., Virtual cell formation (2003) International Journal of
Ko, K.C., Virtual production system (2000), IA, USA: Lowa State University; Slomp,
J., Chowdary, B.V., Suresh, N.C., Design of virtual manufactuting cells: A
Manufactuting, 21 (3), pp. 273-288;
demand changes (2007) Computers and Industrial Engineering, 53 (3), pp. 478-490;
scheduling of virtual manufacturing cells (VMCs) (2010) Computers and Operations
Research, 37 (6), pp. 1148-1156;
Applied Soft Computing, 11 (3), pp. 3160-3169;
Baldwin, C.Y., Clark, K.B., (2000) Design Rules: The Power of Modularity, ,
Cambridge, MA: MIT Press;
Liu, H.J., Chen, J.F., Zhu, G.L., Object-oriented process module design (2004)
Modular Machine Tool and Automatic Manufacturing Technique, (8), pp. 30-32
CORRESPONDENCE ADDRESS: Luan, S.-C.; School of Economics and Management, Beihang
University, Beijing 100191, China; email: [email protected]
ISSN: 10006788
CODEN: XGLSE
LANGUAGE OF ORIGINAL DOCUMENT: Chinese
ABBREVIATED SOURCE TITLE: Xitong Gongcheng Lilum yu Shijian
SOURCE: Scopus
Papaioannou, G., Wilson, J.M.

24767107500;7406642484;
A tabu search algorithm for the cell formation problem with part machine sequencing
(2012) Foundations of Computing and Decision Sciences, 37 (2), pp. 97-127.
84864768162&doi=10.2478%2fv10209-011-0008-
7&partnerID=40&md5=1d53784337446031d749673c1c04f4b3
DOI: 10.2478/v10209-011-0008-7
AFFILIATIONS: School of Business and Economics, Loughborough University,
Loughborough, LE11 3TU, United Kingdom;
School of Management and Business, Aberystwyth University, Aberystwyth, SY23 3DD,
United Kingdom
ABSTRACT: This paper presents extensions of the IP model where part-machine
assignment and cell formation are addressed simultaneously and part machine
utilisation is considered. More specifically, an integration of inter-cell
movements of parts and machine set-up costs within the objective function, and also
a combination of machine set-up costs associated with parts revisiting a cell when
the part machine operation sequence is taken into account are examined and an
enhanced model is formulated. Based upon this model's requirements, an initial
three stage approach is proposed and a tabu search iterative procedure is designed
to produce a solution. The initial approach consists of the allocation of machines
to cells, the allocation of parts to machines in cells and the evaluation of the
objective function's value. Special care has been taken when allocating parts to
machine cells as part machine operation sequence is preserved making the system
more complex but more realistic. The proposed tabu search algorithm integrates
short term memory and an overall iterative searching strategy where two move types,
single and exchange, are considered. Computational experiments verified both the
algorithm's robustness where promising solutions in reasonably short computational
effort are produced and also the algorithm's effectiveness for large scale data
sets.
AUTHOR KEYWORDS: Cell formation; Mixed integer linear programming; Part
allocation; Part machine operation sequence; Tabu search
INDEX KEYWORDS: Cells; Cellular manufacturing; Integer programming; Iterative
methods; Learning algorithms; Tabu search, Cell formation; Cell formation problem;
Computational experiment; Large scale data sets; Machine operation; Mixed integer
linear programming; Part allocation; Tabu search algorithms, Cytology
pp. 53-67;
Ahkioon, S., Bulgak, A.A., Bektas, T., Cellular manufacturing systems design with
routing flexibility, machine procurement production planning, and dynamic system
reconfiguration (2007) International Journal of Production Research, pp. 1-28.,
iFirst;
Askin, R.G., Goldberg, J.B., Cresswell, S.H., Strong, D., A Hamiltonian path
Beaulieu, A., Gharbi, A., An algorithm for the cell formation and machine selection
problems in the design of a cellular manufacturing system (1997) International
Boe, W.J., Cheng, G.H., A close neighbour algorithm for designing cellular
pp. 2097-2116;
Burbidge, J.L., (1989) Production flow analysis for planning group technology, ,
UK, Oxford Science Publications;
Chandrasekharan, M.P., Ragagopalan, R., An ideal-seed nonhierarchical clustering
Research, 24 (2), pp. 451-464;
cellular layout (2003) Computers and Industrial Engineering, 44, pp. 49-73;
Congawave, T., Ham, I., Cluster analysis applications for group technology
manufacturing systems (1981) Proceedings, North American Manufacturing Research
Conference (NAMRC), pp. 65-75., 9TH (Dearborn);
de Witte, J., The use of similarity coefficients in production flow analysis (1980)
Dorigo, M., Maniezzo, V., Colorni, A., Ant system: Optimisation by a colony of
cooperating agents (1996) IEEE Transactions on Systems, Man and Cybernetics-Part B
Garey, M.R., Johnson, D.S., (1979) Computers and Intractability, , San Fransisco,
CA: Freeman;
Glover, F., Tabu Search-Part I (1989) ORSA Journal on Computing, 1 (3), pp. 190-
206;
Glover, F., Tabu Search-Part II (1990) ORSA Journal on Computing, 2 (1), pp. 4-32;
Glover, F., Laguna, M., (1997) Tabu Search, , Norwell, MA: Kluwer Academic;
University of Michigan, Michigan;
Kim, C.O., Baek, J.G., Baek, J.K., A hybrid grouping genetic algorithm for the cell
formation problem (2004) Computers and Operations Research, 34, pp. 2059-2079;
Research, 18 (2), pp. 213-232;
pp. 117-133;
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P., Optimisation by simulated
397;
Kusiak, A., Heragu, S.S., Group Technology (1987) Computers in Industry, 9, pp. 83-
91;
16, pp. 491-497;
McCormick, W.T., Schweitzer, P.J., White, T.W., Problem Decomposition and data
reorganisation by a clustering technique (1972) Operations Research, 20, pp. 993-
1009;
329-341;
Papaioannou, G., Wilson, J.M., The Evolution of cell formation problem
Purcheck, G.F., Programming method for combinatorial group of an incomplete power
set (1975) Journal of Cybernetics, 5, pp. 51-76;
Sankaran, S., Multiple objective decision making approach to cell formation-A goal
programming model (1990) International Journal of Production Research, 13, pp. 71-
81;
group technology systems (1993) European Journal of Operational Research, 69, pp.
373-383;
Selim, M.S., Askin, R.G., Vakharia, A.J., Cell Formation in Group Technology:
Review Evaluation and Directions for Future Research (1998) Computers and
Singh, N., Design of Cellular Manufacturing Systems: An Invited Review (1993)
Solimanpur, M., Vrat, P., Shankar, R., Ant colony optimisation algorithm to the
approach and a tabu search algorithm (2003) International Journal of Production
Research, 41 (11), pp. 2531-2546;
Vakharia, A.J., Chang, Y.-L., Cell formation in group technology: A combinatorial
search approach (1997) International Journal of Production Research, 35 (7), pp.
2025-2043;
materials flow approach based on operation sequences (1990) IIE Transactions, 22
(1), pp. 84-97;
24 (2), pp. 387-400;
Engineering, 22 (4), pp. 469-480;
Wang, J., A linear assignment algorithm for formation of machine cells and part
families in cellular manufacturing (1998) Computers and Industrial Engineering, 35,
pp. 81-84;
Wemmerlov, U., Hyer, N.L., Procedures for the Part/Machine Group Identification
Problem in Cellular Manufacturing (1986) Journal of Operations Management, 6, pp.
125-147;
Wemmerlov, U., Hyer, N.L., Cell Manufacturing in the US Industry: A Survey of Users
Wu, T.-H., Low, C., Wu, W.-T., A tabu search approch to the cell formation problem

Xpress, M.P., Dash Optimisation, , Blisworth, Northamptonshire, UK;
formation problem (1995) Computers and Industrial Engineering, 28, pp. 911-916
CORRESPONDENCE ADDRESS: Papaioannou, G.; School of Business and Economics,
Loughborough University, Loughborough, LE11 3TU, United Kingdom; email:
[email protected]
PUBLISHER: Walter de Gruyter GmbH
ISSN: 08676356
ABBREVIATED SOURCE TITLE: Found. Comput. Decis. Sci.
SOURCE: Scopus
Vin, E., Delchambre, A.

8360139700;6603821707;
Comparison between simultaneous and iterative resolutions for generalized cell
formation problems with a Genetic Algorithm
(2012) IFAC Proceedings Volumes (IFAC-PapersOnline), 14 (PART 1), pp. 1751-1756.
84866126814&doi=10.3182%2f20120523-3-RO-
2023.00229&partnerID=40&md5=3933c870b17cfe67f8586a7714ee67b3
DOI: 10.3182/20120523-3-RO-2023.00229
AFFILIATIONS: BEAMS Department, Université libre de Bruxelles (ULB), Brussels, B-
1050, Belgium
ABSTRACT: Actually, lean manufacturing is a must to improve productivity and reduce
cost. One of the tools of lean is cellular manufacturing. This technique subdivides
the factory to several small entities, which are easier to manage. The algorithm
proposed in this paper is based on the simultaneous resolution of two
interdependent problems. These two problems emerge when the notion of flexibility
is introduced in the production process. This paper demonstrates the efficiency of
the simultaneous resolution through a unique adapted genetic algorithm compared to
a sequential resolution with iterations. © 2012 IFAC.
AUTHOR KEYWORDS: Cellular manufacturing; Flow analysis; Genetic algorithm
INDEX KEYWORDS: Cell formation problem; Flow analysis; Lean manufacturing;
Production process, Genetic algorithms, Cellular manufacturing
formation in generalized group technology (2001) Comput. Ind. Eng., 41 (2), pp.
227-240;
(2001) Comput. Integr. Manuf. Syst., 12, pp. 258-274;
Caux, C., Cell formation with alternative process plans and machine capacity
constraints: A new combined approach (2000) Int. J. Econ., 64, pp. 279-284;
Chen, J.S., Heragu, S.S., Stepwise decomposition approaches for large scale cell
formation problems (1999) Eur. J. Op. Res., 113, pp. 64-79;
Int. J. Op. Res, 26 (7), pp. 1161-1172;
Defersha, F.M., Chen, M., A comprehensive mathematical model for the design of the
cellular manufacturing systems (2006) Int. J. Prod. Econ., 103, pp. 767-783;
Falkenauer, E., (1998) Genetic Algorithm and Grouping Problem, , Wiley & Sons;
Gravel, M., Nsakanda, A.L., Price, W., Efficient solutions to the cellformation
Op. Res., 109, pp. 286-298;
Heragu, S.S., Chen, J.S., Optimal solution of cellular manufacturing system design:
Benders' decomposition approach (1998) Eur. J. Op. Res., 107, pp. 175-192;
Holland, J.H., (1975) Adaptation in Natural and Artificial Systems, , Ann Arbor:
University of Michigan Press;
alternative Part process plans (1996) Comp. Ind. Eng., 30 (3), pp. 423-431;
Jayaswal, S., Adil, G.K., An efficient algorithm for cell formation with sequence
data, machine replications and alternative process routings (2004) Int. J. Prod.
Res., 42 (12), pp. 2419-2433;
Jeon, G., Leep, H.R., Forming Part families by using genetic algorithm and
designing machine cells under demand changes (2006) Comput. Op. Res., 33 (1), pp.
263-283;
Joines, J., Culbreth, C., King, R., A comprehensive review of production oriented
cell formation techniques (1996) Int. J. Factory Automation and Information
Management, 3 (3-4), pp. 225-265;
Kang, S., Wemmerlov, U., A work load-oriented heuristic methodology for
manufacturing cell formation allowing reallocation of operations (1993) Eur. J. Op.
Res., 69 (3), pp. 292-311;
considering alternative routing (1997) Comput-integrated Manuf. Syst., 10 (2), pp.
93-108;
Kim, Y.D., A study on surrogate objectives for loading a certain type of flexible
manufacturing system (1993) Int. J. Prod. Res., 31, pp. 381-392;
Kusiak, A., The generalised group technology concept (1987) Int. J. Prod. Res., 25
(3), pp. 561-569;
Kusiak, A., (1992) Intelligent Manufacturing Systems, , Prentice Hall, Englewood,
NJ;
Int. J. Prod. Res., 32 (2), pp. 273-297;
presence of alternative routing (1999) Int. J. Op. Res, 37 (14), pp. 3289-3304;
(2007) Appl. Math. Comput., 190 (1), pp. 662-670;
machines (2002) Int. J. Op. Res, 40 (14), pp. 3291-3310;
manufacturing cells (1999) Int. J. Prod. Econ, 20 (60-61), pp. 421-426;
considerations in group technology applications (1990) Int. J. Prod. Res, 28 (12),
pp. 2243-2257;
Nsakanda, A., Diaby, M., Price, W.L., Hybrid genetic approach for solving large-
scale capacitated cell formation problems with multiple routings (2006) Eur. J. Op.
Res., 171 (3), pp. 1051-1070;
Rajamani, D., Singh, N., Aneja, Y.P., Selection of Parts and machines for
cellularization: A mathematical programming approach (1992) Eur. J. Op. Res., 62
(1), pp. 47-54;
with capacity planning and multiple routings (1998) Ann. Op. Res., 77, pp. 79-95;
Sankaran, S., Kasilingam, G., An integrated approach to cell formation and Part
routing in group technology manufacturing systems (1990) Eng. Optim., 16, pp. 235-
245;
Sofianopoulou, S., Manufacturing cell design with alterantive process plans and/or
replicate machines (1999) Int. J. Prod. Res, 37 (3), pp. 707-720;
to the design of cellular manufacturing systems (2004) Int. J. Prod. Res., 42 (7),
pp. 1419-1441;
process routes by genetic algorithm (2002) Int. J. Prod. Econ., 76 (3), pp. 219-
228;
Vin, E., DeLit, P.G., Delchambre, A., Une approche intégrée pour résoudre le
problème de formation des cellules de production avec des routages alternatifs
(2003) MOSIM03 World Symposium, , April 23-25, Toulouse, France;
Vin, E., (2010) Genetic Algorithm Applied to Generalized Cell Formation Problems, ,
PhD Thesis, Ecole Polytechnique de Bruxelles, Belgium;
(2000) Int. J. Prod. Res, 38 (1), pp. 229-240;
problem with alternative process plans (2004) Int. J. Adv. Manuf. Technol., 24 (11-
12), pp. 834-840;
mutation operator to the cell formation problem with alternative process routing
multiple routes and multiple objectives (2000) Int. J. Prod. Res., 38 (2), pp. 385-
395
CORRESPONDENCE ADDRESS: Vin, E.; BEAMS Department, Université libre de Bruxelles
(ULB), Brussels, B-1050, Belgium; email: [email protected]
ISSN: 14746670
ISBN: 9783902661982
SOURCE: Scopus
Tavakkoli-Moghaddam, R., Ranjbar-Bourani, M., Amin, G.R., Siadat, A.

56491438400;26768125700;8046731700;24438293900;
A cell formation problem considering machine utilization and alternative process
routes by scatter search
84865257527&doi=10.1007%2fs10845-010-0395-
2&partnerID=40&md5=d7ef8f2a626f5bef10d51bdcea73ceda
DOI: 10.1007/s10845-010-0395-2
University of Tehran, Tehran, Iran;
Department of Industrial Engineering, Islamic Azad University, South Tehran Branch,
Tehran, Iran;
Department of Computer Engineering, Postgraduate Engineering Centre, Islamic Azad
University, Tehran, Iran;
Arts et Métiers Paris Tech, LCFC, Metz, France
ABSTRACT: Cell formation (CF) is the first step in the design of cellular
manufacturing systems (CMSs), which has been recognized as an effective way to
enhance the productivity in a factory. There is a set of criteria on which to judge
route of product, machine grouping and part family simultaneously in terms of the
effective utilization of these cells. In this study, we consider four objectives
simultaneously: (1) Minimizing the total fixed and variable cost including costs of
purchasing, operation, and maintenance; (2) minimizing cost of intercellular
movements; (3) maximizing the utilization of machines in the system; and (4)
minimizing deviations among the levels of the cell utilization (i.e.; balancing the
workload between cells). In this paper, these objectives are first weighted by
their relative importance and then a new mathematical model is presented. To solve
this model, a scatter search (SS) algorithm is proposed to select a process plan
for each part with the minimum cost along with forming the part family and machine
grouping simultaneously. The performance of the proposed SS is compared with the
Lingo 8.0 software. A number of test problems are carried out to verify the good
ability of the proposed SS in terms of the solution quality and computational time.
The computational results reveal that the SS finds promising results, especially in
the case of large-sized problems. © 2010 Springer Science+Business Media, LLC.
AUTHOR KEYWORDS: Alternative process routes; Cell formation problem; Multi-
criteria; Scatter search
INDEX KEYWORDS: Alternative process; Cell formation; Cell formation problem;
Computational results; Computational time; Intercellular movement; Machine
grouping; Machine utilization; Minimizing costs; Minimum cost; Multi-criteria; New
mathematical model; Part family; Process plan; Scatter search; Solution quality;
Test problem; Variable costs, Cost accounting; Costs, Cellular manufacturing
1361-1380., 10.1080/00207549608904970;
multi-objective scatter search for a dynamic cell formation problem (2009)
Computers and Operations Research, 36 (3), pp. 777-794., 10.1016/j.cor.2007.10.026;
Technology, 32, pp. 531-536., 10.1007/s00170-005-0358-5;
Askin, R., Selim, H., Vakharia, A., A methodology for designing flexible cellular
International Journal of Production Economic, 64, pp. 279-284., 10.1016/S0925-
5273(99)00065-1;
Chan, F.T.S., Lau, K.W., Chan, P.L.Y., A holistic approach to manufacturing cell
formation: Incorporation of machine flexibility and machine aggregation (2004)
Proceedings of the Institution of Mechanical Engineers Part B: Journal of
Engineering Manufacture, 218 (10), pp. 1279-1296., 10.1243/0954405042323568;
Manufacturing, 22 (3), pp. 217-238., 10.1016/j.rcim.2005.04.002;
Chan, F.T.S., Lau, K.W., Chan, L.Y., Lo, V.H.Y., Cell formation problem with
International Journal of Production Research, 46 (6), pp. 2589-2620.,
10.1080/00207540500478843;
cell formation condition (1998) Annals of Operations Research, 77 (1), pp. 109-
128., 10.1023/A:1018917109580;
Galan, R., Racero, J., Eguia, I., Garcia, J.M., A systematic Approach for the
product families' formation in reconfigurable manufacturing systems (2007) Robotics
& Computer Integrated Manufacturing, 23 (5), pp. 489-502.,
10.1016/j.rcim.2006.06.001;
Glover, F., Heuristics for integer programming using surrogate constraints (1977)
Decision Sciences, 8 (1), pp. 156-166., 10.1111/j.1540-5915.1977.tb01074.x;
Glover, F., Genetic algorithms and scatter search: Unsuspected potentials (1994)
Statistics and Computing, 4, pp. 131-140., 10.1007/BF00175357;
Glover, F., Tabu search for nonlinear and parametric optimization (with links to
genetic algorithms) (1994) Discrete Applied Mathematics, 49, pp. 231-255.,
10.1016/0166-218X(94)90211-9;
Glover, F., Scatter search and start-paths: Beyond the genetic metaphor (1995) OR
Spectrum, 17, pp. 125-137., 10.1007/BF01719256;
Glover, F., Genetic algorithms, evolutionary algorithms and scatter search:
Changing tides and untapped potentials (1998) INFORMS Computer Science Technical
Section Newsletter, 19 (1), pp. 7-14;
Glover, F., A template for scatter search and path relinking (1998) Artificial
Evolution. Lecture Notes in Computer Science, 1363, pp. 13-54., Hao, J.-K.; Lutton,
E.; Ronald, E.; Schoenauer, M.; & Snyers, D. (Eds.) Springer;
Glover, F., Laguna, M., Marti, R., Scatter Search (2000) Theory and Application of
Evolutionary Computation: Recent Trends, , A. Ghosh S. Tsutsui (eds). Springer
Berlin;
Groover, M.P., (2001) Automation, Production Systems and Computer-integrated
Manufacturing, , Prentice-Hall Co New Delhi;
Hwang, C.L., Lin, M.L., (1987) Group Decision Making under Multiple Criteria, ,
Springer New York 10.1007/978-3-642-61580-1;
pp. 423-431., 10.1016/0360-8352(96)00011-3;
10.1080/00207540410001704078;
Laguna, M., Marti, R., (2003) Scatter Search: Methodology and Implementations in C,
, Boston, MA Kluwer Academic Publishers 10.1007/978-1-4615-0337-8;
Liang, M., Taboun, S.M., Converting functional manufacturing systems into focused
machine cells - A bi-criterion approach (1995) International Journal of Production
Research, 33, pp. 2147-2161., 10.1080/00207549508904808;
Mansouri, S.A., Moattar-Husseini, S.M., Newman, S.T., A review of the modern
Research, 38 (5), pp. 1201-1218., 10.1080/002075400189095;
(2003) Production Planning & Control, 14 (5), pp. 437-446.,
10.1080/09537280310001597334;
Marti, R., Scatter search-wellsprings and challenges (2006) European Journal of
Operational Research, 169, pp. 351-358., 10.1016/j.ejor.2004.08.003;
Journal of Operational Research, 169, pp. 359-372., 10.1016/j.ejor.2004.08.004;
Journal of Operational Research, 185 (2), pp. 563-592., 10.1016/j.ejor.2006.12.058;
problem (1991) Journal of Operations Management, 10, pp. 28-43., 10.1016/0272-
6963(91)90034-U;
707-720., 10.1080/002075499191742;
Computation, 170 (2), pp. 761-780., 10.1016/j.amc.2004.12.021;
Tavakkoli-Moghaddam, R., Javadian, N., Khorrami, A., Gholipour-Kanani, Y., Design
of a scatter search method for a novel multi-criteria group scheduling problem in a
cellular manufacturing system (2010) Expert Systems with Applications, 37, pp.
2661-2669., 10.1016/j.eswa.2009.08.012;
dynamic cell formation problem with fuzzy parameters (2008) International Journal
of Engineering-Transactions A: Basic, 21 (2), pp. 159-172;
algorithms (2005) Stochastic Algorithms: Foundation and Applications, LNCS, 3777,
pp. 213-227., O. B. Lupanov O. M. Kasim-Zade A. V. Chaskin K. Steinhofel (eds).
Springer Berlin. 10.1007/11571155-18;
Engineering, 22, pp. 469-480., 10.1016/0360-8352(92)90022-C;
pp. 829-853., 10.1080/00207540512331311859
CORRESPONDENCE ADDRESS: Siadat, A.; Arts et Métiers Paris Tech, LCFC, Metz, France;
ISSN: 09565515
CODEN: JIMNE
SOURCE: Scopus
Arkat, J., Farahani, M.H., Ahmadizar, F.

55912953100;36990344200;23974269900;
Multi-objective genetic algorithm for cell formation problem considering cellular
layout and operations scheduling
84862843443&doi=10.1080%2f0951192X.2012.665182&partnerID=40&md5=9996370d694ddad6339
447d97dff8d0d
DOI: 10.1080/0951192X.2012.665182
Sanandaj, 416, Iran
ABSTRACT: Integrated design of cellular manufacturing (CM) systems consist of three
major decisions: cell formation (CF), cellular layout (CL) and planning issues such
as cellular scheduling (CS). This article presents a mathematical model to
concurrently identify the formation of cells, cellular layout and the operations
sequence with the objective of minimising total transportation cost of parts as
well as minimising makespan. A multi-objective genetic algorithm (MOGA) is then
developed to solve the problem. The proposed MOGA exploits a novel evolutionary
process which enables it to efficiently find Pareto optimal solutions.
Computational results show the advantages of the proposed integrated approach and
the superiority of the proposed MOGA over some well-known multi-objective
evolutionary algorithms. © 2012 Copyright Taylor and Francis Group, LLC.
AUTHOR KEYWORDS: cell formation; cellular layout; multi-objective genetic
algorithm; operations scheduling
INDEX KEYWORDS: Cell formation; Cell formation problem; Cellular layout;
Computational results; Evolutionary process; Integrated approach; Integrated
designs; Makespan; Multi objective evolutionary algorithms; Multi-objective genetic
algorithm; Operations scheduling; Pareto optimal solutions; Transportation cost,
Mathematical models; Scheduling; Scheduling algorithms, Cellular manufacturing
REFERENCES: Akturk, M.S., A note on the within-cell layout problem based on
operation sequences (1996) Production Planning and Control, 7 (1), pp. 99-103;
Altiparmak, F., Gen, M., Lin, L., Paksoy, T., A genetic algorithm approach for
multi-objective optimization of supply chain networks (2006) Computers and
Industrial Engineering, 51 (1), pp. 196-215., DOI 10.1016/j.cie.2006.07.011, PII
S0360835206000763, Computational Intelligence and Information Technology:
Applications to Industrial Engineering;
Arkat, J., Hosseinabadi Farahani, M., Hosseini, L., Integrating cell formation with
cellular layout and operations scheduling (2011) International Journal of Advanced
Manufacturing Technology, , doi: 10.1007/s00170-011-3733-4;
Arvindh, B., Irani, A., Cell formation: The need for an integrated solution of
subproblems (1994) International Journal of Production Research, 32 (5), pp. 1197-
1218;
10.1080/00207540500478843, PII 791537541;
Chandrasekharan, M.P., Rajagopalan, R., A multidimensional scaling algorithm for
group layout in cellular manufacturing (1993) International Journal of Production
Economics, 32 (1), pp. 16-65;
Chiang, C.P., Lee, S.D., A genetic-based algorithm with the optimal partition
approach for the cell formation in bi-directional linear flow layout (2004)
Deb, K., A fast and elitist multiobjective genetic algorithm: NSGA-II (2002) IEEE
Franca, P.M., Gupta, J.N.D., Mendes, A.S., Moscato, P., Veltink, K.J., Evolutionary
algorithms for scheduling a flowshop manufacturing cell with sequence dependent
family setups (2005) Computers and Industrial Engineering, 48 (3), pp. 491-506.,
DOI 10.1016/j.cie.2003.11.004, PII S0360835204001986, GroupTechnology/Cellular
Manufacturing;
Giffler, J., Thompson, G.L., Algorithms for solving production scheduling problems
(1960) Operations Research, 8, pp. 487-503;
Gunasekaran, A., An investigation into the application of group technology in
advanced manufacturing systems (1994) International Journal of Computer Integrated
Haimes, Y.Y., Lasdon, L.S., Wismer, D.A., On a bicriterion formulation of the
problems of integrated system identification and system optimization (1971) IEEE
Transactions on Systems, Man and Cybernetics, 1, pp. 296-296;
Hassan, M.D., Layout design in group technology manufacturing (1995) International
Hendizadeh, S.H., Meta-heuristics for scheduling a flowline manufacturing cell with
sequence dependent family setup times (2008) International Journal of Production
Economics, 111 (2), pp. 593-605;
Heragu, S., (1997) Facilities Design, , Boston, MA: PWS Publishing Company;
Jajodia, S., CLASS: Computerized layout solutions using simulated annealing (1992)
Lin, S.W., Ying, K.C., Lee, Z.J., Metaheuristics for scheduling a non-permutation
flowline manufacturing cell with sequence dependent family setup times (2009)
Computers and Operations Research, 36 (4), pp. 1110-1121;
390;
cell formation and layout design in cellular manufacturing system (2008)
Internatinal Journal of Advanced Manufacturing Technology., 39, pp. 943-953;
Mak, K.L., Peng, X.X., Lau, T.L., An ant colony optimization algorithm for
scheduling virtual cellular manufacturing systems (2007) International Journal of
Murata, T., Ishibuchi, H., Tanaka, H., Multi-objective genetic algorithm and its
applications to flowshop scheduling (1996) Computers and Industrial Engineering, 30
(4), pp. 957-968., DOI 10.1016/0360-8352(96)00045-9;
Pinedo, M.L., (2008) Scheduling Theory, Algorithms, and Systems, , 3rd ed.
Heidelberg: Springer;
Reddy, V., Narendran, T.T., Heuristics for scheduling sequence-dependent set-up
jobs in flow line cells (2003) International Journal of Production Research, 41
(1), pp. 193-206;
Salum, L., The cellular manufacturing layout problem (2000) International Journal
of Production Research, 38 (5), pp. 1053-1069., DOI 10.1080/002075400189013;
Sarker, B.R., Yu, J., A two-phase procedure for duplicating bottleneck machines in
a linear layout cellular manufacturing system (1994) International Journal of
Solimanpur, M., Vrat, P., Shankar, R., A heuristic to minimize makespan of cell
scheduling problem (2004) International Journal of Production Economics, 88 (3),
pp. 231-241;
Solimanpur, M., Elmi, A., A tabu search approach for group scheduling in buffer-
constrained flow shop cells (2011) International Journal of Computer Integrated
simulated annealing approach (1993) International Journal of Production Research,
31 (12), pp. 2927-2945;
Tavakkoli-Moghaddam, R., Design of a scatter search method for a novel multi-
criteria group scheduling problem in a cellular manufacturing system (2010) Expert
Urban, T.L., Chiang, W.-C., Russell, R.A., The integrated machine allocation and
layout problem (2000) International Journal of Production Research, 38 (13), pp.
2911-2930., DOI 10.1080/00207540050117369;
Wemmerlov, U., Hyer, N.L., Procedures for the part family, machine group
Management, 6 (2), pp. 125-146;
Wu, X., A genetic algorithm for cellular manufacturing design and layout (2007)
Zhou, G., Gen, M., Genetic algorithm approach on multi-criteria minimum spanning
tree problem (1999) European Journal of Operational Research, 114 (1), pp. 141-152
of Kurdistan, Sanandaj, 416, Iran; email: [email protected]
ISSN: 0951192X
CODEN: ICIME
SOURCE: Scopus
Arkat, J., Naseri, F., Ahmadizar, F.

55912953100;54790058100;23974269900;
A stochastic model for the generalised cell formation problem considering machine
reliability
(2011) International Journal of Computer Integrated Manufacturing, 24 (12), pp.
1095-1102. Cited 13 times.
84857825168&doi=10.1080%2f0951192X.2011.627944&partnerID=40&md5=5235dd67856fcce2eb5
518f5827d395a
DOI: 10.1080/0951192X.2011.627944
Sanandaj, Iran
ABSTRACT: Cell formation (CF) is the most well-known problem in designing cellular
manufacturing systems. In the generalised version of the CF problem, each part has
a number of alternative process plans. Two issues should be addressed in the
generalised cell formation (GCF) problem: selecting the best process plan for each
part and assigning machines to the cells. In addition to the minimisation of
movement costs, the selection of the most reliable process plans is an important
task for the GCF problem. Although the expected value (EV) method is a
straightforward procedure to model stochastic situations, this method has some
serious drawbacks. Therefore, we use chance-constrained programming (CCP) to model
this problem. To demonstrate the advantages of the proposed model, the model is
compared with the traditional GCF model and the EV model through some numerical
examples. The results reveal that the proposed model is superior to the other
alternatives. © 2011 Taylor & Francis.
AUTHOR KEYWORDS: cell formation; cellular manufacturing systems; chance-
constrained programming; machine reliability
INDEX KEYWORDS: Alternative process plans; Cell formation; Cell formation problem;
Chance-constrained programming; Expected values; machine reliability; Numerical
example; Process plan, Cellular manufacturing; Computer programming, Stochastic
models
REFERENCES: Ballakur, A., Steudel, H.J., A within-in cell utilization based
heuristic for designing cellular manufacturing systems (1987) International Journal
of Productions Research, 25, pp. 639-655;
plans (2005) Journal of Intelligent Manufacturing, 16 (1), pp. 53-65., DOI
10.1007/s10845-005-4824-6;
Charnes, A., Cooper, W.W., Chance-constrained programming (1959) Management
Science, 6, pp. 73-79;
Das, K., A comparative study of exponential distribution vs Weibull distribution in
machine reliability analysis in a CMS design (2008) Computers and Industrial
S0360835207001210;
S0925527306001137;
of Production Economics, 74 (1-3), pp. 175-182., DOI 10.1016/S0925-5273(01)00124-4,
PII S0925527301001244;
Jeon, G., Leep, H.R., Parsaei, H.R., A cellular manufacturing system based on new
(1998) Computers and Industrial Engineering, 34 (1), pp. 21-36., PII
S0360835297001484;
Li, P., Arellano-Garcia, H., Wozny, G., Chance constrained programming approach to
process optimization under uncertainty (2008) Computers and Chemical Engineering,
32 (1-2), pp. 25-45., DOI 10.1016/j.compchemeng.2007.05.009, PII S0098135407001366,
Process Systems Engineering: Contributions on the State-of-the-Art Selected
extended Papers from ESCAPE '16/PSE 2006;
Production Economics, 53 (3), pp. 239-256., PII S092552739700100X;
10.1080/09511920600596821, PII 780858702;
Saad, S.M., Baykasoglu, A., Gindy, N.N.Z., A new integrated system for loading and
scheduling in cellular manufacturing (2002) International Journal of Computer
Integrated Manufacturing, 15 (1), pp. 37-49., DOI 10.1080/09511920110035012;
Safaei, N., Moghaddam, T.R., An extended fuzzy parametric programming-based
(6), pp. 538-548;
Seifoddini, H., Djassemi, M., The effect of reliability consideration on the
application of quality index (2001) Computers and Industrial Engineering, 40 (1-2),
pp. 65-77., DOI 10.1016/S0360-8352(00)00072-3, PII S0360835200000723;
Vin, E., Delchambre, A., Francq, P., A generalized cell formation problem solved by
an adapted GGA (2010) Proceedings of 8th International Conference of Modeling and
Simulation, , 10-12 May, Hammamet, Tunisia;
Wu, T.H., Yeh, J.Y., Chang, C.C., Chang, a hybrid Tabu search algorithm to cell
formation problem and its variants (2009) World Academy of Science, Engineering and
S0925527305000496;
pp. 159-165., DOI 10.1007/s00170-004-2143-2;
Transactions on Robotics and Automation, 13 (2), pp. 161-168., PII
S1042296X97010392
of Kurdistan, Sanandaj, Iran; email: [email protected]
ISSN: 0951192X
CODEN: ICIME
SOURCE: Scopus

24767107500;7406642484;
The evolution of cell formation problem methodologies based on recent studies
(1997-2008): Review and directions for future research
times.
77951122395&doi=10.1016%2fj.ejor.2009.10.020&partnerID=40&md5=65d93bb2cd3c8550bb873
cb4860d4188
DOI: 10.1016/j.ejor.2009.10.020
AFFILIATIONS: The Business School, Loughborough University, Loughborough, LE11 3TU,
United Kingdom;
School of Management and Business, Aberystwyth University, Aberystwyth, SY23 3DD
Wales, United Kingdom
ABSTRACT: This paper presents a literature review of the cell formation (CF)
problem concentrating on formulations proposed in the last decade. It refers to a
number of solution approaches that have been employed for CF such as mathematical
programming, heuristic and metaheuristic methodologies and artificial intelligence
strategies. A comparison and evaluation of all methodologies is attempted and some
shortcomings are highlighted. Finally, suggestions for future research are proposed
useful for CF researchers. © 2009 Elsevier B.V. All rights reserved.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing systems; Group
technology
systems; Literature reviews; Metaheuristic; Solution approach, Artificial
intelligence; Group technology; Mathematical programming; Research, Cellular
manufacturing
REFERENCES: Aljaber, N., Baek, W., Chen, C.L., A tabu search approach to the cell
formation problem (1997) Computers and Industrial Engineering, 32 (1), pp. 169-185;
Andrés, C., Lozano, S., A particle swarm optimization algorithm for part-machine
grouping (2006) Robotics and Computer-Integrated Manufacturing, 22, pp. 468-474;
Bajestani, A.M., Rabbani, M., Rahimi-Vahed, A.R., Khoshkhou, G.B., A multi-
cellular manufacturing: a review and future directions (2007) European Journal of
pp. 2097-2116;
cellular layout (2003) Computers and Industrial Engineering, 44, pp. 49-73;
pp. 893-913;
Research, 44 (12), pp. 2421-2444;
Deneubourg, J.L., Aron, S., Goss, S., Pasteels, J.M., The self organising
exploratory pattern of the Argentine ant (1999) Journal of Insect Behaviour, 3, pp.
159-168;
Dorigo, M., Maniezzo, V., Colorni, A., Ant system: optimisation by a colony of
cooperating agents (1996) IEEE Transactions on Systems, Man, and Cybernetics - Part
B, 26 (1), pp. 29-41;
Dorigo, M., Di Caro, G., Sampels, M., Ant algorithms for discrete optimisation
(1999) Artificial Life, 5 (2), pp. 137-172;
Durán, O., Rodriguez, N., Consalter, L.A., A PSO-based clustering algorithm for
manufacturing cell design (2008) Proceedings of the 2008 Workshop on Knowledge
Discovery and Data Mining, , IEEE Computer Society. doi: 10.1109/WKDD.2008.1;
Eglese, R.W., Simulated Annealing: a tool for operational research (1990) European
manufacturing cell creation with machine modification costs (2006) Computers and
Glover, F., Laguna, M., (1997) Tabu Search, , Kluwer Academic Publishers, Norwell,
MA;
formation using a new self-organizing neural network (2002) Computers and
pp. 1259-1273;
University of Michigan, Michigan;
2079;
Jayakrishnan Nair, J.G., Narendran, T.T., CASE: a clustering algorithm for cell
36 (1), pp. 157-179;
Jayakrishnan Nair, J.G., Narendran, T.T., ACCORD: a bicriterion algorithm for cell
formation using ordinal and ratio level data (1999) International Journal of
Flexible Automation and Intelligent Manufacturing, 3, pp. 254-264;
IEEE International Conference on Neural Networks, pp. 12-13., IEEE Service Center,
Perth, Australia;
machine capacities: an ortho-synapse Hopfield neural netowrk approach (1999)
the weighted production - cell formation problem (1996) IIE Transactions, 28, pp.
579-589;
alternative cell locations and material transporters (2003) Journal of the
Lozano, S., Adenso-Díaz, B., Eguia, I., Onieva, L., A one-step tabu search
Society, 50, pp. 509-516;
Lozano, S., Canca, D., Guerrero, F., García, J.M., Machine grouping using sequence-
based similarity coefficients and neural networks (2001) Robotics and Computer
Integrated Manufacturing, 17, pp. 399-404;
Lozano, S., Dobado, D., Larrañeta, J., Onieva, L., Modified fuzzy C-means algorithm
for cellular manufacturing (2002) Fuzzy Sets and Systems, 126, pp. 23-32;
16, pp. 491-497;
1077-1094;
Megala, N., Rajendran, C., An ant colony algorithm for cell-formation in cellular
manufacturing systems (2008) European Journal of Industrial Engineering, 2 (3), pp.
298-335;
329-341;
Ng, S.M., Worst-case analysis of an algorithm for cellular manufacturing (1993)
Papaioannou, G., Wilson, J.M., 2008. Fuzzy extensions to integer programming models
of cell-formation problems in machine scheduling. Annals of Operations Research
(Available online 10.1007/s10479-008-0423-1); Park, S., Suresh, N.C., Performance
of Fuzzy ART neural network and hierarchical clustering for part-machine grouping
based on operation sequences (2003) International Journal of Production Research,
41 (14), pp. 3185-3216;
(4), pp. 508-520;
1001-1009;
review evaluation and directions for future research (1998) Computers and
Singh, N., Design of cellular manufacturing systems: an invited review (1993)
707-720;
Solimanpur, M., Vrat, P., Shankar, R., Feasibility and robustness of transiently
chaotic neural networks applied to the cell formation problem (2004) International
Souilah, A., Simulated annealing for manufacturing systems layout design (1995)
Spiliopoulos, K., Sofianopoulou, S., Designing manufacturing cells: a staged
Research, 41 (11), pp. 2531-2546;
for the manufacturing cells formation system (2008) International Journal of
technology principles (1985) Journal of Operations Management, 5 (2), pp. 151-167;
Susanto, S., Kennedy, R.D., Price, J.W., A new fuzzy-c-means and assignment
type clusters (1999) Production Planning and Control, 10 (4), pp. 375-388;
Talbi, E.-G., A taxonomy of hybrid metaheuristics (2002) Journal of Heuristics, 8,
pp. 541-564;
Tavakkoli-Moghaddam, R., Aryanezhad, M.B., Safaei, N., Vasei, M., Azaron, A.,
Solving a dynamic cell formation problem using metaheuristics (2005) Applied
376;
annealing (2008) Journal of the Operational Research Society, 23, pp. 916-924;
173-181;
Vakharia, A.J., Chang, Y.-L., Cell formation in group technology: a combinatorial
2025-2043;
(1), pp. 84-97;
organizing map networks in cellular manufacturing system (2006) International
Engineering, 22 (4), pp. 469-480;
Wemmerlov, U., Hyer, N.L., Cell manufacturing in the US industry: a survey of users
implementation experiences and performance improvements (1997) International
Won, Y., Currie, K.R., Fuzzy ART/RRR-RSS: a two-phase neural network algorithm for
part machine grouping in cellular manufacturing (2007) International Journal of
181, pp. 156-167;
152;
Zolfaghari, S., Liang, M., An objective-guided ortho-synapse Hopfield approach to

machine grouping problems (1997) International Journal of Production Research, 35
(10), pp. 2773-2792
CORRESPONDENCE ADDRESS: Papaioannou, G.; The Business School, Loughborough
University, Loughborough, LE11 3TU, United Kingdom; email:
[email protected]
ISSN: 03772217
CODEN: EJORD
DOCUMENT TYPE: Review
SOURCE: Scopus
Liu, C., Yin, Y., Yasuda, K., Lian, J.

55680709700;35739337500;13405856800;35738929400;
A heuristic algorithm for cell formation problems with consideration of multiple
production factors
1201-1213. Cited 30 times.
77349089925&doi=10.1007%2fs00170-009-2170-
0&partnerID=40&md5=ea82c630663c47e3bfb8298f1c73e1da
DOI: 10.1007/s00170-009-2170-0
AFFILIATIONS: School of Management, Xi'An University of Technology, Xi'an 710048,
China;
Mathematical Institute, Tohoku University, Sendai 980-8578, Japan;
Department of Economics and Business Management, Yamagata University, Yamagata 990-
8560, Japan;
School of Management, University of Texas at Dallas, Richardson, TX 75080, United
States;
Graduate School of Economics and Management, Tohoku University, Sendai 980-8576,
Japan
ABSTRACT: For the design of manufacturing cells, numerous mathematical models and
various algorithms have been extensively investigated in the literature. However,
most of the proposed models and algorithms have more or fewer drawbacks on the
issues with real-life situations. In this paper, we propose a mathematical model
that incorporates multiple key real-life production factors simultaneously, namely,
production volume, batch size, alternative process routings and perfect coefficient
of each routing, cell size, unit cost of intercell/intracell movements, and path
coefficient of material flows. Then, to solve this NP-hard model, we develop a
heuristic algorithm with three stages: (1) form the temporary machine group plan
according to the alternative process routings of each part, (2) select the
appropriate process routing of each part with respect to the over-all material
movement cost, and (3) configure the regular manufacturing cells based on the
appropriate process routing. A simple numerical example and an industrial case are
used to test the computational performance of the proposed algorithm. The test
results imply that it is useful for manufacturing cell design in both quality and
speed. © 2009 Springer-Verlag London Limited.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing system; Heuristic
algorithm; Multiple production factors
INDEX KEYWORDS: Alternative process routings; Batch sizes; Cell formation; Cell
formation problem; Cell size; Cellular manufacturing system; Cellular manufacturing
systems; Computational performance; Manufacturing cells; Material Flow; NP-hard;
Numerical example; Process routing; Production volumes; Test results; Three stages;
Unit cost, Computational complexity; Computer integrated manufacturing; Computer
simulation; Flexible manufacturing systems; Heuristic algorithms; Heuristic
methods; Mathematical models, Cellular manufacturing
REFERENCES: Ham, I., Hitomi, K., (1985) Group Technology Applications to Production
Management, , Kluwer-Nijhoff Boston;
Burbidge, J.L., (1979) Group Technology in Engineering Industry, , Mech Eng London;

Implementation and performance improvements (1997) Int J Prod Res, 35, pp. 29-49.,
10.1080/002075497195966;
S0377221705009045;
(4), pp. 508-520;
Wei, J.C., Gaither, N., A capacity constrained multiobjective CF method (1990) J
Manuf Sys, 9, pp. 222-232., 10.1016/0278-6125(90)90053-K;
Review, evaluation and direction for future research (1998) Comput Ind Eng, 34, pp.
3-20., 10.1016/S0360-8352(97)00147-2;
Research, 38 (5), pp. 1201-1218., DOI 10.1080/002075400189095;
S0925527305000496;
S0925527306000995;
advantages, and design techniques (1984) J Oper Manag, 4, pp. 85-97., 10.1016/0272-
6963(84)90025-1;
cell formation techniques (1996) Int J Fact Auto Info Manag, 3, pp. 225-265;
Askin, R.J., Vakharia, A.J., Group technology-cell formation and operation (1990)
Automated Factory Handbook: Technology and Management, pp. 317-366., D.I. Cleland
B. Bidanda (eds). TAB New York;
57;
9, pp. 73-81., 10.1016/0167-188X(85)90012-6;
system (1990) Int J Prod Res, 28, pp. 1247-1269., 10.1080/00207549008942791;
Khan, M., Islam, S., Sarker, B., A similarity coefficient measure and machine-parts
grouping in cellular manufacturing systems (2000) Eng Costs Prod Econ, 38, pp. 699-
720., 0945.90522;
Yasuda, K., Yin, Y., Dissimilarity measure for solving the cell formation problem
in cellular manufacturing (2001) Computers and Industrial Engineering, 39 (1-2),
pp. 1-17., DOI 10.1016/S0360-8352(00)00060-7;
Srinivasan, G., Narendran, T.T., GRAFICS-a nonhierarchical clustering-algorithm for
group technology (1991) Int J Prod Res, 29, pp. 463-478.,
10.1080/00207549108930083;
Chandrasekharan, M.P., Rajagopalan, R., ZODIACan algorithm for concurrent formation
of part families and machine cells (1987) Int J Prod Res, 25, pp. 835-850.,
0623.90030 10.1080/00207548708919880;
sequence data (1998) Int J Prod Res, 36, pp. 157-179., 0943.90513
10.1080/002075498193985;
Nair, G.J., Narendran, T.T., ACCORD: A bi-criterion algorithm for cell formation
using ordinal and ratio-level data (1998) Int J Prod Res, 37, pp. 539-556.,
10.1080/002075499191661;
for solving the cell formation in group technology (1991) J Oper Manag, 10, pp. 44-
72., 10.1016/0272-6963(91)90035-V;
Rajagopalan, R., Batra, J.L., Design of cellular production systems-a graph
theoretic approach (1975) Int J Prod Res, 13, pp. 567-579.,
10.1080/00207547508943029;
Askin, R.G., Cresswell, S.H., Goldberg, J.B., Vakharia, A.J., Hamiltonian path
Int J Prod Res, 29, pp. 1081-1100., 10.1080/00207549108930121;
Mukhopadhyay, S.K., Ramesh Babu, K., Vijai Sai, K.V., Modified Hamiltonian chain: A
graph theoretic approach to group technology (2000) International Journal of
0897.90116 10.1080/00207549408957064;
Ng, S., Worst-case analysis of an algorithm for cellular manufacturing (1993) Euro
J Oper Res, 69, pp. 384-398., 0783.90044 10.1016/0377-2217(93)90023-G;
(1996) Oper Res, 44, pp. 735-744., 0879.90108 10.1287/opre.44.5.735;
cell formation in group technology (1990) Int J Prod Res, 28, pp. 1555-1572.,
0697.90038 10.1080/00207549008942812;
561-569., 10.1080/00207548708919861;
Int J Prod Res, 29, pp. 343-356., 10.1080/00207549108930075;
Int J Prod Res, 26, pp. 1161-1172., 10.1080/00207548808947932;
Co, H.C., Araar, A., Configuring cellular manufacturing systems (1988) Int J Prod
Res, 26, pp. 1511-1522., 10.1080/00207548808947962;
Vakharia, A., Chang, Y., Cell formation in group technology: A combinatorial search
approach (1997) Int J Prod Res, 35, pp. 2025-2043., 0940.90518
10.1080/002075497195056;
Steudel Harold, J., Ballakur Arvind, A dynamic programming based heuristic for
machine grouping in manufacturing cell formation (1987) Computers and Industrial
Engineering, 12 (3), pp. 215-222., DOI 10.1016/0360-8352(87)90015-5;
problem (1991) J Oper Manag, 10, pp. 28-43., 10.1016/0272-6963(91)90034-U;
Venugopal, V., Soft-computing-based approaches to the group technology problem: A
state-of-the-art review (1999) Int J Prod Res, 37, pp. 3335-3357., 0948.90522
10.1080/002075499190310;
cell design (1995) Int J Prod Res, 33, pp. 2739-2755., 0910.90154
10.1080/00207549508904842;
Elmaraghy, H.A., Gu, P., Knowledge-based system for assignment of parts to machines
(1988) Int J Adv Manuf Technol, 3, pp. 33-44., 10.1007/BF02601499;
network approach (1990) Int J Adv Manuf Technol, 5, pp. 278-291.,
10.1007/BF02601537;
Manuf Rev, 4, pp. 293-301;
techniques (1992) J Manuf Syst, 11, pp. 149-159., 10.1016/0278-6125(92)90001-V;
Venugobal, V., Narendran, T.T., Machine-cell formation through neural network
models (1994) Int J Prod Res, 32, pp. 2105-2116., 10.1080/00207549408957061;
Ahmed, P., Moghaddam, T.R., Safaei, N., (2004) A Comparison of Heuristic Methods
for Solving A Cellular Manufacturing Model in A Dynamic Environment, , Working
Paper WP007/04, University of Wolverhampton;
Michigan Press Ann Arbor;
Gupta, Y., Gupta, M., Kumar, A., Sundram, C., Minimizing total inter-cell and
intera-cell moves in cellular manufacturing: A genetic algorithm (1995) Int J
Comput Integr Manuf, 8, pp. 92-101., 10.1080/09511929508944633;
Joines, J., Culberth, C., King, R., Manufacturing cell design: An integer
programming model employing genetic algorithms (1996) IIE Trans, 28, pp. 69-85.,
10.1080/07408179608966253;
Gen, M., Cheng, R., (1997) Genetic Algorithms and Engineering Design, , Wiley New
York;
manufacturing design and layout (2006) Eur J Oper Res, 181, pp. 156-167.,
10.1016/j.ejor.2006.05.035;
2059-2079., DOI 10.1016/j.cor.2005.08.010, PII S0305054805002649;
Glover, F., Tabu search: Part i (1989) ORSA J Comput, 1, pp. 190-206., 0753.90054
1043673;
Glover, F., Tabu search: Part II (1990) ORSA J Comput, 2, pp. 4-32., 0771.90084;
Int J Prod Res, 32, pp. 273-297., 0911.90187 10.1080/00207549408956933;
Lozano, S., Adenso-Diaz, B., Onieva, L., A one-step Tabu search algorithm for
manufacturing cell design (1999) J Oper Res Soc, 50, pp. 509-516., 1054.90539
10.1057/palgrave.jors.2600704;
21-37., DOI 10.1016/S0305-0548(02)00144-2, PII S0305054802001442;
Schaller, J., Tabu search procedures for the cell formation problem with intra-cell
transfer costs as a function of cell size (2005) Computers and Industrial
S0360835205001075;
(1991) Int J Prod Res, 29, pp. 343-356., 10.1080/00207549108930075;
cellular manufacturing environment (1998) Ann Oper Res, 77, pp. 109-128.,
0897.90106 10.1023/A:1018917109580;
501-511., 0940.90539 10.1080/002075497195876;
approach (1997) Int J Prod Res, 35, pp. 84-97;
Wang, T.Y., Wu, K.B., Liu, Y.W., A simulated annealing algorithm for facility
layout problems under variable demand in Cellular Manufacturing Systems (2001)
Computers in Industry, 46 (2), pp. 181-188., DOI 10.1016/S0166-3615(01)00107-5, PII
S0166361501001075;
cell formation with multiple identical machines (2003) Eur J Oper Res, 151, pp.
434-446., 1053.90030 10.1016/S0377-2217(02)00836-6 2014087;
Economics, 76 (3), pp. 219-228., DOI 10.1016/S0925-5273(01)00164-5, PII
S0925527301001645;
(13), pp. 2755-2768., DOI 10.1080/00207540010005060;
materials flow approach based on operation sequences (1990) IIE Trans, 22, pp. 84-
97., 10.1080/07408179008964161;
10.1016/S0360-8352(00)00074-7;
Benders decomposition approach (1998) Eur J Oper Res, 107, pp. 175-192., 0943.90019
10.1016/S0377-2217(97)00256-7;
group technology cell formation (2001) J Manuf Syst, 19, pp. 305-317.,
10.1016/S0278-6125(01)89003-8;
885-906., DOI 10.1080/00207540110101639;
Gupta, T., Design of manufacturing cells for fliexible environment considering
alternative routeing (1993) Int J Prod Res, 31, pp. 1259-1273.,
10.1080/00207549308956790;
cell formation problem (2005) Int J Prod Res, 43, pp. 829-853.,
10.1080/00207540512331311859
CORRESPONDENCE ADDRESS: Liu, C.; Mathematical Institute, Tohoku University, Sendai
980-8578, Japan; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Mehdizadeh, E., Tavakkoli-Moghaddam, R.

23974842600;56491438400;
A fuzzy particle swarm optimization algorithm for a cell formation problem
(2009) 2009 International Fuzzy Systems Association World Congress and 2009
European Society for Fuzzy Logic and Technology Conference, IFSA-EUSFLAT 2009 -
Proceedings, pp. 1768-1772. Cited 3 times.
84871330559&partnerID=40&md5=6156a92ca39d280bcee5aff7d9d88a64
AFFILIATIONS: Faculty of Industrial and Mechanical Engineering, Islamic Azad

University, Qazvin Branch, Iran;
Tehran, Iran
ABSTRACT: Group technology (GT) is a useful way to increase productivity with high
quality in cellular manufacturing systems (CMSs), in which cell formation (CF) is a
key step in the GT philosophy. When boundaries between groups are fuzzy, fuzzy
clustering has been successfully adapted to solve the CF problem; however, it may
result uneven distribution of parts/machines where the problem becomes larger. In
this case, particle swarm optimization (PSO) can be used to tackle such a hard
problem. This paper proposes a hybrid algorithm based on the fuzzy clustering and
particle swarm optimization (FPSO) to solve the given CF problem. We experiment a
number of examples to show the efficiency of the proposed algorithm and find that
our proposed FPSO algorithm is able to obtain good results at reasonable time.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing systems; Fuzzy
clustering; Particle swarm optimization (PSO)
INDEX KEYWORDS: Cell formation; Cell formation problem; Fuzzy particle swarm; Hard
problems; High quality; Hybrid algorithms, Algorithms; Cellular manufacturing;
Fuzzy clustering; Fuzzy logic; Fuzzy systems; Group technology; Offshore oil
fields; Particle swarm optimization (PSO), Problem solving
REFERENCES: Ballakur, A., Steudel, H.J., A within cell utilization based heuristic
for designing cellular manufacturing systems (1987) Int. J. of Prod. Res., 25, pp.
639-655;
problem: A taxonomy and review (2006) Int. J. Prod. Economics, 101, pp. 329-352;
Xu, H., Wang, H.P., Part family formation for GT applications based on fuzzy
mathematics (1989) Int. J. of Prod. Research, 27, pp. 1637-1651;
(1991) Int. J. of Prod. Research, 29, pp. 1475-1487;
Al-Ahmari, A.M.A., A fuzzy analysis approach for part-machine grouping in cellular
manufacturing systems (2002) Integrated Manufacturing System, 13 (7), pp. 489-497;
part family and machine cell formation for GT applications (2006) Int. J. Prod.
Economics, 103, pp. 185-198;
Chen, C.Y., Ye, F., Adaptive hyper-fuzzy partition particle swarm optimization
clustering algorithm (2006) Cybernetics and Systems, 37, pp. 463-479;
cellular manufacturing (2007) Int. J. of Prod. Research, 45, pp. 1049-1062;
(1991) Int. J. Prod. Res., 29, pp. 343-356;
Chen, W., Srivastava, B., Simulated annealing procedures for forming machine cells
in group technology (1994) Eur. J. Oper. Res., 75, pp. 100-111;
Kazerooni, M., Luong, L., Abhary, K., Cell formation using genetic algorithms
(1995) Int. J. of Flexible Autom. Integr Manuf, 3, pp. 283-299;
Brown, E.C., Sumichrast, R.T., A grouping genetic algorithm for the cell formation
Ravichandran, K.S., Chandra, K., Rao, S., Saravanan, R., The role of fuzzy and
genetic algorithms in part family formation and sequence optimization for flexible
manufacturing systems (2002) Int. J. of Adv. Manuf. Technology, 19, pp. 879-888;
Aljaber, N., Baek, W., Chen, C.L., A tabu search approach to the cell formation
problem (1997) Computers and Industrial Eng., 32, pp. 169-185;
Lozano, S., Adenso-Di, B., Eguia, I., Onieva, L., A one-step tabu search algorithm
for manufacturing cell design (1999) J. of Oper. Res. Soc., 50, pp. 509-516;
Islier, A.A., Group technology by an ant system algorithm (2005) Int. J. of Prod.
Research, 43, pp. 913-932;
Zhao, G., Jiang, P., Zheng, M., Zhou, G., Chen, B., Using swarm intelligence
algorithm to solve a part clustering model based on weighted directed graph (2007)
Int. J. of Prod. Res.;
Andres, A., Lozano, S., A particle swarm optimization algorithm for part - Machine
Bezdek, J.C., (1981) Pattern Recognition with Fuzzy Objective Function Algorithms,
p. 32., Plenum Press: New York;
Klir, J.G., Yuan, B., (2003) Fuzzy Sets and Fuzzy Logic, Theory and Applications,
pp. 257-262., Prentice Hall of India;
Kennedy, J., Eberhart, R.C., Particle swarm optimization (1995) Proceedings of IEEE
Int. Conf. on Neural Networks, pp. 1942-1948., Perth, Australia;
Susanto, S., Kennedy, R.D., Price, J.W.H., A new fuzzy-C-means and assignment
type clusters separately (1999) Prod. Planning & Control, 10, pp. 375-388
Engineering, Islamic Azad University, Qazvin BranchIran; email:
[email protected]
ISBN: 9789899507968
ABBREVIATED SOURCE TITLE: Int. Fuzzy Syst. Assoc. World Congr. Eur. Soc. Fuzzy
Logic Technol. Conf., IFSA-EUSFLAT - Proc.
SOURCE: Scopus
Hachicha, W., Masmoudi, F., Haddar, M.

24176685700;13007835700;13806002000;
Design of experiment and correlation analysis for solving cell formation problem
with alternative routings [Plans d'expérience et analyse des corrélations pour la
résolution du problème de formation de cellules avec gammes alternatives]
(2009) Mecanique et Industries, 10 (5), pp. 337-350.
https://www.scopus.com/inward/record.uri?eid=2-s2.0-70449570961&doi=10.1051%2fmeca
%2f2009068&partnerID=40&md5=541c5e7fecfb9c6bc5423455ce3a416d
DOI: 10.1051/meca/2009068
AFFILIATIONS: Unité de Recherche de Mécanique, Modélisation et Production (U2MP),
ÉIcole Nationale d'Ingénieurs de Sfax, B.P.1173, 3038 Sfax, Tunisia;
Institut Supérieur de Gestion Industrielle de Sfax, Tunisia
ABSTRACT: Cell formation (CF) problem involves grouping parts into families and
machines into cells. The CF problem becomes extra complicated if parts are assigned
with alternative routings. In this context, we propose a new two-phase approach.
The first phase is based on Designed of Experiments. The objective is to realize
the best alternative routing for each part in term of CF performance criteria. In
addition, the result goes across and beyond the previous CF procedures by providing
a sensitivity analysis aspect. A new performance criterion which is based on the
percentage of conservation of incidence matrix data is proposed and validated. The
second phase consists in applying CF based on correlation analysis to cluster the
machines and parts. In order to illustrate the two phases of the proposed approach,
two numerical examples are provided. Furthermore, the results of a comparative
study based on multiple performance criteria show that the present approach is
valid. © 2009 AFM EDP Sciences.
AUTHOR KEYWORDS: Alternative routings; Cell formation; Correlation analysis;
Design of experiments; Performance criteria; Sensitivity analysis
INDEX KEYWORDS: Alternative routings; Cell formation; Cell formation problem with
alternative routings; Comparative studies; Correlation analysis; Experiment and
correlations; Incidence matrices; Performance criterion, Cellular manufacturing;
Correlation methods; Design of experiments; Sensitivity analysis, Problem solving
REFERENCES: Burbidge, J., Change to group technology : PProcess organization is
obsolete (1992) Int. J. Production Research, 30, pp. 1209-1219;
Research, 25, pp. 561-569;
Morgan, B., Vollmann, Cellular manufacturing : iits impact on the total factory
(1993) Int. J. Production Research, 31, pp. 2059-2077;
Rajamani, R., Singh, R., Aneja, Y.P., Integrated design of cellular manufacturing
systems in the presence of alternative process plans (1990) Int. J. Production
Research, 28, pp. 1541-1554;
Nagi, R., Harhalakis, G., Proth, J., Multiple routings and capacity considerations
in Group Technology applications (1990) Int. J. Production Research, 28, pp. 2243-
2257;
Joines, J.A., Gulberth, C.T., King, R.E., A genetic algorithm based integer program
for manufacturing design (1995) Proceeding of the International Conference Flexible
on Automatic Integrated Manufacturing, , Stuttgart, Germany;
environment with flexible processing and routing capabilities (1996) Int. J.
Singh, N., Rajamani, D., (1996) Cellular Manufacturing Systems : Design, Planning
and Control, , First edition, Chapman and Hall, ((ed.), New York, USA;
Paris, J.L., Caux, C., Pierreval, H., (2003) Les Approches( evolutionnistes,
Chapitre 12, Trait(e IC2( evaluation des Performances des Systtemes de Production, ,
Hermtes ((ed.), Paris, France;
part grouping and cell layout problems (2005) Robotics and Computer Integrate
Manufacturing;
Adenso-Diaz, B., Lozano, S., Racero, J., Guerrero, F., Machine cell formation in
227-240;
alternative routeing (1993) Int. J. Production Research, 31, pp. 1259-1273;
plans and machine capacity constraints : AA new combined approach (2000) Int. J.
Economics, 64, pp. 279-284;
Vin, E., De Lit, P., Delchambre, A., Une approche int(egŕee pour le problteme de
formation de cellules de production avec des routages alternatives (2003)
Conf(erence Internationale de Mod(elisation et SIMulation (MOSIM'03), , Toulouse,
France;
Gangan, S., Khator, S., Babu, A.J.G., A within-cell utilization based heuristic for
designing cellular manufacturing systems (1987) Computers and Industrial
alternative part process plans (1996) Computers and Industrial Engineering, 30 (3
SPEC. ISS.), pp. 423-431., DOI 10.1016/0360-8352(96)00011-3;
Kazerooni, M., Luong, L.H.S., Abhary, K., A genetic algorithm based cell design
10, pp. 93-107;
Kizil, M., Ozbayrak, M., A tradeoff analysis between process plan selection and
cell formation in cellular manufacturing (2004) Int. J. Advanced Manufacturing and
Arvindh, B., Irani, S.A., Principal components analysis for evaluating the
feasibility of cellular manufacturing without initial-part matrix clustering (1994)
Int. J. Production Research, 32, pp. 1909-1938;
manufacturing cell (2005) Computers and Industrial Engineering, 48 (21), pp. 3-21;
(2008) Int. J. Advanced Manufacturing Technology, 36, pp. 1157-1169;
Hachicha, W., Masmoudi, F., Haddar, M., A correlation analysis approach of cell
formation in cellular manufacturing system with incorporated production data (2006)
Int. J. Manufacturing Research, 1, pp. 332-353;
Pillet, M., (1994) Introduction Aux Plans d'Exṕeriences Par la Ḿethode Taguchi, ,
(edition d'organisation, 2e( edition, Paris, France;
Kelton, W.D., Designing Simulation Experiments (1999) Proceedings of the 1999
Winter Simulation Conference, pp. 33-38;
Stawowy, A., Evolutionary strategy for manufacturing cell design (2006) The
International Journal of Management Science Omega, 34, pp. 1-18;
Hachicha, W., Masmoudi, F., Haddar, M., An improvement of cellular manufacturing
system design using simulation analysis (2007) Int. J. Simulation Modeling, 6, pp.
193-205;
algorithm for cellular manufacturing (1986) Int. J. Production Research, 24, pp.
451-464;
Kumar, K.R., Chandrasekharan, M.P., Grouping efficacy : AA quantitative criterion
Int. J. Production Research, 28, pp. 233-243;
process routes by genetic algorithm (2002) Int. J. Production Economics, 76, pp.
219-228;
routing in Group Technology manufacturing system (1990) Engineering Optimization,
16, pp. 235-245;
Logendran, R., Ramakrishna, P., Striskandarajah, C., Tabu search-based heuristics
329-341
CORRESPONDENCE ADDRESS: Hachicha, W.; Unité de Recherche de Mécanique, Modélisation
et Production (U2MP), ÉIcole Nationale d'Ingénieurs de Sfax, B.P.1173, 3038 Sfax,
Tunisia; email: [email protected]
ISSN: 12962139
LANGUAGE OF ORIGINAL DOCUMENT: French
ABBREVIATED SOURCE TITLE: Mec. Ind.
SOURCE: Scopus
Liu, C., Yasuda, K., Yin, Y., Tanaka, K.

55680709700;13405856800;35739337500;36083508500;
Uncertain association rule mining algorithm for the cell formation problem in
cellular manufacturing systems
times.
56749182303&doi=10.1080%2f00207540701501849&partnerID=40&md5=ccfaccc75a0e0a5af15988
3ccc3184b3
DOI: 10.1080/00207540701501849
AFFILIATIONS: Mathematical Institute, Tohoku University, Sendai, 980-8578, Japan;
Graduate School of Economics and Management, Tohoku University, Sendai, 980-8576,
Japan;
Department of Economics and Business Management, Yamagata University, Yamagata,
990-8560, Japan
ABSTRACT: Although data mining has enjoyed popularity in recent years with advances
in both academia and industry, the application of data mining to cellular
manufacturing, one of the most powerful management innovations in job-shop or
batch-type production, is still under-utilized. Based on association rule mining,
Chen initially developed a cell formation approach. One problem of such a cell
formation algorithm is that various real-life production factors were ignored. In
this paper we propose a new cell formation algorithm by way of uncertain
association rule mining. The proposed algorithm incorporates several key production
factors, such as operation sequence, production volume, batch size, alternative
process routings, cell size, the number of cells, and the path coefficient of
material flow. The efficacy and efficiency of the proposed algorithm were tested
using several numerical problems.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Data mining; Uncertain
association rule mining
INDEX KEYWORDS: Algorithms; Association rules; Associative processing; Cells;
Cytology; Data mining; Decision support systems; Information management; Knowledge
management; Mining, Alternative process routings; Association rule minings; Batch
sizes; Cell formation; Cell formation algorithms; Cell formation problems; Cell
formations; Cell sizes; Cellular Manufacturing systems; Management innovations;
Material flows; Numerical problems; Operation sequences; Production volumes;
Uncertain association rule mining, Cellular manufacturing
REFERENCES: Agrawal, R., Imielinski, T., Swami, A., Mining association rules
between sets of items in massive database (1993) ACM/SIGMOD International
Conference on Management of Data, pp. 207-216., Washington, DC, USA, 26-28 May;
Albadawi, Z., Bashir, H., Chen, M., A mathmatical approach for the formation of
manufacturing cells (2005) Comput. Ind. Engng, 48, pp. 3-21;
Bayardo Jr, R., Agrawal, R., Mining the most interesting rules (1999) 5th ACM
SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 145-
154., San Diego, CA, USA, 15-18 August;
Bollinger, T., Data mining: The next generation (2005) Dagstuhl Seminar Proceedings
Report, pp. 2738-2743;
Cai, C., Fu, W., Cheng, C., Kwong, W., Mining association rules with weighted items
(1998) International Database Engineering and Applications Symposium, pp. 68-77.,
Cardiff, UK, 8-10 July;
Chen, M., Configuration of cellular manufacturing systems using association rule
induction (2003) Int. J. Prod. Res, 41, pp. 381-395;
Chen, M., Han, J., Yu, P., Data mining. An overview from database perspective
(1996) IEEE Trans. Knowl. Data Engng, 8, pp. 866-883;
Chen, M., Wu, H., Data mining for the analysis of cellular manufacturing systems
(2002) International Conference on Management Sciences, , Taiwan, China;
Chu, C., Tsai, M., A comparison of three array-based clustering techniques for
manufacturing cell formation (1990) Int. J. Prod. Res, 28, pp. 1417-1433;
Dempster, A., Upper and lower probabilities induced by a multi-valued mapping
(1967) Ann. Math. Stat, 38, pp. 325-339;
Fayyad, U., Piatetsky-Shapiro, G., Smyth, P., The KDD process for extracting useful
knowledge from volumes of data (1996) Commun. ACM, 39, pp. 27-34;
Garey, M., Johnson, D., Stockmeyer, L., Some simplified NP-complete graph problems
(1976) Theor. Comput. Sci, 1, pp. 237-267;
alternative routings (1993) Int. J. Prod. Res, 31, pp. 1259-1273;
formation for group technology applications (1990) Int. J. Prod. Res, 28, pp. 185-
198;
Klir, G.J., Measures of uncertainty in Dempster-Shafer theory of evidence (1994)
Advances in the Dempster-Shafer Theory of Evidence, pp. 35-49., edited by R.R.
Yager, J. Kacprzyk and M. Fedrizzi, pp, Wiley: New York;
Klir, G.J., Uncertainty and information measures for imprecise probabilities: An
overview (1999) 1st International Symposium on Imprecise Probabilities and Their
Applications, , Ghent, Belgium, 29 June-2 July;
Kusiak, A., The generalized group technology concept (1987) Int. J. Prod. Res, 25,
pp. 561-569;
Liu, B., Hsu, W., Chen, S., Ma, Y., Analyzing subjective interestingness of
association rules (2000) IEEE Intell. Syst, 15, pp. 47-55;
Schuster, A., Wolff, R., Trock, D., A high-performance distributed algorithm for
mining association rules (2005) Knowl. Inf. Syst, 7, pp. 458-475;
Shafer, G., (1976) A Mathematical Theory of Evidence, , Princeton University Press:
Princeton, NJ;
Shyu, M., Haruechaiyasak, C., Chen, S., Premaratne, K., Mining association rules
with uncertain item relationships (1998) Comput. Ind. Engng, 34, pp. 3-20;
Shyu, M., Chen, S., Kashyap, R., Discovering relationships from database systems
(1999) 8th ACM International Conference on Information and Knowledge Management,
pp. 102-108., Kansas, Missouri, 2-6 November;
Shyu, M., Chen, S., Kashyap, R., Generalized affinity-based association rule mining
for multimedia database queries (2001) Knowl. Inf. Syst, 3, pp. 319-337;
Srikant, R., Agrawal, R., Mining generalized association rules (1995) 21st
International Conference on Very Large Data Bases, pp. 407-419., Zurich,
Switzerland, 11-15 September;
Vakharia, A., Wemmerlov, U., Designing a cellular manufacturing system: A materials
flow approach based on operation sequences (1990) IIE Trans, 22, pp. 84-97;
Wu, N., Salvendy, G., (1996) Knowledge Discovery and Data Mining, , MIT Press:
Cambridge, MA;
production factors (2002) Int. J. Prod. Res, 40, pp. 885-906;
flows (2005) Int. J. Adv. Mfg Technol, 27, pp. 159-165;
Zadeh, L.A., Fuzzy sets as a basis for a theory of possibility (1978) Fuzzy Sets
Syst, 1, pp. 3-28
CORRESPONDENCE ADDRESS: Liu, C.; Mathematical Institute, Tohoku University, Sendai,
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Tursel, D., Levent, K.

23977013400;23976041400;
A decision support system for the cell formation problem
367. Cited 7 times.
40749098440&doi=10.1504%2fIJISE.2008.017424&partnerID=40&md5=39c7d6558f0330bb4da3d5
47cf25a820
DOI: 10.1504/IJISE.2008.017424
AFFILIATIONS: Department of Business Administration, Izmir University of Economics,
Sakarya Cad. No:156, Izmir 35330, Turkey;
Department of Industrial Engineering, Middle East Technical University, Ankara
06531, Turkey
ABSTRACT: This paper describes a study involving the development of a Decision
Support System (DSS) for the part/machine Cell Formation (CF) problem of cellular
manufacturing, to be used as a research oriented as well as operational cell design
tool. An overview of the CF problem is presented, followed by the description of
efficiency measures and construction algorithms selected from the literature for
creation and evaluation of alternative solutions. New modified efficiency measures
and a Composite Measure (CM) are proposed and employed in the DSS for more
comprehensive comparisons. Improvement heuristics are developed for modifying and
enhancing the solutions formed by the construction algorithms. DSS users are
enabled to switch among solutions or algorithms for determining the best cell
configuration for their particular needs. Copyright © 2008, Inderscience
Publishers.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing; Decision Support
System; DSS
INDEX KEYWORDS: Cellular manufacturing; Heuristic algorithms; Product design, Cell
design; Cell formation; Construction algorithm, Decision support systems
REFERENCES: Burbidge, J.L., Production flow analysis (1971) The Production
Engineer, 50 (4-5), pp. 139-152;
Car, Z., Mikae, T., Evolutionary approach for solving cell-formation problem in
cell manufacturing (2006) Advanced Engineering Informatics, 20 (3), pp. 227-232;
Research, 24 (2), pp. 451-464;
Research, 24 (5), pp. 1221-1233;
formations of part families and machine cells (1987) International Journal of
Hsu, C.P., (1990) Similarity coefficient approaches to machine-component cell
formation in cellular manufacturing: A comparative study, , PhD Thesis, University
of Wisconsin, Milwaukee;
2429;
Kandiller, L., A combinatorial optimization tour in cell formation via hypergraphs
(1997) Group Technology and Cellular Manufacturing: Methodologies and Applications,
1., L. Logendran and A.K. Kamrani Eds, Philadelphia: Gordon and Breach;
Luong, L., He, J., Abhary, K., Qiu, L., A Decision Support System for cellular
manufacturing design (2002) Computers and Industrial Engineering, 42 (2-4), pp.
457-470;
Operations Management, 10 (1), pp. 44-72;
1019;
Rao, R.V., Machine group selection in a flexible manufacturing cell using digraph
and matrix methods (2006) International Journal of Industrial and Systems
new weighted grouping efficiency measure (2001) HE Transactions, 33 (1), pp. 11-27;
Sarker, B.R., Li, Z., Measuring matrix-based cell formation considering alternative
routings (1998) Journal of Operational Research Society, 49 (9), pp. 953-965;
Shafer, S.M., Meredith, J.R., Marsh, R.F., A taxonomy for alternative equipment
groupings in batch environments (1995) OMEGA, 23 (4), pp. 361-376;
Shargal, M., Shekar, S., Irani, S.A., Evaluation of search algorithms and
clustering efficiency measures for machine-part matrix clustering (1995) HE
Economics, 101 (2), pp. 329-352
CORRESPONDENCE ADDRESS: Eliiyi, D.T.; Department of Business Administration, Izmir
University of Economics, Sakarya Cad. No:156, Izmir 35330, Turkey; email:
[email protected]
ISSN: 17485037
SOURCE: Scopus
Saidi-Mehrabad, M., Safaei, N., Tavakkoli-Moghaddam, R.

18435197300;8886880300;56491438400;
A fuzzy parametric programming for cell formation problem in uncertainty and
dynamic conditions
(2006) 36th International Conference on Computers and Industrial Engineering, ICC
and IE 2006, pp. 2703-2713.
84886880913&partnerID=40&md5=8a22ac05e8b5d2bc022a2c712e209e02

P.O. Box: 11365, 4563, Tehran, Iran
ABSTRACT: This paper presents a fuzzy parametric programming approach for solving a
mixed-integer model of cell formation with uncertain demand and machine capacity
under a multi-period planning horizon. In dynamic condition, a multi-period
planning horizon is considered in which product mix and demand in each period are
different such as seasonal product demand. As a result, the best cells designed for
one period may not be efficient cells for subsequent periods and some of
reconfigurations required. Furthermore, some of parameters are actually imprecise
and uncertain that can be estimated by experts' knowledge in a fuzzy environment.
The purpose of fuzzy parametric programming is to find and optimal compromise "in-
between" as a function of degrees of imprecision in parameters. The proposed model
is capable to express vagueness of part demand and machine capacity and gives the
decision-maker alternative decision plans for different grads of precision. The
advantages of proposed model are considering the machine
variable/constant/relocation costs, machine duplication, inter cell material
handling, operation sequence and alternative process plans. Constraints are cell
size and machine capacity. To illustrate the behavior of the proposed model, an
example with fuzzy extension generated and computational results presented.
AUTHOR KEYWORDS: Dynamic cell formation; Fuzzy parametric programming; Uncertain
condition
INDEX KEYWORDS: Alternative process plans; Cell formation problem; Computational
results; Dynamic cell formation; Fuzzy parametric programming; Mixed-integer
modeling; Operation sequences; Uncertain condition, Cells; Cellular manufacturing;
Cytology; Industrial engineering; Uncertainty analysis, Integer programming
REFERENCES: Triantaphyllou, Arieh, B.D., Quantifying data for group technology with
weighted fuzzy features (1992) International Journal of Production Research, 30
(6), pp. 1285-1299;
pp. 516-530;
Gill, A., Bector, C.R., A fuzzy linguistic approach to data quantification and
construction of distance measures for part family formation problem (1997)
Gungor, Z., Arikan, F., Application of fuzyy decision making in part machine
grouping (2000) International Journal of Production Economics, 63, pp. 181-193;
formation for group technology applications (1990) Int. J. of Production Research,
28, pp. 185-198;
Masnata, A., Settineri, I., An application of fuzzy clustering to cellular
1077-1094;
pp. 2545-2563;
flexible cellular manufacturing (1996) Int. J. of Production Planning and Control,
7 (6), pp. 585-593;
Tsai, C.C., Chu, C.H., Barta, T.A., Modeling and analysis of a manufacturing cell
formation problem with fuzzy mixed integer programming (1997) IIE Transactions, 29,
pp. 533-547;
dynamic cell formation problem using meta-heuristics (2005) Applied Mathematics and
Computation, 170 (2), pp. 761-780;
Tavakkoli, M.R., Safaei, N., Babakhani, M., Solving a dynamic cell formation
problem with machine cost and alternative process plan by memetic algorithms (2005)
Lecture Notes in Computer Science, 3777, pp. 213-227., O. B. Lupanov, O.M. Kasim-
Zade, Chaskin A.V. and . Steinhofel K. (eds.), Springer, Berlin;
Kaku, B.K., Vakharia, A.J., Redesigning a cellular manufacturing system to handle
24 (5), pp. 909-929;
Chou, C., Chang, D., Wilhelm, W., Integrating design and planning considerations in
cell formation (1998) Annals of Operations Research, 77 (1), pp. 97-107;
Zang, C., Wang, H.P., Concurrent formation of part family and machine cells based
on fuzzy set theory (1992) Journal of Manufacturing Systems, 11, pp. 61-67
CORRESPONDENCE ADDRESS: Saidi-Mehrabad, M.; Department of Industrial Engineering,
Iran University of Science and Technology, Tehran, Iran; email: [email protected]

ABBREVIATED SOURCE TITLE: Int. Conf. Comput. Ind. Eng., ICC IE
SOURCE: Scopus
Suresh, N.C., Slomp, J.

7004424841;6603677460;
A multi-objective procedure for labour assignments and grouping in capacitated cell
formation problems
36 times.
0035895116&doi=10.1080%2f00207540110072966&partnerID=40&md5=4fe3f1012517665cb873061
e5f4361a5
DOI: 10.1080/00207540110072966
AFFILIATIONS: School of Management, State University of New York, Buffalo, NY
14260-4000, United States;
Faculty of Management and Organization, University of Groningen, PO Box 800, 9700
AV Groningen, Netherlands
ABSTRACT: A hierarchical methodology for the design of manufacturing cells is
proposed, which includes labour-grouping considerations in addition to part-machine
grouping. It is empirically driven and designed for an interactive decision
environment, with an emphasis on fast execution times. The method synthesizes the
capabilities of neural network methods for rapid clustering of large part-machine
data sets, with multi-objective optimization capabilities of mathematical
programming. The procedure includes three phases. In Phase I, part families and
associated machine types are identified through neural network methods. Phase II
involves a prioritization of part families identified, along with adjustments to
certain load-related parameters. Phase III involves interactive goal programming
for regrouping machines and labour into cells. In machine grouping, factors such as
capacity constraints, cell size restrictions, minimization of load imbalances,
minimization of intercell movements of parts, minimization of new machines to be
purchased, provision of flexibility, etc. are considered. In labour grouping, the
functionally specialized labour pools are partitioned and regrouped into cells.
Factors such as minimization of hiring and cross-training costs, ensuring balanced
loads for workers, minimization of intercell movements of workers, providing
adequate levels of labour flexibility, etc. are considered in a pragmatic manner.
INDEX KEYWORDS: Cost effectiveness; Fuzzy sets; Genetic algorithms; Machinery;
Neural networks; Optimization; Personnel selection; Personnel training, Capacitated
cell formation problem; Labour assignments; Labour grouping; Multi-objective
procedure, Cellular manufacturing
REFERENCES: Ahmed, M.U., Ahmed, N.U., Nandkeolyar, U., A volume and material
handling cost based heuristic for designing cellular manufacturing cells (1991)
Journal of Operations Management, 10, pp. 488-511;
Research, 28, pp. 1555-1572;
Askin, R.G., Subramaniam, S.P., A cost-based heuristic for group technology
Burbidge, J.L., (1963) Production Flow Analysis. Production Engineer, pp. 742-752.,
December;
Burbidge, J.L., (1989) Production Flow Analysis, , (Oxford, UK: Clarendon);
Chakravarty, A.K., Shtub, A., An integrated layout for group technology with in-
process inventory cost (1984) International Journal of Production Research, 22, pp.
431-442;
Chu, C.H., Clustering analysis in manufacturing cell formation (1989) OMEGA:
Dagli, C., Sen, C.F., ART1 neural network approach to large scale group technology
problems (1992) Robotics and Manufacturing: Recent Trends in Research. Education
and Applications, 4, pp. 787-792., (New York; ASME Press);
Dahel, N.E., Design of cellular manufacturing systems in tandem configuration
De Witte, J., The use of similarity coefficient sin production flow analysis (1980)
Ebeling, A.C., Lee, C.-Y., Cross-training effectiveness and profitability (1994)
Research, 24, pp. 1171-1192;
Frazier, G.V., Gaither, N., Olson, D., A procedure for dealing with multiple
objectives in cell formation decisions (1990) Journal of Operations Management, 9,
pp. 465-480;
systems - an integer programming approach (1989) International Journal of
manufacturing systems - a sequential modeling approach (1989) Computers and
Gunasingh, K.R., Lashkari, R.S., Simultaneous grouping of parts and machines in
cellular manufacturing systems - an integer programming approach (1991) Computers
and Industrial Engineering, 20, pp. 111-117;
Johnson, D., Wemmerlöv, U., On the relative performance of functional and cellular
layouts - an analysis of the model-based comparative studies literature (1996)
Production and Operations Management, 5, pp. 309-334;
Kamal, S., Burke, L.I., FACT: A new neural network-based clustering algorithm for
946;
Kang, S.L., Wemmerlöv, U., A work load-oriented heuristic methodology for
pp. 1353-1367;
Research, 18, pp. 213-232;
(1998) LINGO Optimization Modeling Language (User Manual), , LINDO Systems;
(Chicago, IL: LINDO Systems, Inc.);
51, pp. 53-57;
1009;
and similarity coefficients to the GT machine cell formation problem (1989)
Selvam, R.P., Balasubramanian, K.N., Algorithmic grouping of operation sequences
Saaty, T.L., (1980) The Analytic Hierarchy Process, , (New York: McGraw-Hill);
Schurink, J., Groepsgewijze productie en bouwgroepen (1992), Master's thesis,
Faculty of Mechanical Engineering, University of Twente; Seifoddini, H., Djassemi,
M., Merits of the production volume based similarity coefficient in machine cell
formation (1995) Journal of Manufacturing Systems, 14, pp. 35-44;
Shafer, S.M., Part-machine-labor grouping: The problem and solution methods (1998)
Group Technology and Cellular Manufacturing: State-of-the-Art Synthesis of Research
and Practice, , In N. C. Suresh and J. M. Kay (eds); (Boston, MA: Kluwer);
Shafer, S.M., Charnes, S.M., A simulation analysis of factors influencing loading
practices in cellular manufacturing (1995) International Journal of Production
Research, 33, pp. 279-290;
Research, 31, pp. 1133-1142;
Slomp, J., Design of manufacturing cells: PFA applications in Dutch industry (1998)
Group Technology and Cellular Manufacturing: State-of-the-Art Synthesis of Research
and Practice, , In N. C. Suresh and J. M. Kay (eds); (Boston, MA: Kluwer);
Slomp, J., Molleman, E.B.M., Gaalman, G.J.C., Production and operations management
aspects of cellular manufacturing (1993) Proceedings of International Conferences
on Advances in Production Management Systems (APMS '93), Athens, Greece;
Spronk, J., (1981) Interactive Multiple Goal Programming: Applications to Financial
Planning, , (Boston, MA: Martinus Nijhoff);
Suresh, N.C., Kaparthi, S., The performance of fuzzy ART neural network for group
technology cell formation (1994) International Journal of Production Research, 32,
pp. 1693-1713;
(1998) Group Technology and Cellular Manufacturing: State-of-the-Art Synthesis of
Research and Practice, , Suresh, N. C. and Kay, J. M. (eds); (Boston, MA: Kluwer);
manufacturing systems (1994) Management Science, 40, pp. 466-483;
Suresh, N.C., Slomp, J., Kaparthi, S., The capacitated cell formation problem: A
new hierarchical methodology (1995) International Journal of Production Research,
33, pp. 1761-1784;
Tam, K.Y., An operation sequence based similarity coefficient for part family
formations (1988) Journal of Manufacturing Systems, 9, pp. 55-68;
Treleven, M., A review of the dual resource constrained system research (1989) IIE
Transactions, 21, pp. 279-287;
Vakharia, A.J., Wemmerlöv, U., Designing a cellular manufacturing system: A
materials flow approach based on operations sequences (1990) IIE Transactions, 22,
pp. 84-97;
Venugopal, V., Artificial neural networks and fuzzy models: New tools for part-
machine grouping (1998) Group Technology and Cellular Manufacturing: State-of-the-
Art Synthesis of Research and Practice, , In N. C. Suresh and J. M. Kay (eds);
(Boston, MA: Kluwer);
Wei, J., Gaither, N., An optimal model for cell formation decisions (1990) Decision
Sciences, 21, pp. 416-433;
Wei, J., Gaither, N., A capacity constrained multi-objective cell formation method
(1990) Journal of Manufacturing Systems, 9, pp. 222-232
ISSN: 00207543
SOURCE: Scopus
Joines, Jeffrey A., King, Russell E., Culbreth, C.Thomas

7004005919;7404499815;6602467121;
Moving beyond the parts incidence matrix: Alternative routings and operations for
the cell formation problem
(2000) Journal of Engineering Valuation and Cost Analysis, 2 (5), pp. 327-348.
Cited 1 time.
0033699940&partnerID=40&md5=b8eec744c8ea617ad0503975ad70e891
AFFILIATIONS: North Carolina State Univ, Raleigh, United States

ABSTRACT: A genetic algorithm (GA) utilizing an integer-based representation is
presented to assist in the design of cellular manufacturing (CM) systems. It allows
for a variety of evaluation functions and the selective incorporation/exclusion of
design constraints during cell formation. In this paper, the basic GA model is
extended to consider alternative operations and machine redundancy as well as
completely fixed alternative routes. The approach is demonstrated on data from the
literature and is shown to be an effective cell design tool. An industrial case
study is described where the clustering problem was solved using the genetic search
approach. The resulting cell design has been implemented.
INDEX KEYWORDS: Constraint theory; Genetic algorithms; Matrix algebra, Cell
formation problems; Parts incidence matrix, Cellular manufacturing
CORRESPONDENCE ADDRESS: Joines, Jeffrey A.; North Carolina State Univ, Raleigh,
United States
PUBLISHER: Gordon & Breach Science Publ Inc, Reading, United Kingdom
ISSN: 10249559
CODEN: JEVAF
ABBREVIATED SOURCE TITLE: J Eng Valuation Cost Analys
SOURCE: Scopus
Kitaoka, M., Nakamura, R., Serizawa, S., Usuki, J.

35619740000;57198158150;7004199352;6603907318;
Multivariate analysis model for machine-part cell formation problem in group
technology
(1999) International Journal of Production Economics, 60, pp. 433-438. Cited 15
times.
5273%2898%2900156-X&partnerID=40&md5=f8c2a5e682d884ef5ff27dafc1e65a15
DOI: 10.1016/S0925-5273(98)00156-X
Kanagawa University, Yokohama 221, Japan;
3-27-1, Rokkakubashi, Kanagawa-ku, Yokohama, 221, Japan
ABSTRACT: The principal objective of this article is to formulate a multivariate
analysis model to generate optimal machine cells and part families in GT problems.
The algorithm is carried out in three stages. The double centering matrix for
similarity of machines and parts is used as similarity coefficient matrix. A
quantification method is applied to find the eigenvalues and eigenvectors on the
double centering matrix. Cluster analysis is applied to make part families and
machines groups while minimizing the distance of eigenvectors. A numerical example
for the design of cell structures is provided.
INDEX KEYWORDS: Algorithms; Eigenvalues and eigenfunctions; Flexible manufacturing
systems; Group technology; Machinery; Mathematical models; Matrix algebra;
Statistical methods, Cluster analysis; Machine part cell formation problem; Part
family formation, Cellular manufacturing
REFERENCES: Kumar, C.S., Chandrasekharan, M.P., Grouping efficacy: A quantitative
technology (1990) International Journal Production Research, 28 (2), pp. 233-243;
using rank order clustering algorithm (1980) International Journal Production
Research, 18 (2), pp. 561-569;
Engineer, 51 (2), pp. 53-57;
categorization of analog patterns by an adaptive resonance system (1991) Neural
Network, 5, pp. 493-504
CORRESPONDENCE ADDRESS: Kitaoka, Masatoshi; Kanagawa Univ, Yokohama, Japan
PUBLISHER: Elsevier Science B.V., Amsterdam
ISSN: 09255273
CODEN: IJPCE
SOURCE: Scopus
Aljaber, N., Baek, W., Chen, C.-L.

6507148582;7005596141;7501952022;
A tabu search approach to the cell formation problem
8352%2896%2900208-2&partnerID=40&md5=eac4840e93939d85f16389f25052318d
DOI: 10.1016/S0360-8352(96)00208-2
P.O. Drawer U, Mississippi State, MS 39762, United States
ABSTRACT: The formation of machine cells and part families is a central issue in
the design of cellular production systems In this paper, we propose a tabu search
based approach to deal with this problem by modeling it as a "Shortest Spanning
Path" problem with respect to both parts and machines. A comparison of the proposed
method with some of the existing methods is presented. Our results revealed that
the proposed approach possesses several advantages that make it capable of handling
the problem addressed in this paper as it exists in real-world situations.
Copyright © 1997 Elsevier Science Ltd.
INDEX KEYWORDS: Mathematical models; Optimization; Problem solving; Process
control; Production control, Cell formation problem; Cellular manufacturing; Group
technology (GT); Shortest spanning path problem; Tabu search approach, Flexible
manufacturing systems
REFERENCES: Vakharia, A.J., Methods of cell formation in group technology: A
framework for evaluation (1986) J. Op Mgmt, 6, pp. 257-271;
Lee, H., Garcia, A.D., A network flow approach to solve clustering problems in
Burbidge, J.L., A manual method for production flow analysis (1977) Prod. Engng,
56, pp. 34-38;
cellular manufacture (1982) J. Manufact. Syst., 1, pp. 64-76;
reorganization by clustering techniques (1972) Op. Res., 20, pp. 993-1009;
McAuley, J., Machine grouping for efficient production (1972) Prod. Engng, 51, pp.
53-57;
group technology (1986) IIE Trans., 18, pp. 271-277;
Chen, C.Y., Irani, S.A., Cluster first-sequence last heuristics for generating
block diagonal forms for a machine-part matrix (1993) Int. J. Prod. Res., 31, pp.
2623-2647;
Askin, D.G., Crosswell, S.H., Goldberg, J.H., Vakharia, A.J., A hamiltonian path
Int. J. Prod. Res., 9, pp. 1081-1100;
Chen, W.H., Srivstava, B., Simulataed annealing procedures for forming machine cell
in group technology (1994) Eur. J. Op. Res., 71, pp. 100-111;
(1991) Int. J. Prod. Res., 29, pp. 343-356;
simulated annealing: An experimental evaluation (1992) Eur. J. Op. Res., 63, pp.
409-422;
component grouping problem with multiple objectives (1992) Computers Ind. Engng,
22, pp. 469-480;
splitting and multiple units of the same machine (1993) Int. J. Prod. Res., 31, pp.
657-693;
Glover, F., Tabu search, part I (1989) ORSA J. Computing, 1, pp. 190-206;
Glover, F., Tabu search, part II ORSA J. Computing, 2, pp. 4-32;
Taillard, E., Some efficient heuristic methods for flow shop sequencing problem
(1990) Eur. J. Op. Res., 47, pp. 65-74;
Slagle, J.R., Chang, C.L., Lee, R.C., A clustering and data-reorganizing algorithm
(1975) IEEE Trans. Systems, Man Cybernetics, 5, pp. 126-128;
manufacturing. Part II. An extension and comparison (1993) Int. J. Prod. Res., 31,
pp. 1315-1326;
Glover, F., Greenberg, H.J., New approaches for heuristic search: A bilateral
linkage with artificial intelligence (1989) Eur. J. Op. Res., 39, pp. 119-130;
Glover, F., Taillard, E., De Werra, D., A user's guide to tabu search (1993) Ann.
Ops Res., 41, pp. 3-28;
Wu, N., Coppins, R., (1981) Linear Programming and Extensions, , McGraw-Hill, New
York;
grouping in manufacturing cell formation (1987) Computers Engng, 12, pp. 215-222;
configuration (1987) Int. J. Prod. Res., 25, pp. 101-113;
1035-1052;
Tabucanon, M.T., Ojha, R., ICERMA - A heuristic approach for intercell flow
reduction in cellular manufacturing systems (1987) Mater. Flow, 4, pp. 189-197
CORRESPONDENCE ADDRESS: Aljaber, N.; Department of Industrial Engineering,
Mississippi State University, P.O. Drawer U, Mississippi State, MS 39762, United
States
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Suresh, N.C., Slomp, J., Kaparthi, S.

7004424841;6603677460;6603121687;
The capacitated cell formation problem: A new hierarchical methodology
26 times.
0029323356&doi=10.1080%2f00207549508930241&partnerID=40&md5=4998625b681931880186f08
c916a393f
DOI: 10.1080/00207549508930241
AFFILIATIONS: School of Management, State University of New York, Buffalo, NY,
University of Groningen, P.O. Box 800,9700 AV, Groningen, Netherlands;
Department of Management, University of Northern Iowa, Cedar Falls, IA, 50614,
United States
ABSTRACT: In this paper, a hierarchical methodology for the design of manufacturing
cells is proposed, synthesizing the capabilities of new pattern recognition methods
for rapid clustering of large part-machine data sets, with multi-objective
optimization capabilities of mathematical programming. The procedure includes three
phases. In Phase I, part families and associated machine types are identified
through neural network methods for pattern recognition. Phase II is a cell
formation phase that involves the assignment of part families and individual
machines to create independent cells. It takes into account several factors such as
capacity constraints, cell size restrictions, minimization of load imbalances and
provision of flexibility, Phase III attempts to minimize inter-cell traffic further
for families that may still have to be processed in more than one cell. The
methodology is illustrated using several examples. © 1995 Taylor & Francis Group,
LLC.
INDEX KEYWORDS: Hierarchical systems; Machinery; Neural networks; Optimization;
Pattern recognition; Productivity, Capacitated cell formation problem; Inter cell
traffic, Manufacture
Journal of Operations Management, 10 (4), pp. 488-511;
113;
cell formation in group technology (1990) International Journal Ofproduction
Research, 28 (8), pp. 1555-1572;
Burbidge, J.L., Production flow analysis (1963) Production Engineer, 42, p. 742;
Burbidge, J.L., (1989) Production Flow Analysis, , Oxford: Clarendon Press);
Burke, L.I., Kamal, S., Fuzzy ART cellular manufacturing (1992) ANNIE 92 Conference
Proceedings, pp. 779-784;
Carpenter, G.A., Grossberg, S., A massively parallel architecture for a self-
organizing neural pattern recognition machine (1987) Computer Vision, Graphics and
Image Processing, 37, pp. 54-115;
Chakravarty, A.K., Shtub, A., An integrated layout for group technology with in-
process inventorycosl (1984) International Journal of Production Research, 22, pp.
431-442;
Chu, C.H., Clustering analysis in manufacturing cell formation (1989) OMEGA:
Chu, C.H., Manufacturing cell formation by competitive learning (1993)
Dagli, C., Huggahalli, R., Neural network approach to group technology Knowledge-
Based Systems and Neural Networks, pp. 213-228., New York: Elsevier;
objectives in cell formation decisions (1990) Journal of Operations Management, 9,
pp. 465-480;
Research, 27 (9), pp. 1465-1473;
manufacturing systems-a sequential modelling approach (1989) Computers and
cellular manufacturing systems-an integer programming approach (1991) Computers and
(6), pp. 1353-1367;
algorithm for part-machine grouping technology (1993) European Journal of
(1992) LINGO Optimization Modeling Language (User Manual), , Chicago, Ilinois;
Malave, C.O., Ramachandran, S., A neural network-based design of cellular
manufacturing system (1991) Journal of Intelligent Manufacturing, 2, pp. 305-314;
Moon, Y.B., Forming part families for cellular manufacturing: A neural network
278-291;
Moon, Y.B., Roy, U., Learning group technology part families from solid models by
parallel distributed processing (1992) International Journal of Advanced
Ofproduction Research, 28 (8), pp. 1541-1554;
cellurization: A mathematical programming approach (1992) European Journal of
Shafer, S.M., Rogers, D.F., A goal programming approach to cell formation problem
(1991) Journal of Operations Management, 10 (1), pp. 28-43;
Shafer, S.M., Kern, G.M., Wei, J.C., A mathematical programming approach for
dealing with exceptional elements in cellular manufacturing (1992) International
Slomp, J., Molleman, E., Gaalman, G.J., Production and operations management
aspects of cellular manufacturing (1993) Proceedings and International Conference
on Advances in Production Management Systems, , Athens, Greece;
Suresh, N.C., Partitioning work centres for group technology: Insights from an
analytical model (1991) Decision Sciences, 22 (4), pp. 772-791;
Suresh, N.C., Partitioning work centres for group technology: Analytical extension
and shop-level simulation investigation (1992) Decision Sciences, 23 (2), pp. 267-
290;
Suresh, N.C., Kaparthi, S., The performance of Fuzzy ART neural network for group
(7), pp. 1693-1713;
Venugopal, Y., Narendran, T.T., A neural network approach for designing cellular
manufacturing systems. Advances in Modelling andAnalysis (1992) Amsepress, 32 (2),
pp. 13-26;
Sciences, 21 (2), pp. 416-433;
Wei, J., Gaither, N., A capacity constrained multi-objective cell formation method
Wissink, R., (1990) Vorming En Besturing Van Productie-Units in De Groepswijze
Onderdelen Fabric Age Van B. V. Enraf-Nonius Delft, , M.Sc. thesis, University of
Twente, The Netherlands
CORRESPONDENCE ADDRESS: Suresh, N.C.; School of Management, State University of New
York, Buffalo, NY, 14260, United States
ISSN: 00207543
SOURCE: Scopus
Rath, S.K., Das, C., Sahu, S.

55428272300;56264863400;7202907651;
Network synthesis approach for cell formation problems
0029427679&partnerID=40&md5=585c643fa87c5c4646d2102fbbe265f5
AFFILIATIONS: Regional Engineering Coll, Rourkela, India

ABSTRACT: This paper presents a graph-theoretic approach for solving the cell
formation problem in Cellular Manufacturing. The machine-component incidence matrix
is used to develop the similarly matrix to indicate the degree of similarly between
the machines. Using this matrix, a graph is developed to show the maximum spanning
tree or dominant requirement tree. On application of the network synthesis
procedure on the dominant requirement tree, it is partitioned into subgraphs. These
subgraphs indicate the machine cells.
INDEX KEYWORDS: Inspection; Matrix algebra; Production engineering; Trees
(mathematics); Work simplification, Cellular manufacturing (CM); Group technology
(GT), Flexible manufacturing systems
CORRESPONDENCE ADDRESS: Rath, S.K.; Regional Engineering Coll, Rourkela, India
CODEN: IERCE
SOURCE: Scopus
Durga Rajesh, K.V., Chalapathi, P.V.

57203667069;57208834660;
Application of efficient sfha and tlbo algorithms for cell formation problems in
cellular manufacturing environment
(2019) International Journal of Mechanical and Production Engineering Research and
Development, 9 (3), pp. 43-52. Cited 1 time.
85065903349&doi=10.24247%2fijmperdjun20195&partnerID=40&md5=c849c5875d88b8e2c9896f9
f608b4e12
DOI: 10.24247/ijmperdjun20195
AFFILIATIONS: Department of Mechanical Engineering, Koneru Lakshmaiah Education
Foundation, Vaddeswaram, Andhra Pradesh, India;
MVR College of Engineering and Technology, Paritala, Krishna DistrictAndhra
Pradesh, India
ABSTRACT: Cellular Manufacturing (CM) is a basic Group Technology (GT) application
that has been utilized in a few true modern applications. The issue of cell
arrangement is considered as the principal most critical criteria in the design of
Cellular Manufacturing Systems (CMS), so as to limit lead time and setup time to
amplify productivity and profitability. In this paper, an efficient Sheep Flock
Heredity algorithm (SFHA) and another proficient optimization technique, called
Teaching–Learning-Based Optimization (TLBO) are discussed for the advancement of
cellular manufacturing issues. That simple genetic algorithm SFHA is referred as
multi-level genetic operations, which can obtain good solutions. SFHA algorithm was
generally based on the natural change of sheep in the flock. The procedure of
Teaching Learning Based Optimization is partitioned into two sections: the initial
segment comprises of 'Teacher Phase' and the second part comprises of the 'Learner
Phase'. 'Teacher Phase' implies gaining knowledge from the teacher and 'Learner
Phase' implies learning by the communication among learners. So in this paper, the
main aim is applying SFHA �TLBO algorithms for Cell Formation problems in Cellular
Manufacturing Environment. Graphical User Interface (GUI) is developed for both
SFHA and TLBO algorithms to solve any size of Cell Formation problem within
fraction of seconds to obtain cells with number of Exceptional Elements and
Grouping Efficacy. © TJPRC Pvt. Ltd.
AUTHOR KEYWORDS: Cellular Manufacturing; Exceptional Elements; Group Technology;
Grouping Efficacy
REFERENCES: Nara, K., Takeyama, T., Kim, H., A new evolutionary algorithm based on
sheep flocks heredity model and its application to scheduling problem (1999) IEEE
International Conference on Systems, Man, and Cybernetics, 6, pp. 503-508;
Anandaraman, C., Arunvikram, M.S., Natarajan, R., Evolutionary approaches for
scheduling a flexible manufacturing system with automated guided vehicles and
robots (2012) International Journal of Industrial Engineering Computations, 3, pp.
627-648;
Vijay Chakaravarthy, G., Marimuthu, S., Ponnambalam, S.G., Kanagaraj, G., Improved
sheep flock heredity algorithm and artificial bee colony algorithm for scheduling
m-machine flow shops lot streaming with equal size sub-lot problems (2013)
Vijaychakaravarthy, G., Marimuthu, S., Naveen Sait, A., Comparison of Improved
Sheep Flock Heredity Algorithm and Artificial Bee Colony Algorithm for lot
Streaming in m-Machine Flow Shop Scheduling (2014) Arabian Journal for Science and
Reyya, S., Prameela, M., Yadav, G.V., Rani, K.S., Bhargavi, A.V., An efficient
extension of conditional functional dependencies in distributed databases Database,
5 (6);
Rao, R.V., Savsani, V.J., Vakharia, D.P., Teaching–learning-based optimization: A
novel method for constrained mechanical design optimization problem (2011) Computer
Aided Design, 43 (4), pp. 303-315;
Rao, R.V., Savsani, V.J., (2012) Development and Applications of a New Optimization
Algorithm, pp. 133-194., Chapter from book Springer series in Advanced
Manufacturing;
Xing, B., Gao, W.-J., Innovative Computational Intelligence A Rough Guide to 134
Clever Algorithms (2014) Intelligent Systems Library, p. 62;
Modrak, V., Sudhakara Pandian, R., (2012) Operations Management Research and
Cellular Manufacturing Systems, , Hershey PA: Business Science Reference;
Durga Rajesh, K.V., Chalapathi, P.V., Rao, M.N., Krishna, C.E., Anoop, K., Neeraj,
Y., An Efficient Sheep Flock Heredity Algorithm for the Cell Formation Problem
(2017) ARPN Journal of Engineering and Applied Sciences, 12 (21), pp. 6074-6079;
Prasath, K.A., Johnson, R.D.J., Scrutiny of Machine Assignment in Various Intra-
Cell Layout in Cellular Manufacturing Using Automation Studios;
Durga Rajesh, K.V., Chalapathi, P.V., Anurag Reddy, C., Mahesh Reddy, S., Baba,
M.A., Akhil Reddy, G., Varma, N.S.M., Application of Teaching-Learning Based
Optimization Technique for Cell Formation problems (2017) International Journal of
Pure and Applied Mathematics, 116 (5), pp. 123-128
PUBLISHER: Transstellar Journal Publications and Research Consultancy Private
Limited (TJPRC)
ISSN: 22496890
ABBREVIATED SOURCE TITLE: Int. J. Mech. Prod. Eng. Res. Dev.
SOURCE: Scopus
Joglekar, P., Chung, Q.B., Tavana, M.

6701425768;6602720179;6603702674;
Note on a comparative evaluation of nine well-known algorithms for solving the cell
formation problem in group technology
(2001) Journal of Applied Mathematics and Decision Sciences, 5 (4), pp. 253-268.
Cited 7 times.
4944262173&partnerID=40&md5=db61266d608005a197cf7b907904c2a9
AFFILIATIONS: La Salle University, Philadelphia, PA 19141, United States;

Villanova University, Villanova, PA 19085, United States
ABSTRACT: Over the last three decades, numerous algorithms have been proposed to
solve the work-cell formation problem. For practicing manufacturing managers it
would be nice to know as to which algorithm would be most effective and efficient
for their specific situation. While several studies have attempted to fulfill this
need, most have not resulted in any definitive recommendations and a better
methodology of evaluation of cell formation algorithms is urgently needed. Prima
facie, the methodology underlying Miltenburg and Zhang's (M&Z) (1991) evaluation of
nine well-known cell formation algorithms seems very promising. The primary
performance measure proposed by M&Z effectively captures the objectives of a good
solution to a cell formation problem and is worthy of use in future studies.
Unfortunately, a critical review of M&Z's methodology also reveals certain
important flaws in M&Z's methodology. For example, M&Z may not have duplicated each
algorithm precisely as the developer(s) of that algorithm intended. Second, M&Z's
misrepresent Chandrasekharan and Rajagopalan's [C&R's] (1986) grouping efficiency
measure. Third, M&Z's secondary performance measures lead them to unnecessarily
ambivalent results. Fourth, several of M&Z's empirical conclusions can be
theoretically deduced. It is hoped that future evaluations of cell formation
algorithms will benefit from both the strengths and weaknesses of M&Z's work.
Copyright© 2001, Lawrence Erlbaum Associates, Inc.
AUTHOR KEYWORDS: Cellular Manufacturing; Comparative Analysis; Group Technology;
Performance Measures; Work-Cell Formation Algorithms
REFERENCES: Boe, W.J., Cheng, C.H., A close neighbour algorithm for designing
Vol., 29 (10), pp. 2097-2116;
Burbidge, J.L., Production flow analysis (1963) Production Engineer, 42 (12), pp.
742-752;
Burbidge, J.L., (1975) The Introduction of Group Technology, , New York: Halsyer
Press and John Wiley;
Burbidge, J.L., Production flow analysis for planning group technology (1992)
Research, 24 (2), pp. 451-464;
Fazakerlay, G.M., Group technology: Social benefits and social problems (1974) The
Production Engineer, pp. 383-386., October 1974;
Gallagher, C.C., Knight, W.A., (1986) Group Technology: Production Methods in
Manufacturing, , New York: Halsted Press;
Gupta, T., Clustering algorithms for the design of cellular manufacturing systems -
An analysis of their performance (1991) Computers in Industrial Engineering, 20
(4), pp. 461-468;
Hyer, N.L., The potential of group technology for U.S. manufacturing (1984) Journal
of Operations Management, 4 (3), pp. 183-202;
Hyer, N.L., Wemmerlov, U., Group technology and productivity (1984) Harvard
Business Review, pp. 140-149., July-August 1984;
King, J., Nakoranchai, V., Machine component group formation in group technology:
pp. 117-133;
Kusiak, A., (1990) Intelligent Manufacturing Systems, , Englewood Cliffs, New
Jersey: Prentice Hall;
and similarity coefficients to the gt machine cell formation problem (1989)
Mosier, C., Taube, L., Weighted similarity measure heuristics for group technology
machine clustering problem (1985) Omega, 13 (6), pp. 577-583;
Mosier, C.T., Yelle, J., Walker, G., Survey of similarity coefficient based methods
as applied to the group technology configuration problem (1997) Omega, 25 (1), pp.
65-71;
Ng, S.M., On the characterization and measure of machine cells in group technology
(1996) Operations Research, 44 (5), pp. 735-744;
Offodile, O.F., Machine grouping in cellular manufacturing (1993) Omega, 21 (1),
pp. 35-52;
Pullen, R.D., A survey of cellular manufacturing cells (1976) The Production
Engineer, 55 (9), pp. 451-454;
manufacturing. Part II an extension and comparison (1993) International Journal of
Suresh, N.C., Meredith, J.R., Achieving factory automation through group technology
Tarsuslugil, M., Bloor, J., The use of similarity coefficients and cluster analysis
in production flow analysis (1979) Proceedings of 20th International Machine Tool
Design and Research Conference, pp. 525-532., Birmingham, UK. September;
Vakharia, A.J., Wemmerlov, U., A comparative investigation of hierarchical
clustering techniques and dissimilarity measures applied to cell formation problem
Management, 6 (2), pp. 125-167
CORRESPONDENCE ADDRESS: Chung, Q.B.; Villanova University, Villanova, PA 19085,
United States
ISSN: 11739126
ABBREVIATED SOURCE TITLE: J. Appl. Math. Decis. Sci.
SOURCE: Scopus
Foulds, L.R., French, A.P., Wilson, J.M.

7004519310;7202095053;7406642484;
The sustainable cell formation problem: Manufacturing cell creation with machine
modification costs
27144484897&doi=10.1016%2fj.cor.2004.09.001&partnerID=40&md5=af27beedea221423ef960e
83a8aeccfe
DOI: 10.1016/j.cor.2004.09.001
AFFILIATIONS: Department of Management Systems, University of Waikato, New Zealand;
Business School, Loughborough University, Loughborough LE113TU, United Kingdom

ABSTRACT: An approach for manufacturing cell formation with machine modification is
presented. In cell formation it is often important in practice to be able to
reassign parts to additional machine types in order to create better cell
configurations. This involves extending the set of parts that certain individual
machines can process. Such extensions may be cheaper than simply purchasing
additional machines. Thus, there is the possibility of machine modification to
reduce inter-cell travel. The cost of such modifications must be balanced by the
consequent reduction in inter-cell travel cost. The extended machine cell formation
problem to be described involves the specification of which individual machines
should be modified to enable them to process additional part types, part-machine
assignment, and the grouping of individual machines for cell formation. The
objective is to minimize the sum of the machine modification costs and the inter-
cell travel. We call this the sustainable cell formation problem (SCFP). As far as
the authors are aware, there have not been any solution procedures for this
important problem reported in the open literature. It is our purpose to fill this
gap by presenting a mixed integer programming model of the SCFP. We also propose
and analyze greedy and tabu search heuristics for the design of large-scale systems
related to the SCFP. Computational experience with the solution procedures
indicates that they are likely to be useful additions to the production engineer's
toolkit. © 2004 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Cell formation; Heuristics; Integer programming; Machine
modification costs; Models; Sustainable manufacturing
INDEX KEYWORDS: Costs; Heuristic methods; Integer programming; Machine components;
Mathematical models; Models; Modification; Problem solving, Cell formation;
Heuristics; Machine modification costs; Sustainable manufacturing, Cellular
manufacturing
REFERENCES: Billo, R.E., A design methodology for configuration of manufacturing
cells (1998) Computers & Industrial Engineering, 34, pp. 63-75;
Chu, C.H., Recent advances in mathematical programming for manufacturing cell
formation (1995) Planning, Design and Analysis of Manufacturing Cellular
Manufacturing Systems, pp. 3-46., A.K. Kamrani H.R. Parei D.H. Liles Elsevier
Amsterdam;
Kusiak, A., Heragu, S.S., Group technology (1987) Computers and Industry, 9, pp.
83-91;
Selim, H.M., Askin, R.G., Vakharia, A.J., Manufacturing cell formation in group
technology: Review, evaluation and directions for future research (1998) Computers
& Industrial Engineering, 35, pp. 3-20;
Vakharia, A.J., Methods of manufacturing cell formation in group technology: A
framework for evaluation (1993) Journal of Operations Management, 6, pp. 257-271;
Wemmerlov, U., Hyer, N.L., Research issues in manufacturing cellular manufacturing
Wang, J., A linear assignment algorithm for formation of machine manufacturing
cells and part families in manufacturing cellular manufacturing (1998) Computers
Pierreval, H., Plaquin, M.-F., An evolutionary approach to multicriteria
manufacturing cell formation (1998) International Transaction on Operational
manufacturing cell formation in group technology (1990) International Journal of
Faber, Z., Carter, M.W., A new graph theory approach for forming machine
manufacturing cells in manufacturing cellular production systems (1986) Flexible
Manufacturing Systems: Methods and Studies, pp. 301-315., A. Kusiak Elsevier
Amsterdam;
Garcia-Diaz, A., Lee, H., An industrial application of network-flow models in
manufacturing cellular manufacturing planning (1995) Planning, Design and Analysis
of Manufacturing Cellular Manufacturing Systems, pp. 47-61., A.K. Kamrani H.R.
Parei D.H. Liles Elsevier Amsterdam;
Hadley, S.W., Finding part-machine families using graph partitioning techniques
397;
Kusiak, A., Chow, W.S., Decomposition of manufacturing systems (1988) Journal of
Robotics and Automation, 4, pp. 457-471;
Moussa, S.E., Kamel, M.S., Partitioning techniques for manufacturing cellular
manufacturing (1995) Planning, Design, and Analysis of Manufacturing Cellular
Manufacturing Systems, pp. 73-95., A.K. Kamrani H.R. Pasaei D.H. Liles Elsevier
Amsterdam;
Plaquin, M.-F., Pierreval, H., Manufacturing cell formation using evolutionary
algorithms with certain constraints (2000) International Journal on Production
Neumann, K., (1996) Produktions und Operations Management, , Springer Berlin;
Vannelli, A., Hall, R.G., An eigenvector solution methodology for finding part-
machine families (1993) International Journal of Production Research, 31, pp. 325-
349;
567-579;
Zhou, M., Askin, R.G., Formation of general GT manufacturing cells: An operation-
based approach (1998) Computers & Industrial Engineering, 34, pp. 147-157;
Ahmed, M.U., Ahmed, N.U., Nandkeolyar, U., A volume and material handling cost
based heuristic for designing cellular manufacturing cells (1991) Journal of
Jain, A.K., Kasilingam, R.G., Bhole, S.D., Joint consideration of cell formation
and tool provisioning problems in flexible manufacturing systems (1991) Computers &
Logendran, R., A binary integer programming approach for simultaneous machine-part
grouping in cellular manufacturing systems (1993) Computers & Industrial
Wang, J., Roze, C., Formation of machine cells and part families in cellular
manufacturing: An experimental study (1995) Computers & Industrial Engineering, 29,
pp. 567-571;
formation problem (1995) Computers & Industrial Engineering, 28, pp. 911-916;
Atamani, A., Lashkari, R.S., Caron, R.J., A mathematical programming approach to
joint manufacturing cell formation and operation allocation in cellular
Cao, Q., McKnew, M.A., Partial termination rule of Lagrangian relaxation for
manufacturing cell formation problems (1998) Computers and Operations Research, 25,
pp. 159-168;
pp. 421-426;
Abdelmola, A.I., Taboun, S.M., Merchawi, S., Productivity optimization of cellular
manufacturing systems (1998) Computers & Industrial Engineering, 35, pp. 403-406;
Taboun, S.M., Merchawi, N.S., Ulger, T., A two-stage model for cost effective part
family and machine cell formation (1998) Computers & Industrial Engineering, 34,
pp. 759-776;
Lozano, S., Canca, D., Guerrero, F., García, J.M., Machine grouping using sequence-
based similarity coefficients and neural networks (2001) Robotics and Computer-
Foulds, L.R., Neumann, K., Techniques for machine group formation in manufacturing
cells (2003) Mathematical and Computer Modelling, 38, pp. 623-635;
Burbidge, J.L., The simplification of material flow systems (1982) International
Hyer, N.L., Wemmerlov, U., Group technology in the US manufacturing industry: A
survey of current practices (1989) International Journal of Production Research,
27, pp. 1287-1304;
Grahl, C.L., Increasing efficiencies through machine modifications (2001) Ceramic
Industry, pp. 12-15;
Machining centers/cells (2004) Tooling and Production, 70, pp. 26-33
CORRESPONDENCE ADDRESS: Wilson, J.M.; Business School, Loughborough University,
Loughborough LE113TU, United Kingdom; email: [email protected]
ISSN: 03050548
CODEN: CMORA
SOURCE: Scopus
Miltenburg, J., Zhang, W.

7003817487;37070732600;
A comparative evaluation of nine well-known algorithms for solving the cell
formation problem in group technology
(1991) Journal of Operations Management, 10 (1), pp. 44-72. Cited 127 times.
6963%2891%2990035-V&partnerID=40&md5=809575d9c58b5aa3c0ce09c43f518f55
DOI: 10.1016/0272-6963(91)90035-V
AFFILIATIONS: McMaster University, Hamilton, Ont., Canada
ABSTRACT: Nine algorithms, developed to solve the cell formation problem, are
evaluated and compared for their ability to produce good solutions to large
problems. A primary performance measure and two secondary performance measures are
presented for gauging the quality of a solution to the cell formation problem.
Eight problems from the open literature and 60 randomly generated, large problems
are analyzed. The analysis shows that there is no solution algorithm that performs
better on all performance measures for problems from both the literature and the
randomly generated data sets. One algorithm, called the ISNC algorithm and based on
clustering around seeds, performs significantly better than all other algorithms on
the primary performance measure (and performs well on the secondary measures) for
the randomly generated data set, and performs well for the problems from the
literature. Therefore this algorithm appears to the most appropriate algorithm to
use as a general purpose solution algorithm for CF problems having between 25 and
50 machines, 35 and 50 parts, and densities between 10 and 20%. (It may not be
appropriate for larger problems, since its computational and space requirements
appear to be high.) After the ISNC algorithm, there is no significant difference
between most of the other algorithms. However. different kinds of solutions are
developed by some of these other algorithms. The well-known SC/ROC and ROC/ROC
algorithms develop solutions which consist of a small number of relatively large
cells. The BEA algorithm develops solutions which consist of relatively small cells
(where each machine in the cell is visited by most of the parts assigned to that
cell) and one large cell for those parts not assigned to the small cells. © 1991.
REFERENCES: Anderberg, (1973) Cluster Analysis for Applications, , Academic Press,
New York;
Burbidge, (1975) The Introduction of Group Technology, , John Wiley and Sons, Inc,
London;
Carrie, Numerical Taxonomy Applied to Group Technology and Plant Layout (1973)
International Journal of Operations Research, 11 (4), pp. 399-416;
Chan, Milner, Direct Clustering Algorithm for Group Formation in Cellular
Manufacture (1982) Journal of Manufacturing Systems, 1 (1), pp. 65-75;
Chandrasekharan, Rajagopalan, MODROC: An Extension of Rank Order Clustering for
Group Technology (1986) International Journal of Production Research, 24 (5), pp.
1221-1233;
Chandrasekharan, Rajagopalan, An Ideal Seed Non-Hierarchical Clustering Algorithm
for Cellular Manufacturing (1986) International Journal of Production Research, 24
(2), pp. 451-464;
Gallagher, Grayson, Phillips, A Review of the Development and Application of Group
Technology at the University of Birmingham (1971) International Journal of
Gongaware, Ham, Cluster Analysis Applications for Group Technology Manufacturing
Systems (1981) Proceedings: Ninth North American Metalworking Research
Conference, , Society of Manufacturing Engineers, Dearborn, MI;
Ham, Hitomi, Yoshida, (1985) Group Technology: Applications to Production
Management, , Kluwer-Nijhoff Publishing, Boston;
Hyer, Wemmerlöv, Group Technology and Productivity (1984) Harvard Business Review,
pp. 140-149;
King, Machine-Part Grouping in Production Flow Analysis: An Approach Using a Rank
Order Clustering Algorithm (1980) International Journal of Production Research, 18
(2), pp. 213-237;
King, Nakornchai, Machine Part Group Formation in Group Technology—Review and
Extension (1982) International Journal of Production Research, 20 (2), pp. 117-133;
MacQueen, Some Methods for Classification and Analysis of Multivariate Observations

(1967) Proceedings of the Fifth Symposium on Mathematical Statistics and
Probability, 1, pp. 281-288., University of California-Berkeley, Berkeley, CA;
McAuley, Machine Grouping for Efficient Production (1972) Production Engineer, 51
(2), pp. 53-57;
McCormick, Schweitzer, White, Problem Decomposition and Data Reorganization by a
Clustering Technique (1972) Operations Research, 20, pp. 993-1009;
Montgomery, (1984) Design and Analysis of Experiments, , 2nd ed., John Wiley &
Sons, New York;
Seifoddini, Wolfe, Application of the Similarity Coefficient Method in Group
Suresh, Meredith, Achieving Factory Automation through Group Technology Principles
Wemmerlöv, Hyer, Procedures for the Part Family/Machine Group Identification
Problem in Cellular Manufacturing (1986) Journal of Operations Management, 6 (2),
pp. 125-147;
Wu, Venugopal, Barash, Design of a Cellular Manufacturing Approach: A Syntactic
Pattern Recognition Approach (1986) Journal of Manufacturing Systems, 5, pp. 81-88
CORRESPONDENCE ADDRESS: Miltenburg, J.; McMaster University, Hamilton, Ont., Canada
ISSN: 02726963
CODEN: JOTME
ABBREVIATED SOURCE TITLE: J Oper Manage
SOURCE: Scopus
Seema, Dixit, A.R.
57212712028;35789896200;
Application of soft computing techniques for cell formation problems: A review
(2017) 2017 International Conference on Advances in Mechanical, Industrial,
Automation and Management Systems, AMIAMS 2017 - Proceedings, art. no. 8069219, pp.
245-251.
85039941488&doi=10.1109%2fAMIAMS.2017.8069219&partnerID=40&md5=91556dedcc91096dedaf
57199e12ba40
DOI: 10.1109/AMIAMS.2017.8069219
AFFILIATIONS: Mechanical Engineering Department, Indian Institute of Technology
(ISM), Dhanbad, India
ABSTRACT: The current paper reviewed the relevance of soft computing techniques in
cellular manufacturing layout design. Within this framework, the capability of
important soft computing techniques like genetic algorithm (GA), simulated
annealing (SA), artificial neural network (ANN), tabu search (TS), ant colony
optimization (ACO) is reviewed. These techniques are effectively useful to solve
design tasks and related issues. This paper presents a summary of some important
published research works on the meta-heuristics models for cell formation problem.
From the literature review, it has been found that minimization of inter and
intracellular movement, reduction of setup and throughput times, reduced movement
of material handling and maximization of machine utilization are the primary
objectives of the cellular manufacturing design. © 2017 IEEE.
AUTHOR KEYWORDS: Component; Formatting; Insert (key words); Style; Styling
INDEX KEYWORDS: Ant colony optimization; Artificial intelligence; Genetic
algorithms; Manufacture; Materials handling; Neural networks; Simulated annealing;
Soft computing; Tabu search, Component; Formatting; Insert (key words); Style;
Styling, Cellular manufacturing
REFERENCES: Inman, R., (2006) Cellular Manufacturing, pp. 73-77;
Parashar, N.B.S., Cellular manufacturing systems (2009) An Integrated Approach.
Eastern Economy Edition, pp. 11-12;
Bazargan-Lari, M., Layout designs in cellular manufacturing (1999) EuropeanJournal
Karthikeyan, S., Saravanan, M., Ganesh, K., Group technology cell formation problem
inscheduling for cellular manufacturing system using the meta-heuristic method
(2012) ProcediaEngineering, 38, pp. 2537-2547;
Saghafian, S., Reza, M., Joker, A., Integrative cell formation and layout design
incellular manufacturing systems (2009) Journal of Industrial and Systems
Gallagher, C., Knight, W.A., (1986) Group Technology Production Methods in
Manufacturing, , E. Horwood;
Luong, L., He, J., Abhary, K., Qiu, L., A decision supports system for cellular
manufacturingsystem design (2002) Computers and Industrial Engineering, 42, pp.
457-470;
Sofianopoulou, S., Application of simulated annealing to a linear of linear model
for the formulation of machinecells in group (1997) International Journal of
Production Reasearch, 35, pp. 501-511;
Vishwanath, R., Nagi, R., An integrated formulation of manufacturing cell formation
77, pp. 79-95;
Malakooti, B., Malakooti, N.R., Yang, Z., Process planning and production planning
with application to the emergency room (2004) International Journal of Production
Research, 42 (9), pp. 1769-1786., Integrated Group Technology Cell Formation;
Hicks, C., A genetic algorithm tool for optimizing cellular or functional layouts
in thecapital goods industry (2006) International Journal Production Economics,
104, pp. 598-614;
Uddin, M.K., Shanker, K., Grouping of parts and machines inthe presence
ofalternative process routes by genetic algorithm (2002) International Journal
Mahdavi, I., Paydar, M.M., Solimanpur, M.S., Heidarzade, A., A genetic algorithm
approaches for solving a cell formation problem in cellular manufacturing (2009)
Leno, I.J., Saravanasankar, S., Ponnambalam, S.G., Layoutdesign
fortheefficientmaterial flows path (2012) Procedia Engineering, 38, pp. 872-879;
Hicks, C., A genetic algorithm tool for designing manufacturing facilities in the
capital goods industry (2004) International Journal Production Economics, 90, pp.
199-211;
Chattopadhyay, M., Sengupta, S., Ghosh, T., Dan, P.K., Mazumdan, S., Neuro-genetic
impact on cell formation methods of cellular manufacturing system design: A
quantitative review and analysis (2013) Computers and Industrial Engineering, 64,
pp. 256-272;
manufacturing system (2011) Applied Soft Computing, 11, pp. 4195-4202;
Moon, C., Gen, M., A genetic algorithm-based approach forthedesign of independent
manufacturing cells (1999) International Journal Production Economics, 61, pp. 421-
426;
Erhan Kesen, S., (2010) A Genetic Algorithm Based Heuristic for Scheduling of
Virtual Manufacturing Cells (VMCs) 2010, pp. 54-68;
Boulif, M., Atif, K., A new branch & bound-enhanced genetic algorithm for the
manufacturing cell formation problem (2006) Computers and Operations Research, 33,
pp. 2219-2245;
Tiwari, M.K., Roy, D., Solving a part classification problem using simulated
annealing-likeahybrid algorithm (2003) Robotics and Computer Integrated
Swarnkar, R., Tiwari, M.K., Modeling machine loadingproblem of FMSs and its
solution methodology using a hybrid tabu search and simulated annealing-based
heuristic approach (2004) Robotics and Computer-Integrated Manufacturing, 20, pp.
199-209;
Lin, S.W., Ying, K.C., Lu, C.-C., Gupta, D.J.N., Applying multi-start simulated
annealing to schedule a flowlinemanufacturing cell with sequence dependent family
setup times (2011) International Journal Production Economics, 130, pp. 246-254;
Chu, C.-H., An improved neural network for manufacturing cell formation (1997)
formation using a new self-organizing neural network (2002) Computer and Industrial
Ferreira, M.L., Gil, S.P.J., Application and performance analysis of neural
networks for decision support in conceptual design (2012) Expert Systems with
problem in cellular manufacturing: A Framework using Fuzzy ART (1995) Journal of
Manufacturing Systems, 14 (3);
Choy, K.L., Lee, W.B., Lo, V., The design of an intelligent supplier relationship
management system: A hybrid case-based neural network approach (2003) Expert
Systems with Application, 24, pp. 225-237;
formation using a new self-organizing neural network (2002) Computer and Industrial
Solimanpur, M., Elmi, A., A Tabusearches approach for cell scheduling problem with
makespancriterion (2013) International Journal Production Economics, 141, pp. 639-
645;
Chung, S.H., Wu, T.-H., Chang, C.-C., An efficient tabu search algorithm to the CMP
with alternative routings and machine reliability considerations (2011) Computers
Aljaber, N., Baek, W., Chen, C.-L., A Tabusearches approach for the cell formation
problem (1997) Computers Industrial Engineering, 32, pp. 169-185;
Sun, D., Lin, L., Batta, R., Cell formation using tabu search (1995) Computers
Swarnkar, R., Tiwari, M.K., Modeling machine loading problem of FMSs and its
solution methodology using a hybrid tabu search and simulated annealing-based
heuristic approach (2004) Robotics and Computer-Integrated Manufacturing, 20, pp.
199-209;
Glover, F., Kelly, J.P., Laguna, M., Genetic algorithms and tabu search: Hybrids
for optimization (1995) Computers Operations Researches, 22, pp. 111-134;
Nguema, B.A., Dao, T.-M., Quantized hopfield networks and tabu search for
manufacturing cell formation problems (2009) International Journal Production
Karthikeyan, S., Saravanan, M., Ganesh, K., GT machine cell formation problem in
scheduling for cellular manufacturing system usingthemeta-heuristic method (2012)
Procedia Engineering, 38, pp. 2537-3254;
Schweiger, K., Sahamie, R., A hybrid tabusearches approach for the design of a
paper recycling network (2013) Transportation Research Part e, 50, pp. 98-119;
Saremi, H.Q., Abedin, B., Kermani, A.M., Website structure improvement: Quadratic
assignment problem approach and ant colony meta-heuristic technique (2008) Applied
Patrick, R., Mullen, M., An ant colony optimization approach to addressing a JIT
sequencing problem with multiple objectives (2001) Artificial Intelligence in
inter cell layout problem in cellular manufacturing (2004) European Journal of
Li, X., Baki, M.F., Aneja, Y.P., An ant colony optimization meta-heuristic for
machine part cell formation problems (2010) Computers and Operations Research, 37,
pp. 2071-2081;
Hani, Y., Amodeo, L., Yalaoui, F., Chen, H., Ant colony optimization for solving an
industrial layout problem (2007) European Journal of Operational Research, 183, pp.
633-642;
inter-cell layout problem in cellular manufacturing (2003) IIT, Roorkee, pp. 247-
667;
Ilie, S., Badica, C., Multi-agent approach to distributed ant colony optimization
(2013) Science of Computer Programming, 78, pp. 762-774;
Zhao, N., Wu, Z., Zhao, Y., Quan, T., Ant colony optimization algorithm with
mutation mechanism and its applications (2010) Expert Systems with Applications,
37, pp. 4805-4810
EDITORS: Gupta M., Agarwal P.K.
ISBN: 9781509056743
ABBREVIATED SOURCE TITLE: Int. Conf. Adv. Mech., Ind., Autom. Manag. Syst., AMIAMS
SOURCE: Scopus
Díaz, J.A., Luna, D., Luna, R.
7401603810;36504290300;36504502300;
A GRASP heuristic for the manufacturing cell formation problem
(2012) TOP, 20 (3), pp. 679-706. Cited 21 times.
84866539974&doi=10.1007%2fs11750-010-0159-
3&partnerID=40&md5=60a573f3826084fbe73c5226eee04758
DOI: 10.1007/s11750-010-0159-3
AFFILIATIONS: Dpt. Ingeniería Industrial y Mecánica, Universidad de las Américas,
Puebla, Mexico
ABSTRACT: In this work, we address the Manufacturing Cell Formation Problem (MCFP).
Cellular Manufacturing is a production strategy that has emerged to reduce
materials handling and set up times in order to reduce lead times in production
systems and to improve customer's service levels while reducing costs. We propose a
GRASP heuristic to obtain lower bounds for the optimal solution of the problem. To
evaluate the performance of the proposed method, we test the heuristic with
different instances from the literature and compare the results obtained with those
provided by other heuristic methods from the literature. According to the obtained
results, the proposed GRASP procedure provides good quality lower bounds with
reasonable computational effort. © 2010 Sociedad de Estadística e Investigación
Operativa.
AUTHOR KEYWORDS: Group technology; Manufacturing cell formation; Metaheuristics
REFERENCES: Adenso-Díaz, B., Lozano, S., Eguía, I., Part-machine grouping using
weighted similarity coefficients (2005) Comput Ind Eng, 48, pp. 553-570;
Adil, G.K., Ghosh, J.B., Forming GT cells incrementally using GRASP (2005) Int J
Adv Manuf Technol, 26 (11), pp. 1402-1408;
Askin, R.G., Subramanian, S., A cost based heuristic for group technology
Int J Prod Res, 29 (2), pp. 343-356;
Feo, T.A., Resende, M.G.C., Greedy randomized adaptive search procedures (1995) J
Glob Optim, 6, pp. 109-133;
system (1990) Int J Prod Res, 28 (7), pp. 1247-1269;
grouping in cellular manufacturing systems (2000) Int J Prod Res, 38 (3), pp. 699-
720;
King, J.R., Machine-components grouping in production flow analysis: an approach

Kumar, K.R., Chandrasekhran, M.P., A quantitative criterion for goodness of block
diagonal forms of binary matrices in group technology (1990) Int J Prod Res, 28
(2), pp. 233-234;
561-569;
Manuf Syst, 6 (2), pp. 117-124;
Lee, H., García-Díaz, A., A network flow approach to solve clustering problems in
group technology (1993) Int J Prod Res, 31 (3), pp. 603-612;
57;
and similarity coefficients to the GT machine-cell formation problem (1986) Int J
Prod Res, 27, pp. 1811-1836;
Mosier, C.T., Taube, L., Weigthed similarity measure heuristics for the group
(2001) Eur J Oper Res, 130, pp. 588-611;
Sarker, B.R., Mondal, S., Grouping efficiency measures in cellular manufacturing: a
survey and critical review (1999) Int J Prod Res, 37 (2), pp. 285-314;
Seifoddini, H., Wolfe, P.M., Applications of the similarity coefficient method in
Srinivasan, G., Narendran, T.T., GRAFICS-A non hierarchical clustering-algorithm
families problem in group technology (1990) Int J Prod Res, 28, pp. 145-152;
9, pp. 73-78;
(2009) Int J Prod Econ, 120, pp. 669-688;
in cellular manufacturing (2001) Comput Ind Eng, 39 (12), pp. 1-17
CORRESPONDENCE ADDRESS: Luna, D.; Dpt. Ingeniería Industrial y Mecánica,
Universidad de las Américas, Puebla, Mexico; email: [email protected]
ISSN: 11345764
ABBREVIATED SOURCE TITLE: TOP
SOURCE: Scopus
Yin, Y., Yasuda, K.

35739337500;13405856800;
Similarity coefficient methods applied to the cell formation problem: A comparative
investigation
14644410979&doi=10.1016%2fj.cie.2003.01.001&partnerID=40&md5=ab99fbb733e05bf8bedd9e
a984b1144f
DOI: 10.1016/j.cie.2003.01.001
AFFILIATIONS: Industrial and Management Science, Dept. Pub. Plcy. and Social
Studs., Yamagata University, 1-4-12, Kojirakawa-cho, Yamagata-shi 990-8560, Japan;
Grad. Sch. of Econ. and Management, Tohoku University, Kawauchi, Aoba-ku, Sendai
980-8576, Japan
ABSTRACT: Although many similarity coefficients have been proposed, very few
comparative studies have been done to evaluate the performance of various
similarity coefficients. In this paper, we compare the performance of 20 well-known
similarity coefficients. Two hundred and fourteen numerical cell formation
problems, which are selected from the literature or generated deliberately, are
used for the comparative study. Nine performance measures are used for evaluating
the goodness of cell formation solutions. Two characteristics, discriminability and
stability of the similarity coefficients are tested under different data
conditions. From the results, three similarity coefficients are found to be more
discriminable. Jaccard is found to be the most stable similarity coefficient. Four
similarity coefficients are not recommendable due to their poor performances. ©
2005 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Comparative study;
Similarity coefficient
INDEX KEYWORDS: Algorithms; Group technology; Problem solving; Production
engineering; Stability, Cell formation; Comparative study; Discriminability;
Similarity coefficient, Cellular manufacturing
REFERENCES: Anderberg, M.R., (1973) Cluster Analysis for Applications, , Academic
Press New York;
113;
Balasubramanian, K.N., Panneerselvam, R., Covering technique-based algorithm for
Baker, R.P., Maropoulos, P.G., An automatic clustering algorithm suitable for use
by a computer-based tool for the design, management and continuous improvement of
cellular manufacturing systems (1997) Computer Integrated Manufacturing Systems, 10
(3), pp. 217-230;
pp. 2097-2116;
Research, 24, pp. 451-464;
Research, 24, pp. 1221-1233;
Chen, D.S., Chen, H.C., Part, J.M., An improved ART neural net for machine cell
formation (1996) Journal of Materials Processing Technology, 61, pp. 1-6;
Chow, W.S., Hawaleshka, O., An efficient algorithm for solving the machine chaining
problem in cellular manufacturing (1992) Computers and Industrial Engineering, 22
(1), pp. 95-100;
Chow, W.S., Hawaleshka, O., Minimizing intercellular part movements in
31 (9), pp. 2161-2170;
Chow, W.S., Hawaleshka, O., A novel machine grouping and knowledge-based approach
for cellular manufacturing (1993) European Journal of Operational Research, 69, pp.
357-372;
28 (8), pp. 1417-1433;
Faber, Z., Carter, M.W., A new graph theory approach for forming machine cells in
cellular production systems (1986) Flexible Manufacturing Systems: Methods and
Studies, pp. 301-315., A. Kusiak Elsevier North-Holland;
Gupta, T., Clustering algorithms for the design of cellular manufacturing systems -
An analysis of their performance (1991) Computers and Industrial Engineering, 20
(4), pp. 461-468;
Hon, K.K.B., Chi, H., A new approach of group technology part families optimization
(1994) Annals of the CIRP, 43 (1), pp. 425-428;
Formation in Cellular Manufacturing: A Comparative Study, , PhD Thesis, Department
of Industrial and Manufacturing Engineering, University of Wisconsin-Milwaukee;
Irani, S.A., Khator, S.K., A microcomputer-based design of a cellular manufacturing
system (1986) Proceedings of the Eighth Annual Conference on Computers and
Jaccard, P., Novelles recgerches sur la distribution florale (1908) Bulletin De La
Sociètè Vaudoise Des Sciences Naturelles, 44, pp. 223-270;
Research, 18 (2), pp. 213-232;
117-133;
397;
1715-1728;
10 (2), pp. 93-107;
Engineer, 51 (2), pp. 53-57;
993-1009;
Milligan, G.W., Cooper, S.C., Methodology review: Clustering methods (1987) Applied
Psychological Measurement, 11 (4), pp. 329-354;
implementation - A state of the art survey (1985) Omega, 13 (5), pp. 381-391;
Sarker, B.R., Li, Z., Measuring matrix-based cell formation considering alternative
routings (1998) Journal of the Operational Research Society, 49 (9), pp. 953-965;
Sarker, B.R., Mondal, S., Grouping efficiency measures in cellular manufacturing: A
survey and critical review (1999) International Journal of Production Research, 37
(2), pp. 285-314;
419-426;
Seifoddini, H., Djassemi, M., A new grouping measure for evaluation of machine-
component matrices (1996) International Journal of Production Research, 34 (5), pp.
1179-1193;
clustering algorithm in cellular manufacturing (1994) Journal of Manufacturing
Systems, 13 (2), pp. 119-127;
Seifoddini, H., Tjahjana, B., Part-family formation for cellular manufacturing: A
case study at Harnischfeger (1999) International Journal of Production Research, 37
(14), pp. 3263-3273;
(1985) Engineering Cost and Production Economics, 9, pp. 125-134;
Shafer, S.M., Meredith, J.R., A comparison of selected manufacturing cell formation
techniques (1990) International Journal of Production Research, 28 (4), pp. 661-
673;
and Control, , Chapman & Hall London;
in production flow analysis (1979) Proceedings of the 20th International Machine
Tool Design and Research Conference, Birmingham, UK, September, pp. 525-532;
(1), pp. 84-97;
Vakharia, A.J., Wemmerlöv, U., A comparative investigation of hierarchical
clustering techniques and dissimilarity measures applied to the cell formation
in cellular manufacturing (2001) Computers and Industrial Engineering, 39 (12), pp.
1-17;
problem: A taxonomy and review (2005) International Journal of Production Economics
CORRESPONDENCE ADDRESS: Yin, Y.; Industrial and Management Science, Dept. Pub.
Plcy. and Social Studs., Yamagata University, 1-4-12, Kojirakawa-cho, Yamagata-shi
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Karoum, B., Elbenani, B., El Imrani, A.A.

57188978487;36147113000;56285826800;
Clonal selection algorithm for the cell formation problem
(2016) Lecture Notes in Electrical Engineering, 380, pp. 319-326. Cited 3 times.
3-319-30301-7_33&partnerID=40&md5=70fb4d740a6c7ee8cb6db7404b161f99
DOI: 10.1007/978-3-319-30301-7_33
Mohammed V University of Rabat, B.P. 1014, Rabat, Morocco;
Conception and Systems Laboratory (LCS), Faculty of Science, Mohammed V University
of Rabat, B.P. 1014, Rabat, Morocco
ABSTRACT: The cell formation problem attempts to group machines and part families
in dedicated manufacturing cells such that the inter-cell movement of the products
are minimized while the machine utilization are maximized. In this paper, a clonal
selection algorithm is proposed for solving this problem. This algorithm introduces
theories of clonal selection, hypermutation and receptor edit to construct an
evolutionary searching mechanism which is used for exploration. A local search
mechanism is integrated to exploit local optima. In order to demonstrate the
effectiveness of the proposed algorithm, most widely used benchmark problems are
solved and the obtained results are compared with different methods collected from
the literature. The results demonstrate that the proposed algorithm is a very
effective and performs well on all test problems. © Springer International
Publishing Switzerland 2016.
AUTHOR KEYWORDS: Cell formation; Clonal selection; Grouping efficacy; Local
search; Receptor editing
INDEX KEYWORDS: Algorithms; Cells; Cellular manufacturing; Clone cells; Cytology;
Local search (optimization), Cell formation; Clonal selection; Grouping efficacy;
Local search; Receptor editing, Problem solving
REFERENCES: Dimopoulos, C., Zalzala, A.M., Recent developments in evolutionary
computation for manufacturing optimization: Problems, solutions, and comparisons
(2000) IEEE Trans. Evol. Comput, 4, pp. 93-113;
Srinivasan, G., Narendran, T.T., GRAFICS—A nonhierarchical clustering algorithm for
group technology (1991) Int. J. Prod. Res, 29, pp. 463-478;
neighbourhood search to solve the cell formation problem (2012) Expert Syst. Appl,
39, pp. 2408-2414;
selection principle (2002) IEEE Trans. Evol. Comput, 6, pp. 239-251;
Ying, K.C., Lin, S.W., Lu, C., Cell formation using a simulated annealing algorithm
with variable neighbourhood (2011) Eur. J. Ind. Eng, 5, pp. 22-42;
Top, 20, pp. 679-706;
Adv. Manuf. Technol, 73, pp. 1543-1556
[email protected]
EDITORS: Oualkadi A.E., Moussati A.E., Choubani F.
ISSN: 18761100
ISBN: 9783319302997
ABBREVIATED SOURCE TITLE: Lect. Notes Electr. Eng.
SOURCE: Scopus
Raminfar, R., Zulkifli, N., Vasili, M.

55384122700;36134030300;24588202500;
A mathematical programming model for cell formation problem with machine
replication
(2013) Journal of Applied Mathematics, 2013, art. no. 285759, . Cited 1 time.
84878626245&doi=10.1155%2f2013%2f285759&partnerID=40&md5=71818154951c109d885482f6b3
cf649a
DOI: 10.1155/2013/285759
AFFILIATIONS: Department of Mechanical and Manufacturing Engineering, Universiti
Putra Malaysia, Selangor, Malaysia;
Department of Industrial Engineering, Lenjan Branch, Islamic Azad University,
Esfahan, Iran
ABSTRACT: 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. ©
2013 Reza Raminfar et al.
and Industrial Engineering, 34 (1), pp. 3-20., PII S0360835297001472;
research (2010) European Journal of Operational Research, 206 (3), pp. 509-521., 2-
s2.0-77951122395 10.1016/j.ejor.2009.10.020;
Blacksburg, Va, USA Virginia Polytechnic Institute and State University;
Wemmerlöv, U., Hyer, N.L., Procedures for the part family/machine group
Management, 6 (2), pp. 125-147., 2-s2.0-0000095365;
Wei, J.C., Gaither, N., A capacity constrained multiobjective cell formation method
(1990) Journal of Manufacturing Systems, 9 (3), pp. 222-232., 2-s2.0-0001466739;
International Journal of Production Research, 29 (6), pp. 1081-1100., 2-s2.0-
0026172103;
pp. 293-318;
Zolfaghari, S., Design and plannng for cellular manufacturing: Application of
neural networks and advanced search techniques (1997) Mechanical Engineering, ,
Ottawa, Canada Universty of Ottawa;
Logendran Rasaratnam, Binary integer programming approach for simultaneous machine-
part grouping in cellular manufacturing systems (1993) Computers and Industrial
pp. 433-444., 2-s2.0-4344654805 10.1108/17410380410547843;
Raminfar, R., Zulkifli, N., Vasili, M.R., Sai Hong, T., An integrated model for
production planning and cell formation in cellular manufacturing systems (2013)
Journal of Applied Mathematics, 2013, p. 10., 487694 10.1155/2013/487694;
S0925527306000995;
European Journal of Operational Research, 69 (3), pp. 284-291., 2-s2.0-0027663979;
Seifoddini Hamid, Duplication process in machine cells formation in group
technology (1989) IIE Transactions (Institute of Industrial Engineers), 21 (4), pp.
382-388;
2700;
1380;
707-720., 2-s2.0-0033080247;
International Journal of Production Economics, 120 (2), pp. 301-314., 2-s2.0-
67651152620 10.1016/j.ijpe.2008.12.013;
(1995) International Journal of Production Research, 33 (8), pp. 2079-2095., 2-
s2.0-0029359946;
pp. 117-133;
(1994) International Journal of Production Research, 32 (2), pp. 273-297., 2-s2.0-
0028377447;
Atmani, A., Lashkari, R.S., Caron, R.J., A mathematical programming approach to
joint cell formation and operation allocation in cellular manufacturing (1995)
International Journal of Production, 33 (1), pp. 1-15;
systems (2001) Integrated Manufacturing Systems, 12 (4), pp. 275-284., DOI
10.1108/09576060110392588;
Systems, L., (2010) LINGO User's Guide, , Chicago, Ill, USA LINDO System;
Chandrasekharan, M.P., Rajagopalan, R., Ideal seed non-hierarchical clustering
Research, 24 (2), pp. 451-463;
0947-6;
Sarker, B.R., Grouping efficiency measures in cellular manufacturing: A survey and
critical review (1999) International Journal of Production Research, 37 (2), pp.
285-314., 2-s2.0-0032784746;
Hsu, C.P., (1990) The Similarity Coefficient Approaches of Machine-Component Cell
Formation in Cellular Manufacturing: A Comparative Study, , Milwaukee, Wis, USA
University of Wisconsin-Milwaukee;
Manufacturing, , Prentice Hall Press
CORRESPONDENCE ADDRESS: Raminfar, R.; Department of Mechanical and Manufacturing
Engineering, Universiti Putra Malaysia, Selangor, Malaysia; email:
[email protected]
ISSN: 1110757X
ABBREVIATED SOURCE TITLE: J. Appl. Math.
SOURCE: Scopus
Nsakanda, A.L., Diaby, M., Price, W.L.

6506046784;6603557151;7201638614;
Hybrid genetic approach for solving large-scale capacitated cell formation problems
with multiple routings
times.
31144466502&doi=10.1016%2fj.ejor.2005.01.017&partnerID=40&md5=ebd72ea121d9c09deeaae
602363ebea5
DOI: 10.1016/j.ejor.2005.01.017
AFFILIATIONS: Sprott School of Business, Carleton University, Ottawa, Ont. K1S 5B6,
Canada;
School of Business Administration, University of Connecticut, Storrs, CT 06268,
United States;
Faculté des Sciences de l'Administration, Université Laval, Qué. G1K 7P4, Canada
ABSTRACT: We present a comprehensive model for designing a cellular manufacturing
system. The model bridges several known problems in that it integrates the cell
formation problem, the machine allocation problem, and the part routing problem.
Multiple process plans for each part and multiple routing alternatives for each of
those process plans are considered. The part demands can be satisfied from internal
production or through outsourcing. Machines have limited capacities. We propose a
solution methodology based on a combination of a genetic algorithm and large-scale
optimization techniques. A computational study is conducted to evaluate the
viability of our approach for solving large scale problems. A limited computational
experiment involving smaller problems, that are special cases of our model, is also
conducted to compare our solution approach with existing models. © 2005 Elsevier
AUTHOR KEYWORDS: Alternate routings; Cellular manufacturing systems; Dantzig-
Wolfe decomposition; Genetic algorithm; Large-scale optimization
INDEX KEYWORDS: Cellular manufacturing; Decomposition; Hybrid computers; LSI
circuits; Optimization, Alternate routings; Cellular manufacturing systems;
Dantzig-Wolfe decomposition; Large-scale optimization, Genetic algorithms
REFERENCES: Adil, G.K., Rajamani, D., The tradeoff between intracell and intercell
19 (5), pp. 305-317;
Askin, R.G., Zhou, M., Formation of independent flow-line cells based on operations
requirements and machine capabilities (1998) IIE Transactions, 30, pp. 319-329;
Billo, R.E., Tate, D., Bidanda, B., A genetic cluster algorithm for the machine-
component grouping problem (1995) 3rd Industrial Engineering Conference
Proceedings, pp. 543-548;
Cao, Q., McKnew, M.A., Partial termination rule of lagrangian relaxation for
manufacturing cell formation problems (1998) Computers and Operations Research, 25
(2), pp. 159-168;
Chen, J., Heragu, S.S., Stepwise decomposition approaches for large scale cell
formation problems (1999) European Journal of Operational Research, 113 (1), pp.
64-79;
Chu, C.H., Recent advances in mathematical programming for cell formation problem
(1995) Planning, Design and Analysis of Cellular Manufacturing Systems, pp. 3-46.,
A.K. Kamrani H.R. Parsei D.H. Lies Elsevier Science Publishers Amsterdam;
Dake, S., Lin, L., Batta, R., Cell formation using tabu search (1995) Computers and
Gravel, M., Nsakanda, A.L., Price, W.L., Efficient solution to the cell formation
machine-component grouping decisions of cellular manufacturing system (1990)
Ho, J., Loute, E., An advanced implementation of the Dantzig-Wolfe decomposition
algorithm for linear programs (1981) Mathematical Programming, 20, pp. 303-326;
presence of alternate routing (1999) International Journal of Production Research,
37 (14), pp. 3289-3304;
Michalewitcz, Z., (1996) Genetic Algorithms + Data Structure = Evolution
Programs, , Springer-Verlag Publishers Berlin;
Research, 28 (12), pp. 2243-2257;
Nsakanda, A.L., Price, W.L., Diaby, M., Gravel, M., (2004) Ensuring Population
Diversity in Genetic Algorithms: A Technical Note with Application to the Cell
Formation Problem, , submitted for publication;
Rajamani, D., Singh, N., Aneja, Y.P., Designing of cellular manufacturing systems
77, pp. 79-95;
group technology systems (1993) European Journal of Operational Research, 69 (3),
pp. 373-383;
Review, evaluation and direction for future research (1998) Computers and
Implementation and performance improvements (1997) International Journal of
pp. 1409-1421;
Xie, X., Manufacturing cell formation under capacity constraints (1993) Applied
Stochastic Models and Data Analysis, 9, pp. 87-96;
Yin, Y., Yasuda, K., Manufacturing cells design in consideration of various
385-395;
Research, 38 (2), pp. 385-395
CORRESPONDENCE ADDRESS: Nsakanda, A.L.; Sprott School of Business, Carleton
University, Ottawa, Ont. K1S 5B6, Canada; email: [email protected]
ISSN: 03772217
CODEN: EJORD
SOURCE: Scopus
Mehdizadeh, E., Rahimi, V.

23974842600;57195715872;
An integrated mathematical model for solving dynamic cell formation problem
considering operator assignment and inter/intra cell layouts
84959141862&doi=10.1016%2fj.asoc.2016.01.012&partnerID=40&md5=2f8b0759908f8422c03d3
a8420b8748c
DOI: 10.1016/j.asoc.2016.01.012
AFFILIATIONS: Faculty of Industrial and Mechanical Engineering, Qazvin Branch,
Islamic Azad University, Qazvin, Iran
ABSTRACT: The aim of this paper is to present an integrated mathematical model to
solve the dynamic cell formation problem considering operator assignment and
inter/intra cell layouts problems with machine duplication, simultaneously. The
proposed model includes three objectives which the first objective seeks to
minimize inter/intra cell part movements and machine relocation, the second
objective minimizes machine and operator related costs and the third objective
maximizes consecutive forward flows ratio. In order to validate the proposed model,
a numerical example is presented and solved by the sum weighted method. Due to NP-
hardness of the model, two meta-heuristics namely multi-objective simulated
annealing (MOSA) and multi-objective vibration damping optimization (MOVDO) present
to solve the proposed model. Finally, two algorithms have been compared using
multi-objective criteria. © 2016 Elsevier B.V. All rights reserved.
AUTHOR KEYWORDS: Dynamic cell formation; Intra/inter cell layouts; Machine
duplication; Meta-heuristic algorithms; Multi-objective planning; Operator
assignment
INDEX KEYWORDS: Cellular manufacturing; Cytology; Heuristic algorithms;
Mathematical operators; Multiobjective optimization; Numerical methods;
Optimization; Simulated annealing, Cell layout; Dynamic cell formation; Meta
heuristic algorithm; Multi-objective planning; Operator assignment, Cells
REFERENCES: Logendran, R., Methodology for converting a functional manufacturing
system into a cellular manufacturing system (1993) Int. J. Prod. Econ., 29, pp. 27-
41;
Chen, M., A mathematical programming model for system reconfigurationin a dynamic
cellular manufacturing environment (1998) Ann. Oper. Res., 77, pp. 109-128;
dynamic cell formation problem using meta-heuristics (2005) Appl. Math. Comput.,
170, pp. 761-780;
reconfiguration (2007) Int. J. Prod. Res., pp. 1-28;
annealing (2008) J. Oper. Res. Soc., 59 (4), pp. 443-454;
Int. J. Prod. Econ., 120, pp. 301-314;
genetic algorithm to solve dynamic cell formation problem (2010) Appl. Math.
Model., 34 (4), pp. 1078-1092;
Majazi Delfard, V., New mathematical model for problem of dynamic cell formation
Appl. Math. Model., 37, pp. 1884-1896;
part grouping and cell layout problems (2006) Robot. Comput. Integr. Manuf., 22,
pp. 217-238;
Tavakkoli-Mogaddam, R., Javadian, N., Javadi, B., Safaei, N., Design of a facility
Appl. Math. Comput., 184, pp. 721-728;
and layout design using sequence data (2008) Robot. Comput. Integr. Manuf., 24, pp.
488-497;
Jolai, F., Tavakkoli-Mogaddam, R., Golmohammadi, A., Javadi, B., An
Syst. Appl., 39, pp. 2172-2182;
Krishnan, K.K., Mirzaei, S., Venkatasamy, V., Pillai, V.M., A comprehensive
approach to facility layout design and cell formation (2012) Int. J. Adv. Manuf.
Technol., 59, pp. 737-753;
simulated annealing (2012) Comput. Oper. Res., 39, pp. 2642-2658;
Chang, C.-C., Wu, T.-H., Wu, C.W., An efficient approach to determine cell
formation, cell layout and intracellular machine sequence in cellular manufacturing
(2013) Comput. Ind. Eng., 66, pp. 438-450;
Mahdavi, I., Teymourian, E., TahamiBahar, N., Keyvanfar, V., An integrated model
for solving cell formation and cell layout problem simultaneously considering new
situations (2013) J. Manuf. Syst.;
Kia, R., Shirazi, H., Javadian, N., Tavakkoli-Moghaddam, R., A multi-objective
model for designing a group layout of a dynamic cellular manufacturing system
(2013) J. Ind. Eng., 9, p. 8;
Suer, G., Bera, I., Optimal operator assignment and cell loading when lot-splitting
is allowed (1998) Comput. Ind. Eng., 35 (3-4), pp. 431-434;
Askin, R., Huang, Y., Forming effective worker teams for cellular manufacturing
(2001) Int. J. Prod. Res., 39 (11), pp. 2431-2451;
Norman, B., Worker assignment in cellular manufacturing considering technical and
human skills (2002) Int. J. Prod. Res., 40 (6), pp. 1479-1492;
Aryanezhad, M.B., Deljoo, V., Mirzapour Al-E-Hashem, S.M.J., Dynamic cell formation
and the worker assignment problem: A new model (2009) Int. J. Adv. Manuf. Technol.,
41, pp. 329-342;
and worker assignment (2010) Comput. Math. Appl., 60, pp. 1014-1025;
formation considering labor utilization (2013) Appl. Math. Model., 37, pp. 2308-
2316;
formation with machine layout and scheduling (2007) Comput. Ind. Eng., 53, pp. 277-
289;
Arkat, J., Hosseinabadi-Farahani, M., Hosseini, L., Integrating cell formation with
cellular layout and operations scheduling (2011) Int. J. Adv. Manuf. Technol., 61,
pp. 637-647;
environment (2013) Appl. Math. Model.;
White, S.R., Concept of scale in simulated annealing (1983) Proceeding IEEE
International Conference on Computer Design, , Portchester;
Mehdizadeh, E., Tavakkoli-Moghaddam, R., Vibration damping optimization algorithm
for an identical parallel machine scheduling problem (2009) Proceeding of the 2nd
International Conference of Iranian Operations Research Society, , Babolsar, Iran;
Dimopoulos, C., Zalzala, A.M.S., Recent developments in evolutionary computing for
manufacturing optimization: Problems, solutions and comparisons (2000) IEEE Trans.
Evolut. Comput., 68 (2), pp. 93-113;
Cruz-Reyes, L., Gómez-Santillán, C., Castillo-García, N., Quiroz, M., Ochoa, A.,
Hernández-Hernández, P., A visualization tool for heuristic algorithms analysis
(2013) 7th International Conference on Knowledge Management in Organizations:
Service and Cloud Computing, pp. 515-524., Springer, Berlin Heidelberg;
Satuglu, S.I., Suresh, N.C., A goal-programming approach for design of hybrid
cellular manufacturing systems in dual resource constrained environment (2009)
Comput. Ind. Eng., 56, pp. 560-575
Engineering, Qazvin Branch, Islamic Azad UniversityIran; email: [email protected]
ISSN: 15684946
SOURCE: Scopus

10045183300;7801495770;
A fuzzy genetic algorithm for the dynamic cell formation problem
(2007) Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference,
p. 1502.
34548103863&doi=10.1145%2f1276958.1277231&partnerID=40&md5=081b793faa1b8726e9c433bc
5aa9a3c7
DOI: 10.1145/1276958.1277231
AFFILIATIONS: Université de Boumerdés, Dépt. Informatique, Avenue de
l'indépendance, 35000. Boumerdés, Algeria;
Université de Babezzouar, Dépt. Informatique, BP 32, El-Alia, 16111. Alger, Algeria
ABSTRACT: This paper deals with a fuzzy genetic algorithm applied to a
manufacturing cell formation problem. We discuss the importance of taking into
account the dynamic aspect of the problem that has been poorly studied in the
related literature. Using a multi-periodic planning horizon modeling, two
strategies are considered: passive and active. The first strategy consists of
maintaining the same composition of machines during the overall planning horizon,
while the second allows performing a different composition for each period. When
the decision maker wants to choose the most adequate strategy for its environment,
there is a need to control the proposed evolutionary solving approach, due to the
complexity of the model. For that purpose, we propose an off-line fuzzy logic
enhancement. The results, using this enhancement, are better than those obtained
using the GA alone.
AUTHOR KEYWORDS: Dynamic production system; Genetic algorithm; Linguistic fuzzy
modeling; Manufacturing cell formation
INDEX KEYWORDS: Computational linguistics; Decision making; Fuzzy systems;
Mathematical models; Problem solving, Dynamic production systems; Linguistic fuzzy
modeling; Manufacturing cell formation, Genetic algorithms
CORRESPONDENCE ADDRESS: Boulif, M.; Université de Boumerdés, Dépt. Informatique,
Avenue de l'indépendance, 35000. Boumerdés, Algeria; email: [email protected]
ISBN: 1595936971; 9781595936974

ABBREVIATED SOURCE TITLE: Proc. Gen. Evol. Comput. Conf.
SOURCE: Scopus
Miltenburg, J., Montazemi, A.R.

7003817487;6602844942;
Revisiting the cell formation problem: Assigning parts to production systems
12 times.
0027698987&doi=10.1080%2f00207549308956893&partnerID=40&md5=0dc24b1a39c1eea88e5c353
57fd5a41b
DOI: 10.1080/00207549308956893
AFFILIATIONS: School of Business, McMaster University, Hamilton, ON, L8S 4M4,
Canada
ABSTRACT: Before manufacturing cells can be identified from a population of parts
and machines, the parts must be carefully analysed to determine the small subset of
parts that are appropriate for cellular manufacturing. When this is not done it
becomes very difficult to identify the cells because the algorithms that are used
have high computational requirements and high space requirements. The computational
requirements and space requirements for the rank order clustering algorithm and the
similarity coefficient algorithm are determined. Other algorithms that have been
proposed for solving the ‘cell formation problem’ are more elaborate than these and
are therefore likely have higher computational and space requirements. A procedure
for assigning parts to production systems is presented in this paper. An
illustrative example, taken from an actual implementation, is described to show how
the procedure can be used. © 1993 Taylor & Francis Group, LLC.
INDEX KEYWORDS: Just in time production; Operations research; Plant layout;
Production engineering; Time and motion study, Cellular manufacturing; Group
technology; Order clustering, Machine shop practice
REFERENCES: Hayes, R.H., Wheelwright, S.C., Link manufacturing process and product
life cycles (1979) Harvard Business Review, pp. 133-140., January-February;
Johnson, N.L., Kotz, S., (1969) Discrete Distributions, , New York: John Wiley &
Sons);
King, J.R., Machine-part grouping in production flow analysis: An approach using a
Research, 18 (2), pp. 213-237;
King, J.R., Nakornchai, V., Machine part group formation in group technology—review
and extension (1982) International Journal of Production Research, 20 (2), pp. 117-
133;
Engineer, 51 (2), pp. 53-57;
Miltenburg, G.J., Zhang, W., A comparative evaluation of nine well-known algorithms
Schonberger, R.J., (1985) Operations Management: Productivity and Quality, , Plano,
Texas: Business Publications;
Schmenner, R.W., (1990) Production Operations Management: Concepts and
Situations, , New York: Macmillan);
Szendrovits, A.Z., (1975) An Introduction to Production Management: Technical
Notes, , Hamilton, Canada: MeMaster University);
Wemmerlöv, U., Hever, N.L., Procedures for the part family/machine group
CORRESPONDENCE ADDRESS: Miltenburg, J.; School of Business, McMaster University,
Hamilton, ON, L8S 4M4, Canada
ISSN: 00207543
SOURCE: Scopus
Yasuda, K., Hu, L., Yin, Y.

13405856800;55470175000;35739337500;
A grouping genetic algorithm for the multi-objective cell formation problem
times.
27944458812&doi=10.1080%2f00207540512331311859&partnerID=40&md5=95a6736a0bb8df3f9e4
5c6a0378165a1
DOI: 10.1080/00207540512331311859
AFFILIATIONS: Industrial and Management Science, Graduate School of Economics and
Management, Tohoku University, Kawauchi, Aoba-ku, Sendai 980-8576, Japan;
Industrial and Management Science, Department of Public Policy and Social Studies,
Yamagata University, 1-4-12 Kojirakawa-cho, Yamagata-shi 990-8560, Japan
ABSTRACT: In this research, we propose an efficient method to solve the multi-
objective cell formation problem (CFP) partially adopting Falkenauer's grouping
genetic algorithm (GGA). The objectives are the minimization of both the cell load
variation and intercell flows considering the machines' capacities, part volumes
and part processing times on the machines. We relax the cell size constraints and
solve the CFP without predetermination of the number of cells, which is usually
difficult to predict in a real-world CFP design. We also make some effort to
improve the efficiency of our algorithm with respect to initialization of the
population, fitness valuation, and keeping crossover operator from cloning.
Numerical examples are tested and comparisons are made with general genetic
algorithms (GAs). The result shows that our method is effective and flexible in
both grouping machines into cells and deciding on the number of cells for the
optimal solution. © 2005 Taylor & Francis Ltd.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Grouping genetic
algorithm; Multi-objective optimization
INDEX KEYWORDS: Cloning; Flexible manufacturing systems; Genetic algorithms;
Numerical analysis, Cell formation; Cell load variation, Production engineering
alternate routing (1996) Int. J. Prod. Res., 34, pp. 1361-1380;
Alsultan, K.S., Fedjki, C.A., A genetic algorithm for the part family formation
problem (1997) Prod. Plan. & Con., 8, pp. 788-796;
cellular manufacturing systems in a lumpy demand environment (2001) European J.
Oper. Res., 134, pp. 346-364;
Askin, R.G., Cresswell, S.H., Goldberg, J.B., Vakhara, A.J., Hamiltonian path
Int. J. Prod. Res., 29, pp. 1081-1100;
Asokan, P., Prabhakaran, G., Kumar, G.S., Machine-cell grouping in cellular
manufacturing systems using non-traditional optimization techniques - A comparative
study (2001) Int. J. Adv. Manuf. Technol., 18, pp. 140-147;
Baykasoglu, A., Gindy, N.N.Z., MOCACEF 1.0: Multiple objective capability based
approach to form part-machine groups for cellular manufacturing applications (2000)
Int. J. Prod. Res., 38, pp. 1133-1161;
Billo, R.E., Bidanda, B., Tate, D., A genetic cluster algorithm for the machine-
component grouping problem (1996) J. Intell. Manuf., 7, pp. 229-241;
Boctor, F.F., The minimum-cost, machine-part cell formation problem (1996) Int. J.
Prod. Res., 34, pp. 1045-1063;
742-752;
(1973) Int. J. Prod. Res., 11, pp. 399-416;
formation of part families and machine cells (1987) Int. J. Prod. Res., 25, pp.
835-850;
binary data matrices for group technology (1989) Int. J. Prod. Res., 27, pp. 1035-
1052;
Chen, C.L., Cotruvo, N.A., Bake, W., A simulated annealing solution to the cell
machine groups and part families (1998) Int. J. Prod. Res., 36, pp. 1325-1337;
efficient method to solve the cell formation problem (2000) Math. Comp. Simul., 51,
pp. 257-271;
for manufacturing optimization: Problems, Solutions, and Comparisons (2000) IEEE
Trans. Evol. Comput., 4, pp. 93-113;
Falkenauer, E., (1998) Gen. Algo. Group. Prob., , Wiley: New York;
Learning, , Addison-Wesley: Reading, MA;
problem with multiple routings via a double-loop genetic algorithm (1998) Euro. J.
Oper. Res., 109, pp. 286-298;
formation using a new self-organizing neural network (2002) Comp. Indus. Engin.,
42, pp. 377-382;
Gupta, T., Seifoddini, H., Production data based similarity coefficient for machine
component grouping decisions in the design of cellular manufacturing system (1990)
Int. J. Prod. Res., 28, pp. 1247-1269;
Gupta, Y.P., Gupta, M.C., Kumar, A., Sundaram, C., Minimizing total intercell and
J. Comp. Integ. Manuf., 8, pp. 92-101;
Gupta, Y.P., Gupta, M.C., Kumar, A., Sundaram, C., A genetic algorithm-based
approach to cell composition and layout design problems (1996) Int. J. Prod. Res.,
34, pp. 447-482;
Michigan Press: Ann Arbor, MI;
problem (1996) Comp. Indust. Engin., 30, pp. 941-955;
Irani, S.A., (1999) Handbook of Cellular Manufacturing Systems, , Wiley-
Interscience: New York;
Joines, J.A., Culberth, C.T., King, R.E., Manufacturing cell design: An integer
85;
Joines, J.A., Houck, C.R., On the use of non-stationary penalty functions to solve
constrained optimization problems with genetic algorithms (1994) Proceeding of the
1994 IEEE International Symposium EC, Orlando, FL, pp. 579-584;
neural network approach (1992) Int. J. Prod. Res., 30, pp. 1353-1367;
Kaparthi, S., Suresh, N.C., An improved neural network leader algorithm for part
machine grouping in group technology (1993) Euro. J. Oper. Res., 69, pp. 342-356;
Review and extensions (1982) Int. J. Prod. Res., 20, pp. 117-133;
J. Prod. Res., 28, pp. 233-243;
manufacturing systems (1986) Euro. J. Oper. Res., 24, pp. 387-397;
pp. 561-569;
considering alternative routing (1997) Comp. Integ. Manuf. Syst., 10, pp. 93-107;
Lee-Post, A., Part family identification using a simple genetic algorithm (2000) I.
J. Prod. Res., 38, pp. 793-810;
Logendran, R., Ramakrishna, P., Srikandarajah, C., Tabu search based heuristics for
cellular manufacturing system in the presence of alternative process plans (1994)
Int. J. Prod. Res., 32, pp. 273-297;
cell formation (2000) Int. J. Adv. Manuf. Technol., 16, pp. 491-497;
manufacturing systems (1991) J. Intell. Manuf., 2, pp. 305-314;
Mcauley, J., Machine grouping for efficient production (1972) Prod. Engin., 51, pp.
53-57;
Meents, I., A genetic algorithm for the group-technology problem. Applications of
Evolutionary Computing (2001) Proceedings of the EvoWorkshops 2001: EvoCOP,
EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, pp. 90-99., Como, Italy, April 18-20;
Programs, , Springer: New York;
for solving the cell formation problem in group technology (1991) J. Oper. Manage.,
10, pp. 44-72;
manufacturing cells (1999) Int. J. Prod. Econ., 60-61, pp. 421-426;
manufacturing cell design (1999) Comp. & Indust. Engin., 36, pp. 379-389;
Moon, Y.B., Establishment of a neurocomputing model for part family/machine group
identification (1992) J. Intell. Manuf., 3, pp. 173-182;
Mukhopadyay, S.K., Ramesh, B.K., Vijai, S.K.V., Modified Hamiltonian chain: A graph
theoretic approach to group technology (2000) Int. J. Prod. Res., 38, pp. 2459-
2470;
Nair, G.J., Narendra, T.T., CASE: A clustering algorithm for cell formation with
sequence data (1998) Int. J. Prod. Res., 36, pp. 157-179;
Offodile, F.O., Mehrez, A., Grznar, J., Cellular manufacturing: A taxonomic review
framework (1994) J. Manuf. Syst., 13, pp. 196-220;
systems (2001) Comp. & Ind. Engin., 39, pp. 125-144;
design and organization of manufacturing systems (2003) Comp. & Ind. Engin., 44,
pp. 339-364;
Rajagopalan, R., Batra, J.L., Design of cellular production system: A graph
manufacturing systems: An industrial application (1999) Int. J. Prod. Res., 37, pp.
557-580;
simulated annealing approach (1993) Int. J. Prod. Res., 31, pp. 2927-2945;
2158;
for group technology (1991) Int. J. Prod. Res., 29, pp. 463-478;
Su, C.T., Hsu, C.M., A two-phased genetic algorithm for the cell formation problem
(1996) Int. J. Ind. Engin., 3, pp. 114-125;
simulated annealing (1998) Int. J. Prod. Res., 36, pp. 2185-2207;
process routes by genetic algorithm (2002) Int. J. Prod. Econ., 76, pp. 219-228;
simulated annealing: An experimental evaluation (1992) Euro. J. Oper. Res., 63, pp.
409-422;
component grouping problem with multiple objectives (1992) Comp. & Indus. Engin.,
22, pp. 469-480;
models (1994) Int. J. Prod. Res., 32, pp. 2105-2116;
Implementation experiences and performance improvements (1997) Int. J. Prod. Res.,
35, pp. 29-49;
in cellular manufacturing (2001) Comp. & Ind. Engin., 39, pp. 1-17;
production factors (2002) Int. J. Prod. Res., 40, pp. 885-906;
multiple routes and multiple objectives (2000) Int. J. Prod. Res., 38, pp. 385-395;

problems (2002) Int. J. Prod. Res., 40, pp. 2141-2158
CORRESPONDENCE ADDRESS: Yasuda, K.; Industrial and Management Science, Graduate
School of Economics and Management, Tohoku University, Kawauchi, Aoba-ku, Sendai
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Díaz, J.A., Luna, D.E.

7401603810;36504290300;
GRASP with path relinking for the manufacturing cell formation problem considering
part processing sequence
(2018) Journal of the Operational Research Society, 69 (9), pp. 1493-1511.
85049047913&doi=10.1080%2f01605682.2017.1404183&partnerID=40&md5=54b1e1f23086097757
41d23b341e1ffc
DOI: 10.1080/01605682.2017.1404183
AFFILIATIONS: Dpt. Actuaría Física y Matemáticas, Universidad de las Américas,
Puebla, Mexico;
Dpt. Ingeniería Industrial y Mecánica, Universidad de las Américas, Puebla, Mexico
ABSTRACT: In this study, a hybrid heuristic is proposed for the Manufacturing Cell
Formation Problem considering part processing sequence. The hybrid heuristic is
based on a GRASP heuristic and then it uses a path relinking strategy on a set of
elite solutions obtained by GRASP. The proposed GRASP heuristic constructs feasible
solutions using a two-stage randomised greedy procedure, that are improved with a
local search procedure. This procedure explores two neighbourhoods: machine
reassignments and machine interchanges. The path relinking is used as an
intensification strategy to improve the GRASP solutions. The performance of the
proposed heuristic is evaluated with data-sets from the literature and a set of
larger size instances randomly generated. The obtained results show that the GRASP
heuristic provides optimal or near optimal solutions with very small computational
burden. These results are further improved with a Path Relinking strategy. The most
remarkable features of the proposed heuristic are its simplicity and its ease of
implementation. © 2017, © Operational Research Society 2017.
AUTHOR KEYWORDS: GRASP; manufacturing cell formation; path relinking
INDEX KEYWORDS: Flexible manufacturing systems; Optimization, Computational burden;
Feasible solution; GRASP; Hybrid heuristics; Machine reassignments; Manufacturing
cell formation; Near-optimal solutions; Path relinking, Cellular manufacturing
REFERENCES: Díaz, J.A., Luna, D.E., Zetina, C.A., A hybrid algorithm for the
manufacturing cell formation problem (2013) Journal of Heuristics, 19 (1), pp. 77-
96;
Díaz, J.A., Luna, D., Luna, R., A grasp heuristic for the manufacturing cell
formation problem (2012) TOP, 20 (3), pp. 679-706;
Faigle, U., Schrader, R., Suletzki, R., A cutting plane algorithm for optimal graph
partitioning (1987) Methods of Operations Research, 57, pp. 109-116;
Feo, T., Resende, M., Greedy randomized adaptive search procedures (1995) Journal
of Global Optimization, 6 (2), pp. 109-133;
Glover, F., Tabu search and adaptive memory programming: advances, applications and
challenges (1996) Interfaces in Computer Science and Operations Research, 7 (1),
pp. 1-75;
with variant number of cells (2016) Production Engineering, 1 (11), pp. 19-28;
Laguna, M., Marti, R., Grasp and path relinking for 2-layer straight line crossing
minimization (1999) INFORMS Journal on Computing, 11 (1), pp. 44-52;
Martins, I.C., Pinheiro, R.G., Protti, F., Ochi, L.S., A hybrid iterated local
problem (2015) Expert Systems with Applications, 42 (22), pp. 8947-8955;
approach to the cell formation problem (2005) The International Journal of Advanced
the manufacturing cell formation problem based on grouping efficacy (2015) The
Raja, S., Anbumalar, V., An effective methodology for cell formation and intra-cell
machine layout design in cellular manufacturing system using parts visit data and
operation sequence data (2016) Journal of the Brazilian Society of Mechanical
Sciences and Engineering, 3 (38), pp. 869-882;
Resendel, M.G., Ribeiro, C.C., (2005) GRASP with path-relinking: Recent advances
and applications, pp. 29-63., Boston, MA: Springer, US, &;
cell formation in cellular manufacturing (2010) Journal of Software Engineering and
Applications, 3 (7), p. 674;
Sherali, H.D., Smith, J.C., Improving discrete model representations via symmetry
considerations (2001) Management Science, 47 (10), pp. 1396-1407;
cell formation problem (1993) Proceedings, 2nd Balkan Conference on OR, , October,
Salonica;
Sofianopoulou, S., Application of simulated annealing to a linear model forthe
formulation of machine cells ingroup technology (1997) International Journal of
Sorensen, M., (1995) A polyhedral approach to graph partitioning, , PhD thesis,
Aarhus School of Business;
Sorensen, M.M., (1999) An adaptation of the kernighan-lin heuristic to the simple
graph partitioning problem, , Working paper 99-1, Department of Management Science
and Logistics, Aarhus School of Busines;
Research, 41 (11), pp. 2531-2546;
for the manufacturing cells formation problem (2008) The International Journal of
Wu, T.-H., Chang, C.-C., Yeh, J.-Y., A hybrid heuristic algorithm adopting both
Wu, T.-H., Chung, S.-H., Chang, C.-C., A water flow-like algorithm for
manufacturing cell formation problems (2010) European Journal of Operational
Research, 205 (2), pp. 346-360
CORRESPONDENCE ADDRESS: Luna, D.E.; Dpt. Ingeniería Industrial y Mecánica,
Universidad de las AméricasMexico; email: [email protected]
ISSN: 01605682
CODEN: JORSD
SOURCE: Scopus
Zohrevand, A.M., Rafiei, H., Zohrevand, A.H.

55090207500;27967949000;57189901697;
Multi-objective dynamic cell formation problem: A stochastic programming approach
84975847429&doi=10.1016%2fj.cie.2016.03.026&partnerID=40&md5=40b92ab14e5d5fb8a1c931
b7b03834e3
DOI: 10.1016/j.cie.2016.03.026
AFFILIATIONS: School of Industrial & Systems Engineering, College of Engineering,
University of Tehran, Tehran, P.O. Box 11155-4563, Iran;
Department of Industrial Engineering, Faculty of Engineering, College of Farabi,
University of Tehran, Iran;
Graduate School of Management and Econimics, Sharif University of Technology,
Tehran, Iran
ABSTRACT: This paper addresses dynamic cell formation problem (DCFP) which has been
explored vastly for several years. Although a considerable body of literature in
this filed, two remarkable aspects have been significantly ignored so far, as
uncertainty and human-related issues. In order to compensate such a shortage, this
paper develops a bi-objective stochastic model. The first objective function of the
developed model seeks to minimize total cost of machine procurement, machine
relocation, inter-cell moves, overtime utilization, worker hiring/laying-off, and
worker moves between cells; while the second objective function maximizes labor
utilization of the cellular manufacturing system. In the developed model, labor
utilization, worker overtime cost, worker hiring/laying off, and worker cell
assignment are considered to tackle some of the most notable human-related issues
in DCFP. Considering the complexity of the proposed model, a hybrid Tabu Search–
Genetic Algorithm (TS–GA) is proposed whose strength is validated to obtain optimal
and near optimal solutions through conducted experimental results. © 2016 Elsevier
Ltd
AUTHOR KEYWORDS: Dynamic cell formation; Fuzzy sets theory; Human-related issues;
Multi-objective optimization; Stochastic programming
INDEX KEYWORDS: Cells; Cytology; Genetic algorithms; Manufacture; Multiobjective
optimization; Stochastic models; Stochastic programming; Stochastic systems; Tabu
search, Dynamic cell formation; Fuzzy sets theory; Human-related issues; Hybrid
tabu search; Inter-cell moves; Labor utilization; Near-optimal solutions; Objective
functions, Cellular manufacturing
REFERENCES: Arikan, F., Gungor, Z., Modeling of a manufacturing cell design problem
with fuzzy multi-objective parametric programming (2009) Mathematical and Computer
Modelling, 50, pp. 407-420;
Askin, R.G., Vakharia, A.J., Group technology – Cell formation and operation (1991)
The automated factory handbook: Technology and management, pp. 317-336., D.I.
Cleland B. Bidanda TAB Books New York;
Balakrishnan, J., Cheng, C.H., Dynamic cellular manufacturing under multi period
pp. 516-530;
Cesanı, V.I., Steudel, H.J., A study of labor assignment flexibility in cellular
manufacturing systems (2005) Computers & Industrial Engineering, 48, pp. 571-591;

Deljoo, V., Mirzapour Al-e-hashem, S.M.J., Deljoo, F., Aryanezhad, M.B., Using
pp. 578-588;
63, pp. 842-854;
Fry, T., Breen, M., Wilson, M., A successful implementation of group technology and
cell manufacturing (1987) Production and Inventory Management Journal, 28 (3), pp.
4-6;
formation design: Benders’ decomposition approach (2011) Expert Systems with
Applications, 38 (3), pp. 2478-2488;
Glover, F., Tabu search: A tutorial (1990) Interfaces;
Joines, J., Culbrethe, C., King, R., Manufacturing cell design: An integer
85;
Lai, Y.J., Hwang, C.L., Fuzzy mathematical programming, methods and applications
(1992), Springer-Verlag; Levasseur, G., Helms, M., Zink, A., Conversion from a
functional to the cellular manufacturing layout at Steward Inc (1995) Production
and Inventory Management Journal, 36 (3), pp. 37-42;
Lozano, S., Dobado, D., Larraneta, J., Onieva, L., Modified fuzzy C-means algorithm
for cellular manufacturing (2002) Fuzzy Sets and Systems, 126, pp. 23-32;
Mungwatanna, A., Design of cellular manufacturing systems for dynamic and uncertain
production requirement with presence of routing flexibility (2000), (PhD thesis)
Blacksburg State University Virginia VA; Park, S., Suresh, N.C., Performance of
fuzzy ART neural network and hierarchical clustering for part-machine grouping
based on operation sequences (2003) International Journal of Production Research,
41 (14), pp. 3185-3216;
Safaei, N., Saeidi-Mehrabad, M., Tavakkoli-Moghaddam, R., Sassani, F., A fuzzy
conditions (2008) Fuzzy Sets and Systems, 159, pp. 215-236;
Safaei, N., Tavakkoli-Moghadam, R., Integrated multi-period cell formation and
Saidi-Mehrabad, M., Ghezavati, V.R., Designing cellular manufacturing systems under
uncertainty (2009) Journal of Uncertain Systems, 3 (4), pp. 315-320;
Saxena, L.K., Jain, P.K., Dynamic cellular manufacturing systems design – A
comprehensive model (2011) International Journal of Advanced Manufacturing
Seifoddini, H., A probabilistic model for machine cell formation (1990) Journal of
Singh, N., Rajamaani, D., Cellular manufacturing systems: Planning and control
(1996), Chapman and Hall New York; Slomp, J., Bokhorst, J.A.C., Molleman, E.,
Cross-training in a cellular manufacturing environment (2005) Computers &
Slomp, J., Suresh, N.C., The shift team formation problem in multi-shift
manufacturing operations (2005) European Journal of Operational Research, 165, pp.
708-728;
Song, S., Hitomi, K., Integrating the production planning and cellular, layout for
flexible cell formation (1996) Production Planning & Control, 7 (6), pp. 585-593;
Süer, G.A., Optimal operator assignment and cell loading in labor-intensive
Süer, G.A., Arikan, F., Babayiğit, C., Effects of different fuzzy operators on
fuzzy bi-objective cell loading problem in labor-intensive manufacturing cells
Süer, G.A., Cosner, J., Patten, A., Models for cell loading and product sequencing
in labor-intensive cells (2009) Computers & Industrial Engineering, 56 (1), pp. 97-
105;
Süer, G.A., Huang, J., Maddisetty, S., Design of dedicated, shared and remainder
cells in a probabilistic demand environment (2010) International Journal of
Süer, G.A., Kamat, K., Mese, E., Huang, J., Minimizing total tardiness subject to
manpower restriction in labor-intensive manufacturing cells (2013) Mathematical and
Computer Modelling, 57, pp. 741-753;
Süer, G.A., Sáiz, M., Cell loading in cellular manufacturing systems (1993)
Computers & Industrial Engineering, 25 (1–4), pp. 247-250;
Süer, G.A., Vazquezb, R., Cortes, M., A hybrid approach of genetic algorithms and
local optimizers in cell loading (2005) Computers & Industrial Engineering, 48 (3),
pp. 625-641;
Suresh, N.C., Slomp, J., Labor assignment and grouping in cellular manufacturing––A
multi-objective methodology (2001) International Journal of Production Research, 39
(18), pp. 4103-4131;
Tavakkoli-Moghaddam, R., Aryanezhad, M., Safaei, N., Azaron, A., Solving a dynamic
cell formation problem using metaheuristics (2005) Applied Mathematics and
Torabi, S.A., Rafiei, H., An optimization framework towards prioritization in fuzzy
comparison matrices (2012) Expert Systems with Applications, 39, pp. 638-646;
173-181;
Wang, X., Tang, J., Yung, K., Optimization of the multi-objective dynamic cell
formation problem using a scatter search approach (2009) International Journal of
Wicks, E., Designing cellular manufacturing systems with time varying product mixed
and resource availability (1995), (PhD thesis) Virginia Polytechnic Institute and
State University Blacksburg, VACORRESPONDENCE ADDRESS: Zohrevand, A.M.; School of
Industrial & Systems Engineering, College of Engineering, University of Tehran,
Tehran, P.O. Box 11155-4563, Iran
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Esmailnezhad, B., Fattahi, P., Kheirkhah, A.S.

56081688000;16030362200;24449039000;
A stochastic model for the cell formation problem considering machine reliability
5 times.
85007233471&doi=10.1007%2fs40092-015-0108-
8&partnerID=40&md5=7f7df00b46bcfddba48924ed6e6b70d0
DOI: 10.1007/s40092-015-0108-8
AFFILIATIONS: Faculty of Industrial Engineering, Bu-Ali Sina University, Hamedan,
Iran
ABSTRACT: This paper presents a new mathematical model to solve cell formation
problem in cellular manufacturing systems, where inter-arrival time, processing
time, and machine breakdown time are probabilistic. The objective function
maximizes the number of operations of each part with more arrival rate within one
cell. Because a queue behind each machine; queuing theory is used to formulate the
model. To solve the model, two metaheurstic algorithms such as modified particle
swarm optimization and genetic algorithm are proposed. For the generation of
initial solutions in these algorithms, a new heuristic method is developed, which
always creates feasible solutions. Both metaheurstic algorithms are compared
against global solutions obtained from Lingo software’s branch and bound (B&B).
Also, a statistical method will be used for comparison of solutions of two
metaheurstic algorithms. The results of numerical examples indicate that
considering the machine breakdown has significant effect on block structures of
machine-part matrixes. © The Author(s) 2015.
AUTHOR KEYWORDS: Cell formation; Metaheurstic algorithm; Queuing theory;
Reliability
REFERENCES: Ameli, M.S.J., Arkat, J., Cell formation with alternative process
routings and machine reliability consideration (2008) Int J Adv Manuf Technol, 35,
pp. 761-768;
Ameli, M.S.J., Arkat, J., Barzinpour, F., Modelling the effects of machine
Technol, 39, pp. 838-850;
Sh, A., Ismail, N., Tang, S.H., Ariffin, M.K.A.M., Firoozi, Z., A stochastic
facility layout model in cellular manufacturing systems (2011) Int J Phys Sci, 6,
pp. 3666-3670;
Sh, A., Ismail, N., Tang, S.H., Ariffin, M.K.A.M., Firoozi, Z., The reconfiguration
issue of stochastic facility layout design in cellular manufacturing systems (2012)
Int J Serv Oper Manag, 11, pp. 255-266;
Arkat, J., Naseri, F., Ahmadizar, F., A stochastic model for the generalized cell
formation problem considering machine reliability (2011) Int J Comput Integr Manuf,
24, pp. 1095-1102;
(2005) Int J Prod Res, 43, pp. 1587-1605;
(2011) Comput Ind Eng, 60, pp. 7-15;
Cruz, F.R.B., Van Woensel, T., Smith, J.M.G., Buffer and throughput trade-offs in
M/G/1/K queuing networks: A bi-criteria approach (2010) Int J Production Econom,
125, pp. 224-234;
Eberhart, R., Kennedy, J., (1995) A new optimizer using particle swarm theory, pp.
39-43., The sixth international symposium on micro machine and human science,
Nagoya;
Egilmez, G., Suer, G.A., Stochastic cell loading, family and job sequencing in a
cellular manufacturing environment (2011) The 41st International Conference on
Computers & Industrial Engineering, pp. 199-204., Los Angeles;
Egilmez, G., Suer, G.A., Stochastic manpower allocation and cell loading in
cellular manufacturing systems (2011) The 41st International Conference on
Computers & Industrial Engineering, pp. 193-198., Los Angeles;
Egilmez, G., Suer, G.A., The impact of risk on the integrated cellular design and
control (2014) Int J Prod Res, 52, pp. 1455-1478;
Egilmez, G., Suer, G.A., Huang, J., Stochastic cellular manufacturing system design
subject to maximum acceptable risk level (2012) Comput Ind Eng, 63, pp. 842-854;
Fardis, F., Zandi, A., Ghezavati, V.R., Stochastic extension of cellular
manufacturing systems: A queuing-based analysis (2013) J Ind Eng Int, 9, pp. 1-8;
Frederick, G.J.L., HillIer, S., (2001) Introduction to Operations Research, ,
McGraw-Hill, New York;
Ghezavati, V.R., A new stochastic mixed integer programming to design integrated
cellular manufacturing system: A supply chain framework (2011) Int J Ind Eng
Comput, 2, pp. 563-574;
Ghezavati, V.R., Saidi-Mehrabad, M., Designing integrated cellular manufacturing
Ghezavati, V.R., Saidi-Mehrabad, M., An efficient hybrid selflearning method for
Syst Appl, 38, pp. 1326-1335;
Jayakumar, V., Raju, R., A multi-objective genetic algorithm approach to the
probabilistic manufacturing cell formation problem (2011) S Afr J Ind Eng, 22, pp.
199-212;
Kennedy, J., Eberhart, R., (1995) Particle swarm optimization, pp. 1942-1948.,
Neural Networks IV, Perth;
Review and extension (1982) Int J Production Res, 20, pp. 117-133;
Madhusudanan Pillai, V., Chandrasekharan, M.P., (2010) Manufacturing cell formation
under probabilistic product mix, pp. 580-584., Int Conf Ind Eng Eng Manag (IEEM)
Macao;
Rabbani, M., Jolai, F., Manavizadeh, N., Radmehr, F., Javadi, B., Solving a bi-
objective cell formation problem with stochastic production quantities by a two-
phase fuzzy linear programming approach (2012) Int J Adv Manuf Technol, 58, pp.
709-722;
Rao, R.V., Advanced Modeling and Optimization of Manufacturing Processes (2011)
Springer-Verlag, London Safaei N, Saidi-Mehrabad M, Jabal-Ameli MS (2008) A hybrid
simulated annealing for solving an extended model of dynamic cellular manufacturing
system. Eur J Oper Res, 185, pp. 563-592;
Saidi-Mehrabad, M., Ghezavati, V.R., Designing Cellular Manufacturing Systems under
Uncertainty (2009) J Uncertain Syst, 3, pp. 315-320;
Seifoddini, H., A Probabilistic Model for Machine Cell Formation (1990) J Manuf
Syst, 9, pp. 69-75;
Singh, N., Rajamani, D., (1996) Cellular manufacturing systems: Design, planning
and control, , 1st edn. Chapman and Hall, India;
Appl Math Comput, 184, pp. 721-728
CORRESPONDENCE ADDRESS: Fattahi, P.; Faculty of Industrial Engineering, Bu-Ali Sina
UniversityIran; email: [email protected]
ISSN: 17355702
SOURCE: Scopus
Jayakumar, V., Raju, R.

36548490500;35148451300;
A multi-objective genetic algorithm approach to the probabilistic manufacturing
(2011) South African Journal of Industrial Engineering, 22 (1), pp. 199-212. Cited
3 times.
https://www.scopus.com/inward/record.uri?eid=2-s2.0-79955870949&doi=10.7166%2f22-1-
43&partnerID=40&md5=baf5e1537e07b3255a528d0b946808af
DOI: 10.7166/22-1-43
AFFILIATIONS: School of Mechanical and Building Sciences, VIT University, India;
Department of Industrial Engineering, Anna University, Chennai, India
ABSTRACT: Due to customised products, shorter product life-cycles, and
unpredictable patterns of demand, manufacturing industries are faced with
stochastic production requirements. It is unlikely that the production requirements
(product mix and demand) are known exactly at the time of designing the
manufacturing cell. However, a set of possible production requirements (scenarios)
with certain probabilities are known at the design stage. Though a large number of
research works on manufacturing cells have been reported, very few have considered
random product mix constraints at the design stage. This paper presents a nonlinear
mixed-integer mathematical model for the cell formation problem with the
uncertainty of the product mix for a single period. The model incorporates real-
life parameters like alternate routing, operation sequence, duplicate machines,
uncertain product mix, uncertain product demand, varying batch size, processing
time, machine capacity, and various cost factors. A solution methodology for best
possible cell formation using a genetic algorithm (GA) is presented, and the
computational procedure is illustrated for the case study undertaken.
REFERENCES: Wemmerlov, U., Johnson, D.J., Cellular manufacturing at 46 user plants:
Huber, V., Hyer, N., The human impact of cellular manufacturing (1985) Journal of
Dale, B.G., (1999) Handbook of cellular manufacturing, , John Wiley and Sons, USA;
Wemmerlov, U., Hyer, N., Procedures for the part family/machine group
European Journal of Operations Research, 69, pp. 284-291;
Reisman, A., Kumar, A., Motwai, J., Cheng, C., Cellular manufacturing: A
pp. 508-535;
Selim, H., Askin, R.G., Vakharia, A.J., Cell formation in group technology: Review,
evaluation and directions for future research (1998) Computers and Industrial
Sarkar, B., Mondal, S., Grouping efficiency measures in cellular manufacturing: A
pp. 285-314;
Research, 38, pp. 1201-1218;
373-383;
Harahalakis, G., Nagi, R., Proth, J., Manufacturing cell formation under random
product demand (1994) International Journal of Production Research, 32, pp. 47-64;
109-128;
Wicks, E.M., Resors, D.J., Designing cellular manufacturing systems with dynamic
Mungwatanna, A., (2000) Design of cellular manufacturing systems for dynamic and
uncertain production requirement with presence of routing flexibility, , PhD
dissertation, Blacksburg State University, Virginia;
demand changes (2007) Computers and Industrial Engineering, 53, pp. 478-490;
environment using tabu search (2004) Computers and Industrial Engineering, 46, pp.
571-582;
Ioannou, G., Time-phased creation of hybrid manufacturing systems (2006)
Venugopal, V., Narendaran, T.T., A genetic algorithm approach to the machine-
Gupta, Y.P., Gupta, M.C., Kumar, A., Sundram, C., A genetic algorithm based
approach to cell composition and layout design problems (1996) International
Hu, G.H., Chen, Y.P., Zhou, Z.D., Fang, H.C., A genetic algorithm for the inter-
cell layout and material handling system design (2006) International Journal of
systems (2001) International Journal of Production Research, 32, pp. 185-207;
Suer, G.A., Vazquez, R., Cortes, M., A hybrid approach to genetic algorithms and
local optimizers in cell loading (2005) Computers and Industrial Engineering, 48,
pp. 625-641;
Tariq, A., Hussain, I., Ghafoor, A., A hybrid genetic algorithm for machinepart
Holland, J.H., (1975) Adaptation in natural and artificial systems, , University of
Goldberg, D.E., (1989) Genetic algorithms in search, optimization and machine
learning, , Addison-Wesley, Boston;
annealing (2008) Journal of Operations Research Society, 59, pp. 443-454;
Rosenblatt, M., Kropp, D., The single period stochastic plant layout problem (1992)
IIE Transactions, 24, pp. 169-176
CORRESPONDENCE ADDRESS: Jayakumar, V.; School of Mechanical and Building Sciences,
VIT UniversityIndia; email: [email protected]
PUBLISHER: South African Institute of Industrial Engineering
ISSN: 1012277X
ABBREVIATED SOURCE TITLE: South Afr. J. Ind. Eng.
SOURCE: Scopus
Sarayloo, F., Tavakkoli-Moghaddam, R.

36599307100;56491438400;
Imperialistic competitive algorithm for solving a dynamic cell formation problem
with production planning
3-642-14922-1_34&partnerID=40&md5=72a493ed6b801103616840071df81bbc
DOI: 10.1007/978-3-642-14922-1_34
AFFILIATIONS: Department of Industrial Engineering, Graduate School Islamic Azad
University, South Tehran Branch, Tehran, Iran;
Iran
ABSTRACT: Cellular manufacturing system, an application of group technology, has
been considered as an effective way to obtain productivity in a factory. For design
of manufacturing cells, several mathematical models and various algorithms have
been proposed in literature. However, most of algorithms and models have more or
fewer drawbacks. A dynamic cell formation problem with production planning is
considered in this paper, where the sum of costs consisting constant machine costs,
variable machine costs, intra-inter movement costs, production planning costs and
reconfiguration costs is to be minimized. Because this type of problem is Np-hard,
evolutionary algorithms are applied. In this paper the Imperialistic Competitive
Algorithm (ICA), which optimizes inspired by imperialistic competition, is used.
ICA is compared with other well-known evolutionary algorithms, i.e. genetic
algorithm (GA) and particle swarm optimization (PSO), to show its efficiency. The
computational results show the considerable superiority of ICA compared with PSO
and GA. © 2010 Springer-Verlag Berlin Heidelberg.
AUTHOR KEYWORDS: Cellular manufacturing; Evolutionary Algorithm; Imperialistic
Competitive Algorithm; Production Planning
INDEX KEYWORDS: Cellular manufacturing systems; Competitive algorithms;
Computational results; Dynamic cell formation; Its efficiencies; Machine costs;
Manufacturing cells; NP-hard; Production Planning; Production planning IS;
Production-planning costs; Reconfiguration costs, Cellular manufacturing;
Computation theory; Computational efficiency; Costs; Flexible manufacturing
systems; Group technology; Independent component analysis; Intelligent computing;
Mathematical models; Particle swarm optimization (PSO); Planning; Production
control; Production engineering; Project management, Genetic algorithms
Management, , Kluwer-Nijhoff, Boston;
Burbidge, J.L., (1979) Group Technology in Engineering Industry;
problems with consideration of multiple production factors (2009) Int. J. Adv.
Manuf. Technol., pp. 1201-1213;
Asking, R.G., Estrada, S., Investigation of cellular manufacturing practices (1999)
Hand Book of Cellular Manufacturing Systems, pp. 25-34., ch. 1, John Wiley, New
York;
Aramoon-Bajestani, M., Rabbani, M., Rahimi-Vahed, A.R., Khoshkhou, B.G., A multi
Operation Research, 36, pp. 777-794;
http://www.swarmintelligence.org; Safaei, N., Tavakkoli-Moghaddam, R., Integrated
multi-period cell formation and subcontracting production planning in dynamic
cellular manufacturing systems (2009) Int. J. Production Economics, pp. 301-314;
Atashpaz, G.E., Lucas, C., Imperialist competitive algorithm: An algorithm for
optimization inspired by imperialistic competition (2007) IEEE Congress on
Evolutionary Computation CEC 2007, pp. 4661-4667
CORRESPONDENCE ADDRESS: Sarayloo, F.; Department of Industrial Engineering,
Graduate School Islamic Azad University, South Tehran Branch, Tehran, Iran; email:
[email protected]
ISSN: 03029743
ISBN: 3642149219; 9783642149214
SOURCE: Scopus
Defersha, F.M., Chen, M.

14035061800;55584802279;
A parallel multiple Markov chain simulated annealing for multi-period manufacturing
cell formation problems
43249111787&doi=10.1007%2fs00170-007-0947-
6&partnerID=40&md5=10a58c81b1c2eda03abe4305f71a47ef
DOI: 10.1007/s00170-007-0947-6
AFFILIATIONS: Department of Mechanical and Industrial Engineering, Concordia
University, 1455 Maisonneuve West Montreal, Quebec, H3G 1M8, Canada
ABSTRACT: Simulated annealing (SA) is a general purpose optimization technique
capable of finding optimal or near optimal solutions in various applications. The
major disadvantage of this technique is its slow convergence making it not suitable
for solving many complex optimization problems. This limitation may be alleviated
by parallel computing using a multiprocessor computer or a cluster of workstations.
In this paper, we present an integer programming model for solving a multi-period
cell formation problem in cellular manufacturing system. In order to solve the
mathematical model efficiently, we developed a multiple Markov chain simulated
annealing algorithm which allows multiple search directions to be traced
simultaneously. Our computational results on a single processor machine showed that
multiple Markov chain SA is much more efficient than a conventional single Markov
chain SA. The parallel implementation of the multiple Markov chain SA further
improves its computational efficiency in terms of solution quality and execution
time. © 2007 Springer-Verlag London Limited.
AUTHOR KEYWORDS: Cellular manufacturing; Integer programming; Multiple Markov
chain simulated annealing; Parallel computing
INDEX KEYWORDS: Cellular manufacturing; Computer workstations; Convergence of
numerical methods; Integer programming; Markov processes; Parallel processing
systems, Multi-period cell formation; Multiple Markov chain simulated annealing;
Multiprocessor computers; Optimization problems, Simulated annealing
REFERENCES: Akturk, M.S., Turkcan, A., Cellular manufacturing system design using a
holonistic approach (2000) Int J Prod Res, 38, pp. 2327-2347;
Smj, A., Abbasi, B., Applying simulated annealing to cellular manufacturing system
design Int J Adv Manuf Technol, , in press;
manufacturing systems using non-traditional optimisation techniques-a comparative
study (2001) Integr Manuf Sys, 18, pp. 140-147;
Azencott, R., Azencott, R., Parallel simulated annealing: An overview of basic
techniques (1992) Simulated Annealing: Parallelization Techniques, pp. 25-35.,
Wiley New York;
Azencott, R., Azencott, R., Sequential simulatd annealing: Speed of convergence and
acceleration techniques (1992) Simulated Annealing: Parallelization Techniques, pp.
1-9., Wiley New York;
Azizi, N., Zolfaghari, S., Adaptive temperature control for simulated annealing: A
comparative study (2004) Comput Oper Res, 31, pp. 2439-2445;
planning horizons (2005) J Manuf Technol Manage, 16, pp. 516-530;
Balakrishnan, J., Cheng, C., Multi-period planning and uncertainty issues in
cellular manufacturing: A review and future directions (2007) Eur J Oper Res, 177,
pp. 281-309;
coefficients and a parallel genetic tsp algorithm: Formulation and comparison
(1995) Math Comput Model, 21, pp. 61-73., 12;
Baxter, F., Information technology and global changing science (1990) Conference on
Global Change: Economic Issues in Agriculture, Forestry and Natural Resources, ,
Washington D.C., 19-21 November 1990;
Baykasoglu, A., Gindy, N., Mocacef 1.0: Capability based approach to form part-
machine groups for cellular manufacturing applications (2000) Int J Prod Res, 38,
pp. 1133-1161;
(2001) Int Manuf Sys, 12, pp. 258-274;
problems with fixed cell cost (2004) Comput Oper Res, 31, pp. 21-37;
Econ, 64, pp. 179-284;
Chaudhry, S.S., Luo, W., Application of genetic algorithms in production and
operations management: A review (2005) Int J Prod Res, 43, pp. 4083-4101;
cellular manufacturing environment (1998) Annals Oper Res, 74, pp. 109-128;
Cheng, C.H., Goh, C.H., Lee, A., Solving the generalized machine assignment problem
in group technology (1996) J Oper Res Soc, 47, pp. 794-802;
Chiang, T.S., Chow, Y., On the convergence rate of annealing processes (1988) SIAM
J Control Optim, 26, pp. 1455-1470;
Deutsch, C.V., Wen, X.H., An improved perturbation mechanism for simulated
annealing simulation (1998) Math Geol, 30, pp. 801-816;
Benders' decomposition approach (1998) Eur J Oper Res, 107, pp. 175-192;
Jayaswaly, S., Adilz, G., Efficient algorithm for cell formation with sequence
42, pp. 2419-2433;
Kirkpatrick, S., Gelatt, C., Vecchi, M., Optimization by simulated annealing (1983)
Science, 220, pp. 671-680;
Kratica, J., Tosiæ, D., Filipoviæ, V., Ljubiæ, I., Solving the simple plant
location problem by genetic algorithms (2001) RAIRO-Oper Res, 35, pp. 127-142;
561-569;
Lee, S.-Y., Lee, K.G., Synchronous and asynchronous parallel simulated annealing
with multiple markov chains (1996) IEEE Trans Parallel Distrib Sys, 7, pp. 903-
1007;
approaches to multi-criteria cell design (2000) Int J Prod Res, 38, pp. 1201-1218;
Meise, C., On the convergence of parallel simulated annealing (1998) Stoch Process
Their Appl, 76, pp. 99-115;
of state calculations by fast computing machines (1953) J Chem Phys, 21, pp. 1087-
1092;
Uncertain Production Requirements with Presence of Routing Flexibility, , Ph.D.
thesis, Virginia Polytechnic Institute and State University, Blackburg, VA;
systems (2001) Comput Ind Eng, 39, pp. 125-144;
certain constraints (2000) Int J Prod Econ, 64, pp. 267-278;
Saidi-Mehrabad, N., Safaei, N., A new model of dynamic cell formation by a neural
approach (2006) Int J Adv Manuf Technol, , Online First (DOI 10.1007/s00170-006-
0518-2);
Selim, H.M., Askin, R.G., Vakharia, A.J., Cell formation in groupt technology:
2-30;
Singh, N., Design of cellular manufacturing systems: An invited review (1993) Eur J
Oper Res, 69, pp. 284-291;
Singh, N., (1996) Systems Approach to Computer-Integrated Design and Manufacturing,
, Wiley New York;
1419-1441;
Su, C.-T., Hsu, C.-M., Multi-objective machine-part cell formation through parallel
simulated annealing (1998) Int J Prod Res, 36, pp. 2185-2207;
Sule, D.R., (1994) Manufacturing Facilities: Location, Planning, and Design, , PWS
Publ. Co Boston, MA;
Taboun, S., Merchawi, N., Ulger, T., Part family and machine cell formation in
multi-period planning horizons of cellular manufacturing systems (1998) Prod Plan
Control, 9, pp. 561-571;
pp. 761-780;
algorithms (2005) Lect Notes Comput Sci, 3777, pp. 213-227;
layout problems under variable demand in cellular manufacturing (2001) Comput Ind,
46, pp. 181-188;
Wemmerlöv, U., Hyer, N.L., Procedures for part-family/machine group identification
problem in cellular manufacturing (1986) J Oper Manage, 6, pp. 125-145;
pp. 29-49;
part populations (1999) IIE Trans, 31, pp. 11-20;
434-446;
Youhua, W., Weili, Y., Adaptive simulated annealing for the optimal design of
electromagnetic devices (1996) IEEE Trans Magn, 32, pp. 1214-1217;
Zhao, C., Zhiming, W., A genetic algorithm for manufacturing cell formation with
multiple routes and multiple objectives (2000) Int J Prod Res, 38, pp. 385-395
CORRESPONDENCE ADDRESS: Chen, M.; Department of Mechanical and Industrial
Engineering, Concordia University, 1455 Maisonneuve West Montreal, Quebec, H3G 1M8,
Canada; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Mahesh, O., Srinivasan, G.

56619196000;36136249100;
Pilot cell formation problem to minimize total work content
(2003) International Journal of Industrial Engineering : Theory Applications and
Practice, 10 (3), pp. 298-307. Cited 1 time.
0345549413&partnerID=40&md5=1f27165a29f909ae83e6893ef3a405c0
AFFILIATIONS: Department of Mechanical Engineering, N.B.K.R. Inst. of
Sci./Technology, Vidyanagar-524413, India;
Industrial Engineering Division, Department of Humanities, Indian Inst. of
Technology, Madras, Chennai - 600036, India
ABSTRACT: In Group Technology (GT) literature, there exist many algorithms for cell
formation. All these algorithms assume that the conversion of job shop to cellular
manufacturing (CM) is performed comprehensively rather than incrementally. In other
words, all the academic studies done so far look at CM in terms of total number of
products to be made and the total number of machines or machine types available (or
needed), and try to plan a conversion of the entire shop into cells, possibly
keeping a remainder cell. But planning and implementation of most cell conversions
in industry are incremental (or sequential) ones, not comprehensive. To address
this issue, incremental cell formation problem is addressed with an objective of
minimization of total work content. The first step in incremental cell formation is
the formation of pilot cell. In this paper a mathematical model for pilot cell
formation is developed. Two heuristics are proposed for solving this problem and
their performance is tested over several data sets.
AUTHOR KEYWORDS: Cellular manufacturing; Equivalent part of a part family; Group
technology; Heuristics; Incremental cell; Pilot cell; Total work content
INDEX KEYWORDS: Algorithms; C (programming language); Cellular manufacturing;
Computer workstations; Group technology; Heuristic methods; Machine components;
Mathematical models; Product development, Incremental cell; Pilot cell, Industrial
engineering
REFERENCES: Chandrasekharan, M.P., Rajagopalan, R., ZODIAC - An algorithm for
concurrent formation of part families and machine cells (1987) International
Gupta, T., Seifoddini, H., Production databased similarity coefficient for machine
component grouping decisions in the design of cellular manufacturing systems (1990)
research presumptions with practice (1999) International Journal of Production
Research, 37, pp. 3119-3138;
Nair, G., Jayakrishnan, Narendran, T.T., ACCORD: A bi-criterion algorithm for cell
for group technology (1991) International Journal of Production Research, 29, pp.
463-478;
Thomopoulos, N.T., Mixed model line balancing with smoothed assignments (1970)
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the US: A survey of users
CORRESPONDENCE ADDRESS: Srinivasan, G.; Industrial Engineering Division, Department
of Humanities, Indian Inst. of Technology, Madras, Chennai - 600036, India; email:
[email protected]
ISSN: 10724761
CODEN: IJIEF
ABBREVIATED SOURCE TITLE: Int J Ind Eng Theory Appl Pract
SOURCE: Scopus
Lin, T.L.I., Dessouky, M.M., Ravi Kumar, K., Shu Ming, N.G.
36822536800;7005350906;57192126402;55237123100;
A heuristic-based procedure for the weighted production-cell formation problem
(1996) IIE Transactions (Institute of Industrial Engineers), 28 (7), pp. 579-589.
Cited 20 times.
0030196743&doi=10.1080%2f15458830.1996.11770702&partnerID=40&md5=68a7c7eb1f759d8071
5f1e719afd5bad
DOI: 10.1080/15458830.1996.11770702
AFFILIATIONS: Department of Industrial and Systems Engineering, University of
Southern California, Los Angeles, CA 90089-0193, United States;
Department of Information and Operations Management, School of Business
Administration, University of Southern California, Los Angeles, CA 90089-1421,
United States;
Department of Management, Hong Kong University of Science and Technology, Hong
Kong, Hong Kong
ABSTRACT: A key issue in the design of a cellular manufacturing system is the
formation of the machines and parts into groups or production cells. The production
cells are designed to minimize the costs of inter-cell part movements and intra-
cell processing, while balancing the workload within each cell. Most of the prior
research represents the cell formation problem as a binary machine-part incidence
matrix. The workload balance within each production cell can be precisely
calculated only if the processing times and demand rates are included in the
analysis. For this reason, a heuristic-based procedure that uses processing times
and demand rates to form the production cells is proposed. The procedure considers
the cell imbalance costs as well as the costs associated with the inter-cell part
movements and intra-cell processing. The efficiency and effectiveness of the
heuristic is compared with other methods, and an industrial application of the
proposed heuristic is presented. ©1996 "IIE".
INDEX KEYWORDS: Cost effectiveness; Design; Efficiency; Heuristic methods; Matrix
algebra; Production engineering, Production cell formation, Manufacture
REFERENCES: Anderson, V.L., McLean, R.A., (1974) Design of Experiments, Marcel
Dekker, New York.;
Askin, R.G., Vakharia, A.J., (1990) Group Technology - Cell Formation and
Operation, in the Automated Factory Handbook: Technology and Management, Cleland,
D.I. and Bidanda, B. (Eds.), TAB Books, New York, 317-366.;
configuration (1987) International Journal of Produc Tion Research, , 25, 101-113;
International Journal of Production Research, , 29, 1081-1100;
Burbidge, J.L., (1989) Production Flow Analysis-for Planning Group Technology,
Oxford Science Publications.;
cellular manufacture (1982) Journal of Manufacturing Systems, , 1, 65-75;
Research, , 24, 1221-1233;
formation of part-families and machinecells (1987) International Journal of
Production Research, , 25, 835-850;
Production Research, , 27, 1035-1052;
King, J.R., Nakomchai, V., Machine-component group formation in group technology:
Review and extension (1982) International Journal of Production Research, , 20,
117-133;
Kniskal, J.B., On the shortest spanning subtree of a graph and the traveling
salesman problem (1956) Proceedings of the AMS, 48-50.;
manufacturing (1987) International Journal of Production Research, , 25, 1715-1728;
manufacturing systems (1986) European Journal of Operations Research, , 24, 387-
397;
Kusiak, A., The generalized p-median problem (1987) Working Paper No., , 20/87,
Department of Mechanical and Industrial Engineering, University of Manitoba,
Winnipeg, Canada;
Kusiak, A., (1990) Intelligent Manufacturing Systems, Prentice Hall, Englewood
Cliffs, NJ, 209-239.;
Journal of Manufacturing Systems, , 6, 117124;
Kusiak, A., Vannelli, A., Kumar, K.R., Grouping problem in scheduling flexible
manufacturing systems (1985) Robotica, , 3, 245-252;
Macaskill, J.L., Production-line balances for mix-model lines (1972) Management
Science, , 19, 423-434;
reorganization by a clustering technique (1972) Operations Research, , 20, 993-
1009;
Moily, J.P., Stinson, J.P., Vakharia, A.J., Implementation of logical cells: A
simulation study (1992) Working Paper, Department of Management Information
Systems, University of Arizona, Tucson.;
technology clustering problem (1985) Omega, 13,577-579.;
Ng, S.M., A new spanning tree algorithm for group technology problems (1989)
Working Paper, Department of Industrial and Systems Engineering, University of
Southern California, Los Angeles.;
Ng, S.M., Lin, T.L., (1993) On the Effectiveness of the Measures in Group
Technology, Working Paper, Department of Industrial and Systems Engineering,
University of Southern California, Los Angeles.;
Oliva-Lopez, E., Purcheck, G.F., Load balancing for group technology planning and
control (1979) International Journal of Machine Tool Design and Research, , 19,
259-274;
Purcheck, G.F., A linear programming method for the combinatoric grouping of an
incomplete power set (1975) Journal of Cybernetics, , 5, 51-76;
Seiffodini, H., Single linkage vs. average linkage clustering in machine cells
formation applications (1989) Computers and Industrial Engineering, , 16, 419-426;
Seiffodini, H., Wolfe, P.M., Application of similarity coefficient method in group
technology (1986) HE Transactions, , 18, 271-277;
Slagle, J.L., Chang, C.L., Heller, S.R., A clustering and data reorganization
algorithm (1975) IEEE Transactions on SMC, , 5, 125-128;
and Production Economics, , 9, 73-81;
Thomopoulos, N.T., Line balancing - Sequencing for mixedmodel assembly (1967)
Management Science, , 19(2), B-59-B-75;
Thomopoulos, N.T., Mixed-model line balancing with smoothed station assignments
(1970) Management Science, , 16, 593-603;
Vakharia, A.J., Methods of cell formation in group technology: A framework for
evaluation (1986) Journal of Operations Management, , 6, 257-27'1;
, 24, 909-930;
Vakharia, A.J., Wemmerlov, U., (1987) A Generalized Methodology for Formation of
Manufacturing Cells, in Decision Sciences Institute Annual Conference Proceedings,
Decision Sciences Institute, Atlanta, G A, 799-801.;
, 24, 387-400;
Wemmerlov, U., Hyer, N.L., Procedures for the part family/ machine group
Management, , 6, 125-148;
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the U (1989) S. Industry: A
Survey of Users. International Journal of Production Research, , 27, 1511-1530
CORRESPONDENCE ADDRESS: Lin, T.L.I.; Department of Industrial and Systems
Engineering, University of Southern California, Los Angeles, CA 90089-0193, United
States
PUBLISHER: Springer Netherlands
ISSN: 0740817X
CODEN: IIETD
ABBREVIATED SOURCE TITLE: IIE Trans
SOURCE: Scopus
Kong, T., Seong, K., Song, K., Lee, K.

57205499889;57203150850;56514466600;55776917700;
Two-mode modularity clustering of parts and activities for cell formation problems
(2018) Computers and Operations Research, 100, pp. 77-88. Cited 2 times.
85050687979&doi=10.1016%2fj.cor.2018.06.018&partnerID=40&md5=428145c9cbb5d5886698b8
f14de6a769
DOI: 10.1016/j.cor.2018.06.018
AFFILIATIONS: H. Milton Stewart School of Industrial & Systems Engineering, Georgia
Institute of Technology, Atlanta, United States;
Industrial Engineering, Hanyang University, Seoul, South Korea
ABSTRACT: Cell formation in cellular manufacturing is a critical step to improving
productivity by grouping parts and machines. Numerous heuristic search algorithms
and several performance measures have been used in finding an effective cell
formation solution. It is still a challenging task to find a good cell formation
that satisfies several performance measures. Clustering approaches aim to find good
clusters of parts and machines according to their own similarity measures. We
propose a two-mode modularity clustering method with new similarity measures for
parts and machines using an ordinal part-machine matrix. The proposed method
considers both incidence and transition among parts and machines and can find an
optimal number of clusters. We demonstrate the effectiveness of the proposed method
using cell formation problems in comparison with a few existing ones. The result
shows that the proposed method produces good cell formation solutions in terms of
several performance measures. In addition, we show a possible application area of
the proposed method in process mining, using it to find interpretable clusters of
processes and activities from real-life event log data. © 2018 Elsevier Ltd
AUTHOR KEYWORDS: Cell formation; Clustering; Modularity; Ordinal data;
Performance measure
INDEX KEYWORDS: Cells; Cytology; Heuristic algorithms, Cell formation; Clustering;
Modularity; Ordinal data; Performance measure, Cellular manufacturing
formation of manufacturing cells (2005) Comput. Ind. Eng., 48 (1), pp. 3-21;
Chattopadhyay, M., Chattopadhyay, S., Dan, P.K., Machine–part cell formation
through visual decipherable clustering of self-organizing map (2011) Int. J. Adv.
Manuf. Technol., 52 (9-12), pp. 1019-1030;
Costa, A., Milp formulations for the modularity density maximization problem (2015)
Eur. J. Oper. Res., 245 (1), pp. 14-21;
manufacturing optimization: problems, solutions, and comparisons (2000) IEEE Trans.
Evol. Comput., 4 (2), pp. 93-113;
Dixit, A., Mishra, P., Heuristic based approach of cell formation considering
operation sequences (2007) International Conference of Manufacturing Engineering
and Engineering Management, 2, pp. 1101-1107;
Fortunato, S., Barthelemy, M., Resolution limit in community detection (2007) Proc.
Nat. Acad. Sci., 104 (1), pp. 36-41;
Good, B.H., de Montjoye, Y.-A., Clauset, A., Performance of modularity maximization
in practical contexts (2010) Phys. Rev. E, 81 (4), p. 046106;
Harhalakis, G., Nagi, R., Proth, J., An efficient heuristic in manufacturing cell
formation for group technology applications (1990) Int. J. Prod. Res., 28 (1), pp.
185-198;
Kaveh, F., Ramin, S., A mathematical model for cell formation in CMS using sequence
data (2008) J. Ind. Syst. Eng., 2 (2), pp. 144-153;
Lee, K., Ahn, K.-I., Gt efficacy: a performance measure for cell formation with
sequence data (2013) Int. J. Prod. Res., 51 (20), pp. 6070-6081;
Li, Z., Zhang, S., Wang, R.-S., Zhang, X.-S., Chen, L., Quantitative function for
community detection (2008) Phys. Rev. E, 77, p. 036109;
Mahdavi, I., Mahadevan, B., Class: an algorithm for cellular manufacturing system
and layout design using sequence data (2008) Robot Comput. Integr. Manuf., 24 (3),
pp. 488-497;
the formation of cellular manufacturing systems (2010) Int. J. Prod. Res., 48 (10),
pp. 3029-3060;
Nair, G.J., Narendran, T., Case: a clustering algorithm for cell formation with
Nair, G.J., Narendran, T., Case: a clustering algorithm for cell formation with
Newman, M.E., Modularity and community structure in networks (2006) Proc. Nat.
Acad. Sci., 103 (23), pp. 8577-8582;
P Chandrasekharan, M., Rajagopalan, R., An ideal seed non-hierarchical clustering
algorithm for cellular manufacturing (1986) Int. J. Prod. Res., 24 (2), pp. 451-
463;
using neural networks (2009) Comput. Ind. Eng., 56 (4), pp. 1340-1347;
Park, H., Lee, K., Dependence clustering, a method revealing community structure
with group dependence (2014) Knowl. Based Syst., 60, pp. 58-72;
Park, S., Suresh, N., Performance of fuzzy art neural network and hierarchical
clustering for part-machine grouping based on operation sequences (2003) Int. J.
Prod. Res., 41 (14), pp. 3185-3216;
Santiago, R., Lamb, L.C., Efficient modularity density heuristics for large graphs
(2017) Eur. J. Oper. Res., 258 (3), pp. 844-865;
Suresh Kumar, C., Chandrasekharan, M., Grouping efficacy: a quantitative criterion
Int. J. Prod. Res., 28 (2), pp. 233-243;
Teymourian, E., Mahdavi, I., Kayvanfar, V., A new cell formation model using
sequence data and handling cost factors (2011) International Conference on
Industrial Engineering and Operations Management, pp. 22-24;
cell formation problem (2009) Int. J. Prod. Res., 47 (7), pp. 1989-2007;
van der Aalst, W.M., van Dongen, B.F., Günther, C.W., Mans, R., De Medeiros, A.A.,
Rozinat, A., Rubin, V., Weijters, A., Prom 4.0: comprehensive support for real
process analysis (2007) International Conference on Application and Theory of Petri
Nets, pp. 484-494., Springer;
algorithm for the cell formation problem with alternative routings (2005) J.
Intell. Manuf., 16 (2), pp. 189-205;
in cellular manufacturing (2001) Comput. Ind. Eng., 39 (1), pp. 1-17
CORRESPONDENCE ADDRESS: Lee, K.; Industrial Engineering, Hanyang UniversitySouth
Korea; email: [email protected]
ISSN: 03050548
CODEN: CMORA
SOURCE: Scopus
Karoum, B., Elbenani, B.

57188978487;36147113000;
A hybrid clonal algorithm for the cell formation problem with variant number of
cells
(2017) Production Engineering, 11 (1), pp. 19-28. Cited 4 times.
84997766071&doi=10.1007%2fs11740-016-0706-
3&partnerID=40&md5=cb201159a477d8a7b31cca43f2c117f9
DOI: 10.1007/s11740-016-0706-3
ABSTRACT: Cellular manufacturing is an important application of the Group
Technology that has been used in several real-world applications such as the
electronics industry, offices, structural fabrication, service industries, and
hospitals. The manufacturing cell formation problem is considered the first issue
faced in designing cellular manufacturing systems in order to overcome difficulties
related to multi-product and batch-production systems. The aim is to minimize the
inter-cell movements of the parts and maximize the use of the machines. In this
paper, a new approach based on the clonal selection algorithm is proposed for
solving the problem where the number of cells is not fixed a priori. The approach
integrates a local search mechanism to intensify the search of the solutions. To
evaluate the effectiveness of the proposed algorithm, a set of 40 benchmark
problems is used; the results are then compared to other methods recently
developed. The results show that the proposed algorithm performs very well on all
test problems since it can reach the best-known solution of 39 benchmark problems
(97.5%). © 2016, German Academic Society for Production Engineering (WGP).
AUTHOR KEYWORDS: Affinity; Cell formation; Cellular manufacturing; Clonal
selection; Grouping efficacy; Local search
INDEX KEYWORDS: Benchmarking; Cells; Clone cells; Cytology; Electronics industry;
Group technology; Local search (optimization); Manufacture; Problem solving;
Product design, Affinity; Cell formation; Clonal selection; Grouping efficacy;
Local search, Cellular manufacturing
REFERENCES: Wemmerlov, U., Hyer, N.L., Procedures for the part family/machine group
identification problem in cellular manufacturing (1986) J Oper Manag, 6, pp. 125-
147;
Dinis-Carvalho, J., Alves, A.C., Sousa, R.M., Moving from job-shop to production
cells without losing flexibility: a case study from the wooden frames industry
(2014) S Afr J Ind Eng, 25, pp. 212-225;
Hung, K.-T., Maleki, H., Applying group technology to the forging industry (2014)
Prod Plan Control Manag Oper, 25, pp. 134-148;
Johnson, D.J., Wemmerlv, U., Why does cell implementation stop? Factors influencing
cell penetration in manufacturing plants (2004) Prod Oper Manag, 13, pp. 272-289;
Pattanaik, L.N., Sharma, B.P., Implementing lean manufacturing with cellular
layout: a case study (2008) Int J Adv Manuf Technol, 42, pp. 772-779;
Shayan, E., Sobhanallahi, A., Productivity gains by cellular manufacturing (2002)
Prod Plan Control, 13, pp. 507-516;
Levasseur, G.A., Helms, M.M., Zink, A.A., A conversion from a functional to a
cellular manufacturing layout at Steward, Inc (1995) Prod Invent Manag J, 36, pp.
37-42;
Landsbergis, P.A., Cahill, J., Schnall, P., The impact of lean production and
related new systems of work organization on worker health (1999) J Occup Health
Psychol, 4, pp. 108-130;
Evolut Comput, 4, pp. 93-113;
the cell formation problem (2007) Comput Oper Res, 34, pp. 2059-2079;
Top, 20, pp. 679-706;
makespan criterion (2013) Int J Prod Econ, 141, pp. 639-645;
algorithm with variable neighbourhood (2011) Eur J Ind Eng, 5, pp. 22-42;
neighbourhood search to solve the cell formation problem (2012) Expert Syst Appl,
39, pp. 2408-2414;
the manufacturing cell formation problem based on grouping efficacy (2015) Int J
Karoum, B., Elbenani, B., El Imrani, A.A., El Oualkadi, A., Clonal selection
algorithm for the cell formation problem (2016) Proceedings of the Mediterranean
conference on information and communication technologies 2015, Lecture Notes in
Electrical Engineering, 380, pp. 319-326;
goodness of block diagonal forms of binary matrices in group technology (1990) Int
J Prod Res, 28, pp. 233-243;
selection principle (2002) IEEE Trans Evolut Comput, 6, pp. 239-251;
review and extension (1982) Int J Prod Res, 20, pp. 117-133;
27, pp. 1161-1165;
technology problem (1992) J Manuf Syst, 30, pp. 2633-2646;
(1991) Int J Prod Res, 29, pp. 343-356;
implementation—a state-of-the-art survey (1985) Omega, 13, pp. 381-391;
Econ, 9, pp. 73-81;
McCormick, W.T., Problem decomposition and data reorganization by a clustering
technique (1972) Oper Res, 20, pp. 993-1009;
using a rank order clustering algorithm (1980) Int J Prod Res, 18, pp. 213-232;
(1973) Int J Prod Res, 11, pp. 399-416;
Chandrasekharan, M.P., Rajagopalan, R., GROUPABIL1TY: an analysis of the properties
1052;
formation of part-families and machine-cells (1987) Int J Prod Res, 25, pp. 835-
850;
Noktehdan, A., Karimi, B., Husseinzadeh, K.A., A differential evolution algorithm
for the manufacturing cell formation problem using group based operators (2010)
Thanh, L.T., Ferland, J.A., Elbenani, B., Dinh Thuc, N., Hien Nguyen, V., A
computational study of hybrid approaches of metaheuristic algorithms for the cell
formation problem (2015) J Oper Res Soc, 67, pp. 20-36
[email protected]
ISSN: 09446524
ABBREVIATED SOURCE TITLE: Prod. Eng.
SOURCE: Scopus
Mohammad, M., Kamran, F.

56494398400;56495037900;
A dynamic programming–enhanced simulated annealing algorithm for solving bi-
objective cell formation problem with duplicate machines
(2015) Decision Science Letters, 4 (2), pp. 261-276. Cited 1 time.
84921796667&doi=10.5267%2fj.dsl.2014.10.002&partnerID=40&md5=c5bf15e6a9c44b4c006bc6
237e88f52d
DOI: 10.5267/j.dsl.2014.10.002
AFFILIATIONS: Department of Industrial Engineering, Kharazmi University, Tehran,
Iran
ABSTRACT: Cell formation process is one of the first and the most important steps
in designing cellular manufacturing systems. It consists of identifying part
families according to the similarities in the design, shape, and presses of parts
and dedicating machines to each part family based on the operations required by the
parts. In this study, a hybrid method based on a combination of simulated annealing
algorithm and dynamic programming was developed to solve a biobjective cell
formation problem with duplicate machines. In the proposed hybrid method, each
solution was represented as a permutation of parts, which is created by simulated
annealing algorithm, and dynamic programming was used to partition this permutation
into part families and determine the number of machines in each cell such that the
total dissimilarity between the parts and the total machine investment cost are
minimized. The performance of the algorithm was evaluated by performing numerical
experiments in different sizes. Our computational experiments indicated that the
results were very encouraging in terms of computational time and solution quality.
© 2015 Growing Science Ltd. All rights reserved.
AUTHOR KEYWORDS: Cellular manufacturing; Dynamic programming; Flow shop; Hybrid
simulated annealing; Job shop; Machine duplication
19, pp. 305-317;
Aktürk, M.S., Balkose, H.O., Part-machine grouping using a multi-objective cluster
analysis (1996) International Journal of Production Research, 34, pp. 2299-2315;
multiobjective parametric programming (2009) Mathematical and Computer Modelling,
50, pp. 407-420;
predator-prey genetic algorithm (2012) Applied Soft Computing, 12, pp. 559-572;
part grouping and cell layout problems (2006) Robotics and Computer-Integrated
Chang, P.T., Lee, E.S., Multisolution method for cell formation exploring practical
alternatives in group technology manufacturing (2000) Computers and Mathematics
cells in group technology (1994) European Journal of Operational Research, 75, pp.
100-111;
layout (2004) Computers and Operations Research, 31, pp. 1603-1619;
21;
Garbie, I.H., Parsaei, H.R., Leep, H.R., Machine Cell Formation Based on a New
Similarity Coefficient (2008) Journal of Industrial and Systems Engineering, 1, pp.
318-344;
Ghosh, T., Sengupta, S., Chattopadhyay, M., Dan, P.K., Meta-heuristics in cellular
Research, 33, pp. 263-283;
50, pp. 4075-4089;
Kaufmann, L., Broeckx, F., An algorithm for the quadratic assignment problem using
Benders' decomposition (1978) European Journal of Operational Research, 2, pp. 204-
211;
considering alternative routing (1997) International Journal of Computer Integrated
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., Optimisation by simulated annealing
(1983) Science, 220, pp. 671-680;
Mungwattana, A., (2000) Design of cellular manufacturing systems for dynamic and
uncertain production requirements with presence of routing flexibility, , PhD
thesis, Faculty of the Virginia Polytechnic Institute and State University;
cell formation in cellular manufacturing (2010) Journal of Software Engineering and
Saghafian, S., Akbari Jokar, M.R., Integrative cell formation and layout design in
cellular manufacturing systems (2009) Journal of Industrial and Systems
Wemmerlöv, U., Hyer, N.L., Cellular manufacturing in the US industry: A survey of
48, pp. 471-489;
CORRESPONDENCE ADDRESS: Mohammad, M.; Department of Industrial Engineering,
Kharazmi UniversityIran
PUBLISHER: Growing Science
ISSN: 19295804
ABBREVIATED SOURCE TITLE: Decis. Sci. Lett.
SOURCE: Scopus
Rezazadeh, H., Mahini, R., Zarei, M.

56462607000;37014680900;23007233300;
Solving a dynamic virtual cell formation problem by linear programming embedded
particle swarm optimization algorithm
(2011) Applied Soft Computing Journal, 11 (3), pp. 3160-3169. Cited 42 times.
79951857782&doi=10.1016%2fj.asoc.2010.12.018&partnerID=40&md5=ab88c7160307cbb810fd1
452b1512e8c
DOI: 10.1016/j.asoc.2010.12.018
AFFILIATIONS: Department of Industrial Engineering, Tabriz University, Tabriz,
Iran;
Department of Electrical, Computer and IT Engineering, Payam Noor University of
Tabriz, Tabriz, Iran;
Department of Computer Engineering, Islamic Azad University of Bostan Abad, Tabriz,
Iran
ABSTRACT: In this paper, a new mathematical model for virtual cell formation
problem (VCFP) under condition of multi-period planning horizon is presented where
the product mix and demand are different in each period, but they are deterministic
moreover production planning decisions are incorporated. The advantages of the
proposed model are as follows: considering operation sequence, alternative process
plans for part types, machine time-capacity, lot splitting, maximal virtual cell
size and balanced workload for virtual cells. The objective of the model is to
determine the optimal number of virtual cells while minimizing the manufacturing,
material handling, subcontracting, inventory holding and internal production costs
in each period. The proposed model for real-world instances cannot be solved
optimally within a reasonable amount of computational time. Thus, an efficient
linear programming embedded particle swarm optimization algorithm with a simulated
annealing-based local search engine (LPEPSO-SA) is proposed for solving it. This
model is solved optimally by the LINGO software then the optimal solution is
compared with the proposed algorithm. © 2010 Elsevier B.V. All rights reserved.
AUTHOR KEYWORDS: Dynamic virtual cell formation; Linear programming; Particle
swarm optimization; Production planning; Simulated annealing
INDEX KEYWORDS: Alternative process plans; Balanced work-load; Computational time;
Embedded particles; Inventory holding; Lot splitting; Machine time; Material
handling; Multi-period; New mathematical model; Operation sequences; Optimal
number; Optimal solutions; Planning horizons; Product mix; Production cost;
Production planning; Real-world; Virtual cells, Algorithms; Cellular manufacturing;
Linear programming; Materials handling; Mathematical models; Particle swarm
optimization (PSO); Planning; Production control; Production engineering; Project
management; Search engines, Simulated annealing
REFERENCES: Askin, R.G., Huang, Y., Forming effective worker teams for cellular
2431-2451., DOI 10.1080/00207540110040466;
pp. 516-530., DOI 10.1108/17410380510600491;
Baykasoglu, A., Capability-based distributed layout approach for virtual
pp. 2597-2618;
cell formation condition (1998) Annals of Operations Research, 77, pp. 109-128;
S0925527306000995;
Irani, S.A., Cavalier, T.M., Cohen, P.H., Virtual manufacturing cells: Exploiting
layout design and inter cell flows for the machine sharing problem (1993)
IEEE International Conference on Neural Networks, Vol. 4, pp. 1942-1948;
algorithm (1997) Proceedings of the World Multi-Conference on Systemic, Cybernetics
and Informatics, pp. 4104-4109;
Kennedy, J., Eberhart, R.C., Shi, Y., (2001) Swarm Intelligence, , Morgan Kaufmann
San Francisco, CA;
Mak, K.L., Lau, J.S.K., Wang, X.X., A genetic scheduling methodology for virtual
cellular manufacturing systems: An industrial application (2005) International
10.1080/00207540500046020;
Mak, K.L., Wang, X.X., Production scheduling and cell formation for virtual
Manufacturing Technology, 20 (2), pp. 144-152., DOI 10.1007/s001700200136;
Montreuil, B., Drolet, J., Lefrancois, P., The design and management of virtual
cellular manufacturing systems (1992) Proceedings of American Production &
Inventory Control Society Conference, pp. 410-414., 4-5 October, Quebec, Montreal;
Nomden, G., Slomp, J., Suresh, N.C., Virtual manufacturing cells: A taxonomy of
past research and identification of future research issues (2005) International
Journal of Flexible Manufacturing Systems, 17 (2), pp. 71-92., DOI 10.1007/s10696-
006-8122-1, Virtual and Non-traditional Manufacturing Cells;
Nomden, G., Van Der Zee, D.-J., Virtual cellular manufacturing: Configuring routing
flexibility International Journal of Production Economics, , doi:10.1016/j.ijpe;
10.1080/00207540110118082;
Onwubolu, G.C., (2002) Emerging Optimization Techniques in Production Planning and
Control, , Imperial College Press London;
Poli, R., Kennedy, J., Blackwell, T., Particle swarm optimization (2007) Swarm
Intelligence, 1 (1), pp. 33-57., 101007/s11721-007-0002-0;
manufacturing cells (2001) Integrated Manufacturing Systems, 12 (4), pp. 306-315.,
DOI 10.1108/09576060110393406;
Rezazadeh, H., Ghazanfari, M., Saidi-Mehrabad, M., Sadjadi, S.J., An extended
discrete particle swarm optimization algorithm for the dynamic facility layout
problem (2009) Journal of Zhejiang University Science A, 10 (4), pp. 520-529;
Saad, S.M., Baykasoglu, A., Gindy, N.N.Z., An integrated framework for
reconfiguration of cellular manufacturing systems using virtual cells (2002)
Production Planning and Control, 13 (4), pp. 381-393., DOI
10.1080/09537280210130478;
10.1016/j.ejor.2006.12.058, PII S0377221707000811;
52 (6), pp. 673-681;
Shi, Y., Eberhart, R.C., A modified particle swarm optimizer (1998) Proceedings
IEEE Congress on Evolutionary Computation, pp. 69-173., NJ: Piscataway;
Simpson, J.A., Hocken, R.J., Albus, J.S., AUTOMATED MANUFACTURING RESEARCH FACILITY
OF THE NATIONAL BUREAU OF STANDARDS (1982) Journal of Manufacturing Systems, 1 (1),
pp. 17-32;
Slomp, J., Bokhorst, J.A.C., Molleman, E., Cross-training in a cellular
manufacturing environment (2005) Computers and Industrial Engineering, 48 (3), pp.
609-624., DOI 10.1016/j.cie.2003.03.004, PII S0360835204002050,
Slomp, J., Chowdary, B.V., Suresh, N.C., Design and operation of virtual
manufacturing cells (2004) Proceedings of FAIM Conference, , Tampa, FL;
S0736584504001036;
Subash, B.A., Nandurkar, K.N., Thomas, A., Development of virtual cellular
manufacturing systems for SMEs (2000) Logistics Information Management, 13 (4), pp.
228-242;
Suer, G.A., Optimal operator assignment and cell loading in labor-intensive
manufacturing cells (1996) Computers and Industrial Engineering, 26 (4), pp. 155-
159;
S0096300305000238;
Teghem, J., Pirlot, M., Antoniadis, C., Embedding of linear programming in a
simulated annealing algorithm for solving a mixed integer production planning
problem (1995) Journal of Computational and Applied Mathematics, 64, pp. 91-102;
Thomalla, C.S., Formation of virtual cells in manufacturing systems (2000)
Proceedings Group Technology/Cellular Manufacturing World Symposium, pp. 13-16.,
San Juan, Puerto Rico;
Vakharia, A.J., Moily, J.P., Huang, Y., Evaluating virtual cells and multistage
flow shops: An analytical approach (1999) International Journal of Flexible
Manufacturing Systems, 11 (3), pp. 291-314., DOI 10.1023/A:1008117329327
CORRESPONDENCE ADDRESS: Rezazadeh, H.; Department of Industrial Engineering, Tabriz
University, Tabriz, Iran; email: [email protected]
ISSN: 15684946
SOURCE: Scopus
Brown, E.C., Sumichrast, R.T.

7404129184;6701865054;
CF-GGA: A grouping genetic algorithm for the cell formation problem
73 times.
0035841887&doi=10.1080%2f00207540110068781&partnerID=40&md5=b4439bcb85b7fbc3ed8b40b
bc09ab37a
DOI: 10.1080/00207540110068781
AFFILIATIONS: Mgmt. Science and Info. Technology, Virginia Tech, 1007 Pamplin Hall
(0235), Blacksburg, VA 24061, United States
ABSTRACT: In manufacturing, the machine-part cell formation (MPCF) problem
addresses the issues surrounding the formation of part families based on the
processing requirements of the components, and the identification of machine groups
based on their ability to process specific part families. Past research has shown
that one key aspect of attaining efficient groupings of parts and machines is the
block-diagonalization of the given machine-part (MP) incidence matrix. This paper
presents and tests a grouping genetic algorithm (GGA) for solving the MPCF problem
and gauges the quality of the GGA's solutions using the measurements of efficiency
(Chandrasekharan and Rajagopalan 1986a) and efficacy (Kumar and Chandrasekharan
1990). The GGA in this study, CF-GGA, a grouping genetic algorithm for the cell
formation problem, performs very well when applied to a variety of problems from
the literature. With a minimal number of parameters and a straightforward encoding,
CF-GGA is able to match solutions with several highly complex algorithms and
heuristics that were previously employed to solve these problems.
INDEX KEYWORDS: Computational complexity; Genetic algorithms; Group technology;
Heuristic methods; Production control, Grouping genetic algorithms; Machine part
cell formation; Machine part incidence matrix, Cellular manufacturing
REFERENCES: Alendar, J.T., (1994) An Indexed Bibliography of Genetic Algorithms:
Years 1957-1993, , Compiled by Jarmo T. Alendar (Finland: Art of CAD);
Ballakur, A., Steudel, H.J., A with-in cell utilization based heuristic for
Research, 25, pp. 639-655;
Brown, E.C., Using the facility location problem to explore operator policies and
constraint-handling methods for genetic algorithms (1996), PhD Dissertation,
University of Virginia; Burbridge, J.L., Production flow analysis (1963) Production
Engineer, 42, pp. 742-752;
Burbridge, J.L., (1979) Group Technology in the Engineering Industry, , (New York:
Wiley);
Research, 24, pp. 451-464;
Chandrasekharan, M.P., Rajagopalan, R., MODROC: An extension of rank-order
Research, 24, pp. 1221-1233;
Dejong, K., An analysis of the behavior of a class of genetic adaptive systems
(1975), PhD Dissertation, University of Michigan; Delit, P., Falkenauer, E.,
Delchambre, A., Grouping genetic algorithms: An efficient method to solve the cell
formation problem (2000) Mathematics and Computers in Simulation, 51, pp. 257-271;
Falkenauer, E., The grouping genetic algorithms - Widening the scope of the GAs
(1992) JORBEL - Belgian Journal of Operations Research, Statistics and Computer
Science, 33, pp. 79-102;
Falkenauer, E., (1998) Genetic Algorithms for Grouping Problems, , (New York:
Wiley);
Learning, , (Reading, MA: Addison-Wesley);
Holland, J.H., (1975) Adaptation in Natural and Artificial Systems: An Introductory
Analysis with Applications in Biology, Control, and Artificial Intelligence, , (Ann
Arbor, MI: University of Michigan Press);
Joines, J., Culbreth, C.T., King, R.E., Manufacturing cell design: An integer
programming model employing genetic algorithms (1996) IEEE Transactions, 28, pp.
69-85;
King, J.R., Machine-component group formation in group technology (1980) Omega, 8,
pp. 193-199;
Research, 18, pp. 213-237;
King, J.R., Nakornchai, V., Machine-component group formation in group technology
117-133;
Society, 50, pp. 509-516;
993-1009;
Programs, , (New York: Springer-Verlag);
Radcliffe, N.J., Forma analysis and random respectful combination (1991)
Proceedings of the Fourth International Conference on Genetic Algorithms, San
Diego, CA, pp. 222-229;
Radcliffe, N.J., Personal communications; Reeves, C., A genetic algorithm for
flowshop sequencing (1995) Computers and Operations Research, 22, pp. 5-13;
Seifoddini, H.K., Tjahjana, B., Part-family formation for cellular manufacturing: A
case study at Harnischfeger (1999) International Journal of Production Research,
37, pp. 3262-3273;
Research, 32, pp. 2149-2158;
463-478;
simulated annealing (1998) International Journal of Production Research, 36, pp.
2185-2207;
search approach (1997) International Journal of Production Research, 35, pp. 2025-
2043;
state-of-the-art review (1999) International Journal of Production Research, 37,
pp. 3335-3357
CORRESPONDENCE ADDRESS: Brown, E.C.; Mgmt. Science and Info. Technology, Virginia
Tech, 1007 Pamplin Hall (0235), Blacksburg, VA 24061, United States; email:
[email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Niakan, F., Baboli, A., Moyaux, T., Botta-Genoulaz, V.

54947325300;23974157700;55900429700;55666011400;
A bi-objective model in sustainable dynamic cell formation problem with skill-based
worker assignment
(2016) Journal of Manufacturing Systems, 38, pp. 46-62. Cited 24 times.
84948845011&doi=10.1016%2fj.jmsy.2015.11.001&partnerID=40&md5=e83840eac46f090f9f1b8
09028f2cfe6
DOI: 10.1016/j.jmsy.2015.11.001
AFFILIATIONS: Université de Lyon, INSA-Lyon, DISP Laboratory, Villeurbanne, EA4570,
France
ABSTRACT: The most recent revolution in industry (Industrial Revolution 4.0)
requires increased flexibility, agility and efficiency in the use of production
equipment. The Dynamic Cellular Manufacturing System (DCMS) is one of the best
production systems to meet such requirements. In addition, the increasing
importance of environmental and social issues, along with recent laws, is forcing
manufacturers and managers to take account of sustainability when designing and
configuring manufacturing systems. This paper proposes a new bi-objective
mathematical model of the Dynamic Cell Formation Problem (DCFP), in which the
worker's assignment, environmental and social criteria are considered. The first
objective in this model is to minimize both production and labor costs while the
total production waste (e.g., energy, chemical material, raw material, CO2
emissions, etc.) is minimized as second objective. Social criteria in this model,
are represented as constraint. Due to the NP-hardness of this problem, we propose a
new resolution approach called NSGA II-MOSA, that merges an efficient hybrid meta-
heuristic based on the Non-dominated Sorting Genetic Algorithm (NSGA-II), with
Multi-Objective Simulated Annealing (MOSA). Finally, randomly-generated test
problems demonstrate the performance of our algorithm. © 2015 The Society of
Manufacturing Engineers.
AUTHOR KEYWORDS: Bi-objective optimization; Dynamic cell formation; Multi-
Objective Simulated Annealing; Non-dominated Sorting Genetic Algorithm;
Sustainability
INDEX KEYWORDS: Algorithms; Carbon dioxide; Compensation (personnel); Environmental
regulations; Genetic algorithms; Manufacture; Multiobjective optimization;
Optimization; Simulated annealing; Sustainable development; Wages, Bi-objective
optimization; Dynamic cell formation; Dynamic cellular manufacturing systems;
Increased flexibility; Industrial revolutions; Multi objective; Non dominated
sorting genetic algorithm (NSGA II); Non- dominated sorting genetic algorithms,
REFERENCES: Brecher, C., (2015) Advances in Production Technology, , Springer
International Publishing Cham;
(1987) Report of the World Commission on Environment and Development. Our Common
Future, , World Commission on Environment and Development;
Rheault, M., Drolet, J.R., Abdulnour, G., Physically reconfigurable virtual cells:
A dynamic model for a highly dynamic environment (1995) Comput Ind Eng, 29, pp.
221-225;
Schaller, J., Selçuk Erengüç, S., Vakharia, A., A methodology for integrating cell
formation and production planning in cellular manufacturing (1998) Ann Oper Res,
77, pp. 1-21;
environment using Tabu search (2004) Comput Ind Eng, 46, pp. 571-588;
(2005) Int J Prod Res, 43, pp. 1587-1605;
pp. 761-780;
algorithms (2005) Stoch. Algorithms Found. Appl., pp. 213-227., Springer-Verlag
Berlin Heidelberg;
genetic-algorithm-based heuristic (2006) Int J Prod Res, 44, pp. 2421-2444;
Safaei, N., Saidi-Mehrabad, M., Babakhani, M., Designing cellular manufacturing
systems under dynamic and uncertain conditions (2007) J Intell Manuf, 18, pp. 383-
399;
Safaei, N., Saidi Mehrabad, M., Tavakkoli Moghaddam, R., A fuzzy programming
approach for a cell formation problem with dynamic and uncertain conditions (2008)
Fuzzy Sets Syst, 159, pp. 215-236;
Safaei, N., Saidi Mehrabad, M., Jabal Ameli, M.S., A hybrid simulated annealing for
Oper Res, 185, pp. 563-592;
Oper Res, 187, pp. 46-69;
Defersha, F.M., Chen, M., A parallel genetic algorithm for dynamic cell formation
in cellular manufacturing systems (2008) Int J Prod Res, 46, pp. 6389-6413;
reconfiguration (2008) Int J Prod Res, 47, pp. 1573-1600;
and the worker assignment problem: A new model (2009) Int J Adv Manuf Technol, 41,
pp. 329-342;
a cellular manufacturing system (2014) J Manuf Syst, 33, pp. 578-588;
Saidi-Mehrabad, M., Paydar, M.M., Aalaei, A., Production planning and worker
training in dynamic manufacturing systems (2013) J Manuf Syst, 32, pp. 308-314;
Int J Prod Econ, 120, pp. 301-314;
Oper Res, 36, pp. 777-794;
formation problem using a scatter search approach (2009) Int J Adv Manuf Technol
44, pp. 318-329;
genetic algorithm to solve dynamic cell formation problem (2010) Appl Math Model,
34, pp. 1078-1092;
and worker assignment (2010) Comput Math with Appl, 60, pp. 1014-1025;
Javadian, N., Aghajani, A., Rezaeian, J., Ghaneian Sebdani, M., A multi-objective
reconfiguration (2011) Int J Adv Manuf Technol, 56, pp. 307-317;
Saxena, L., Jain, P., Dynamic cellular manufacturing systems design - A
comprehensive model (2011) Int J Adv Manuf Technol, 53, pp. 11-34;
multi-floor layout design model of a dynamic cellular manufacturing system by an
efficient genetic algorithm (2014) J Manuf Syst, 33, pp. 218-232;
formation considering labor utilization (2013) Appl Math Model, 37, pp. 2308-2316;
Kia, R., Shirazi, H., Javadian, N., Tavakkoli-Moghaddam, R., Designing group layout
of unequal-area facilities in a dynamic cellular manufacturing system with
variability in number and shape of cells (2014) Int J Prod Res, 53, pp. 3390-3418;
based on number and average length of intra and intercellular movements (2013) Appl
Math Model, 37, pp. 1884-1896;
Shiyas, C.R., Madhusudanan Pillai, V., A mathematical programming model for
manufacturing cell formation to develop multiple configurations (2014) J Manuf
Syst, 33, pp. 149-158;
(2015) J Manuf Syst, 35, pp. 155-163;
Niakan, F., Baboli, A., Moyaux, T., Botta-Genoulaz, V., A new multi-objective
mathematical model for dynamic cell formation under demand and cost uncertainty
considering social criteria (2015) Appl Math Model, pp. 1-18;
Dehghanian, F., Mansour, S., Designing sustainable recovery network of end-of-life
products using genetic algorithm (2009) Resour Conserv Recycl, 53, pp. 559-570;
Ramanathan, R., Ganesh, L.S., Group preference aggregation methods employed in AHP:
An evaluation and an intrinsic process for deriving members' weightages (1994) Eur
J Oper Res, 79, pp. 249-265;
Leigh, J.P., Miller, T.R., Job-related diseases and occupations within a large
workers' compensation data set (1998) Am J Ind Med, 33, pp. 197-211;
Daniell, W.E., Fulton-Kehoe, D., Smith-Weller, T., Franklin, G.M., Occupational
hearing loss in Washington state, 1984-1991: II. Morbidity and associated costs
(1998) Am J Ind Med, 33, pp. 529-536;
Niebel, B., Freivalds, A., (2009) Niebel's Methods, Standards and Work Design, ,
12th ed. McGraw-Hill New York, NY;
Nanthavanij, S., Analytical approach for workplace noise assessment (2002)
Thammasat Int J Sci Technol, 7, pp. 8-16;
Sanders, M.S., McCormick, E.J., (1993) Human Factors in Engineering and Design, ,
7th ed. McGraw-Hill New York, NY;
Tharmmaphornphilas, W., Developing worker rotation schedule based upon workers
skills to minimize occupation injury (2002) 35th Int. Conf. Comput. Ind. Eng., ,
Istanbul, Turkey;
Aryanezhad, M.B., Kheirkhah, A.S., Deljoo, V., Mirzapour Al-E-Hashem, S.M.J.,
Designing safe job rotation schedules based upon workers' skills (2008) Int J Adv
National Institute Of Occupational Safety And Healt (NIOSH), (1996) The National
Occupational Research Agenda (NORA), pp. 96-115., Dep Heal Hum Serv Washington, DC;
Occupational Safety And Health Administration (OSHA), (1983) Guidelines for Noise
Enforcement: Appendix A, , US Dep Labor, Occupational Saf Heal Adm Washington, DC
2-2.35A;
National Institute Of Occupational Safety And Health (NIOSH), (1998) Criteria for a
Recommended Standard: Occupational Noise Exposure, pp. 98-126., Dep Heal Hum Serv
Washington, DC;
Garey, M.R., Johnson, D.S., (1979) Computers and Intractability: a Guide to the
Theory of NP-completeness (Series of Books in the Mathematical Sciences)C, , W. H.
Freeman New York, NY;
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T., A fast and elitist multiobjective
genetic algorithm: NSGA-II (2002) Evol Comput IEEE Trans, 6, pp. 182-197;
Smith, K.I., Everson, R.M., Fieldsend, J.E., Dominance measures for multi-objective
simulated annealing Proc. 2004 Congr. Evol. Comput. (IEEE Cat. No.04TH8753), 1, pp.
23-30., IEEE;
Tavakkoli-Moghaddam, R., Azarkish, M., Sadeghnejad-Barkousaraie, A., A new hybrid
multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling
problem (2011) Expert Syst Appl, 38, pp. 10812-10821;
Mohammadi, M., Jolai, F., Tavakkoli-Moghaddam, R., Solving a new stochastic multi-
mode p-hub covering location problem considering risk by a novel multi-objective
algorithm (2013) Appl Math Model, 37, pp. 10053-10073
CORRESPONDENCE ADDRESS: Niakan, F.; Université de Lyon, INSA-Lyon, DISP
LaboratoryFrance; email: [email protected]
PUBLISHER: Elsevier
ISSN: 02786125
CODEN: JMSYE
ABBREVIATED SOURCE TITLE: J Manuf Syst
SOURCE: Scopus

56619196000;36136249100;
Multi-objectives for incremental cell formation problem
(2006) Annals of Operations Research, 143 (1), pp. 157-170. Cited 4 times.
33646552057&doi=10.1007%2fs10479-006-7379-
9&partnerID=40&md5=f12434ffa9d224e1328c4be099d5a1c5
DOI: 10.1007/s10479-006-7379-9
AFFILIATIONS: Priyadarshini College of Engineering, Nellore-524 004, A.P., India;
Department of Management Studies, Indian Institute of Technology Madras, Chennai-
600 036, India
ABSTRACT: Over the past three decades considerable amount of research work has been
reported in the literature of Group Technology (GT). Most of the research work is
concerned with formation of machine cells and part families. This is because cell
formation is considered to be the most complex and the most important aspect of
Cellular Manufacturing System (CMS). Due to NP completeness of cell formation
problem, many heuristics have been developed. These heuristics are developed for
both single as well as multiple objectives for the comprehensive cell formation.
Here all part types and machine types are considered at a time for cell conversion
and that all cells are designed at a single point in time. But planning and
implementation of most cell conversions in industry are incremental ones, and not
comprehensive. This issue has not been addressed in GT literature adequately. In
this paper we consider multiple objectives for incremental cell formation and
develop, a lexicographic based simulated annealing algorithm. The performance of
the algorithm is tested over several data sets by taking different initial feasible
solutions generated using different heuristics. © Springer Science + Business
Media, Inc. 2006.
AUTHOR KEYWORDS: Cellular manufacturing system; Group technology; Incremental
cell; Multi-objectives
REFERENCES: Baykasoglu, A., Gindy, N.N.Z., MOCACEF 1.0: Multiple objective
capability based approach to form part-machine groups for cellular manufacturing
applications (2000) International Journal of Production Research, 38, pp. 1133-
1161;
Research, 24, pp. 1221-1233;
using a rank order clustering algorithm formation in group technology (1980)
Lee-Post, A., Part family identification using a simple genetic algorithm (2000)
Mahesh, O., Srinivasn, G., Incremental cell formation considering alternative
machines (2002) International Journal of Production Research, 40, pp. 3291-3310;
Mahesh, O., Srinivasn, G., Algorithms for incremental cell formation problem (2002)
Proceedings of Symposium on Manufacturing Excellence (SYMAX), pp. 183-184., IIT
Madras;
Research, 37, pp. 3119-3138;
Mcauley, J., Machine grouping for efficient production (1972) Production Engineer,
51, pp. 53-57;
of state calculations by fast computing machines (1953) Journal of Chemical
Physics, 21, pp. 1087-1092;
Nair, G., Jayakrishnan, Narendran, T.T., CASE: A clustering algorithm for cell
36, pp. 157-179;
Nair, G., Jayakrishnan, Narendran, T.T., ACCORD: A bi-criterion algorithm for cell
Soleja, V.B., Urosevic, S.M., Optimization of Group Technology lines by methods
developed in LAMA, Belgrade (1969) Proceedings of the International Conference on
GT, ILO, Turin;
Sofianopolou, S., Manufacturing cells design with alternative process plans and/or
707-720;
Research, 28, pp. 145-152;
2185-2207;
CORRESPONDENCE ADDRESS: Mahesh, O.; Priyadarshini College of Engineering, Nellore-
524 004, A.P., India; email: [email protected]
ISSN: 02545330
ABBREVIATED SOURCE TITLE: Ann. Oper. Res.
SOURCE: Scopus
Baykasoǧlu, A.
7004171955;
A meta-heuristic algorithm to solve quadratic assignment formulations of cell
formation problems without presetting number of cells
https://www.scopus.com/inward/record.uri?eid=2-s2.0-4944234072&doi=10.1023%2fB
%3aJIMS.0000042661.56171.bb&partnerID=40&md5=c54d3eccfd20ebdda60d9a1b01646031
DOI: 10.1023/B:JIMS.0000042661.56171.bb
AFFILIATIONS: University of Gaziantep, Department of Industrial Engineering, 27310,
Gaziantep, Turkey
ABSTRACT: The purpose of cellular manufacturing (CM) is to find part-families and
machine cells which form self-sufficient units of production with a certain amount
of autonomy that result in easier control (Kusiak, 1987, 1990). One of the most
important steps in CM is to optimally identify cells from a given part-machine
incidence matrix. Several formulations of various complexities are proposed in the
literature to deal with this problem. One of the mostly known formulations for CM
is the quadratic assignment formulation (Kusiak and Chow, 1988). The problem with
the quadratic assignment based formulation is the difficulty of its solution due to
its combinatorial nature. The formulation is also known as NP-hard (Kusiak and
Chow, 1988). In this paper a novel simulated annealing based meta-heuristic
algorithm is developed to solve quadratic assignment formulations of the
manufacturing cell formation problems. In the paper a novel solution representation
scheme is developed. Using the proposed solution representation scheme, feasible
neighborhoods can be generated easily. Moreover, the proposed algorithm has the
ability to self determine the optimal number of cell during the search process. A
test problem is solved to present working of the proposed algorithm.
AUTHOR KEYWORDS: Cellular manufacturing; Quadratic assignment problem; Simulated
annealing
INDEX KEYWORDS: Algorithms; Computational complexity; Heuristic methods; Problem
solving; Scheduling; Simulated annealing, Group technology (GT); Human relations;
Production planning; Quadratic assignment problem, Cellular manufacturing
REFERENCES: Baykasoǧlu, A., Gindy, N., MOCACEF 1.0: Capability based approach to
form part-machine groups for cellular manufacturing applications (2000)
Baykasoǧlu, A., Gindy, N.N.Z., A simulated annealing algorithm for dynamic layout
problem (2001) Computers and Operations Research, 28, pp. 1403-1426;
Baykasoǧlu, A., Gindy, N.N.Z., Cobb, R.C., Capability based formulation and
(2001) Integrated Manufacturing Systems, 12 (4), pp. 258-274;
cells in group technology (1994) European Journal of Operational Researches, 75,
pp. 100-111;
Hwang, H., Sun, J., A genetic-algorithm-based heuristic for the GT cell formation
problem (1996) Computers Industrial Engneering, 30 (4), pp. 941-955;
Joglekar, P., Chung, Q.B., Tavana, M., Note on a comparative evaluation of nine
well-known algorithms for solving the cell formation problem in group technology
(2001) Journal of Applied Mathematics and Decision Sciences, 5 (3), pp. 253-268;
of Robotics and Automation, 4 (5), pp. 457-471;
Kusiak, A., (1990) Intelligent Manufacturing Systems, , Prentice Hall, U.S.A;
673;
Research, 28 (1), pp. 145-152
CORRESPONDENCE ADDRESS: Baykasoǧlu, A.; University of Gaziantep, Department of
Industrial Engineering, 27310, Gaziantep, Turkey
ISSN: 09565515
CODEN: JIMNE
SOURCE: Scopus
De Lit, P., Falkenauer, E., Delchambre, A.

6603067756;6602763346;6603821707;
Grouping genetic algorithms: An efficient method to solve the cell formation
problem
(2000) Mathematics and Computers in Simulation, 51 (3-4), pp. 257-271. Cited 56
times.
0010841415&partnerID=40&md5=75dbb237c8c7ddc0eb271b3d6fa9a908
AFFILIATIONS: Université Libre de Bruxelles, Department of Applied Mechanics,

Brussels, Belgium
ABSTRACT: The layout problem arises in a production plant during the study of a new
production system, but also during a possible restructuring. The main aim of layout
design is to reduce transportation and maintenance, which simplifies management,
shortens lead time, improves product quality and speeds up the response to market
fluctuations. A principle of Group Technology (GT) advocates the division of a
unity into small groups or cells. As it is most of the time impossible to design
totally independent cells, the problem is to minimise traffic of items between the
cells, for a fixed maximum cell size. This problem is known as cell formation
problem (CFP). We propose here an original approach to solve this NP-hard problem.
It is based on a Grouping Genetic Algorithm (GGA), a special class of genetic
algorithms, heavily modified to suit the structure of grouping problems. The
crucial advantage of this GGA is that it is able to deal with large instances of
the problem thus becoming a powerful tool for an engineer determining a plant
layout, allowing him or her to try several plant options, without the limitation of
huge computation times. © 2000 IMACS/Elsevier Science B.V. All rights reserved.
AUTHOR KEYWORDS: Cell formation and decomposition; Group technology; Grouping
genetic algorithms
assignment and cell formation in group technology (1990) Int. Jour. Prod. Res., 24
(3), pp. 471-481;
(1991) Int. J. Prod. Res., 29 (2), pp. 343-356;
Burbidge, J.L., Production flow analysis (1971) Prod. Eng., pp. 139-152;
Burbidge, J.L., (1989) Production Flow Analysis, , Clarendon Press, Oxford;
cellular manufacturing (1982) J. Manuf. Syst., 1 (1), pp. 65-74;
Falkenauer, E., A hybrid grouping genetic algorithm for bin packing (1996) J.
Heuristics, 2 (1), pp. 5-30;
Falkenauer, E., (1998) Genetic Algorithms and Grouping Problems, , Wiley;
Learning, , Addison-Wesley;
185-198;
(1970) The Bell Syst. Tech. J., 49, pp. 291-307;
King, J.R., Machine-component group formulation in production flow analysis: An
approach using a rank order clustering algorithm (1980) Int. J. Prod Res., 18 (2),
pp. 213-222;
Kirkpatrick, S., Gelatti, C.D., Vecchi, M.P., Optimization by simulated annealing
(1983) Science, 220, pp. 671-680;
Kusiak, A., Chow, W.S., Decomposition of manufacturing systems (1988) IEEE J.
Robotics Automation, 4 (5), pp. 457-471;
McAuley, J., Machine grouping for efficient production (1972) Prod. Eng., pp. 53-
57;
reorganization by cluster technique (1972) Oper. Res., 20 (5), pp. 993-1009;
for solving the cell formation problem in group technology (1991) J. Op. Manage.,
10 (1), pp. 44-72;
Pommerenke, B., Choix optimal des cellules de production par un algorithme
génétique de groupement (1995) Travail de Fin d'études Présenté en Vue de
l'Obtention du Grade d'Ingénieur Civil Physicien, , Université Libre de Bruxelles;
group technology (1986) IIE Trans., 18 (3), pp. 271-277
CORRESPONDENCE ADDRESS: De Lit, P.; Université Libre de Bruxelles, Department of
Applied Mechanics, Brussels, Belgium; email: [email protected]
ISSN: 03784754
CODEN: MCSID
ABBREVIATED SOURCE TITLE: Math Comput Simul
SOURCE: Scopus
Keeling, K.B., Brown, E.C., James, T.L.

6701760915;7404129184;8533468700;
Grouping efficiency measures and their impact on factory measures for the machine-
part cell formation problem: A simulation study
(2007) Engineering Applications of Artificial Intelligence, 20 (1), pp. 63-78.
Cited 19 times.
33750621453&doi=10.1016%2fj.engappai.2006.04.001&partnerID=40&md5=5033add10d6f8d6e7
258f18bb733d7de
DOI: 10.1016/j.engappai.2006.04.001
AFFILIATIONS: Department of Business Information Technology, Pamplin College of
Business, Virginia Polytechnic Institute, Blacksburg, VA 24061, United States;
Department of Engineering, East Carolina University, Greenville, NC 27858, United
States
ABSTRACT: Over the past 25 years, the machine-part cell formation problem has been
the subject of numerous studies. Researchers have applied various methodologies to
the problem in an effort to determine optimal clusterings of machines and optimal
groupings of parts into families. The quality of these machine and part groupings
have been evaluated using various objective functions, including grouping efficacy,
grouping index, grouping capability index, and doubly weighted grouping efficiency,
among others. In this study, we investigate how appropriate these grouping quality
measures are in determining cell formations that optimize factory performance.
Through the application of a grouping genetic algorithm, we determine machine/part
cell formations for several problems from the literature. These cell formations are
then simulated to determine their impact on various factory measures, such as flow
time, wait time, throughput, and machine utilization, among others. Results
indicate that it is not always the case that a "more efficient" machine/part cell
formation leads to significant changes or improvements in factory measures over a
"less efficient" cell formation. In other words, although researchers are working
to optimize cell formations using efficiency measures, cells formed this way do not
always demonstrate optimized factory measures. © 2006 Elsevier Ltd. All rights
reserved.
AUTHOR KEYWORDS: Grouping capability index; Grouping efficacy; Grouping genetic
algorithm
INDEX KEYWORDS: Genetic algorithms; Problem solving; Resource allocation;
Throughput, Factory measures; Grouping capability index; Grouping efficacy;
Grouping genetic algorithm, Machine components
REFERENCES: Brown, E.C., Sumichrast, R.T., CF-GGA: a grouping genetic algorithm for
the cell formation problem (2001) International Journal of Production Research, 39
(16), pp. 3651-3669;
Burbidge, J., (1979) Group Technology in the Engineering Industry, , Wiley, New
York;
Chandrasekharan, M., Rajagopalan, R., MODROC: an extension of rank order clustering
pp. 1221-1233;
Chandrasekharan, M., Rajagopalan, R., ZODIAC: an algorithm for concurrent formation
Research, 25, pp. 835-850;
Chandrasekharan, M., Rajagopalan, R., GROUPABILITY: an analysis of the properties
(1992) Belgian Journal of Operations Research, Statistics and Computer Science, 33,
pp. 79-102;
Falkenauer, E., (1998) Genetic Algorithms for Grouping Problems, , Wiley, New York;
Garey, M., Johnson, D., (1979) Computers and Intractability, , Freeman, San
Francisco;
Learning, , Addison-Wesley, Reading, PA;
(1), pp. 47-64;
Hsu, C., (1990) Similarity Coefficient Approaches to Machine Component Cell
Formation in Cellular Manufacturing: A Comparative Study, , University of
Wisconsin, Milwaukee;
Huq, F., Hensler, D., Mohamed, Z., A simulation analysis of factors influencing the
flow time and through-put performance of functional and cellular layouts (2001)
Joines, J.A., Culbreth, C.T., King, R.E., Manufacturing cell design: an integer
69-85;
Kumar, C., Chandrasekharan, M., Grouping efficacy: a quantitative criterion for
Law, A.M., Kelton, W.D., (2000) Simulation Modeling and Analysis. third ed, ,
McGraw-Hill Higher Education, Boston;
Nair, G.J.K., Narendran, T.T., Grouping index: a new quantitative criterion for
of Production Research, 34 (10), p. 2767;
(2001) European Journal of Operational Research, 130 (3), p. 588;
Sarker, B.R., Mondal, S., Grouping efficiency measures in cellular manufacturing: a
(2), p. 285;
Research, 34 (12), pp. 3401-3416;
Shambu, G., Suresh, N., Performance of hybrid cellular manufacturing systems: a
computer simulation investigation (2000) European Journal of Operational Research,
120, pp. 436-458;
Research, 32, pp. 2149-2158;
Srinivasan, G., Narendran, T.T., GRAFICS-a non-hierarchical clustering algorithm
463-478;
Ventura, J., Chen, F., Wu, C., Grouping parts and cells in flexible manufacturing
systems production planning (1990) International Journal of Production Research, 28
(6), pp. 1039-1056
CORRESPONDENCE ADDRESS: Keeling, K.B.; Department of Business Information
Technology, Pamplin College of Business, Virginia Polytechnic Institute,
Blacksburg, VA 24061, United States; email: [email protected]
ISSN: 09521976
CODEN: EAAIE
ABBREVIATED SOURCE TITLE: Eng Appl Artif Intell
SOURCE: Scopus
Ghavijorbozeh, R., Zeinal Hamadani, A.

57192381736;57190609753;
Application of the mixed Weibull distribution in machine reliability analysis for a
(2017) International Journal of Quality and Reliability Management, 34 (1), pp.
85006041955&doi=10.1108%2fIJQRM-08-2014-
0118&partnerID=40&md5=442421e01ed3eeaf237754ba4d228d8e
DOI: 10.1108/IJQRM-08-2014-0118
AFFILIATIONS: Department of Industrial and Systems Engineering, Isfahan University
of Technology, Isfahan, Iran
ABSTRACT: Purpose: The purpose of this paper is to understand the consequence of
the use of mixed Weibull distribution in the cell formation problem. In reliability
theory, a mixed distribution is used for more than one hazard cause, and the
Weibull distribution can be used for ascendant, monotonous and descendant failure
rate. Here, the authors mixed these two theme and use it in a common problem in
group technology. Design/methodology/approach: In this paper, the authors made a
non-polynomial-hard mathematical model based on past research and solved it with an
exact algorithm. The algorithm is coded and solved in GAMS to illustrate the model,
and the authors use simulation. A common numerical example is solved with the
model, and the results are compared. Findings: Reliability analysis model based on
the mixed Weibull distribution approach will give options to a user to select the
suitable failure rate and modes for a specific situation. If the user uses the
exponential or Weibull distribution instead of the mixed Weibull distribution, the
calculated cost and reliability are wrong; therefore, it leads to user making wrong
decisions. Originality/value: The model the authors use is the one used in past
research, but in the past, researchers did not use the mixed distribution for
explaining failure time. Therefore, the model can be considered as a new and more
complete model. © 2017, © Emerald Publishing Limited.
AUTHOR KEYWORDS: Cellular manufacturing systems; Exponential distribution;
Machine reliability; Mixed Weibull distribution; Multi-objective mixed integer
programming; Weibull distribution; Weibull distribution
routings and machine reliability consideration (2008) The International Journal of
breakdowns in the generalized cell formation problem (2008) The International
Arkat, J., Ameli, M.S.J., Sadeghi, H.A., A multi-objective memetic algorithm for
the generalized cell formation problem considering machine reliability (2007) The
International Journal of Applied Management and Technology, 5, pp. 139-156;
manufacturing system design (2007) The International Journal of Advanced
Handbook of Cellular Manufacturing Systems, pp. 25-34., John Wiley & Sons Inc.,
Hoboken, NJ;
Research, 25 (5), pp. 639-665;
machine reliability analysis in a CMS design (2008) Computers & Industrial
and part demand: a cellular manufacturing systems design model (2011) International
Das, K., Lashkari, R., Sengupta, S., Reliability consideration in the design and
of Production Economics, 74 (1), pp. 175-182;
Ebeling, C.E., (1997) An Introduction to Reliability and Maintainability
Engineering, , McGraw Hill, New York, NY;
Lindqvist, B.H., Doksum, K.A., (2004) Mathematical & Statistical Methods in
Reliability, , Series on quality, reliability & engineering statistics, World
Scientific, 7;
Mak, K., Peng, P., Wang, X., Lau, T., An ant colony optimization algorithm for
scheduling virtual cellular manufacturing systems (2007) International Journal of
Saad, S.M., Baykasoglu, A., Gindy, N.N., A new integrated system for loading and
scheduling in cellular manufacturing (2002) International Journal of Computer
(6), pp. 538-548;
application of quality index (2001) Computers & Industrial Engineering, 40 (1), pp.
65-77;
users (1989) The International Journal of Production Research, 27 (9), pp. 1511-
1530;
Economics, 101 (2), pp. 329-352;
flows (2005) The International Journal of Advanced Manufacturing Technology, 27 (1-
2), pp. 159-165;
Transactions on Robotics and Automation, 13 (2), pp. 161-168
CORRESPONDENCE ADDRESS: Ghavijorbozeh, R.; Department of Industrial and Systems
Engineering, Isfahan University of TechnologyIran; email: [email protected]
PUBLISHER: Emerald Group Publishing Ltd.
ISSN: 0265671X
ABBREVIATED SOURCE TITLE: Int. J. Qual. Reliab. Manage.
SOURCE: Scopus

56029842600;16417373200;23025569300;
A hybrid GA-AUGMECON method to solve a cubic cell formation problem considering
different worker skills
84904020513&doi=10.1016%2fj.cie.2014.05.022&partnerID=40&md5=e8d714364835bbce23a741
c05d67b8a3
DOI: 10.1016/j.cie.2014.05.022
Department of Industrial Engineering, Babol Noshirvani University of Technology,
Babol, Iran
ABSTRACT: Part quality and consequently customer satisfaction besides cost
functions are two of the most important issues for any firm. Balancing between
these two goals leads to full utilization from manufacturing resources. Formerly,
in cubic cell formation problem, where a part on a machine can be processed by
various workers, worker assignment was done just by minimizing inter-cell movement
criterion; so, the workers assigned into the processing cell are mostly selected
rather than outsider workers. But, it is rational for the ties to be broken by
skills of different workers in performing a special part on the dedicated machine.
In this paper, a bi-objective cubic cell formation is presented with two non-
homogeneous objective functions in order to minimize the inter-cell movements and
maximize a part quality index. Quality index for each part is represented through a
cubic matrix containing integer values of 1-5 (representing very bad, bad, medium,
well and very well), which qualifies the process of part on a specific machine by a
specific worker. To solve the problem, a hybrid GA-augmented ε-constraint method
(GA-AUGMEON) is developed to reduce time consuming difficulty of AUGMECON method.
To validate the model and the GA-AUGMECON algorithm, some randomly generated
examples in small and large size are solved. © 2014 Elsevier Ltd. All rights
reserved.
AUTHOR KEYWORDS: Augmented ε-constraint method; Bi-objective programming; Cubic
cellular manufacturing; Genetic algorithm; Worker flexibility
INDEX KEYWORDS: Cellular manufacturing; Customer satisfaction; Genetic algorithms,
Bi-objective programming; Constraint methods; Manufacturing resource; Non-
homogeneous; Objective functions; Quality indices; Worker assignments; Worker
flexibility, Problem solving
reconfiguration (2009) European Journal of Operational Research, 192, pp. 414-428;
Arkat, A., Hosseini, L., Hosseinabadi Farahani, M., Minimization of exceptional
Aryanezhad, M.B., Deljoo, V., Mirzapour Al-E Hashem, S.M.J., Dynamic cell formation
Askin, R.G., Huang, Y., Forming effective worker teams for cellular manufacturing
10.1080/00207540110040466;
Bajestani, M.A., Rabbani, M., Rahimi-Vahed, A.R., Baharian Khoshkhou, G., A multi-
Bérubé, J.F., Gendreau, M., Potvin, J.Y., An exact ε-constraint method for bi-
objective combinatorial optimization problems: Application to the traveling
salesman problem with profits (2009) European Journal of Operational Research, 194,
pp. 39-50;
review and survey (2005) Computers and Industrial Engineering, 48 (3), pp. 507-
523., DOI 10.1016/j.cie.2003.03.002, PII S0360835204001998,
(2), pp. 182-197., DOI 10.1109/4235.996017, PII S1089778X02041012;
10.1080/00207540600620773, PII U427LP7550425410;
Esmaili, M., Amjady, N., Shayanfar, H.A., Multi-objective congestion management by
modified augmented e-constraint method (2011) Applied Energy, 88, pp. 755-766;
Goldberg, D.E., (1989) Genetic Algorithms: Search, Optimization and Machine
Learning, , Addison-Wesley MA;
Holland, J.H., (1975) Adaptation in Natural and Artificial System, , University of
Michigan Press Ann Arbor, MI;
group technology (2003) International Journal of Production Economics, 86, pp. 121-
131;
Research, 38 (5), pp. 1201-1218., DOI 10.1080/002075400189095;
(2003) Production Planning and Control, 14 (5), pp. 437-446;
Mavrotas, G., Effective implementation of thee-constraint method in multi-objective
mathematical programming problems (2009) Applied Mathematical Computations, 213
(2), pp. 455-465;
Min Hokey, Shin Dooyoung, Simultaneous formation of machine and human cells in
group technology: A multiple objective approach (1993) International Journal of
Neto, A.R.P., Filho, E.V.G., A simulation-based evolutionary multiobjective
approach to manufacturing cell formation (2010) Computers and Industrial
Othman, M., Bhuiyan, N., Gouw, G.J., Integrating workers' differences into
workforce planning (2012) Computers and Industrial Engineering, 63, pp. 1096-1106;
Parkin, R.E., Li, M.-L., The multi-dimensional aspects of a group technology
2358;
Solimanpur, M., Mahdavi, I., Aalaei, A., Paydar, M.M., Multi-objective cell
(2009) International Conference on Business and Information, July 6-8, Kuala
Lumpur, Malaysia;
pp. 2185-2207;
Wood, A.J., Wollenberg, B.F., (1996) Power Generation, Operation and Control, ,
Wiley New York;
pp. 829-853., DOI 10.1080/00207540512331311859;
S0925527305000496
[email protected]
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Hamza, S.A., Adesta, E.Y.T.

55759990800;8417809200;
A comparative study on predicting methods for cell formation problem
(2013) International Review of Mechanical Engineering, 7 (4), pp. 750-756.
84881071619&partnerID=40&md5=77a63961f0af0a45f24a1bc3006619ae
AFFILIATIONS: Department of Manufacturing and Materials Engineering, International

Islamic University Malaysia, P. O. Box 10, 50728 Kuala Lumpur, Malaysia;
Ministry of Higher Education and Scientific Research, Foundation of Technical
education, Iraq
ABSTRACT: The role of Feasibility Assessment (FA) is critical for Cellular
Manufacturing (CM) that based on Group Technology (GT) concept, particularly during
the design phase. The results may be used in decision making process to decide
whether or not job shop may be converted into CM. Through FA some procedures are
followed to identify the right predicted cells number that leads to create
effective CM. In this article two methods of predicting a number of cells have been
examined. The first method is supported by the number of machines in the incidence
matrix and the pre-determinable maximum number of machines in each machine cell.
The second method was based on Rogers and Tanimoto Similarity Coefficient and
Eigenvalues of the Similarity Coefficient Matrix. Ten data sets selected from
literatures are used to test these two methods. The results show that the first
method is less accurate, depends on trial and error, and has multi values where
most of those values are not integers. On the contrary, the second method is very
accurate, has only one solution which is an integer value. Therefore it may be
considered as a more efficient method. Furthermore, this study suggested an
efficient and logical sequence of these two methods in order to identify the
performance of the existing methods that are used in solving cell formation
problems. © 2013 Praise Worthy Prize S.r.l. - All rights reserved.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Eigenvalues;
Feasibility assessment; Similarity coefficients
REFERENCES: Ponnambalam, S.G., Pandian, R.S., Mohapatra, S.S., Saravanasankar, S.,
(2007) Cell formation with workload data in cellular manufacturing system using
genetic algorithm, pp. 674-678., proce. IEEE International Conf. Industrial
Engineering and Engineering Management, December 2-4, Singapore;
Mukattash, A., Idwan, S., Ashhab, M.S., Samhouri, M., Matar, I.A., Optimal
computerized model for designing cellular manufacturing systems using neural
network (2011) J. of Applied sciences, 11 (15), pp. 2837-2842;
Wemmerlov, U., Hyer, N.L., Research issues in cellular manufacturing (1987) Int. J.
Prod. Res, 25, pp. 413-431;
Leno, I.J., Saravanasankar, S., Ponnambalam, S.G., Integrated layout design
approach for cellular manufacturing system environment (2012) J. Applied Sci, 12
(23), pp. 2411-2417;
51 (2), pp. 53-57;
Chang, C.C., Wu, T.H., Chung, S.H., A novel approach for cell formation and cell
layout design in cellular manufacturing system (2009) Proc. International Conf. on
Management and Service Science, pp. 1-4., September 20-22, Wuhan, China;
(2009) Expert Syst. Appl, 36 (2), pp. 3652-3661;
Zahia, K., Messaoud, D., A Meta-Heuristics for the Flexible Manufacturing System
Problem (2010) International Review of Mechanical Engineering (IREME), 4 (3), pp.
330-335;
Kulandaivelu, P., Sundaram, S., Kumar, P.S., Neural Network Based Wear Monitoring
of Single Point Cutting Tool using Acoustic Emission Techniques (2011)
International Review of Mechanical Engineering (IREME), 5 (1), pp. 52-58;
Rezeka, S.F., El-Souhily, B.M., El, H.-G., Shawkey, M.M., Fuzzy Switching of Hybrid
Piezoelectric Damping System (2012) International Review of Mechanical Engineering
(IREME), 6 (4), pp. 779-789;
Economics, 101 (2), pp. 329-352;
cellular manufacturing systems (2007) Int. J. Prod. Res, 45, pp. 913-934;
Arora, P.K., Haleem, A., Singh, M.K., Cell formation techniques: A study (2011)
Int. J. Eng. Sci. Technol, 3, pp. 1178-1181;
Boctor, F.F., A linear formulation of the machine part cell formation problem
Albadawi, Z., Basher, H.A., Chen, M., A mathematical approach for the formation of
manufacturing cells (2005) Comput. Ind. Eng, 48, pp. 3-21;
48, pp. 471-489;
(1998) Comput Ind. Eng, 34, pp. 21-36;
Sarker, B.R., Islam, K.M.S., Relative performances of similarity and dissimilarity
measures (1999) Comput. Ind. Eng, 37, pp. 769-807;
Sarker, B.R., Islam, K.M.S., A similarity coefficient measure and machine-parts
grouping in cellular manufacturing systems (2000) Int. J Prod. Res, 38 (3), pp.
699-720;
in cellular manufacturing (2001) Comput. Ind. Eng, 39, pp. 1-17;
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the U.S. industry: A survey of
users (1989) Int. J. Prod. Res, 27, pp. 1511-1530;
Luong, L., He, J., Abhary, K., Qiu, L., A decision support system for cellular
manufacturing system design (2002) Comput. Ind. Eng, 42, pp. 457-470;
Maleki, R.A., (1991) Flexible Manufacturing Systems: The Technology and Management,
, (Prentice-Hall;
Dunteman, G.H., (1989) Principal Components Analysis, , (2ndEdn, Sage Publication,
Newbury Park, CA, USA;
Bashir, H.A., Karaa, S., Assessment of clustering tendency for the design of
cellular manufacturing systems (2008) J. Manuf. Technol. Manage, 19, pp. 1004-1014;
Arvindh, B., Irani, S.A., Principal component analysis for evaluating the
feasibility of cellular manufacturing without initial machine-part matrix
clustering (1994) Int. J. Prod. Res, 32, pp. 1909-1938;
Int. J. Prod. Res, 30, pp. 1209-1219;
Mukattash, A.M., Al-Tahat, M.D., A developed mathematical computerized approach for
designing cellular manufacturing systems (2006) J. of applied sciences, 6 (9), pp.
1915-1923;
Garbie, I.H., Parsaei, H.R., Leep, H.R., Machine cell formation based on a new
similarity coefficient (2008) J. Ind. Syst. Eng, 1, pp. 318-344;
considerations in cellular manufacturing (1998) Ann. Oper. Res, 77, pp. 97-107;
with capacity planning and multiple routings (1998) Ann. Oper. Res, 77, pp. 79-95;
Rogers, J.S., Tanimoto, T.T., A computer program for classifying plants (1960)
Science, 132, pp. 1115-1118;
and Control, , (Chapman and Hall, London, UK;
Chandrasekharan, M.P., Rajagopalan, R., An ideal seed non hierarchical clustering
algorithm for cellular manufacturmg (1986) International Journal of Production
Research, 24, pp. 451-464;
Chattopadhvay, M., Chattopadhyay, S., Dan, P.K., Machine-part cell formation
through visual decipherable clustering of selforganizing map (2011) Int. J. Adv.
Manuf. Technol, 52, pp. 1019-1030;
Kaiser, H.F., The application of electronic computers to factor analysis (1960)
Educational and psychological Measurement, 20, pp. 141-151
CORRESPONDENCE ADDRESS: Adesta, E. Y. T.; Department of Manufacturing and Materials
Engineering, International Islamic University Malaysia, P. O. Box 10, 50728 Kuala
Lumpur, Malaysia; email: [email protected]
PUBLISHER: Praise Worthy Prize
ISSN: 19708734
ABBREVIATED SOURCE TITLE: Int. Rev. Mech. Eng.
SOURCE: Scopus
Rabbani, M., Farrokhi-Asl, H., Rafiei, H., Khaleghi, R.

57208701862;57115278000;27967949000;55247440200;
Using metaheuristic algorithms to solve a dynamic cell formation problem with
consideration of intra-cell layout design
(2017) Intelligent Decision Technologies, 11 (1), pp. 109-126. Cited 2 times.
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85018705293&doi=10.3233%2fIDT-
160281&partnerID=40&md5=defe30eb0c9ec5a73ae9b720ec9db17f
DOI: 10.3233/IDT-160281
AFFILIATIONS: School for Industrial Engineering, College of Engineering, University
of Tehran, P.O. Box: 11155-4563, Tehran, Iran;
Tehran, Iran
ABSTRACT: This paper proposes a new nonlinear integer mathematical model to address
the cell formation and intra-cell layout problem, as two main steps of designing a
cellular manufacturing system, concurrently. The problem is formulated under
dynamic condition, where product demands may vary from one period to another and
consequently machine-part grouping and machine layout design within each cell are
determined for each period of the planning horizon. In addition to forming the
machine-part groupings, the proposed model determines the best layout within each
cell in each period; few numbers of previous studies have been dedicated to
concurrent problem of dynamic cell formation and intra-cell layout design. Machine
relocation cost, as a main objective function of a dynamic cell formation problem,
is formulated based on the location where machines are being relocated. Intra-cell
and inter-cell part movement costs are also calculated based on the distance
between machine positions and cell positions, respectively. Exhaustive numerical
analyses are reported in order to validate the proposed mathematical model. Then,
two well-known algorithms and one hybrid algorithm including developed simulated
annealing algorithm (SA), particle swarm optimization (PSO), and hybrid particle
swarm optimization (HPSO) are applied to tackle the problem. Mutation operator is
combined with the operators of particle swarm optimization to enhance the
algorithm. The results show that simulated annealing outperforms other algorithms
in this problem. © 2017-IOS Press and the authors. All rights reserved.
AUTHOR KEYWORDS: cellular manufacturing; Dynamic cell formation; intra-cell
layout; particle swarm optimization; simulated annealing
INDEX KEYWORDS: Cells; Cytology; Machinery; Manufacture; Optimization; Particle
swarm optimization (PSO); Product design; Relocation; Simulated annealing, Cell
layout; Cell layout problem; Dynamic cell formation; Hybrid Particle Swarm
Optimization; Inter-cell part movements; Machine-part grouping; Meta heuristic
algorithm; Simulated annealing algorithms, Cellular manufacturing
REFERENCES: Ahi, A., Arianezhad, M.B., Ashtiani, B., Makui, A., A novel approach to
determine cell formation intracellular machine layout and cell layout in the CMS
problem based on TOPSIS method (2009) Comput Oper Res, 36, pp. 1478-1496;
Aalaei, A., Davoudpour, H., A robust optimization model for cellular manufacturing
system into supply chain management (2016) International Journal of Production
Economics;
Alfa, A., Chen, M., Heragu, S., Integrating the grouping and layout problems in
cellular manufacturing systems (1992) Comput Eng, 23, pp. 55-58;
Res, 36, pp. 777-794;
Arkat, J., Farahani, M.H., Hosseini, L., Integrating cell formation with cellular
layout and operations scheduling (2012) Int J Adv Manuf Technol, 61 (5-8), pp. 637-
647;
Handbook of Cellular Manufacturing Systems, pp. 25-34., S.A. Irani, ed., John
Wiley, New York;
pp. 281-309;
a cellular manufacturing environment: A case study (2000) Int J Prod Res, 38, pp.
1689-1709;
Chan, F., Lau, K.W., Chan, P.L.Y., Choy, K.L., Two-stage approach for machine-part
grouping and cell layout problems (2006) Robot Compt-Int Manuf, 22, pp. 217-238;
Dong, M., Wu, C., Hou, F., Shortest path simulated annealing algorithm for dynamic
layout problem under dynamic business environment (2009) Expert Syst Appl, 36, pp.
11221-11232;
Eberhart, R.C., Kennedy, J., A new optimizer using particle swarm theory (1995)
Proceedings of the Sixth International Symposium on Micro Machine and Human
Science, 1, pp. 39-43., October;
formation design: Benders' decomposition approach (2011) Expert Syst Appl, 38, pp.
2478-2488;
Joines, J.A., King, R.E., Culbreth, C.T., A comprehensive review of manufacturing
cell design (1995) Int J of Flex Autom and Integr Manuf, 3, pp. 225-264;
Jolai, F., Tavakkloi-Moghaddam, R., Golmohammadi, A., Javadi, B., An
Syst Appl, 39 (2), pp. 2172-2182;
McKendall, J.A.R., Shang, J., Kuppusamy, S., Simulated annealing heuristic for
dynamic facility layout (2006) Comput Oper Res, 33, pp. 2431-2444;
considering social criteria (2015) Applied Mathematical Modelling;
(4), pp. 2308-2316;
production planning with unreliable machines (2016) Applied Mathematical Modelling,
40 (1), pp. 169-191;
Tavakkloi-Moghaddam, R., Aryanezhad, M.B., Safaei, N., Azaron, A., Solving a
dynamic cell formation problem using metaheuristics (2005) Appl Math Computation,
170, pp. 761-780;
Wei, N.C., Liao, T.J., Chao, I.M., Wu, P., Chang, Y.C., An electromagnetism-Like
mechanism method for solving dynamic cell formation problems (2013) Journal of
Asian Scientific Research, 3 (10), pp. 1022-1035;
identification problem in cellular manufacturing (1986) J Oper Manag, 6, pp. 125-
147;
Wu, X., Chu, C., Wang, Y., Yan, W., A genetic algorithm for integrated cell
formation and layout decisions (2002) IEEE Processing of the Congress on
Evolutionary Computation, pp. 7803-7882;
Wu, X., Chu, C., Wang, Y., Yan, W., Genetic algorithms for integrating cell
formation with machine layout and scheduling (2007) Comput Ind Eng, 53, pp. 277-289
CORRESPONDENCE ADDRESS: Rabbani, M.; School for Industrial Engineering, College of
Engineering, University of Tehran, P.O. Box: 11155-4563, Iran; email:
[email protected]
ISSN: 18724981
ABBREVIATED SOURCE TITLE: Intelligent Decis. Technol
SOURCE: Scopus

24767107500;7406642484;
Fuzzy extensions to Integer Programming models of cell-formation problems in
machine scheduling
(2009) Annals of Operations Research, 166 (1), pp. 163-181. Cited 14 times.
58149517650&doi=10.1007%2fs10479-008-0423-
1&partnerID=40&md5=94fde9ad889d786db108091fcc60c3ba
DOI: 10.1007/s10479-008-0423-1
AFFILIATIONS: Management Science and Information Systems Group, Business School,
Loughborough University, Loughborough LE11 3TU, United Kingdom
ABSTRACT: Cell formation has received much attention from academicians and
practitioners because of its strategic importance to modern manufacturing
practices. Existing research on cell formation problems using integer programming
(IP) has achieved the target of solving problems that simultaneously optimise: (a)
cell formation, (b) machine-cell allocation, and (c) part-machine allocation. This
paper will present extensions of the IP model where part-machine assignment and
cell formation are addressed simultaneously, and also a significant number of
constraints together with an enhanced objective function are considered. The main
study examines the integration of inter-cell movements of parts and machine set-up
costs within the objective function, and also the combination of machine set-up
costs associated with parts revisiting a cell when part machine operation sequence
is taken into account. The latter feature incorporates a key set of constraints
which identify the number of times a part travels back to a cell for a later
machine operation. Due to two main drawbacks of IP modelling for cell formation,
i.e. (a) only one objective function can be involved and (b) the decision maker is
required to specify precisely goals and constraints, fuzzy elements like fuzzy
constraints and fuzzy goals will be considered in the proposed model. Overall the
paper will not only include an extended and enhanced integer programming model for
assessing the performance of cell formation, but also perform a rigorous study of
fuzzy integer programming and demonstrate the feasibility of achieving better and
faster clustering results using fuzzy theory. © 2008 Springer Science+Business
Media, LLC.
AUTHOR KEYWORDS: Cellular manufacturing system; Fuzzy models; Integer
programming; Machine operation sequence; Uncertainty
REFERENCES: Ben-Arieh, D., Triantaphyllou, E., Quantifying data for group
technology with weighted fuzzy features (1992) International Journal of Production
Research, 30, pp. 1285-1299;
Gill, B., Bector, R., A fuzzy linguistic approach to data quantification and
construction of distance measures for the part family formation problem (1997)
Kim, M.H., Lee, J.H., Lee, Y.J., Analysis of fuzzy operators for high quality
retrieval (1993) Information Processing Letters, 46, pp. 252-256;
Kusiak, A., Heragu, S.S., Group technology (1987) Computers in Industry, 9, pp. 83-
91;
Lai, Y.-J., Hwang, C.-L., (1992) Fuzzy Mathematical Programming-methods and
Applications, , Springer Berlin;
Lai, Y.-J., Hwang, C.-L., Interactive fuzzy linear programming (1992) Fuzzy Sets
and Systems, 45, pp. 169-183;
Luhandjula, M.K., Compensatory operators in fuzzy linear programming with multiple
objectives (1982) Fuzzy Sets and Systems, 8, pp. 245-252;
Mjelde, K.M., Fuzzy resource allocation (1986) Fuzzy Sets and Systems, 19, pp. 239-
250;
Purcheck, G.F., Programming method for combinatorial group of an incomplete power
set (1975) Journal of Cybernetics, 5, pp. 51-76;
Sankaran, S., Multiple objective decision making approach to cell formation - A
goal programming model (1990) International Journal of Production Research, 13, pp.
71-81;
Tsai, C.C., Chu, C.H., Barta, T.A., Modelling and analysis of a manufacturing cell
formation problem with fuzzy mixed-integer programming (1997) IIE Transactions, 29,
pp. 533-547;
pp. 81-84;
Wemmerlov, U., Hyer, N.L., Procedures for the part/machine group identification
problem in cellular manufacturing (1986) Journal of Operations Management, 6, pp.
125-147;
Wemmerlov, U., Hyer, N.L., Cell manufacturing in the US industry: A survey of users
Werners, B.M., An interactive fuzzy programming system (1987) Fuzzy Sets and
Systems, 23, pp. 131-147;
Werners, B.M., Mitra, G., Greenberg, H.J., (1988). Aggregation models in
mathematical programming (1988) Mathematical Models for Decision Support, pp. 295-
305., Springer Berlin;
Wiedey, G., Zimmermann, H.J., Media selection and fuzzy linear programming (1978)
Journal of the Operational Research Society, 31, pp. 342-349;
Yang, T., Ignizio, J.P., Fuzzy programming with nonlinear membership functions:
Piecewise linear approximation (1991) Fuzzy Sets and Systems, 41, pp. 39-53;
Zhang, C., Wang, H.P., Concurrent formation of part families and machine cells
based on the fuzzy set theory (1992) Journal of Manufacturing Systems, 11, pp. 61-
67;
Zimmermann, H.J., Fuzzy mathematical programming (1983) Computers and Operations
Research, 10, pp. 291-298;
Zimmermann, H.J., Zysno, P., Decisions and evaluations by hierarchical aggregation
of information (1983) Fuzzy Sets and Systems, 10, pp. 243-266;
Zimmermann, H.J., (1991) Fuzzy Set Theory and Its Applications, , Kluwer Boston
CORRESPONDENCE ADDRESS: Papaioannou, G.; Management Science and Information Systems
Group, Business School, Loughborough University, Loughborough LE11 3TU, United
Kingdom; email: [email protected]
ISSN: 02545330
SOURCE: Scopus
Shafer, S.M., Rogers, D.F.

7102733843;7402049167;
A goal programming approach to the cell formation problem
6963%2891%2990034-U&partnerID=40&md5=b99e6a4afdfe080386c88677966b9344
DOI: 10.1016/0272-6963(91)90034-U
AFFILIATIONS: University of Miami, Coral Gables, FL 33124-9145, United States;
University of Cincinnati, Cincinnati, OH 45221-0130, United States
ABSTRACT: Cellular manufacturing is employed to achieve efficiencies in production
by exploiting similarities inherent in the production of parts. Specifically, parts
with similar processing requirements are identified and the equipment necessary to
process these groups of parts is identified and located together. Several important
design objectives associated with cellular manufacturing are to: 1) reduce setup
times, 2) produce parts cell complete, i.e., minimize intercellular movements of
parts, 3) minimize investment in new equipment, and 4) maintain acceptable machine
utilization levels. The goal of this research was to develop a cell formation
procedure that directly addressed these design objectives. To achieve this, three
goal programming models were developed corresponding to three unique situations:
(1) setting up an entirely new system and purchasing all new equipment, (2)
reorganizing the system using only existing equipment, and (3) reorganizing the
system using existing equipment and some new equipment. Several assumptions were
made in the development of the goal programming models. First, it was assumed that
each part had a fixed routing. Also, it was assumed that the processing times for
the parts at each machine, the demand for each part, and the capacity and cost of
each machine were known. In addition it was assumed that a given machine type could
be placed in more than one cell and that the sequence in which the parts are
processed affects setup times. Finally, it was assumed that a batch of each part is
produced every production cycle and that only one batch of parts is processed in a
particular cell at any given time. Clearly defining the objectives and constraints
associated with the cell formation problem is the major contribution of the three
formulations. Correct identification of the problem and the relationships inherent
to cellular manufacturing is a necessary first step in the decision process that
heretofore has not received adequate attention. However, because of the large
number of 0 1 variables contained in the goal programming formulations they are
very difficult to solve for realistically-sized problems. Thus, a heuristic
solution procedure is presented. The heuristic solution procedure involved
partitioning the goal programming formulations into two Subproblems and solving
them in successive stages. A numerical example is presented that illustrates the
two-stage heuristic procedure. © 1991.
REFERENCES: Askin, Subramanian, A Cost-Based Heuristic for Group Technology
Configuration (1987) International Journal of Production Research, 25 (1), pp. 101-
113;
Askin, Chiu, A Graph Partitioning Procedure for Machine Assignment and Cell
Formation in Group Technology (1990) International Journal of Production Research,
28 (8), pp. 1555-1572;
Choobineh, A Framework for the Design of Cellular Manufacturing Systems (1988)
Co, Araar, Configuring Cellular Manufacturing Systems (1988) International Journal
Foo, Wager, Set-up Times in Cyclic and Acyclic Group Technology Scheduling Systems
Goldratt, Cox, (1986) The Goal, , North River Press, New York;
Gunasingh, Lashkari, Machine Grouping Problem in Cellular Manufacturing Systems -
An Integer Programming Approach (1989) International Journal of Production
Research, 27 (9), pp. 1465-1473;
Kusiak, The Generalized Group Technology Concept (1987) International Journal of
Marsten, The Design of the XMP Linear Programming Library (1981) ACM Transactions
on Mathematical Software, 7 (4), pp. 481-497;
Marsten, (1987) Users Manual for ZOOM/XMP, , University of Arizona, Tuscon, AZ;
Morris, Tersine, A Comparison of Cell Loading Practices in Group Technology (1989)
Journal of Manufacturing and Operations Management, 2 (4), pp. 299-313;
Shafer, Meredith, (1990) An Empirically-Based Simulation Study of Cellular Versus
Functional Layouts, , University of Miami, Coral Gables, FL 33124-9145, Working
Paper;
Shtub, Modelling Group Technology Cell Formation as a Generalized Assignment
Vakharia, Methods of Cell Formation in Group Technology: A Framework for Evaluation
Wagner, (1969) Principles of Operations Research With Applications to Managerial
Decisions, , Prentice Hall, New Jersey;
Wei, Gaither, An Optimal Model for Cell Formation Decisions (1990) Decision
Sciences, 21 (2), pp. 416-433;
pp. 125-147
CORRESPONDENCE ADDRESS: Shafer, S.M.; University of Miami, Coral Gables, FL 33124-
9145, United States
ISSN: 02726963
CODEN: JOTME
SOURCE: Scopus
Dimopoulos, C.
56235396300;
Explicit consideration of multiple objectives in cellular manufacturing
34347220551&doi=10.1080%2f03052150701351631&partnerID=40&md5=eb442ee4f9e69a280851d5
28e72031e2
DOI: 10.1080/03052150701351631
AFFILIATIONS: School of Computer Science and Engineering, Cyprus College, 6
Diogenous Street, Engomi, PO Box 22006, 1516 Nicosia, Cyprus
ABSTRACT: Although many methodologies have been proposed for solving the cell-
formation problem, few of them explicitly consider the existence of multiple
objectives in the design process. In this article, the development of multi-
objective genetic programming single-linkage cluster analysis (GP-SLCA), an
evolutionary methodology for the solution of the multi-objective cell-formation
problem, is described. The proposed methodology combines an existing algorithm for
the solution of single-objective cell-formation problems with NSGA-II, an elitist
evolutionary multi-objective optimization technique. Multi-objective GP-SLCA is
able to generate automatically a set of non-dominated solutions for a given multi-
objective cell-formation problem. The benefits of the proposed approach are
illustrated using an example test problem taken from the literature and an
industrial case study.
AUTHOR KEYWORDS: Cell-formation problem; Cellular manufacturing; Evolutionary
algorithms; Genetic programming; Multi-objective optimization; NSGA
INDEX KEYWORDS: Cluster analysis; Evolutionary algorithms; Genetic programming;
Industrial applications; Multiobjective optimization; Problem solving, Cell
formation problem; Single linkage cluster analysis (SLCA), Cellular manufacturing
REFERENCES: Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D., (1998) Genetic
Programming: An Introduction, , Morgan Kaufman: San Francisco, CA;
Boctor, F.F., The minimum cost machine-part cell formation problem (1996) Int. J.
Prod. Res, 34 (4), pp. 1045-1063;
Burbidge, J.L., (1975) The Introduction of Group Technology, , John Wiley: New
York;
formation of part families and machine-cells (1987) Int. J. Prod. Res, 25 (6), pp.
835-850;
Coello Coello, C.A., Evolutionary multiobjective optimization: A historical view of
the field (2006) IEEE Comput. Intell. Mag, 1 (1), pp. 28-36;
genetic algorithm: NSGA-II (2002) IEEE Trans. Evol. Comput, 6 (2), pp. 182-197;
in the area of production research (2004) Congress on Evolutionary Computation (CEC
'04), pp. 1487-1494;
Res, 39 (1), pp. 1-19;
Dimopoulos, C., Mort, N., Evolving knowledge for the solution of clustering
problems in cellular manufacturing (2004) Int. J. Prod. Res, 42 (19), pp. 4119-
4133;
Eiben, A.E., Smith, J.E., (2003) Introduction to Evolutionary Computing, ,
Springer-Verlag: Berlin;
Fonseca, C.M., Fleming, P.J., Genetic algorithms for multiobjective optimization:
Formulation, discussion and generalization (1993) Fifth International Conference on
Genetic Algorithms and their Applications, pp. 416-423;
Oper. Res, 109, pp. 286-298;
to cell-composition and layout design problems (1996) Int. J. Prod. Res, 34 (2),
pp. 447-482;
Ho, Y.-C., Moodie, C.L., Solving cell formation problems in a manufacturing
environment with flexible processing and routing capabilities (1996) Int. J. Prod.
Res, 34 (10), pp. 2901-2923;

Koza, J.R., (1992) Genetic Programming: On the Programming Of Computers by Means of
Natural Selection, , MIT Press: Cambridge, MA;
Lin, L.T., Dessouky, M.M., Kumar, K.R., Ng, M.S., A heuristic-based procedure for
the weighted production-cell-formation problem (1996) IIE Trans, 28 (7), pp. 579-
589;
McAuley, J., Machine grouping for efficient production (1972) Prod. Eng, 51 (2),
pp. 53-57;
approaches to multi-criteria cell design (2000) Int. J. Prod. Res, 38 (5), pp.
1201-1218;
Schaffer, J.D., (1984) Multiple objective optimization with vector evaluated
genetic algorithms, , PhD thesis, Vanderbilt University;
Selim, M.H., Askin, R.G., Vakharia, A.J., Cell formation in group technology:
Review, evaluation and directions for future research (1998) Comput. Indust. Eng,
34 (1), pp. 3-20;
to the design of cellular manufacturing systems (2004) Int. J. Prod. Res, 42 (7),
pp. 1419-1441;
Srinivas, N., Deb, K., Multiobjective optimization using nondominated sorting in
genetic algorithms (1994) Evol. Comput, 2 (3), pp. 221-248;
component grouping problem with multiple objectives (1992) Comput. Indust. Eng, 22
(4), pp. 469-480;
Wemmerlov, U., Johnson, D.J., Empirical findings in manufacturing cell design
(2000) Int. J. Prod. Res, 38, pp. 481-507;
Zhao, C., Wu, Z., A genetic algorithm for manufacturing cell-formation with
multiple routes and multiple objectives (2000) Int. J. Prod. Res, 38 (3), pp. 385-
395;
Zitzler, E., Thiele, L., Multiobjective evolutionary algorithms: A comparative case
study and the strength Pareto approach (1999) IEEE Trans. Evol. Comput, 3 (4), pp.
257-271;
Zitzler, E., Thiele, L., SPEA2: Improving the performance of the strength Pareto
evolutionary algorithm (2001), Tech. Rep. 103, Computer Engineering and
Communication Networks Laboratory (TIK, Swiss Federal Institute of Technology ETH,
ZurichCORRESPONDENCE ADDRESS: Dimopoulos, C.; School of Computer Science and
Engineering, Cyprus College, 6 Diogenous Street, Engomi, PO Box 22006, 1516
Nicosia, Cyprus; email: [email protected]
ISSN: 0305215X
CODEN: EGOPA
SOURCE: Scopus
Dimopoulos, C.
56235396300;
Multi-objective optimization of manufacturing cell design
30 times.
33749577842&doi=10.1080%2f00207540600620773&partnerID=40&md5=e90e893fd89b8df9af5994
501e7bd49c
DOI: 10.1080/00207540600620773
AFFILIATIONS: School of Computer Science and Engineering, Cyprus College, 6
Diogenous Street, Engomi, P.O. Box 22006, 1516 Nicosia, Cyprus
ABSTRACT: Whereas the single-objective cell-formation problem has been studied
extensively during the past decades, research on the multi-objective version of the
problem has been relatively limited, despite the fact that it represents a more
realistic modelling of the manufacturing environment. This article introduces
multi-objective GP-SLCA, an evolutionary computation methodology for the solution
of the multi-objective cell-formation problem. GP-SLCA is a hybrid algorithm,
comprising of GP-SLCA, a genetic programming algorithm for the solution of single-
objective cell-formation problems, and NSGA-II, a standard evolutionary multi-
objective optimization technique. The proposed methodology is capable of providing
the decision maker with a range of non-dominated solutions instead of a single
compromise solution, which is usually produced as an outcome of alternative multi-
objective optimization techniques. The application of multi-objective GP-SLCA is
illustrated on a large-sized test problem taken from the literature.
AUTHOR KEYWORDS: Cell-formation problem; Cellular manufacturing; Evolutionary
computation; Genetic programming; Multi-objective optimization; NSGA-II
INDEX KEYWORDS: Cell-formation problems; Genetic programming; Multi-objective
optimization; NSGA-II, Evolutionary algorithms; Genetic algorithms; Optimization;
Problem solving; Product design, Cellular manufacturing
Programming: An Introduction, , (Morgan Kaufman: San Francisco);
Boctor, F.F., The minimum cost machine-part cell formation problem (1996) Int. J.
Prod. Res., 34, pp. 1045-1063;
Burbidge, J.L., (1975) The Introduction of Group Technology, , (Wiley: New York);
Deb, K., (2001) Multi-objective Optimization Using Evolutionary Algorithms, ,
(Wiley: New York);
genetic algorithm: NSGA-II (2002) IEEE Trans. Evol. Comput., 6, pp. 182-197;
in the area of production research (2004) Congress on Evolutionary Computation
(CEC'04), pp. 1487-1494;
Dimopoulos, C., A Genetic Programming methodology for the solution of the
multiobjective cell-formation problem (2005) 8th Joint Conference on Information
Sciences;
Dimopoulos, C., A novel approach for the solution of the multiobjective cell-
formation problem (2005) 18th International Conference on Production Research;
Dimopoulos, C., Mort, N., Solving cell-formation problems under alternative quality
criteria and constraints with a genetic programming-based hierarchical clustering
algorithm (2000) 6th International Conference on Control, Automation, Robotics and
Vision, pp. 3445-3446;
Res., 39, pp. 1-19;
problems in cellular manufacturing (2004) Int. J. Prod. Res., 42, pp. 4119-4133;
for manufacturing optimisation: Problems, solutions and comparisons (2000) IEEE
Trans. Evol. Comput., 4, pp. 93-113;
Dimopoulos, C., Zalzala, A.M.S., Investigating the use of genetic programming for a
classic one-machine scheduling problem (2001) Adv. Engng. Softw., 32, pp. 489-498;
Ehrgott, M., Gandibleux, X., A survey and annotated bibliography of rnulticriteria
combinatorial optimization (2000) OR Spektrum, 22, pp. 425-460;
Fogel, L.J., Owens, A.J., Walsch, M.J., (1966) Artificial Intelligence Through
Simulated Evolution, , (Wiley; New York);
Formulation, discussion and generalization (1993) 5th International Conference on
Genetic Algorithms and their Applications, pp. 416-423;
Goldberg, D.E., (1989) Genetic. Algorithms in Search, Optimisation and Machine
Learning, , (Addison-Wesley: Reading, MA);
Oper. Res., 109, pp. 286-298;
to cell-composition and layout design problems (1996) Int. J. Prod. Res., 34, pp.
447-482;
Ho, Y.-C., Moodie, C.L., Solving cell formation problems in a manufacturing
environment with flexible processing and routing capabilities (1996) Int. J. Prod.
Res., 34, pp. 2901-2923;
Holland, J.H., (1975) Adaptation in Natural and Artificial Systems, , (University
of Michigan Press: Ann Arbor);
Horn, J., Nafpliotis, N., Multiobjective optimization using the Niched Pareto
genetic algorithm (1993) IlliGAl Report 93005, , University of Illinois at Urbana-
Champaign, Urbana, Illinois, USA;
Hsu, C.-M., Su, C.-T., Multi-objective machine-component grouping in cellular
manufacturing: A genetic algorithm (1998) Prod. Plann. Contr., 9, pp. 155-166;
Koza, J.R., (1992) Genetic Programming: On the Programming of Computern by Means of
Natural Selection, , (MIT Press Cambridge, MA);
Kusiak, A., (1990) Intelligent Manufacturing Systems, , (Prentice Hall: Englewood
Cliffs, NJ);
Lee, H., Garcia-Diaz, A., A network flow approach to solve clustering problems
(1993) Int. J. Prod. Res., 31, pp. 603-612;
approaches to multi-criteria cell design (2000) Int. J. Prod. Res., 38, pp. 1201-
1218;
Mcauley, J., Machine grouping for efficient production (1972) Prod. Engineer., 51,
pp. 53-57;
Rechenberg, I., (1973) Evolutionsstrategie: Optimierung Technischer Systeme Nach
Prinzipien Derbiologischen Evolution, , (Frommann-Holzboog: Stuttgart, Germany);
Schaffer, J.D., (1984) Multiple Objective Optimization with Vector Evaluated
Genetic Algorithms, , PhD thesis, Vanderbilt University;
Review, evaluation and directions for future research (1998) Comput. Ind. Engng.,
34, pp. 3-20;
1419-1441;
genetic algorithms (1994) Evol. Comput., 2, pp. 221-248;
Van Veldhuizen, D.A., Lamont, G., Multiobjective evolutionary algorithms: Analyzing
the state-of-the-art (2000) Evol. Comput., 8, pp. 125-147;
component grouping problem with multiple objectives (1992) Comput. Ind. Engng., 22,
pp. 469-480;
Wei, J.C., Gaither, N., An optimal model for cell-formation decisions (1990) Decis.
Sci., 21, pp. 416-433;
(2000) Inr. J. Prod. Res., 38, pp. 481-507;
Zhao, C., Wu, Z., A genetic algorithm for manufacturing cell-formation with

study and the Strength Pareto approach (1999) IEEE Trans. Evol. Comput., 3, pp.
257-271;
Zitzler, E., Thiele, L., SPEA2: Improving the performance of the Strength Pareto
Evolutionary Algorithm (2001) Technical Report, 103., Computer Engineering and
Communication Networks Lab (TIK), Swiss Federal Institute of Technology (ETH),
Zurich
CORRESPONDENCE ADDRESS: Dimopoulos, C.; School of Computer Science and Engineering,
Cyprus College, 6 Diogenous Street, Engomi, P.O. Box 22006, 1516 Nicosia, Cyprus;
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus

57188978487;36147113000;
Optimization of the material handling costs and the machine reliability in cellular
manufacturing system using cuckoo search algorithm
(2019) Neural Computing and Applications, 31 (8), pp. 3743-3757.
85040084340&doi=10.1007%2fs00521-017-3302-
3&partnerID=40&md5=7b61f5c336499ae16b15b7505793f9ab
DOI: 10.1007/s00521-017-3302-3
ABSTRACT: Lean manufacturing is a systematic method to improve productivity and
reduce costs for each industrial. One of the tools for lean is the cellular
manufacturing that divides the production system into smaller subsystems. The
objective is to reduce inventory, setup times, and material handling costs. The
manufacturing cell formation problem presents the first issue faced in designing a
cellular manufacturing system. In this paper, the presence of alternative process
routings and machine reliability in addition to production volume, operation
sequence and production time makes the problem more complex but also more realistic
and appealing to real-world applications. Most authors solve this kind of problems
by mathematical programming approaches that require large amounts of computational
efforts. Therefore, a meta-heuristic algorithm, entitled Hybrid cuckoo search for
the generalized cell formation problem, is considered in this paper. A set of
benchmark problems with various scales is used to further evaluate the performance
of the proposed method. Comparison of the results obtained with those obtained by
LINGO and by the simulated annealing method reveals the better effectiveness and
efficiency of our method. © 2018, The Natural Computing Applications Forum.
AUTHOR KEYWORDS: Alternative routing; Cuckoo search; Generalized cell formation
problem; Machine reliability
INDEX KEYWORDS: Benchmarking; Cost reduction; Heuristic algorithms; Materials
handling; Mathematical programming; Productivity; Reliability; Simulated annealing,
Alternative process routings; Alternative routing; Cell formation problem; Cuckoo
searches; Effectiveness and efficiencies; Machine reliability; Manufacturing cell
formation; Simulated annealing method, Cellular manufacturing
REFERENCES: Wemmerlöv, U., Hyer, N.L., Cellular manufacturing in the U.S. industry:
a survey of users (1989) Int J Prod Res, 27, pp. 1511-1530;
with variant number of cells (2016) Prod Eng;
Evol Comput, 4, pp. 93-113;
561-569;
Ameli, J.M.S., Arkat, J., Barzinpour, F., Modelling the effects of machine
Technol, 39, pp. 838-850;
Karoum, B., Elbenani, B., El Khattabi, N., Et El Imrani, A.A., Manufacturing Cell
Formation Problem Using Hybrid Cuckoo Search Algorithm (2018) Recent Developments
in Metaheuristics. Operations Research/Computer Science Interfaces Series, 62, pp.
151-162., Amodeo L, Talbi EG, Yalaoui F, Springer, Cham;
850;
Ameli, J.M.S., Arkat, J., Cell formation with alternative process routings and
machine reliability consideration (2008) Int J Adv Manuf Technol, 35, pp. 761-768;
Selection (2014) Int J Comput Integr Manuf, 27, pp. 772-786;
Kumar, S., Sharma, R.K., Cell formation heuristic procedure considering production
data (2014) Int J Prod Manag Eng, 2, pp. 75-84;
multiple process routings (2013) Comput Ind Eng, 66 (4), pp. 781-790;
reliability and parts alternative process routings (2016) Int J Prod Res, 54 (3),
pp. 846-863;
Ameli, J.M.S., Arkat, J., Sakri, M.S., Applying metaheuristics in the generalized
cell formation problem considering machine reliability (2008) J Chin Inst Ind Eng,
25 (4), pp. 261-274;
Rodrigues, L.C.A., Weller, T.R., Cell formation with alternative routings and
capacity considerations: a hybrid tabu search approach (2008) MICAI 2008: advances
in artificial intelligence, pp. 482-491., (,),. In;
Technol, 46, pp. 1201-1213;
50, pp. 1135-1144;
Chung, S., Wu, T., Chang, C., An efficient Tabu search algorithm to the cell
(2011) Comput Ind Eng, 60, pp. 7-15;
alternative processing routes and operation sequence (2011) Int J Prod Res, 49, pp.
5833-5849;
alternative process routings (2012) Int J Prod Res, 50 (15), pp. 4075-4089;
Ozcelik, F., Sarac, T., A genetic algorithm extended modified sub-gradient
algorithm for cell formation problem with alternative routings (2012) Int J Prod
Res, 50, pp. 4025-4037;
Scatter search (2012) J Intell Manuf, 23, pp. 1127-1139;
Lian, J., Liu, C., Li, W., Evans, S., Yin, Y., Formation of independent
Int J Prod Res, 52, pp. 1363-1400;
Vin, E., Delchambre, A., Generalized cell formation: iterative versus simultaneous
resolution with grouping genetic algorithm (2014) J Intell Manuf, 25, pp. 1113-
1124;
(2015) J Manuf Syst, 35, pp. 155-163;
and machine reliability (2014) Asia-Pac J Oper Res, 31, p. 1450021;
Huang, H., Feng, H., Pan, E., Xi, L., A hybrid discrete Cuckoo Search algorithm for
cell formation problem with alternative process routings and operation sequence
(2016) In: 2016 IEEE International Conference on Industrial Engineering and
Engineering Management (IEEM), , https://doi.org/10.1109/ieem.2016.7798030;
Karoum, B., Elbenani, Y.B., A clonal selection algorithm for the generalized cell
formation problem considering machine reliability and alternative routings (2017)
Prod Eng, 11, pp. 545-556;
Mohammadi, M., Forghani, K., A hybrid method based on genetic algorithm and dynamic
programming for solving a biobjective cell formation problem considering
alternative process routings and machine duplication (2017) Appl Soft Comput, 53,
pp. 97-110;
Rezazadeh, H., Khiali-Miab, A., A two-layer genetic algorithm for the design of
reliable cellular manufacturing systems (2017) Int J Ind Eng Comput, 8, pp. 315-
332;
Adenso-Diaz, B.L., Ozano, S., Racero, J., Guerrero, F., Machine cell formation in
42, pp. 2419-2433;
Int J Prod Res, 42, pp. 3911-3927;
44, pp. 2133-2167;
Spiliopoulos, K., Sofianopoulou, S., Manufacturing cells design with alternative
routings in generalized group technology: reducing the complexity of the solution
space (2007) Int J Prod Res, 45, pp. 1355-1367;
cell formation with alternative process plans (2008) Int J Prod Res, 46 (2), pp.
345-369;
Yang, X.S., Deb, S., Cuckoo search via Lévy flights (2009) World Congress on Nature
and Biologically Inspired Computing, Nabic 2009, pp. 210-214;
Valian, E., Mohanna, S., Tavakoli, S., Improved cuckoo search algorithm for feed
forward neural network training (2011) Int J Artif Intell Appl, 2, pp. 36-43;
Durgun, I., Yildiz, A.R., Structural design optimization of Vehicle components
using cuckoo search algorithm (2012) Mater Test, 54, pp. 185-188;
Gherboudj, A., Layeb, A., Chikhi, S., Solving 0–1 knapsack problems by a discrete
binary version of cuckoo search algorithm (2012) Int J Bio-Inspired Comput, 4, pp.
229-236;
Abdelaziz, A.Y., Ali, E.S., Cuckoo search algorithm based load frequency controller
design for nonlinear interconnected power system (2015) Int J Electr Power Energy
Syst, 73, pp. 632-643;
Chaine, S., Tripathy, M., Design of an optimal SMES for automatic generation
control of two-area thermal power system using cuckoo search algorithm (2015) J
Electr Syst Inf Technol, 2, pp. 1-13;
Ramakrishnan, B., Sreedivya, S.R., Selvi, M., Adaptive routing protocol based on
cuckoo search algorithm (ARP-CS) for secured vehicular ad hoc network (VANET)
(2015) Int J Comput Netw Appl (IJCNA), 2 (4), pp. 173-178;
Nguyen, T.T., Truong, A.V., Distribution network reconfiguration for power loss
minimization and voltage profile improvement using cuckoo search algorithm (2015)
Int J Electr Power Energy Syst, 68, pp. 233-242;
Ouaarab, A., Ahïod, B., Yang, X.S., Abbad, M., Discrete cuckoo search algorithm for
job shop scheduling problem (2014) 2014 IEEE International Symposium on Intelligent
Control (ISIC), Juan Les Pins, pp. 1872-1876;
Majumder, A., Laha, D., A new cuckoo search algorithm for 2-machine robotic cell
scheduling problem with sequence-dependent setup times (2016) Swarm Evol Comput,
28, pp. 131-143;
Tran, C.D., Dao, T.T., Vo, V.S., Nguyen, T.T., Economic load dispatch with multiple
fuel options and valve point effect using cuckoo search algorithm with different
distributions (2015) Int J Hybrid Inf Technol, 8, pp. 305-316;
Sekhar, P., Mohanty, S., An enhanced cuckoo search algorithm based contingency
constrained economic load dispatch for security enhancement (2016) Int J Electr
Power Energy Syst, 75, pp. 303-310;
Suresh, S., Lal, S., An efficient cuckoo search algorithm based multilevel
thresholding for segmentation of satellite images using different objective
functions (2016) Expert Syst Appl, 58, pp. 184-209;
Pare, S., Kumar, A., Bajaj, V., Singh, G.K., A multilevel color image segmentation
technique based on cuckoo search algorithm and energy curve (2016) Appl Soft
Comput, 47, pp. 76-102;
Jia, B., Yu, B., Wu, Q., Yang, X., Wei, C., Law, R., Fu, S., Hybrid local diffusion
maps and improved cuckoo search algorithm for multiclass dataset analysis (2016)
Neurocomputing, 189, pp. 106-116;
245;
considering alternative routing (1997) Comput Integr Manuf Syst, 10, pp. 93-108;
Nagi, R., Harhalakis, G., Proth, J.M., Multiple routings and capacity consideration
207-220
[email protected]
ISSN: 09410643
ABBREVIATED SOURCE TITLE: Neural Comput. Appl.
SOURCE: Scopus
Durga Rajesh, K.V., Krishna, A.S., Siva Rao, V.S., Phanindra, U.V.S., Kamal, B.
57203667069;57211464663;33068332900;57209498278;57209502176;
Matlab based manhattan distance matrix method to solve cell formation problems
(2019) International Journal of Innovative Technology and Exploring Engineering, 8
(8), pp. 3102-3105.
85067995682&partnerID=40&md5=95e703b8af8d2bfcdb4171fc562f1c39

Foundation, Vaddeswaram, A.P., India
ABSTRACT: The Cell Formation Technique in Cellular Manufacturing System (CMS) is
mainly focused in this paper, which is a Group Technology (GT) based application.
The vital step in CMS design is the Cell Formation (CF). The main task of Formation
of Cells is to combine parts and machines. A new heuristic approach was proposed in
this paper to achieve CF based on the Manhattan Distance Matrix (MDM) Method.
MATLAB CODE is developed for the method proposed above. As a measure of performance
Grouping Efficacy (GE) is considered. Computational works were conducted with case
study problem set taken from standard article. Results after computation determine
that the GE performance of our heuristic approach is finer or equal to the other
well-known active algorithms ROC & ROC-2. © BEIESP.
AUTHOR KEYWORDS: Cell Formation; Cellular Manufacturing System; Group Technology;
Grouping Efficacy; Manhattan Distance Matrix
REFERENCES: Euclidean Distance Matrix and types, Wikipedia; Laha, D., Hazarika, M.,
A heuristic approach based on EDM for the machine-part CFP (2017) Materials Today:
Proceedings, 4, pp. 1442-1451;
Hachicha, W., Formation of machine groups and part families in CMS using a
correlation analysis approach (2007) Int. Journal Adv. Mfg. Technology, 36, pp.
1157-1169;
Satheesh Kumar, V., Evaluation of CFA and Implementation of MOD-SLC Algorithm as an
effective CMS in a Mfg. Industry (2014) Internaional Journal of Current Engg. and
Tech., 2, pp. 183-190;
Modrak, V., Sudhakara Pandian, R., (2012) Operations Managment Research and CMS, ,
Hershey PA: Business Science Reference;
Durga Rajesh, K.V., SEDM: A Heuristic Based Approach for CFA (2016) Int. Journal of
Applied Engg. Research, 11, pp. 7044-7048;
Durga Rajesh, K.V., An Effective Similarity Based Sheep Flock Heredity Algorithm to
Anticipate Number of Cells (2018) Journal of Advanced Research in Dynamical and
Control Systems, 9, pp. 2720-2726;
Durga Rajesh, K.V., VBA for Solving CFP (2018) Materials Today: Proceedings, 5, pp.
27185-27192;
Durga Rajesh, K.V., An Efficient SFHA for the CFP (2017) ARPN Journal of Engg. &
App. Sciences, 12, pp. 6074-6079;
Durga Rajesh, K.V., Chalapathi, P.V., Performance Analysis of Enhanced Cell
Formation Techniques in a Manufacturing Industry – A Case Study (2019)
International Journal of Innovative Technology and Exploring Engineering, 8, pp.
574-578;
Durga Rajesh, K.V., Chalapathi, P.V., Application of Efficient SFHA and TLBO
Algorithms for Cell Formation Problems in Cellular Manufacturing Environment (2019)
International Journal of Mechanical and Production Engineering Research and
Development, 9, pp. 43-52
PUBLISHER: Blue Eyes Intelligence Engineering and Sciences Publication
ISSN: 22783075
ABBREVIATED SOURCE TITLE: Int. J. Innov. Technol. Explor. Eng.
SOURCE: Scopus
Soto, R., Crawford, B., Castillo, S., Olivares, R.

24403038600;23395875300;57202944980;55096374700;
Resolution of the manufacturing cell formation problem using the Spider Monkey
Metaheuristic [Resolución de Problema de Formación de Celdas de Manufactura
Utilizando la Metaheurística Spider Monkey]
(2018) Iberian Conference on Information Systems and Technologies, CISTI, 2018-
June, pp. 1-7.
85049873924&doi=10.23919%2fCISTI.2018.8399304&partnerID=40&md5=bb2155d15feb5bb8d288
07a2e5da837d
DOI: 10.23919/CISTI.2018.8399304
AFFILIATIONS: Escuela de Ingeniería en Informática, Pontificia Universidad Católica
de Valparaíso, Valparaíso, Chile;
Escuela de Ingeniería Civil Informática, Universidad de Valparaíso, Valparaíso,
Chile
ABSTRACT: The Manufacturing Cell Design Problem (MCDP) consists on the grouping of
machines, from a production plant, into independent manufacturing cells. The idea
is that each cell processes families of parts, thus reducing movements of the parts
among cells. The main reason to perform this procedure is to reduce cost and time
in the production of parts. To solve this problem, we use the Spider Monkey
Optimization metaheuristic (SMO), an algorithm based on nature that has a fission-
fusion social structure. This has resolved 90 instances of the problem of
manufacturing cells, taken from the experiments of Boctor. The results obtained
have shown that the SMO algorithm is able to successfully reach all the optimal
values. © 2018 AISTI.
AUTHOR KEYWORDS: Manufacturing Cell Design Problem; Metaheuristic; Optimization;
Spider Monkey Optimization Algorithm
INDEX KEYWORDS: Cells; Cellular manufacturing; Cytology; Flexible manufacturing
systems; Information systems; Information use; Optimization, Cell design;
Manufacturing cell formation; Metaheuristic; Optimal values; Production plant; SMO
algorithms; Social structure; Spider monkey optimizations, Problem solving
REFERENCES: Kusiak, A., Chow, W.S., Decomposition of manufacturing systems (1988)
IEEE J. Robot. Autom, 4 (5), pp. 457-471;
Bansal, J.C., Sharma, H., Jadon, S.S., Clerc, M., Spider monkey optimization
algorithm for numerical optimization (2014) Memetic Comput, 6 (1), pp. 31-47;
Dorigo, M., Birattari, M., Stutzle, T., Ant colony optimization (2006) IEEE Comput.
Intell. Mag, 1 (4), pp. 28-39;
Eberhart, R., Kennedy, J., A new optimizer using particle swarm theory (1995) Micro
Machine and Human Science, 1995. MHS'95., Proceedings of the Sixth International
Symposium on, pp. 39-43;
Price, K., Storn, R.M., Lampinen, J.A., (2006) Differential Evolution: A Practical
Approach to Global Optimization, , Springer Science &Business Media;
Vesterstrom, J., Thomsen, R., A comparative study of differential evolution,
particle swarm optimization, and evolutionary algorithms on numerical benchmark
problems (2004) Evolutionary Computation, 2004. CEC2004. Congress on, 2, pp. 1980-
1987;
Bansal, J.C., Sharma, H., Jadon, S.S., Clerc, M., Spider Monkey Optimization
algorithm for numerical optimization (2014) Memetic Comput, 6 (1), pp. 31-47;
Bonabeau, E., Dorigo, M., Theraulaz, G., (1999) Swarm Intelligence: From Natural to
Artificial Systems, (1)., Oxford university press;
Burbidge, J.L., Production flow analysis for planning group technology (1991) J.
Oper. Manag, 10 (1), pp. 5-27;
cell formation with multiple identical machines (2003) Eur. J. Oper. Res, 151 (2),
pp. 434-446;
manufacturing cells (1999) Int. J. Prod. Econ, 60, pp. 421-426;
1617;
516;
Duran, O., Rodriguez, N., Consalter, L.A., Collaborative particle swarm
Expert Syst. Appl, 37 (2), pp. 1563-1567;
Yang, X.-S., Hossein Gandomi, A., Bat algorithm: A novel approach for global
engineering optimization (2012) Eng. Comput, 29 (5), pp. 464-483;
cell design problems using a shuffled frog leaping algorithm (2015) The 1st
pp. 253-261., November 28-30, Beni Suef, Egypt, 2016;
Soto, R., Solving manufacturing cell design problems by using a dolphin
echolocation algorithm (2016) International Conference on Computational Science and
Its Applications, pp. 77-86;
Conference on Artificial Intelligence, pp. 270-281;
(2016) Sci. Program, 2016, p. 21;
problems using an artificial fish swarm algorithm (2015) Mexican International
Conference on Artificial Intelligence, pp. 282-290;
Boctor, F.F., A Jinear formulation of the machinepart cell formation problem (1991)
Int. J. Prod. Res, 29 (2), pp. 343-356;
Soto, R., Crawford, B., Lama, J., Almonacid, B., A firefly algorithm to solve the
manufacturing cell design problem (2016) Information Systems and Technologies
(CISTI), 2016 11th Iberian Conference on, pp. 1-7
EDITORS: Rocha A., Cota M.P., Lozano-Tello A., Goncalves R.
ISSN: 21660727
ISBN: 9789899843486
LANGUAGE OF ORIGINAL DOCUMENT: Portuguese
ABBREVIATED SOURCE TITLE: Iberian Conf. Inf. Syst. Technol., CISTI
SOURCE: Scopus
Arghish, O., Tavakkoli-Moghaddam, R., Shahandeh-Nookabadi, A., Rezaeian, J.

56102482800;56491438400;57193549819;15078048200;
Comparison among four calibrated meta-heuristic algorithms for solving a type-2
fuzzy cell formation problem considering economic and environmental criteria
(2018) Advances in Production Engineering And Management, 13 (1), pp. 5-17.
85044316121&doi=10.14743%2fapem2018.1.269&partnerID=40&md5=9578274a3315b0707328c058
67266d87
DOI: 10.14743/apem2018.1.269
AFFILIATIONS: Department of Industrial Engineering, Science and Research Branch,
Islamic Azad University, Tehran, Iran;
School of Industrial Engineering, College of Engineering, University of Tehran,
Tehran, Iran;
LCFC, Arts et Métiers Paris Tech, Metz, France;
Department of Industrial and Systems Engineering, Isfahan University of Technology,
Isfahan, Iran;
ABSTRACT: In this paper, a mathematical model is proposed using economic and
environmental criteria for a type-2 fuzzy (T2F) cell formation (CF) problem
emphasizing the effect of the man-machine relationship aspect. This model aims to
show the use of this aspect in CF to minimize the costs of processing, material
movement, energy loss, and tooling. For this purpose, a two-stage defuzzification
procedure is used to convert the T2F variable into a crisp value. Due to NP-
hardness of the model and problem, a genetic algorithm (GA) is used to derive the
appropriate solutions. Furthermore, because there is no any existing benchmark to
validate the performance of the proposed model, three tuned meta-heuristic
algorithms, namely, differential evolution (DE), harmony search (HS) and particle
swarm optimization (PSO), are proposed and used. The present research uses the
Taguchi method to adjust the parameters in the four proposed algorithms.
Furthermore, 15 examples are used to validate the presented model. The results show
that PSO is the most appropriate algorithm for solving the model. © 2018 PEI,
University of Maribor. All rights reserved.
AUTHOR KEYWORDS: Cell formation; Differential evolution; Environmental factor;
Genetic algorithm; Harmony search; Particle swarm optimization
REFERENCES: Rafiei, H., Ghodsi, R., A bi-objective mathematical model toward
dynamic cell formation considering labor utilization (2013) Applied Mathematical
Modelling, 37 (4), pp. 2308-2316;
Greene, T.J., Sadowski, R.P., A review of cellular manufacturing assumptions,
advantages and design techniques (1984) Journal of Operations Management, 4 (2),
pp. 85-97;
(2016) Applied Soft Computing, 42, pp. 325-341;
Applied Mathematical Modelling, 37 (4), pp. 1884-1896;
Xu, H., Bao, Z.R., Zhang, T., Solving dual flexible job-shop scheduling problem
using a Bat Algorithm (2017) Advances in Production Engineering & Management, 12
(1), pp. 5-16;
Zupan, H., Herakovic, N., Zerovnik, J., Berlec, T., Layout optimization of a
production cell (2017) International Journal of Simulation Modelling, 16 (4), pp.
603-616;
Nie, X.D., Chen, X.D., Chen, X., Simulation study of flexible manufacturing cell
based on token-oriented Petri net model (2016) International Journal of Simulation
Modelling, 15 (3), pp. 566-576;
Mahdavi, I., Mahdavi-Amiri, N., Naderi, F., Paydar, M.M., Cell formation
configuration using interval type-2 fuzzy interactional interests among workers
(2017) International Journal of Operational Research, 30 (2);
Stocchetti, A., The sustainable firm: From principles to practice (2012)
International Journal of Business and Management, 7 (21), pp. 34-47;
Lozano, R., Envisioning sustainability three-dimensionally (2008) Journal of
Cleaner Production, 16 (17), pp. 1838-1846;
Niakan, F., Baboli, A., Moyaux, T., Botta-Genoulaz, V.A., A new multi-objective
considering social criteria (2015) Applied Mathematical Modelling, 40 (4), pp.
2674-2691;
Niakan, F., Baboli, A., Moyaux, T., Botta-Genoulaz, V., A new bi-objective
mathematical model for sustainable dynamic cellular manufacturing systems (2014)
Proceedings of the IEEE International Conference on Industrial Engineering and
Engineering Management, pp. 938-942., Selangor, Malaysia;
Qin, R., Liu, Y.K., Liu, Z.Q., Methods of critical value reduction for type-2 fuzzy
variables and their applications (2011) Journal of Computational and Applied
Mathematics, 235 (5), pp. 1454-1481;
Miller, S., John, R., An interval type-2 fuzzy multiple echelon supply chain model
(2010) Knowledge-Based Systems, 23 (4), pp. 363-368;
Kundu, P., Kar, S., Maiti, M., Fixed charge transportation problem with type-2
fuzzy variables (2014) Information Sciences, 255, pp. 170-186;
Niebel, B.W., (1982) Motion and Time Study, , Homewood, Irwin, USA;
De Castro-Hilsdorf, W., De Mattos, C.A., De Campos-Maciel, L.O., Principles of
sustainability and practices in the heavy-duty vehicle industry: A study of
multiple cases (2017) Journal of Cleaner Production, 141, pp. 1231-1239;
Wang, L.X., (1996) A Course in Fuzzy Systems and Control, , Prentice-Hall
International, Inc., U.S.A;
Holland, J.H., (1975) Adaptation in Natural and Artificial Systems: An Introductory
Analysis with Applications to Biology, Control and Artificial Intelligence, , MIT
Press Cambridge, MA, USA;
Mousavi, S.M., Hajipour, V., Niaki, S.T.A., Aalikar, N., A multi-product multi-
period inventory control problem under inflation and discount: A parameter-tuned
particle swarm optimization algorithm (2014) The International Journal of Advanced
algorithm for the manufacturing cell formation problem using group-based operators
Storn, R., Price, K., Differential evolution - A simple and efficient heuristic for
global optimization over continuous spaces (1997) Journal of Global Optimization,
11 (4), pp. 341-359;
Sahin, O., Akay, B., Comparisons of metaheuristic algorithms and fitness functions
on software test data generation (2016) Applied Soft Computing, 49, pp. 1202-1214;
Kennedy, J., Eberhart, R., Particle swarm optimization (1995) Proceedings of the
IEEE International Conference on Neural Networks, pp. 1942-1948., Perth, WA,
Australia;
Pant, M., Thangaraj, R., Abraham, A., Particle swarm optimization: Performance
tuning and empirical analysis (2009) Foundations of Computational Intelligence, 3,
pp. 101-128;
Geem, Z.W., Kim, J.H., Loganathan, G.V., A new heuristic optimization algorithm:
Harmony search (2001) Simulation, 76 (2), pp. 60-68;
Askarzadeh, A., Zebarjadi, M., Wind power modeling using harmony search with a
novel parameter setting approach (2014) Journal of Wind Engineering and Industrial
Aerodynamics, 135, pp. 70-75
CORRESPONDENCE ADDRESS: Tavakkoli-Moghaddam, R.; School of Industrial Engineering,
PUBLISHER: Production Engineering Institute
ISSN: 18546250
ABBREVIATED SOURCE TITLE: Adv. Prod. Eng. Manag.
SOURCE: Scopus
Zhu, Y., Li, S.

57195540206;57203292648;
Similarity statistics for clusterability analysis with the application of cell
formation problem
(2018) Journal of Probability and Statistics, 2018, art. no. 1348147, .
85058900730&doi=10.1155%2f2018%2f1348147&partnerID=40&md5=28fc0ff02594e489f93944196
f9b968b
DOI: 10.1155/2018/1348147
AFFILIATIONS: Department of Mechanical and Manufacturing Engineering, University of
Calgary, Calgary, AB, Canada
ABSTRACT: This paper proposes the use of the statistics of similarity values to
evaluate the clusterability or structuredness associated with a cell formation (CF)
problem. Typically, the structuredness of a CF solution cannot be known until the
CF problem is solved. In this context, this paper investigates the similarity
statistics of machine pairs to estimate the potential structuredness of a given CF
problem without solving it. One key observation is that a well-structured CF
solution matrix has a relatively high percentage of high-similarity machine pairs.
Then, histograms are used as a statistical tool to study the statistical
distributions of similarity values. This study leads to the development of the U-
shape criteria and the criterion based on the Kolmogorov-Smirnov test. Accordingly,
a procedure is developed to classify whether an input CF problem can potentially
lead to a well-structured or ill-structured CF matrix. In the numerical study, 20
matrices were initially used to determine the threshold values of the criteria, and
40 additional matrices were used to verify the results. Further, these matrix
examples show that genetic algorithm cannot effectively improve the well-structured
CF solutions (of high grouping efficacy values) that are obtained by hierarchical
clustering (as one type of heuristics). This result supports the relevance of
similarity statistics to preexamine an input CF problem instance and suggest a
proper solution approach for problem solving. © 2018 Yingyu Zhu and Simon Li.
REFERENCES: Hyer, N.L., Wemmerlov, U., (2002) Reorganizing the Factory: Competing
Through Cellular Manufacturing, , Productivity Press, Portland, OR, USA;
problems with consideration of multiple production factors (2010) International
Ackerman, M., Ben-David, S., Clusterability: A theoretical study (2009) Proceedings
of the International Conference on Artificial Intelligence and Statistics, JMLR:
Workshop and Conference Proceedings, 5, p. 18., N. Lawrence, Ed;
Nowakowska, E., Koronacki, J., Lipovetsky, S., Clusterability assessment for
Gaussian mixture models (2015) Applied Mathematics and Computation, 256, pp. 591-
601;
Daniely, A., Linial, N., Saks, M., Clustering is difficult only when it does
notmatter (2012) Computer Science (Machine Learning);
Ackerman, M., Adolfsson, A., Brownstein, N., An effective and efficient approach
for clusterability evaluation (2016) Computer Science (Machine Learning);
Zhu, Y., Li, S., Statistical analysis of similarity measures for solving cell
formation problems (2017) Procedia CIRP, 63, pp. 248-253;
Paydar, M.M., Saidi-Mehrabad, M., A hybrid geneticvariable neighborhood search
Engineering Research and Development, 51 (2), pp. 53-57;
Sneath, P.H.A., Sokal, R.R., (1973) Numerical Taxonomy: The Principles and Practice
OfNumerical Classification, , Freeman, San Francisco, Calif, USA;
(2), pp. 285-314;
comparative study of relationalmetrics (1996) Computers & Industrial Engineering,
30 (1), pp. 103-116;
as applied to the group technology configuration problem (1997) Omega, 25 (1), pp.
65-79;
Yin, Y., Yasuda, K., Similarity coefficientmethods applied to the cell formation
Economics, 101 (2), pp. 329-352;
Research, 38 (2), pp. 385-395;
Defersha, F.M., Chen, M., Alinear programming embedded genetic algorithm for an
Lee, S., Wang, H.P., Manufacturing cell formation: A dualobjective simulated
annealing approach (1992) The International Journal of AdvancedManufacturing
Technology, 7 (5), pp. 314-320;
annealing (2008) Journal of the Operational Research Society, 59 (4), pp. 443-454;
Technology, 72 (1-4), pp. 403-418;
(1), pp. 1-18;
180;
Corder, G.W., Foreman, D.I., (2014) Nonparametric Statistics: A Step-By-Step
Approach, , JohnWiley&Sons, Hoboken, NY, USA;
Bradley, A.P., ROC curve equivalence using the Kolmogorov-Smirnov test (2013)
Pattern Recognition Letters, 34 (5), pp. 470-475;
Arnold, T., Emerson, J., Nonparametric goodness-of-fit tests for discrete null
distributions (2011) The R Journal, 3 (2), pp. 34-39;
Justel, A., Peña, D., Zamar, R., A multivariate Kolmogorov-Smirnov test of goodness
of fit (1997) Statistics & Probability Letters, 35 (3), pp. 251-259;
Montgomery, D.C., Runger, G.C., (2011) Applied Statistics and Probability for
Engineers, , Wiley, Hoboken, NJ, USA, 5thedition;
Drezner, Z., Turel, O., Normalizing variables with toofrequent values using a
Kolmogorov-Smirnov test: A practical approach (2011) Computers & Industrial
Engineering, 61 (4), pp. 1240-1244;
Zhu, Y.J., (2017) Hierarchical Clustering and Similarity Statistics for Solving and
Investigating Cell Formation Problems, , Department of Mechanical and Manufacturing
Engineering, University of Calgary
CORRESPONDENCE ADDRESS: Li, S.; Department of Mechanical and Manufacturing
Engineering, University of CalgaryCanada; email: [email protected]
ISSN: 1687952X
ABBREVIATED SOURCE TITLE: J. Probab. Stat.
SOURCE: Scopus
Branco, R.M., Rocha, C.R.

57204936485;7102396192;
Group technology: Genetic algorithm based on greedy constructive structure and
refinement by k-means method applied to manufacturing cell formation problems
(2018) Advances in Transdisciplinary Engineering, 7, pp. 817-826.
1-61499-898-3-817&partnerID=40&md5=56a35b01b1ac7834dec78831ce8a3a3a
DOI: 10.3233/978-1-61499-898-3-817
AFFILIATIONS: Instituto Federal de Educação, Ciência e Tecnologia do Rio Grande do
Sul, Brazil
ABSTRACT: The Group technology (GT) constitutes a manufacturing philosophy that
exploits similarities in product design and product processes. The information
attained from the process sheets are organized in an incidence matrix with machines
and parts. The goal is to assign parts to families and machine to cells, which are
designed to produce a given part family such that the number of voids and
exceptional elements in cells are minimized. This article considers the problem of
the manufacturing cell formation, of combinatorial nature and proposes a hybrid
genetic algorithm (GA) with a greedy cosntrutive method for its solution, aiming
the minimizing of the inter-cell movement and maximizing the use of the machines
inside a cell. Basically, the GA generates sets of machine cells, and the
constructor method is applied to those cells to better assign part families to
them. The k-means algorithm is also applied to refine these formations. The
performance of the proposed framework, considering the efficacy of grouping and a
set of GT problems available in the literature, is presented and discussed. © 2018
The authors and IOS Press.
AUTHOR KEYWORDS: Genetic algorithm; Group technology; Grouping efficacy;
Machine-component cells
INDEX KEYWORDS: Cells; Cellular manufacturing; Cytology; Flexible manufacturing
systems; Genetic algorithms; Product design, Exceptional elements; Grouping
efficacy; Hybrid genetic algorithms; Incidence matrices; k-Means algorithm; K-means
method; Manufacturing cell formation; Product process, Group technology
REFERENCES: Irani, S.A., Subramanian, S., Allam, Y.S., Introduction to Cellular
Manufacturing Systems Handb (2001) Cell. Manuf. Syst., pp. 2-24., pp;
232., Vol., No., pp;
clustering for group technology (1986) Int. J. Prod. Res, 24 (5), pp. 1221-1233.,
Vol., No., pp;
Chandrasekharan, M.P., Rajagopalan, R., Zodiac—an algorithm for concurrent
835-850., Vol., No., pp;
Srinivasan, G., Narendran, T.T., GRAFICS—a nonhierarchical clustering algorithm for
group technology (1991) International J. Prod. Res, 293, pp. 463-478., Vol., pp;
2158., Vol., pp;
machine groups and part families (1991) International J. Prod. Res, 36 (5), pp.
1325-1337., Vol., No., pp;
systems (2001) Comput. Ind. Eng, 39 (1-2), pp. 125-144., Vol., No., pp;
(2009) Int. J. Prod. Econ, 120, pp. 669-688., Vol., p;
Rao, P.K., A multi stage heuristic for manufacturing cell formation (2014) Int J
Res Eng Technol, 1163 (45), pp. 2308-2321., Vol., No., pp;
Roy, N., Komma, V.R., Cellular manufacturing through composite part formation: A
genetic algorithm approach., in International Conference on Industrial Engineering
and (2014) Operations Management;
Adv. Manuf. Technol., Vol. 73, 9-12, pp. 1543-1556., pp;
the cell formation problem (2007) Comput. Oper. Res, 34 (7), pp. 2059-2079., Vol.,
Issue, pp;
Oper. Res, 40 (4), pp. 980-990., Vol., No., pp;
Suresh Kumar, C., Chandrasekharan, M.P., Grouping efficacy: A quantitative
technology (1990) Int. J. Prod. Res, 28 (2), pp. 233-243., Vol., No., pp;
formation (2004) Comput. Ind. Eng, 47 (2-3), pp. 247-273., Vol., No., pp;
Holland, J.H., Algorithms, G., (1992) Sci. Am., 267 (1), pp. 66-72., Vol., No., pp;
Goldbarg, H.P.L., Luna, M.C., (2005) Otimização combinatória E programação Linear:

Modelos E Algoritmos., 2Ed Ed., , Elsevier Ltd., Rio de Janeiro;
pp. 117-133., Vol., Issue, pp;
Mace (1984) Int. J. Prod. Res, 22 (6), pp. 937-948., Vol., No., pp;
formation applications (1989) Comput. Ind. Eng, 16 (3), pp. 419-426., Vol., No.,
pp;
technology problem (1992) Int. J. Prod. Res, 30 (11), pp. 2633-2646., Vol., No.,
pp;
Manuf. Syst, 6 (2), pp. 117-124., Vol., No., pp;
of binary data matrices for group technology (1989) Int. J. Prod. Res, 27 (6), pp.
1035-1052., Vol., No., pp;
Reorganization by a Clustering Technique (1972) Oper. Res, 20 (5), pp. 993-1009.,
Vol., No., pp;
families problem in group technology (1990) Int. J. Prod. Res, 281 (28), pp. 145-
152., Vol., No., pp;
(1973) Int. J. Prod. Res, 11 (4), pp. 399-416., Vol., No., pp;
technology machine clustering problem (1985) Omega, 13 (6), pp. 577-579., Vol.,
Issue, pp;
manufacturing (1987) Int. J. Prod. Res, 24, pp. 387-397., Vol., pp
CORRESPONDENCE ADDRESS: Branco, R.M.; Instituto Federal de Educação, Ciência e
Tecnologia do Rio Grande do SulBrazil; email: [email protected]
EDITORS: Wognum N., Stjepandic J., Pellicciari M., Bil C., Peruzzini M.
PUBLISHER: IOS Press BV
ISBN: 9781614994398
ABBREVIATED SOURCE TITLE: Adv. Transdiscipl. Eng.
SOURCE: Scopus
Durga Rajesh, K.V., Chalapathi, P.V., Nageswara Rao, M., Krishna, C.E., Anoop, K.,
Neeraj, Y.
57203667069;57208834660;57008052500;55940925200;57211099818;57197743694;
An efficient sheep flock heredity algorithm for the cell formation problem
(2017) ARPN Journal of Engineering and Applied Sciences, 12 (21), pp. 6074-6079.
Cited 4 times.
85034431100&partnerID=40&md5=ea18aa3ba13328963649d48e8307db03
AFFILIATIONS: Department of Mechanical Engineering, K L University, Vaddeswaram,

Guntur District, Andhra Pradesh, India;
AKRG College of Engineering and Technology, Nallajerla, Andhra Pradesh, India
ABSTRACT: CM (Cellular Manufacturing) is an essential GT (Group Technology)
application that has been used in several real-world industrial applications. The
problem of cell formation is considered as the first most important criteria in the
design CMS (Cellular Manufacturing Systems) in order to minimize lead time and
setup time to maximize productivity. In this paper, an efficient SFHA (Sheep Flock
Heredity algorithm) is suggested for problem solving where the number of cells is
not fixed a priori. To assess the effectiveness of the proposed algorithm, a set of
10 benchmark problems is used; the results are then compared with other methods by
considering Grouping Efficacy parameter. From the results we can say that algorithm
which is proposed has performed well on the standard problems. © 2006-2017 Asian
Research Publishing Network (ARPN).
AUTHOR KEYWORDS: Cell formation; Group technology; Grouping efficacy; Lead time;
Productivity; Sheep flock heredity
REFERENCES: Nara, K., Takeyama, T., Kim, H., A new evolutionary algorithm based on
sheep flocks heredity model and its application to scheduling problem (1999) IEEE
International Conference on Systems, Man, and Cybernetics, 6, pp. 503-508;
Anandaraman, C., Vikram, A., Natarajan, M.S.R., Evolutionary approaches for
scheduling a flexible manufacturing system with automated guided vehicles and
robots (2012) International Journal of Industrial Engineering Computations, 3, pp.
627-648;
Vijay Chakaravarthy, G., Marimuthu, S., Ponnambalamand, G., Kanagaraj, S.G.,
Improved sheep flock heredity algorithm and artificial bee colony algorithm for
scheduling m-machine flow shops lot streaming with equal size sub-lot problems
Vijaychakaravarthy, G., Marimuthu, S., Naveen Sait, A., Comparison of Improved
Sheep Flock Heredity Algorithm and Artificial Bee Colony Algorithm for lot
streaming in m-Machine Flow Shop Scheduling (2014) Arabian journal for Science and
Saravanan, M., Ganesh Kumar, S., Design and optimisation of loop layout problems
flexible manufacturing system using sheep flock heredity algorithm (2014) The
International Journal of Advanced Manufacturing Technology., 77, pp. 1851-1866;
Xing, B., Gao, W.-J., Innovative Computational Intelligence A Rough Guide to 134
Clever Algorithms (2014) Intelligent Systems Library, p. 62;
Modrak, V., Sudhakara Pandian, R., Operations Management Research and Cellular
Manufacturing Systems (2012) Hershey PA: Business Science Reference;
Durga Rajesh, K.V., Mukesh, D., Harshavardhan, M., Jaganadha Swamy, R., Suresh
Krishna Sai, G., Gopi, K., Squared Euclidean Distance Matrix: A Heuristic Based
Approach for Cell Formation Applications International Journal of Applied
Engineering Research, 11, pp. 7044-7048;
Durga Rajesh, K.V., Chalapathi, P.V., Chaitanya, A.B.K., Sairam, V., Anildeep, N.,
Modified Grouping Efficacy and New Average Measure of Flexibility: Performance
Measuring Parameters For Cell Formation Applications (2016) Journal of Engineering
and Applied Sciences, 11, pp. 9212-9215;
Durga Rajesh, K.V., Mani Krishna, M., Ali, M.A., Chalapathi, P.V., A Modified
Hybrid Similarity Coefficient based Method for solving the Cell Formation Problem
in Cellular Manufacturing Systems Materials Today: Proceedings, 4, pp. 1469-1477;
M.A., Akhil Reddy, G., Varma, N.S.M., Application of Teaching- Learning Based
Optimization Technique for Cell Formation Problems International Journal of Pure
and Applied Mathematics, 116, pp. 123-128
CORRESPONDENCE ADDRESS: Durga Rajesh, K.V.; Department of Mechanical Engineering, K
L UniversityIndia; email: [email protected]
ISSN: 18196608
ABBREVIATED SOURCE TITLE: ARPN J. Eng. Appl. Sci.
SOURCE: Scopus
Merchichi, S., Boulif, M.

57096011300;10045183300;
Constraint-driven exact algorithm for the manufacturing cell formation problem
(2015) European Journal of Industrial Engineering, 9 (6), pp. 717-743. Cited 2
times.
84957058119&doi=10.1504%2fEJIE.2015.074379&partnerID=40&md5=656d7cfe2ea0fe3a1d5afbc
2631d6d2a
DOI: 10.1504/EJIE.2015.074379
AFFILIATIONS: LIMOSE Laboratory, Computer Science Department, Faculty of Sciences,
University M'Hamed Bougara of Boumerdes, Independency Avenue, Boumerdès, 35000,
Algeria
ABSTRACT: This paper deals with the manufacturing cell formation (MCF) problem,
which is based on group technology (GT) principles, by using a graph-theoretic
model. Due to the exponential nature of the problem, various heuristics and meta-
heuristics have been proposed to solve it. However, only few studies have attempted
to develop exact algorithms. In this paper, we develop two B&B algorithms, taking
into account the actual constraints of production. The first algorithm is based on
the notion of co-cycles (cuts) in the generation of solutions. The second has a
similar structure, except that it is improved by using the constraints. The
obtained results of the two algorithms are reported for medium-sized instances.
Copyright © 2015 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Branch and bound; Graph partitioning; Group technology;
Manufacturing cell formation; MCF
INDEX KEYWORDS: Algorithms; Branch and bound method; Flexible manufacturing
systems; Graph theory; Group technology; Group theory; Manufacture, Exact
algorithms; Generation of solutions; Graph Partitioning; Graph theoretic modeling;
Manufacturing cell formation; Meta heuristics, Cellular manufacturing
REFERENCES: Al Qattan, I., Designing flexible manufacturing cells using a branch
and bound method (1990) International Journal of Production Research, 28 (2), pp.
325-336;
grouping (2006) Robotics & Computer Integrated Manufacturing, 22 (5-6), pp. 468-
474;
formation problem (2012) Applied Mathematical Modelling, 36 (10), pp. 5091-5100;
Research, 25 (5), pp. 639-665;
Boulif, M., Atif, K., A new branch-And-bound-enhanced genetic algorithm for the
(8), pp. 2219-2245;
Boulif, M., Atif, K., An exact multiobjective epsilon-constraint approach for the
manufacturing cell formation problem', in (2006) International Conference on
Service Systems and Service Management, pp. 883-888., Troyes, France;
64-79;
problem in group technology (1996) Journal of the Operational Research Society, 47
(6), pp. 794-802;
Gondran, M., Minoux, M., (2009) Graphes et Algorithmes, , 4th ed., Tec & Doc,
Lavoisier, Paris;
(6), pp. 1353-1367;
technology (2012) Computational Management Science, 9 (3), pp. 323-338;
Kusiak, A., Boe, W.J., Cheng, C., Designing cellular manufacturing systems:
Branchand-bound and a approaches (1993) IIE Transactions, 25 (4), pp. 46-56;
Megala, N., Rajendran, C.S., Gopalan, R., An ant colony algorithm for cell-
formation in cellular manufacturing systems (2008) European J. Industrial
Research, 28 (12), pp. 2243-2257;
179;
Papadimitriou, C.H., Steiglitz, K., (1981) Combinatorial Optimization: Algorithm
and Complexity, , PrenticeHall, Englewood Cliffs, NJ;
Souilah, A., Simulated annealing for manufacturing systems layout design (1995)
manufacturing systems cell formation problem (1998) European Journal of Operational
Research, 105 (3), pp. 537-551;
Stoer, M., Wagner, F., A simple min-cut algorithm (1997) Journal of the ACM, 44
(4), pp. 585-591;
pp. 2185-2207;
(1), pp. 84-97;
916-924;
algorithm with variable neighbourhood (2011) European J. Industrial Engineering, 5
(1), pp. 22-42;
Zilinskas, J., Goldengorin, B., Pardalos, P.M., Pareto optimal front of cell
formation problem in group technology (2014) Journal of Global Optimization
CORRESPONDENCE ADDRESS: Boulif, M.; LIMOSE Laboratory, Computer Science Department,
Faculty of Sciences, University M'Hamed Bougara of Boumerdes, Independency Avenue,
Algeria; email: [email protected]
ISSN: 17515254
SOURCE: Scopus
Wu, S., Yang, X., Yu, M.

57199080276;56964604500;57199241811;
Modified PSO for logistic cost of dynamic cell formation problem with alternative
routings
(2015) Wuhan Ligong Daxue Xuebao (Jiaotong Kexue Yu Gongcheng Ban)/Journal of Wuhan
University of Technology (Transportation Science and Engineering), 39 (5), pp.
1029-1034.
84947328507&doi=10.3963%2fj.issn.2095-
3844.2015.05.029&partnerID=40&md5=f3da4a58d1f3ccaa8159e23c5e0d7daf
DOI: 10.3963/j.issn.2095-3844.2015.05.029
AFFILIATIONS: Department of Transportation, Tongji University, Shanghai, 201804,
China;
Department of Mechanism and Energy, Tongji University, Shanghai, 201804, China
ABSTRACT: Considering the capacity of machine, the alternative routings of parts
procedure and so on, model is cestablished to determine the optimal cells while
minimize the manufacturing, material handling, subcontracting, inventory holding
and backorder penalty costs in all period. A modified PSO optimization algorithm is
proposed to solve this problem. A structured encoding mechanism was also proposed
in modified PSO. The simulation experiment verified the feasibility and validity of
the model and the algorithm. ©, 2015, Wuhan University of Technology. All right
reserved.
AUTHOR KEYWORDS: Alternative routings; Cellular manufacturing; Dynamic cell
formation; Logistic cost; Particle swarm optimization
REFERENCES: Hassan, R., Reza, M., Mahdi, Z., Solving a dynamic cell formation
Applied Soft Computing, 11 (6), pp. 3160-3169;
Maryam, H., Esmaeilian, G.R., Ismail, N., Capability-based cellular manufacturing
systems formation in dual-resource constrained settings using tabu search (2012)
Iraj, M., Amin, A., Mohammad mahdi paydar & maghsud solimanpur. multi-objective
cell formation and production planning in dynamic cellular manufacturing systems
Paydar, M.M., Saidi, M.M., Revised multi-choice goal programming for integrated
supply chain design and dynamic cell formation with fuzzy parameters (2014)
International Journal of Computer Integrated Manufacturing, (3), pp. 105-113;
Feristah, O., Tugba, S., A genetic algorithm extended modified sub-gradient
algorithm for cell formation problem with alternative routings (2012) International
Adil, G.K., Rajamani, D., The tradoff between intracell and intercell moves in
group technology cell formation (2000) Journal of Manufacturering Systems, 19 (5),
pp. 305-317;
Gasimov, R.N., Yenilmez, K., Solving fuzzy linear programming problems with linear
membership functions (2002) Turkish J. Math, 26, pp. 375-396;
Parsopoulos, K.E., Vrahatis, M.N., Unified particle swarm optimization for solving
constrained engineering optimization problems (2005) Lect. Notes Comput. Sci.,
3612, pp. 582-591;
Maryam, H., Esmaeilian, G.R., Capability-based cellular manufacturing systems
formation in dual-resource constrained settings using tabu search (2012) Computers
& Industrial Engineering, 62 (4), pp. 953-971
PUBLISHER: Wuhan University of Technology
ISSN: 20953844
CODEN: WJKXF
ABBREVIATED SOURCE TITLE: Wuhan Ligong Daxue Xuebao (Jiaotong Kexue Yu Gongcheng
Ban)
SOURCE: Scopus
Jia, G., Kong, W.

34876688200;55606975700;
An multi-objective optimal model to solve the dynamic cell formation problem
considering machine sharing
(2014) Journal of Computational Information Systems, 10 (2), pp. 513-522. Cited 2
times.
84892866452&doi=10.12733%2fjcis8796&partnerID=40&md5=42964a2b593c49f073d80a0a8530ea
b6
DOI: 10.12733/jcis8796
AFFILIATIONS: School of Economics and Management, Beihang University, Beijing
100191, China
ABSTRACT: In this paper, a multi-objectives model of dynamic cellular manufacturing
(DCM) formation is proposed. This model can solve the problem of the optimal
con_guration of the manufacturing cells by weighing conicting objectives namely:
machine related costs, machine utilization, and material handling cost. In
addition, the situation that some machines could be shared by more than one cell at
the same period is also considered. To solve the mathematical model, a genetic
algorithm is applied and three numerical examples are presented to evaluate the
validity of this model. Copyright © 2014 Binary Information Press.
AUTHOR KEYWORDS: Dynamic cell formation; Machine sharing; Machine utilization;
Maintenance cost; Material handling cost; Relocation cost
INDEX KEYWORDS: Dynamic cell formation; Machine utilization; Maintenance cost;
Material handling costs; Relocation costs, Costs; Materials handling; Mathematical
models, Cellular manufacturing
REFERENCES: Wang, X., Tang, J., Yung, K.-L., Optimization of the multi-objective
dynamic cell formation problem using a scatter search approach (2009) The
Wang, X., Tang, J., Yung, K.-L., Optimization of parts scheduling in multiple cells
considering intercell move using scatter search approach (2010) Journal of
Intelligent Manufacturing, 21 (4), pp. 525-537;
113;
linear layout, cellular manufacturing system (1994) International Journal of
Wu, X., Chu, C.-H., Yan, W., A genetic algorithm for cellular manufacturing design
and layout (2007) European Journal of Operational Research, 181 (1), pp. 156-167;
part populations (1999) IIE Transactions, 31 (1), pp. 11-20;
pp. 516-530;
Tavakkoli-Moghaddam, R., Aryanezhad, M.B., Safaei, N., Solving a dynamic cell
formation problem using metaheuristics. applied mathematics and computation (2005)
Journal of Manufacturing Technology Management, 170 (2), pp. 761-780;
10), pp. 1001-1009;
Saxena, L.K., Jain, P.K., Dynamic cellular manufacturing systems design - A
Technology, 53 (1-4), pp. 11-34;
Luan, S., Jia, G., Kong, J., A model approach to polca system for quick response
manufacturing (2013) Journal of Computational Information Systems, 9 (3), pp. 1167-
1174;
and worker assignment (2010) Computers and Mathematics with Application, 60 (4),
pp. 1014-1025;
Wu, Y., Wang, X., Qos-aware web service selection with global optimization based on
multi-objective genetic algorithm (2012) Journal of Computational Information
Systems, 8 (5), pp. 1995-2007
CORRESPONDENCE ADDRESS: Kong, W.; School of Economics and Management, Beihang
University, Beijing 100191, China; email: [email protected]
ISSN: 15539105
ABBREVIATED SOURCE TITLE: J. Comput. Inf. Syst.
SOURCE: Scopus
Javaid, W., Tariq, A., Hussain, I.

57208968417;55409746600;24437907000;
A Comparison of a Standard Genetic Algorithm with a Hybrid Genetic Algorithm
Applied to Cell Formation Problem
(2014) Advances in Mechanical Engineering, 2014, art. no. 301751, . Cited 2 times.
84934969214&doi=10.1155%2f2014%2f301751&partnerID=40&md5=72571352ba7425661319cd4b09
e02e58
DOI: 10.1155/2014/301751
AFFILIATIONS: Department of Mechanical Engineering, Wah Engineering College,
University of Wah, Punjab, 47040, Pakistan;
Department of Industrial Engineering, University of Engineering and Technology,
Peshawar, Pakistan
ABSTRACT: Though there are a number of benefits associated with cellular
manufacturing systems, its implementation (identification of part families and
corresponding machine groups) for real life problems is still a challenging task.
To handle the complexity of optimizing multiple objectives and larger size of the
problem, most of the researchers in the past two decades or so have focused on
developing genetic algorithm (GA) based techniques. Recently this trend has shifted
from standard GA to hybrid GA (HGA) based approaches in the quest for greater
effectiveness as far as convergence on to the optimum solution is concerned. In
order to prove the point, that HGAs possess better convergence abilities than
standard GAs, a methodology, initially based on standard GA and later on hybridized
with a local search heuristic (LSH), has been developed during this research.
Computational experience shows that HGA maintains its accuracy level with increase
in problem size, whereas standard GA looses its effectiveness as the problem size
grows. © 2014 Waqas Javaid et al.
REFERENCES: Hyde, W.F., (1981) Improving Productivity by Classification and Coding
and Data Base Standardization, , Marcel Dekker, New York, NY, USA;
Mitrofanov, S.P., (1966) Scientific Principles of Group Technology, , Defense
Technical Information Center, Yorkshire, UK;
Ranson, G.M., (1972) Group Technology: A Foundation for Better Total Company
Operation, , McGraw-Hill, London, UK;
Burbidge, J.L., (1975) The Introduction of Group Technology, , Halste Press, John
Wiley, New York, NY, USA;
Askin, R.G., Standridge, C.R., (1993) Modelling and Analysis of Manufacturing
System, , Wiley, New York, NY, USA;
Irani, S.A., (1999) Handbook of Cellular Manufacturing Systems;
Zhao, L., Tsujimura, Y., Gen, M., Genetic algorithm for fuzzy clustering (1996)
Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC
'96), pp. 716-719., May;
Hwang, H., Sun, J.-U., A genetic-algorithm-based heuristic for the GT cell
formation problem (1996) Computers & Industrial Engineering, 30 (4), pp. 941-955;
Chu, C.-H., Tsai, C.-C., A heuristic genetic algorithm for grouping manufacturing
cells (2001) Proceedings of the Congress on Evolutionary Computation, 1, pp. 310-
317;
Chi, S.C., Yan, M.C., A fuzzy genetic algorithm for high-tech cellular
manufacturing system design (2004) Proceedings of the IEEE Annual Meeting of the
Fuzzy Information, 2, pp. 907-912;
formation (2004) Computers and Industrial Engineering, 47 (2-3), pp. 247-273;
Pai, P.E., Chang, P.T., Lee, S.H., Part-machine family formation using genetic
(8), pp. 2219-2245;
2059-2079;
Chee, L.M., Ponnambalam, S.G., A hybrid GA/PSO for the concurrent design of
cellular manufacturing system (2008) Proceedings of the IEEE International
Conference on Systems, Man and Cybernetics (SMC '08), pp. 1855-1860., October;
pp. 1989-2007;
Rezaeian, J., Javadian, N., Tavakkoli-Moghaddam, R., Jolai, E., A hybrid approach
manufacturing system (2011) Applied Soft Computing Journal, 11 (6), pp. 4195-4202;
Payder, M.M., Mehrabad, M.S., A hybrid genetic-variable neighborhoods search
pp. 117-133;
419-426;
Kusiak, A., Group technology: Models and solutions approaches (1992) Proceedings of
1st Industrial Engineering Research Conference, pp. 349-352;
Boctor, F., Linear formulation of the machine-part cell formation problem (1991)
Seifoddini, H., Wolfe, P., Application of similarity coefficient method in group
technology (1986) HE Transactions, 18 (3), pp. 271-277;
Research, 24 (2), pp. 451-463;
Research, 24 (5), pp. 1221-1233;
113;
993-1009;
Research, 28 (1), pp. 145-152;
Research, 18 (2), pp. 213-232;
24 (2), pp. 387-400;
pp. 2097-2116;
Opitz, H., (1970) A Classification System to Describe Work Pieces, , Pergamon
Press, New York, NY, USA;
51 (2), pp. 53-57;
Society, 50 (5), pp. 509-516;
Economics, 101 (2), pp. 329-352;
Mungawattana, A., (2000) Design of Cellular Manufacturing Systems for Dynamic and
Uncenain Production Requirements with Presence of Routing Flexibility, , [PhD
dissertation, Doctor of Philosophy in Industrial and Systems Engineering], Virginia
Polytechnic Institute and State University;
64-79;
formulations (2000) International Journal of Production Research, 38 (7), pp. 1601-
1613;
Akturk, M.S., Turkcan, A., Cellular manufacturing system design using a holonistic
approach (2000) International Journal of Production Research, 38 (10), pp. 2327-
2347;
Kao, Y., Moon, Y.B., A unified group technology implementation using the
backpropagation learning rule of neural networks (1991) Computers and Industrial
Engineering, 20 (4), pp. 425-437;
type clusters separately (1999) Production Planning and Control, 10 (4), pp. 375-
388;
Computation, 170 (2), pp. 761-780;
Gupta, Y., Gupta, M., Kumar, A., Sundram, C., Minimizing total intercell and
Research, 38 (2), pp. 385-395;
Economics, 76 (3), pp. 219-228;
Ghosh, T., Dan, P.K., Sengupta, S., Cappopadhyay, M., Genetic rule based techniques
in cellular manufacturing (1992-2010): A systematic survey (2010) International
Journal of Science & Technology, 2 (5), pp. 198-215;
Engineering, 22 (4), pp. 469-480;
Joines, J.A., Thomas Culbreth, C., King, R.E., Manufacturing cell design: An
integer programming model employing genetic algorithms (1996) HE Transactions, 28
(1), pp. 69-85;
Mak, K.L., Wong, Y.S., Genetic design of cellular manufacturing systems (2000)
Human Factors and Ergonomics in Manufacturing, 10 (2), pp. 177-192;
Wu, X., Chu, C.-H., Wang, Y., Yan, W., A genetic algorithm for integrated cell
formation and layout decisions (2002) Proceedings of the IEEE Congress on
Evolutionary Computation, 2, pp. 1866-1871;
formation: Incorporation of machine flexibility and machine aggregation (2004)
Journal of Engineering Manufacture, 218 (10), pp. 1279-1296
CORRESPONDENCE ADDRESS: Javaid, W.; Department of Mechanical Engineering, Wah
Engineering College, University of WahPakistan
PUBLISHER: Hindawi Publishing Corporation
ISSN: 16878132
ABBREVIATED SOURCE TITLE: Adv. Mech. Eng.
SOURCE: Scopus
Kong, W., Jia, G.-Z., Luan, S.-C., Hu, X.-Y.

55606975700;34876688200;55511916500;57199990433;
Optimization of the multi-objective dynamic cell formation problem considering
machine sharing
(2013) International Conference on Management Science and Engineering - Annual
Conference Proceedings, pp. 269-274.
84887505884&partnerID=40&md5=522f624ae694a1c6f1985332668e2760
AFFILIATIONS: School of Economics and Management, Beihang University, 100191,

China;
Institute of Automation, Chinese Academy of Sciences, 100190, China
ABSTRACT: The design of cell formation of a cellular manufacturing system (CMS) is
a combinatorial optimization problem. Cellular manufacturing can reduce the
material handling costs and increase the efficiency of the system. Because of
uncertainties in production life circle, there are many changes in demand of the
products. But former cell formation methods ignore this situation. And product life
cycles are shorter and shorter, and demand volumes and product types are hard to
forecast. Thus, cell design needs to be suitable for different periods. Dynamic
cell formation is a solution of this problem. In this paper, a multi-objective
model of Dynamic cell formation is presented to optimal the relocation cost,
machine utilization and intercell moves. Besides this, the situation that some
machine need be shared at more than one cell at the same period is also considered.
To solve the mathematical model, a genetic algorithmis applied and two numerical
examples are presented to evaluate the validity of this model. ©2013 IEEE.
AUTHOR KEYWORDS: Dynamic cell formation; Intercell moves; Machine sharing;
Machine utilization; Relocation cost
INDEX KEYWORDS: Combinatorial optimization problems; Dynamic cell formation; Inter-
cell moves; Machine utilization; Material handling costs; Multi-objective modeling;
Product life cycles; Relocation costs, Costs; Life cycle; Management science;
Mathematical models; Multiobjective optimization, Cellular manufacturing
REFERENCES: Wang, X., Tang, J., Yung, K.-L., Optimization of the multi-objective
dynamic cell formation problem using a scatter search approach (2009) The
International Journal of Advanced Manufacturing Technology, 44 (3-4), pp. 318-329.,
J;
Tang, J., Wang, X., Kaku, I., Yung, K.-L., Optimization of parts scheduling in
multiple cells considering intercell move using scatter search approach (2010)
Journal of Intelligent Manufacturing, 21 (4), pp. 525-537., J;
113., J;
problem (1991) Journal of Operations Management, 10 (1), pp. 28-43., J;
Production Research, 32 (9), pp. 2049-2066., J;
Tsai, C.-C., Lee, C.-Y., Making decision to evaluate process capability index C p
with fuzzy numbers (2006) The International Journal of Advanced Manufacturing
Technology, 30 (3-4), pp. 309-318., J;
(2007) Applied Mathematics and Computation, 190 (1), pp. 662-670., J;
(9-10), pp. 1001-1009., J;
Tavakkoli-Moghaddam, R., Javadian, N., Design of a facility layout problem in
cellular manufacturing systems with stochastic demands (2007) Applied Mathematics
and Computation, 184 (2), pp. 721-728., J;
pp. 109-128., J;
pp. 516-530., J;
International Journal of Production Economics, 120 (2), pp. 301-314., J;
Operational Research, 192 (2), pp. 414-428., J;
Operational Research, 177 (1), pp. 281-309., J;
Economics, 103 (2), pp. 767-783., J;
Wu, X., Chu, C.-H., Yunfengg, Yan, W., A genetic algorithm for cellular
181 (1), pp. 156-167., J;
Madhusudanan Pillaia, V., Subbaraoa, K., A robust cellular manufacturing system
design for dynamic part population using a genetic algorithm (2008) International
Journal of Production Research, 46 (18), pp. 5191-5210., J;
Technology, 53 (1-4), pp. 11-34., J;
1014-1025., J;
to cell-composition and layout design problems (1996) International Journal of
Molina, J., Laguna, M., Marti, R., Caballero, R., SSPMO: A scatter search procedure
for non-linear multi-objective optimization (2007) INFORMS Journal of Computing, 19
(1), pp. 91-100
CORRESPONDENCE ADDRESS: School of Economics and Management, Beihang University,
100191, China
ISSN: 21551847
ISBN: 9781479904716
ABBREVIATED SOURCE TITLE: Int. Conf. Manage. Sci. Eng. - Annu. Conf. Proc.
SOURCE: Scopus
Hamza, S.A., Adesta, E.Y.T.

55759990800;8417809200;
Similarity coefficient measures applied to assessment the cell formation problem: A
comparative investigation
(2013) International Review on Modelling and Simulations, 6 (2), pp. 608-612.
84878813039&partnerID=40&md5=a0ea6b81038bcb409af0f5e0502f1eef
AFFILIATIONS: Department of Manufacturing and Materials Engineering, International

Islamic University Malaysia, P. O. Box 10, 50728 Kuala Lumpur, Malaysia;
Ministry of Higher Education and Scientific Research, Foundation of Technical
Education, Iraq;
Department of Manufacturing and Materials Engineering, International Islamic
University, Malaysia
ABSTRACT: Similarity coefficient (SC) measures are used to evaluate cellular
manufacturing system. Those measures have variation in the accuracy. The
researchers Yin and Yasuda had conducted comparative study to compare the accuracy
of the measures in cell formation phase. The results showed minor differences among
the majority, while few measures are less accurate. However, the researchers Basher
and Karaa have tried one of the measures (Jaccard) in different phase - feasibility
assessment. In this paper, Basher approach has been repeated with other nineteen
General Purpose Similarity Coefficients (GPSCs) measures in order to prove that any
of the measures evaluated by Yin and Yasuda in cell formation can be utilized in
feasibility assessment. The results have revealed that more than 80% of the
measures are capable to be used in feasibility assessment. © 2013 Praise Worthy
Prize S.r.l. - All rights reserved.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Feasibility assessment;
General purpose similarity coefficient
REFERENCES: Ponnambalam, S.G., Sudhakarapandian, R., Mohapatra, S.S.,
Saravanasankar, S., Cell formation with workload data in cellular manufacturing
system using genetic algorithm (2007) IEEE International Conf. On Industrial
Engineering and Engineering Management, pp. 674-678., December 2-4, Singapore;
Arora, P.K., Haleem, A., Singh, M.K., Cell Formation Techniques-A Study (2011)
International Journal of Engineering Science and Technology, 3 (2), pp. 1178-1181;
Albadawi, Z., Basher, H.A., Chen, M., A mathematical approach for the formation of
cells (2005) Computers and Industrial Engineering, 48, pp. 3-21;
Messalti, S., Saadate, S., Gherbi, A., Flieller, D., Neural Networks for Assessment
Power System Transient Stability (2010) I.RE.MO.S, 3 (3), pp. 381-387;
Mechri, W., Othman, K.B., Probabilistic fuzzy approach for the imprecise evaluation
of safety instrumented systems (2010) International Review On Modelling and
Simulations (IREMOS), 3 (3), pp. 388-400;
Karami, M., Mariun, N., Ab, K.M.Z.A., Genetic algorithm-based optimal location of
TCSC and SSSC in the power system network (2010) International Review On Modelling
and Simulations (IREMOS), 3 (6), pp. 1492-1500;
51 (2), pp. 53-57;
45, pp. 913-934;
Wemmerlov, U., Hyer, N.L., Cellular Manufacturing in the US: A survey of Users
Economics, 101 (2), pp. 329-352;
Basher, H.A., Karaa, S., Assessment of clustering tendency for the design of
cellular manufacturing systems Journal of Manufacturing Technology Management, 19
(8), pp. 1004-1014;
manufacturing, part I: A survey (1993) International Journal Prod Res, 31 (5), pp.
1133-1142;
Systems, 13 (2), pp. 119-127;
as applied to the group technology configuration problem (1997) Omega, 25, pp. 65-
79;
48, pp. 471-489;
Educational and Psychological Measurement, 20, pp. 141-151;
Nair, J.J., Govindan, V.K., Automatic segmentation employing fuzzy connectedness
(2012) International Review On Computers and Software (IRECOS), 7 (2), pp. 561-567
PUBLISHER: Praise Worthy Prize S.r.l
ISSN: 19749821
ABBREVIATED SOURCE TITLE: Int. Rev. Model. Stimul.
SOURCE: Scopus
Karthikeyan, S., Saravanan, M., Ganesh, K.

57034338500;55410779600;23569109300;
GT machine cell formation problem in scheduling for cellular manufacturing system
using meta-heuristic method
(2012) Procedia Engineering, 38, pp. 2537-2547. Cited 7 times.
84901061047&doi=10.1016%2fj.proeng.2012.06.299&partnerID=40&md5=72885e9f5e899dd0a3d
8ef1553205427
DOI: 10.1016/j.proeng.2012.06.299
AFFILIATIONS: Christian College of Engineering and Technology, Oddanchatram-624619,
Tamilnadu, India;
V.P.V College of Engineering and Technology, Devathanapatty-625602, Tamilnadu,
India;
McKinsey Knowledge Center India Private Limited, McKinsey and Company, Gurgaon,
Haryana, India
ABSTRACT: Manufacturing industries are under intense pressure from the increasingly
competitive market. Shorter products life cycles, time-to-market and diverse
customer needs have challenged manufacturers to improve the efficiency and
productivity of their production activities. Proper scheduling of jobs is
indispensable for the successful operation of a shop. Group technology has become
an increasingly popular concept in manufacturing, which is designed to take
advantage of mass production layout and techniques in smaller batch production
system. Since the conventional scheduling methods need more computation time. An
attempt has been made to optimize the scheduling for cellular manufacturing system
by comparing Meta-heuristic methods named as simulated annealing and Tabu Search.
In the first part of this work, different types of products in the job-shop
environment are identified and grouping of cells is performed using Rank Order
Clustering Method. In the second part, optimization procedure has been developed
for the scheduling problem for processing in the machine cells. The objectives are
minimization of total penalty cost, Comparison of the solutions are obtained by the
proposed algorithm with the benchmark problems has been reported. © 2012 Published
by Elsevier Ltd.
AUTHOR KEYWORDS: Cellular manufacturing systems; Job shop; Scheduling; Simulated
annealing; Tabu search
REFERENCES: Optiz, H., Wienda, M.H.P., GT and manufacturing systems for small and
medium quantity production (1971) International Journal of Production Research, 9
(1), pp. 181-203;
Rajagopalan, R., Batra, J.L., Design of cellular production systems- A graph
567-579;
Foulds, L.R., Robinson, D.F., Graph theoretic heuristics for the plant layout
problems (1978) International Journal of Production Research, 16 (1), pp. 27-37;
Research, 18 (2), pp. 213-232;
King, J.R., Nakornchai, V., A machine-component group formation in group
technology: A review and extension (1982) International Journal of Production
Research, 20 (2), pp. 117-133;
Askin, R.G., Subramanian, P.S., A cost-based heuristic for group technology
113;
Research, 25 (5), pp. 639-665;
Co, C.H., Araar, A., Configuring cellular manufacturing systems (1988)
Rajagunasing, K., Lashkari, R.S., Machine grouping problem in cellular
manufacturing systems-an integer programming approach (1989) International Journal
Askin, R.G., Simon Chiu, K., A graph partitioning procedure for machine assignment
and cell formation in group technology (1990) International Journal of Production
Research, 28 (8), pp. 1555-1572;
Logendran, R., A workload based model for minimizing intercell and intracell moves
in cellular manufacturing (1990) International Journal of Production Research, 28
(5), pp. 913-925;
Rajamani, D., Sing, N., Aneja, Y.P., Integrated design of cellular manufacturing
Research, 28, pp. 2075-2081;
ISSN: 18777058
ABBREVIATED SOURCE TITLE: Procedia Eng.
SOURCE: Scopus
Sarayloo, F., Tavakkoli-Moghaddam, R.

36599307100;56491438400;
Multi objective particle swarm optimization for a dynamic cell formation problem
(2010) WCE 2010 - World Congress on Engineering 2010, 3, pp. 2418-2423. Cited 4
times.
79959837839&partnerID=40&md5=28f395f0567e8b060b27ad74523373cf
AFFILIATIONS: Department of Industrial Engineering, Graduate School Islamic Azad

University-South Tehran Branch, Tehran, Iran;
Iran
ABSTRACT: Cellular manufacturing system, an application of group technology, has
been considered as an effective way to obtain productivity in a factory. A new
multi objective dynamic cell formation with production planning consideration is
presented in this paper, where total workload variations, inter-intra cellular
movements and the sum of costs consisting machine costs, production planning costs,
reconfiguration costs, are to be minimized. Because this type of problem is Np-
hard, a multi objective particle swarm optimization is applied to achieve locally
Pareto-optimal frontier. Multi objective particle swarm optimization (MOPSO) is
compared with a multi objective genetic algorithm, i.e. NSGAII, based on some
comparison metrics to show its efficiency. The computational results depict the
superiority of MOPSO compared to NSGAII.
AUTHOR KEYWORDS: Cellular manufacturing system; Multi objective; NSGAII;
Particle swarm optimization
INDEX KEYWORDS: Comparison metrics; Computational results; Dynamic cell formation;
Its efficiencies; Machine costs; Multi objective; Multi objective particle swarm
optimization; Multi-objective genetic algorithm; NP-hard; NSGA-II; Pareto-optimal
frontiers; Particle swarm; Production Planning; Production-planning costs;
Reconfiguration costs; Workload variation, Cellular manufacturing; Computational
efficiency; Costs; Electric load dispatching; Group technology; Multiobjective
optimization; Planning; Production control; Production engineering; Project
management, Particle swarm optimization (PSO)
REFERENCES: McAuley, J., Machine grouping for efficient production (1972)
Production Engineer, pp. 53-57;
King, J.R., Machine component group formation in group technology (1979)
International Journal of Management Science;
Ham, I., Hitomi, K., Yoshida, T., (1985) Group Technology Application to Production
Management, , Nijhoff, Dordrecht: Kluwer;
Asking, R.G., Estrada, S., Investigation of cellular manufacturing practices (1999)
Hand Book of Cellular Manufacturing Systems, pp. 25-34., New York: John Wiley,
[Chapter 1];
multi objective scatter search for a dynamic cell formation problem (2009)
Computers and Operation Research, 36, pp. 777-794;
Int. J. Production Economics, pp. 301-314;
Coello Coello, C., Handling multiple objective with particle swarm optimization
(2004) IEEE Trans. On Evolutionary Computation, 8 (3)., Jun;
Zitzler, E., (1999) Evolutionary Algorithms for Multi Objective Optimization:
Methods and Applications, , doctoral dissertation ETH 13398, Swiss Federal
institute of technology;
Zitzler, E., Deb, K., Thiele, L., Comparison of multiobjective evolutionary
algorithms: Empirical results (1999) Evolutionary Computation, pp. 173-195
CORRESPONDENCE ADDRESS: Sarayloo, F.; Department of Industrial Engineering,
Graduate School Islamic Azad University-South Tehran Branch, Tehran, Iran; email:
[email protected]
ISBN: 9789881821089
ABBREVIATED SOURCE TITLE: WCE - World Congr. Eng.
SOURCE: Scopus
Deljoo, V., Mirzapour Al-e-hashem, S.M.J., Deljoo, F., Aryanezhad, M.B.

23979464700;57200776002;57199548374;35615819500;
Using genetic algorithm to solve dynamic cell formation problem
71849115347&doi=10.1016%2fj.apm.2009.07.019&partnerID=40&md5=1806c1e67c2f79cf9617a4
31cb74083c
DOI: 10.1016/j.apm.2009.07.019
AFFILIATIONS: Department of Industrial Engineering, Bu ali Sina University,
Hamedan, Iran;
P.C. 16846113114, Tehran, Iran;
Department of Industrial Engineering, Amirkabir University of Technology, Tehran,
Iran
ABSTRACT: In this paper, solving a cell formation (CF) problem in dynamic condition
is going to be discussed using genetic algorithm (GA). Previous models presented in
the literature contain some essential errors which will decline their advantageous
aspects. In this paper these errors are discussed and a new improved formulation
for dynamic cell formation (DCF) problem is presented. Due to the fact that CF is a
NP-hard problem, solving the model using classical optimization methods needs a
long computational time. Therefore the improved DCF model is solved using a
proposed GA and the results are compared with the optimal solution and the
efficiency of the proposed algorithm is discussed and verified. © 2009.
AUTHOR KEYWORDS: Dynamic cell formation; Genetic algorithm; Meta heuristics
INDEX KEYWORDS: Cell formation; Classical optimization; Computational time; Dynamic
cell formation; Dynamic condition; Meta heuristics; NP-HARD problem; Optimal
solutions, Cellular manufacturing; Computational complexity; Computational
efficiency; Dispersion compensation; Errors; Genetic algorithms; Heuristic methods,
Problem solving
REFERENCES: Fry, T., Breen, M., Wilson, M., A successful implementation of group
technology and cell manufacturing (1987) Prod. Invent. Manage. J., 28 (3), pp. 4-6;

(1995) Prod. Invent. Manage. J., 36 (1), pp. 71-75;
Levasseur, G., Helms, M., Zink, A., Conversion from a functional to the cellular
manufacturing layout at Steward.inc (1995) Prod. Inv. Manage. J., 36 (3), pp. 37-
42;
Singh, N., Rajamaani, D., (1996) Cellular Manufacturing Systems: Planning and
Control, , Chapman and Hall, New York;
434-446;
uncertain production requirement with presence of routing flexibility, , Ph.D.
Thesis, Blacksburg State University Virginia;
Seifoddini, H., A probabilistic model for machine cell formation (1990) J. Manuf.
Syst., 9 (1), pp. 69-75;
Harahalakis, G., Nagi, R., Proth, J., An efficient heuristic in manufacturing cell
formation to group technology applications (1990) Int. J. Prod. Res., 28 (1), pp.
185-198;
flexible cell formation (1996) Prod. Plan. Control, 7 (6), pp. 585-593;
cell formation condition (1998) Ann. Oper. Res., 77 (1), pp. 109-128;
Wicks, E., (1995) Designing cellular manufacturing systems with time varying
product mixed and resource availability, , Ph.D. Thesis, Virginia Polytechnic
Institute and State University, Blacksburg, VA;
Tavakkoli, R., Aryanezhad, M., Safaei, N., Azaron, A., Solving a dynamic cell
formation problem using met heuristics (2005) Appl. Math. Comput., 170, pp. 761-
780;
Safaei, N., Saidi-Mehrabad, M., Jabal-Ameli, M.-S., A hybrid simulated annealing
for solving an extended model of dynamic cellular manufacturing system (2006) Eur.
J. Oper. Res, , 10.1016/j.ejor.2006.12.058;
approach (2007) Int. J. Adv. Manuf. Technol., 33 (9-10), pp. 1001-1009;
Res., , 10.1016/j.cor.2007.10.026;
Safaei, N., (2007) A fuzzy programming approach for a cell formation problem with
dynamic and uncertain conditions, Fuzzy Sets Syst, ,
http://dx.doi.org/10.1016/j.fss.2007.06.014;
reconfiguration (2007) Int. J. Prod. Res., , 10.1080/00207540701581809;
Tavakkoli-moghaddam, R., Safaei, N., Sassani, A., A new solution for a dynamic cell
annealing (2008) J. Oper. Res. Soc., 59, pp. 443-454;
and the worker assignment problem: a new model (2008) Int. J. Adv. Manuf. Technol.,
, 10.1007/s00170-008-1479-4;
Michigan Press, Ann Arbon;
Goldberg, D.E., (1989) Genetic Algorithm in Search Optimization, and Machine
Learning, , Addison-Wesley, Massachusetts;
Bagley, J.D., (1976) The behavior of adaptive systems which employ genetic and
correlation algorithms, , Ph.D. Thesis, University of Michigan;
Rosenberg, R.S., (1967) Simulation of genetic population with biochemical
properties, , Ph.D. Thesis, University of Michigan;
Cavicchio, D.J., (1972) Adaptive search using simulated evolution, , Ph.D. Thesis,
University of Michigan;
intra-cell moves in cell formation: a genetic algorithm (1995) Int. J. Comput.
Integr. Manuf., 8 (2), pp. 92-101;
Joines, J., Culberth, C., King, R., Manufacturing cell design: an integer
programming model employing genetic algorithms (1996) IIE Trans., 28 (1), pp. 69-
85;
Venugopal, V., Narendran, T., A genetic algorithm approach to the machine component
grouping problem with multiple objectives (1992) Comput. Ind. Eng., 22 (4), pp.
469-480
CORRESPONDENCE ADDRESS: Deljoo, V.; Department of Industrial Engineering, Bu ali
Sina University, Hamedan, Iran; email: [email protected]
ISSN: 0307904X
CODEN: AMMOD
SOURCE: Scopus
Wang, X., Tang, J., Yung, K.-L.

55736883500;55804452600;7006849197;
Optimization of the multi-objective dynamic cell formation problem using a scatter
search approach
69049115228&doi=10.1007%2fs00170-008-1835-
4&partnerID=40&md5=31a412e9f170eadfb7afa5cb13cda1a7
DOI: 10.1007/s00170-008-1835-4
AFFILIATIONS: Key Laboratory of Integrated Automation of Process Industry,
Department of Systems Engineering, Northeastern University (NEU), Shenyang,
Liaoning 110004, China;
Department of Industrial and Systems Engineering, Polytechnic University of Hong
Kong, Hung Hom, Kowloon, Hong Kong
ABSTRACT: This paper addresses the dynamic cell formation (DCF) problem with
multiple conflicting objectives. Recent researches have mainly focus on single-
objective cell formation procedures that deals with the identification of part
families and associated machine groups for constant demands. However, varying
market demands and fluctuations of the business environment have caused cellular
manufacturing systems to operate under dynamic conditions. Thus, the optimal
configuration of manufacturing cells in each period is different and the
reconfiguration of cells is required. This paper proposes a nonlinear multi-
objective mathematical model of the DCF problem by giving weighing to three
conflicting objectives including the machine relocation cost in the process of
reconfiguring cells, the utilization rate of machine capacity, and the total number
of intercell moves over the entire planning horizon. To solve the nonlinear multi-
objective model, a scatter search approach is developed, which redesigns the common
components of scatter search and incorporates diversification generator, global
criterion method, local search method, and other improvement mechanisms to provide
a wide exploration of the search space through intensification and diversification.
The proposed approach is compared with the commercial solver CPLEX on 10 test
problems, some of which are large dimensions. Computational results have
demonstrated the effectiveness of the scatter search approach. © 2008 Springer-
Verlag London Limited.
AUTHOR KEYWORDS: Cellular manufacturing; Dynamic cell formation; Multi-objective
optimization; Scatter search
INDEX KEYWORDS: Business environments; Cell formation procedures; Cellular
manufacturing systems; Commercial solvers; Computational results; Dynamic cell
formation; Dynamic condition; Global criterion method; Improvement mechanism;
Inter-cell moves; Large dimensions; Local search method; Manufacturing cells;
Market demand; Multi objective; Multiobjective models; Optimal configurations; Part
family; Planning horizons; Relocation costs; Scatter search; Search spaces; Test
problem; Utilization rates, Cell membranes; Dispersion compensation; Flexible
manufacturing systems; Mathematical models; Multiobjective optimization, Cellular
manufacturing
REFERENCES: Burbidge, J.L., Production flow analysis (1971) Prod Eng, 50, pp. 139-
152;
Implementation experiences and performance improvements (1997) Int J Prod Res, 35
(1), pp. 29-49., doi:10.1080/002075497195966;
doi:10.1007/BF01225760;
3-20., doi:10.1016/S0360-8352(97)00147-2;
flows (2005) Int J Adv Manuf Technol, 27 (1-2), pp. 159-165., doi:10.1007/s00170-
004-2143-2;
0862-2;
cell formation condition (1998) Ann Oper Res, 77 (1), pp. 109-128.,
doi:10.1023/A:1018917109580;
Mungwatanna, A., (2000) Design of Cellular Manufacturing Systems for Dynamic and
Uncertain Production Requirement with Presence of Routing Flexibility, , Ph.D.
thesis, Blacksburg State University;
genetic-algorithm-based heuristic (2006) Int J Prod Res, 44 (12), pp. 2421-2444.,
doi:10.1080/00207540500337833;
10), pp. 1001-1009., DOI 10.1007/s00170-006-0518-2;
10.1016/j.ejor.2006.12.058, PII S0377221707000811;
10.1080/002075400189275;
Decis Sci, 8, pp. 156-166., doi:10.1111/j.1540-5915.1977.tb01074.x;
10.1016/j.ejor.2004.08.004, PII S0377221704005430, Feature Cluster on Scatter
Search Methods for Optimization;
Evolution, Lecture Notes in Computer Science, 13-63, pp. 13-54., Springer Berlin;
Krishna, A.G., Rao, K.M., Multi-objective optimisation of surface grinding
operations using scatter search approach (2006) International Journal of Advanced
Manufacturing Technology, 29 (5), pp. 475-480., DOI 10.1007/s00170-005-2550-z;
Prabhaharan, G., Ramesh, R., Asokan, P., Concurrent optimization of assembly
tolerances for quality with position control using scatter search approach (2007)
10.1080/00207540600596866, PII 778983173;
Saravanan, M., Haq, A.N., Vivekraj, A.R., Prasad, T., Performance evaluation of the
scatter search method for permutation flowshop sequencing problems (2008) Int J Adv
Manuf Technol, 37 (11-12), pp. 1200-1208., doi:10.1007/s00170-007-1053-5;
Steele, D.C., Malhotra, M.K., Factors affecting performance of period batch control
systems in cellular manufacturing (1997) Int J Prod Res, 35 (2), pp. 421-446.,
doi:10.1080/002075497195830;
(1996) Int J Prod Res, 34 (5), pp. 1361-1380., doi:10.1080/00207549608904970;
Song, S., Hitomi, K., GT cell formation for minimizing the intercell parts flow
(1992) Int J Prod Res, 30 (12), pp. 2737-2753., doi:10.1080/00207549208948188;
Laguna, M., Marti, R., (2003) Scatter Search: Methodology and Implementations, , C.
Kluwer Boston;
Molina, J., Laguna, M., Marti, R., Caballero, R., SSPMO: A scatter tabu search
procedure for non-linear multiobjective optimization (2007) INFORMS J Comput, 19
(1), pp. 91-100., doi:10.1287/ijoc.1050.0149;
Zeleny, M., (1973) Compromise Programming in Multiple Criteria Decision Making, ,
University of South Carolina Press Columbia;
to cell-composition and layout design problems (1996) Int J Prod Res, 34 (2), pp.
447-482., doi:10.1080/00207549608904913
CORRESPONDENCE ADDRESS: Tang, J.; Key Laboratory of Integrated Automation of
Process Industry, Department of Systems Engineering, Northeastern University (NEU),
Shenyang, Liaoning 110004, China; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus

55910439800;6603156425;
An efficient ant colony optimization system for the manufacturing cells formation
problem
43449095771&doi=10.1007%2fs00170-006-0862-
2&partnerID=40&md5=b8ad5d5a5c584905449d4ee3c91a5c2a
DOI: 10.1007/s00170-006-0862-2
AFFILIATIONS: Department of Industrial Management and Technology, University of
Piraeus, 80 Karaoli and Demetriou Str., Piraeus 185 34, Greece
ABSTRACT: An ant colony optimization (ACO) scheme for the manufacturing cells
design problem is proposed, which uses a tight eigenvalue-based bound to guide and
accelerate the search. This feature is combined with a good initialization
procedure and with ideas from successful ACO implementations in other areas, to
achieve efficiency and reliability with the minimum structure and set of
parameters. The resulting algorithm produces most promising results for medium to
large size problems, with negligible computational effort. © 2006 Springer-Verlag
London Limited.
AUTHOR KEYWORDS: Ant colony optimization; Cell formation; Cellular manufacturing
INDEX KEYWORDS: Algorithms; Optimization; Parameter estimation; Problem solving,
Ant colony optimization; Cell formation, Cellular manufacturing
REFERENCES: Hyer, N.L., The potential of group technology for U.S. manufacturing
(1984) J Oper Mgmt, 4, pp. 183-202., 3;
Wemmerlov, U., Hyer, N.L., Research issues in cellular manufacturing (1987) Int J
Prod Res, 25, pp. 413-431., 3;
Singh, N., Rajamani, D., (1996) Cellular Manufacturing Systems, Design, Planning
Da Silveira, G., A methodology of implementation of cellular manufacturing (1999)
Int J Prod Res, 37, pp. 467-479., 2;
users (1989) Int J Prod Res, 27, pp. 1511-1530., 9;
OMEGA Int J Mgmt Sci, 20, pp. 493-501., 4;
systems (1994) Int J Prod Res, 32, pp. 2395-2429., 10;
formation of machine cells in group technology (1997) Int J Prod Res, 35, pp. 501-
511., 2;
Boctor, F.F., The minimum-cost, machine-part cell formation problem (1996) Int J
Prod Res, 34, pp. 1045-1063., 4;
Heragu, S.S., Group technology and cellular manufacturing (1994) Trans Syst Man and
Chen, J.S., Heragu, S.S., Stepwise decomposition approaches for large scale
formation problems (1999) Eur J Oper Res, 113, pp. 64-79;
Bender 's decomposition approach (1998) Eur J Oper Res, 107, pp. 175-192;
manufacturing systems cell formation problem (1998) Eur J Oper Res, 105, pp. 537-
551;
replicate machines (1999) Int J Prod Res, 37, pp. 707-720., 3;
algorithm for manufacturing cell design (1999) J Oper Res Soc, 50, pp. 509-516;
approach and a tabu search algorithm (2003) Int J Prod Res, 41, pp. 2531-2546., 11;
machine groups and part families (1998) Int J Prod Res, 36, pp. 1325-1337., 5;
programming for the solution of simple cell-formation problems (2001) Int J Prod
Res, 39, pp. 1-19., 1;
Venugopal, V., Narendran, T.T., Machine cell formation through neural network model
(1994) Int J Prod Res, 32, pp. 2105-2116;
inter-cell layout problem in cellular manufacturing (2004) Eur J Oper Res, 157, pp.
592-606;
Islier, A.A., Group technology by an ant system algorithm (2005) Int J Prod Res,
43, pp. 913-932., 5;
Sofianopoulou, S., Part and machine partitioning problem in cellular manufacturing:
Multiple machine environment (1996) Yugoslav J Oper Res, 6, pp. 183-191;
Theory of NP-Completeness, , Freeman New York;
Dorigo, M., Stützle, T., (2004) Ant Colony Optimization. Bradford Books, , MIT
Press Cambridge, Massachusetts;
Maniezzo, V., Gambardella, L.M., De Luigi, F., Onwubolu, G.C., Babu, B.V., Ant
Colony Optimization (2004) New Optimization Techniques in Engineering, pp. 101-
117., Springer-Verlag Berlin, Heidelberg;
Maniezzo, V., Exact and approximate nondeterministic tree-search procedures for the
quadratic assignment problem (1999) INFORMS J Comp, 11, pp. 358-369;
Schramm, H., Zowe, J., A version of the bundle idea for minimizing a nonsmooth
function: Conceptual idea, convergence analysis, numerical results (1992) SIAM J
Opt, 2, pp. 121-152., 1;
graph (1995) Ann Op Res, 58, pp. 155-179;
Falkner, J., Rendl, F., Wolkowicz, H., A computational study of graph partitioning
(1994) Math Prog, 66, pp. 211-239;
(1973) Int J Prod Res, 4, pp. 399-416;
manufacturing systems (1991) Int J Prod Res, 29, pp. 2097-2116., 10;
Econ, 9, pp. 73-81;
reorganisation by clustering techniques (1972) Op Res, 20, pp. 993-1009;
9;
machine families (1993) Int J Prod Res, 31, pp. 325-349., 2;
formation (2004) Comp Ind Eng, 47, pp. 247-273;
J Prod Res, 28, pp. 233-243., 2
CORRESPONDENCE ADDRESS: Sofianopoulou, S.; Department of Industrial Management and
Technology, University of Piraeus, 80 Karaoli and Demetriou Str., Piraeus 185 34,
Greece; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus

10045183300;7801495770;
A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell
formation problem
29144470404&doi=10.1016%2fj.cor.2005.02.005&partnerID=40&md5=d1447e00a287632de3037b
e984f31406
DOI: 10.1016/j.cor.2005.02.005
AFFILIATIONS: Département d'Informatique, Université m'Hamed Bouguerra à Boumerdès,
Avenue de l'indépendance, 35000 Boumerdès, Algeria;
Département d'Informatique, ITS, Université des Sciences et de la Technologie
Houari Boumedienne, BP 32, El-Alia, 16111 Babezzouar, Alger, Algeria;
Department of Computer Science, Boumerdès University, Boumerdès, Algeria;
Department of Computer Science, Institut des Techniciens Supérierus, Houari
Boumedienne University of Science and Technology, Algeria
ABSTRACT: This paper deals with the manufacturing cell formation (MCF) problem,
which is based on group technology principles, using a graph partitioning
formulation. An attempt has been made to take into account the natural constraints
of real-life production systems, such as operation sequences, minimum and maximum
numbers of cells, and maximum cell sizes. Cohabitation constraints were added to
the proposed model in order to deal with the necessity of grouping certain machines
in the same cell for technical reasons, and non-cohabitation constraints were
included to prevent placing certain machines in close vicinity. First, the problem
is solved with a genetic algorithm (GA), using a binary coding system that has
proved superior to the classic integer coding systems. A new Branch-and-Bound (B&B)
enhancement is then proposed to improve the GA's performance. The results obtained
for medium-sized instances using this enhancement are better than those obtained
using the GA alone. Given these results, it is reasonable to assume that the B&B
enhancement will provide good results for large real-life problems. © 2005 Elsevier
Ltd. All rights reserved.
AUTHOR KEYWORDS: Branch & bound; Genetic algorithm; Graph partitioning;
Manufacturing cell formation
INDEX KEYWORDS: Branch & bound; Graph partitioning; Integer coding; Manufacturing
cell formation, Binary codes; Cellular manufacturing; Constraint theory; Graph
theory; Integer programming; Problem solving, Genetic algorithms
REFERENCES: Souilah, A., (1994) Les Systèmes Cellulaires de Production: Agencement
Intracellulaire, , Dissertation, University of Metz;
Research, 18, pp. 213-232;
52, pp. 53-57;
Seifoddini, H., Single linkage v/s average linkage clustering in machine cells
formation applications (1989) Computers and Industrial Engineering, 16, pp. 419-
426;
36, pp. 157-179;
Yin, Y., Yasuada, K., Similarity Coefficient Methods Applied to the Cell Formation
Problem: A Taxonomy and Review, , URL, from Internet;
splitting and multiple units of same machine (1995) International Journal of
Harhalakis, G., Proth, J.-M., Xie, X., Manufacturing cell design using simulated
annealing (1990) International Journal of Production Research, 1, pp. 185-191;
Chen, C., Cotruvo, N.A., Baek, W., A simulated annealing solution for the cell
2601-2614;
(6), pp. 1353-1367;
Zolfaghari, O.T.H.S., Liang, M., An objective guided ortho synapse Hopfield network
Research, 35 (10), pp. 2773-2792;
Al-Sultan, K.S., Fedjki, C.A., A genetic algorithm for part family formation
problem (1997) Production Planning & Control, 8 (8), pp. 788-796;
Joines, J.A., Kay, M.G., King, R.E., A hybrid genetic algorithm for manufacturing
cell design (1997) Technical Report, , Department of Industrial Engineering, North
Carolina State University;
pp. 2185-2207;
Gonçalves, J.F., Resende, M.G.C., A hybrid genetic algorithm for manufacturing cell
formation (2002) AT&T Labs Research Technical Report, TD-5FE6RN;
(1), pp. 84-97;
Garey, D.L., Johnson, D.S., (1979) Computers and Intractability: A Guide to the
Theory of NP-completeness, , W.H.Freeman & Co. San Francisco;
Boulif, M., (2000) Composition de Cellules Flexibles dans les Systèmes Cellulaires
de Production Statiques et Dynamiques, , Magister Dissertation, University of
Sciences and Technology Houari Boumedienne, No. 03/2000-M/IN, March;
Learning, , Addison-Wesley Reading;
Murthy, C.V.R., Srinivasan, G., Fractional cell formation in group technology
formation problems (1999) European Journal of Operation Research, 113, pp. 64-79;
Papadimitriou, C.H., Steiglitz, K., (1981) Combinatorial Optimization: Algorithm
and Complexity, , Prentice-Hall Englewood Cliffs, NJ;
Gondran, M., Minoux, M., Graphes et algorithmes (1979) Eyrolles;
Nagi, R., Harhalakis, G., Proth, J.-M., Multiple routeing and capacity
Production Research, 28 (12), pp. 2243-2257
CORRESPONDENCE ADDRESS: Boulif, M.; Département d'Informatique, Université m'Hamed
Bouguerra à Boumerdès, Avenue de l'indépendance, 35000 Boumerdès, Algeria; email:
[email protected]
ISSN: 03050548
CODEN: CMORA
SOURCE: Scopus
Vila Gonçalves Filho, E., Tiberti, A.J.

6506082636;12774399200;
A group genetic algorithm for the machine cell formation problem
(2006) International Journal of Production Economics, 102 (1), pp. 1-21. Cited 48
times.
33644872358&doi=10.1016%2fj.ijpe.2004.12.029&partnerID=40&md5=13a9128b72cc66d9b56a6
44c14ffabdc
DOI: 10.1016/j.ijpe.2004.12.029
AFFILIATIONS: Mechanical Engineering Department, São Carlos Engineering School,
University of São Paulo, Av. Trabalhador Saocarlense 400, Sao Carlos, Sao Paulo
13566-590, Brazil
ABSTRACT: The facility layout is a fundamental element to achieve the company's
manufacturing strategy. To obtain a good layout design, appropriate computational
algorithms as an aid to the layout designer in the decision making process during
the factory layout design should be applied. This work presents a new genetic
algorithm (GA) for the cell layout design. It is based on group encoding instead of
simple machine encoding, generally used by most of the GA implementations
encountered in the literature. Moreover, new crossover and mutation operators are
proposed. Tests using published data show that the proposed algorithm can find the
group structure present in the data sets. © 2005 Elsevier B.V. All rights reserved.
AUTHOR KEYWORDS: Genetic algorithm; Group technology; Machine cell formation;
Manufacturing cells
INDEX KEYWORDS: Cellular manufacturing; Computational methods; Group technology;
Problem solving, Group structure; Machine cell formation; Machine encoding, Genetic
algorithms
REFERENCES: Anderberg, M.R., (1973) Cluster Analysis for Aplications, , Academic
Press New York;
Apple, J.M., (1977) Plant Layout and Material Handling, , Wiley New York;
Askin, R.G., Standridge, C.R., (1993) Modelling and Analysis of Manufacturing
Balakrishnan, J., Cheng, C.H., Conway, D.G., Lau, C.M., A hybrid genetic algorithm
for the dynamic plant layout problem (2003) International Journal of Production
Billo, R.E., Bidanda, B., Tate, D., A genetic algorithm formulation of the cell
formation problem (1994) Proceedings of the 16th International Conference on
Computers and Industrial Engineering, , March 7-9;
Billo, R.E., Bidanda, B., Tate, D., A genetic cluster algorithm for the machine-
component grouping problem (1996) Journal of Intelligent Manufacturing, 7, pp. 229-
241;
using genetic algorithm (1998) Robotics and Computer-Integrated Manufacturing, 14,
pp. 339-346;
Falkenauer, E., (1998) Genetic Algorithms and Grouping, , Wiley New York;
Gen, M., Cheng, R., (2000) Genetic Algorithms and Engineering Optimization, , Wiley
New York;
Goldberg, D.E., (1989) Genetic Algorithm in Search, Optimization, and Machine
Learning, , Addison-Wesley Reading, MA;
Gong, D., Yamazaki, G., Gen, M., Xu, W., A genetic algorithm method for one-
dimensional machine location problems (1999) International Journal of Production
Economics, 60-61, pp. 337-342;
Heragu, S., (1997) Facilities Design, , PWS Publishing Company Boston, MA;
Michigan Press Michigan;
Irani, S.A., (1999) Handbook of Cellular Manufacturing Systems, , Wiley NY;
programming model employing genetic algorithms (1996) IIE Transactions, pp. 69-85;
Lit, P.De., Falkenauer, E., Delchambre, A., Grouping genetic algorithms: An
Mak, K.L., Wong, Y.S., Chan, F.T.S., A genetic algorithm for facility layout
problems (1998) Computer Integrated Manufacturing Systems, 11 (1-2), pp. 113-127;
Michalewicz, Z., (1996) Genetic Algorithm + Data Structures = Evolution Programs, ,
3rd ed Springer New York;
pp. 421-426;
Ohno, T., (1988) Toyota Production System, , Productivity Press Portland;
Planquin, M.F., Pierreval, H., Cell formation using evolutionary algorithms with
certain constraints (2000) International Journal of Production Economics, 64, pp.
267-278;
Suresh, G., Vinod, V.V., Sahu, S., A genetic algorithm for facility layout (1995)
Tam, K.Y., Genetic algorithm, function optimization and facility layout design
Tompkins, J.T., White, J.A., Bozer, Y.A., Frazelle, E.H., Tanchoco, J.M.A.,
Trevino, J., (1996) Facilities Planning, , 2nd ed Wiley New York;
component grouping problem with multiple objectives (1992) Computers in Industrial
Engineering, 22 (4), pp. 469-480;
approach to machine group problems (1997) International Journal of Production
Research, 35 (10), pp. 2773-2792
CORRESPONDENCE ADDRESS: Vila Gonçalves Filho, E.; Mechanical Engineering
Department, São Carlos Engineering School, University of São Paulo, Av. Trabalhador
Saocarlense 400, Sao Carlos, Sao Paulo 13566-590, Brazil; email: [email protected]
ISSN: 09255273
CODEN: IJPCE
SOURCE: Scopus
Yin, Y., Yasuda, K.

35739337500;13405856800;
Similarity coefficient methods applied to the cell formation problem: A taxonomy
and review
(2006) International Journal of Production Economics, 101 (2), pp. 329-352. Cited
145 times.
31744439382&doi=10.1016%2fj.ijpe.2005.01.014&partnerID=40&md5=9cb9f51a54a879ec8afbe
1aa2e06aa51
DOI: 10.1016/j.ijpe.2005.01.014
AFFILIATIONS: Industrial and Management Science, Department of Public Policy and
Social Studies, Yamagata University, 1-4-12, Kojirakawa-cho, Yamagata-shi, 990-
8560, Japan;
Graduate School of Economics and Management, Tohoku University, Kawauchi, Aoba-ku,
Sendai 980-8576, Japan
ABSTRACT: The initial step in the design of a cellular manufacturing (CM) system is
the identification of part families and machine groups and forming manufacturing
cells so as to process each part family within a machine group with minimum inter-
cellular movements of parts. One methodology to form manufacturing cells is the use
of similarity coefficients in conjunction with clustering procedures. In this
paper, we give a comprehensive overview and discussion for similarity coefficients
developed to date for use in solving the cell formation (CF) problem. More than 160
sources from premier scientific journals, conferences and books have been reviewed.
Despite previous studies indicated that similarity coefficients based method (SCM)
is more flexible than other CF methods, none of the studies has explained the
reason why SCM is more flexible. This paper tries to explain the reason explicitly.
We also develop a taxonomy to clarify the definition and usage of various
similarity coefficients in designing CM systems. Existing similarity
(dissimilarity) coefficients developed so far are mapped onto the taxonomy.
Additionally, production information based similarity coefficients are discussed
and a historical evolution of these similarity coefficients is outlined. Finally,
recommendations for future research are suggested in this paper.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Similarity coefficient;
Taxonomy
INDEX KEYWORDS: Cellular manufacturing; Evolutionary algorithms; Handbooks; Problem
solving; Production engineering, Cell formation; Similarity coefficient; Taxonomy,
Taxation
performance studies on functional and cellular manufacturing layouts (1998)
Al-Sultan, K.S., Fedjki, C.A., A genetic algorithm for the part family formation
problem (1997) Production Planning & Control, 8, pp. 788-796;
Anderberg, M.R., (1973) Cluster Analysis for Applications, , Academic Press New
York;
Arthanari, T.S., Dodge, Y., (1981) Mathematical Programming in Statistics, , Wiley
New York;
cellular manufacturing systems (1997) IIE Transaction, 29, pp. 599-610;
Baker, R.P., Maropoulos, P.G., An automatic clustering algorithm suitable for use
by a computer-based tool for the design, management and continuous improvement of
cellular manufacturing systems (1997) Computers Integrated Manufacturing Systems,
10, pp. 217-230;
Balakrishnan, J., Manufacturing cell formation using similarity coefficients and
pair-wise interchange: Formation and comparison (1996) Production Planning &
Control, 7, pp. 11-21;
Balakrishnan, J., Cheng, C.H., Dynamic layout algorithms: A state-of-the-art survey
(1998) Omega, 26, pp. 507-521;
Baroni-Urbani, C., Buser, M.W., Similarity of binary data (1976) Systematic
Zoology, 25, pp. 251-259;
Beatty, C.A., Implementing advanced manufacturing technologies: Rules of the road
(1992) Sloan Management Review Summer, pp. 49-60;
Ben-Arieh, D., Chang, P.T., An extension to the p-median group technology algorithm
(1994) Computers and Operations Research, 21, pp. 119-125;
Ben-Arieh, D., Sreenivasan, R., Information analysis in a distributed dynamic group
technology method (1999) International Journal of Production Economics, 60-61, pp.
427-432;
Bijnen, E.J., (1973) Cluster Analysis, , Tilburg University Press The Netherlands;
Bishop, Y.M.M., Fienberg, S.E., Holland, P.W., (1975) Discrete Multivariate
Analysis: Theory and Practice, , MIT Press Cambridge, MA;
152;
Burbidge, J.L., Falster, P., Rhs, J.O., Why is it difficult to sell group
technology and just-in-time to industry? (1991) Production Planning & Control, 2,
pp. 160-166;
Cedeno, A.A., Suer, G.A., The use of a similarity coefficient-based method to
perform clustering analysis to a large set of data with dissimilar parts (1997)
Research, 24, pp. 451-464;
Research, 24, pp. 1221-1233;
Chang, P.T., Lee, E.S., A multisolution method for cell formation - Exploring
practical alternatives in group technology manufacturing (2000) Computers and
Mathematics with Applications, 40, pp. 1285-1296;
Cheng, C.H., Goh, C.H., Lee, A., A two-stage procedure for designing a group
technology system (1995) International Journal of Operations & Production
Cheng, C.H., Madan, M.S., Motwani, J., Designing cellular manufacturing systems by
a truncated tree search (1996) International Journal of Production Research, 34,
pp. 349-361;
Research, 36, pp. 1325-1337;
Choobineh, F., Nare, A., The impact of ignored attributes on a CMS design (1999)
Chow, W.S., Discussion: A note on a linear cell clustering algorithm (1991)
problem in cellular manufacturing (1992) Computers and Industrial Engineering, 22,
pp. 95-100;
Chow, W.S., Hawaleshka, O., Minimizing intercellular part movements in
31, pp. 2161-2170;
Chow, W.S., Hawaleshka, O., A novel machine grouping and knowledge-based approach
for cellular manufacturing (1993) European Journal of Operational Research, 69, pp.
357-372;
pp. 289-295;
Chu, C.H., Pan, P., (1988) The Use of Clustering Techniques in Manufacturing
Cellular Formation, , Proceedings of International Industrial Engineering
Conference Orlando, FL;
Dutta, S.P., Lashkari, R.S., Nadoli, G., Ravi, T., A heuristic procedure for
determining manufacturing families from design-based grouping for flexible
manufacturing systems (1986) Computers and Industrial Engineering, 10, pp. 193-201;
Everitt, (1980) Cluster Analysis, , Halsted Press New York;

Studies, pp. 301-315., A. Kusiak Elsevier Science Publishers B.V North-Holland;
Fazakerley, G.M., A research report on the human aspects of group technology and
cellular manufacture (1976) International Journal of Production Research, 14, pp.
123-134;
Gongaware, T.A., Ham, I., (1991) Cluster Analysis Applications for Group Technology
Manufacturing Systems, , Proceedings of the Ninth North American Manufacturing
Research Conference;
Gordon, A.D., (1999) Classification, , second ed Chapman & Hall US;
manufacturing systems - A sequential modeling approach (1989) Computers and
Gupta, T., Clustering algorithms for the design of a cellular manufacturing system
- An analysis of their performance (1991) Computers and Industrial Engineering, 20,
pp. 461-468;
alternative routing (1993) International Journal of Production Research, 31, pp.
1259-1273;
Han, C., Ham, I., Multiobjective cluster analysis for part family formations (1986)
Ho, Y.C., Lee, C., Moodie, C.L., Two sequence-pattern, matching-based, flow
analysis methods for multi-flowlines layout design (1993) International Journal of
environment with flexible processing and routing capabilities (1996) International
Holley, J.W., Guilford, J.P., A note on the G index of agreement (1964) Educational
423-431;
formation based on alternative routes during machine failure (1998) Computers and
Josien, K., Liao, T.W., Integrated use of fuzzy c-means and fuzzy KNN for GT part
family and machine cell formation (2000) International Journal of Production
Research, 38, pp. 3513-3536;
Kamrani, A.K., Parsaei, H.R., Chaudhry, M.A., A survey of design methods for
manufacturing cells (1993) Computers and Industrial Engineering, 25, pp. 487-490;
117-133;
Journal of Production Economics, 60-61, pp. 433-438;
Kulkarni, U.R., Kiang, M.Y., Dynamic grouping of parts in flexible manufacturing
systems - A self-organizing neural networks approach (1995) European Journal of
1728;
2633-2646;
Kusiak, A., Heragu, S.S., The facility layout problem (1987) European Journal of
(1986) Control and Cybernetics, 15, pp. 139-154;
Kusiak, A., Boe, W.J., Cheng, C., Designing cellular manufacturing systems: Branch-
and-bound and A* approaches (1993) IIE Transactions, 25, pp. 46-56;
Lashkari, R.S., Boparai, R., Paulo, J., Towards an integrated model of operation
allocation and material handling selection in cellular manufacturing systems (2004)
Lashkari, R.S., Gunasingh, K.R., A Lagrangian relaxation approach to machine
allocation in cellular manufacturing systems (1990) Computers and Industrial
considering alternative routing (1997) Computers Integrated Manufacturing Systems,
10, pp. 93-107;
Leem, C.W., Chen, J.J.G., Fuzzy-set-based machine-cell formation in cellular
Liggett, R.S., Automated facilities layout: Past, present and future (2000)
Automation in Construction, 9, pp. 197-215;
the weighted production-cell formation problem (1996) IIE Transactions, 28, pp.
579-589;
Logendran, R., Effect of the identification of key machines in the cell formation
problem of cellular manufacturing systems (1991) Computers and Industrial
Society, 50, pp. 509-516;
Luong, L.H.S., A cellular similarity coefficient algorithm for the design of
manufacturing cells (1993) International Journal of Production Research, 31, pp.
1757-1766;
Mansouri, S.A., Husseini, S.M.M., Newman, S.T., A review of the modern approaches
to multi-criteria cell design (2000) International Journal of Production Research,
38, pp. 1201-1218;
Marcotorchino, F., Block seriation problems: A unified approach (1987) Applied
Stochastic Models and Data Analysis, 3, pp. 73-91;
1094;
Mehrez, A., Rabinowitz, G., Reisman, A., A conceptual scheme of knowledge systems
for MS/OR (1988) Omega, 16, pp. 421-428;
National Lending Library of Science and Technology Boston, MA;
implementation - A state of the art survey (1985) Omega, 13, pp. 381-391;
as applied to the group technology configuration problem (1997) Omega, 25, pp. 65-
79;
Murthy, Ch.V.R., Srinivasan, G., Fractional cell formation in group technology
Nair, G.J.K., Narendran, T.T., CASE: A clustering algorithm for cell formation with
Nair, G.J.K., Narendran, T.T., ACCORD: A bicriterion algorithm for cell formation
using ordinal and ratio-level data (1999) International Journal of Production
Research, 37, pp. 539-556;
Offodile, O.F., Application of similarity coefficient method to parts coding and
classification analysis in group technology (1991) Journal of Manufacturing
Systems, 10, pp. 442-448;
Offodile, O.F., Machine grouping in cellular manufacturing (1993) Omega, 21, pp.
35-52;
Offodile, O.F., Grznar, J., Part family formation for variety reduction in flexible
manufacturing systems (1997) International Journal of Operations & Production
Onwubolu, G.C., Mlilo, P.T., Manufacturing cell grouping using similarity
coefficient-distance measure (1998) Production Planning & Control, 9, pp. 489-493;
Opitz, H., Eversheim, W., Wienhal, H.P., Work-piece classification and its
(1994) Computers in Industry, 255, pp. 83-94;
Rajagopalan, R., Batra, J.L., Design of cellular production system: A graph
567-579;
Reisman, A., Kirshnick, F., Research strategies used by OR/MS workers as shown by
an analysis of papers in flagship journals (1995) Operations Research, 43, pp. 731-
739;
pp. 508-520;
Ribeiro, J.F.F., Pradin, B., A methodology for cellular manufacturing design (1993)
Rogers, D.J., Tanimoto, T.T., A computer program for classifying plants (1960)
Science, 132, pp. 1115-1118;
Romesburg, H.C., (1984) Cluster Analysis for Researchers, , Lifetime Learning
Publications, Wadsworth, Inc. Belmont, CA;
Samatova, N.F., Potok, T.E., Leuze, M.R., Vector space model for the generalized
parts grouping problem (2001) Robotics and Computer Integrated Manufacturing, 17,
pp. 73-80;
Sarker, B.R., Islam, K.M.S., Relative performances of similarity and dissimilarity
measures (1999) Computers and Industrial Engineering, 37, pp. 769-807;
Seifoddini, H., Incorporation of the production volume in machine cells formation
in group technology applications (1987) Proceedings of the IXth ICPR, pp. 2348-
2356., October;
Mital, A., (1988) Recent Developments in Production Research, pp. 562-570.,
Elsevier Science Publishers B.V., The Netherlands;
426;
pp. 35-44;
clustering algorithms in cellular manufacturing (1994) Journal of Manufacturing
Systems, 13, pp. 119-127;
case study at Harnischfeger (1999) International Journal of Production Research,
37, pp. 3263-3273;
handling cost in machine-component grouping (1987) IIE Transactions, 19, pp. 266-
270;
(1985) Engineering Cost and Production Economics, 9, pp. 125-134;
Sevier, A.J., Managing employee resistance to just-in-time: Creating an atmosphere
that facilitates implementation (1992) Production and Inventory Management Journal,
33, pp. 83-87;
Shafer, S.M., Meredith, J.R., Marsh, R.F., A taxonomy for alternative equipment
groupings in batch environments (1995) Omega, 23, pp. 361-376;
Research, 31, pp. 1133-1142;
Shambu, G., Suresh, N.C., Performance of hybrid cellular manufacturing systems: A
120, pp. 436-458;
Shiko, G., A process planning-orientated approach to part family formation problem
Research, 30, pp. 1739-1752;
Silveira, G.D., A methodology of implementation of cellular manufacturing (1999)
Singh, N., (1996) Systems Approach to Computer-integrated Design and Manufacturing,
, Wiley New York;
Sneath, P.H.A., Sokal, R.R., (1973) Numerical Taxonomy, , W.H. Freeman San
Francisco;
relationships (1958) The University of Kansas Science Bulletin, 38, pp. 1409-1438;
scheduling problem (2004) International Journal of Production Economics, 88, pp.
231-241;
Research, 32, pp. 2149-2158;
463-478;
Srinivasan, G., Zimmers, E.W., Fractional cell formation - Issues and approaches
(1998) International Journal of Industrial Engineering, 5, pp. 257-264;
Research, 28, pp. 145-152;
Suer, G.A., Cedeno, A.A., A configuration-based clustering algorithm for family
24, pp. 909-930;
Vakharia, A.J., Wemmerlöv, U., A new design method for cellular manufacturing
systems (1987) Proceedings of the IXth ICPR, , Cincinnati Ohio;
materials flow approach based on operation sequences (1990) IIE Transactions, 22,
pp. 84-97;
technology (1996) International Journal of Production Research, 34, pp. 2691-2700;
pp. 81-84;
manufacturing: An experimental study (1995) Computers and Industrial Engineering,
29, pp. 567-571;
Wang, J., Roze, C., Formation of machine cells and part families: A modified p-
median model and a comparative study (1997) International Journal of Production
Research, 35, pp. 1259-1286;
Wei, J.C., Kern, G.M., Commonality analysis: A linear cell clustering algorithm for
2062;
Wei, J.C., Kern, G.M., Discussion: Reply to 'A note on a linear cell clustering
algorithm' (1991) International Journal of Production Research, 29, pp. 217-218;
Wemmerlöv, U., Johnson, D.J., Empirical findings on manufacturing cell design
Won, Y.K., New p-median approach to cell formation with alternative process plans
Won, Y.K., Two-phase approach to GT cell formation using efficient p-median
formulation (2000) International Journal of Production Research, 38, pp. 1601-1613;
1409-1421;
17;
48, pp. 471-489;
67
CORRESPONDENCE ADDRESS: Yin, Y.; Industrial and Management Science, Department of
Public Policy and Social Studies, Yamagata University, 1-4-12, Kojirakawa-cho,
Yamagata-shi, 990-8560, Japan; email: [email protected]
ISSN: 09255273
CODEN: IJPCE
SOURCE: Scopus

10045183300;7801495770;
An exact multiobjective epsilon-constraint approach for the manufacturing cell
formation problem
(2006) Proceedings - ICSSSM'06: 2006 International Conference on Service Systems
and Service Management, 2, art. no. 4114607, pp. 883-888. Cited 4 times.
40649121573&doi=10.1109%2fICSSSM.2006.320737&partnerID=40&md5=2d3835406e60fddf9dd6f
a929291c679
DOI: 10.1109/ICSSSM.2006.320737
AFFILIATIONS: Département d'Informatique, Faculté des Sciences, Université m'Hamed
Bouguerra à Boumerdès, Avenue de l'indépendance, 35000. Boumerdès, Algeria;
Département d'Informatique, Faculté Génie Electrique et Informatique, Université
des Sciences et de la Technologie Houari Boumedienne, BP 32. El-Alia, 16111.
Babezzouar. Alger, Algeria
ABSTRACT: Cell formation is one of the main problems to be solved when dealing with
cellular manufacturing. An exact graph theory based Branch & Bound method has been
proposed by the authors [1]. In this paper we tackle the problem by considering two
objectives: minimizing both intercellular movements and workload unbalance. We
argue that when an epsilon-constraint approach is adopted, an enhancement of the
lower bound of the B&B branching step can be obtained. This improvement gives a
worthwhile help to the method efficiency when seeking to solve the problem
optimally. © 2006 IEEE.
AUTHOR KEYWORDS: Branch & bound; Epsilon-constraint multiobjective optimization;
Graph partitioning; Manufacturing cell formation
INDEX KEYWORDS: Cellular manufacturing; Graph theory; Optimization; Problem
solving, Epsilon-constraint multiobjective optimization; Graph partitioning;
Manufacturing cell formation, Constraint theory
CORRESPONDENCE ADDRESS: Boulif, M.; Département d'Informatique, Faculté des
Sciences, Université m'Hamed Bouguerra à Boumerdès, Avenue de l'indépendance,
35000. Boumerdès, Algeria; email: [email protected]
ISBN: 1424404517; 9781424404513

ABBREVIATED SOURCE TITLE: Int. Conf. Services Systems Services Manage. Proc. ICSSSM
SOURCE: Scopus
Tavakkoli-Moghaddam, R., Aryanezhad, M.B., Safaei, N., Azaron, A.

56491438400;35615819500;8886880300;6602891469;
Solving a dynamic cell formation problem using metaheuristics
(2005) Applied Mathematics and Computation, 170 (2), pp. 761-780. Cited 114 times.
27144523722&doi=10.1016%2fj.amc.2004.12.021&partnerID=40&md5=37d9460dfccecf14e8d07b
0be092fbd9
DOI: 10.1016/j.amc.2004.12.021
AFFILIATIONS: Department of Industrial Engineering, University of Tehran, Tehran,
Iran;
Tehran, Iran;
Department of Artificial Complex Systems Engineering, Graduate School of
Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, 739-8527,
Japan
ABSTRACT: In this paper, solving a cell formation (CF) problem in dynamic condition
is going to be discussed by using some traditional metaheuristic methods such as
genetic algorithm (GA), simulated annealing (SA) and tabu search (TS). Most of
previous researches were done under the static condition. Due to the fact that CF
is a NP-hard problem, then solving the model using classical optimization methods
needs a long computational time. In this research, a nonlinear integer model of CF
is first given and then solved by GA, SA and TS. Then, the results are compared
with the optimal solution and the efficiency of the proposed algorithms is
discussed. © 2005 Elsevier Inc. All rights reserved.
AUTHOR KEYWORDS: Dynamic cell formation; Genetic algorithm; Simulated annealing;
Tabu search
INDEX KEYWORDS: Computational complexity; Genetic algorithms; Heuristic methods;
Integer programming; Mathematical models; Nonlinear equations; Optimization;
Simulated annealing, Dynamic cell formation; Metaheuristics; Nonlinear integer
model; Tabu search, Problem solving
REFERENCES: Montreuil, B., Laforge, A., Dynamic layout design given a scenario tree
of probable futures (1992) European Journal of Operational Research., 63, pp. 271-
286;
Wilhelm, W., Chiou, C., Chang, D., Integrating design and planning considerations
in cell formation (1998) Annals of Operations Research, 77 (1), pp. 97-107;
Benjaafar, S., Sheikhzadeh, M., Design of flexible plant layouts (2000) IIE
Yang, T., Peters, B., Flexible machine layout design for dynamic and uncertain
production conditions (1998) European Journal of Operational Research, 108, pp. 49-
64;
flexible cell formation (1996) Production Planning and Control, 7 (6), pp. 585-593;
Harahalaks, G., Nagi, R., Proth, J., An efficient heuristic in manufacturing cell
formation to group technology applications (1990) International Journal of
Uncertain Production Requirement with Presence of Routing Flexibility, , Ph.D.
Thesis, Blacksburg State University Virginia;
Michigan Press Ann Arbon;
Goldberg, D.E., (1989) Genetic Algorithm in Search Optimization, and Machine
Learning, , Addison-Wesley Massachusetts;
Bagley, J.D., (1976) The Behavior of Adaptive Systems Which Employ Genetic and
Correlation Algorithms, , Ph.D. Thesis, University of Michigan;
Rosenberg, R.S., (1967) Simulation of Genetic Population with Biochemical
Properties, , Ph.D. Thesis, University of Michigan;
Cavicchio, D.J., (1972) Adaptive Search Using Simulated Evolution, , Ph.D. Thesis,
intra-cell moves in cell formation: A genetic algorithm (1995) International
Journal of Computer Integrated Manufacturing, 8 (2), pp. 92-101;
Joines, J., Culberth, C., King, R., Manufacturing cell design: An integer
69-85;
Engineering, 22 (4), pp. 469-480;
Kirkpatrick, F., Gelatt, C., Vecci, M., Optimization by simulated annealing (1983)
Science, 220, pp. 671-680;
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Equations of state
calculations by fast computing machines (1953) Journal of Chemical Physics, 21, pp.
1087-1092;
Sofanopoulou, S., Manufacturing cells design with alternative process plans and/or
707-720;
approach (1997) International Journal of Production Research, 35 (7), pp. 84-97;
CORRESPONDENCE ADDRESS: Azaron, A.; Department of Artificial Complex Systems
Engineering, Graduate School of Engineering, Hiroshima University, Kagamiyama 1-4-
1, Higashi-Hiroshima, 739-8527, Japan; email: [email protected]
ISSN: 00963003
CODEN: AMHCB
ABBREVIATED SOURCE TITLE: Appl. Math. Comput.
SOURCE: Scopus
Schaller, J.
7102451223;
Tabu search procedures for the cell formation problem with intra-cell transfer
costs as a function of cell size
26444524354&doi=10.1016%2fj.cie.2005.07.005&partnerID=40&md5=1b3eba3fd40bb4a0e438e1
effcc94f7d
DOI: 10.1016/j.cie.2005.07.005
AFFILIATIONS: Department of Business Administration, Eastern Connecticut State
University, 83 Windham Street, Willimantic, CT 06226, United States
ABSTRACT: This paper compares four procedures that generate heuristic solutions for
a cell formation integer programming model. The objective of the model is to
minimize cost. The cost elements included in the model are: cost of intra-cell and
inter-cell moves, and the cost of the equipment used in the cells. The cost of an
intra-cell move is based on the size of the cell in terms of the number of machines
included in the cell. The procedures were tested on 19 problems obtained from the
literature. The results show that a previous method developed by Sankaran and
Kasilingam (1993) is very efficient but generates poor solutions. A tabu search
procedure that starts with the solution generated by the Sankaran and Kasilingam
procedure significantly improved the solutions. A second tabu search procedure that
uses a new method of developing an initial solution also generated better solutions
than the Sankaran and Kasilingam procedure and on the larger sized problems
generated the best solutions. © 2005 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Cellular manufacturing; Heuristics; Integer programming
INDEX KEYWORDS: Heuristic methods; Integer programming; Mathematical models, Cell
formation; Heuristics; Inter-cell moves; Intra-cell move; Kasilingam solution,
19 (5), pp. 305-317;
cellular manufacturing systems (1997) Institute of International Education
113;
Burbidge, J.L., (1975) The Introduction of Group Technology, , Wiley New York;
Research, 24 (5), pp. 1221-1233;
De Witte, J., The use of similarity coefficients in production analysis (1980)
Glover, F., Tabu search - Part i (1989) ORSA Journal on Computing, 1 (3), pp. 190-
206;
Glover, F., Tabu search - Part II (1990) ORSA Journal on Computing, 2 (1), pp. 4-
32;
373-383;
(1989) Institute of International Education Transactions, 21 (4), pp. 382-388;
Selim, H., Askin, R.G., Vakharia, A.J., Cell formation in group technology: Review,
evaluation and directions for future research (1998) Computers and Industrial
Srinivasan, G., Narendran, T.T., Mahaderan, B., An assignment model for the part-
Research, 28 (1), pp. 145-152;
and Production Economics, 9., Elsevier Science Publishers BV Amsterdam;
Management, 6 (2), pp. 125-147;
Wemmerlöv, U., Johnson, D.J., Empirical findings on manufacturing cell design
CORRESPONDENCE ADDRESS: Schaller, J.; Department of Business Administration,
Eastern Connecticut State University, 83 Windham Street, Willimantic, CT 06226,
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Chan, F.T.S., Lau, K.W., Chan, P.L.Y., Au, K.C.

7202586517;36722692600;7403540482;8215393200;
Macro-approach of cell formation problem with consideration of machining sequence
(2004) IEEE International Engineering Management Conference, 3, pp. 1126-1130.
17644367191&partnerID=40&md5=eb58e406d7c6b4d906d0f8b90dab2b86
AFFILIATIONS: Dept. of Indust. and Mfg. Syst. Eng., University of Hong Kong, Hong
Kong, Hong Kong
ABSTRACT: Cellular Manufacturing System (CMS) which is based on the concept of
Group Technology (GT) has been recognized as an efficient and effective way to
improve the productivity in the factory. In recent years, there has been much
effort done for continuing to improve CMS. Most researches concentrated on
distinguishing the part families and machine cells either simultaneously or
individually by considering of minimizing intercellular and intracellular part
movements. However, fewer researches have studied the impact of the sequencing of
machine cells. In light of this, the main aim of this present work is to study the
impact of the sequencing of allocating the machine cells in minimizing
intercellular part movement. The problem scope, which is also called as machine-
part grouping problem (MPGP) together with the background of cell layout problem
(CLP), has been identified. A mathematical model is formulated and part incidence
matrix with operational sequence is often used. Since MPGP has been proved as an NP
complete, genetic algorithm (GA) is employed as cell formation algorithms in
solving this problem. © 2004 IEEE.
AUTHOR KEYWORDS: Cell layout problem; Genetic algorithm; Machine-part grouping
problem; Operational sequence; Sequencing
INDEX KEYWORDS: Computer simulation; Genetic algorithms; Mathematical models;
Optimization; Probability; Regression analysis; Statistical methods, Cell layout
problem; Machine-part grouping; Operational sequence; Sequencing, Machining
REFERENCES: Kazerooni, M.L., Luong, H.S., Abhary, K., A genetic algorithm based
cell design considering alternative routing (1997) International Journal of
Computer Integrated Manufacturing Systems, 10 (2), pp. 93-107;
multi-period planning horizons of cellular manufacturing systems (1998) Production
Planning and Control, 9 (6), pp. 561-571;
King, J.R., Machine - Component grouping in production flow analysis: An approach
Research, 18, pp. 213-232;
Production Management, , Boston, MA: Kluwer-Nijho;
using genetic algorithms (1998) International Journal of Robotics and Computer
Integrated Manufacturing, 14 (5-6), pp. 339-346;
Research, 36 (5), pp. 1325-1337;
Won, Y.Y., Lee, K.C., Group technology cell formation considering operation
sequences and production volumes (2001) International Journal of Production
Research, 39 (12), pp. 2755-2768;
Nair, G.J., Narendran, T.T., Case: A clustering algorithm for cell formation with
179;
885-906;
Research, 38, pp. 385-395;
certain constraints (2000) International Journal of Production Economics, 64, pp.
267-278;
production and transport systems (2003) Journal of Engineering Manufacture (JEM),
217 (7), pp. 883-897;
Al-Hakim, L., On solving facility layout problems using genetic algorithms (2000)
Goldberg, D.E., Lingle, R., Alleles Loci and the TSF (1985) Proceedings of the
First International Conference on Genetic Algorithms, pp. 154-159., San Mateo,
California (CA: Morgan Kaufmann);
Davis, L., Job shop scheduling with genetic algorithms (1985) Proceedings of the
California (CA: Morgan Kaufmann)
CORRESPONDENCE ADDRESS: Chan, F.T.S.; Dept. of Indust. and Mfg. Syst. Eng.,
University of Hong Kong, Hong Kong, Hong Kong
EDITORS: Xie M., Durrani T.S., Tnag H.K.
CODEN: IEMCF
ABBREVIATED SOURCE TITLE: IEEE Int Eng Manage Conf
SOURCE: Scopus
Kara, Y., Peker, A.

15834728900;56264611400;
Erratum: Parameter setting of the fuzzy ART neural network to the part-machine cell
formation problem (International Journal of Production Research (2003) 42 (1257-
1278))
(2004) International Journal of Production Research, 42 (9), p. 1895.
11144357253&doi=10.1080%2f0020754042000203885&partnerID=40&md5=276ce2f90be61c433443
dee87a14dc20
DOI: 10.1080/0020754042000203885
ISSN: 00207543
CODEN: IJPRB
DOCUMENT TYPE: Erratum
SOURCE: Scopus
Tavakkoli-Moghaddam, R., Rabbani, M., Iman-Eini, M.

56491438400;57208701862;10539647500;
Solving manufacturing cell formation problems in dynamic and stochastic states by a
hybrid method [Solving manufacturing cell formation problems in dynamic and
stochastic states by a hybrid method]
(2004) Amirkabir (Journal of Science and Technology), 15 (58 D), pp. 435-451.
29644442807&partnerID=40&md5=76beb4d2edf46fdfce4296e5c5b565c5
AFFILIATIONS: Department of I Engineering, Faculty of Engineering, University of

Tehran, Iran
ABSTRACT: Although cellular manufacturing system provides great benefits, the
design of cellular manufacturing systems is complex for real-life problems. Hence,
existing design methods employ simplifying assumptions that often deteriorate the
validity of the models for obtaining solutions. One of these assumptions is that
product mix and demand do not change over the planning horizon. This paper develops
a mathematical model and a solution approach for designing cellular manufacturing
systems. This model addresses these shortcomings by assuming dynamic and stochastic
production requirements and employing routing flexibility. A simulated annealing
based heuristic is proposed to obtain good solutions within reasonable amount of
computational time. For evaluating the proposed solution approach, eight design
problems are generated at random and solved by using the heuristic and Lingo 8.0
Software as a lower bound. The compared computational results of two approaches
(heuristic and lower bound) show that the heuristic perform well under various
circumstances, but routing flexibility has a major impact on the performance of the
heuristic.
AUTHOR KEYWORDS: Cellular manufacturing; Dynamic and stochastic production needs;
Simulated annealing
CORRESPONDENCE ADDRESS: Department of I Engineering, Faculty of Engineering,
University of TehranIran
ISSN: 10150951
CODEN: AMIRE
LANGUAGE OF ORIGINAL DOCUMENT: Persian
ABBREVIATED SOURCE TITLE: Amirkabir
SOURCE: Scopus
Cao, D., Chen, M.

7202124848;55584802346;
Using penalty function and Tabu search to solve cell formation problems with fixed
cell cost
0548%2802%2900144-2&partnerID=40&md5=30e81135d394a844f1ac393a5a036dbf
DOI: 10.1016/S0305-0548(02)00144-2
AFFILIATIONS: Dept. of Mechanical and Indust. Eng., Concordia University, 1455 de
Maisonneuve Blvd., West Montreal, Que. H3G 1M8, Canada
ABSTRACT: In this paper, an integrated approach for manufacturing cell formation
with fixed charge cost is presented. The solution of the problem includes not only
cell formation decisions but also cell set-up decisions. A mixed integer non-linear
programming model is formulated to solve the problem. The NP-hardness of the
problem makes direct solution computationally prohibitive for real-life
applications. A heursitic algorithm was developed to solve the problem efficiently
based on the features of the model and model duality analysis. Tabu search was used
to find the optimal or sub-optimal solutions of the problem. Numerical examples are
presented. Scope and purpose Today's manufacturing industry is facing strong
competition in providing high quality and low cost products to ever demanding
consumers. Cellular manufacturing is one of the widely used approaches to improve
manufacturing productivity to achieve this purpose. In cellular manufacturing,
machine tools are grouped into different manufacturing cells for improved
efficiency and flexibility. This research proposes a mathematical programming model
to form the cells so that material handling cost, machine tool cost and eventually
the overall production cost can be minimized. We also developed an efficient
solution method to solve the complicated mathematical model. © 2003 Elsevier Ltd.
AUTHOR KEYWORDS: Cell formation; Fixed charge cost; Integer programming; Tabu
search
INDEX KEYWORDS: Industrial economics; Nonlinear programming; Problem solving, Cell
formation, Operations research, manufacturing
REFERENCES: Singh, N., (1996) Systems Approach to Computer-Integrated Design and
Manufacturing, , New York, NY: Wiley;
survey of the current practices (1989) International Journal of Production
Research, 27, pp. 1287-1304;
Reisman, A., Kumar, A., Cheng, C.H., Cellular manufacturing: A statistical review
of the literature (1965-1995) (1997) Operations Research, 45, pp. 508-535;
pp. 285-314;
Schaller, J.E., Erengue, S.S., Vakharia, A.J., A mathematical approach for
integrating the cell design and production planning decision (2000) International
Song, S.J., Choi, J.H., Integrated autonomous cellular manufacturing - A new
concept for the 21st century (2001) International Journal of Manufacturing
Technology and Management, 3, pp. 293-307;
Lockwood, W.T., Mahmoodi, F., Mosier, C.T., Scheduling unbalanced cellular
manufacturing systems with lot splitting (2000) International Journal of Production
Research, 38, pp. 951-966;
Olorunniwo, F.O., Changes in production planning and control systems with
implementation of cellular manufacturing (1996) Production and Inventory
Bender's decomposition approach (1998) European Journal of Operational Research,
107, pp. 175-192;
Shang, J.S., Tadikamalla, P.R., Multicriteria design and control of a cellular
Shinn, A., Williams, T., A stitch in time: A simulation of cellular manufacturing
(1998) Production and Inventory Management Journal, 39, pp. 72-77;
Jamal, A.M.M., Neural network and cellular manufacturing (1993) Industrial
Management and Data Systems, 93, pp. 21-25;
85;
pp. 509-516;
manufacturing systems using non-traditional optimisation techniques-a comparative
study (2001) International Journal of Advanced Manufacturing Technology, 18, pp.
140-147;
Nemhauser, G.L., Wolsey, L.A., (1988) Integer and Combinatorial Optimization, , New
York, NY: Wiley;
Cao, D., Leung, L.C., A partial cooperation model for non-unique linear two-level
decision problems (2002) European Journal of Operational Research, 140, pp. 135-
142;
Glover, F., Laguna, M., (1997) Tabu Search, , Dordrecht, The Netherlands: Kluwer
Academic Publishers;
Hiller, F.S., Lieberman, G.J., (1995) Introduction to Mathematical Programming, ,
New York, NY: McGraw-Hill;
Glover, F., Tabu search (1989) ORSA Journal on Computing, 1 (PART 1), pp. 190-206;
Glover, F., Tabu search (1990) ORSA Journal on Computing, 2 (PART 2), pp. 4-32;
Glover, F., Tabu search: A tutorial (1990) Interfaces, 20, pp. 74-94;
Pirlot, M., General local search methods (1996) European Journal of Operational
Research, 92, pp. 493-511;
Schrage, L., (1991) LINDO: an Optimization Modeling System, , Danvers, MA: Boyd and
Fraser;
Cao, B., Uebe, G., Solving transportation problems with nonlinear side constraints
with Tabu search (1995) Computers and Operations Research, 22, pp. 593-603;
Salhi, S., Defining Tabu list size and aspiration criterion with Tabu search
methods (2002) Computers and Operations Research, 29, pp. 67-86
CORRESPONDENCE ADDRESS: Chen, M.; Dept. of Mechanical and Indus. Eng., Concordia
University, 1455 de Maisonneuve Blvd., West Montreal, Que. H3G 1M8, Canada; email:
[email protected]
ISSN: 03050548
CODEN: CMORA
SOURCE: Scopus
Baykasoglu, A., Gindy, N.N.Z., Cobb, R.C.

7004171955;57195720098;7007029719;
Capability based formulation and solution of multiple objective cell formation
problems using simulated annealing
(2001) Integrated Manufacturing Systems, 12 (4), pp. 258-274. Cited 25 times.
0034774235&doi=10.1108%2f09576060110392560&partnerID=40&md5=e0daee2ae47e67498cec860
55e64d016
DOI: 10.1108/09576060110392560
AFFILIATIONS: Department of Manufacturing Engineering and Operations Management,
University of Nottingham, Nottingham, United Kingdom;
Department of Industrial Engineering, University of Gaziantep, Gaziantep, Turkey
ABSTRACT: An integer multiple objective non-linear mathematical programming
formulation is developed for simultaneously forming part/machine cells. In the
proposed model, generic capability units which are termed as resource elements are
used to define the processing requirements of parts and processing capabilities of
machine tools. Machine capabilities are not generally taken into account in the
previous cell formation procedures. Explicit consideration of unique and
overlapping machine capabilities can result in better manufacturing cell designs
with higher utilisation levels and less machine duplication. The proposed cell
formation model has distinguishing features. Several important cell formation
objectives, such as minimisation of part dissimilarity (based on production
requirements and processing sequences of parts) in formed cells, minimisation of
cell load imbalance, and minimisation of extra capacity requirements for cell
formation, are considered. In order to solve the mathematical programming model, a
simulated annealing algorithm is developed. Cooperative game theoretic approach is
applied for evaluating multiple objectives.
AUTHOR KEYWORDS: Cellular manufacturing; Non-linear programming; Optimization;
Resources; Simulation
INDEX KEYWORDS: Computer simulation; Group technology; Nonlinear programming;
Optimization; Simulated annealing, Resource formulation, Cellular manufacturing
alternate routings (1996) Int. J. Prod. Res., 34 (5), pp. 1361-1380;
method (1990) Int. J, Prod. Res., 28 (2), pp. 325-336;
Ballakur, A., Steudel, H.J., A within-cell utilisation heuristic for designing
cellular manufacturing systems (1987) Int. J. Prod. Res., 25 (5), pp. 639-665;
cell design (1989) Int. J. Prod. Res., 27 (10), pp. 1637-1651;
Bennage, W.A., Dhingra, A.K., Single and multi-objective structural optimization in
discrete-continuous variables using simulated annealing (1995) Int. J. for
Numerical Methods in Engineering, 38, pp. 2753-2773;
(1991) Int. J. Prod. Res., 29 (2), pp. 343-356;
Burbidge, J.L., Group technology in Yugoslavia (1987) Prod. Engineer, pp. 11-19.,
December;
Chan, F.T.S., Abhary, K., Design and evaluation of automated cellular manufacturing
systems with simulation modelling and AHP approach: A case study (1996) Integrated
Chang, T.C., Wysk, R.A., Wang, H.P., (1991) Computer-Aided Manufacturing, ,
Prentice-Hall, Englewood Cliff, NJ;
cells in group technology (1994) European J. of Operational Research, 75, pp. 100-
111;
Cheng, C., Goh, C., Lee, A., A two-stage procedure for designing a group technology
system (1995) Int. J. Opr. & Prod. Management, 15 (6), pp. 41-50;
Cheng, C.H., Madan, M.S., Motwani, J., Knapsack-based algorithms for designing
cellular manufacturing systems (1996) J. of the Oper. Res. Soc., 47, pp. 1468-1476;
Co, H.C., Araar, A., Configuring cellular manufacturing systems (1988) Int. J.
Prod. Res., 26 (9), pp. 1511-1522;
Gindy, N.N.Z., Huang, X., Ratchev, T.M., Feature-based component model for
computer-aided process planning systems (1993) Int. J. Computer Integrated
Manufacturing, 6 (1-2), pp. 20-26;
Gindy, N.N.Z., Ratchev, T.M., Case, K., Component grouping for GT applications - A
fuzzy clustering approach with validity measure (1995) Int. J. Prod. Res., 33 (9),
pp. 2493-2509;
Gindy, N.N.Z., Ratchev, T.M., Case, K., Component grouping for cell formation using
resource elements (1996) Int. J. Prod. Res., 34 (3), pp. 727-752;
manufacturing systems - A sequential modelling approach (1989) Comput. Ind. Engng,
16 (4), pp. 469-476;
Hadley, S.W., Finding part machine families using graph partitioning techniques
(1996) Int. J. Prod. Res., 34 (7), pp. 1821-1839;
Han, C., Ham, I., Multi-objective cluster analysis for part family formations
Hsu, C., Su, C., Multi-objective machine-component grouping in cellular
manufacturing: A genetic algorithm (1998) Prod. Planning & Control, 9 (2), pp. 155-
166;
Jayakrishnan, G., Narendran, T.T., ACCORD: A bicriterion algorithm for cell
formation using ordinal and ratio-level data (1999) Int. J. Prod. Res., 37 (3), pp.
539-556;
Kamrani, A.K., Hubbard, K., Parsaei, H.R., Leep, H.R., Simulation based methodology
for machine cell design (1998) Comput. Ind. Engng, 34 (1), pp. 173-188;
neural network approach (1992) Int. J. Prod. Res., 30, pp. 1353-1367;
Kirkpatrick, S., Gelatt C.D., Jr., Vecchi, M.P., Optimisation by simulated
Kusiak, A., The generalised group technology concept (1987) Int. J. Prod. Res., 25
(4), pp. 561-569;
Kusiak, A., (1990) Intelligent Manufacturing Systems, , Prentice-Hall, Englewood
Cliff, NJ;
Kusiak, A., Chow, W.S., Decomposition of manufacturing systems (1988) IEEE J. of
Robotics and Automation, 4 (5), pp. 457-471;
Lin, F.T., Kao, C.Y., Hsu, C.C., Applying the genetic approach to simulated
annealing in solving some NP-hard problems (1993) IEEE Trans. on Systems, Man and
Cybernetics, 23 (6), pp. 1752-1767;
Logar, B., Peklenik, J., Feature-based part database design and automatic forming
of part families (1991) Annals of the CIRP, 40 (1), pp. 153-156;
Moon, C.M., Kim, J., Gen, M., A genetic algorithm based approach for design of
independent manufacturing cells (1997) The 14th International Conf. on Prod. Res.,
pp. 1730-1733., Osaka, Japan, 4-8 August;
network approach (1990) Int. J. Adv. Manuf. Tech., 5, pp. 278-291;
Moon, Y.B., Chi, S.C., Generalised part family formation using neural networks
(1994) J. of Manuf. Sys., 11 (3), pp. 149-159;
Offodile, O.F., Assignment model formulation of the machine cell formation problem
in cellular manufacturing (1992) Int. J. Opr. & Prod. Management, 13 (10), pp. 49-
59;
Purcheck, G., Machine-component group formation: A heuristic method for flexible
production cells and flexible manufacturing systems (1985) Int. J. Prod. Res., 23
(5), pp. 911-943;
Rao, S.S., (1934) Optimization: Theory and Applications, , Wiley, New York, NY;
Sankaran, S., Multiple objective decision-making approach to cell formation: A goal
programming model (1990) Math. Comput. Modelling, 13 (9), pp. 71-82;
techniques (1990) Int. J. Prod. Res., 28 (4), pp. 661-673;
formulation of machine cells in group technology (1997) Int. J. Prod. Res., 35 (2),
pp. 501-511;
Song, S., Hitomi, K., GT cell formation for minimizing intercell parts flow (1992)
Int. J. Prod. Res., 30 (12), pp. 2737-2753;
families problem in group technology (1990) Int. J. Prod. Res., 28 (1), pp. 145-
152;
grouping in manufacturing cell formation (1987) Comput. Ind. Engng, 12 (3), pp.
215-222;
Steuer, R.E., (1986) Multicriteria Optimization: Theory, Computation, and
Applications, , Wiley, New York, NY;
Sule, D.R., Machine capacity planning in group technology (1991) Int. J. Prod.
Res., 29 (9), pp. 1909-1922;
Sun, D., Lin, L., Batta, R., Cell formation using Tabu search (1995) Comput. Ind.
Engng, 28 (3), pp. 485-494;
formation (1990) J. of Manuf. Sys., 9 (1), pp. 55-68;
Venugobal, V., Narendran, T.T., A genetic algorithm approach to the machine-
component grouping problem with multiple objectives (1992) Comput. Ind. Engng, 22
(4), pp. 469-480;
users (1989) Int. J. Prod. Res., 27 (9), pp. 1511-1530;
Implementation experiences and performance improvements (1997) Int. J. Prod. Res.,
35 (1), pp. 29-49;
Wu, H.L., Venugobal, R., Barash, M.M., Design of a cellular manufacturing system: A
syntactic pattern recognition approach (1986) J. of Manuf. Sys., 5 (2), pp. 81-87;
mathematics (1989) Int. J. Prod. Res., 27 (9), pp. 1637-1651
CORRESPONDENCE ADDRESS: Baykasoglu, A.; Dept. of Mfg. Eng. and Oper. Mgmt.,
University of Nottingham, Nottingham, United Kingdom
ISSN: 09576061
CODEN: IMSYE
ABBREVIATED SOURCE TITLE: Integr Manuf Syst
SOURCE: Scopus
Dimopoulos, C., Mort, N.

56235396300;7004884370;
A hierarchical clustering methodology based on genetic programming for the solution
of simple cell-formation problems
times.
0035835262&doi=10.1080%2f00207540150208835&partnerID=40&md5=78a9d72f5d33b6d959c7065
c45102d6c
DOI: 10.1080/00207540150208835
AFFILIATIONS: Dept. of Automat. Control Syst. Eng., University of Sheffield, Mappin
Street, Sheffield S1 3JD, United Kingdom
ABSTRACT: The problem of identifying machine cells and corresponding part families
in cellular manufacturing has been extensively researched over the last thirty
years. However, the complexity of the problem and the considerable number of issues
involved in its solution create the need for increasingly efficient algorithms. In
this paper the use of genetic programming for the solution of a simple version of
the problem is investigated. The methodology is tested on a number of problems
taken from the literature and comparative results are presented.
INDEX KEYWORDS: Genetic algorithms; Machinery; Matrix algebra; Optimization;
Productivity; Random processes; Scheduling, Genetic programming; Hierarchical
clustering methodology, Cellular manufacturing
REFERENCES: Balakrishnan, J., Manufacturing cell formation using similarity
coefficients and pair-wise interchange: Formulation and comparison (1996)
Production Planning & Control, 7, pp. 11-21;
Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D., (1998) Genetic Programming:
An Introduction, , (San Francisco, CA: Morgan Kaufman);
2097-2116;
Burbidge, J.L., (1963) Production Flow Analysis. Production Engineer, 42, pp. 742-
752;
Burbidge, J.L., (1971) Production Flow Analysis. Production Engineer, 50, pp. 139-
152;
Burbidge, J.L., (1975) The Introduction of Group Technology, , (New York: Wiley);
Research, 24, pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., An ideal-seed non-hierarchical clustering
Research, 24, pp. 451-464;
formation of part families and machine-cells (1987) International Journal of
Research, 36, pp. 1325-1337;
Cheng, C.-H., Madan, M.S., Motwani, J., Designing cellular manufacturing systems by
pp. 349-361;
Chu, C.-H., Hayya, J.C., A fuzzy-clustering approach to manufacturing cell
formation (1991) International Journal of Production Research, 29, pp. 1475-1487;
De Witte, J., The use of similarity coefficient in production flow analysis (1980)
Dimopoulos, C., Mort, N., A genetic programming methodology for the solution of the
cell formation problem (1999), Research Report no.759, Department of Automatic
Control and Systems Engineering, University of Sheffield; Dimopoulos, C., Zalzala,
A.M.S., Recent developments in evolutionary computation for manufacturing
optimization: Problems, solutions and comparisons (1999) IEEE Transactions in
Evolutionary Computation, 4, pp. 93-113;
Dimopoulos, C., Zalzala, A.M.S., A genetic programming heuristic for the one-
machine total tardiness problem (1999) Proceedings of the Congress on Evolutionary
Computation (CEC '99), 3, pp. 2207-2214., (Washington DC: IEEE Press);
Dimopoulos, C., Zalzala, A.M.S., Evolving scheduling policies through a genetic
programming framework (1999) Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO'99), 2, p. 1231., Banzhaf, W., Daida, J., Eiben, A.
E., Gurzan, M. H., Honavar, V., Jakida, M., Smith, R. E. (eds); (San Francisco, CA:
Morgan Kaufman);
Hyer, N.L., Wemmerlov, U., Group technology oriented coding systems: Structures,
application and implementation (1985) Production and Inventory Management, 26, pp.
125-147;
Jaccard, P., Nouvelles recherches sur la distribution florale (1908) Bulletin de la
Ṡocieté Vaudense des Sciences Naturelles, 44, pp. 223-270;
85;
Kandiller, L., A cell formation algorithm: Hypergraph approximation-cut tree (1998)
117-133;
Research, 18, pp. 213-232;
Koza, J.R., (1992) Genetic Programming: On the Programming of Computers by Means of
Natural Selection, , (Cambridge, MA: MIT Press);
1728;
Kumar, K.R., Kusiak, A., Vanneli, A., Grouping of parts and components in flexible
397;
Kusiak, A., Branching algorithms for solving the group technology problem (1991)
51, pp. 53-57;
reorganisation by clustering techniques (1972) Operations Research, 20, pp. 993-
1009;
McKay, B.M., Willis, M.J., Hiden, H.G., Montague, G.A., Barton, G.W.,
Identification of industrial processes using genetic programming (1996) Proceedings
of the Conference on Identification in Engineering Systems, pp. 510-519., Friswell,
M. I. and Mottershead, J. E. (eds), University of Wales, Swansea;
Lending Library Translation, Boston Spa, Yorkshire;
Polheim, H., Marenback, P., Generation of structured process models using genetic
programming (1996) Lecture Notes in Computer Science (1143): Evolutionary
Computing, pp. 102-109., AISB Workshop. Selected Papers, Fogarty, T. C. (ed.)
(Berlin: Springer-Verlag);
567-579;
Rath, S.K., Das, S., Sahu, S., Graph colouring approach for cell-formation problems
(1995) Production Planning and Control, 6, pp. 421-428;
pp. 385-314;
Seifoddini, H., Single linkage vs. average linkage clustering in machine cells
formation application (1989) Computers and Industrial Engineering, 16, pp. 419-426;

group technology (1986) AIIE Transactions, 18, pp. 271-277;
handling cost in machine-component grouping (1987) AIIE Transactions, 19, pp. 266-
270;
Sneath, P.H.A., The application of computers to taxonomy (1957) Journal of General
Microbiology, 17, pp. 201-206;
463-478;
Research, 32, pp. 2149-2158;
Srinivasan, G., Cell formation using zero-one matrices-experiences with real-life
data and inferences (1995) Computers and Industrial Engineering, 29, pp. 303-307;
Vohra, T., Chen, D.-S., Chang, J.C., Chen, H.-C., A network approach to cell
Research, 28, pp. 2075-2084;
1409-1421
CORRESPONDENCE ADDRESS: Mort, N.; Dept. of Automat. Control Syst. Eng., University
of Sheffield, Mappin Street, Sheffield S1 3JD, United Kingdom; email:
[email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Muramatsu, H., Miyahara, K., Irohara, T., Yoshimoto, K.

57194964188;57194960682;6602294372;35583336700;
Integrated Approaches to Solve Cell Formation Problem Dealing with Machine
Duplicating and Part Subcontracting
(2001) Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of
Mechanical Engineers, Part C, 67 (655), pp. 873-879.
85024468667&doi=10.1299%2fkikaic.67.873&partnerID=40&md5=21a4144fb264e518d191f2b66c
4c6719
DOI: 10.1299/kikaic.67.873
AFFILIATIONS: Sophia University, Dept. of Mechanical Engineering, 7–1 Kioicho,
Chiyoda-ku, Tokyo, 102-8554, Japan
ABSTRACT: In this paper, we address the problem of cellular manufacturing system,
which, in essence, consists of three main problems, cell formation and machine
duplication and part subcontract. While a number of research have been conducted on
the problem, most of them considered machine duplication and part subcontract
separately. One paper considering cell formation, machine duplication and part
subcontract is published, but the paper proposes two step method, so has a problem
for possibility of local search. On the contrary this paper propose an integrated
approach using Genetic Algorithm (GA) to solve the problems simultaneously on one
step method. Our numerical experiments and results show that our method performs
better compared to a conventional method which using two step method. © 2001, The
Japan Society of Mechanical Engineers. All rights reserved.
AUTHOR KEYWORDS: Cell Formation; Genetic Algorithm; Machine Duplication; Part
Subcontract
REFERENCES: Logendran, R., Ramakrishna, P., A methodology for simultaneously
dealing with machine duplication and part subcontracting in cellular manufacturing
systems (1997) Computers Ops Res, 24 (2), pp. 97-116;
Seifoddini, H., Wolfe, P.M., Aplication of the similarity coefficient method in
implementation experiences and performance Improvement (1997) INT. J. PROD. RES, 35
(1), pp. 29-49;
Ravi Kumar, K., Kusiak, A., Vannelli, A., Grouping of part and components in
flexible manufacturing systems (1986) European. J. OPR. RES, 24, pp. 387-397;
algorithms for cell formation (1997) IE Trans, 29, pp. 53-67;
Boctor, F.F., The minimum-cost, machine-part cell formation problem (1996) Int. J.
Prod. Res, 34 (4), pp. 1045-1063
CORRESPONDENCE ADDRESS: Muramatsu, H.; Sophia University, Dept. of Mechanical
Engineering, 7–1 Kioicho, Chiyoda-ku, Tokyo, 102-8554, Japan
ISSN: 03875024
ABBREVIATED SOURCE TITLE: Nihon Kikai Gakkai Ronbunshu C
SOURCE: Scopus
Yasuda, K., Yin, Y.

13405856800;8237087600;
Dissimilarity measure for solving the cell formation problem in cellular
manufacturing
(2001) Computers and Industrial Engineering, 39 (1-2), pp. 1-17. Cited 52 times.
8352%2800%2900060-7&partnerID=40&md5=1181bf96d9c0fe08fe6f069c1b1cd6a7
DOI: 10.1016/S0360-8352(00)00060-7
AFFILIATIONS: Grad. Sch. of Econ. and Management, Tohoku Univ., Kawauchi, A.,
Sendai, Japan
ABSTRACT: Cell formation (CF) is a vital aspect of the design of cellular
manufacturing systems. Many similarity coefficient method (SCM)-based approaches
have been proposed to solve the CF problem in the literature. However, some of
these approaches have deficiencies and do not always produce proper machine groups
and part families from the initial machine-part incidence matrix. This paper
considers a new systematic approach that is based upon the calculation of an
average voids value (AVV), which indicates the average number of newly produced
voids when a pair of machine groups are combined. This approach is very simple,
intuitively appealing, and overcomes many disadvantages inherent in some
traditional SCM-based approaches. The AVV approach is tested against five well-
known approaches in solving CF problems and the test results show that the approach
is reliable and efficient.
INDEX KEYWORDS: Computational methods; Group technology; Problem solving; Process
engineering; Production engineering, Average voids value (AVV); Similarity
coefficient methods, Cellular manufacturing
REFERENCES: Boe, W.J., Cheng, C.H., A close neighbour algorithm for designing
29, pp. 2097-2116;
152;
Research, 24, pp. 451-464;
pp. 95-100;
Chu, C.H., Pan, P., The use of clustering techniques in manufacturing cellular
formation (1998) Proceedings: International Industrial Engineering Conference, pp.
495-500., Orlando, Florida;
De Beer, C., De Witte, J., Production flow synthesis (1978) Annals of the CIRP, 27,
pp. 389-392;
El-Essawy, I.G.K., Torrance, J., Component flow analysis - an effective approach to
production systems' design (1972) Production Engineer, 51, pp. 165-170;
Ham, I., Hitomi, K., Yoshida, T., (1985) Group Technology: Applications to
Production Management, , Boston, USA: Kluwer-Nijhoff Publishing;
Hon, K.K.B., Chi, H., A new approach of group technology in part family
optimization (1994) Annals of the CIRP, 43, pp. 425-428;
Irani, S.A., Khator, S.K., A microcomputer based design of a cellular manufacturing
system 8th Annual Conference on Computers and Industrial Engineering, pp. 68-72;
King, J.R., Machine-component group formation in group technology (1980) OMEGA, 8,
pp. 193-199;
Research, 18, pp. 213-232;
117-133;
1728;
51, pp. 53-57;
1009;
Miltenburg, J., Zhang, W.J., A comparative evaluation of nine well-known algorithms
Purcheck, G.F.K., Combinatorial grouping: A lattice-theoretic method for the design
of manufacturing systems (1974) Journal of Cybernetics, 4, pp. 27-60;
Purcheck, G.F.K., A mathematical classification as a basis for the design of group-
technology production cells (1975) Production Engineer, 54, pp. 35-48;
567-579;
pp. 508-520;
(1989) IIE Transactions, 21, pp. 382-388;
426;
improper machine assignment in group technology problem (1989) International
270;
and Control, , London: Chapman & Hall;
Vakharia, A.J., Selim, H.M., Group technology (1994) The Handbook of Design,
Manufacturing and Automation, pp. 435-460., In R. C. Dorf & A. Kusiak, New York:
Wiley;
24, pp. 387-400;
2062;
Yasuda, K., BASIC program for cell formation using ROC algorithm (1990) Journal of
Faculty of Commerce, Chukyo University, Japan, 37, pp. 17-62
CORRESPONDENCE ADDRESS: Yasuda, K.; Tohoku Univ, Sendai, Japan
PUBLISHER: Elsevier Science Ltd, Exeter
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Chen, J.-S., Heragu, S.S.

7501891741;35560524700;
Stepwise decomposition approaches for large scale cell formation problems
times.
2217%2897%2900419-0&partnerID=40&md5=0d1451151be7236cddc601404d9b09dc
DOI: 10.1016/S0377-2217(97)00419-0
AFFILIATIONS: Dept. of Business Administration, Yuan-Ze University, Chung-Li, 320,
Taiwan;
Dept. of Decis. Sci. and Eng. Syst., Rensselaer Polytechnic Institute, Troy, NY
12180-3590, United States
ABSTRACT: Cell formation is one of the major steps in cellular manufacturing system
(CMS) design. In this paper, two stepwise decomposition approaches are proposed to
solve large scale industrial problems. Both of them analyze the part-machine
relations, decompose the original system to several large subsystems and then use
an optimal solution technique to solve each. Several results are proved to show the
conditions under which optimal solutions are obtained.
AUTHOR KEYWORDS: Benders decomposition; Cellular manufacturing; Group technology;
Optimization
INDEX KEYWORDS: Group technology; Large scale systems; Optimization; Problem
solving, Benders decomposition; Part-machine relations, Cellular manufacturing
REFERENCES: Arabie, P., Hubert, L.J., The bond energy algorithm revisited (1990)
IEEE Transactions on Systems Man and Cybernetics, 20, pp. 268-274;
Bazargan-Laari, M., (1995) Private Communication, , University of New South Wales,
Australia;
Benders, J.F., Partitioning procedures for solving mixed-variables programming
problems (1962) Numerische Mathematik, 4, pp. 238-252;
Chen, J., (1995) Cellular Manufacturing System Design: Optimal Solution of Large
Scale Real World Problems, , Unpublished Ph.D. thesis, Department of Decision
Sciences and Engineering Systems, Rensselaer Polytechnic Institute, Troy, New York;
Chu, C.H., Cluster analysis in manufacturing cellular formation (1989) OMEGA, 17,
pp. 289-295;
formation (1988) Proceedings: International Industrial Engineering Conference, pp.
495-500., Orlando, FL;
Hansen, P., Delattre, M., Complete-link cluster analysis by graph coloring (1978)
Journal of the American Statistical Association, 73, pp. 397-403;
Heragu, S.S., (1997) Facilities Design, , PWS Publishing Company, Boston, MA;
Heragu, S.S., Group Technology and Cellular Manufacturing (1994) IEEE Transactions
on Systems Man and Cybernetics, 24 (2), pp. 203-215;
Heragu, S.S., Chen, J., Optimal solution of cellular manufacturing system design:
Benders' decomposition approach (1997) To Appear in European Journal of Operational
Research;
Heragu, S.S., Kakuturi, S.R., Grouping and placement of machine cells (1997) IIE
Iri, M., On the Synthesis of Loop and Cutset Matrices and Related Problems (1968)
RAAG Memoirs, 4 (A-XII), pp. 376-410., In: Kondo, K. (Ed.) Research Association of
Applied Geometry, Japan;
Research, 18, pp. 213-219;
Kusiak, A., Vannelli, A., Kumar, K.R., (1986) Clustering Analysis, Contr.
Cybernetics, 15 (2), pp. 139-154;
Lashkari, R.S., Dutta, S.P., Nadoli, G., Part Family Formation in Flexible
Manufacturing Systems - An Integer Programming Approach (1987) Modern Production
Management Systems, pp. 627-635., In: Kusiak, A. (Ed.) North Holland, Amsterdam;
Lenstra, J.K., Clustering a data array and the traveling salesman problem (1974)
Engineer, 51 (2), pp. 53-57;
McCormick W.T., Jr., Schweitzer, P.J., White, T.J., Problem Decomposition and Data
Reorganizaton by a Clustering Technique (1972) Operations Research, 20, pp. 993-
1009;
Mulvey, J.M., Crowder, H.P., Clustering analysis: An application of lagrangean
for solving the cell formulation in group technology (1991) Journal of Operations
Snead, C.S., (1989) Group Technology: Foundation for Competitive Manufacturing, ,
Van Nostrand Reinhold, New York, NY;
Song, S., Hitomi, K., GT cell formation for minimizing the inter-cell parts flow
CORRESPONDENCE ADDRESS: Heragu, S.S.; Dept. of Business Administration, Yuan-Ze
University, Chung-Li, 320, Taiwan
PUBLISHER: Elsevier
ISSN: 03772217
CODEN: EJORD
SOURCE: Scopus
Abdelmola, A.I., Taboun, S.M.

6508033227;55950869700;
Productivity model for the cell formation problem: a simulated annealing algorithm
8352%2899%2900085-6&partnerID=40&md5=383874a2e21e60a15268bd6b5832e07a
DOI: 10.1016/S0360-8352(99)00085-6
AFFILIATIONS: Indust. and Mfg. Systems Eng., University of Windsor, Windsor, Ont.
N9B 3P4, Canada
ABSTRACT: A mathematical programming model is developed to identify machine groups
and part families simultaneously using total productivity and an efficient
simulated annealing algorithm is developed to solve large-scale problems. The test
problem results showed the superiority of the algorithm over the mathematical
programming model.
INDEX KEYWORDS: Algorithms; Machinery; Mathematical models; Mathematical
programming; Productivity; Simulated annealing, Mathematical programming model;
Productivity model, Cellular manufacturing
REFERENCES: Abduelmola, A.I., Taboun, S.M., Koa, D., Manufacturing cells formation
with productivity consideration (1997) Proceedings of the 2nd Annual International
Conference on Industrial Engineering Applications and Practice, pp. 779-784., San
Diego, California, U. S. A;
Abduelmola, A.I., Taboun, S.M., Merchawi, S., Productivity optimization of cellular
manufacturing system (1997) Proceedings of the 22nd ICC &, the American
University in Cairo, pp. 124-127., December 1997;
Chu, C.H., Cluster analysis in manufacturing cellular formation (1989)
on Systems, Man, and Cybernetics, 24, pp. 203-215;
Jayakrishran, N.G., Narendran, T.T., Case: A clustering algorithm for cell
36, pp. 157-179;
Joines, A.J., Culbreth, T.C., King, E.R., Manufacturing cell design: An integer
85;
117-133;
Kusiak, A., Group technology: Models and solution approaches (1992) First
Industrial Engineering Research Conference Proceedings, pp. 349-352;
Mosier, C.T., The facets of group technology and their impacts on implementation: A
state-of-the-survey (1985) International Journal of Management Science, 13, pp.
381-391
CORRESPONDENCE ADDRESS: Abdelmola, A.I.; Univ of Windsor, Windsor, Ont, Canada
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Gravel, M., Nsakanda, A.L., Price, W.

7003490395;6506046784;7201638614;
Efficient solutions to the cell-formation problem with multiple routings via a
double-loop genetic algorithm
times.
2217%2898%2900057-5&partnerID=40&md5=2c20309e6d3a73fea5204546ac31ea1f
DOI: 10.1016/S0377-2217(98)00057-5
AFFILIATIONS: Dept. d'Info. et Mathématique, Université du Québec, Chicoutimi, Que.
G7H 2B1, Canada
ABSTRACT: We present a genetic approach for finding efficient solutions to the
problem of forming manufacturing cells for products having multiple routings. We
consider the case where there are two criteria. The method that we propose seeks to
generate the efficient set of solutions, that is the set of non-dominated
solutions. The manager may then choose a solution knowing the consequences for each
of the objectives. We address the computational difficulty of this problem and
present a numerical example. © 1998 Elsevier Science B.V. All rights reserved.
AUTHOR KEYWORDS: Cell-formation; Genetic algorithms; Manufacturing; Multi
criteria analysis; Production
INDEX KEYWORDS: Computational complexity; Decision theory; Genetic algorithms;
Problem solving; Process control; Production control; Supervisory personnel, Cell
formation methods; Multicriteria analysis, Flexible manufacturing systems
alternative routeings (1996) Internat. J. Production Research, 34 (5), pp. 1361-
1380;
(1995) Math. Comput. Modelling, 21 (12), pp. 61-73;
Billo, R., Tate, D., Bidanda, B., Comparison of a genetic algorithm and cluster
analysis for the cell formation problem: A case study (1995) Proceedings of the
Third Industrial Engineering Research Conference, pp. 543-548., Norcross GA:
Institute for Industrial Engineers;
139-152;
Internat. J. Production Research, 27 (6), pp. 1035-1052;
Co, H.C., Araar, A., Configuring cellular manufacturing systems (1988) Internat. J.
Damodaran, V., Lashkari, R.S., Singh, N., A production planning model for cellular
manufacturing systems with refixturing considerations (1992) Internat. J.
Gafarasi, H., Martel, J.-M., Price, W.L., (1996) Memoire de Maîtrise, , Faculté des
sciences de ladministration, Université Laval, Québec G1K 7P4;
Goldberg, A.E., (1989) Genetic Algorithms in Search, Optimization and Machine
Learning, , Addison-Wesley, Reading, MA;
Green, T.J., Sadowski, R.P., A review of cellular manufacturing assumptions,
advantages and design techniques (1997) J. Operations Management, 4 (2), pp. 85-97;
Grefensette, J.J., Incorporating problem specific knowledge into genetic algorithms

(1987) Genetic Algorithms and Simulated Annealing, pp. 49-67., Pitman, New York;
Gupta, Y.P., Gupta, M.C., Kumar, A., Sundaram, C., Minimizing total intercell and
Internat. J. Computer Integrated Manufacturing, 8 (2), pp. 92-101;
Gupta, Y., Gupta, M., Kumar, A., Sundaran, C., A genetic algorithm-based approach
to cell composition and layout design problems (1996) Internat. J. Production
Research, 34 (2), pp. 447-482;
Holland, J.L., (1975) Adaption in Natural and Artificial Systems, , The University
of Michigan Press, Ann Arbor, Michigan;
Hwang, C.-L., Masud, A.S.M., (1979) Multiple Objective Decision Making-Methods and
Applications, , Springer, Berlin;
Joines, J.A., King, R.E., Culbreth, T.C., An intelligent genetic search for the
cell formation problem (1995) International Industrial Engineering Conference on
Productivity in a World Without Borders, pp. 245-254., Montréal, Québec, Submitted
to Computers and Industrial Engineering;
Joines, J.A., King, R.E., Culbreth, T.C., Manufacturing cell design: An integer
programming approach model employing genetic algorithms (1996) HE Transactions, 18
(1), pp. 68-85;
Kusiak, A., The generalized group technology concept (1987) Internat. J. Production
Research, 25 (4), pp. 561-569;
Lee, D.H., Kim, Y.D., Part-mix allocation in a hybrid manufacturing system with a
flexible manufacturing cell and a conventional job-shop (1996) Internat. J.
Logendran, R., Sriskandarajah, C., Two-machine group scheduling problem (1993)
European J. Oper. Res., 69 (3), pp. 467-481;
Michalewitz, Z., (1994) Genetic Algorithms and Data Structures: Evolution
Program, , Springer, Berlin;
Nagi, R., Harhalakis, G., Proth, J.-M., Multiple routing and capacity
considerations in group technology applications (1990) Internat. J. Production
Research, 28 (12), pp. 2243-2257;
Oba, F., Kato, K., Yasuda, K., Tsumura, T., Review and extension of cell formation
problems in flexible manufacturing system (1987) Proceedings of the Second IFIP
Conference, pp. 61-78., Copenhagen, Denmark;
Rajamani, D., Singh, N., Aneja, Y., Integrated design of cellular manufacturing
systems in the presence of alternatives process plans (1990) Internat. J.
Rajamani, D., Singh, N., Aneja, Y., Selection of parts and machines for
lellularisation: A mathematical programming approach (1992) European J. Oper. Res.,
62, pp. 47-54;
Rajamani, D., Singh, N., Aneja, Y., Design of cellular manufacturing systems (1996)
Internat. J. Production Research, 34 (7), pp. 1917-1928;
Reeves, C.R., (1993) Modern Heuristic Techniques for Combinatorial Problems, ,
Blackwell Scientific Publications, London;
Schaffer, J.D., (1984) Some Experiments in Machine Learning Using Vector Evaluated
Genetic Algorithms, , Ph.D. Dissertation, Vanderbilt University, Nashville Tenn,
USA;
problem (1989) Internat. J. Production Research, 27 (5), pp. 775-782;
Engineering, 22 (4), pp. 469-480;
users (1992) Internat. J. Production Research, 27 (9), pp. 1511-1530;
Implementation experiences and performance improvements (1997) Internat. J.
Xie, X., Manufacturing cell formation problem under capacity constraints (1993)
Appl. Stochastic Models Data Anal., 9, pp. 87-96
PUBLISHER: Elsevier
ISSN: 03772217
CODEN: EJORD
SOURCE: Scopus
Tsai, C., Chu, C., Barta, T.A.

54881360300;8319645300;7004534461;
Modeling and analysis of a manufacturing cell formation problem with fuzzy mixed-
integer programming
Cited 36 times.
0031177183&doi=10.1080%2f07408179708966364&partnerID=40&md5=dff812d4335afa5984d830e
d1737ca35
DOI: 10.1080/07408179708966364
AFFILIATIONS: Department of Industrial Management Science, National Cheng Kung
University, Tainan, Taiwan;
Department of Management, Iowa State University, 300 Carver Hall, Ames, IA, 50011,
United States;
Department of Industrial and Manufacturing Systems Engineering, Iowa State
University, 205 Engineering Annex, Ames, IA, 50011, United States
ABSTRACT: Cell formation (CF) has received much attention from academicians and
practitioners because of its strategic importance to modern manufacturing practice.
In this paper a sophisticated mixed-integer programming (MIP) model is proposed to
simultaneously form manufacturing cells and minimize the cost of dealing with
exceptional elements. Also, we illustrate how a fuzzy mixed-integer programming
(FMIP) approach can be used to solve the CF problem in a fuzzy environment, propose
a new fuzzy operator, and examine the impact of different membership functions and
operators on computational performance. Our study shows that FMIP not only provides
a better and more flexible way of representing the problem domain, it also leads to
improved overall performance. © 1997 Taylor & Francis Group, LLC.
INDEX KEYWORDS: Flexible manufacturing systems; Fuzzy sets; Integer programming;
Mathematical models; Mathematical operators; Membership functions; Problem solving,
Fuzzy mixed integer programming (FMIP); Manufacturing cell formation (CF), Computer
aided manufacturing
REFERENCES: Chanas, S., Kolodziejczyk, W., Machaj, A., A fuzzy approach to the
transportation problem (1984) Fuzzy Sets and Systems, 13, pp. 211-221;
Deporter, E.L., Ellis, K.P., Optimization of project networks with goal programming
and fuzzy linear programming (1990) Computers and Industrial Engineering, 19, pp.
500-504;
Mjelde, K.M., Fuzzy resource allocation (1986) Fuzzy Sets and Systems, 19, pp. 239-
250;
Sommer, G., Pollatschek, M.A., A fuzzy programming approach to an air pollution
regulation problem (1978) European Journal of Operational Research, 10, pp. 303-
313;
Wiedey, G., Zimmermann, H.J., Media selection and fuzzy linear programming (1978)
Journal of Operational Research Society, 31, pp. 342-349;
Darzentas, J., On fuzzy location model (1987) Optimization Models Using Fuzzy Sets
and Possibility Theory, pp. 328-341., Kacprzyk, J. and Orlovski, S. A. (eds), D.
Reidel, Dordrecht, MA;
(1989) Applications of Fuzzy Set Methodologies in Industrial Engineering, , Evans,
G.W., Karwowski, W. and Wilhelm, M.R. (eds), Elsevier, New York;
Karwowski, W., Evans, G.W., Fuzzy concepts in production management research a
review (1986) International Journal of Production Research, 24, pp. 129-147;
Chu, C.H., Cluster analysis in manufacturing cellular formation (1989) OMEGA, 17,
pp. 289-295;
Singh, N., Design of cellular manufacturing" systems an invited review (1993)
King, J.R., Machine-component group formation in group technology (1980) OMEGA, 8
(2), pp. 193-199;
Li, J., Ding, Z., Lei, W., Fuzzy cluster analysis and fuzzy pattern recognition
methods for formation of part families (1986) Proceedings of the Nth North American
Manufacturing Research Conference (NAMRC), pp. 558-563., Society of Manufacturing
Engineering, Dearborn, MI;
67;
Lai, Y.-J., Hwang, C.-L., (1992) Fuzzy Mathematical Programming - Method and
Application, , Springer-Verlag, Berlin;
Zimmermann, H.-J., (1991) Fuzzy Set Theory and Its Applications, , Kluwer Academic
Publishers, Boston, MA;
Buckle, J.J., Solving possibilistic linear programming problems (1989) Fuzzy Sets
Carlsson, C., Korhonen, P., A parametric approach to fuzzy linear programming
(1986) Fuzzy Sets and Systems, 20, pp. 17-30;
Dubois, D., Linear programming with fuzzy data (1987) Analysis of Fuzzy
Information, 3, pp. 241-263., (Applications in Engineering and Science), Bezdek,
J.C. (ed.), CRC Press, Boca Raton, FL;
Inuiguchi, M., Ichihashi, H.I., Tanaka, H., Fuzzy programming a survey of recent
development (1990) Stochastic Versus Fuzzy Approaches to Multiobjective
Mathematical Programming under Uncertainty, pp. 45-70., Slowinski, R. and Teghem,
J. (eds), Kluwer, Dordrecht, MA;
Lai, Y.-J., Hwang, C.-L., A new approach to some possibilistic linear programming
problems (1992) Fuzzy Sets and Systems, 49, pp. 121-133;
Luhandjula, M.K., Multiple objective programming problems with possibilistic
coefficients (1990) Fuzzy Sets and Systems, 34, pp. 15-31;
Negoita, C.V., Sulana, M., On fuzzy mathematical programming and tolerances in
planning (1976) Economic Computer and Economic Cybernetic Studies and Researches,
1, pp. 3-14;
Tanaka, H., Ichihashi, H., Asai, K., A formulation of fuzzy linear programming
problem based on comparison of fuzzy numbers (1984) Control and Cybernetics, 13
(3), pp. 185-194;
Verdegay, J.L., A dual approach to solve the fuzzy linear programming problem
Chanas, S., The use of parametric programming in fuzzy linear programming (1983)
Fuzzy Sets and Systems, 11, pp. 243-251;
Fabian, C., Stoica, M., Fuzzy integer programming (1984) Fuzzy Sets and Decision
Analysis, 20, pp. 123-131., Zimmermann, H.J., Zadah, L.A. and Gaines, B.R. (eds),
TIMS/Studies in the Management Sciences, Elsevier Science, Amsterdam;
Werners, B.M., An interactive fuzzy programming system (1987) Fuzzy Sets and
Systems, 23, pp. 131-147;
Zimmermann, H.-J., Applications of fuzzy set theory to mathematical programming
Lai, Y.-J., Hwang, C.-L., Interactive fuzzy linear programming (1992) Fuzzy Sets
Dombi, J., Membership function as an evaluation (1991) Fuzzy Sets and Systems, 35,
pp. 1-21;
Leberling, H., On finding compromise solutions in multi-criteria problems using the
fuzzy min-operator (1981) Fuzzy Sets and Systems, 6, pp. 105-118;
Li, R.J., Lee, E.S., An exponential membership function for fuzzy multiple
objective linear programming (1991) Computers for Mathematical Applications, 22
(12), pp. 55-60;
Kim, M.H., Lee, J.H., Lee, Y.J., Analysis of fuzzy operators for high quality
information retrieval (1993) Information Processing Letters, 46, pp. 252-256;
Werners, B.M., Aggregation models in mathematical programming (1988) Mathematical
Models for Decision Support, 48, pp. 295-305., Mitra, G. and Greenberg, H.J. (eds),
Springer-Verlag, Berlin;
Yang, T., Ignizio, J.P., Fuzzy programming with nonlinear membership functions
piecewise linear approximation (1991) Fuzzy Sets and Systems, 41, pp. 39-53;
Gongaware, T.A., Ham, I., Cluster analysis applications for group technology
manufacturing systems (1981) Proceedings of the 9th North American Manufacturing
Research Conference (NAMRC), pp. 503-508., Society of Manufacturing Engineering,
Dearborn, MI;
Zadeh, L.A., Fuzzy sets (1965) Information and Control, 8, pp. 338-353;
Luhandjula, M.K., Compensatory operators in fuzzy linear programming with multiple
objectives (1982) Fuzzy Sets and Systems, 8, pp. 245-282;
Zimmermann, H.-J., Fuzzy programming and linear programming with several objective
ISSN: 0740817X
SOURCE: Scopus
Su, C.-T., Hsu, C.-M.

55921378100;7404946920;
A two-phased genetic algorithm for the cell formation problem
Practice, 3 (2), pp. 114-125. Cited 11 times.
0030174527&partnerID=40&md5=f6cf3a247d0e38de4e7211b8961e6786
AFFILIATIONS: Dept. of Indust. Eng. and Management, National Chiao Tung University,
Hsinchu, Taiwan
ABSTRACT: Cellular manufacturing system (CMS) is an important application in group
technology. CMS design involves identifying part families and machine groups.
Genetic algorithm (GA) is a robust adaptive optimization method based on principles
of natural evolution, having the advantages of parallel processing and multi-points
searching. GA search method is well suited for the machine-component grouping (MCG)
problem. In this work, we present a mathematical programming formulation which
considers the intercell part flow and the manufacturing cell density for the MCG
problem. A two-phased algorithm based on GA is also proposed to solve the problem.
The only assumption for the proposed algorithm to be known in advance is the upper
bound of total number of manufacturing cells. The proposed algorithm can provide a
feasible cell grouping under machine capacity constraints. Moreover, performance
trials suggest that the proposed algorithm can provide a robust solution to the MCG
problem in a short execution time.
AUTHOR KEYWORDS: CellularManufacturing System; Genetic Algorithm; Group
Technology; Machine-Cell Formation; Machine-Component Grouping
INDEX KEYWORDS: Genetic algorithms; Industrial management; Machinery; Mathematical
programming; Performance, Cellular manufacturing system; Group technology; Machine
cell formation; Machine component grouping, Manufacture
REFERENCES: Burbidge, J.L., Production flow analysis (1963) Production Engineer,
42, p. 472;
Burbidge, J.L., (1975) The Introduction of Group Technology, , John Wiley and Sons,
New York;
Goldberg, D.E., (1989) Genetic Algorithm in Search. Optimization and Machine
Learning, , Addison-Wesley, New York;
Business Review, 4, pp. 140-149;
Research, 18, pp. 213-232;
Kusiak, A., The generalized Group Technology Concept (1987) International Journal
612;
Liao, T.W., Chen, L.J., An Evaluation of ART1 Neural Models for GT Part Family and
Machine Cell Forming (1993) Journal of Manufacturing Systems, 12, pp. 282-290;
Moon, Y.B., Kao, Y., Automatic Generation of Grouping Technology Families during
the Part Classification Process (1993) International Journal of Advanced
Offodile, O.F., Mehrez, A., Grznar, J., Cellular Manufacturing: A Taxonomic Review
Framework (1994) Journal of Manufacturing Systems, 13, pp. 196-220;
Seifoddini, H., Wolfe, P.M., Application of similar coefficient method in GT (1986)
IIE Transactions, 18, pp. 271-277;
Snead, C.S., (1989) Group Technology: Foundation for Competitive Manufacturing, ,
Van Nostrand Reinhold, New York;
Srinivas, M., Genetic Algorithms: A Survey (1994) Computer (IEEE), 27, pp. 17-26;
Tabucanon, M.T., Ojha, R., ICRMA - A heuristic approach for intercell flow
Whitley, D., Starkweather, T., Bogart, C., Genetic algorithms and neural networks:
Optimizing connections and connectivity (1990) Parallel Computing, 14, pp. 347-361
CORRESPONDENCE ADDRESS: Su, C.-T.; Dept. of Indust. Eng. and Management, National
Chiao Tung University, Hsinchu, Taiwan
ISSN: 10724761
CODEN: IJIEF
SOURCE: Scopus
Hwang, H., Ji-Ung, S.

57013250000;11043384900;
A genetic-algorithm-based heuristic for the GT cell formation problem
8352%2896%2900044-7&partnerID=40&md5=7bcecf8bc68f353a494f1b10be7ee594
DOI: 10.1016/0360-8352(96)00044-7
AFFILIATIONS: Department of Industrial Engineering, Korea Adv. Inst. Sci. and
Technol., 373-1 Kusong-dong Yusong-gu, Taejon 305-701, South Korea
ABSTRACT: This paper presents a heuristic for the machine-part grouping problem
which incorporates relevant production requirements such as routing sequence,
production volume, unit handling size, unit processing time and cell size. The
heuristic consists of two phases. The first phase is developed based on a genetic
algorithm and greedy heuristic to solve the machine grouping problem. Once machine
cells are identified, the second phase is employed to identify the associated part
families. The performance of the heuristic is examined through a comparative study
with some existing solution methods. Global efficiency, group efficiency, intercell
move factor and grouping effectiveness are adopted as comparative measures.
Copyright © 1996 Elsevier Science Ltd.
INDEX KEYWORDS: Computational complexity; Constraint theory; Heuristic methods;
Manufacture; Matrix algebra; Problem solving; Production, Binary incidence matrix;
Bond energy algorithm; Generalized quadratic assignment problem; Intercell flow
reduction heuristic; Normalized linkage clustering algorithm, Genetic algorithms
REFERENCES: Singh, N., Design of cellular manufacturing systems: An invited review
(1993) Europ. J. Opnl. Res., 69, pp. 284-291;
McAuley, J., Machine grouping for efficient production (1972) Prod. Engnr, 51, pp.
53-57;
reorganization by a clustering technique (1972) Opns Res., 20, pp. 992-1009;

cellular manufacturing (1982) J. Manuf. Systems, 1, pp. 62-75;
835-850;
formation for group technology applications (1990) Int. J. Prod. Res., 28, pp. 185-
198;
Okogbaa, O.G., Chen, M.T., Changchit, C., Shell, R.L., Manufacturing system cell
formation and evaluation using a new inter-cell flow reduction heuristic (1992)
Int. J. Prod. Res., 30, pp. 1101-1118;
component grouping problem with multiple objectives (1992) Computers Ind. Engng,
22, pp. 469-480;
Billo, R.E., Bidanda, B., Tate, D., A genetic algorithm formulation of the cell
formation problem (1994) Proc. of 16th Int. Conf. on Computers Ind. Engng, 7-9
MARCH, pp. 341-344;
Garey, M.R., Johnson, D.S., (1979) Computers and Intractability: A Guide to Theory
of NP-Completeness, , Freeman, San Francisco, CA;
system (1990) Int. J. Prod. Res., 28, pp. 1247-1269
Inst. Sci. and Technol., 373-1 Kusong-dong Yusong-gu, Taejon 305-701, South Korea
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Rath, S.K., Das, C., Sahu, S.

55428272300;56264863400;7202907651;
Graph colouring approach for cell formation problems
(1995) Production Planning and Control, 6 (5), pp. 421-428. Cited 6 times.
0029375613&doi=10.1080%2f09537289508930299&partnerID=40&md5=0d985b4f7de17a919226f95
282344b42
DOI: 10.1080/09537289508930299
AFFILIATIONS: Regional Engineering College, Rourkella, 769008, India;
Indian Institute of Technology, Kharagpur, 721302, India
ABSTRACT: This paper presents a graph-theoretic approach for solving the clustering
problem in group technology. The machine-component incidence matrix is used to form
the weight matrix. Using the two weight matrices, one for the machines and the
other for the parts, two graphs are developed. The nodes of each graph are coloured
using the proper colouring method. An edge, whose adjacent nodes are of same
colour, partitions the graph into subgraphs, thus creating machine-part cells. This
cell formation method yields solutions which compare favourably with respect to
other available methods. This procedure is illustrated using an example problem
from the literature. © 1995 Taylor and Francis Ltd.
AUTHOR KEYWORDS: Cellular manufacturing; Group technology; Machine cell (MC);
Part family (PF)
INDEX KEYWORDS: Graph theory; Manufacture; Matrix algebra; Problem solving,
Cellular manufacturing; Clustering; Incidence matrix; Machine cell; Weight matrix,
Production control
Askin, R.G., Subramanian, S., A cost based heuristic for group technology
Berge, C., (1962) The theory of Graphs and its applications, , (John Wiley and
Sons, New York);
Burbidge, J.L., Production flow analysis (1971) Production Engineer, pp. 139-152.,
Apr/May;
Burbidge, J.L., (1975) The introduction of group technology, , (John Wiley and
Sons, New York);
Chandrasekharan, M.P., Rajagopalan, R., An ideal seed nonhierarchical algorithm for
451-464;
Chandrasekharan, M.P., Rajacopalan, R., ZODIAC - and algorithm for concurrent
Cheng, C.H., Algorithms for grouping machine groups in Group Technology (1992)
Omega, 20, pp. 493-501;
Chu, C.H., Cluster analysis in manufacturing (1989) Omega, 17, pp. 289-295;
cellular production systems (1986) Flexible Manufacturing Systems, Methods and
studies, pp. 301-318., Edited by A. Kusiak (North Holland, New York);
Flanders, R.E., Design manufacturing and production control of a standard machine
(1925) Transactions of ASME, p. 46;
Grotschel, M., Wakabayashi, Y., A cutting plane algorithm for a clustering problem
Gunasingh, R.K., Laskari, R.S., Machine grouping problem in cellular manufacturing
Gunasingh, R.K., Laskari, R.S., The cell formation problem in cellular
manufacturing systems: A sequential modelling approach (1989) Computers and
Ham, I., Hitomi, K., Yoshida, T., (1985) Group Technology: Application to product
management, , (KluwerNijhoff Amsterdam);
Hansen, P., Delattre, M., Complete-link cluster analysis by graph colouring (1978)
Journal of the American Statistical Association, 73 (362), pp. 397-403;
Huanc, P.Y., Houck, B.L.W., Cellular Manufacturing; An overview and bibliography
(1985) Production and Inventory Management, (4), pp. 83-91;
Kinc, J.R., Machine component group formation in production Dow analysis: An
approach using ROC Algorithm (1980) International Journal of Production Research,
18, pp. 213-232;
Kusiak, A., Branching Algorithm for solving the group technology problem (1991)
pp. 53-57., Feb;
reorganisation by clustering technique (1972) Operations Research, 20 (5), pp. 993-
1009;
Mitrofanov, S.P., Rotational utilisation of turrets (lathes) (1952) LDNTP, ,
Leningrad, U.S.S.R;
technology clustering problem (1985) Omega, 13, pp. 381-391;
Rajagopalan, R., Batra, J.L., Design of cellular production systems, a graph
567-579;
Seifoddini, H., Machine grouping-expert systems (1988) Computers and Industrial
Engineering, 15 (1-4), pp. 210-216;
Research, 28, pp. 2075-2085;
Decision Science, 21, pp. 416-433
ISSN: 09537287
ABBREVIATED SOURCE TITLE: Prod Plann Control
SOURCE: Scopus
Vakharia, A.J., Wemmerlöv, U.

7003543855;6601920402;
A comparative investigation of hierarchical clustering techniques and dissimilarity
measures applied to the cell formation problem
6963%2895%2900017-M&partnerID=40&md5=18d35db1b3b9622a0fe0ec0e6a8b83d8
DOI: 10.1016/0272-6963(95)00017-M
AFFILIATIONS: Department of Decision and Information Sciences, College of Business
Administration, University of Florida, Gainesville, FL 32611, United States;
Erdman Center for Manufacturing and Technology Management, Graduate School of
Business, University of Wisconsin-Madison, Madison, WI 53706, United States
ABSTRACT: One methodology for identifying alternative cell designs is the use of
clustering algorithms coupled with dissimilarity measure. This paper investigates
the performance of seven hierarchical clustering techniques (six previously
developed and one developed specifically for cell formation) and eight
dissimilarity measures (three well-known measures and five versions of a recently
developed parametric measure) in the context of cell formation. Twenty-four data
sets, at close to 200 partition levels, and ten measures of performance, are used
for this purpose. We first identify clustering techniques and dissimilarity
measures which should not be used for cell formation when binary data are involved.
From the remaining clustering techniques and dissimilarity measures, we then
identify clustering technique/dissimilarity measure combinations which are
consistently good or poor performers when cell characteristics are observed. High
internal cell cohesiveness and low levels of machine duplication are shown to be
conflicting goals. Clustering techniques' performance dependency on dissimilarity
measures, data sets, stopping rules, and metrics are also clearly illustrated.
Another result is that choice of clustering technique is more critical than choice
of dissimilarity measure. However, differences among clustering techniques (due to
chaining tendencies) can be sharply reduced by restricting the solution space for
acceptable cell configurations. © 1995.
AUTHOR KEYWORDS: Cellular manufacturing; Clustering; Facility layout
INDEX KEYWORDS: Algorithms; Hierarchical systems; Machinery; Performance; Plant
layout; Scheduling, Cellular manufacturing; Facility layout; Hierarchical
clustering techniques, Manufacture
REFERENCES: Anderberg, (1973) Cluster Analysis for Applications, , Academic Press,
New York;
Askin, Subramanian, A cost-based heuristic for group technology configuration
Baulieu, A classification of presence/absence based dissimilarity coefficients
(1989) Journal of Classification, 6 (2), pp. 233-246;
Blashfield, Mixture model test of cluster analysis: Accuracy of four agglomerative
hierarchical methods (1976) Psychological Bulletin, 83 (3), pp. 377-388;
Blashfield, Morey, A comparison of four clustering methods using MMPI Monte Carlo
data (1980) Applied Psychological Measurement, 4 (1), pp. 57-64;
Burbidge, (1975) The Introduction of Group Technology, , Wiley, New York;
Carrie, Numerical taxonomy applied to group technology and plant layout (1973)
Chandrasekharan, Rajagopalan, An ideal seed non-hierarchical clustering algorithm
for cellular manufacturing (1986) International Journal of Production Research, 24
(2), pp. 451-464;
Chandrasekharan, Rajagopalan, ZODIA: An algorithm for concurrent formation of part-
families and machine-cells (1987) International Journal of Production Research, 25
(6), pp. 835-850;
Chandrasekharan, Rajagopalan, GROUPABILITY: An analysis of the properties of binary
data matrices for group technology (1989) International Journal of Production
Research, 27 (6), pp. 1035-1052;
Choobineh, A framework for the design of cellular manufacturing systems (1988)
Chow, Hawaleshka, An efficient algorithm for solving the machine chaining problem
in cellular manufacturing (1992) Computers & Industrial Engineering, 20 (1), pp.
95-100;
Cunningham, Ogilvie, Evaluation of hierarchical grouping techniques; A preliminary
study (1972) The Computer Journal, 15 (3), pp. 209-213;
de Beer, de Witte, Production flow synthesis (1978) CIRP Annals, 27 (3), pp. 389-
392;
de Witte, The use of similarity coefficients in production flow analysis (1980)
Faber, Carter, A new graph theory approach for forming machine cells in cellular
production systems (1986) Flexible Manufacturing Systems: Methods and Studies, , A.
Kusiak, North-Holland, Amsterdam;
Fowlkes, Mallows, A method for comparing two hierarchical clusterings (1983)
Journal of the American Statistical Association, 78 (383), pp. 553-569;
Gordon, (1981) Classification, , Chapman and Hall, London;
Gupta, Clustering algorithms for the design of cellular manufacturing systems — An
analysis of their performance (1991) Computers in Industrial Engineering, 20 (4),
pp. 461-468;
Gupta, Seifoddini, Production data based similarity coefficient for machine-
component grouping decisions in the design of a cellular manufacturing system
Kaufman, Rousseeuw, (1990) Finding Groups in Data, , Wiley, New York;
Klastorin, The p-median problem for cluster analysis: A comparative test using the
mixture model approach (1985) Management Science, 31 (1), pp. 84-95;
Kuiper, Fisher, A Monte Carlo comparison of six clustering problems (1975)
Biometrics, 31, pp. 777-783;
Kumar, Chandrasekharan, Grouping efficacy: A quantitative criterior for goodness of
block diagonal forms of binary matrices in group technology (1990) International
Kumar, Vannellii, Strategic subcontracting for efficient disaggregated
1715-1728;
systems (1986) European Journal of Operational Research, 24, pp. 387-397;
Kusiak, The generalized group technology concept (1987) International Journal of
(2), pp. 53-57;
Milligan, An examination of the effect of six types of error perturbation on
fifteen clustering algorithms (1980) Psychometrika, 45 (3), pp. 325-342;
Milligan, Cooper, Methodology review Clustering methods (1987) Applied
Psychological Measurement, 11 (4), pp. 329-354;
Mojena, Hierarchical grouping methods and stopping rules An evaluation (1977) The
Computer Journal, 20 (4), pp. 359-363;
Mosier, An experiment investigating the application of clustering procedures and
similarity coefficients to the GT machine cell formation problem (1989)
Mosier, Taube, Weighted similarity measure heuristics for the group technology
machine clustering problem (1985) OMEGA, 13 (6), pp. 577-583;
Rajagopalan, Batra, Design of cellular production systems: A graph theoretic
Seifoddini, Single linkage versus average linkage clustering in machine cells
formation applications (1989) Computers in Industrial Engineering, 16 (3), pp. 419-
426;
Seifoddini, Wolfe, Application of the similarity coefficient method in group
technology (1986) IIE Transactions, 18 (3), pp. 271-277;
Seifoddini, Wolfe, Selection of a threshold value based on material handling cost
in machine-component grouping (1987) IEE Transactions, 19 (3), pp. 266-270;
Selvam, Balasubramanian, Algorithmic grouping of operation sequences (1985)
Engineering Costs and Production Economics, 9, pp. 125-134;
Shafer, Rogers, Similarity and distance measures for cellular manufacturing. Part
II. An extension and comparisons (1993) International Journal of Production
Research, 31 (6), pp. 1315-1326;
Sneath, Sokal, (1973) Numerical Taxonomy, , Freeman, San Francisco;
Srinivasan, Narendran, Mahadevan, An assignment model for the part-families problem
in group technology (1990) International Journal of Production Research, 28 (1),
pp. 145-152;
Stanfel, Machine clustering for economic production (1985) Engineering Costs and
Tam, An operation sequence based similarity coefficient for part families
formations (1990) Journal of Manufacturign Systems, 9 (1), pp. 55-68;
Tarsuslugil, Bloor, The use of similarity coefficients and cluster analysis in
production flow analysis (1979) Proceedings 20th International Machine Tool Design
and Research Conference, pp. 525-532., Birmingham, UK, September;
Vakharia, Wemmerlöv, A new similarity index and clustering methodology for
formation of manufacturing cells (1988) DSI Proceedings, 2, Annual Meeting, pp.
1075-1077., Las Vegas, 21–23 November;
Vakharia, Wemmerlöv, Designing a cellular manufacturing system: A materials flow
approach based on operation sequences (1990) IIE Transacations, 22 (1), pp. 84-97;
Waghodekar, Sahu, Machine-component cell formation in group technology: MACE (1984)
Wei, Kern, Commonality analysis: A linear cell clustering algorithm for group
2062;
Wemmerlöv, Hyer, Procedures for the part family/machine group identification
problemin cellular manufacture (1986) Journal of Operations Management, 6 (2), pp.
125-148;
Winkler, Hays, (1975) Statistics: Probability, Inference and Decision, , Holt,
Rinehart & Winston, New York
CORRESPONDENCE ADDRESS: Vakharia, A.J.; Department of Decision and Information
Sciences, College of Business Administration, University of Florida, Gainesville,
FL 32611, United States
ISSN: 02726963
CODEN: JOTME
SOURCE: Scopus
Won, Y., Kim, S.

7102129121;24518393100;
An assignment method for the part-machine cell formation problem in the presence of
multiple process routes
0000687433&doi=10.1080%2f03052159408941336&partnerID=40&md5=aed607aed2cfce0b05340d1
2a05e72a8
DOI: 10.1080/03052159408941336
AFFILIATIONS: Department of Management Science, Korea Advanced Institute of Science
and Technology, 373-1 Kusong-dong, 305-701, Taejeon, Yusong-Gu, South Korea
AUTHOR KEYWORDS: assignment model; cell formation; Group technology; p-median
model
REFERENCES: Cheng, C.H., Algorithms for Grouping Machine Groups in Group Technology
(1992) Omega, 20 (4), pp. 493-501;
Chu, C.H., Cluster Analysis in Manufacturing Cellular Formation (1989) Omega, 17
(2), pp. 125-147;
Frazier, G.V., Gaither, N., Seed Selection Procedures for Cell Formation Heuristics
(1991) Int. J. Prod. Res, 29 (11), pp. 2227-2233;
Kusiak, A., The Generalized Group Technology Concept (1987) Int. J. Prod. Res, 25
(3), pp. 561-569;
Kusiak, A., Cho, M., Similarity Coefficient Algorithms for Solving the Group
Technology Problem (1992) Int. J. Prod. Res, 30 (11), pp. 2633-2646;
Nagi, R., Harlarakis, G., Proth, J.M., Multiple Routeings and Capacity
Considerations in Group Technology Applications (1990) Int. J. Prod. Res, 28 (12),
pp. 2243-2257;
Sankaran, S., Kasilingam, K.G., An Integrated Approach to Cell Formation and Part
Routing in Group Technology (1990) Eng. Opt, 16 (3), pp. 235-245;
Srinivasan, G., Narendran, T.T., Mahadevan, B., An Assignment Model for the Part
Families Problem in Group Technology (1990) Int. J. Prod. Res, 28 (1), pp. 145-152;
Srinivasan, G., Narendran, T.T., GRAFICS-A Nonhierarchical Clustering Algorithm for

Group Technology (1991) Int. J. Prod. Res, 29 (3), pp. 463-478;
Wei, J.C., Gaither, N., An Optimal Model for Cell Formation Decisions (1990) Dec.
Sci, 21 (2), pp. 416-433;
Wemmerlöv, U., Hyer, N.H., Procedures for the Part family/Machine Group
Identification Problem in Cellular Manufacturing (1986) J. Opns. Mgmt, 6 (2), pp.
125-147
ISSN: 0305215X
SOURCE: Scopus
Boctor, F.F.
7005106094;
A Jinear formulation of the machine-part cell formation problem
times.
0026112945&doi=10.1080%2f00207549108930075&partnerID=40&md5=81dcd23df0d3b0284ba81c2
7089e5761
DOI: 10.1080/00207549108930075
AFFILIATIONS: Faculte des Sciences de I’Administration, Universite Laval, QC, G1
K7P4, Canada
ABSTRACT: The machine-part group formation is an important issue in the design of
cellular manufacturing systems. The present paper first discusses some of the
alternative formulations of this problem, their advantages and disadvantages, and
then suggests a new linear zero-one formulation which seems to have removed most of
the disadvantages observed in other models. It will be shown that most of the
integrality conditions of the proposed formulation can be relaxed. This
considerably improves its computational feasibility and efficiency. Finally, a
simulated annealing approach to deal with large-scale problems is also presented. ©
1991 Taylor & Francis Group, LLC.
INDEX KEYWORDS: Mathematical Programming; Mathematical Techniques - Heuristic,
Cellular Manufacturing; Cluster Analysis; Linear Zero One Formulation; Machine Part
Cell Formation; Simulated Annealing, Industrial Plants
REFERENCES: Ang, C.L., Willey, P., A comparative study of the performance of pure
and hybrid group technology manufacturing systems using computer simulation
techniques (1984) International Journal of Production Research, 22, pp. 193-233;
Research, 25, pp. 639-665;
Burbidge, J.L., Production flow analysis on a computer (1973) Third Annual
Conference of the Institute of Production Engineers;
Collins, N.E., Eglese, R.W., Golden, B.L., (1988) Simulated Annealing-An Annotated
Bibliography, , Working paper, University of Maryland at College Park;
Heller, I., Tompkins, C.B., An extension of the theorem of Dantzig (1956) Allnals
of Mathematical Studies, 38, p. 247;
Hoffman, A.J., Kruskal, J.B., Integral boundary points of convex polyhedral (1956)
Annals of Mathematical Studies, 38, p. 223;
Iri, M., On the synthesis of loop and cutset matrices and the related problems
(1968) SAAC Memories, 4 (A-XIII), p. 376;
Research, 18, pp. 213-232;
117-121;
397;
Annals Operational Research, 3, pp. 279-300;
Kusiak, A., Efficient Solving of the Group Technology Problem (1987) Journal of
Engineering, 51, p. 54;
McCormick, W.T., Schwetzer, P.J., White, T.E., Problem decomposition and data
1009;
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Equation of state
calculations by fast computing machines (1953) Journal of Chemical Physics, 21, pp.
1087-1092;
Rajagopalan, R., Batra, J.L., Design of cellular production systems, a
graphtheoretic approach (1975) International Journal of Production Research, 13,
pp. 567-579;
Tremolieres, R., Group technology by natural clustering (1987) CORS 29Th National
Meeting, , Calgary, Canada;
24;
Wemmerlov, U., Hyer, N.L., The part family/machine group identification problem in
cellular manufacturing (1986) Journal of Operations Management, 6, p. 125;
CORRESPONDENCE ADDRESS: Boctor, F.F.; Faculte des Sciences de I’Administration,
Universite Laval, QC, G1 K7P4, Canada
ISSN: 00207543
SOURCE: Scopus
Logendran, R.
57207586498;
Effect of the identification of key machines in the cell formation problem of
8352%2891%2990016-Y&partnerID=40&md5=4a2c1bdb608d97124dec036d71513f7c
DOI: 10.1016/0360-8352(91)90016-Y
AFFILIATIONS: Assistant Professor of Industrial and Manufacturing Engineering, Room
118, Covell Hall, Oregon State University, Corvallis, OR 97331-2407 U.S.A., United
States
ABSTRACT: Cellular manufacturing as been viewed as an important manufacturing
philosophy that has helped both small and medium sized parts manufacturers increase
their manufacturing productivity. In the analysis of a cellular manufacturing
problem, identifying the key machines representing the manufacturing cells is an
important step in the determination of final part-machine clusters. Three different
methods have been proposed in this paper for performing this identification, and a
more complete model taking into consideration the sequence of operations exhibited
by parts have been developed for minimizing total moves. The total movefs
contributed by all parts have been evaluated as a weighted sum of both inter- and
intracell moves. A heuristic solution algorithm developed for the model has been
operationalized by implementing the associated computer program on an IBM PC
compatible microcomputer. The sensitivity of each of the three proposed methods
with regard to identifying the key machines and their impact on the selection of
final part-machine clusters has been analyzed by solving an example problem. The
results obtained show that method 2 outperforms the other two (methods 1 and 3) in
determining the best part-machine clusters in cellular manufacturing, thus making
it a better decision tool to be used by both small and medium sized parts
manufacturers in production planning. © 1991.
INDEX KEYWORDS: Computer Programming - Algorithms; Computers, Personal;
Mathematical Models, Cellular Manufacturing; Manufacturing Cells; Part-Machine
Clusters, Computer Aided Manufacturing
REFERENCES: King, Machine-component grouping in production flow analysis: an
approach using rank order clustering algorithm (1980) Int. J. Prod. Res., 18, pp.
213-232;
King, Nakornchai, Machine-component group formation in group technology: review and
Chan, Milner, Direct clustering algorithm for group formation in cellular
Chandrasekharan, Rajagopalan, MODROC: an extension of rank order clustering for
Chandrasekharan, Rajagopalan, ZODIAC—an algorithm for concurrent formation of part-
families and machine-cells (1987) Int. J. Prod. Res., 25, pp. 835-850;
Tabucanon, Ojha, ICRMA—a heuristic approach for intercell flow reduction in
cellular manufacturing systems (1987) Mater. Flow, 4, pp. 189-197;
Ballakur, Steudel, A within-cell utilization based heuristic for designing cellular
Harhalakis, Nagi, Proth, An efficient heuristic in manufacturing cell formation for
group technology applications (1990) Int. J. Prod. Res., 28, pp. 185-198;
Logendran, A workload based model for minimizing total intercell and intracell
moves in cellular manufacturing (1990) Int. J. Prod. Res., 28, pp. 913-925;
Logendran, West, A machine-part based grouping algorithm in cellular manufacturing
Taha, (1975) Integer Programming: Theory, Applications, and Computations, ,
Academic Press, New York;
Garey, Johnson, (1979) Computers and Interactibility: A Guide to the Theory of NP-
Completeness, , Freeman, New York;
Lawler, Lenstra, Rinnoy Kan, Shmoys, (1985) The Travelling Salesman Problem: A
Guided Tour of Combinatorial Optimization, , Wiley, New York;
Francis, White, (1974) Facility Layout and Location—An Analytical Approach, ,
Prentice-hall, Englewood Cliffs, NJ;
McAuley, Machine grouping for efficient production (1972) Production Engineer, 51,
pp. 53-57;
Seifoddini, Wolfe, Application of the Similarity Coefficient Method in Group
Kusiak, The generalized group technology concept (1987) Int. J. Prod. Res., 25, pp.
561-569;
Srinivasan, Narendran, Mahadevan, An assignment model for the part-families problem
in group technology (1990) Int. J. Prod. Res., 28, pp. 145-152
CORRESPONDENCE ADDRESS: Logendran, R.
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Dutta, S.P., Lashkari, R.S., Padhye, A., Nadoli, G.

7402667338;6701624021;7007139906;6507646858;
CELL FORMATION PROBLEM IN FLEXIBLE MANUFACTURING SYSTEMS.
(1985) pp. 199-207. Cited 1 time.
0022194920&partnerID=40&md5=19429bbbb8d2c6bd67e97554a2deac65
AFFILIATIONS: Univ of Windsor, Can, Univ of Windsor, Can
ABSTRACT: The grouping procedures expounded in literature to achieve flexibility
have generally distinguished between 'pattern recognition' and 'tooling or machine
families selection'. Yet it is increasingly evident that, in a low volume/high
variety part mix scenario, an amalgamation of the former with the latter is
essential. The authors have proposed a methodology to bridge the gap by using a
codification system derived from the Optiz code to simultaneously assess a new part
or component for design family and tooling family identity with respect to existing
manufacturing facilities.
INDEX KEYWORDS: COMPUTER AIDED MANUFACTURING; PRODUCTIVITY, CODIFICATION SYSTEM;
COMPUTER AIDED PROCESS PLANNING; PART CLUSTERING; PART REPRESENTATION SCHEME;
TOOLING HOMOGENEITY ANALYSIS, INDUSTRIAL PLANTS
CORRESPONDENCE ADDRESS: Dutta, S.P.; Univ of Windsor, Can, Univ of Windsor, Can
EDITORS: Lindholm Rolf
PUBLISHER: IFS (Publ) Ltd, Kempston, Engl
ISBN: 0903608979
SOURCE: Scopus
Agrawal, A.K., Bhardwaj, P., Kumar, R., Sharma, S.

35415561400;55180263000;57198684260;56140111300;
Particle Swarm Optimization for natural grouping in context of group technology
application
(2015) IEOM 2015 - 5th International Conference on Industrial Engineering and
Operations Management, Proceeding, art. no. 7093820, . Cited 2 times.
84931072064&doi=10.1109%2fIEOM.2015.7093820&partnerID=40&md5=b9532bc40f44672d145585
e25adcee79
DOI: 10.1109/IEOM.2015.7093820
AFFILIATIONS: Mechnical Engineering Department, Indian Institute of Technology
(BHU), Varanasi, UP, 221005, India;
Production and Industrial Engineering Department, NIT Jamshedpur, Adityapur,
Jamshedpur, Jharkhand, 831014, India
ABSTRACT: Cell-formation problem (CFP) addresses the issue of creation of part
families based on similarity in processing requirements and the grouping of
machines into groups based on their ability to process those specific part
families. The CFP is combinatorial in nature and due to difficulty faced in solving
related mathematical programming problems; efforts have been made to use
evolutionary approaches. Literature highlights that there are many advantages of
converting batch type manufacturing system (BTMS) to cellular manufacturing system
(CMS). In this paper, mathematical model has been proposed for groups to be emerged
naturally. As mathematical model of CFP becomes NP- complete in nature, researchers
advocate the use of meta-heuristics. Over the years, many different metaheuristic
methods have been used to solve the CFP in group technology application. In the
present paper, evolutionary population based method known as Particle Swarm
Optimization (PSO) hybridized with assignment algorithm is used to solve cell
formation problems. Due to these proposed changes, efficiencies of cell formed
significantly increase in comparison to the results available in the literature.
Proposed hybrid algorithm is applied to solve 30 different types of randomly
generated and 10 standard CFPs, a large verity in terms of number of parts and
number of machines required by these parts. For this algorithm, optimal values of
parameters were also found with the use of Taguchi method. It is found that the
proposed changes in algorithm and parameters obtained significantly impact the
results in terms of efficiency values. © 2015 IEEE.
AUTHOR KEYWORDS: Cell Formation Problem (CFP); Cellular Manufacturing (CM); Group
Technology (GT); Particle Swarm Optimization (PSO)1
INDEX KEYWORDS: Algorithms; Cells; Cytology; Evolutionary algorithms; Group
technology; Manufacture; Mathematical programming; Mobile security; Optimization;
Parameter estimation; Particle swarm optimization (PSO); Problem solving; Taguchi
methods, Assignment algorithms; Cell formation problem; Evolutionary approach;
Evolutionary population; Hybrid algorithms; Mathematical programming problem; Meta-
heuristic methods; Technology application, Cellular manufacturing
REFERENCES: Zhao, C., Wu, Z., A genetic algorithm for cell formation with multiple
routes and multiple objectives (2000) Int. J. Prod. Res., 38 (2), pp. 385-395;
(1925) Transactions of ASME, 46, pp. 691-738;
Mitrofanov, S.P., The scientific principles of group technology (1959) Leningrad, ,
(translated by J. Grayson, Birmingham University;
Fazakerley, G.M., A research report on the human aspects of group technology and
cellular manufacture (1976) International Journal of Production Research, 14 (1),
p. 123;
Ham, I., Hitomi, K., Yoshida, T., (1985) Group Technology-applications to
Production Management, , Kluwer Nijhoff Publishing;
Manufacture, , Ellis Horwood Limited, Chichester;
Burbidge, J.L., Operations scheduling with GT and PBC (1988) International Journal
Chu, C.H., Clustering analysis in manufacturing cellular formation (1989) OMEGA, 17
(3), pp. 289-295;
42-752;
139-152;
51 (2), pp. 53-57;
419-426;
Seifoddini, H., Wolfe, P.M., Selection of a threshold value based on the material
handling cost in machine-component grouping (1986) I.I.E. Transactions, 19 (3), pp.
266-270;
567-579;
using rank order clustering (1980) International Journal of Production Research, 18
(2), pp. 213-232;
Research, 24 (2), pp. 451-464;
Research, 24 (5), pp. 1221-1233;
Macqueen, J.B., Some methods for classification and analysis of multivariate
observations (1967) Proceedings of 5th Berkeley Symposium on Mathematical
Statistics and Probability, pp. 281-297., University of California Press;
Research, 27 (9), pp. 1465-1473;
manufacturing systems (1996) IIE Trans, 28 (4), pp. 333-345;
Liu, C., Wu, J., Machine cell formation: Using simulated annealing algorithm (1993)
Cao, D., Chen, M., A robust cell formations approach for varying product demands
Hollande, J., (1975) Adaption in Natural and Artificial Systems, , University of
Michigan press;
problem in involving processing times and lot sizes (2003) Computers and Industrial
Engineering, 45 (4), pp. 713-731;
Dorigo, M., (1992) Optimization, Learning and Natural Algorithms, p. 140., Ph.D.
Thesis, DEI, Politecnico di Milano, Italy;
474;
Anvari, M., Mehrabad, M.S., Barzinpour, F., Machine-part cell formation using a
International Journal Expert Systems with Applications, 37 (2), pp. 1563-1567;
1380;
Agrawal, A.K., Bhardwaj, P., On some measures for grouping efficiency (2011)
Clerc, M., The swarm and the queen: Towards a deterministic and adaptive particle
swarm optimization (1999) CEC 99. Proceedings of the 1999 Congress, 3;
Hedayat, A.S., Sloane, N.J.A., Stufken, J., (1999) Orthogonal Arrays, Theory and
Applications, , Nsew York: Springer;
Agrawal, A.K., Bhardwaj, P., Srivastava, V., Ant colony optimization for group
technology applications (2011) International Journal of Advanced Manufacturing
Technology, 55 (5), pp. 783-795;
Expert Systems with Applications, 36 (3), pp. 6598-6604
ISBN: 9781479960651
ABBREVIATED SOURCE TITLE: IEOM - Int. Conf. Ind. Eng. Oper. Manag., Proc.
SOURCE: Scopus
Ilić, O., Cvetić, B.

7801578785;55213494100;
A comparative case study of e-learning tools for manufacturing cell formation
(2014) Journal of Advanced Mechanical Design, Systems and Manufacturing, 8 (3), .
Cited 1 time.
84904717847&doi=10.1299%2fjamdsm.2014jamdsm0020&partnerID=40&md5=cdea64e4dfe2b559a5
7278867a65953e
DOI: 10.1299/jamdsm.2014jamdsm0020
AFFILIATIONS: University of Belgrade, Faculty of Management Sciences, Jove Ilica
154, 11040 Belgrade, Serbia
ABSTRACT: Manufacturing cell formation is the first and foremost issue in designing
cellular manufacturing system. The main objective in the cell formation problem is
to cluster machines into machine cells and parts into part families so that the
minimum of both intercell and intracell flows will be achieved. The purpose of this
paper is to enhance solving the cell formation problem with the help of e-Learning
tools in the educational environment. An efficient method and supporting tool for
solving manufacturing cell formation problem are proposed. Therefore, the original
similarity coefficient-based heuristic (SCBH) algorithm for solving the cell
formation problem is presented. It incorporates the pure combinatorial optimization
models for maximization the sum of similarity coefficients between machine/part
pairs. Additionally, the LAYOUT tool is offered as a supporting tool for the SCBH.
A comparative case study is conducted to validate the performance of the proposed
SCBH algorithm and LAYOUT tool, and the results showed that their implementation is
significant for reducing both intercell and intracell flows. The results of this
work can be helpful for future or existing practitioners to become the real-world
cell formation problem solvers. © 2014 The Japan Society of Mechanical Engineers.
AUTHOR KEYWORDS: Cell formation problem; Cluster analysis; Comparative case
study; E-Learning tool; Heuristic algorithm; Similarity coefficient
INDEX KEYWORDS: Cluster analysis; Combinatorial optimization; E-learning; Flexible
manufacturing systems; Heuristic algorithms; Optimization, Algorithm for solving;
Cell formation problem; Cluster machines; Comparative case study; E-learning tool;
Educational environment; Manufacturing cell formation; Similarity coefficients,
REFERENCES: Chattopadhyay, M., Sengupta, S., Ghosh, T., Dan, P.K., Mazumdar, S.,
Neuro-genetic impact on cell formation methods of cellular manufacturing system
design: A quantitative review and analysis (2013) Computers and Industrial
Engineering, 64 (1), pp. 256-272;
considerations (2011) Computers and Industrial Engineering, 60 (1), pp. 7-15;
similarity coefficient (2008) Journal of Industrial and Systems Engineering, 1 (4),
pp. 318-344;
Ilić, O., An e-Learning tool considering similarity measures for manufacturing cell
formation (2014) Journal of Intelligent Manufacturing, 25 (3), pp. 617-628., (First
published online: 20 November 2012);
Ilić, O., (2003) Computer Integrated Manufacturing, , Faculty of Management
Sciences, University of Belgrade, Belgrade (In Serbian);
Irani, S.A., Huang, H., (2005) Hybrid Cellular Layouts: New Ideas for Design of
Flexible and Lean Layouts for Jobshops, , Department of Industrial, Welding and
Systems Engineering, The Ohio State University, Columbus, USA;
Irani, S.A., (2012) PFAST, , http://pfast.ise.ohio-state.edu/pfast/BuyPFast.html,
(online), (accessed on 10 December 2012);
Irani, S.A., Zhang, H., Zhou, J., Huang, H., Udai, T.K., Subramanian, S.,
Production flow analysis and simplification toolkit (PFAST) (2000) International
10.1080/002075400188636;
Jayakumar, V., Raju, R., A multi-objective genetic algorithm approach to the
probabilistic manufacturing cell formation problem (2011) South African Journal of
John, E., Kuznecov, A., Thomas, A., Davies, A., A weighted similarity coefficient
technique for manufacturing facility design (2011) International Journal of
Productivity and Performance Management, 60 (7), pp. 746-757;
the formation of cellular manufacturing systems (2010) International Journal of
measures for manufacturing cell formation (2008) Journal of Manufacturing Systems,
27 (1), pp. 19-25;
researchk (2010) European Journal of Operational Research, 206 (3), pp. 509-521;
Paydar, M.M., Mahdavi, I., Khonakdari, S.V., Solimanpur, M., Developing a
(4), pp. 508-520;
Sarker, B.R., Xu, Y.I., Designing multi-product lines: Job routing in cellular
manufacturing systems (2000) IIE Transactions (Institute of Industrial Engineers),
32 (3), pp. 219-235., DOI 10.1023/A:1007642413799;
coefficient in machine cell formation (1995) Journal of Manufacturing Systems, 14
(1), pp. 35-44;
European Journal of Operations Research, 69 (3), pp. 284-291;
Vakharia Asoo, J., Wemmerlov Urban, Designing a cellular manufacturing system. A
materials flow approach based on operation sequences (1990) IIE Transactions
(Institute of Industrial Engineers), 22 (1), pp. 84-97;
manufacturing: An experimental study (1995) Computers and Industrial Engineering,
29 (1), pp. 567-571;
Won, Y.K., Kim, S., An assignment method for the part-machine cell formation
22 (3), pp. 231-240;
S0925527305000496;
48 (3), pp. 471-489., DOI 10.1016/j.cie.2003.01.001, PII S0360835204001974,
Yin, Y., Kaku, I., Tang, J., Zhu, J.M., Data mining: Concepts (2011) Methods and
Applications in Management and Engineering Design, , Springer-Verlag London, UK
PUBLISHER: Japan Society of Mechanical Engineers
ISSN: 18813054
ABBREVIATED SOURCE TITLE: J. Adv. Mech. Des. Syst. Manuf.
SOURCE: Scopus
Lin, S.-W., Ying, K.-C., Lee, Z.-J.

7407153943;56116887600;55925766900;
Part-machine cell formation in group technology using a simulated annealing-based
meta-heuristic
13 times.
77951143758&doi=10.1080%2f00207540902896212&partnerID=40&md5=8ecca331e91c9f002efad9
abd96e9698
DOI: 10.1080/00207540902896212
AFFILIATIONS: Department of Information Management, Chang Gung University, Tao-
Yuan, Taiwan;
Department of Industrial Engineering and Management, National Taipei University of
Technology, Taipei, Taiwan;
Department of Information Management, Huafan University, Taipei, Taiwan
ABSTRACT: The part-machine cell formation problem (PMCFP) is a crucial step in the
design of a cellular manufacturing system and has received considerable research
attention over the last five decades. This study proposes a simulated annealing-
based meta-heuristic for solving the PMCFP. The effectiveness of the proposed
approach is compared to conventional algorithms across a set of PMCFPs available in
the literature. Computational results using four types of performance measures show
that the proposed simulated annealing-based meta-heuristic is highly effective by
comparison with conventional algorithms for PMCFPs on the same test problems. ©
2010 Taylor & Francis.
AUTHOR KEYWORDS: Cell formation problem; Manufacturing cell design; Meta-
heuristic; Simulated annealing
INDEX KEYWORDS: Cell formation problem; Cellular manufacturing systems;
Computational results; Conventional algorithms; Machine cell; Machine cell
formation problems; Manufacturing cells; Metaheuristic; Performance measure; Test
problem, Annealing; Cellular manufacturing; Flexible manufacturing systems; Group
technology; Heuristic algorithms; Heuristic methods; Industrial research; Machine
design, Simulated annealing
routings and machine reliability consideration (2008) International Journal of
Askin, R.G., A Hamiltonian path approach to reordering the part-machine matrix for
pp. 1081-1100;
Ballakur, A., Steudel, H.J., A within-cell utilisation based heuristic for
Research, 25 (5), pp. 639-665;
Designing A Cellular Manufacturing System, , Unpublished thesis (PhD). University
of Wisconsin-Madison;
Burbidge, J.L., (1975) The Introduction of Group Technology, , London: Heinemann;
Candalino Jr, T.J., Kobza, J.E., Jacobson, S.H., Designing optimal aviation baggage
screening strategies using simulated annealing (2004) Computers and Operations
Research, 31 (10), pp. 1753-1767;
Research, 24 (2), pp. 451-464;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC - AN ALGORITHM FOR CONCURRENT
FORMATION OF PART-FAMILIES AND MACHINE-CELLS. (1987) International Journal of
generalized group technology (2001) Computers and Industrial Engineering, 41 (2),
pp. 227-240., DOI 10.1016/S0360-8352(01)00056-0, PII S0360835201000560;
El-Essawy, I.F.K., Torrance, J., Component flow analysis - An effective approach to
production systems' design (1972) Production Engineer, 51 (5), pp. 165-170;
Elmaraghy, H.A., Gu, P., Feature based expert parts assignment in cellular
manufacturing (1988) Journal of Manufacturing System, 8 (2), pp. 139-152;
Ferreira, J.F., Ribeiro, C., Pradin, B., A methodology for cellular manufacturing
design (1993) International Journal of Production Research, 31 (1), pp. 235-250;
Industrial Engineering, 42 (2-4), pp. 377-382., DOI 10.1016/S0360-8352(02)00039-6,
PII S0360835202000396;
Irani, S., (1999) Handbook of Cellular Manufacturing Systems, , New York: John
Wiley & Sons;
2059-2079., DOI 10.1016/j.cor.2005.08.010, PII S0305054805002649;
Research, 33 (1), pp. 263-283., DOI 10.1016/j.cor.2005.03.033, PII
S0305054805001280;
1182-1189;
Kim, K.H., Moon, K.C., Berth scheduling by simulated annealing (2003)
Transportation Research - Part B, 37 (6), pp. 542-560;
King, J.R., Nakornchai, V., Machine-component group formulation in group
technology: Review and extension (1982) International Journal of Production
Research, 20 (2), pp. 117-133;
Research, 18 (2), pp. 213-232;
Kirkpatrick, S., Gelatt, C.D., Vecch, M.P., Optimisation by simulated annealing
(1983) Science, 220 (4598), pp. 671-680;
Lee, D.-H., Cao, Z., Meng, Q., Scheduling of two-transtainer systems for loading
outbound containers in port container terminals with simulated annealing algorithm
(2007) International Journal of Production Economics, 107 (1), pp. 115-124., DOI
10.1016/j.ijpe.2006.08.003, PII S0925527306002155, Building Core-Competence Through
Operational Excellence;
Lin, S.-W., Chou, S.-Y., Chen, S.-C., Meta-heuristic approaches for minimizing
total earliness and tardiness penalties of single-machine scheduling with a common
due date (2007) Journal of Heuristics, 13 (2), pp. 151-165., DOI 10.1007/s10732-
006-9002-2;
Lin, S.W., Using simulated annealing to schedule a flowshop manufacturing cell with
sequence dependent family setup times (2009) International Journal of Production
Research, 47 (12), pp. 3205-3217;
Logendran, R.A., A workload based model for minimising total intercell and
intracell moves in cellular manufacturing (1990) International Journal of
Lozano, S., A one-step tabu search algorithm for manufacturing cell design (1999)
Journal of the Operational Research Society, 50 (5), pp. 509-516;
51 (2), pp. 53-57;
Metropolis, N., Equations of state calculations by fast computing machines (1953)
Journal of Chemical Physics, 21 (6), pp. 1087-1090;
Olivia-Lopez, E., Prucheck, G.F.K., Load balancing for group technology planning
and control (1979) International Journal of MTDR, 19 (2), pp. 259-274;
Sankaran, S., Multiple objective decision making approach to cell formation: A goal
programming model (1990) Mathematical Computer Modeling, 13 (9), pp. 71-82;
Review, evaluation and directions for future research (1998) Computers Industrial
Research, 31 (5), pp. 1133-1142;
manufacturing, Part II. An extension and comparison (1993) International Journal of
Singh, N., Design of cellular manufacturing system: An invited review (1993)
Srinvasan, G., Narendran, T., GRAFICS - A non-hierarchical clustering algorithm for
463-478;
Tiwari, M.K., Solving part-type and operation allocation problems in an FMS: An
approach using constraints-based fast simulated annealing algorithm (2006) IEEE
Transaction on System, Man and Cybernetics - Part A: Systems and Human, 36 (6), pp.
1170-1184;
2025-2044;
Vakharia, A.J., Kaku, B.K., An investigation of the impact of demand changes on a
cellular manufacturing system (1993) Decision Science, 24 (5), pp. 909-930;
Vakharia, A.J., Wemmerlö, V.U., A comparative investigation of hierarchical
pp. 1409-1421;
140-152
CORRESPONDENCE ADDRESS: Ying, K.-C.; Department of Industrial Engineering and
Management, National Taipei University of Technology, Taipei, Taiwan; email:
[email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Yin, Y.
35739337500;
The economic cell number
625-630. Cited 1 time.
68949216691&doi=10.1007%2fs00170-008-1854-
1&partnerID=40&md5=2f0dda955e5e7e3cf78f0a3f96a4145b
DOI: 10.1007/s00170-008-1854-1
AFFILIATIONS: Yamagata University, Yamagata, Japan
ABSTRACT: The economic benefits brought by the cellular manufacturing have been
reported. Cell formation is one of the most important problems in the design of a
cellular manufacturing. In cell formation problems, the number of cells is a
critical factor. However, it is impossible to know the number of cells before
solving the cell formation problem. In fact, determining the correct number of
cells in a cellular manufacturing system is still an unresolved problem. We
introduce a mathematical model in this paper to find the economic number of cells
(we call it "Economic Cell Number", ECN) that minimizes the total sum of intracell
and intercell movements costs without solving the cell formation problem. A
numerical example is used to verify the effectiveness of the proposed ECN. Although
the proposed simple model still cannot deal with many realistic cell formation
problems, it plays as a first attempt to find the economic number of cells. © 2008
Springer-Verlag London Limited.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Group technology
INDEX KEYWORDS: Cell formation; Cell formation problem; Cell number; Cellular
manufacturing systems; Critical factors; Economic benefits; In-cell; Intercell;
Numerical example; Simple model, Cell membranes; Cytology; Group technology;
Mathematical models, Cellular manufacturing
moves in group technology cell formation (2000) J Manuf Syst, 19, pp. 305-317;
Chakravorty, S.S., Hales, D.N., The evolution of manufacturing cells: An action
research study (2008) Eur J Oper Res, 188, pp. 153-168;
grouping in cellular manufacturing systems (2000) Int J Prod Res, 38, pp. 699-720;
561-569;
alternative cell locations and material transporters (2003) J Oper Res Soc, 54, pp.
1059-1075;
attractiveness of group technology cellular layouts (1990) Manage Sci, 36, pp.
1567-1578;
Nair, G.J.K., Narendran, T.T., CASE: A clustering algorithm for cell formation with
sequence data (1998) Int J Prod Res, 36, pp. 157-179;
Schaller, J., Incorporating cellular manufacturing into supply chain design (2008)
Int J Prod Res, 46, pp. 4925-4945;
formation applications (1989) Comput Ind Eng, 16, pp. 419-426;
Review, evaluation and directions for future research (1998) Comput Ind Eng, 34,
pp. 3-20;
manufacturing systems (1994) Manage Sci, 40, pp. 466-483;
in production flow analysis (1979) Proceedings 20th International Machine Tool
Design and Research Conference, pp. 525-532., Birmingham, UK, September;
problem (1995) J Oper Manag, 13, pp. 117-138;
pp. 29-49;
problem: A comparative investigation (2005) Comput Ind Eng, 48, pp. 471-489
CORRESPONDENCE ADDRESS: Yin, Y.; Yamagata University, Yamagata, Japan; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Belohlavek, R., Kulkarni, N., Vychodil, V.

7004351326;23011971700;9535306200;
A novel approach to cell formation
Artificial Intelligence and Lecture Notes in Bioinformatics), 5548 LNAI, pp. 210-
223. Cited 4 times.
3-642-01815-2_16&partnerID=40&md5=0236854bce54f441f758f6ec96e33c9a
DOI: 10.1007/978-3-642-01815-2_16
AFFILIATIONS: Dept. Systems Science and Industrial Engineering, T. J. Watson School
of Engineering and Applied Science Binghamton, University-SUNY, PO Box 6000,
Binghamton NY 13902-6000, United States;
Dept. Computer Science, Palacky University, Olomouc Tomkova 40, Olomouc CZ-779 00,
Czech Republic
ABSTRACT: We present an approach to the cell formation problem, known from group
technology, which is inspired by formal concept analysis. The cell formation
problem consists in allocating parts (objects) to machines (attributes), based on
the machine-part matrix. This can be viewed as forming groups consisting of a set
of parts and a set of machines. Such groups resemble formal concepts in the input
data. Due to the specific nature of the performance assessment in the cell
formation problem, good groups can be thought of as rectangles which, unlike those
corresponding to formal concepts, contain a few blanks, i.e. which are not full of
crosses in terms of formal concept analysis. Moreover, such groups need to be
disjoint both in terms of objects and attributes. In this paper, we present an
algorithm for the cell formation problem, experimental results, and a comparison to
some methods proposed in the literature. © Springer-Verlag Berlin Heidelberg 2009.
INDEX KEYWORDS: Cell formation; Cell formation problem; Formal Concept Analysis;
Formal concepts; Input data; matrix; Performance assessment; Specific nature, Cell
membranes; Cellular manufacturing, Group technology
3-21;
cellular manufacturing systems (1997) IIE Transactions, 29 (7), pp. 599-610;
Belarmino, A.-D., Lozano, S., Racero, J., Guerrero, F., Machine cell formation in
generalized group technology (2001) Computers & Industrial Engineering, 41 (2), pp.
227-240;
Belohlavek, R., Vychodil, V., Dense rectangles in object-attribute data (2006)
Proc. IEEE GrC 2006, IEEE International Conference on Granular Computing, pp. 586-
591., Atlanta, GA, May 10-12, IEEE Catalog Number 06EX1286, ISBN 1-4244-0133-X;
Carpineto, C., Romano, G., Concept Data Analysis (2004) Theory and Applications, ,
Wiley, Chichester;
manufacturing (1982) J. Manufacturing Systems, 1 (1), pp. 65-67;
Ganter, B., Wille, R., Formal Concept Analysis (1999) Mathematical Foundations, ,
on Systems, Man, and Cybernetics, 24 (2), pp. 203-215;
Khan, M.S.I., Bhaba, S.R., A similarity coefficient measure and machine-parts
Pearson, K., On Lines and Planes of Closest Fit to Systems of Points in Space
(1901) Philosophical Magazine, 2 (6), pp. 559-572;
Pillai, M.V., Subbarao, K., A robust cellular manufacturing system design for
Selim, H., Askin, R.G., Vakharia, A., Cell Formation in Group Technology: Review,
Evaluation, and Direction for Future Research (1998) Computers & Industrial
families problem in group technology (1990) Int. J. Production Research, 28 (1),
pp. 145-152;
principles (1985) Journal of Operations Management, 5 (2), pp. 151-167;
Vakharia, A.J., Method of cell formation in group technology: A framework for
evaluation (1986) Journal of Operations Management, 6 (3-4), pp. 257-271;
Wemmerlöv, U., Hyer, N.L., Cellular manufacturing in the U.S. industry: A survey of
users (1989) Int. Journal of Production Research, 27 (9), pp. 1511-1530;
in cellular manufacturing (2001) Computers & Industrial Engineering, 39, pp. 1-17
CORRESPONDENCE ADDRESS: Belohlavek, R.; Dept. Systems Science and Industrial
Engineering, T. J. Watson School of Engineering and Applied Science Binghamton,
University-SUNY, PO Box 6000, Binghamton NY 13902-6000, United States; email:
[email protected]
ISSN: 03029743
ISBN: 9783642018145
SOURCE: Scopus
Behret, H., Kahraman, C.

24605274600;7003388495;
A fuzzy clustering application in a cellular manufacturing system
(2008) World Scientific Proceedings Series on Computer Engineering and Information
Science 1; Computational Intelligence in Decision and Control - Proceedings of the
8th International FLINS Conference, pp. 1117-1122.
58049142567&partnerID=40&md5=44dfc13581d07be44ad6dc1f261f0618
AFFILIATIONS: Industrial Engineering Department, Istanbul Technical University,

Maçka Istanbul, 34367, Turkey
ABSTRACT: In this paper a fuzzy c-means (FCM) based cell formation (CF) algorithm
is used to design cellular manufacturing in a tractor manufacturing firm. In cell
formation problems as the size of the part-machine matrix increases the problem
gets complicated. Fuzzy models are suitable for CF problems by allowing the
representation of uncertain information. FCM based algorithms seem to be efficient
for cell formation problems at cellular manufacturing design.
INDEX KEYWORDS: Artificial intelligence; Clustering algorithms; Fuzzy clustering;
Fuzzy rules; Fuzzy systems; Intelligent control; Manufacture, Cell formation
problems; Cell formations; Cellular Manufacturing systems; Clustering applications;
Fuzzy c-means; Fuzzy models; In cells; Manufacturing firms; Uncertain informations,
REFERENCES: Gill, A., Bector, C.R., A fuzzy linguistic approach to data
quantification and construction of distance measures for the part family formation
problem (1997) Int. J Prod. Res, 35 (9), pp. 2565-2578;
Güngör, Z., Arikan, F., Application of fuzzy decision making in part-machine
grouping (2000) Int. J. Prod. Econ, 63, pp. 181-193;
mathematics (1989) Int. J Prod. Res, 27 (9), pp. 1637-1651;
(1991) Int. J Prod. Res, 29 (7), pp. 1475-1487;
Susanto, S., Kennedy, R.D., Price, W.H., A new fuzzy -c-means and assignment
technique based cell format ion algorithm to perform part -type clusters and
machine-type clusters separately (1999) Production Planning & Control, 10 (4), pp.
375-388;
Josien, K., Liao, T.W., Simultaneous grouping of parts and machines with an
cellular manufacturing (2007) Int. J. Prod. Res, 45 (5), pp. 1049-1062;
algorithm for cellular manufacturing (1986) Int. J. Prod. Res, 24, pp. 451-464
CORRESPONDENCE ADDRESS: Behret, H.; Industrial Engineering Department, Istanbul
Technical University, Maçka Istanbul, 34367, Turkey
ISBN: 981279946X; 9789812799463

ABBREVIATED SOURCE TITLE: World Sci. Proc. Ser. Comput. Eng. Inf. Sci.; Comput.
Intell. Decis. Control. - Proc. Int. FLINS Conf.
SOURCE: Scopus
Baykasoğlu, A., Topaloğlu, Ş., Şenyüzlüler, F.

7004171955;6603673626;57203435795;
Manufacturing cell formation with flexible processing capabilities and worker
assignment: Comparison of constraint programming and integer programming approaches
(2018) Proceedings of the Institution of Mechanical Engineers, Part B: Journal of
Engineering Manufacture, 232 (11), pp. 2054-2068. Cited 1 time.
85051695631&doi=10.1177%2f0954405416682281&partnerID=40&md5=aa5761bafb8cd10cca1c333
b6d9efcdf
DOI: 10.1177/0954405416682281
AFFILIATIONS: Department of Industrial Engineering, Faculty of Engineering, Dokuz
Eylül University, Izmir, Turkey
ABSTRACT: Cell formation deals with grouping of machines and parts in manufacturing
systems according to their compatibility. Manufacturing processes are surrounded
with an abundance of complex constraints which should be considered carefully and
represented clearly for obtaining high efficiency and productivity. Constraint
programming is a new approach to combinatorial optimization and provides a rich
language to represent complex constraints easily. However, the cell formation
problems are well suited to be solved by constraint programming approach since the
problem has many constraints such as part-machine requirements, availabilities in
the system in terms of capacity, machine and worker abilities. In this study, the
cell formation problem is modeled using machine, part processing and worker
flexibilities via resource element–based representation. Resource elements define
the processing requirements of parts and processing capabilities of machines and
workers, which are resource-independent capability units. A total of 12 case
problems are generated, and different search phases of constraint programming are
defined for the solution procedure. The cell formation problem is modeled in both
constraint programming and integer programming, and a comparative analysis of
constraint programming and integer programming model solutions is done. The results
indicate that both the models are effective and efficient in the solution of the
cell formation problem. © IMechE 2016.
AUTHOR KEYWORDS: Cellular manufacturing; constraint programming; flexibility;
group technology; resource elements
INDEX KEYWORDS: Cells; Combinatorial optimization; Computer programming; Constraint
theory; Cytology; Flexible manufacturing systems; Group technology; Integer
programming, Cell formation problem; Constraint programming; flexibility; Integer
programming models; Manufacturing cell formation; Manufacturing process; Processing
capability; Resource element, Cellular manufacturing
REFERENCES: Moon, Y.B., Forming part-machine families for cellular manufacturing: a
neural-network approach (1990) Int J Adv Manuf Tech, 5 (4), pp. 278-291;
Baykasoglu, A., Gindy, N.N.Z., MOCACEF 1.0: multiple objective capability based
Int J Prod Res, 38 (5), pp. 1133-1161;
Baykasoglu, A., Quantifying machine flexibility (2009) Int J Prod Res, 47 (15), pp.
4109-4123;
Dahel, N.E., Smith, S.B., Designing Flexibility into cellular manufacturing systems
(1993) Int J Prod Res, 31 (4), pp. 933-945;
cell formation (2012) Oper Res, 60 (5), pp. 1157-1166;
Browne, J., Dubois, D., Rathmill, K., Classification of flexible manufacturing
systems (1984) FMS Mag, 2, pp. 114-117;
Sethi, A.K., Sethi, S.P., Flexibility in manufacturing: a survey (1990) Int J Flex
Manuf Sys, 2 (4), pp. 289-328;
Bidanda, B., Ariyawongrat, P., Needy, K.L., Human related issues in manufacturing
cell design, implementation, and operation: a review and survey (2005) Comput Ind
Eng, 48 (3), pp. 507-523;
Gindy, N.N.Z., Ratchev, T.M., Case, K., Component grouping for cell formation using
resource elements (1996) Int J Prod Res, 34 (3), pp. 727-752;
Liang, F., Fung, R.Y.K., Coordination mechanism in real-time scheduling of virtual
cellular manufacturing systems (2016) Proc IMechE, Part B: J Engineering
Manufacture, 230 (3), pp. 534-547;
Baykasoglu, A., Uretim Ortamlarinin Fraktal Resmi: Kaynak Elemanlari Bakis Acisi
[Fractal picture of manufacturing environments: resource elements view] (2001)
Otomasyon, 2, pp. 134-140., (in Turkish;
cellular manufacturing systems (1997) IIE Trans, 29, pp. 599-610;
Goyal, M., (2005) Managing operational flexibility under demand uncertainty, ,
University of Pennsylvania, Philadelphia, PA, PhD Dissertation;
Cesani, V.I., Steudel, H.J., A study of labor assignment flexibility in cellular
manufacturing systems (2005) Comput Ind Eng, 48 (3), pp. 571-591;
Yue, H., Slomp, J., Molleman, E., Worker flexibility in a parallel dual resource
constrained job shop (2008) Int J Prod Res, 46 (2), pp. 451-467;
Hamedi, M., Esmaeilian, G.R., Ismail, N., Capability-based virtual cellular
manufacturing systems formation in dual-resource constrained settings using Tabu
Search (2012) Comput Ind Eng, 62 (4), pp. 953-971;
uncertain production requirements with presence of routing flexibility, , Virginia
Polytechnic Institute and State University, Blacksburg, VA, PhD Dissertation;
Aryanezhad, M.B., Delioo, V., Mirzapour Al-e-hashem, S.M.J., Dynamic cell formation
and the worker assignment problem: a new model (2009) Int J Adv Manuf Tech, 41 (3),
pp. 329-342;
formation: incorporation of machine flexibility and machine aggregation (2004) Proc
IMechE, Part B: J Engineering Manufacture, 218 (10), pp. 1279-1296;
Murali, R.V., Puri, A.B., Prabhakaran, G., Artificial neural networks based
predictive model for worker assignment into virtual cells (2010) Int J Eng Sci
Tech, 2 (1), pp. 163-174;
virtual cellular manufacturing system (2012) Int J Manag Sci Eng Manag, 7 (2), pp.
89-95;
Bagheri, M., Bashiri, M., A hybrid genetic and imperialist competitive algorithm
approach to dynamic cellular manufacturing system (2014) Proc IMechE, Part B: J
Engineering Manufacture, 228 (3), pp. 458-470;
parameters (2015) Int J Comp Integ M, 28 (3), pp. 251-265;
Norman, B.A., Tharmmaphornphilas, W., Needy, K.L., Worker assignment in cellular
manufacturing considering technical and human skills (2002) Int J Prod Res, 40 (6),
pp. 1479-1492;
Slomp, J., Chowdary, B.V., Suresh, N.C., Design of virtual manufacturing cells: a
mathematical programming approach (2005) Robot Cim: Int Manuf, 21 (3), pp. 273-288;
Mahdavi, I., Alaei, A., Paydar, M.M., Designing a mathematical model for dynamic
cellular manufacturing systems considering production planning and worker
assignment (2010) Comput Math Appl, 60 (4), pp. 1014-1025;
Mahdavi, I., Alaei, A., Paydar, M.M., A new mathematical model for integrating all
incidence matrices in multi-dimensional cellular manufacturing system (2012) J
Manuf Syst, 31 (2), pp. 214-223;
Soolaki, M., A multi-objective integrated cellular manufacturing systems design
with production planning, worker assignment and dynamic system reconfiguration
(2012) Int J Ind Syst Eng, 12 (3), pp. 280-300;
Bashiri, M., Bagheri, M., A two stage heuristic solution approach for resource
assignment during a cell formation problem (2013) Int J Eng Trans C: Asp, 26 (9),
pp. 943-954;
Süer, G.A., Kamat, K., Mese, E., Minimizing total tardiness subject to manpower
restriction in labor-intensive manufacturing cells (2013) Math Comput Model, 57 (3-
4), pp. 741-753;
Saidi-Mehrabada, M., Paydara, M.M., Aalaeib, A., Production planning and worker
training in dynamic manufacturing systems (2013) J Manuf Syst, 32 (2), pp. 308-314;
Mahdavi, I., Bootaki, B., Paydar, M.M., Manufacturing cell configuration

considering worker interest concept applying a bi-objective programming approach
(2014) Int J Ind Eng Prod Res, 25 (1), pp. 41-53;
cubic cell formation problem considering different worker skills (2014) Comput Ind
Eng, 75, pp. 31-40;
Sadeghi, S., Forghani, M.A., Seidi, M., Integrated dynamic cell formation with
operator assignment and inter-cell layout problems: a mathematical model (2017)
Proc IMechE, Part B: J Engineering Manufacture, 231 (9), pp. 1658-1669;
Mak, K.L., Ma, J., Production scheduling for virtual cellular manufacturing systems
with workforce constraints using a hybrid algorithm, 8, pp. 4445-4449., Proceedings
of the 6th international conference on natural computation (ICNC), Yantai, China,
New York, IEEE, In;
Soto, R., Kjellerstrand, H., Duran, O., Solving manufacturing cell design problems
using constraint programming (2012) Advanced research in applied artificial
intelligence, 7345, pp. 400-406., Jiang H., Ding W., Ali M., (eds), Berlin,
Springer, In:, (eds;
Soto, R., Kjellerstrand, H., Duran, O., Cell formation in group technology using
constraint programming and Boolean satisfiability (2012) Expert Syst Appl, 39 (13),
pp. 11423-11427;
Subhaa, R., Jawahar, N., ILOG CPLEX OPL modelling for machine cell formation (2013)
Int J Eng Tech, 5, pp. 3734-3741;
Smith, S.F., Is scheduling a solved problem? (2005) Multidisciplinary scheduling:
theory and applications, pp. 3-17., Kendall G., (ed), New York, Springer, In:, (ed;
Montanary, U., Networks of constraints: fundamental properties and applications to

picture processing (1974) Inform Sciences, 7, pp. 95-132;
Rousseau, L.M., Gendreau, M., Using constraint-based operators to solve the vehicle
routing problem with time windows (2002) J Heuristics, 8 (1), pp. 43-58;
Demassey, S., Pesant, G., Rousseau, L.M., Constraint programming based column
generation for employee timetabling (2005) Integration of AI and OR techniques in
constraint programming for combinatorial optimization, 3524, pp. 140-154., Barták
R., Milano M., (eds), Berlin, Springer, In:, (eds), (Problems lecture notes
computer science;
Mak, K.L., Ma, J., Cui, L.X., Integrated multi-period production scheduling and
cell formation for virtual cellular manufacturing systems (2011) Eng Lett, 19, pp.
316-324;
(2009) IBM ILOG OPL language user’s manual, , Armonk, NY, IBM Corp, version 6.3;
(2016), https://docs.oracle.com/javase/8/docs/api/java/util/Random.html#nextInt-
intCORRESPONDENCE ADDRESS: Baykasoğlu, A.; Department of Industrial Engineering,
Faculty of Engineering, Dokuz Eylül University, Tinaztepe Campus, Buca, Turkey;
PUBLISHER: SAGE Publications Ltd
ISSN: 09544054
CODEN: PIBME
ABBREVIATED SOURCE TITLE: Proc Inst Mech Eng Part B J Eng Manuf
SOURCE: Scopus
Kao, Y., Lin, J.-C., Wu, J.-K.

23034954300;16175647800;36148967600;
A differential evolution approach for machine cell formation
(2008) 2008 IEEE International Conference on Industrial Engineering and Engineering
Management, IEEM 2008, art. no. 4737974, pp. 772-775. Cited 5 times.
62749183639&doi=10.1109%2fIEEM.2008.4737974&partnerID=40&md5=1f860140d7c6154ac3f4a3
3f61ac0000
DOI: 10.1109/IEEM.2008.4737974
AFFILIATIONS: Dept. of Information Management, Tatung University, 104, Taipei,
Taiwan;
Dept. of Computer Science and Engineering, Tatung University, 104, Taipei, Taiwan
ABSTRACT: This paper presents a new approach based on differential evolution
algorithms to solve cell formation problems. The proposed approach handles the
problem in a way of data clustering and can form machine cells and part families
concurrently. Differential evolution is simple to implement and has fewer
parameters needed to set. The proposed approach applies differential evolution to
find machine cluster centers and part cluster centers at the same time. A number of
test problems had been selected from literature and the experimental results reveal
that the proposed approach is able to solve cell formation problems effectively. ©
2008 IEEE.
AUTHOR KEYWORDS: Cell formation; Differential evolution; Group technology
INDEX KEYWORDS: Cellular manufacturing; Clustering algorithms; Evolutionary
algorithms; Industrial engineering, Cell formation; Cell formation problems;
Cluster centers; Data clustering; Differential evolution; Differential evolution
algorithms; Machine cells; New approaches; Part families; Test problems, Group
technology
technology : Review, evaluation and directions for future research (1998) Computers
and Industrial Engineering, 34 (1), pp. 3-20;
Storn, R., Price, K., Differential Evolution - A simple and Efficient AdaDtive
Scheme for Global Optimization over Continuous Spaces, Technical Report, TR-95.012,
ICSI, 1995; Storn, R., Price, K., Differential evolution - A simple and efficient
heuristic for global optimization over continuous spaces (1997) Journal of Global
Optimization, 11 (4), pp. 341-359., Dec;
Kumar, C.S., Chandrasekharan, M.P., Grouping efficiency: A quantitative criterion
Paterlini, S., Krink, T., Using differential evolution to improve the accuracy of
bank rating systems (2007) Computational Statistics and Data Analysis, 52, pp. 68-
87;
Chan, H.M., Milner, D.A., Direct clustering algorithm for group Formation in
Research, 18, pp. 213-232;
S. M. Shafer and D. F. Rogers, Similarity and distance measures for cellular
manufacturing. Part II. An extension and comparison, International Journal of
Production Research, 31, p. p. 1315-1326, 1993; Zolfaghari, S., Liang, M., A new
genetic algorithm for the machine/part grouping problem involving processing times
and lot sizes (2003) Computers and Industrial Engineering, 45, pp. 713-731
CORRESPONDENCE ADDRESS: Kao, Y.; Dept. of Information Management, Tatung
University, 104, Taipei, Taiwan; email: [email protected]
ISBN: 9781424426300
ABBREVIATED SOURCE TITLE: IEEE Int. Conf. Ind. Eng. Eng. Manage., IEEM
SOURCE: Scopus
Kao, Y., Chen, C.-C.

23034954300;55251045900;
A differential evolution fuzzy clustering approach to machine cell formation
84880572042&doi=10.1007%2fs00170-012-4254-
5&partnerID=40&md5=2d734ec63a18af485dd3e16f1534f6f7
DOI: 10.1007/s00170-012-4254-5
Chungshan N. Rd., Taipei 104, Taiwan
ABSTRACT: Searching for similar parts and associated machines plays a crucial role
in machine cell design. The aim of this paper is to propose a new fuzzy clustering
method to solve machine cell formation problems in a fuzzy environment. Fuzzy c-
means (FCM) has been applied to machine cell formation problems. However,
performance of existing FCM algorithms depends highly on the initial states
(cluster centers or membership degrees). Additionally, the number of clusters
(machine cells) has to be provided beforehand. In practice, it is difficult for the
machine cell designer to select a proper set of initial states or to determine the
optimal number of machine cells before the overall machine cell configuration is
formed and the operational result is observed. In this paper, a new fuzzy
clustering approach combining differential evolution (DE) algorithms with FCM
formulas is proposed to overcome these deficiencies. The proposed DE-based fuzzy
clustering method can automatically determine the correct number of cells and
generate an optimal machine cell configuration at the same time. Experimental
results demonstrate that the proposed algorithm performs well in searching
solutions to the fuzzy machine cell formation problem with automatic cluster number
determination. © 2012 Springer-Verlag London Limited.
AUTHOR KEYWORDS: Cellular manufacturing; Differential evolution; Fuzzy cell
formation; Fuzzy clustering
INDEX KEYWORDS: Cell formation; Clustering approach; Differential Evolution;
Differential evolution algorithms; Fuzzy clustering method; Machine cell formation
problems; Membership degrees; Number of clusters, Cellular manufacturing;
Evolutionary algorithms; Fuzzy systems; Optimization, Fuzzy clustering
technology: Review, evaluation and directions for future research (1998) Comput Ind
Eng, 34 (1), pp. 3-20., 10.1016/S0360-8352(97)00147-2;
research (2010) Eur J Oper Res, 206, pp. 509-521., 1188.90002
10.1016/j.ejor.2009.10.020;
Zhang, C., Wang, H.P., Concurrent formation of part Families and machine cells
based on fuzzy set theory (1992) J Manuf Syst, 11 (1), pp. 61-67., 10.1016/0278-
6125(92)90018-B;
(1991) Int J Prod Res, 29 (7), pp. 1475-1487., 10.1080/00207549108948024;
cellular manufacturing systems (2001) Int J Adv Manuf Technol, 18 (8), pp. 591-
597., 10.1007/s001700170036;
10.1007/BF01225760;
Algorithms, , Plenum New York 0503.68069 10.1007/978-1-4757-0450-1;
objective functional clustering algorithms (1994) Int J Adv Manuf Technol, 9 (6),
pp. 390-397., 10.1007/BF01748484;
manufacturing (1997) Int J Prod Res, 35 (4), pp. 1077-1094., 0953.90512
10.1080/002075497195551;
type clusters separately (1999) Prod Plann Contr, 10 (4), pp. 375-388.,
10.1080/095372899233127;
Lozano, S., Dobado, D., Larrañeta, J., Onieva, L., Modified fuzzy c-means algorithm
for cellular manufacturing (2002) Fuzzy Set Syst, 126 (1), pp. 23-32., 0987.91506
10.1016/S0165-0114(01)00003-3;
Torkul, O., Cedimoglu, I.H., Geyik, A.K., An application of fuzzy clustering to
Chiu, S.L., Fuzzy model identification based on cluster estimation (1994) J Intell
Fuzzy Syst, 2 (3), pp. 267-278;
Gindy, N.N.Z., Ratchev, T.M., Case, K., Component grouping for gt applications - A
fuzzy clustering approach with validity measure (1995) Int J Prod Res, 33 (9), pp.
2493-2509., 0909.90153 10.1080/00207549508904828;
cellular manufacturing (2007) Int J Prod Res, 45 (5), pp. 1049-1062., 1128.90407
10.1080/00207540600634923;
family and machine cell formation (2000) Int J Prod Res, 38 (15), pp. 3513-3536.,
0963.90024 10.1080/002075400422770;
systems (2001) Comput Ind Eng, 39 (1-2), pp. 125-144., 10.1016/S0360-8352(00)00074-
7;
Zhao, L., Tsujimura, Y., Gen, M., Genetic algorithm for fuzzy clustering (1996)
Proceedings of IEEE International Conference on Evolutionary Computation, pp. 716-
719;
machine groups and part families (1998) Int J Prod Res, 36 (5), pp. 1325-1337.,
0947.90567 10.1080/002075498193345;
cell formation (2000) Int J Adv Manuf Technol, 16, pp. 491-497.,
10.1007/s001700070057;
problem involving processing times and lot sizes (2003) Comput Ind Eng, 45, pp.
713-731., 10.1016/j.cie.2003.09.003;
Pai, P.F., Chang, P.T., Lee, S.Y., Part-machine family formation using genetic
algorithms in a fuzzy environment (2005) Int J Adv Manuf Technol, 25, pp. 1175-
1179., 10.1007/s00170-003-1944-z;
997., 10.1007/s00170-003-1912-7;
cellular manufacturing systems (2008) Int J Adv Manuf Technol, 38, pp. 630-640.,
10.1007/s00170-007-1029-5;
grouping (2009) Comput Ind Eng, 56, pp. 347-356., 10.1016/j.cie.2008.06.007;
Expert Syst Appl, 36 (3), pp. 6598-6604., 10.1016/j.eswa.2008.07.054;
neighbourhood search to solve the cell formation problem (2012) Expert Syst Appl,
39 (3), pp. 2408-2414., 10.1016/j.eswa.2011.08.089;
the cell formation problem (2007) Comput Oper Res, 34 (7), pp. 2059-2079.,
1189.90210 10.1016/j.cor.2005.08.010;
Tunnukij, T., Hicks, C., An enhanced genetic algorithm for solving cell formation
problem (2009) Int J Prod Res, 47 (7), pp. 1989-2007., 10.1080/00207540701673457;
formulations of cell formation problems without presetting number of cells (2004) J
Intell Manuf, 15 (6), pp. 753-759., 10.1023/B:JIMS.0000042661.56171.bb;
Lin, S.W., Ying, K.C., Lee, Z.J., Part-machine cell formation in group technology
using a simulated annealing-based meta-heuristic (2010) Int J Prod Res, 48 (12),
pp. 3579-3591., 10.1080/00207540902896212;
Wu, T.H., Low, C., Wu, W.T., A tabu search approach for the cell formation problem
(2004) Int J Adv Manuf Technol, 23, pp. 916-924., 10.1007/s00170-003-1766-z;
grouping (2006) Robot Comput Integrated Manuf, 22, pp. 468-474.,
10.1016/j.rcim.2005.11.013;
Expert Syst Appl, 37, pp. 1563-1567., 10.1016/j.eswa.2009.06.061;
hybrid particle swarm optimization (2010) Int J Adv Manuf Technol, 47, pp. 745-
754., 10.1007/s00170-009-2202-9;
Kao, Y., Lin, J.C., Wu, J.K., A differential evolution approach for machine cell
formation (2008) Proceedings of 2008 IEEE International Conference on Industrial
Engineering and Engineering Management, pp. 772-775;
manufacturing cell formation problem using group based operators (2010) Expert Syst
Appl, 37 (7), pp. 4822-4829., 10.1016/j.eswa.2009.12.033;
machine-part cell formation problems (2010) Comput Oper Res, 37, pp. 2071-2081.,
1231.90407 10.1016/j.cor.2010.02.007;
Agrawal, A.K., Bhardwaj, P., Srivastava, V., Ant colony optimization for group
technology applications (2011) Int J Adv Manuf Technol, 55, pp. 783-795.,
10.1007/s00170-010-3097-1;
(2006) Int J Adv Manuf Technol, 28, pp. 1182-1189., 10.1007/s00170-004-2475-y;
(2008) Int J Prod Res, 46 (15), pp. 4237-4258., 1153.90398
10.1080/00207540601078054;
search for manufacturing cell formation (2009) Int J Adv Manuf Technol, 40 (3-4),
pp. 362-372., 10.1007/s00170-007-1346-8;
cell formation problems (2010) Eur J Oper Res, 205, pp. 346-360., 1188.90281
10.1016/j.ejor.2010.01.020;
Moghaddam, R.T., Aryanezhad, M.B., Safaei, N., Vasei, M., Azaron, A., A new
genetic algorithm (2007) J Intell Fuzzy Syst, 18, pp. 363-376., 1126.68674;
cell formation problem considering passive and active strategies (2008) Int J
Approx Reason, 47 (2), pp. 141-165., 2369563 1183.90145 10.1016/j.ijar.2007.03.003;
Storn, R., Price, K., Differential evolution - A simple and efficient adaptive
scheme for global optimization over continuous spaces (1995) Technical Report, TR-
95.012, , ICSI;
Storn, R., Price, K., Differential evolution - A simple and efficient heuristic for
global optimization over Continuous spaces (1997) J Glob Optim, 11 (4), pp. 341-
359., 1479553 0888.90135 10.1023/A:1008202821328;
J Prod Res, 28 (2), pp. 233-243., 10.1080/00207549008942706;
King, J.R., Nakornchai, V., Machine-component group formation in Group Technology:
Review and extension (1982) Int J Prod Res, 20 (2), pp. 117-133.,
10.1080/00207548208947754;
MACE (1984) Int J Prod Res, 22 (6), pp. 937-948., 10.1080/00207548408942513;
formation applications (1989) Comput Ind Eng, 16 (3), pp. 419-426., 10.1016/0360-
8352(89)90160-5;
technology problem (1992) Int J Prod Res, 30 (11), pp. 2633-2646.,
10.1080/00207549208948181;
Manuf Syst, 6 (2), pp. 117-124., 10.1016/0278-6125(87)90035-5;
(1991) Int J Prod Res, 29 (2), pp. 343-356., 10.1080/00207549108930075;
group technology (1986) IIE Trans, 18 (3), pp. 271-277., 10.1080/07408178608974704;

algorithm for cellular manufacturing (1986) Int J Prod Res, 24 (2), pp. 451-464.,
0582.90050 10.1080/00207548608919741;
clustering for group technology (1986) Int J Prod Res, 24 (5), pp. 1221-1233.,
10.1080/00207548608919798;
implementation (1985) Omega, 13 (5), pp. 381-391., 10.1016/0305-0483(85)90066-0;
cellular manufacture (1982) J Manuf Syst, 1 (1), pp. 65-75., 10.1016/S0278-
6125(82)80068-X;
configuration (1987) Int J Prod Res, 25 (1), pp. 101-113.,
10.1080/00207548708919825;
Stanfel, L.E., Machine clustering for economic production (1985) Eng Cost Prod
Econ, 9, pp. 73-81., 10.1016/0167-188X(85)90012-6;
reorganization by a clustering technique (1972) Oper Res, 20 (5), pp. 993-1009.,
0249.90046 10.1287/opre.20.5.993;
families problem in group technology (1990) Int J Prod Res, 28 (1), pp. 145-152.,
10.1080/00207549008942689;
using a rank order clustering algorithm (1980) Int J Prod Res, 18 (2), pp. 213-
232., 10.1080/00207548008919662;
(1973) Int J Prod Res, 11 (4), pp. 399-416., 10.1080/00207547308929988;
technology machine clustering problem (1985) Omega, 13 (6), pp. 577-583.,
10.1016/0305-0483(85)90046-5;
manufacturing systems (1986) Eur J Oper Res, 24, pp. 387-397., 10.1016/0377-
2217(86)90032-9;
manufacturing systems (1991) Int J Prod Res, 29 (10), pp. 2097-2116., 0729.90577
10.1080/00207549108948069;
1035-1052., 10.1080/00207548908942606;
formation of part-families and machines-cells (1987) Int J Prod Res, 25 (6), pp.
835-850., 0623.90030 10.1080/00207548708919880;
Res, 39 (1), pp. 1-19., 0976.90066 10.1080/00207540150208835
University, 40, Chungshan N. Rd., Taipei 104, Taiwan; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus

56235396300;7004884370;
Evolving similarity coefficients for the solution of cellular manufacturing
problems
(2000) Proceedings of the 2000 Congress on Evolutionary Computation, CEC 2000, 1,
art. no. 870355, pp. 617-624.
0033670643&doi=10.1109%2fCEC.2000.870355&partnerID=40&md5=8f4077b475985a7af36c61969
fe2e113
DOI: 10.1109/CEC.2000.870355
AFFILIATIONS: University of Sheffield, Department of Automatic Control and Systems
Engineering, Mappin Street, S1 3JD, Sheffield, United Kingdom
ABSTRACT: The cell formation problem is a classic manufacturing optimisation
problem associated with the implementation of a cellular manufacturing system. A
variety of hierarchical clustering procedures have been proposed for the solution
of this problem. Essential for the operation of a clustering procedure is the
determination of a form of similarity between the objects that are going to be
grouped. The authors employ a genetic programming algorithm for the evolution of
new similarity coefficients for the solution of simple cell formation problems.
Evolved coefficients are tested against the well-known Jaccard's similarity
coefficient on a large number of problems taken from the literature. © 2000 IEEE.
INDEX KEYWORDS: Genetic algorithms; Genetic programming; Hierarchical systems;
Optimization; Problem solving, Cell formation problem; Cellular manufacturing
problems; Clustering procedure; Genetic programming algorithms; Hier-archical
clustering; Optimisation problems; Similarity coefficients; Simple cell, Cellular
manufacturing, Evolved similarity coefficients; Hierarchical clustering
REFERENCES: Boctor, F.F., A linear formulation of the machine-part cell formation
problem (1991) Int.J. of Production Research, 29 (2), pp. 343-356;
manufacturing systems (1991) Int.J. of Production Research, 29 (10), pp. 2097-2116;
Burbidge, J.L., (1975) The Introduction of Group Technology, , Halste Press, John
Wiley, New York, U.S.A;
(1973) Int.J. of Production Research, 11 (4), pp. 399-416;
clustering for group technology (1986) Int.J. of Production Research, 24 (5), pp.
l221-1233;
formation of part families and machine-cells (1987) Int.J. of Production Research,
25 (6), pp. 835-850;
of binary data matrices for group technology (1989) Int.J. of Production Research,
27 (6), pp. 1035-1052;
Dimopoulos, C., Mort, N., A genetic programming methodology for the solution of the
cell formation problem (1999) Research Report Report no.759, , Department of
Automatic Control & Systems Engineering, University of Sheffield;
Transactions in Evolutionary Computation, in Print;
Koza, J.R., (1992) Genetic Programming: On the Programming of Computers by Means of
Natural Selection, , MIT Press, Cambridge;
Koza, J.R., (1994) Genetic Programming II: Automatic Discovery of Reusable
Programs, , MIT Press, Cambridge, 1994;
IntJ. of Production Research, 28 (2), pp. 603-612;
manufacturing (1987) IntJ. of Production Research, 25 (12), pp. 1715-1728;
397;
Lee, H., Garcia-Diaz, A., A network flow approach to solve clustering problems
(1993) Int.J. of Production Research, 31 (3), pp. 603-612;
51 (2), pp. 53-57;
Lending Library Translation, Boston Spa, Yorkshire, U.K;
survey and critical review (1999) IntJ. of Production Research, 37 (2), p. 385314;
Seifoddini, H., Single linkage vs average linkage clustering in machine cells
formation application (1989) Computers & Industrial Engineering, 16, pp. 419-426;
Singh, N., Cellular manufacturing systems: An invited review (1993) European
Sneath, P.H.A., The application of computers to taxonomy (1957) J.Of GenJVIicrob.,
17, pp. 201-206;
& Production Economics, 9, pp. 73-81

ABBREVIATED SOURCE TITLE: Proc. Congr. Evol. Comput., CEC
SOURCE: Scopus
Xie, X.
7402761532;
Manufacturing cell formation under capacity constraints
(1993) Applied Stochastic Models and Data Analysis, 9 (2), pp. 87-96. Cited 6
times.
0027612737&doi=10.1002%2fasm.3150090203&partnerID=40&md5=80ffa1422f629f41527d9a3c23
e73466
DOI: 10.1002/asm.3150090203
AFFILIATIONS: Inria, Technopole Metz 2000, 4 rue Marconi, Metz, 57070, France
ABSTRACT: The cell formation problem is addressed for a manufacturing system
containing groups of identical machines. Various part types are produced. The
manufacture of a part requires a sequence of operations and each operation can be
performed by any machine of a given type. The cell formation problem consists in
grouping machines into cells and assigning operations to machines so as to minimize
the intercell traffic while satisfying machine capacity constraints and other
technical constraints. An important feature of this problem is that machines of the
same type may be assigned to different cells. Since the problem is NP‐hard,
heuristic solutions are proposed and numerical experiences show that the proposed
algorithms lead to near‐optimal solutions. Copyright © 1993 John Wiley & Sons, Ltd
AUTHOR KEYWORDS: Cells; Layout; Machine capacity; Manufacturing systems
INDEX KEYWORDS: Algorithms; Computer aided manufacturing; Constraint theory;
Heuristic programming; Mathematical programming; Numerical methods; Optimization;
Scheduling, Cell formation problem; Cellular manufacturing layout; Group
technology; Heuristic algorithms; Machine capacity constraints; Manufacturing cell
design; Multiple routing problems; NP-hard problems, Flexible manufacturing systems
REFERENCES: Askin, R., Subramanian, S.B., A cost‐based heuristic for group
technology configuration (1987) Int J. Prod. Res., 25 (1), pp. 101-113;
Burbidge, J.L., (1975) The Introduction of Group Technology, , Wiley;
Carcia, H., Proth, J.M., A new cross‐decomposition algorithm: the GPM. Comparison
with the bond energy method (1986) Control and Cybernetics, 15 (2), pp. 155-164;
Hamann, T., Proth, J.M., Xie, X., Manufacturing cell formation with identical
machines: a simulated annealing approach (1991) Proc. 6th Conf. on CAD/CAM, ,
Robotics and Factories of the Future, London, August;
185-198;
Harhalakis, G., Proth, J.M., Xie, X., Manufacturing cell design using simulated
annealing: an industrial application (1990) J. of Intelligent Manufacturing, 1 (3),
pp. 185-191;
Hilger, J., Harhalakis, G., Proth, J.M., Manufacturing cells and part families:
generalization of the GP methods (1991) Information and Decision Technology, 17,
pp. 51-61;
King, J.R., Machine‐component grouping using ROC algorithm (1980) Int. J. Prod.
Res., 18 (2), pp. 213-231;
Kusiak, A., EXGT‐S a knowledge‐based system for group technology (1988) Int. J.
Prod. Res., 26 (1);
McAuley, J., (1972), pp. 23-57., ‘Machine grouping for efficient production’, The
Production Engineer, Feb; McCormick, W.T., Schweitzer, P.J., White, T.E., Problem
decomposition and data reorganization by a cluster technique (1972) Operation
Research, 20, pp. 993-1009;
Minis, I., Jajodia, S., Harhalakis, G., Manufacturing cell formation with multiple,
functionally identical machines (1990) Manufacturing Review, 1 (4), p. 3;
pp. 2243-2257
CORRESPONDENCE ADDRESS: Xie, X.; Inria, Technopole Metz 2000, 4 rue Marconi, Metz,
57070, France
ISSN: 87550024
ABBREVIATED SOURCE TITLE: Appl Stochastic Models Data Anal
SOURCE: Scopus
Mahdavi, I., Teymourian, E., Baher, N.T., Kayvanfar, V.

16417373200;36702181300;54906181800;36782445600;
An integrated model for solving cell formation and cell layout problem
simultaneously considering new situations
(2013) Journal of Manufacturing Systems, 32 (4), pp. 655-663. Cited 36 times.
84888347570&doi=10.1016%2fj.jmsy.2013.02.003&partnerID=40&md5=056dac3ea92fd5c524f96
bd7398679c7
DOI: 10.1016/j.jmsy.2013.02.003
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez
Ave., 15916-34311 Tehran, Iran
ABSTRACT: Cellular manufacturing system (CMS) is one of the group technology (GT)
usages. Among the necessary decisions for a successful CMS implementation, cell
formation problem (CFP) and cell layout problem (CLP) are two most popular ones.
The majority of past studies in CMS discussed on CFPs and some of those focused on
CLP ones. A few researchers solve the CPF and CLP simultaneously. In this paper, we
present a new integrated mathematical model considering cell formation and cell
layout simultaneously. The goal of our model is to group similar parts and
corresponding different machines in same cells. Machines sequence in each cell and
cell positions is also specified in the system. Moreover, our proposed model
considers forward and backtracking movements as well as new assumptions for
distances between cells using sequence data and production volume. One appropriate
adjusted measure from the literature and two new measures of performance for
evaluating solutions are defined. To validate the model, two well-known critical
benchmark examples are employed. Computational experiments demonstrate that our
proposal is a proficient model and show the effectiveness of our implementation. ©
2013 The Society of Manufacturing Engineers.
AUTHOR KEYWORDS: Backtracking movement; Cell formation problem (CFP); Cell layout
problem (CLP); Cellular manufacturing system (CMS); Integrated mathematical model
INDEX KEYWORDS: Backtracking movement; Cell formation; Cell formation problem; Cell
layout problem; Computational experiment; Integrated modeling; Measures of
performance; Production volumes, Cellular manufacturing; Cytology; Group
technology; Mathematical models, Cells
REFERENCES: Abue-Zeid, Buseif, I.M., Zaidi, G.M.E.L., Sequence and cost
considerations of materials flow in the design of cellular manufacturing systems
(2006) 7th Asia Pacific Industrial Engineering and Management Systems Conference, ,
17-20 December 2006, Bangkok, Thailand;
group technology cell formation (2000) Journal of Manufacturing Systems, 19 (5),
pp. 305-317;
Ariafar, S., Ismail, N., An improved algorithm for layout design in cellular
manufacturing systems (2009) Journal of Manufacturing Systems, 28, pp. 132-139;
a cellular manufacturing environment: A case study (2000) International Journal of
Bazargan-Lari, M., Kaebernick, H., Intra-cell and inter-cell layout designs for
cellular manufacturing (1996) International Journal of Industrial Engineering:
Theory Applications and Practice, 3, pp. 139-150;
Burbidge, J.L., Production flow analysis (1971) Production Engineering, 50, pp.
139-152;
Chan, T.S., Lau, K.W., Chan, L.Y., Lo, V.H.Y., Cell formation problem with
Chandrasekharan, M.P., Ragopalan, R., Zodiac, R., An algorithm for concurrent
production and transport systems (2003) Journal of Engineering Manufacture, 217
(7), pp. 883-897;
Hearago, S.S., Group technology and cellular manufacturing (1994) IEEE Transaction
on Systems, Man and Cybernetic, 2, pp. 203-215;
Jajodia, S., Minis, I., Harhalakis, G., Proth, J.M., CLASS: Computerized layout
solution using simulated annealing (1992) International Journal of Production
Research, 30 (1), pp. 95-108;
10 (2), pp. 93-108;
Kumar, C.S., Chandrasekharan, M.P., Grouping efficacy: A quantitative criterion f
or goodness of block diagonal forms of binary matrices in group technology (1990)
formation problems considering alternative part routes and machine sequence (2004)
and layout design using sequence data (2008) Robotics and Computer Integrated
Lending Library Translation, Boston Spa Yorks, UK;
Nair, G.J., Narendran, T., CASE: A clustering algorithm for cell formation with
Nouri, H., Tang, S.H., Hang, T.B.T., Anuar, M.K., BASE: A bacteria foraging
algorithm for cell formation with sequence data (2010) Journal of Manufacturing
Systems, 29, pp. 102-110;
27, pp. 19-25;
Park, S., Suresh, N.C., Performance of Fuzzy ART neural network and hierarchical
clustering for part-machine grouping based on operation sequences (2003)
Seifoddini, H., Duplication process in machine cells formation in Group Technology
(1989) IEE Transactions, 21, pp. 382-388;
2185-2207;
2043;
2755-2768;
Won, Y., Currie, K., An effective P-median model considering production factors in
machine cell/part family formation (2006) Journal of Manufacturing Systems, 25 (1),
pp. 58-64;
1409-1421;
production factors (2002) International Journal of Production Research, 40, pp.
885-906
[email protected]
ISSN: 02786125
CODEN: JMSYE
SOURCE: Scopus
Rabbani, M., Samavati, M., Ziaee, M.S., Rafiei, H.

57208701862;53664521100;56387307000;27967949000;
Reconfigurable dynamic cellular manufacturing system: A new Bi-objective
mathematical model
(2014) RAIRO - Operations Research, 48 (1), pp. 75-102. Cited 7 times.
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006314896&doi=10.1051%2fro
%2f2013054&partnerID=40&md5=4b6427a44cdbbce32099bc91e417c5d1
DOI: 10.1051/ro/2013054
AFFILIATIONS: School of Industrial and Systems Engineering, College of Engineering,
University of Tehran, North Kargar St., Tehran, 4563, Iran;
Faculty of Management, University of Tehran, Tehran, Iran
ABSTRACT: Dynamic Cell Formation Problem (DCFP) seeks to cope with variation in
part mix and demands using machine relocation, replication, and removing; whilst
from practical point of view it is too hard to move machines between cells or
invest on machine replication. To cope with this deficiency, this paper addresses
Reconfigurable Dynamic Cell Formation Problem (RDCFP) in which machine modification
is conducted instead of their relocation or replication in order to enhance machine
capabilities to process wider range of production tasks. In this regard, a mixed
integer nonlinear mathematical model is proposed, which is NP-hard. To cope with
the proposed model's intractability, an Imperialist Competitive Algorithm (ICA) is
developed, whose obtained results are compared with those of Genetic Algorithm's
(GA's), showing superiority and outperformance of the developed ICA. © EDP
Sciences, ROADEF, SMAI 2014.
AUTHOR KEYWORDS: Dynamic cell formation problem; Genetic algorithm; Imperialist
competitive algorithm; Machine modification; Reconfigurable cellular
manufacturing system
INDEX KEYWORDS: Cells; Cytology; Genetic algorithms; Manufacture; Optimization, Bi
objectives; Dynamic cell formation; Dynamic cellular manufacturing systems;
Imperialist competitive algorithm (ICA); Imperialist competitive algorithms;
Machine capabilities; Nonlinear mathematical model; Reconfigurable, Cellular
manufacturing
REFERENCES: Tompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A., (2003)
Facilities Planning, , Wiley, USA;
cellular manufacturing: A review and future research directions (2007) Eur. J.
Oper. Res., 177, pp. 281-309;
A dynamic model for a highly dynamic environment (1995) Comput. Ind. Eng., 29, pp.
221-225;
comprehensive model (2011) Int. J. Adv. Manuf. Technol, 53, pp. 11-34;
Manufacturing cell creation with Machine modification costs (2006) Comput. Oper.
Res., 33, pp. 1010-1032;
Koren, Y., Heisel, U., Jovane, F., Moriwaki, T., Pritschow, G., Ulsoy, G., Van
Brussel, H., Reconfigurable manufacturing systems (1999) Ann. CIRP, 48, pp. 1-14;
Mehrabi, M.G., Ulsoy, A.G., Koren, Y., Reconfigurable manufacturing systems: Key to
future manufacturing (2000) J. Intelligent Manuf., 11, pp. 403-419;
Grahl, C.L., Increasing efficiencies with synthetic dies (2001) Ceramic Ind., 151,
pp. 31-32;
Purcheck, G.F.K., A mathematical classification as a basis for the design of group
technology production cells (1974) Prod. Eng., 54, pp. 35-48;
pp. 561-569;
Wei, J.C., Gaither, N., A capacity constrained multi objective cell formation
method (1990) J. Manuf. Syst., 9, pp. 222-232;
flexible cell formation (1996) Prod. Plan. Control, 7, pp. 585-593;
solving an extended model of dynamic cellular manufacturing system (2008) Eur. J.
Oper. Res., 185, pp. 563-592;
formation design: Benders' decomposition approach (2011) Exp. Syst. Appl., 38, pp.
2478-2488;
pp. 561-569;
Mahdavia, I., Aalaei, A., Paydar, M.M., Solimanpur, M., Designing a mathematical
and worker assignment (2010) Comput. Math. Appl., 60, pp. 1014-1025;
Satoglu, S.I., Suresh, N.C., A goal-programming approach for design of hybrid
(2009) Comput. Ind. Eng., 56, pp. 560-575;
Uncertain Production Requirement With Presence of Routing Flexibility, , Ph.D.
dissertation, Blacksburg State, University of Virginia;
dynamic cell formation problem using metaheuristics (2005) Appl. Math. Comput.,
170, pp. 761-780;
approach (2007) Int. J. Adv. Manuf. Technol, 33, pp. 1001-1009;
Tavakkoli-Moghaddam, R., Safaei, N., Sassani, A., A new solution for a dynamic cell
formation problem with alternative routing and Machine costs using simulated
annealing (2008) J. Oper. Res. Soc., 59, pp. 443-454;
routing flexibility, Machine procurement, production planning and dynamic system
reconfiguration (2009) Int. J. Prod. Res., 47, pp. 1573-1600;
and the worker assignment problem: A new model (2009) Int. J. Adv. Manuf. Technol,
41, pp. 329-342;
Arkat, S.M.J., Abbasi, B., Applying simulated annealing to cellular manufacturing
system design (2007) Int. J. Adv. Manuf. Technol, 32, pp. 531-536;
problem (1997) Comput. Int. Eng., 32, pp. 169-185;
approach and a tabu search algorithm (2003) Int. J. Prod. Res., 41, pp. 2531-2546;
alternative cell locations and material transporters (2003) J. Oper. Res. Soc., 54,
pp. 1059-1075;
(2004) Int. J. Adv. Manuf. Technol, 23, pp. 916-924;
1419-1441;
Venugopal, V., Narendran, T.T., A genetic algorithm approach to the Machine
component grouping problem with multiple objectives (1992) Comput. Ind. Eng., 22,
pp. 469-480;
design and organization of manufacturing systems (2003) Comput. Ind. Eng., 44, pp.
339-364;
genetic-algorithm-based heuristic (2006) Int. J. Prod. Res., 44, pp. 2421-2444;
manufacturing design and layout (2007) Eur. J. Oper. Res., 181, pp. 156-167;
Yasuda, K., Hu, L., Yinza, Y., Grouping genetic algorithm for the multi-objective
cell formation problem (2005) Int. J. Prod. Res., 43, pp. 829-853;
Atashpaz-Gargari, E., Lucas, C., Imperialist competitive algorithm: An algorithm
for optimization inspired by imperialistic competition (2007) IEEE Cong. Evolut.
Comput., pp. 4661-4667., Singapore;
Sarayloo, F., Tavakkoli-Moghaddam, R., Imperialistic competitive algorithm for
solving a dynamic cell formation problem with production planning (2010) Adv.
Intell. Comput. Theor. Appl., 6215, pp. 266-276;
Talbi, E.G., (2009) Metaheuristic from Design to Implementation, , John Wiley &
Sons Publisher: USA
PUBLISHER: EDP Sciences
ISSN: 03990559
ABBREVIATED SOURCE TITLE: RAIRO Oper. Res.
SOURCE: Scopus
Zhang, Q., Liu, B., Ma, B., Wu, S., He, Y.

35316561600;57196891286;55434960100;56161521200;55498929200;
A cooperative coevolution UMDA for the machine-part cell formation
(2010) Communications in Computer and Information Science, 105 CCIS (PART 1), pp.
407-414.
3-642-16336-4_54&partnerID=40&md5=f3d27165f87ecc32a918d584186a5c2c
DOI: 10.1007/978-3-642-16336-4_54
AFFILIATIONS: Shijiazhuang Institute of Railway Technology, Shijiazhuang 050041,
China;
Hebei Academy of Sciences, Shijiazhuang 050081, China
ABSTRACT: The machine-part cell formation is a NP- complete combinational
optimization problem in cellular manufacturing system. Past research has shown that
although the genetic algorithm (GA) can get high quality solutions, special
selection strategy, crossover and mutation operators as well as the parameters must
be defined previously to solve the problem efficiently and flexibly. The Estimation
of Distribution Algorithms (EDAs) can get the same or better solutions with less
operators and parameters, but the EDAs need more function evaluations than that of
the GA. In this paper, a Cooperation Coevolution UMDA is proposed to solve the
machine-part cell formation problem. Simulation results on six well known problems
show that the Cooperation Coevolution UMDA can solve the machine-part cell
formation problem more effectively and efficiently. © Springer-Verlag 2010.
AUTHOR KEYWORDS: Cooperative coevolution; Grouping efficacy; Machine-part cell
formation; UMDA
systems; Co-evolution; Combinational optimization; Cooperative co-evolution;
Crossover and mutation; Estimation of distribution algorithms; Grouping efficacy;
High-quality solutions; NP Complete; Selection strategies; Simulation result; UMDA,
Cellular manufacturing; Function evaluation; Genetic algorithms; Mathematical
operators; Parameter estimation, Problem solving
REFERENCES: Joines, J.A., Culbreth, C.T., King, R.E., Manufacturing cell design: An
integer programming model employing genetic algorithms (1996) IIE Transactions, 28,
pp. 69-85;
Gonalves, J.F., Resende, M.G.C., An evolutionary algorithm for manufacturing cell
3651-3670;
Salehi, M., Tavakkoli-Moghaddam, R., A grouping genetic algorithm for the cell
formation problem (2009) International Journal of Natural and Engineering Sciences,
3 (1), pp. 67-71;
Zhang, Q., Liu, B., Bi, L., Estimation of Distribution Algorithms for the Machine-
Part Cell Formation (2009) LNCS, 5821, pp. 82-91., Advances in Computation and
Intelligence. Springer, Heidelberg;
Mühlenbein, H., Paaß, G., From Recombination of Genes to the Estimation of
Distributions I. Binary Parameters (1996) LNCS, 1141, pp. 178-187., Ebeling, W.,
Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. Springer,
Heidelberg;
Etxeberria, R., Larrañaga, P., Global optimization using Bayesian networks (1999)
Second Symposium on Artificial Intelligence, pp. 332-339., Rodriguez, A.A.O.,
Ortiz, M.R.S., Hermida, R.S. (eds.);
Chen, Y.-P., Lim, M.-H., (2008) Linkage in Evolutionary Computation, , Springer,
Heidelberg;
Potter, M., De Jong, K., A cooperative coevolutionary approach to function
optimization (1994) LNCS, 866, pp. 249-257., Davidor, Y., Männer, R., Schwefel, H.-
P. (eds.) PPSN 1994. Springer, Heidelberg;
Krasnogor, N., Melin-Batista, B., Moreno-Prez, J.A., Nature Inspired Cooperative
Strategies for Optimization (NICSO 2008) (2009) Studies in Computational
Intelligence;
Kumar, C.S., Chandrasekharan, M.P., Grouping efficacy: A quantities criterion for
Yang, Z., Tang, K., Yao, X., Large scale evolutionary optimization using
cooperative coevolution (2008) Information Sciences, 178, pp. 2985-2999;
Van Den Bergh, F., Engelbrecht, A.P., A cooperative approach to particle swarm
optimization (2004) IEEE Transactions on Evolutionary Computation, 8 (3), pp. 225-
239;
Lima, C.F., Pelikan, M., Goldberg, D.E., Influence of selection and replacement
strategies on linkage learning in BOA (2007) IEEE Congress on Evolutionary
Computation CEC 2007, Singapore, pp. 1083-1090
CORRESPONDENCE ADDRESS: Zhang, Q.; Shijiazhuang Institute of Railway Technology,
Shijiazhuang 050041, China; email: [email protected]
ISSN: 18650929
ISBN: 3642163351; 9783642163357
ABBREVIATED SOURCE TITLE: Commun. Comput. Info. Sci.
SOURCE: Scopus
Susanto, S., Al-Dabass, D., Bhattacharya, A.

16032542500;6603431045;7402635256;
Optimised cell formation algorithm considering sequence of operations, alternative
routing and part-volume
(2009) Proceedings - 2009 3rd Asia International Conference on Modelling and
Simulation, AMS 2009, art. no. 5071962, pp. 79-84. Cited 2 times.
70349740791&doi=10.1109%2fAMS.2009.145&partnerID=40&md5=26a63d50926be310427ff3b81cb
2b47f
DOI: 10.1109/AMS.2009.145
AFFILIATIONS: Department of Industrial Engineering, Faculty of Industrial
Technology, Parahyangan Catholic University, Jl. Ciumbuleuit 94, Bandung-40141,
Indonesia;
School of Computing and Informatics, Nottingham Trent University, Nottingham, NG11
8NS, United Kingdom;
Enterprise Process Research Centre (EPRC), School of Mechanical and Manufacturing
Engineering, Dublin City University, Glasnevin, Dublin 9, Ireland
ABSTRACT: A novel cell formation algorithm has been introduced in this paper. The
motivation of the research is the lack of attention in important information, e.g.,
production demand (or part-volume), in the most of the cell formation techniques.
For example, one of the crucial steps in the design of a cellular manufacturing
system is the cell formation problem, which involves grouping the parts into part
families and machines into machine groups. It has been found that 80% of the cell
formation problems consider only 0-1 (binary) machine-part incidence matrix that
ignores the sequence of operations in manufacturing parts. Further, literature
reveals that only a few studies consider alternative routing. In order to cope with
this situation a new cell formation algorithm, considering the factors sequence of
operation, alternative routing and part-volume, is introduced. © 2009 IEEE.
INDEX KEYWORDS: Cell formation; Cell formation algorithms; Cell formation problem;
Cellular manufacturing systems; Incidence matrices; Part family; Production demand,
Bioinformatics; Cell membranes; Machine design; Routing algorithms, Cellular
manufacturing
REFERENCES: Chu, C.-H., Recent advances in mathematical programming for cell
formation (1995) Planning, design, and analysis of cellular manufacturing systems,
pp. 3-46., Eds. Kamrani, A.K, H.R. Parsaei, and D.H. Liles, Elsevier Science B.V,
Amsterdam, The Netherlands;
pp. 135-149;
machine groups and part families (1998) International journal of Production
Research, 36 (5), pp. 1325-1337;
10 (2), pp. 93-108;
Vitanov, V., Tjahjono, B., Marghalany, I., A decision support tool to facilitate
the design of cellular manufacturing layouts (2007) Computers & Industrial
Beaulieu, A., Gharbi, A., Kadi, A., An algorithm for the cell formation and the
machine selection problems in the design of a cellular manufacturing system (1997)
Kaebernick, H., Bazargan-Lari, M., An integrated approach to the design of cellular
manufacturing (1996) Annals of the ClRP, 45 (1), pp. 421-425;
2347
CORRESPONDENCE ADDRESS: Susanto, S.; Department of Industrial Engineering, Faculty
of Industrial Technology, Parahyangan Catholic University, Jl. Ciumbuleuit 94,
Bandung-40141, Indonesia; email: [email protected]
ISBN: 9780769536484
ABBREVIATED SOURCE TITLE: Proc. Asia Int. Conf. Model. Simul., AMS
SOURCE: Scopus
Mahdavi, I., Fallah-Alipour, K., Javadi, B., Shirazi, B., Slomp, J.

16417373200;16416575600;16417433500;23026468100;6603677460;
Designing a new mathematical model for cell formation in CMS using sequence data
1, pp. 549-555. Cited 1 time.
84886043299&partnerID=40&md5=2a12fc704598c176a99c114f508c46d2

Science and Technology, Iran;
Faculty of Management and Organization, University of Groningen, Netherlands
ABSTRACT: Cell formation problem in Cellular Manufacturing System (CMS) design has
derived the attention of the researchers for more than three decades. However, use
of sequence data for cell formation has been a least researched area. Sequence data
provides valuable information about the flow patterns of various jobs in a
manufacturing system. This paper presents a mathematical model to solve a cell
formation problem based on sequence data in CMS. The objective is to minimize the
total costs of inter and intra-cell movements costs. This model depends on the
attitude of the decision maker towards the minimum utilization level of each cell
in such a way that the part-machine grouping can be changed significantly. Two
examples from the literature are solved by the LINGO software package to validate
and verify the proposed model. Finally, computational results are reported and
analyzed.
AUTHOR KEYWORDS: Cell formation; Cell utilization; CMS; Intra/inter-cell
movement; Mathematical model
INDEX KEYWORDS: Cell formation; Cell formation problem; Cell utilizations; CMS;
Computational results; Intra/inter-cell movement; New mathematical model; Part-
machine grouping, Cells; Cytology; Industrial engineering; Mathematical models;
Software packages, Cellular manufacturing
formation of manufacturing cells (2005) Computer and Industrial Engineering, 48,
pp. 3-21;

Research, 25, pp. 639-665;
Economics, , Article in press;
Kiang, M.Y., Kulkarni, U.R., Tam, K.Y., Selforganizing map network as an
interactive clustering tool - An application to group technology (1995) Decision
Support Systems, 15, pp. 351-374;
Lee, S.-D., Chen, Y.-l., A weighted approach for cellular manufacturing design:
Minimizing inter-cell movement and balancing workload among duplicate machines
Park, S., Suresh, N.C., Performance of fuzzy ART neural network and hierarchical
clustering for part- machine grouping based on operation sequences (2003)
Sarker, B.R., Xu, Y., Operation sequences-based cell formation methods: A critical
Suresh, N.C., Slomp, J., Kaparthi, S., Sequencedependent clustering of parts and
machines: A Fuzzy ART neural network approach (1999) International Journal of
pp. 84-97;
Wang, S., Sarker, B.R., Locating cells with bottleneck machines in cellular
403-424;
Wemmerlov, U., Hyer, N.L., Procedures for the part-family/machine group
Management, 6 (2), pp. 125-147;
2755-2768;
algorithms and tabu search for solving binary and comprehensive machine grouping
problems (2002) International Journal of Production Research, 40, pp. 2141-2158
of Science and TechnologyIran
ISBN: 9781627486811
SOURCE: Scopus
Nunkaew, W., Phruksaphanrat, B.

36662751600;6507608358;
Lexicographic fuzzy multi-objective model for minimisation of exceptional and void
elements in manufacturing cell formation
times.
84893979801&doi=10.1080%2f00207543.2013.843801&partnerID=40&md5=72feb263674684bb6f7
825138b15d7ae
DOI: 10.1080/00207543.2013.843801
AFFILIATIONS: Faculty of Engineering, Department of Industrial Engineering,
Thammasat University, Klongluang, Thailand
ABSTRACT: This research proposes a lexicographic fuzzy multi-objective model based
on perfect grouping for concurrent solving the part-family and machine-cell
formation problems in a cellular manufacturing system. New simplified mathematical
expressions of exceptional and void elements are proposed, opposing conventional
quadratic and absolute functions. The main objectives of the proposed solution
model, that is, the minimisation of both the number of exceptional elements and the
number of void elements is defined by fuzzy goals as pre-emptive ordering. A
lexicographic fuzzy goal model is developed to enhance cell performance and machine
utilisation simultaneously. A satisfactory efficient solution can easily be
obtained, and alternative solutions can also be generated by capturing flexibility
of the proposed fuzzy multi-objective programming model. The formulated model can
be solved by existing integer programming solvers. Finally, the evaluation of cell
formation problems is briefly discussed to show the performance of the proposed
model. © 2013 Taylor & Francis.
AUTHOR KEYWORDS: exceptional elements; lexicographic fuzzy multi-objective model;
manufacturing cell formation problem; perfect grouping; void elements
REFERENCES: Abo-Sinna, M.A., Amer, A.H., Ibrahim, A.S., Extensions of topsis for
large scale multi-objective non-linear programming problems with block angular
structure (2008) Applied Mathematical Modelling, 32, pp. 292-302;
Adenso-Diaz, B., Lozano, S., Eguia, J., Part-machine grouping using weighted
similarity coefficients (2005) Computers and Industrial Engineering, 48, pp. 553-
570;
227-240;
manufacturing cells (2005) Computers & Industrial Engineering, 48, pp. 3-21;
formation problem (2012) Applied Mathematical Modelling, 36, pp. 5091-5100;
Arkat, J., Farahani, M.H., Ahmadizar, F., Multi-objective genetic algorithm for
cell formation problem considering cellular layout and operations scheduling (2012)
Boctor, F.F., A linear formation of the machine-part cell formation problem (1991)
manufacturing cell formation problem (2006) Computer & Operations Research, 33, pp.
2219-2245;
Burbidge, J.L., (1975) The Introduction of Group Technology, , New York: Wiley;
Research, 24 (2), pp. 454-464;
Research, 24 (5), pp. 1221-1233;
properties of self organizing map in machine-part cell formation (2012) Applied
Soft Computing, 12, pp. 600-610;
Chen, C.T., Extensions of the topsis for group decision-making under fuzzy
environment (2000) Fuzzy Sets and Systems, 114, pp. 1-9;
pp. 293-318;
for manufacturing optimization: Problem, solutions, and comparisons (2000) IEEE
4038-4045;
Fallahalipour, K., Mahdavi, I., Shamsi, R., Paydar, M.M., An efficient algorithm to
solve utilization-based model for cellular manufacturing systems (2011) Journal of
Industrial and Systems Engineering, 4 (4), pp. 209-223;
Fallahalipour, K., Shamsi, R., A mathematical model for cell formation in cms using
sequence data (2008) Journal of Industrial and Systems Engineering, 2 (2), pp. 144-
153;
Hannan, E.L., On fuzzy goal programming (1981) Decision Sciences, 12, pp. 522-531;
2079;
King, J.R., Machine-component group formation in group technology (1980) Omega, 8
(2), pp. 193-199;
Research, 18 (2), pp. 213-232;
pp. 117-133;
Kusiak, A., The part families problem in flexible manufacturing system (1985)
pp. 2633-2646;
Li, Y.J., Hwang, C.L., (1994) Fuzzy Multiple Objective Decision Making: Methods and
Applications, , Great Britain: Springer;
1014-1025;
Mahdavi, I., Javadi, B., Fallahalipour, K., Slomp, J., Designing a new mathematical
Export Systems with Applications, 36, pp. 6598-6604;
Mahdavi, I., Paydar, M.M., Solimanpur, M., Saidi-Mehrabad, M., A mathematical model
for integrating cell formation problem with machine layout (2010) International
Journal of Industrial Engineering & Production Research 21 (, 2, pp. 61-70;
923-1009;
Mukattash, A., Al-Ghandoor, A., Samhouri, M., Ashhab, M.S., A modified similarity
coeffcient measure for cell formation using a correlation analysis approach (2011)
European Journal of Scientific Research, 65 (1), pp. 38-44;
Nunkaew, W., Phruksaphanrat, B., Part-families and machine-cells formation with
duplicated machines using lexicographic fuzzy multi-objective programming model
(2013) Journal of Applied Operational Research, 5 (3), pp. 105-112;
Nunkaew, W., Phruksaphanrat, B., A fuzzy goal programming for a multi-depot
distribution problem (2010) IAENG Transactions on Engineering Technologies, 5, pp.
192-206., edited by S. Ao, A. H. Chan, H. Katagiri, and L. Xu, . College Park, MD:
American Institute of Physics;
Nunkaew, W., Phruksaphanrat, B., Fuzzy multi-objective cell formation model for
cellular manufacturing system (2011) IAENG Transactions on Engineering Technologies
Volume, 7, pp. 174-187., edited by S. Ao, A. H. Chan, H. Katagiri, and L. Xu,
Singapore: World scientific;
Nunkaew, W., Phruksaphanrat, B., Fuzzy multi-objective assignment model for
manufacturing cell formation with duplicated machines (2012) Proceedings of the 4th
International Conference on Applied Operational Research, pp. 107-115., Bangkok
Thailand;
Offodile, O.F., Assignment model formulation of the machine cell formation problem
in cellular manufacturing (1992) International Journal of Operations and Production
Management, 13 (10), pp. 49-59;
using neural networks (2009) Computers & Industrial Engineering, 56, pp. 1340-1347;

Paydar, M.M., Mehrabad, M.S., A hybrid genetic-variable neighborhood search
Paydar, M.M., Sahebjamnia, N., Designing a mathematical model for cell formation
problem using operation sequence (2009) Journal of Applied Operational Research, 1,
pp. 30-38;
Phruksaphanrat, B., Ohsato, A., Satisfactory efficient linear coordination method
for multi-objective linear programming problem with convex polyhedral preference
functions (2003) IEEJ Transactions on Electronics, Information and Systems, 15 (9),
pp. 1653-1662;
Phruksaphanrat, B., Ohsato, A., Linear coordination method for fuzzy multi-
objective linear programming problems with convex polyhedral membership functions
(2004) International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
12 (, 3, pp. 269-285;
Shiyas, C.R., Pillai, V.M., A non-linear programming model for the machine grouping
and a genetic algorithm based solution methodology (2012) International Journal of
Sivaprakasam, R., Selladurai, V., A memetic algorithm approach for minimizing
exceptional elements in cell formation (2008) Asian Journal of Scientific Research,
1 (2), pp. 138-145;
Song, S., Hitomi, K., Gt cell formation for minimizing the intercell parts flow
Research, 32 (9), pp. 2149-2158;
463-478;
Tavakkoli-Moghaddam, R., Ghodratnama, A., Makui, A., Khazaei, M., Solving a new bi-
objective model for a cell formation problem considering labor allocation by
multiobjective particle swarm optimization (2011) IJE Transactions a: Basics, 24
(3), pp. 249-258;
scatter search (2012) Journal of Intelligent Manufacturing, 23, pp. 1127-1139;
Vin, E., Delit, P., Delchambre, A., A multiple-objective grouping genetic algorithm
for the cell formation problem with alternative routings (2005) Journal of
families in cellular manufacturing (1998) Computers Industrial Engineering, 35, pp.
81-84;
manufacturing: A linear integer programming approach (1994) Proceedings of IEEE
International Conference on Industrial Technology, pp. 350-354., Guangzhou;
median model and comparative study (1997) International Journal of Production
Research, 35 (5), pp. 1259-1286;
2053-2062;
Won, Y., Currie, K.R., An effective p-median model considering production factors
in machine cell/part family formation (2006) Journal of Manufacturing Systems, 25
(1), pp. 58-64;
Won, Y., Lee, K.C., Modified p-median approach for efficient gt cell formation
pp. 1609-1617;
Wu, X., Chu, C.H., Wang, Y., Yan, W., Concurrent design of cellular manufacturing
systems: A genetic algorithm approach (2006) International Journal of Production
Research, 44 (6), pp. 1217-1241;
artificial intelligence (ai) methods for designing and analysis of reconfigurable
cellular manufacturing system (rcms) (2009) 2nd International Conference on
Adaptive Science & Technology, Accra, pp. 402-409;
modified art1 method (2008) European Journal of Operational Research, 188, pp. 140-
152;
Yoon, K.P., Hwang, C.L., (1995) Multiple Attribute Decision Making: An
Introduction, , Thousan Oaks, CA: Sage;
Zadeh, L.A., Fuzzy sets (1965) Information and Control, 8 (3), pp. 338-353;
Zimmermann, H.J., (1991) Fuzzy Set Theory and Its Applications, , Boston, MA:
Kluwer Academic
CORRESPONDENCE ADDRESS: Nunkaew, W.; Faculty of Engineering, Department of
Industrial Engineering, Thammasat University, Klongluang, Thailand; email:
[email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Dixit, A.R., Mishra, P.K.

35789896200;7203045062;
Cell formation considering real-life production parameters
(2010) International Journal of Manufacturing Technology and Management, 20 (1-4),
pp. 197-221. Cited 5 times.
77953896239&partnerID=40&md5=ccbae6a234e7e5e5de1b242a2943b681
AFFILIATIONS: Department of Mechanical Engineering and Mining Machinery
Engineering, Indian School of Mines University, Dhanbad-826004, Jharkhand, India;
Department of Mechanical Engineering, M.N.N.I.T., Allahabad, Uttar Pradesh, India
ABSTRACT: Cell formation problem (CFP) consists of identifying machine groups and
part families in cellular manufacturing system. A large number of papers on cell
formation have been published so far, but very few of them have incorporated
operation sequence in inter-cell movement calculations while considering production
volume, batch size and material handling capacity, processing time, setup time,
machine capacity and allocating units of identical machines into different cell
with balanced workload. Considerations of these important parameters make the cell
formation problem complex but more realistic. The paper describes a solution
methodology (algorithm) for the problem of cell formation to minimise the total
inter-cell movements and allocate the duplicate machines to appropriate cells such
that the workload is uniform on the machines. The computational procedure of the
algorithm has been illustrated by an example. Numerical results indicate that the
proposed methodology is flexible, efficient and effective even for industrial
problems. © 2010 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Cellular manufacturing systems; Duplicate machines; Exceptional
element; Inter-cell movement; Operation sequence; Void
INDEX KEYWORDS: Balanced work-load; Batch sizes; Cell formation; Cell formation
problem; Cell movement; Cellular manufacturing systems; Computational procedures;
Exceptional elements; Identical machines; Industrial problem; Material handling;
Numerical results; Operation sequences; Part family; Processing Time; Production
parameters; Production volumes; Set-up time; Solution methodology, Cells; Cytology;
Materials handling; Numerical analysis, Cellular manufacturing
REFERENCES: Adenso-Diaz, B., Lozano, S., Eguia, I., Part-machine grouping using
weighted similarity coefficients (2005) Computers and Industrial Engineering, 48,
pp. 553-570;
Askin, R.G., Subramanian, P.S., Cost-based heuristic for group technology
(2001) Integrated Manufacturing Systems, 12, pp. 258-274;
Burbidge, J.L., Production flow analysis (1971) Production Engineer, 50 (4-5), p.
139;
Burke, L.I., Kamal, S., Fuzzy art and cellular manufacturing (1992) Artificial
Neural Networks in Engineering, pp. 779-1184;
37;
Carpenter, G.A., Grossberg, S., A massive architecture for a self organizing neural
pattern recognition (1987) Computer Vision, Graphics Image Processing, pp. 54-115;
Chen, C.L., Contruvo, N.A., Baek, W., A simulated annealing solution to the cell
2601-2614;
cellular manufacturing system (2006) International Journal of Production Economics,
103, pp. 767-783;
Dixit, A.R., Mishra, P.K., Machine-cell formation using genetic algorithm (2004)
National Conference on Advance Manufacturing and Robotics held at Central
Mechanical Engineering Research Institute, , West Bangal, India;
Dobando, D., Lozano, S., Bueno, J.M., Larraneta, J., Cell formation using a fuzzy
min-max neural network (2002) International Journal of Production Research, 40 (1),
pp. 93-107;
Gupta, T., Seifoddini, H., Production databased similarity coefficient for machine-
component grouping decision in the design of a cellular manufacturing system (1990)
Gupta, Y.P., Gupta, M.C., Kumar, A., Sundaram, C., Minimising total intercell and
intracell moves cellular manufacturing system: A genetic algorithm approach (1995)
Gupta, Y.P., Gupta, M.C., Kumar, A., Sundaram, C., A genetic algorithm based
approach to cell composition and layout design problem (1996) International Journal
Harhalakis, G., Nagi, R., Proth, J.M., Manufacturing cell formation under random
Harhalakis, G., Nagi, R., Xie, X.L., Manufacturing cell Design using simulated
annealing: An industrial application (1990) Journal of Intelligent Manufacturing,
1-8;
1715-1728;
Kusiak, A., Chow, W.S., Efficient solving of the group technology (1987) Journal of
Minimising intercell movements and balancing workload among duplicated machines
Lozano, S., Canca, D., Gurrreo, F., Garcia, J.M., Machine grouping using sequence-
based similarity coefficients and neural network (2001) Robotics and Computer
Muruganandam, A., Prabharan, G., Asokan, P., Baskaran, V., A memetic algorithm
approach to the cell formation problem (2005) International Journal of Advance
Nair, G.J., Narender, T.T., CASE: A clustering algorithm for cell formation with

Peker, A., Kara, Y., Parameter setting of the fuzzy art neural network to part-
42 (6), pp. 1257-1278;
Rajamani, D., Singh, N., Aneja, Y.P., Design of cellular manufacturing systems
Sarker, B.R., Xu, Y., Operation sequences-based formation methods: A critical
2185-2207;
pp. 84-97;
Venugopal, V., Narendran, T.T., Cell formation in manufacturing systems through a
simulated annealing: An experimental evolution (1992) European Journal of
1409-1421;
Yasuda, K., Yin, Y., Dissimilarity for solving the cell formation problem in
cellular manufacturing (2001) Computers and Industrial Engineering, 39, pp. 1-17;
pp. 829-853;
855-906;
Research, 38, pp. 385-395;
problem involving processing time and lot size (2003) Computers and Industrial
CORRESPONDENCE ADDRESS: Dixit, A. R.; Department of Mechanical Engineering and
Mining Machinery Engineering, Indian School of Mines University, Dhanbad-826004,
Jharkhand, India; email: [email protected]
ISSN: 13682148
ABBREVIATED SOURCE TITLE: Int. J. Manuf. Technol. Manage.
SOURCE: Scopus
Sofianopoulou, S.
6603156425;
Application of simulated annealing to a linear model forthe formulation of machine
cells ingroup technology
times.
0031075272&doi=10.1080%2f002075497195876&partnerID=40&md5=c467ea55ee0e5e66fc477e2f3
5d42e98
DOI: 10.1080/002075497195876
Karaoli and Demetriou str, Piraeus, 185 34, Greece
ABSTRACT: The central issue in group technology is the cell formation problem,
which involves the grouping of parts into families and machines into cells, so that
parts with similar manufacturing (and design) attributes are identified and
processed by dedicated cells of machines. In the present work, the cell formation
problem is modelled as a linear integer programming problem with the objective of
minimizing the number of intercellular moves subject to cell-size constraints and
taking into account the machine operation sequence of each part. An interesting
feature of the proposed formulation is that there is no need of specifying a priori
the number of cells to be used, which is automatically adjusted within the solution
procedure. A very efficient random search heuristic algorithm, based on the
simulated annealing method, is adopted for its solution. The heuristic is tested on
a number of problems and its performance is evaluated. Subsequently, a straight
forward model is presented to identify the families of parts which are to be
processed by the corresponding machine cells. © 1997 Taylor & Francis Group, LLC.
INDEX KEYWORDS: Algorithms; Heuristic methods; Integer programming; Linear
programming; Problem solving; Production control; Scheduling; Simulated annealing,
Cell formation problem; Group technology, Flexible manufacturing systems
REFERENCES: Aarts, E.H.L., Van Laarhoven, P.J.M., Statistical cooling: A general
approach to combinatorial optimization problems (1985) Philips Journal of Research,
40, pp. 193-226;
Bonomi, E., Lutton, J., The N-city travelling salesman problem: Statistical
mechanics and the Metropolis algorithm (1984) SIAM Review, 26, pp. 551-568;
Burbidge, J.L., (1975) The Introduction of Group Technology, , New York: Wiley);
Burkard, R.E., Rendl, F., A thermodynamically motivated simulation procedure for
combinatorialoptimization problems (1984) Europeanjournalof Operationalresearch,
17, pp. 169-174;
(1973) Inernational Journal of Production Research, 11, pp. 399-415;
Chen, W.-H., Srivastava, B., Simulated annealing procedures for forming machine
cells in group technology (1994) European Journal of Operational Research, 75, pp.
100-111;
Connolly, D.T., An improved annealing scheme for the QAP (1988) European Journal of
Theory of N P-Completeness, , San Francisco: Freeman);
Golden, B.L., Skiscim, C.C., Using simulated annealing to solve routing and
location problems (1986) Naval Research Logistics Quarterly, 33, pp. 261-279;
pp. 1535-1547;
King, J.R., Machine-component group formation in production flow analysis: An
approach using a rank order clustering algorithm (1980) International Journal of
117-133;
Kirkpartrick, F., Gelatt, C.D., Vecchi, M.P., Optimization by simulated annealing
(1983) Science, 220, pp. 671-680;
(1994) International Journal of Productive Research, 32, pp. 273-297;
splitting and multiple units of the same machine (1995) International Journal of
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Equation of state
calculation by fast computing machines (1953) Journal of Chemical Physics, 21, pp.
1087-1092;
Me Auley, A., Machine grouping for efficient production (1972) The Production
Mc Cormick, W.T., Schweitzer, P.J., White, T.W., Problem decomposition and data
organization by clustering technique (1972) Operations Research, 20, pp. 992-1009;
York: Wiley);
(1989) Iietransactions, 21, pp. 382-388;
Sofianopoulou, S., Simulated annealing applied to the process allocation problem
Wilhelm, M.R., Ward, T.L., Solving quadratic assignment problems by ‘simulated
annealing’ (1987) IIE Transactions, 19, pp. 107-119
University of Piraeus, 80 Karaoli and Demetriou str, Piraeus, 185 34, Greece
ISSN: 00207543
SOURCE: Scopus
Bhattacharjee, S., Hazarika, M.

57200146843;56241400000;
Formation of machine-part cells using assignment allocation algorithm
(2017) 2017 International Conference on Advances in Mechanical, Industrial,
Automation and Management Systems, AMIAMS 2017 - Proceedings, art. no. 8069213, pp.
208-212.
85039937358&doi=10.1109%2fAMIAMS.2017.8069213&partnerID=40&md5=f3f70cc8fe035943b9df
70bdaf39c17e
DOI: 10.1109/AMIAMS.2017.8069213
AFFILIATIONS: Royal School of Engineering and Technology, Guwahati - 35, Assam,
India;
Department of Mechanical Engineering, Assam Engineering College, Guwahati, 781013,
India
ABSTRACT: In this paper, an iterative procedure viz. assignment allocation
algorithm has been employed to cell formation problem by solving a nonlinear
mathematical model. The algorithm has been applied to ten benchmark problems and
through computational experimentation it has been observed that the algorithm
provides better results for six of the problems that have been considered. © 2017
IEEE.
AUTHOR KEYWORDS: Assignment allocation algorithm; Cellular manufacturing;
Exceptional elements; Machine-part cell formation; Void elements
INDEX KEYWORDS: Iterative methods; Machinery; Problem solving, Allocation
algorithm; Bench-mark problems; Cell formation; Cell formation problem; Exceptional
elements; Nonlinear mathematical model; Void elements, Cellular manufacturing
REFERENCES: Group technology in the US manufacturing industry: A survey of current
practices (1989) Int J Prod Res, 27 (8), pp. 1287-1304., Nancy Lea Hyer & Urban
Wemmerlov;
665;
Kumar Adil, G., Rajamani, D., Strong, D., Assignment allocation and simulated
annealing algorithms for cell formation (1997) IIE Transactions, 29 (1), pp. 53-67;

pp. 1609-1617;
Goncalves, J.F., Resende, C.M.G., An evolutionary algorithm for manufacturing cell
Mahdavi, I., Mahdi Paydar, M., Solimanpur, M., Heidarzade, A., Genetic algorithm
Shiyas, C.R., Pillai, V.M., A mathematical programming model for manufacturing cell
formation to develop multiple configurations (2014) Journal of Manufacturing
Systems, 33, pp. 149-158;
based on genetic algorithm (2015) 2015 IEEE Workshop on Computational Intelligence:
Theories, Applications and Future Directions (WCI), pp. 1-6;
alternative routings (2016) Materials Today: Proceedings, , (in press);
Belarmino, A.-D., Lozano, S., Racero, J., Guerrero, F., Machine cell formation in
227-240;
the machine-part cell formation problem (2016) Materials Today: Proceedings, , (in
press);
Hazarika, M., Laha, D., A heuristic approach for machine cell formation problems
with alternative routings (2016) Procedia-Computer Science, 89, pp. 228-242;
2079;
Srinivasa Gupta, N., Devika, D., Valarmathi, B., Sowmiya, N., Shinde, A., CARI-A
relevance index (2014) Int J Prod Res, 52 (24), pp. 7297-7309;
835-850;
technology using minimum spanning trees (1994) Int J Prod Res, 32 (9), pp. 2149-
2158;
Review and extension (1982) Int J Prod Res, 20 (2), pp. 117-133;
(1991) Int J Prod Res, 29 (2), pp. 343-356;
William, T., McCormick, J., Jr., Schweitzer, P.J., White, T.W., Problem
decomposition and data reorganization by a clustering technique (1972) Operations
Research, 20 (5), pp. 993-1009;
(1973) Int J Prod Res, 11 (4), pp. 399-416;
technology machine cluster problem (1985) Omega Int. J. of Mgmt. Sci, 13 (6), pp.
577-583;
1035-1052;
Bhattacharjee, S., Applying assignment allocation algorithm to cell formation
problems (2016) IEEE Conference Proceedings, International Conference on Signal
Processing, Communication, Power and Embedded System (SCOPES)-2016, pp. 163-167
EDITORS: Gupta M., Agarwal P.K.
ISBN: 9781509056743
ABBREVIATED SOURCE TITLE: Int. Conf. Adv. Mech., Ind., Autom. Manag. Syst., AMIAMS
SOURCE: Scopus
Murthy, C.V.R., Srinivasan, G.

55674176500;36136249100;
Fractional cell formation in group technology
30 times.
0001063679&doi=10.1080%2f00207549508930212&partnerID=40&md5=ef210e21962a9a9042c32f9
2e300fc54
DOI: 10.1080/00207549508930212
AFFILIATIONS: Industrial Engineering and Management Division, Department of
Humanities and Social Sciences, Indian Institute of Technology, Madras, 600 036,
India
ABSTRACT: Group Technology (GT) aims at improving productivity in batch
manufacturing. Here components are divided into families and machines into cells
such that every component in a part family visits maximum number of machines in the
assigned cell with an objective of minimizing inter-cell movement. In situations
where too many inter-cell moves exist, fractional cell formation using remainder
cells can be used. Here, machines are grouped into GT cells and a remainder cell,
which functions like a job shop. Component families are formed such that the
components visit the assigned cell and the remainder cell and do not visit other
cells. The fractional cell formation problem to minimise inter-cell moves is
formulated as a linear integer programming problem. Here, movement between machine
cells and remainder cells is not counted as inter-cell moves but movement of
components among GT cells is considered as inter-cell movement. The fractional cell
formation problem is solved using Simulated Annealing. A heuristic algorithm is
developed to solve large sized GT matrices. These have applied to a variety of
matrices from GT literature and tested on randomly generated matrices.
Computational experiences with the algorithms are presented. © 1995 Taylor &
Francis Group, LLC.
INDEX KEYWORDS: Batch manufacturing; Cell formation; Cell formation problem; Inter-
cell moves; Large-sized; Linear integer programming; Machine cell; Part family,
Cellular manufacturing; Cytology; Group technology; Heuristic algorithms; Integer
programming; Machine components; Matrix algebra, Cells
REFERENCES: Askin, R.G., Subramanian, S.P., A cost based heuristic for group
pp. 101-113;
152;
Research, 24, pp. 451-464;
Chandrasekharan, M.P., Rajagopalan, R., MODROC-an extension ofrank order clustering
1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., Group ability: An analysis of the
properties of binary data matrices for group technology (1989) International
Chu, C.H., Cluster analysis in manufacturing cell formation (1989) Omega, 17, pp.
289-295;
Green, T.J., Sadowskj, R., Cellular Production Control (1983) Journal of
pp. 1353-1367;
King, J.R., Machine component grouping in production flow analysis: An approach
using rank order clustering (1980) International Journal of Production Research,
18, pp. 213-232;
117-133;
Kirkpatrick, S., Gelati, C.D., Vecchi, M.P., Optimization by simulated annealing
(1983) Science, 220, pp. 339-348;
397;
1728;
51, pp. 53-57;
McCormick, C.J., Sweitzer, D.W., White, T.R., Problem decomposition and data
993-1009;
Mosier, C., An experiment investigating the application of clustering procedures
Rutenbar, R.A., An overview (1989) IEEE Circuits and Devices Magazine, pp. 19-26;
Seiffodini, H., Single linkage vs average linkage clustering in machine cells
419-426;
Srinivasan, G., Narendran, T.T., GRAFICS-a nonhierarchical clustering algorithm for
478;
Vanlaarhoven, P., Aarts, E., Lenstra, J.K., Job shop scheduling by simulated
annealing (1992) Operations Research, 40, pp. 113-125;
24, pp. 387-400;
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the U.S. Industry-a survey of
Wilhelm, M.R., Thomas, L.W., Solving quadratic assignment problems by simulated
annealing (1987) IIE Transactions, pp. 107-119
CORRESPONDENCE ADDRESS: Murthy, C.V.R.; Industrial Engineering and Management
Division, Department of Humanities and Social Sciences, Indian Institute of
Technology, Madras, 600 036, India
ISSN: 00207543
SOURCE: Scopus
Mar-Ortiz, J., Adenso-Díaz, B., González-Velarde, J.L.

56013630300;7004391860;6505804080;
A comparison of manufacturing and disassembly systems from a cellular configuration
point of view
2003-2016. Cited 1 time.
84937974935&doi=10.1007%2fs00170-015-6969-
6&partnerID=40&md5=629b286b6a30cb055a78124b3335418a
DOI: 10.1007/s00170-015-6969-6
AFFILIATIONS: Faculty of Engineering, Universidad Autónoma de Tamaulipas, Tampico,
Tamaulipas 89140, Mexico;
Engineering School, Universidad de Oviedo, Gijón, 33203, Spain;
Tecnológico de Monterrey, Monterrey, Nuevo León 64849, Mexico
ABSTRACT: The main aim of this research is to analyze the differences between
cellular manufacturing and cellular disassembly systems. While doing so, this paper
makes a relevant contribution. It proposes a mathematical programming formulation
for robust manufacturing and disassembly cell formation problems. A solution method
based on the Tabu Search schema is adapted for both problems and will be used for
the comparison analysis. The fact that the Tabu Search algorithm has been effective
in different cell formation approaches gives us confidence in its reliability, and
although alternative metaheuristic approaches may be developed in the future, we
opted for adapting this algorithm to the problem at hand, since our first aim is to
obtain data to analyze the difference in the design of both types of production
environments and not to develop new approaches to the cell formation problem. A
full factorial design study is proposed in order to appraise the significance of
controllable factors in cellular designs. Four dependent variables were considered
in the experiments: total cost, size of the cells, number of intercellular moves,
and machine utilization. The issue here is to see what happens with the solutions
for each production environment (manufacturing and disassembly) when varying
factors, in order to analyze the differences and similarities between both. © 2015,
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing; Disassembly;
Operational research; Robust optimization
INDEX KEYWORDS: Cells; Cytology; Design; Industrial research; Manufacture;
Mathematical programming; Mobile security; Optimization; Tabu search, Cell
formation problem; Cellular configuration; Disassembly; Meta-heuristic approach;
Operational research; Production environments; Robust optimization; Tabu search
algorithms, Cellular manufacturing
REFERENCES: Wemmerlöv, U., Hyer, N., Cellular manufacturing in the US industry: a
Singh, N., Design of cellular manufacturing systems: an invited review (1993) Eur J
Oper Res, 69 (3), pp. 281-511;
(1), pp. 3-20;
Adenso-Díaz, B., Lozano, S., Andrés, C., García, J.M., Disassembly cells design.
Proceedings of the Group Technology/Cellular Manufacturing Conference, University
of Gröningen (2006) The Netherlands, pp. 443-450;
Mar-Ortiz, J., Lozano, S., Adenso-Díaz, B., González, B., González-Velarde, J.L.,
Heuristic procedure for the disassembly cells formation problem (2009) Proceedings
of the 5th International Conference on Intelligent Manufacturing and Logistics
Systems, , Kitakyushu, Japan;
Kopacek, B., Kopacek, P., Intelligent disassembly of electronic equipment (1999)
Annu Rev Control, 23, pp. 165-170;
Teunter, R.H., Determining optimal disassembly and recovery strategies (2006) OMEGA
Int J Manag Sci, 34 (6), pp. 533-537;
Ilgin, M.A., Gupta, S.M., Comparison of economic benefits of sensor embedded
products and conventional products in a multi-product disassembly line (2010)
Comput Ind Eng, 59 (4), pp. 748-763;
Tang, Y., Zhou, M.C., Zussman, E., Caudill, R., Disassembly modelling, planning,
and application (2002) J Manuf Syst, 21 (3), pp. 200-217;
González, B., Adenso-Díaz, B., A scatter search approach to the optimum disassembly
sequence problem (2006) Comput Oper Res, 33 (6), pp. 1776-1793;
Andrés, C., Lozano, S., Adenso-Díaz, B., Disassembly sequence planning in a
disassembly cell context (2007) Robot Comput Integr Manuf, 23 (6), pp. 690-695;
Mar-Ortiz, J., González-Velarde, J.L., Adenso-Díaz, B., A VNS algorithm for a
disassembly cell formation problem with demand variability (2014) Eur J Ind Eng, 8
(1), pp. 22-49;
Deming, D.D., When to shift to straight-line production (1959) Harv Bus Rev, 38,
pp. 62-68;
Gamberi, M., Gamberini, R., Manzini, R., Regattieri, A., An analytical model to
evaluating the implementation of a batch-production-oriented line (2008) Int J Prod
Econ, 111 (2), pp. 729-740;
Gamberini, R., Gebennini, E., Rimini, B., An innovative container for WEEE
collection and transport: details and effects following the adoption (2009) Waste
Manag, 29 (11), pp. 2846-2858;
Adenso-Díaz, B., Lozano, S., A model for the design of dedicated manufacturing
cells (2008) Int J Prod Res, 46 (2), pp. 301-319;
Appl Math Comput, 184 (2), pp. 721-728;
(2005) Int J Prod Res, 43 (8), pp. 1587-1605;
systems under dynamic and uncertain conditions (2007) J Intell Manuf, 18, pp. 383-
399;
cell-formation problems in machine scheduling (2009) Ann Oper Res, 166 (1), pp.
163-181;
systems (1995) Oper Res, 43 (2), pp. 264-281;
Kouvelis, P., Yu, G., (1997) Robust discrete optimization and its applications, ,
Kluwer Academic Publishers, Norwell, MA;
Ben-Tal, A., El-Ghaoui, L., Nemirovski, A., (2009) Robust optimization, , Princeton
University Press, Princeton;
problems with fixed cell cost (2004) Comput Oper Res, 31 (1), pp. 21-31;
Lozano, S., Adenso-Díaz, B., Eguia, I., Onieva, L., A one-step Tabu search
algorithm for manufacturing cell design (1999) J Oper Res Soc, 50 (5), pp. 509-516;
transfer costs as a function of cell size (2005) Comput Ind Eng, 49, pp. 449-462;
(2011) Comput Ind Eng, 60 (1), pp. 7-15;
for the manufacturing cells formation problem (2008) Int J Adv Manuf Technol, 36
(5-6), pp. 589-597;
systems, , John Wiley and Sons, New York;
Askin, R.G., Subramanian, P.S., A cost-based heuristic for group technology
Brennan, L., Gupta, S.M., Taleb, K.N., Operations planning issues in an
assembly/disassembly environment (1994) Int J Oper Prod Manag, 14 (9), pp. 57-67;
Levasseur, G.A., Helms, M.M., Zink, A.A., A conversion from a functional layout to
a cellular manufacturing layout at Steward, Inc (1995) Prod Inv Manag J, 36, pp.
37-42;
Int J Prod Econ, 120 (2), pp. 301-314;
simulated annealing (2012) Comput Oper Res, 39 (11), pp. 2642-2658;
coefficients and a parallel genetic TSP algorithm: formulation and comparison
(1995) Math Comput Model, 21 (12), pp. 61-73;
and ratio-level data (2003) Int J Adv Manuf Technol, 22 (1-2), pp. 125-133
CORRESPONDENCE ADDRESS: Mar-Ortiz, J.; Faculty of Engineering, Universidad Autónoma
de TamaulipasMexico
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Susanto, S., Bhattacharya, A., Al-Dabass, D.

16032542500;7402635256;6603431045;
Fuzzy clustering-based optimised cell formation algorithm considering sequence of
operations, alternative routing and part-volume
(2010) UKSim2010 - UKSim 12th International Conference on Computer Modelling and
Simulation, art. no. 5481035, pp. 22-27.
77954515026&doi=10.1109%2fUKSIM.2010.13&partnerID=40&md5=d84d78f316ef59eccd43b5c541
384851
DOI: 10.1109/UKSIM.2010.13
Technology, Parahyangan Catholic University, Jl. Ciumbuleuit 94, Bandung-40141,
Indonesia;
Enterprise Process Research Centre (EPRC), School of Mechanical and Manufacturing
Engineering, Dublin City University, Glasnevin, Dublin 9, Ireland;
School of Computing and Technology, Nottingham Trent University, Nottingham, NG11
8NS, United Kingdom
ABSTRACT: CM is the grouping of discrete multi-machines that produce part families
with similar geometry or sequence of process and aims to improve manufacturing
systems productivity. The methods/models used are classified into: array-based,
clustering, mathematical programming based (viz., integer programming), graph
theoretic, Multi-Criteria Decision-Making (MCDM) and artificial intelligence
techniques. Fuzzy c-means clustering approach has been used to manufacturing cell
formation problem by Chu and Hayya, this differs from a previous ones proposed by
Xu and Wang, and later by Li and Ding, in the sense that Chu and Hayya use
manufacturing routing data rather than design features in part family formation.
Optimised cell formation, taking into account sequence of operations, alternative
routing and part-volume together is not present in Chu and Hayya. Thus this paper
focuses on stages selection of parts and part families generation, and selection of
machines and process and grouping of these into cells in the design of a new
manufacturing system considering sequence of operation, alternative routing and
part-volume. One of the crucial steps in the design of a cellular manufacturing
system is the cell formation problem, which involves grouping the parts into part
families and machines into machine groups. © 2010 IEEE.
AUTHOR KEYWORDS: Fuzzy clustering; Manufacturing systems; Optimised cell
formation
INDEX KEYWORDS: Artificial intelligence techniques; Cell formation; Cell formation
algorithms; Cell formation problem; Cellular manufacturing systems; Design
features; Fuzzy C means clustering; Graph-theoretic; Manufacturing cell formation;
Manufacturing system; Multi-machines; Multicriteria decision-making; Optimised cell
formation; Part family; Part family formation; Routing data, Artificial
intelligence; Computer simulation; Decision making; Flexible manufacturing systems;
Fuzzy clustering; Fuzzy systems; Graph theory; Integer programming; Machine design;
Mathematical techniques, Cellular manufacturing
REFERENCES: Susanto, S., Al-Dabass, D., Bhattacharya, A., Optimised cell formation
algorithm considering sequence of operations, alternative routing and part-volume
Proceedings of the 3rd Asia International Conference on Modelling & Simulation,
Bandung & Bali, Indonesia, 25, 26 & 29 May 2009, pp. 79-84;
135-149., DOI 10.1007/s00170-006-0710-4;
Research, 32 (9), pp. 2149-2158;
Choobineh, F., FRAMEWORK for the DESIGN of CELLULAR MANUFACTURING SYSTEMS (1988)
Chu, C.-H., Tsai, M., Comparison of three array-based clustering techniques for
28 (8), pp. 1417-1433;
Slagle, J.L., Chang, C.L., Heller, S.R., A clustering and data reorganization
algorithm (1975) IEEE Transaction on Systems, Man, and Cybernetics, SMC-5 (2), pp.
125-128;
Chu, C.-H., Hayya, J.C., A fuzzy clustering approach to manufacturing cell
1487;
Li, J., Ding, Z., Fuzzy cluster analysis and fuzzy pattern recognition methods for
formation of part families Proceedings of the 16th North American Manufacturing
Research Conference (NAMRC), 1988, pp. 558-563;
families in cellular manufacturing (1998) Computers and Industrial Engineering, 35
(1-2), pp. 81-84;
type clusters separately (1999) Production Planning & Control, 10 (4), pp. 375-388;
Susanto, S., Kennedy, R.D., Price, J.W.H., SKP-2 Algorithm: On forming part and
machine-clusters separately Proceedings of the 1998 Pacific Conference on
Manufacturing, Brisbane, Queensland, Australia, August 18-20, 1998, pp. 122-128;
Li, J., Chu, C.-H., Wang, Y., Yan, W., An improved fuzzy clustering method for
pp. 1049-1062., DOI 10.1080/00207540600634923, PII 768595052;
Li, J., Chu, C.-H., Wang, Y., Yan, W., An improved fuzzy c-means algorithm for
manufacturing cell formation Proceedings of the 2002 IEEE International Conference
on Fuzzy Systems, 2002 (FUZZ-IEEE' 02), Honolulu, HI, USA, 2, pp. 1505-1510;
Lozano, S., Dobado, D., Larrãneta, J., Onieva, L., Modified fuzzy C-means algorithm
Narayanaswamy, P., Bector, C.R., Rajamani, D., Fuzzy logic concepts applied to
machine-component matrix formation in cellular manufacturing (1996) European
Journal of Operational Research, 93 (1), pp. 88-97., DOI 10.1016/0377-
2217(95)00036-4;
Tavakkoli-Moghaddam, R., Rahimi-Vahed, A.R., Ghodratnama, A., Siadat, A., A
simulated annealing method for solving a new mathematical model of a multi-criteria
cell formation problem with capital constraints (2009) Advances in Engineering
Software, 40 (4), pp. 268-273;
algorithms for cell formation (1997) IIE Transactions, 29 (1), pp. 53-67;
Malakooti, B., Malakooti, N.R., Yang, Z., Integrated group technology, cell
formation, process planning, and production planning with application to the
emergency room (2004) International Journal of Production Research, 42 (9), pp.
1769-1786;
Pham, D.T., Afify, A.A., Koç, E., Manufacturing cell formation using the Bees
Algorithm IPROMS2007, UK, ,
http://conference.iproms.org/sites/conference.iproms.org/files/ papers2007/122.pdf,
Website;
50 (3-4), pp. 407-420;
Vannelli, A., Ravi Kumar, K., A method for finding minimal bottleneck cells for
24 (2), pp. 387-400;
based on TOPSIS method (2009) Computers & Operations Research, 36, pp. 1478-1496;
alternatives for machine-part family formation in group technology (2002) IIE
Hadiguna, R.A., A multi criteria approach to designing the cellular manufacturing
system (2005) Jurnal Teknik Industri, 7 (1), pp. 41-50;
Liao, T.W., Chen, L.J., Chen, Z.H., Coates, E.R., A comparison of two approaches
for designing line type cellular manufacturing systems (1996) Integrated
Chen, S.-J., Cheng, C.-S., A neural network-based cell formation algorithm in
pp. 293-318;
Chu, C.-H., An improved neural network for manufacturing cell formation (1997)
Decision Support Systems, 20 (4), pp. 279-295;
16 (7), pp. 491-497;
Research, 36 (5), pp. 1325-1337;
Bezdek, J.C., Pal, S.K., (1992) Fuzzy Models for Pattern Recognition, , IEEE Press,
Piscataway, USA;
Bezdek, J.C., Numerical taxonomy with fuzzy sets (1974) Journal of Mathematical
Biology, 1, pp. 57-71
CORRESPONDENCE ADDRESS: Susanto, S.; Department of Industrial Engineering, Faculty
of Industrial Technology, Parahyangan Catholic University, Jl. Ciumbuleuit 94,
Bandung-40141, Indonesia; email: [email protected]
ISBN: 9780769540160
ABBREVIATED SOURCE TITLE: UKSim - UKSim Int. Conf. Comput. Model. Simul.
SOURCE: Scopus
Kao, Y., Fu, S.C.

23034954300;55462381700;
An ant-based clustering algorithm for manufacturing cell design
1182-1189. Cited 19 times.
33646187482&doi=10.1007%2fs00170-004-2475-
y&partnerID=40&md5=db952528538beee041c32b36b90e83c9
DOI: 10.1007/s00170-004-2475-y
Chungshan N. Rd., Sec. 3, Taipei, 104, Taiwan
ABSTRACT: This paper proposes a new part clustering algorithm that uses the concept
of ant-based clustering in order to resolve machine cell formation problems. The
three-phase algorithm mainly utilizes distributed agents which mimic the way real
ants collect similar objects to form meaningful piles. In the first phase, an ant-
based clustering model is adopted to form the initial part families. For the
purpose of part clustering, a part similarity coefficient is modified and used in
the similarity density function of the model. In the second phase, the K-means
method is employed in order to achieve a better grouping result. In the third
phase, artificial ants are used again to merge the small, refined part families
into larger part families in a hierarchical manner. This would increase the
flexibility of determining the number of final part families for the factory layout
designer. The proposed algorithm has been developed into a software system called
the ant-based part clustering system (APCS). In addition to part family formation,
APCS performs the tasks of machine assignment and performance evaluation. Finally,
performance evaluation of the proposed algorithm was conducted by testing some
well-known problems from literature. The evaluation results show that the algorithm
is able to solve the cell formation problems effectively.
AUTHOR KEYWORDS: Ant algorithms; Cell formation problems; Cellular manufacturing
INDEX KEYWORDS: Cellular manufacturing; Computer software; Intelligent agents;
Mathematical models; Performance; Problem solving, Ant algorithms; Cell formation
problems, Algorithms
technology: Review, evaluation and directions for future research (1998) Cornput
Ind Eng, 34 (1), pp. 3-20;
formation in cellular manufacturing systems (2001) Int J Adv Manuf Technol, 18, pp.
591-597;
manufacturing, part I: A survey (1993) Int J Prod Res, 31 (5), pp. 1133-1142;
manufacturing, part II: An extension and comparison (1993) Int J Prod Res, 31 (6),
pp. 1315-1326;
Johnson, R.A., Wichern, D.W., (1998) Applied Multivariate Statistical Analysis, ,
Prentice-Hall, New York;
Deneubourg, J.L., Goss, S., Franks, N., Sendova-Franks, A., Detrain, C., Chretien,
L., The dynamics of collective sorting robot-like ants and ant-like robots (1991)
Proceedings of the First International Conference on Simulation of Adaptive
Behavior: From Animals to Animals, 1, pp. 356-363., Meyer JA, Wilson SW (eds). MIT
Press, Cambridge, MA;
Lumer, F.D., Faieta, B., Diversity and adaptation in populations of clustering ants
(1994) Proceedings of the Third International Conference on Simulation of Adaptive
Behavior: From Animals to Animals, 3, pp. 501-508., Husbands CP, Meyer JA, Wilson
SW (eds), MIT Press, Cambridge, MA;
Monmarche, N., Slimane, M., Venturini, G., AntClass: Discovery of clusters in
numeric data by a hybridization of an ant colony with the K-means algorithm (1999)
Internal Report No.213, 213, pp. 1-21., Laboratoire d'Informatique, E3i, Université
de Tours;
720;
techniques (1990) Int J Prod Res, 28 (4), pp. 661-673;
Review and extension (1982) Int J Production Res, 20 (2), pp. 117-133;
W'aghodekar, P.H., Sahu, S., Machine-component cell formation in group technology:
57;
(1973) Int J Prod Res, 11 (4), pp. 399-416;

835-850
University, 40, Chungshan N. Rd., Sec. 3, Taipei, 104, Taiwan; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Liu, C., Zhu, L., Tanaka, K.

55680709700;56321240500;36083508500;
An algorithm for the design of manufacturing cells
(2009) 5th International Conference on Natural Computation, ICNC 2009, 6, art. no.
5366546, pp. 207-211.
77950612048&doi=10.1109%2fICNC.2009.688&partnerID=40&md5=3051243ef8c41c51970aa354c7
e851c5
DOI: 10.1109/ICNC.2009.688
AFFILIATIONS: School of Management Science, Xi'An University of Technology, Xi'an
710048, China;
Academic Administration Division, Xi'An University of Technology, Xi'an 710048,
China;
Mathematical Institute, Tohoku University, Sendai 980-8578, Japan
ABSTRACT: In the literature on cellular manufacturing, numerous mathematical models
and various algorithms have been investigated for cell formation problem. However,
most of the proposed models and algorithms have more or less drawbacks for
designing manufacturing cells in both quality and speed. In the present paper, we
propose a mathemati-cal model that stresses several real-life issues of cellular
manufacturing systems design. Then, we develop a heuristic algorithm that can solve
this NP-hard model efficiently. © 2009 IEEE.
INDEX KEYWORDS: Cell formation problem; Cellular manufacturing systems design;
Manufacturing cells; NP-hard, Computational efficiency; Flexible manufacturing
systems; Heuristic algorithms; Mathematical models, Cellular manufacturing
Management, , Kluwer-Nijhoff Pub, Boston;
Implementation and performance improve-ments (1997) Int J Prod Res, 35, pp. 29-49;
pp. 281-309;
Reisman, A., Kumar, A., Motawani, J., Cheng, C.H., Cellular manufacturing: A
statistical review of the literature (1965-1995) (1997) Oper Res, 45 (4), pp. 508-
520;
3-20;
Mansouri, S.A., Husseini, S.M., Newman, S.T., A review of the modern approaches to
multi-criteria cell design (2000) Int J Prod Res, 38, pp. 1201-1218;
problem: A taxonomy and review (2006) Int J Prod Eco, 101, pp. 329-352;
Greene, T., Sadowski, R., A review of cellular manufac-turing assumptions,
advantages, and design techniques (1984) J Oper Manag, 4, pp. 85-97;
cell formation techniques. Int (1996) J Fact Auto Info Manag, 3, pp. 225-265;
Goncalves, J.F., Resende, M.G.C., An evolutionary al-gorithm for manufacturing cell
57;
9, pp. 73-81;
Gupta, T., Seifoddini, H., Production data based simi-larity coefficient for
system (1990) Int J Prod Res, 28, pp. 1247-1269;
grouping in cellular manufactur-ing systems (2000) Eng Costs Prod Econ, 38, pp.
699-720;
in cellular manufacturings (2001) Comput Ind. Eng, 39, pp. 1-17;
Srinivasan, G., Narendran, T.T., GRAFICS-a nonhierar-chical clustering-algorithm
for group technology (1991) Int J Prod Res, 29, pp. 463-478;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAClan al-gorithm for concurrent
formation of part families and machine cells (1987) Int J Prod Res, 25, pp. 835-
850;
using ordinal and ratio-level data (1998) Int J Prod Res, 37, pp. 539-556;
for solving the cell formation in group technology (1991) J Oper Manag, 10, pp. 44-
72;
theoretic approach (1975) Int J Prod Res, 13, pp. 567-579;
Int J Prod Res, 29, pp. 1081-1100;
Mukhopadyay, S.K., Ramesh, B.K., Vijai, S.K.V., Modi-fied Hamiltonian chain: A
graph theoretic approach to group technology (2000) Int J Prod Res, 38, pp. 2459-
2470;
technology using minimum spanning trees (1994) Int J Prod Res, 32, pp. 2149-2158;
Ng, S., Worst-case analysis of an algorithm for cellular manufacturing (1993) Euro
J Oper Res, 69, pp. 384-398;
(1996) Oper Res, 44, pp. 735-744;
cell formation in group technol-ogy (1990) Int J Prod Res, 28, pp. 1555-1572;
561-569;
Int J Prod Res, 26, pp. 1161-1172;
Co, H.C., Araar, A., Configuring cellular manufacturing systems (1988) Int J Prod
Res, 26, pp. 1511-1522;
approach (1997) Int J Prod Res, 35, pp. 2025-2043;
Steudel, H., Ballakur, A., A dynamic programming based heuristic for machine
grouping in manufacturing cell formation (1987) Comput Ind Eng, 12, pp. 215-222;
problem (1991) J Oper Manag, 10, pp. 28-43;
state-of-the-art review (1999) Int J Prod Res, 37, pp. 3335-3357;
cell design (1995) Int J Prod Res, 33, pp. 2739-2755;
Elmaraghy, H.A., Gu, P., Knowledge-based system for assignment of parts to machines
(1988) Int J Adv Manu Tech, 3, pp. 33-44;
network approach (1990) Int J Adv Manu Tech, 5, pp. 278-291;
Manuf Rev, 4, pp. 293-301;
Venugobal, V., Narendran, T.T., Machine-cell formation through neural network
models (1994) Int J Prod Res, 32, pp. 2105-2116;
Ahmed, P., Moghaddam, T.R., Safaei, N., A comparison of heuristic methods for
solving a cellular manufacturing model in a dynamic environment (2004) Working
Paper WP007/04, , University of Wolverhampton, UK;
intera-cell moves in cellular manufacturing: A genetic algorithm (1995) Int J
Comput Integ Manuf, 8, pp. 92-101;
grouping problem with multiple objectives (1992) Comput Ind Eng, 22, pp. 469-480;
Logendran, R., Ramakrishna, P., Srikandarajah, C., Abu search based heuristic for
manufacturing cell design (1999) J Oper Res Soc, 50, pp. 509-516;
transfer costs as a function of cell size (2005) Comput Ind. Eng, 49, pp. 449-462;
cellular manufacturing environment (1998) Ann Oper Res, 77, pp. 109-128;
501-511;
cell formation with multiple iden-tical machines (2003) Eur J Oper Res, 151, pp.
434-446;
Won, Y., Lee, K.C., Group technology cell formation considering operation sequence
and production volume (2001) Int J Prod Res, 39, pp. 2755-2768;
Heragu, S.S., Chen, J.R., Optimal solution of cellular man-ufacturing system
design: Benders decomposition approach (1998) Eur J Oper Res, 107, pp. 175-192;
group technology cell formation (2001) J Manuf Syst, 19, pp. 305-317
CORRESPONDENCE ADDRESS: Liu, C.; School of Management Science, Xi'An University of
Technology, Xi'an 710048, China
ISBN: 9780769537368
ABBREVIATED SOURCE TITLE: Int. Conf. Nat. Comput., ICNC
SOURCE: Scopus
Murugan, M., Selladurai, V.

57200008588;6602624097;
Formation of machine cells/Part families in cellular manufacturing systems using an
ART-modified single linkage clustering approach - A comparative study
(2011) Jordan Journal of Mechanical and Industrial Engineering, 5 (3), pp. 199-212.
Cited 8 times.
84857429432&partnerID=40&md5=a46c6b87d8cc7f8fb54248108017f80a
AFFILIATIONS: Department of Mechanical Engineering, SNS College of Technology,

Coimbatore -641035, Tamilnadu, India;
Department of Mechanical Engineering, Coimbatore Institute of Technology,
Coimbatore -641014, Tamilnadu, India
ABSTRACT: This paper proposes an Art Modified Single Linkage Clustering approach
(ART-MOD-SLC) to solve cell formation problems in Cellular Manufacturing. In this
study, an ART1 network is integrated with Modified Single Linkage Clustering (MOD-
SLC) to solve cell formation problems. The Percentage of Exceptional Elements (PE),
Machine Utilization (MU), Grouping Efficiency (GE) and Grouping Efficacy (GC) are
considered as performance measures. This proposed heuristic ART1 Modified Single
Linkage Clustering (ART-MOD-SLC) first constructs a cell formation using an ART1
and then refines the solution using Modified Single Linkage Clustering (MOD-SLC)
heuristic. ART1 Modified Single Linkage Clustering has been applied to most popular
examples in the literature including a real time manufacturing data. The
computational results showed that the proposed heuristic generates the best
solutions in most of the examples. The proposed method is compared with the well-
known clustering approaches selected from the literature namely ROC2, DCA, SLC and
MOD-SLC. Comparison and evaluations are performed using four performance measures.
Finally analysis of results is carried out to test and validate the proposed ART-
MOD-SLC approach. The MCF methods considered in this comparative and evaluative
study belong to the cluster formation approaches and have been coded by using C++
with an Intel P-IV compatible system. © 2011 Jordan Journal of Mechanical and
Industrial Engineering.
AUTHOR KEYWORDS: ART-MOD-SLC; Cell formation; Cellular manufacturing; Group
technology; Modified single linkage clustering (MOD-SLC); Performance measures
INDEX KEYWORDS: ART-MOD-SLC; Cell formation; Cell formation problem; Cluster
formations; Clustering approach; Comparative studies; Compatible systems;
Computational results; Exceptional elements; Grouping efficacy; Grouping
efficiency; Machine cell; Machine utilization; Performance measure; Real time;
Single linkage clustering, Group technology, Cellular manufacturing
REFERENCES: McCormick, W.T., Schweitzer, P.J., White, T.W., Problem decomposition
and data reorganization by a cluster technique (1972) Operations Research, 20 (5),
pp. 993-1009;
Research, 18 (2), pp. 213-232;
117-133;
Research, (2), pp. 451-464;
Khator, S.K., Irani, S.A., Cell formation in group technology: a new approach
(1987) International Journal of Computers and Industrial Engineering, 12 (2), pp.
131-142;
branch and bound and AI approaches (1993) IIE Transactions, 25 (4), pp. 46-56;
approach to reordering the machine-part matrix for cellular manufacturing (1991)
Engineer, 51 (2), pp. 53-57;
Waghodekar, P.H., Sahu, S., Machine component cell formation in group technology.
28 (8), pp. 1417-1433;

Cheng, C.H., Kumar, A., Motwani, J., A comparative examination of selected cellular
manufacturing clustering algorithms (1995) International Journal of Operations &
Production Management, 15 (12), pp. 86-97;
Journal of Production Research, (1), pp. 1-19;
Dagli, C., Huggahalli, R., (1993) Neural Network Approach to Group technology, pp.
1-55;
Carpenter, G.A., Grossberg, S., (1987) Neural Dynamics of Category learning And
Recognition, 42, pp. 238-286;
Carpenter, G.A., Grossberg, S., (1988) The ART of Adaptive Pattern Recognition by a
Self Organizing Neural Network, 21 (3), pp. 77-88;
Carpenter, G.A., Grossberg, S., ART2: self-organisation of stable category
recognition codes for analog input patterns (1987) Appl. Opt., 26 (23), pp. 4919-
4930;
Kusiak, A., Chung, Y., GT/ART: Using Neural Networks to Form Machine Cells (1991)
Decision support systems, 26 (23), pp. 279-295;
2347;
Willow, C.C., (2002) A feed forward multi-layer neural network for machine cell
formation in computer integrated manufacturing, 13 (2), pp. 75-87;
Hwang, H., Oh, Y.H., Another similarity coefficient for the p-median modeling group
technology (2003) International Journal of Manufacturing Technology and Management,
5 (1-2), pp. 38-45;
Baroni-Urban, C., Buser, M.W., Similarity of binary data (1976) Systematic Zoology,
25, pp. 251-259;
48 (3), pp. 471-489;
Economics, 101 (2), pp. 329-352;
Prabbahakaran, G., Sachithanandam, M., Venkiah, N., Application of the Maximal
Spanning Tree Approach for Machine Cell Formation (2002) The International Journal
functional mathematical programming model (2006) The International Journal of
Farouq, A., Hamid, S., Machine cell formation for production management in cellular
pp. 913-934;
environment using Tabu search (2004) Computers and Industrial Engineering, 46 (3);
manufacturing cells (2005) Computers and Industrial Engineering, 48 (1), pp. 3-21;
Mahdavi, I., Rezaeian, J., Shanker, K., Raftani, A.Z., A set partitioning based
heuristic procedure for incremental cell formation with routing flexibility (2006)
(2007) Applied Mathematics and Computation, 190 (1), pp. 662-670;
Hu, B., Chen, M., Defersha, F.M., An integrated method for multiobjectives cell
Manufacturing Technology and Management, 11 (3-4), pp. 355-372;
Engineering, 12 (3), pp. 215-222;
Sule, D.R., Machine capacity planning in group technology (1991) International
Okogba, O.G., Chen, M.T., Changchit, C., Shell, R.L., Manufacturing cell formation
and evaluation using a new intercell flow reduction heuristic (1992) International
the weighted production-cell formation problem (1996) IIE Transactions, 28 (7), pp.
579-589;
Selim, H.M., Abdel Aal, R.M.S., Mahdi, A.I., Formation of machine groups and part
families: a modified SLC method and comparative study (2003) Integrated
Manufacturing systems, 14 (2), pp. 123-137;
Adenso-Díaz, B., Lozano, S., Eguía, I., (2005) Part-machine grouping using weighted
similarity coefficients, , Pergamon Press Inc. Tarrytown, NY, USA;
Foulds, L.R., Foulds, L.R., Wilson, J.M., (2006) The sustainable cell formation
problem: manufacturing cell creation with machine modification costs Source;
Kara, P.Y., Parameter setting of the Fuzzy ART neural network to part-machine cell
formation problem (2004) International Journal of Production Research;
Adil, G.K., Ghosh, J.B., Maximum diversity/similarity models with extension to part
grouping (2005) International Transactions in Operational Research, 12 (3), pp. 3-
11;
Venkumar, P., Noorul Haq, A., Fractional cell formation in group technology using
modified ART1 neural networks (2006) The International Journal of Advanced
Venkumar, P., Noorul Haq, A., Complete and fractional cell formation using Kohonen
self-organizing map networks in a cellular manufacturing system (2006)
CORRESPONDENCE ADDRESS: Murugan, M.; Department of Mechanical Engineering, SNS
College of Technology, Coimbatore -641035, Tamilnadu, India; email:
[email protected]
ISSN: 19956665
ABBREVIATED SOURCE TITLE: Jordan J. Mech. Ind. Eng.
SOURCE: Scopus
Mahdavi, I., Aalaei, A., Paydar, M.M., Solimanpur, M.

16417373200;26430357400;23025569300;35615315700;
Production planning and cell formation in dynamic virtual cellularmanufacturing
systems with worker flexibility
(2009) 2009 International Conference on Computers and Industrial Engineering, CIE
2009, art. no. 5223872, pp. 663-667. Cited 2 times.
77956116345&partnerID=40&md5=75feec1606b2599b048c57089b13cd3c

Faculty of Engineering, Urmia University, Urmia, West Azerbaijan Province, Iran
ABSTRACT: Most traditional cell formation problem procedures ignore any changes
indemand and part mix variation. However, in today's business environment,products
life cycles are short, and demand volumes and product mix can varyfrequently. In
this paper, a new mathematical model for production planning in adynamic virtual
cellular manufacturing system is developed under conditions ofmulti-period planning
horizons, with demand and part mix variation and workerflexibility. To validate and
verify the proposed model, two examples are solvedby LINGO Software package. © 2009
IEEE.
AUTHOR KEYWORDS: Dynamic virtual cellular manufacturing system; Production
planning; Workerflexibility
INDEX KEYWORDS: Business environments; Cell formation; Cell formation problem; New
mathematical model; Planning horizons; Product mix; Production planning; Virtual
cellular manufacturing system; Workerflexibility, Industrial engineering;
Mathematical models; Planning; Production control; Production engineering; Project
management, Cellular manufacturing
REFERENCES: Rheault, M., Drolet, J., Abdulnour, G., Physically reconfígurable
virtual cells: A dynamic model for ahighly dynamic environment (1995) Computers &
Industrial Engineering, 29 (1-4), pp. 221-225;
Chen, M., A mathematical programming model for systems reconfiguration in a
dynamiccell formation condition (1998) Annals of Operations Research, 71 (1), pp.
109-128;
UncertainProduction Requirements with Presence of Routing Flexibility, , Ph.D.
thesis, Virginia Polytechnic Institute and State University,Blackburg, VA;
Tavakkoli-Moghaddam, R., Aryanezhad, M., Safaei, N., Azaron, A., Solving a dynamic
cell formation problem using metaheuristics (2005) Applied Mathematics and
pp. 516-530;
Defersha, R., Chen, M., A comprehensive mathematical model for the design of
cellularmanufacturing systems (2006) International Journal of Production Economics,
103, pp. 167-171., S3;
solving an extended model of dynamiccellular manufacturing system European Journal
(1), pp. 47-64;
cell formation (1998) Annals of Operations Research, 11 (1), pp. 97-107;
Ahkioon, S., Bulgak, A.A., Bektas, T., Integrated cellular manufacturing systems
design with production planningand dynamic system reconfiguration (2009) European
McLean, C.R., Bloom, H.M., Hopp, T.H., The virtual manufacturing cell (1982)
Proceedings of the Fourth IFAC/IFIP Conference on in Formation ControlProblems in
Manufacturing Technology Gaithersburg MD, pp. 1-9;
cellular manufacturing systems (1992) American Production & Inventory Control
Society Conference, pp. 410-414., 4-5 October, Quebec, Montreal;
flow shops: An analyticalapproach (1999) International Journal of Flexible
Ratchev, S.M., Concurrent process and facility prototyping for formation of
virtualmanufacturing cells (2001) Integrated Manufacturing Systems, 12 (4), pp.
306-315;
virtual cellformation approach (2001) Journal of the Operational Research Society,
52 (6), pp. 673-681;
reconfiguration of cellular manufacturingsystems using virtual cells (2002)
Production Planning & Control, 13 (4), pp. 381-393;
manufacturingcells (2003) International journal of production research, 41 (11),
pp. 2597-2618;
mathematical programmingapproach (2005) Robotics and Computer Integrated
past research andidentification of future research (2006) International Journal of
Flexible Manufacturing Systems, 17, pp. 71-92
[email protected]
ISBN: 9781424441365
ABBREVIATED SOURCE TITLE: Int. Conf. Comput. Ind. Eng CIE
SOURCE: Scopus
Shafer, S.M., Rogers, D.F.

7102733843;7402049167;
Similarity and distance measures for cellular manufacturing. Part II. An extension
and comparison
59 times.
0027610411&doi=10.1080%2f00207549308956793&partnerID=40&md5=b253cbf739f334975c4f20a
eba2145aa
DOI: 10.1080/00207549308956793
AFFILIATIONS: Department of Management, School of Business Administration,
University of Miami, 414 Jenkins Building, Coral Gables, FL, 33124-9145, United
States;
Department of Quantitative Analysis, College of Business Administration, University
of Cincinnati, 531 Carl H. Lindner Hall, Cincinnati, OH, 45221-0130, United States
ABSTRACT: A new similarity measure that is easy to calculate, intuitively
appealing, and overcomes the bias inherent in many existing similarity measures is
proposed. This new similarity measure is particularly useful for reducing the size
of the cell formation problem thus reducing the computational burden. Additionally,
an investigation comparing several measures of association is presented. Included
in this investigation is a comparison of single linkage clustering, average linkage
clustering, complete linkage clustering, and Ward's method for clustering. © 1993
Taylor & Francis Group, LLC.
INDEX KEYWORDS: Computational complexity; Machinery; Mathematical models;
Operations research; Scheduling, Average linkage clustering; Cell formation
problem; Cellular manufacturing; Complete linkage clustering; Similarity and
distance measures; Single linkage clustering; Ward's clustering method, Manufacture
REFERENCES: Ballakur, A., Steudel, H.J., A within-cell utilization based heuristic
Research, 24, pp. 451-464;
Chu, S.-H., Tsai, M., A comparison of three array-based clustering techniques for
28, pp. 1417-1433;
King, J.R., Nakornchai, Y., Machine-component group formation in group technology:
117-133;
Miltenburg, J., Zhang, W., A comparative evaluation of nine well-iknown algorithms
Mosier, C., An ewxperiment investigating the application of clustering procedures
and similarity coefficients to the gt machine cell formation problem (1989)
Research, 31 (5), pp. 1133-1142;
Mace (1984) International Journal of Production Research, 22, pp. 937-948;
Wemmerlov, U., Introduction to the special issue (1991) Journal of Operations
CORRESPONDENCE ADDRESS: Shafer, S.M.; Department of Management, School of Business
Administration, University of Miami, 414 Jenkins Building, Coral Gables, FL, 33124-
9145, United States
ISSN: 00207543
SOURCE: Scopus
Korei, A.
55838438800;
Applying formal concept analysis in machine-part grouping problems
(2013) SAMI 2013 - IEEE 11th International Symposium on Applied Machine
Intelligence and Informatics, Proceedings, art. no. 6480974, pp. 197-200. Cited 1
time.
84875614036&doi=10.1109%2fSAMI.2013.6480974&partnerID=40&md5=bf662f2fddda8ec521163f
01a0e1f74f
DOI: 10.1109/SAMI.2013.6480974
AFFILIATIONS: University of Miskolc, Hungary
ABSTRACT: The machine-part cell formation problem is a frequently studied task of
group technology. Starting from the machine-part incidence matrix the manufacturing
cells and the associated part families are to be determined. This paper provides a
solution method of the problem applying the tools of formal concept analysis. Based
on formal concepts we define the extent partitions of an object set, which can be
used for determining machine cells. Some experimental results are also added
solving sample problems identified in the literature. © 2013 IEEE.
INDEX KEYWORDS: Cell formation problem; Formal concepts; Incidence matrices;
Machine cell; Machine-part grouping; Part family; Solution methods, Cellular
manufacturing; Formal concept analysis; Group technology; Information analysis,
Problem solving
3-21;
Belohlavek, R., Kulkarni, N., Vychodil, V., A novel approach to cell formation
(2009) ICFCA 2009, LNAI, 5548, pp. 210-223., S. Ferré and S. Rudolph (Eds. );
Ganter, B., Wille, R., (1999) Formal Concept Analysis, Mathematical Foundations,
Springer Verlag;
Ganter, B., Körei, A., Radeleczki, S., Extent partitions and context extensions
Math. Slovaca, in Press;
Körei, A., Determining the box extents of a formal context (2012) XXVI. MicroCAD
International Scientific Conference, , University of Miskolc;
Körei, A., Radeleczki, S., Box elements in a concept lattice (2006) Contributions
to ICFCA 2006, pp. 41-56;
Kumar, C., Chandrasekharan, M., Grouping efficacy: A quantitive criterion for
Selim, H., Askin, R.G., Vakharia, A., Cell formation in Group Technology: Review,
evaluation and direction for future research (1998) Computers & Industrial
Research, 28 (1), pp. 145-152
CORRESPONDENCE ADDRESS: Korei, A.; University of MiskolcHungary; email: matka@uni-
miskolc.hu
ISBN: 9781467359290
ABBREVIATED SOURCE TITLE: SAMI - IEEE Int. Symp. Appl. Mach. Intell. Informatics,
Proc.
SOURCE: Scopus
Wang, Z., Zhang, Q., Ma, Y., Zhang, J., Liu, Y.

36722892800;35316561600;57198591806;36816765600;36816206300;
An improved PBIL algorithm for the machine-part cell formation
(2010) Applied Mechanics and Materials, 26-28, pp. 498-501. Cited 1 time.
78650853572&doi=10.4028%2fwww.scientific.net%2fAMM.26-
28.498&partnerID=40&md5=30c0b403f24ec2cfb32e64ba8cb72c61
DOI: 10.4028/www.scientific.net/AMM.26-28.498
China
optimization problem. Past research has shown that although the genetic algorithm
(GA) can get high quality solutions, special selection strategy, crossover and
mutation operators as well as the parameters must be defined previously to solve
the problem efficiently and flexibly. In this paper, an improved permutation code
PBIL is adopted to solve the machine-part cell formation problem. Simulation
results on five well known problems show that the PBIL can get satisfied solutions
more simply and efficiently. © (2010) Trans Tech Publications.
AUTHOR KEYWORDS: GA; Grouping efficacy; Machine-part cell formation; PBIL
INDEX KEYWORDS: Cell formation; Cell formation problem; Combinational optimization;
Crossover and mutation; GA; Grouping efficacy; High-quality solutions; Machine-part
cell formation; NP Complete; PBIL; Pbil algorithms; Permutation codes; Selection
strategies; Simulation result, Cellular manufacturing; Genetic algorithms;
Mathematical operators; Mechanical engineering, Problem solving
REFERENCES: Joines, J.A., Culbreth, C.T., King, R.E., Manufacturing cell design: An
pp. 69-85;
3651-3670;
21;
Larranaga, P., Lozano, J.A., (2002) Estimation of Distribution Algorithms: A New
Tool for Evolutionary Computation, , Kluwer Academic Publishers;
Pelikan, M., Sastry, K., Cantu-Paz, E., (2006) Scalable Optimization via
Probabilistic Modeling: From Algorithms to Applications, , Springer, Heidelberg;
Baluja, S., Population-based incremental learning: A method for integrating genetic
search based function optimization and competitive learning (1994) Carnegie Mellon
University, Technical Report CMU-CS-94-163;
Gonalves, J.F., Resende, M.G.C., An evolutionary algorithm for manufacturing cell
Zhang, Q., Wu, T., Liu, B., Hybrid univariate marnal distribution algorithm based
on clonal selection principle (2007) Journal of Zhejiang University (Engineering
Science), 41, pp. 1715-1718
CORRESPONDENCE ADDRESS: Wang, Z.; Shijiazhuang Institute of Railway Technology,
ISSN: 16609336
ISBN: 9780878492497
ABBREVIATED SOURCE TITLE: Appl. Mech. Mater.
SOURCE: Scopus
Bortolini, M., Manzini, R., Accorsi, R., Mora, C.

54779261700;6701312938;54779320500;24722923600;
An hybrid procedure for machine duplication in cellular manufacturing systems
1155-1173. Cited 14 times.
83555163665&doi=10.1007%2fs00170-011-3334-
2&partnerID=40&md5=2f8add45c8e4c3009ed40e9f30bf2819
DOI: 10.1007/s00170-011-3334-2
AFFILIATIONS: Department of Industrial Mechanical Plants, University of Bologna,
Viale Risorgimento, 2, Bologna 40136, Italy
ABSTRACT: Cellular manufacturing represents an effective and even more applied
alternative in production system organization especially when line or batch-type
production is not economically convenient or technically feasible. This is
particularly true when a wide range of quite similar items need to be produced in
small lot sizes with frequent and expensive setups. Cellular manufacturing is
supported by the so-called cell formation problem whose aim is forming part groups
to be assigned to manufacturing cells, composed by a defined subset of machines, so
that the sum of intercellular flow costs and direct intra-cell costs is minimized.
An effective approach to form manufacturing cells is based on cluster analysis and
on the evaluation of similarity coefficients: machines are grouped by the
application of clustering techniques and finally parts are assigned to clusters.
The aim of this paper is to present a hybrid and original procedure for the cell
formation problem based on cluster analysis and integer linear programming. In
particular, an integer linear programming model optimizes and re-arranges the
configuration of the cells as the result of the application of a hierarchical
clustering algorithm. The proposed model evaluates the possibility of duplicating a
machine in one or more cells in order to reach the best trade-off between direct
cell costs and indirect costs caused by intercellular flows. As a result, all work
areas are correctly designed with the optimal number of machines of each type and
total production system cost is quantified. The presentation and discussion of the
proposed approach is supported by the illustration of a significant case study
which takes inspiration from the literature. © 2011 Springer-Verlag London Limited.
AUTHOR KEYWORDS: Cell formation (CF); Cellular manufacturing (CM); Group
technology (GT); Hybrid procedure; Integer linear programming model; Machine
duplication
INDEX KEYWORDS: Cell formation; Cell formation problem; Clustering techniques; Flow
costs; Hierarchical clustering algorithms; Hybrid procedure; Indirect costs;
Integer Linear Programming; Integer linear programming models; Lot size; Machine
duplication; Optimal number; Production system; Similarity coefficients, Cells;
Cluster analysis; Clustering algorithms; Computer programming; Costs; Flexible
manufacturing systems; Group technology; Integer programming; Linear programming;
Production engineering, Cellular manufacturing
REFERENCES: Sarker, B.R., Measures of grouping efficiency in cellular manufacturing
systems (2001) European Journal of Operational Research, 130 (3), pp. 588-611., DOI
10.1016/S0377-2217(99)00419-1;
10.1080/00207540500478843, PII 791537541;
Pattanaik, I.N., Sharma, B.P., Implementing lean manufacturing with cellular
layout: A case study (2009) Int J Adv Manuf Technol, 42, pp. 772-779.,
10.1007/s00170-008-1629-8;
research (2010) Eur J Oper Res, 206, pp. 509-521., 1188.90002
10.1016/j.ejor.2009.10.020;
manufacturing system (2011) Appl Math Model, 35, pp. 1810-1819., 2763820 1217.90020
10.1016/j.apm.2010.10.011;
Kennedy, J., Eberhart, R.C., Particle swarm optimization (1995) Proc International
Conference on Neural Networks, pp. 1942-1948;
machine-part cell formation problem (2010) Comput Oper Res, 37, pp. 2071-2081.,
05780043 10.1016/j.cor.2010.02.007;
Technol, 46, pp. 1201-1213., 10.1007/s00170-009-2170-0;
(1), pp. 1-18., DOI 10.1016/j.omega.2004.07.016, PII S0305048304001112;
Jones, D.R., Beltramo, M.A., Solving partitioning problems with genetic algorithms
(1991) Proc 4th International Conference on Genetic Algorithms, pp. 442-449;
manufacturing cells (1999) Int J Prod Econ, 6061, pp. 421-426., 10.1016/S0925-
5273(98)00167-4;
Car, Z., Mikac, T., Evolutionary approach for solving cell-formation problem in
cell manufacturing (2006) Advanced Engineering Informatics, 20 (3), pp. 227-232.,
DOI 10.1016/j.aei.2006.01.005, PII S1474034606000073;
algorithm (2005) Proc Stochastic Algorithms: Foundations and Applications - 3 Rd
International Symposium, pp. 213-227., SAGA;
(8), pp. 2219-2245., DOI 10.1016/j.cor.2005.02.005, PII S0305054805000481;
manufacturing deisgn and layout (2007) Eur J Oper Res, 181, pp. 156-167.,
1121.90334 10.1016/j.ejor.2006.05.035;
S0925527305000496;
the formation of cellular manufacturing systems (2010) Int J Prod Res, 48 (10), pp.
3029-3060., 1197.90153 10.1080/00207540802644860;
1157-1169., DOI 10.1007/s00170-007-0928-9;
Fjallstromas, P., Algorithms for graph partitioning: A survey (1998) Linkoping
Electronic Articles in Comput Inform Sci, 3 (10);
Selim, H.M., Manufacturing cell formation problem: A graph partitioning approach
(2002) Industrial Management and Data Systems, 102 (5-6), pp. 341-352;
Ateme-Nguema, B.H., Dao, T.-M., Optimization of cellular manufacturing systems
design using the hybrid approach based on the ant colony and tabu search techniques
Engineering Management, pp. 668-673., DOI 10.1109/IEEM.2007.4419274, 4419274, IEEM
2007: 2007 IEEE International Conference on Industrial Engineering and Engineering
Management;
search for manufacturing cell formation (2009) Int J Adv Manuf Technol, 40, pp.
362-372., 10.1007/s00170-007-1346-8;
Ghezavati, V., Saidi-Mehrabad, M., Designing integrated cellular manufacturing
Wu, N., A concurrent approach to cell formation and assignment of identical
machines in group technology (1998) International Journal of Production Research,
36 (8), pp. 2099-2114;
Irani, S.A., Huang, H., Cascading flowlines and layout modules: Practical
strategies for machine duplication in facility layouts (2005) International Journal
of Flexible Manufacturing Systems, 17 (2), pp. 119-149., DOI 10.1007/s10696-006-
8124-z, Virtual and Non-traditional Manufacturing Cells;
57., 10.1049/tpe.1972.0006;
Gupta Tarun, Seifoddini Hamid, Production data based similarity coefficient for
Anderberg, M.R., (1973) Cluster Analysis for Applications, , Academic press New
York 0299.62029;
Moisier, C.T., An experiment investigating the application of clustering procedures
and similarity coefficients to the GT machine cell formation problem (1989) Int J
Prod Res, 27 (10), pp. 1811-1835., 10.1080/00207548908942656;
Sokal, R.R., Sneath, P.H.A., (1968) Principle of Numerical Taxonomy, , W.H.Freeman
San Francisco, CA;
Research, 34 (12), pp. 3401-3416;
Seifoddini, H., Djassemi, M., Analysis of efficiency measures for block diagonal
machine-component charts (1994) Proc 16th International Conference on Computer and
Industrial Engineering, , Ashikaga, Japan
CORRESPONDENCE ADDRESS: Manzini, R.; Department of Industrial Mechanical Plants,
University of Bologna, Viale Risorgimento, 2, Bologna 40136, Italy; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Chang, C.-C., Wu, T.H.

57144688100;7404814990;
A novel approach to determine cell formation, cell layout, and intracellular
machine layout
(2012) Proceedings - 2012 6th International Conference on New Trends in Information
Science, Service Science and Data Mining (NISS, ICMIA and NASNIT), ISSDM 2012, art.
no. 6528726, pp. 717-721. Cited 2 times.
84880991245&partnerID=40&md5=03ee8d75c7ef9ad2741fc0d680ab0f18
AFFILIATIONS: Department of Information Management, Jen-Teh Junior College of

Medicine, Nursing and Management, Miaoli, Taiwan;
Department of Business Administration, National Taipei University, Taipei, Taiwan
ABSTRACT: Formation of manufacturing cell, determination of cell layout and
intracellular machine layout are three basic steps in the design of cellular
manufacturing system (CMS). However, cell formation problem and cell layout problem
are NP-hard combinational problems. It is difficult to obtain optimal solutions in
an acceptable length of time, especially for large-sized problems. This paper
proposes a novel approach, water flow-like algorithm (WFA), to tackle this problem.
When compared with the mathematical programming approach which took one hour to
solve problem, the proposed algorithm is able to produce optimal solution in less
than one second. This shows that the proposed approach is extremely effective and
efficient. © 2012 AICIT.
AUTHOR KEYWORDS: cell formation; cell layout; intracellular machine layout;
water flow-like algorithm
INDEX KEYWORDS: Cell formation; Cell formation problem; Cell layout; Cell layout
problem; Combinational problems; Large-sized; Machine layout; Optimal solutions,
Algorithms; Cells; Cellular manufacturing; Cytology; Data mining; Flow of water;
Hydraulics; Information science; Mathematical programming; Optimal systems, Problem
solving
Research, 25, pp. 639-655;
Iraj, M., Amin, A., Mohammad, M.P., Maghsud, S., A new mathematical model for
manufacturing cells (2005) Computers and Industrial Engineering, 48, pp. 3-21;
pp. 1609-1617;
346-360;
Economics, 101, pp. 329-352;
48, pp. 471-489;
Yang, F.C., Wang, Y.P., Water flow-like algorithm for object grouping problems
(2007) Journal of the Chinese Institute of Industrial Engineers, 24, pp. 475-488;
Aneke, N.A.G., Carrie, A.S., A design technique for the layout of multi-product
flowlines (1986) International Journal of Production Research, 24, pp. 471-481;
Ho, Y.C., Lee, C.E.C., Moodie, C.L., Two sequence-pattern, matching-based, flow
analysis methods for multi-flow lines layout design (1993) International Journal of
CORRESPONDENCE ADDRESS: Department of Information Management, Jen-Teh Junior
College of Medicine, Nursing and Management, Miaoli, Taiwan
ISBN: 9788994364193
ABBREVIATED SOURCE TITLE: Proc. - Int. Conf. New Trends Inf. Sci., Serv. Sci. Data
Min. (NISS, ICMIA NASNIT), ISSDM
SOURCE: Scopus
Wu, T.-H., Yeh, J.-Y., Syau, Y.-R.

7404814990;7201896104;6603885005;
A tabu search approach to the generalized assignment problem
311. Cited 6 times.
24644476452&doi=10.1080%2f10170660409509411&partnerID=40&md5=c49bb0009a540f68073572
a9546b3018
DOI: 10.1080/10170660409509411
AFFILIATIONS: Department of Industrial Engineering, Da-Yeh University, 112 Shan-
Jiau Rd., Da-Tsuen, Changhwa 515, Taiwan
ABSTRACT: The generalized assignment problem (GAP) determines the maximum profit or
minimum cost assignment of n jobs to m agents, which is a problem embedded in the
cell formation problem. In this paper, a tabu search heuristic, TSDL that consists
of dynamic tabu tenure with long-term memory mechanism is presented to solve the
GAPs. A standard set of 84 test problems adopted from the literature is used to
evaluate the performance of the proposed algorithm and for comparison with other
existing methods. The TSDL can very efficiently find solutions with good quality.
The proposed algorithm should thus be useful to practitioners and researchers. ©
AUTHOR KEYWORDS: Assignment; Cell formation problem; Generalized assignment
problem; Tabu search
INDEX KEYWORDS: Algorithms; Costs; Heuristic methods, Assignment; Cell formation
problem; Generalized assignment problem (GAP); Tabu search, Problem solving
REFERENCES: Amini, M.M., Racer, M., A hybrid heuristic for the generalized
assignment problem (1995) European Journal of Operational Research, 87, pp. 343-
348;
Baker, B.M., Sheasby, J., Accelerating the convergence of subgradient optimization
Baker, M., Sheasby, J., Extensions to the generalized assignment heuristic for
vehicle routing (1999) European Journal of Operational Research, 119, pp. 147-157;
Battiti, R., Tecchiolli, G., The reactive tabu search (1994) ORSA Journal on
Computing, 6, pp. 126-140;
Beasley, J.E., OR-Library: Distributing test problems by electronic mail (1990)
Cattrysse, D., Degraeve, Z., Tistaert, J., Solving the generalized assignment
problem using polyhedral (1998) European Journal of Operational Research, 108, pp.
618-628;
Cattrysse, D.M., Salomon, L.N., Van Wassenhove, A set partitioning heuristic for
the generalized assignment problem (1994) European Journal of Operational Research,
72, pp. 167-174;
Cattrysse, D.G., Van Wassenhove, L.N., A survey of algorithms for the generalized
assignment problem (1992) European Journal of Operational Research, 60, pp. 260-
272;
Chu, P.C., Beasley, J.E., A genetic algorithm for the generalised assignment
problem (1997) Computers & Operations Research, 24, pp. 17-23;
Fisher, M.L., Jaikumar, R., Van Wassenhove, L.N., A multiplier adjustment method
for the generalized assignment problem (1986) Management Science, 32, pp. 1095-
1103;
Glover, F., Tabu search—Part I (1989) ORSA Journal on Computing, 1, pp. 190-206;
Glover, F., Tabu search-Part II (1990) ORSA Journal on Computing, 2, pp. 4-32;
Glover, F., Laguna, M., (1997) Tabu Search, , Boston: Kluwer Academic Publishers;
Grigoriadis, M.D., Tang, D.J., Woo, L.S., Considerations in the optimal synthesis
of some communications networks (1975) Paper presented at 45th joint National
ORSA/TIMS Meeting, , Boston, MA, U.S.A;
Haddadi, S., Simple Lagrangian heuristic for the set covering problem (1997)
Held, M., Karp, R.M., The traveling-salesman problem and minimum spanning trees:
Part II (1971) Mathematical Programming, 1, pp. 6-25;
Laguna, M., Kelly, J.P., González-Velarde, J.L., Glover, F., Tabu search for the
multilevel generalized assignment problem (1995) European Journal of Operational
Research, 82, pp. 176-189;
Lorena, L.A.N., Narciso, M.G., Relaxation heuristics for a generalized assignment
problem (1996) European Journal of Operational Research, 91, pp. 600-610;
Martello, S., Toth, P., An algorithm for the generalized assignment problem (1981)
Operations Research, pp. 589-603., Brans J.P., (ed), Amsterdam: North-Holland;
Martello, S., Toth, P., (1990) Knapsack Problems: Algorithms and Computer
Implementations, , New York: John Wiley and Sons;
Narciso, M.G., Lorena, L.A.N., Lagrangean/surrogate relaxation for generalized
assignment problems (1999) European Journal of Operational Research, 114, pp. 165-
177;
Osman, I.H., Heuristics for the generalized assignment problem: Simulated annealing
and tabu search approaches (1995) OR Spektrum, 17, pp. 211-225;
the p-Median problem (1996) European Journal of Operational Research, 96, pp. 329-
342;
Ross, G.T., Soland, R.M., A branch-and-bound algorithm for the generalized
assignment problem (1975) Mathematical Programming, 8, pp. 91-103;
procedure for the fixed charge transportation problem (1998) European Journal of
Yagiura, M., Yamaguchi, T., Ibaraki, T., A variable depth search algorithm with
branching search for the generalized assignment problem (1998) Optimization Methods
and Software, 10, pp. 419-441;
Yagiura, M., Ibaraki, T., Glover, F., An ejection chain approach for the
generalized assignment problem INFORMS Journal on Computing, , (to appear)
CORRESPONDENCE ADDRESS: Wu, T.-H.; Department of Industrial Engineering, Da-Yeh
University, 112 Shan-Jiau Rd., Da-Tsuen, Changhwa 515, Taiwan; email:
[email protected]
ISSN: 10170669
SOURCE: Scopus

56241400000;16643276600;
Machine-part cell formation for maximum grouping efficacy based on genetic
algorithm
(2016) 2015 IEEE Workshop on Computational Intelligence: Theories, Applications and
Future Directions, WCI 2015, art. no. 7495521, . Cited 6 times.
84979710794&doi=10.1109%2fWCI.2015.7495521&partnerID=40&md5=727a97663ae6ce4c3598c6c
c93602464
DOI: 10.1109/WCI.2015.7495521
AFFILIATIONS: Department of Mechanical Engineering, Jadavpur University, Kolkata,
700032, India
ABSTRACT: Cellular manufacturing system (CMS) makes use of application of group
technology. The objective of cell formation problems (CFP) in CMS is to identify
part families and machine cells in order to minimize the intercellular movement and
to maximize the machine utilization within a cell. Previous study in CFP generally
focused on maximizing grouping efficacy (GC) by minimizing exceptional elements as
well as void elements. In this paper, a genetic algorithm heuristic is presented.
Computational experiments were carried out with 20 benchmark problem sets.
Computational results show that the proposed heuristic has shown to produce
solutions in terms of GC that are either better than or competitive with the
existing algorithms. © 2015 IEEE.
AUTHOR KEYWORDS: cellular manufacturing system; exceptional machines and parts
elements; genetic algorithm; grouping efficacy; machine-part cell formation
INDEX KEYWORDS: Algorithms; Artificial intelligence; Cells; Computation theory;
Cytology; Genetic algorithms; Group technology; Heuristic algorithms; Machinery;
Manufacture, Cell formation; Cell formation problem; Computational experiment;
Computational results; Exceptional elements; Grouping efficacy; Intercellular
movement; Machine utilization, Cellular manufacturing
REFERENCES: Hyer, N., Wemmerlov, U., Group technology in the us manufacturing
industry: A survey of current practices (1989) International Journal of Production
Research, 27, pp. 1287-1304;
25, pp. 639-665;
considering investment and operational cost (1993) Eur J Oper Res, 69, pp. 330-341;
Li, J., Ding, Z., Fuzzy clustering analysis and fuzzy pattern recognition method
for formation of part families (1988) 16th North American Manufacturing Research
Conference (NAMRC) Proceeding Society of Manufacturing Engineers, pp. 558-563;
artificial intelligence (ai) methods for designing and analysis of reconfigurable
cellular manufacturing system (rcms) (2009) International Conference on Adaptive
Science and Technology, pp. 402-409;
Miljkovic, Z., Babic, B., Machine-part family formation by using art-1 simulator
and flexy (2005) FME Transactions, 33 (3), pp. 157-162;
manufacturing cell formation problems (2008) Expert Syst Appl, 34, pp. 1609-1617;
systems (2001) Computer & Industrial Engineering, 39, pp. 125-144;
Goncalves, J.F., Resende, M.G., An evolutionary algorithm for manufacturing cell
2158;
Husseinzadeh, K.A., Karimi, B., Noktehdan, A., A novel discrete particle swarm
AdvManufTechnol, 73, pp. 1543-1556;
2079;
Diaz, J.A., Luna, D., Luna, R., A grasp heuristic for the manufacturing cell
Srinivasa Gupta, N., Devika, D., Valarmathi, B., Sowmiya, N., Shinde, A., CARI-A
relevance index (2014) International Journal of Production Research, 52 (24), pp.
7297-7309;
Feo, T.A., Resende, M.G.C., Greedy randomized adaptive search procedures (1995) J
Glob Optim, 6, pp. 109-133;
Research, 24 (2), pp. 451-464;
Prod Res, 28, pp. 233-243;
predatot-prey genetic algorithm (2012) Applied Soft Computing, 12, pp. 559-572;
Garbie, I.H., Parsaei, H.R., Leep, H.R., Introducing new parts into existing
cellular manufacturing systems based on a novel similarity coefficient (2005)
pp. 117-133;
Azadeh, N., Mohammad, S., Hosseiniand, S., Saidi-Mehrabad, M., A metaheuristic
algorithm for the manufacturing cell formation problem based on grouping efficacy
(2015) Int J AdvManufTechnol, , DOI 10.1007/s00170-015-7052-z
CORRESPONDENCE ADDRESS: Hazarika, M.; Department of Mechanical Engineering,
Jadavpur UniversityIndia; email: [email protected]
ISBN: 9781467382151
ABBREVIATED SOURCE TITLE: IEEE Workshop Comput. Intell.: Theor., Appl. Future Dir.,
WCI
SOURCE: Scopus
Ying, K.-C., Lin, S.-W., Lu, C.-C.

56116887600;7407153943;56975636700;
Cell formation using a simulated annealing algorithm with variable neighbourhood
(2011) European Journal of Industrial Engineering, 5 (1), pp. 22-42. Cited 32
times.
78649702934&doi=10.1504%2fEJIE.2011.037224&partnerID=40&md5=0026a7331eea5aa735fabc6
eaa220323
DOI: 10.1504/EJIE.2011.037224
AFFILIATIONS: Department of Industrial Engineering and Management, National Taipei
University of Technology, 1 Section 3, Chung-Hsiao East Road, Taipei City, 106,
Taiwan;
Department of Information Management, Chang Gung University, 259, Wen-Hwa 1st Road,
Kwei-Shan, Taoyuan, 333, Taiwan;
Graduate Institute of Information and Logistics Management, National Taipei
University of Technology, 1 Section 3, Chung-Hsiao East Road, Taipei City, 106,
Taiwan
ABSTRACT: The broad applications of cellular manufacturing make the cell formation
problem (CFP) a core subject in the field of manufacturing. Due to the
combinatorial nature of the CFP, a simulated annealing-based meta-heuristic with
variable neighbourhood was developed to form part-machine cells. To validate and
verify the proposed approach, computational experiments were conducted on a set of
CFPs from the literature. Using the grouping efficacy as a performance criterion,
the proposed approach is shown to outperform existing state-of-the-art algorithms
by exceeding or matching the best known solutions in the majority of the test
problems. The evaluation results clearly show that this study successfully develops
an effective approach for CFPs. © 2011 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation problem; CFP; Manufacturing cell design; Meta-
heuristic; Simulated annealing
INDEX KEYWORDS: Broad application; Cell formation; Cell formation problem; CFP;
Computational experiment; Evaluation results; Grouping efficacy; Machine cell;
Manufacturing cells; Metaheuristic; Neighbourhood; Performance criterion; Simulated
annealing algorithms; State-of-the-art algorithms; Test problem, Annealing;
Cellular manufacturing; Flexible manufacturing systems; Heuristic methods,
Simulated annealing
(1), pp. 101-113;
Ballakur, A., (1985) An investigation of part family/machine group formation in
designing a cellular manufacturing system, , PhD thesis, University of Wisconsin-
Madison;
Research, 25 (5), pp. 639-665;
pp. 2097-2116;
Burbidge, J., Production flow analysis (1963) Production Engineer, 42 (12), pp.
742-752;
Burbidge, J.L., (1975) The Introduction of Group Technology, , Heinemann, Landon;
Research, 24 (2), pp. 451-464;
Research, 24 (5), pp. 1221-1264;
Chen, C.L., Cotruvo, N.A., Beak, W., A simulated annealing solution to the cell
2601-2614;
Chen, H.G., Heuristics for operator scheduling in group technology cells (1995)
(5), pp. 1325-1337;
Diaz, B.A., Lazano, R., Guerrero, F., Machine cell formation in generalized group
technology (2001) Computers and Industrial Engineering, 41 (2), pp. 227-240;
2059-2079;
1182-1189;
Research, 18 (2), pp. 213-232;
King, J.R., Nakornchai, V., Machine-component group formation in group technology,
pp. 117-133;
Kirkpatrik, S., Gelatt, C.D., Vecch, M.P., Optimization by simulated annealing
(1983) Science, 220, pp. 671-680;
1715-1728;
manufacturing systems (1986) European Journal of Operations Research, 24 (3), pp.
387-397;
pp. 2633-2646;
Lin, S.W., Ying, K.C., Solving single machine total weighted tardiness problems
with sequence-dependent setup times by meta-heuristics (2007) International Journal
Lin, S.W., Gupta, J.N.D., Ying, K.C., Lee, Z.J., Using simulated annealing to
scheduling a flowshop manufacturing cell with sequence dependent family setup times
51 (2), pp. 53-57;
993-1009;
Olivua-Lopez, E., Prucheck, G.F.K., Load balancing for group technology planning
and control (1979) International Journal of MTDR, 19 (2), pp. 259-274;
Reisman, A., Kumar, A., Motwani, J., Cheng, C., Cellular manufacturing, a
programming model (1990) Mathematical Computer Modeling, 13 (9), pp. 71-82;
Review, evaluation and directions for future research (1998) Computers Industrial
Singh, N., Design of cellular manufacturing system: An invited review (1993)
Research, 32 (9), pp. 2149-2158;
pp. 463-478;
Research, 28 (1), pp. 145-152;
Tiwari, M.K., Kumar, S., Kumar S. Prakash, Shankar, R., Solving part-type and
operation allocation problems in an FMS: An approach using constraints-based fast
simulated annealing algorithm (2006) IEEE Transactions on System, Man and
Cybernetics - Part A: Systems and Human, 36 (6), pp. 1170-1184;
Wemmerlö, U., Hyer, N.L., Research issues in cellular manufacturing (1987)
Wu, T.H., Chang, C.H., Chung, S.H., A simulated annealing algorithm for
(3), pp. 1609-1617;
140-152;
Economics, 101 (2), pp. 329-352;
Ying, K.C., Liao, C.J., An ant colony system for permutation flow-shop sequencing
(2004) Computers and Operations Research, 31 (5), pp. 791-801
CORRESPONDENCE ADDRESS: Lin, S.-W.; Department of Information Management, Chang
Gung University, 259, Wen-Hwa 1st Road, Kwei-Shan, Taoyuan, 333, Taiwan; email:
[email protected]
ISSN: 17515254
SOURCE: Scopus
Zettam, M.
57188555455;
A discrete teaching learning based optimization algorithm for combinatorial
optimization problems
(2018) International Review on Modelling and Simulations, 11 (1), pp. 32-36. Cited
1 time.
85045421893&doi=10.15866%2firemos.v11i1.12788&partnerID=40&md5=2184c0c8dc6f6a6256b5
cef45a1c35e8
DOI: 10.15866/iremos.v11i1.12788
computer Science, Faculty of science, Ibn Tofail University, Kenitra, Morocco
ABSTRACT: The Teaching Learning Based Optimization algorithm is a population-based
algorithm that was first designed for solving continuous optimization problems. A
Discrete Teaching Learning Based Optimization algorithm is performed for
combinatorial optimization problems in this paper. The proposed Discrete Teaching
Learning Based Optimization algorithm uses a path-relinking strategy combined with
a local search instead of the ways employed in the original Teaching Learning Based
Optimization to move solutions within the search space. Moreover the exploration
and exploitation stages were ensured by a Mean solution. The proposed algorithm was
tested on 35 benchmarks of the cell formation problem. The results were
satisfactory enough to classify the Discrete Teaching Learning Based Optimization
algorithm among promising nature-inspired algorithms. © 2018 Praise Worthy Prize
S.r.l. - All rights reserved.
AUTHOR KEYWORDS: Cell formation problem; Teaching learning based optimization
REFERENCES: Burbidge, J.L., (1975) The Introduction of Group Technology: John Wiley
& Sons, , Incorporated;
Applications, 39 (3), pp. 2408-2414., http://dx.doi.org/10.1016/j.eswa.2011.08.089;
Keesari, H.S., Rao, R.V., Optimization of job shop scheduling problems using
teaching-learning-based optimization algorithm (2014) OPSEARCH, 51 (4), pp. 545-
561;
Korte, B., Vygen, J., (2007) Combinatorial Optimization: Theory and Algorithms:
Springer Publishing Company, , Incorporated;
Mitrofanov, S.P., (1966) Scientific Principles of Group Technology: (Nauchnye
Osnovy Gruppovoĭ Tekhnologii): National Lending Library for Science and Technology,
, Science, N. L. L. f., & Technology;
Rao, R.V., Savsani, V.J., Vakharia, D.P., Teaching– learning-based optimization: A
novel method for constrained mechanical design optimization problems (2011)
Computer-Aided Design, 43 (3), pp. 303-315.,
http://dx.doi.org/10.1016/j.cad.2010.12.015;
Suresh, N.C., Kay, J.M., (2012) Group Technology and Cellular Manufacturing: A
State-Of-The-Art Synthesis of Research and Practice, , Springer US;
Vazirani, V.V., (2001) Approximation Algorithms, , Springer- Verlag New York, Inc;
Sadek, M., Elkholy, M., Metwally, H., Efficient Operation of Wind Turbine with
Doubly Fed Induction Generator Using TLBO Algorithm and Artificial Neural Networks
(2016) International Review on Modelling and Simulations (IREMOS), 9 (6), pp. 464-
472
Laboratory, Department of computer Science, Faculty of science, Ibn Tofail
UniversityMorocco
PUBLISHER: Praise Worthy Prize S.r.l
ISSN: 19749821
ABBREVIATED SOURCE TITLE: Int. Rev. Model. Stimul.
SOURCE: Scopus

16417373200;26430357400;23025569300;35615315700;
A new mathematical model for integrating all incidence matrices in multi-
dimensional cellular manufacturing system
84860417797&doi=10.1016%2fj.jmsy.2011.07.007&partnerID=40&md5=75aaeb6a19ffd054d26b4
c6ba1266f6d
DOI: 10.1016/j.jmsy.2011.07.007
Department of Industrial Engineering, Babol Noshirvani University of Technology,
Babol, Iran;
ABSTRACT: In the past several years, many studies have been carried out on cellular
manufacturing based on a two-dimensional machine-part incidence matrix. Since
workers have important role in doing jobs on machines, assignment of workers to
cells becomes a crucial factor for fully utilization of cellular manufacturing
systems. In this paper, an attempt is made to solve cell formation problem and
minimize the number of voids and exceptional elements in a three dimensional
(cubic) machine-part-worker incidence matrix. The proposed mathematical model
captures the capability of workers in doing different jobs. To demonstrate the
effectiveness of the proposed model, the solution of some test problems is compared
with the literature method. © 2011 The Society of Manufacturing Engineers.
Published by Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Cellular manufacturing; Exceptional elements; Mathematical
model; Voids; Worker flexibility
INDEX KEYWORDS: Assignment of; Cell formation problem; Exceptional elements;
Incidence matrices; New mathematical model; On-machines; Test problem; Voids;
Worker flexibility, Mathematical models, Cellular manufacturing
REFERENCES: Mitrofanov, S.P., (1966) The Scientific Principles of Group Technology,
, National Lending Library Translation Boston Spa, Yorks, UK;
152;
Offodile, O., Mehrez, A., Grznar, J., Cellular manufacturing: A taxonomic review
Research, 38 (5), pp. 1201-1218., DOI 10.1080/002075400189095;
Society, 50, pp. 509-516;
(2004) International Journal of Advanced Manufacturing Technology, 2004, 23, pp.
916-924;
pp. 3-21., DOI 10.1016/j.cie.2004.06.008, PII S0360835204001330;
10.1016/j.amc.2007.01.060, PII S0096300307001014;
pp. 1609-1617;
Pailla, A., Trindade, A.R., Parada, V., Ochi, V.L., A numerical comparison between
S0925527305000496;
27, pp. 19-25;
2358;
group technology (2003) International Journal of Production Economics, 86, pp. 121-
131
[email protected]
ISSN: 02786125
CODEN: JMSYE
SOURCE: Scopus
Agustín-Blas, L.E., Salcedo-Sanz, S., Ortiz-García, E.G., Portilla-Figueras, A.,

Pérez-Bellido, N.M., Jiménez-Fernández, S.
25633738400;12789591800;16316581100;12789659200;36465437600;23975845400;
Team formation based on group technology: A hybrid grouping genetic algorithm
approach
77956410634&doi=10.1016%2fj.cor.2010.07.006&partnerID=40&md5=68117aa7c4de91c522396a
1057c1b3f1
DOI: 10.1016/j.cor.2010.07.006
AFFILIATIONS: Grupo de Heurísticos Modernos de Optimización y Diseño de Redes
(GHEODE), Department of Signal Theory and Communications, Universidad de Alcalá,
28871 Alcalá de Henares, Madrid, Spain
ABSTRACT: This paper presents a new model for team formation based on group
technology (TFPGT). Specifically, the model is applied as a generalization of the
well-known Machine-Part Cell Formation problem, which has become a classical
problem in manufacturing in the last few years. In this case, the model presented
is especially well-suited for problems of team formation arising in R&D-oriented or
teaching institutions. A parallel hybrid grouping genetic algorithm (HGGA) is also
proposed in the paper to solve the TFPGT. The performance of the algorithm is shown
in several synthetic TFPGT instances, and in a real problem: the formation of
teaching groups at the Department of Signal Theory and Communications of the
Universidad de Alcalá in Spain. © 2010 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Group technology; Grouping genetic algorithms; Hybrid
algorithms; Team formation
INDEX KEYWORDS: Cell formation problem; Classical problems; Grouping genetic
algorithms; Hybrid algorithms; New model; Real problems; Team formation, Cellular
manufacturing; Genetic algorithms; Group technology; Signal theory, Technology
Tavana, M., Smither, J.W., Anderson, R.V., D-side: A facility and workforce
planning group multi-criteria decision support system for Johnson Space Center
Research, 34, pp. 3401-3416;
pp. 285-314;
Sarker, B., Measures of group efficiency in cellular manufacturing systems (2001)
pp. 63-78;
Wi, H., Oh, S., Mun, J., Jung, M., A team formation model based on knowledge and
collaboration (2009) Expert Systems with Applications, 36 (5), pp. 9121-9134;
Wi, H., Mun, J., Oh, S., Jung, M., Modeling and analysis of project team formation
factors in a project-oriented virtual organization (ProVO) (2009) Expert Systems
with Applications, 36 (3), pp. 5775-5783;
Strnad, D., Guid, N., A fuzzy-genetic decision support system for project team
formation Applied Soft Computing, , doi:10.1016/j.asoc.2009.08.032, in press;
Dereli, T., Baykasoglu, A., Das, G.S., Fuzzy quality-team formation for value added
auditing: A case study (2007) Journal of Engineering and Technology Management, 24
(4), pp. 366-394;
Tseng, T.L., Huang, C.C., Chu, H.W., Gung, R.R., Novel approach to multi-functional
project team formation (2004) International Journal of Project Management, 22 (2),
pp. 147-159;
Fitzpatrick, E.L., Askin, R.G., Forming effective worker teams with multi-
functional skill requirements (2005) Computers & Industrial Engineering, 48, pp.
593-608;
Fan, Z.P., Chen, Y., Mab, J., Zhu, Y., Decision support for proposal grouping: A
hybrid approach using knowledge rules and genetic algorithms (2009) Expert Systems
2079;
Brown, E.C., Sumichrast, R., CF-GGA: A grouping genetic algorithm for the cell
3651-3669;
Computers in Simulation, 51 (34), pp. 257-271;
Hindi, K.H., Yang, H., Fleszar, K., An evolutionary algorithm for resource-
constrained project scheduling (2002) IEEE Transactions on Evolutionary
based on TOPSIS method (2009) Computers & Operations Research, 36 (5), pp. 1478-
1496;
Wang, S., Lin, S.J., The effects of group composition of self-efficacy and
collective efficacy on computer-supported collaborative learning (2007) Computers
in Human Behaviour, 23, pp. 2256-2268;
Wang, D.Y., Lin, S.J., Sun, C.T., DIANA: A computer-supported heterogeneous
grouping system for teachers to conduct successful small learning groups (2007)
Computers in Human Behaviour, 23, pp. 1997-2010;
Burbridge, J., (1979) Group Technology in the Engineering Industry, , Wiley New
York;
Falkenauer, E., The grouping genetic algorithmwidening the scope of the GAs (1992)
Proceedings of the Belgian Journal of Operations Research, Statistics and Computer
Science, 33, pp. 79-102;
Falkenauer, E., (1998) Genetic Algorithms for Grouping Problems, , Wiley New York;
Brown, E.C., Vroblefski, M., A grouping genetic algorithm for the microcell
sectorization problem (2004) Engineering Applications of Artificial Intelligence,
17 (6), pp. 589-598;
James, T., Vroblefski, M., Nottingham, Q., A hybrid grouping genetic algorithm for
the registration area planning problem (2007) Computer Communications, 30 (10), pp.
2180-2190., DOI 10.1016/j.comcom.2007.04.018, PII S0140366407001806;
Agustn-Blas, L.E., Salcedo-Sanz, S., Ortiz-Garca, E.G., Portilla-Figueras, A.,
Prez-Bellido, A.M., A hybrid grouping genetic algorithm for assigning students to
preferred laboratory groups (2009) Expert Systems with Applications, 36, pp. 7234-
7241;
Hung, C., Sumichrast, R.T., Brown, E.C., CPGEA: A grouping genetic algorithm for
material cutting plan generation (2003) Computers & Industrial Engineering, 44 (4),
pp. 651-672;
Whitley, D., Rana, S., Heckendorn, R.B., The island model genetic algorithm,
population size and convergence: On separability (1999) Journal of Computing and
Information Technology, 7, pp. 33-47;
Meyer, T., Ernst, A.T., Krishnamoorthy, M., A 2-phase algorithm for solving the
single allocation p-hub center problem (2009) Computers & Operations Research, 36,
pp. 3143-3151;
Santiago-Mozos, R., Salcedo-Sanz, S., Deprado-Cumplido, M., Bousoo-Calzn, C., A
two-phase heuristic evolutionary algorithm for personalizing course timetables: A
case study in a Spanish University (2005) Computers & Operations Research, 32 (7),
pp. 1761-1776
CORRESPONDENCE ADDRESS: Salcedo-Sanz, S.; Grupo de Heurísticos Modernos de
Optimización y Diseño de Redes (GHEODE), Department of Signal Theory and
Communications, Universidad de Alcalá, 28871 Alcalá de Henares, Madrid, Spain;
ISSN: 03050548
CODEN: CMORA
SOURCE: Scopus
Sofianopoulou, S.
6603156425;
Formation of manufacturing cells in group technology using a genetic algorithm
approach
77954874239&doi=10.1504%2fIJISE.2010.030748&partnerID=40&md5=1dfbde1a549b5e456b550d
e46ee1228f
DOI: 10.1504/IJISE.2010.030748
AFFILIATIONS: Department of Industrial Management and Technology, University of
Piraeus, 80 Karaoli and Dimitriou str., Piraeus 18534, Greece
ABSTRACT: To cope with a high level of product variety and a small manufacturing
lot sizes, novel production techniques have immerged aiming at improving
productivity and reducing manufacturing costs. Among them, group technology
attempts to decentralise the process of production by identifying the elements of
the manufacturing process and analysing their attributes. The purpose of this work
is to describe a genetic algorithm approach specifically adapted to the cell
formation problem, with the objective of minimising the interaction among cells,
i.e. the inter-cellular traffic subject to cell size constraints. Machine sequences
of operations have been taken into account. A brief overview of genetic algorithms
is also presented in the article. Computational results for randomly produced
representative problems are included. Copyright © 2010 Inderscience Enterprises
Ltd.
AUTHOR KEYWORDS: Cellular manufacturing problem; Genetic algorithm; Group
technology
INDEX KEYWORDS: Cell formation problem; Cell size; Computational results; Genetic
algorithm approach; Lot size; Manufacturing cells; Manufacturing cost;
Manufacturing process; Product variety; Production techniques, Cost reduction;
Flexible manufacturing systems; Genetic algorithms; Group technology; Technology,
REFERENCES: Al-Sultan, K.S., Fedjki, C.A., A genetic algorithm for part family
formation problem (1997) Production Planning and Control, 8, pp. 788-796;
(1995) Mathematics of Computational Modelling, 21, pp. 61-73;
pp. 2219-2245;
Chambers, L., (1995) Practical Handbook of Genetic Algorithms, 1-2., Boca Paton:
CRC Press, and;
Chiung, M., Mitsuo, G., A genetic algorithm-based approach for design of
independent manufacturing cells (1999) Int. J. Production Economics, 60-61, pp.
421-426;
Eliiyi, D.T., Kandiller, L., A decision support system for the cell formation
problem (2008) Int. J. Industrial and Systems Engineering, 3, pp. 348-367;
J. Computer Integrated Manufacturing, 8, pp. 92-101;
Hadley, S.W., Finding part-machine families using graph partitioning techniques
alternative processing routes by grouping genetic algorithm (2006) Int. J.
Research, 33, pp. 263-283;
Prentice Hall;
Mukattash, A.M., Abbasi, G.Y., Tahboub, K.K., Adil, M.B., A modified revised P-
median approach to cell formation (2007) Int. J. Industrial and Systems
Sekar, V., Srinivasan, G., Heuristics for operator allocation and sequencing in
just-intime flow line manufacturing cell (1995) Computers and Industrial
formulation of machine cells in group technology (1997) Int. J. Production
Research, 35, pp. 501-511;
Sofianopoulou, S., Response to Srinivasan's note (1998) Int. J. Production
Research, 36, pp. 1449-1451;
Sofianopoulou, S., Design of part-machine cells in manufacturing systems using
mathematical programming techniques (1999) Advances in Manufacturing, pp. 373-384.,
S. G. Tzafestas Ed., New York, NY: Springer;
manufacturing design layout (2007) European Journal of Operational Research, 181,
pp. 156-167;
Operational Research, 151, pp. 434-446
CORRESPONDENCE ADDRESS: Sofianopoulou, S.; Department of Industrial Management and
Technology, University of Piraeus, 80 Karaoli and Dimitriou str., Piraeus 18534,
Greece; email: [email protected]
ISSN: 17485037
SOURCE: Scopus
Zhang, Q., Liu, B., Bi, L., Wang, Z., Ma, B.

35316561600;57196891286;26641644800;36775562400;55434960100;
Estimation of distribution algorithms for the machine-part cell formation
Artificial Intelligence and Lecture Notes in Bioinformatics), 5821 LNCS, pp. 82-91.
Cited 2 times.
3-642-04843-2_10&partnerID=40&md5=7ec5f7f7046db84f00ef53dad8ae340c
DOI: 10.1007/978-3-642-04843-2_10
China;
Hebei Academy of Sciences, Shijiazhuang 050081, China;
Information Center of Hebei Education Department, Shijiazhuang 050000, China
optimization in cellular manufacturing system. Previous researches have revealed
that although the genetic algorithm (GA) can get high quality solutions, special
selection strategy, crossover and mutation operators as well as the parameters must
be defined previously to solve the problem efficiently and flexibly. The Estimation
of Distribution Algorithms (EDAs) has recently been recognized as a new computing
paradigm in evolutionary computation which can overcome some drawbacks of the
traditional GA mentioned above. In this paper, two kinds of the EDAs, UMDA and
EBNABIC, are applied to solve the machine-part cell formation problem. Simulation
results on six well known problems show that the UMDA and EBNABIC can attain
satisfied solutions more simply and efficiently. © Springer-Verlag 2009.
AUTHOR KEYWORDS: EBNABIC; Grouping efficacy; Machine-part cell formation; UMDA
systems; Combinational optimization; Computing paradigm; Crossover and mutation;
EBNA<sub>BIC</sub>; Estimation of distribution algorithms; Evolutionary
computations; Grouping efficacy; High-quality solutions; Machine-part cell
formation; NP Complete; Selection strategies; Simulation result; UMDA, Genetic
algorithms; Mathematical operators; Problem solving, Cellular manufacturing
REFERENCES: Saeed, Z., Ming, L., A new genetic algorithm for the machine/part
grouping problem involving processing times and lot sizes (2003) Computers &
85;
Research, 36, pp. 1325-1337;
3651-3670;
Vila Goncalves Filho, E., Tiberti, A.J., A group genetic algorithm for the machine
cell formation problem (2006) International Journal of Production Economics, 102
(1), pp. 1-21., DOI 10.1016/j.ijpe.2004.12.029, PII S0925527305000551;
Larrañaga, P., Lozano, J.A., (2002) Estimation of Distribution Algorithms: A New
Tool for Evolutionary Computation, , Kluwer Academic Publishers, Dordrecht;
Mühlenbein, H., Paaß, G., From Recombination of Genes to the Estimation of
Distributions I. Binary Parameters (1996) LNCS, 1141, pp. 178-187., Ebeling, W.,
Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. Springer,
Heidelberg;
Pelikan, M., Goldberg, D.E., Lobo, F., A Survey of Optimization by Building and
Using Probabilistic Models (2002) Computational Optimization and Applications, 21,
pp. 5-20;
algorithm for group technology (1986) International Journal of Production Research,
11, pp. 835-850;
Kumar, C.S., Chandrasekharan, M.P., Grouping efficacy: A quantities criterion for
Armañanzas, R., Inza, I., Santana, R., A review of estimation of distribution
algorithms in bioinformatics (2008) BioData Mining, 1, pp. 1-6;
Pelikan, M., Sastry, K., Cantú-Paz, E., (2006) Scalable Optimization Via
Probabilistic Modeling: From Algorithms to Applications, , Springer, Heidelberg;
Etxeberria, R., Larrañaga, P., Global optimization using Bayesian networks (1999)
Second Symposium on Artificial Intelligence (CIMAF 1999) Habana, Cuba, pp. 332-
339., Rodriguez, A.A.O., Ortiz, M.R.S., Hermida, R.S. (eds.) Institute of
Cybernetics, Mathematics, and Physics and Ministry of Science, Technology and
Environment;
Jensen, F.V., (1996) Introduction to Bayesian Networks, , Springer, Secaucus;
Henrion, M., Propagation of uncertainty by probabilistic logic sampling in Bayes'
networks (1988) Uncertainty in Artificial Intelligence, 2, pp. 149-164;
Lima, C.F., Pelikan, M., Goldberg, D.E., Influence of selection and replacement
strategies on linkage learning in BOA (2007) IEEE Congress on Evolutionary
Computation CEC 2007, Singapore, pp. 1083-1090
CORRESPONDENCE ADDRESS: Zhang, Q.; Shijiazhuang Institute of Railway Technology,
ISSN: 03029743
ISBN: 3642048420; 9783642048425
SOURCE: Scopus
Kor, H., Iranmanesh, H., Haleh, H., Hatefi, S.M.

26633022400;26633066100;26421183600;26632738600;
A Multi-objective Genetic Algorithm for optimization of Cellular manufacturing
system
(2009) Proceedings - 2009 International Conference on Computer Engineering and
Technology, ICCET 2009, 1, art. no. 4769466, pp. 252-256. Cited 6 times.
65949086385&doi=10.1109%2fICCET.2009.212&partnerID=40&md5=a7570786c19f31221033fd48f
449b458
DOI: 10.1109/ICCET.2009.212
technology (GT) in which families of parts is produced in manufacturing cells or in
a group of various machines. In this paper, a genetic algorithm approach is
proposed for solving multi-objective cell formation problem. The objectives are the
minimization of both total moves (intercell as well as intracell moves) and the
cell load Variation. In this paper, authors used a SPEA-II method as well known and
efficient standard evolutionary multi-objective optimization technique. This hybrid
method presents the large set of non-dominance solutions for decision makers to
making best solution. The efficiency of multi-objective GA-SPEA II is illustrated
on a large-sized test problem taken from the literature. ©2009 IEEE.
AUTHOR KEYWORDS: Cellular manufacturing system; Genetic algorithm; Multi-
objective; Pareto set; SPEA II
INDEX KEYWORDS: Cell load variation; Cellular manufacturing system; Cellular
manufacturing systems; Decision makers; Evolutionary multiobjective optimization;
Genetic algorithm approach; Hybrid method; Intercell; Intra-cell move;
Manufacturing cells; Multi-objective; Multi-objective cell formation problem;
Multi-objective GA; Multi-objective genetic algorithm; Pareto set; SPEA II; Test
problem, Flexible manufacturing systems; Genetic algorithms; Group technology;
Multiobjective optimization; Set theory, Cellular manufacturing
(2000) Int. J. Prod. Res., 38, pp. 481-507;
Research, 38 (5), pp. 1201-1218., DOI 10.1080/002075400189095;
problems in cellular manufacturing (2004) Int. J. Prod. Res., 42, pp. 4119-4133;
Zitzler, E., Thiele, L., Multiobjective evolutionary algorithms a comparative case
study and the strength pareto approach (1999) IEEE Transactions on Evolutionary
Computation, 3 (4), pp. 257-271., DOI 10.1109/4235.797969;
binary data matrices for group technology (1989) Int. J. Prod. Res., 27, pp. 1035-
1052;
J. Prod. Res., 28, pp. 233-243;
Miltenburg, J., Zhang, W., A comparative evaluation of nine wellknown algorithms
for solving the cell formation problem in group technology (1991) J. Oper. Manage.,
10, pp. 44-72;
Int. J. Prod. Res., 44 (22), pp. 4855-4875;
Haupt, S.E., Haupt, R.L., (1998) Practical Genetic Algorithm, Second Edition, ,
John Wiley;
Formulation, discussion and generalization (1993) Proceedings of the Fifth
International Conference on Genetic Algorithms, pp. 416-423., S. Forrest, editor,
San Mateo, California, University of Illinois at UrbanaChampaign, Morgan Kaufmann
Publishers;
Morse, J., Reducing the size of the nondominated set: Pruning by clustering (1980)
Computers and Operations Research, 7 (1-2), pp. 55-66;
Zitzler, E., Laumanns, M., Thiele, L., SPEA2: Improving the strength pareto
evolutionary algorithm (2001) Evolutionary Methods for Design, Optimization and
Control with Applications to Industrial Problems, pp. 95-100., K. Giannakoglou, D.
Tsahalis, J. Periaux, P. Papailou, and T. Fogarty, editors, EUROGEN 2001. Athens,
Greece
CORRESPONDENCE ADDRESS: Kor, H.; Department of Industrial Engineering, College of
Engineering, University of Tehran, Tehran, Iran; email: [email protected]
ISBN: 9780769535210
ABBREVIATED SOURCE TITLE: Proc. - Int. Conf. Comput. Eng. Technol., ICCET
SOURCE: Scopus
Malakooti, Behnam B., Yang, Ziyong

7004104039;7405434815;
Machine-part cell formation: A multi-criteria approach
0031376623&partnerID=40&md5=f63d08ef444fdbd9b7862dcda3c45c57
AFFILIATIONS: Case Western Reserve Univ, Cleveland, United States

ABSTRACT: Group technology is a modern manufacturing approach which has been widely
used in many industries. This paper addresses the machine-part cell formation
problem while several criteria are considered for the evaluation of alternatives.
The criteria include: the number of work stations or cells, the cost of set-up and
operations of different design, and the number of inter-flow traffic. Methods for
generation of efficient alternatives, evaluation of alternatives, and selection of
the best alternative is presented. This paper develops an approach to determine the
machine-part cells and to choose the part processing plans minimizing the inter-
cell part flow. The proposed approach solves the problem iteratively until a set of
plans and the machine-part cells are obtained with minimal inter-cell part flow.
INDEX KEYWORDS: Problem solving; Process control; Production control; Scheduling,
Group technology; Intercell part flow traffic; Machine part cell formation problem,
Flexible manufacturing systems
CORRESPONDENCE ADDRESS: Malakooti, Behnam B.; Case Western Reserve Univ, Cleveland,
United States
EDITORS: Curry Guy L.
CODEN: IERCE
SOURCE: Scopus
Chattopadhyay, M., Dan, P.K., Mazumdar, S.

56439159300;26325403400;56269106300;
Comparison of visualization of optimal clustering using self-organizing map and
growing hierarchical self-organizing map in cellular manufacturing system
84903736774&doi=10.1016%2fj.asoc.2014.04.027&partnerID=40&md5=44e59c3843ca46b67dc7f
c8b53aead59
DOI: 10.1016/j.asoc.2014.04.027
AFFILIATIONS: Information Technology Area, Indian Institute of Management Raipur,
GEC Campus, Sejbahar, Raipur 492015, India;
Department of Industrial Engineering and Management, School of Engineering, West
Bengal University of Technology, Salt-Lake City, Kolkata 700064, West Bengal,
India;
Department of Business Management, Calcutta University, Alipore Campus, Reformatory
Street, Kolkata 700027, India
ABSTRACT: The present research deals with the cell formation problem (CFP) of
cellular manufacturing system which is a NP-hard problem thus, the development of
optimum machine-part cell formation algorithms has always been the primary
attraction in the design of cellular manufacturing system. In this proposed work,
the self-organizing map (SOM) approach has been used which is able to project data
from a high-dimensional space to a low-dimensional space so it is considered a
visualized approach for explaining a complicated CFP data set. However, for a large
data set with a high dimensionality, a traditional flat SOM seems difficult to
further explain the concepts inside the clusters. We propose one such possible
solution for a large CFP data set by using the SOM in a hierarchical manner known
as growing hierarchical self-organizing map (GHSOM). In the present work, the two
novel contributions using GHSOM are: the choice of optimum architecture through the
minimum pattern units extracted at layer 1 for the respective threshold values and
selection. Furthermore, the experimental results clearly indicated that the
machine-part visual clustering using GHSOM can be successfully applied in
identifying a cohesive set of part family that is processed by a machine group.
Computational experience specifically with the proposed GHSOM algorithm, on a set
of 15 CFP problems from the literature, has shown that it performs remarkably well.
The GHSOM algorithm obtained solutions that are at least as good as the ones found
the literature. For 75% of the cell formation problems, the GHSOM algorithm
improved the goodness of cell formation through GTE performance measure using SOM
as well as best one from the literature, in some cases by as much as more than
12.81% (GTE). Thus, comparing the results of the experiment in this paper with the
SOM and GHSOM using the paired t-test it has been revealed that the GHSOM approach
performed better than the SOM approach so far the group technology efficiency (GTE)
measures of performance of the goodness of cell formation is concerned. © 2014
Elsevier B.V.
AUTHOR KEYWORDS: Cellular manufacturing system; Group technology efficiency;
Growing hierarchical self-organizing map; Operation sequence; Self-organizing
map; Visual clustering
INDEX KEYWORDS: Algorithms; Computational complexity; Conformal mapping; Group
technology; Self organizing maps, Cell formation algorithms; Cell formation
problem; Group technology efficiencies; Growing hierarchical self-organizing maps;
High dimensional spaces; Measures of performance; Operation sequences; Visual
clustering, Cellular manufacturing
REFERENCES: Dimopoulos, C., Zalzala, A.M.S., Recent developments in evolutionary
computations for manufacturing optimization: Problems, solutions, and comparisons
(2000) IEEE Trans. Evol. Comput., 4, pp. 93-113;
designing cellular manufacturing system (1998) Int. J. Prod. Res., 25, pp. 639-655;
J. Oper. Res., 69, pp. 284-291;
pp. 561-569;
(1991) Int. J. Prod. Res., 29 (2), pp. 343-356;
(2004) Comput. Ind. Eng., 46, pp. 495-510;
Diaby, M., Nsakanda, A.L., Large-scale capacitated part-routing in the presence of
Research Society, 57 (9), pp. 1100-1112., DOI 10.1057/palgrave.jors.2602072, PII
2602072;
assignment in cell formation (2002) Computers and Industrial Engineering, 42 (2-4),
pp. 329-341., DOI 10.1016/S0360-8352(02)00020-7, PII S0360835202000207;
DOI 10.1016/S0360-8352(02)00184-5, PII S0360835202001845;
Int. J. Prod. Res., 42 (18), pp. 3911-3927;
alternative cell locations and material transporters (2003) J. Oper. Res. Soc., 54,
pp. 1059-1075;
(2004) Int. J. Adv. Manuf. Technol., 23, pp. 916-924;
Int. J. Adv. Manuf. Technol., 28, pp. 950-956;
manufacturing design and layout (2007) Eur. J. Oper. Res., 181, pp. 156-167;
0862-2;
10.1016/j.ejor.2007.02.040, PII S037722170700272X;
Bajestani, A.M., Rabbani, M., Rahimi-Vahed, A.R., Khoshkhou, G.B., A multiobjective
scatter search for a dynamic cell formation problem (2009) Comput. Oper. Res., 36,
pp. 777-794;
Research, 35 (10), pp. 2773-2792;
909-916., DOI 10.1007/s00170-003-2048-5;
10), pp. 1001-1009., DOI 10.1007/s00170-006-0518-2;
cell-formation problems in machine scheduling (2009) Ann. Oper. Res., 166 (1), pp.
163-181;
Chattopadhyay, M., Chattopadhyay, S., Dan, P.K., Machine-part cell formation
through visual decipherable clustering of self-organizing map (2010) Int. J. Adv.
Manuf. Technol., 52 (912), pp. 1019-1030;
Kohonen, T., Self-organized formation of topologically correct feature maps (1982)
Biological Cybernetics, 43 (1), pp. 59-69., DOI 10.1007/BF00337288;
models (1994) Int. J. Prod. Res., 32 (9), pp. 2105-2116;
Industrial Engineering, 42 (2-4), pp. 377-382., DOI 10.1016/S0360-8352(02)00039-6,
PII S0360835202000396;
10.1080/00207540500507450, PII NUQ6025836653G03;
Chattopadhyay, M., Dan, P.K., Mazumdar, S., Principal component analysis and self-
organizing map for visual clustering of machine-part cell formation in cellular
manufacturing system (2011) Syst. Res. Forum (SRF), 5 (1), pp. 25-51;
properties of self organizing map in machine-part cell formation (2012) Appl. Soft
Comput., 12 (2), pp. 600-610;
Rauber, A., Merkl, D., Dittenbach, M., The growing hierarchical self-organizing
map: Exploratory analysis of high-dimensional data (2002) IEEE Transactions on
Neural Networks, 13 (6), pp. 1331-1341., DOI 10.1109/TNN.2002.804221;
Chattopadhyay, M., Das, N., Dan, P.K., Mazumdar, S., Growing hierarchical self-
organizing map computation approach for clustering in cellular manufacturing (2012)
J. Chin. Inst. Ind. Eng., 29 (3), pp. 181-192;
Halkidi, M., Batistakis, Y., Vazirgiannis, M., Cluster validity methods: Part i
(2002) SIGMOD Rec., 31 (2), pp. 40-45;
Kohonen, T., (1984) Self-organization and Associative Memory, , Heidelberg
Springer;
Kohonen, T., (2001) Self Organising Maps, , 3rd ed. Springer-Verlag Berlin
Heidelberg;
Dittenbach, M., Merkl, D., Rauber, A., The growing hierarchical self-organizing map
(2000) Proc. Int. Joint Conf. Neural Netw. (IJCNN), 6, pp. 15-19;
Soriano-Asensi, A., Martin-Guerrero, J.D., Soria-Olivas, E., Palomares, A.,
Magdalena-Benedito, R., Serrano-Lopez, A.J., Web mining based on Growing
Hierarchical Self-Organizing Maps: Analysis of a real citizen web portal (2008)
Expert Systems with Applications, 34 (4), pp. 2988-2994., DOI
10.1016/j.eswa.2007.05.023, PII S0957417407001947;
Shih, J.-Y., Chang, Y.-J., Chen, W.-H., Using GHSOM to construct legal maps for
Taiwan's securities and futures markets (2008) Expert Systems with Applications, 34
(2), pp. 850-858., DOI 10.1016/j.eswa.2006.10.031, PII S0957417406003460;
Kuo, R.J., Wang, C.F., Chen, Z.Y., Integration of growing self-organizing map and
continuous genetic algorithm for grading lithium-ion battery cells (2012) Appl.
Soft Comput., 12 (8), pp. 2012-2022;
Palomo, E.J., North, J., Elizondo, D., Luque, R.M., Watson, T., Application of
growing hierarchical SOM for visualisation of network forensics traffic data (2012)
Neural Netw., 32, pp. 275-284;
Huang, S.-Y., Tsaih, R.-H., Lin, W.-Y., Unsupervised neural networks approach for
understanding fraudulent financial reporting (2012) Ind. Manage. Data Syst., 112
(2), pp. 224-244;
Dittenbach, M., Rauber, A., Merkl, D., Uncovering hierarchical structure in data
using the growing hierachical self-organizing map (2002) Neurocomputing, 48, pp.
199-216., DOI 10.1016/S0925-2312(01)00655-5, PII S0925231201006555;
Rauber, A., Merkl, D., Dittenbach, M., The growing hierarchical self-organizing
map: Exploratory analysis of high-dimensional data (2002) IEEE Trans. Neural Netw.,
13, pp. 1331-1441;
Dittenbach, M., The growing hierarchical self-organizing map: Uncovering
hierarchical structure in data (2003) J. Aust. Soc. Artif. Intell., 22 (3), pp. 25-
28;
Pampalk, E., Widmer, G., Chan, A., A new approach to hierarchical clustering and
structuring of data with self-organizing maps (2004) Intell. Data Anal. J., 8 (2),
pp. 131-149;
Vesanto, J., Himberg, J., Alhoniemi, E., Parhankangas, J., (2000) SOM Toolbox for
Matlab 5, , http://www.cis.hut.fi/projects/somtoolbox/, Helsinki University of
Technology Finland (available online at);
McLaughlin, P., Durazo-Cardenas, I., Cellular manufacturing applications in MRO
operations (2013) Procedia CIRP, 11, pp. 254-259;
Mohammadi, M., Forghani, K., A novel approach for considering layout problem in
cellular manufacturing systems with alternative processing routings and
subcontracting approach (2014) Appl. Math. Model., , 10.1016/j.apm.2013.11.058;
Zeidi, J.R., Javadian, N., Tavakkoli-Moghaddam, R., Jolai, F., A hybrid multi-
objective approach based on the genetic algorithm and neural network to design an
incremental cellular manufacturing system (2013) Comput. Ind. Eng., 66 (4), pp.
1004-1014;
Shiyas, C.R., Madhusudanan, P.V., Cellular manufacturing system design using
grouping efficacy-based genetic algorithm (2014) Int. J. Prod. Res., pp. 1-14.,
10.1080/00207543.2013.871390;
systems (2013) Sadhana, 38 (3), pp. 421-428;
Mostafa, M.M., Clustering the ecological footprint of nations using Kohonen's self-
organizing maps (2010) Expert Syst. Appl., 37 (4), pp. 2747-2755;
Hajjar, C., Hamdan, H., Interval data clustering using self-organizing maps based
on adaptive Mahalanobis distances (2013) Neural Netw., 46, pp. 124-132;
Chang, W.L., Tay, K.M., Lim, C.P., A new evolving tree for text document clustering
and visualization (2014) Soft Computing in Industrial Applications, pp. 141-151.,
V. Snášel, P. Krömer, M. Köppen, G. Schaefer, Springer International Publishing
Switzerland;
Ghosh, T., Chattopadhyay, M., Dan, P.K., Hybrid principal component analysis
technique to machine-part grouping problem in cellular manufacturing system (2013)
Int. J. Adv. Oper. Manage., 5 (3), pp. 237-260;
Valova, I., Georgiev, G., Gueorguieva, N., Olson, J., Initialization issues in
self-organizing maps (2013) Procedia Comput. Sci., 20, pp. 52-57;
Ippoliti, D., Zhou, X., A-GHSOM. An adaptive growing hierarchical self organizing
map for network anomaly detection (2012) J. Parallel Distrib. Comput., 72 (12), pp.
1576-1590;
Chattopadhyay, M., Sengupta, S., Ghosh, T., Dan, P.K., Mazumdar, S., Neuro-genetic
impact on cell formation methods of cellular manufacturing system design: A
quantitative review and analysis (2013) Comput. Ind. Eng., 64 (1), pp. 256-272;
production data using neural networks (2009) Comput. Ind. Eng., 56 (4), pp. 1340-
1347;
Sharma, V.M., (2007) An Evaluation of Dimensionality Reduction on Cell Formation
Efficacy, , (Doctoral dissertation) Ohio University;
formation (2004) Comput. Ind. Eng., 47 (2), pp. 247-273;
36 (1), pp. 157-179;
Nair, J.G., Narendran, T.T., ACCORD: A bicriterion algorithm for cell formation
using ordinal and ratio-level data (1999) Int. J. Prod. Res., 37, pp. 539-556;
Sofianopoulou, S., Manufacturing cells design with alternative process plans and
/or replicate machines (1999) Int. J. Prod. Res., 37 (3), pp. 707-720;
clustering for part-machine grouping based on operation sequences (2003) Int. J.
Prod. Res., 41 (14), pp. 3185-3216;
(13), pp. 2755-2768., DOI 10.1080/00207540010005060;
CORRESPONDENCE ADDRESS: Chattopadhyay, M.; Information Technology Area, Indian
Institute of Management Raipur, GEC Campus, Sejbahar, Raipur 492015, India; email:
[email protected]
ISSN: 15684946
SOURCE: Scopus
Rodrigues, L.C.A., Weller, T.R.

7202076131;25723956500;
Cell formation with alternative routings and capacity considerations: A hybrid tabu
search approach
491. Cited 4 times.
3-540-88636-546&partnerID=40&md5=7b25358356edd6c5962beae996647c9c
DOI: 10.1007/978-3-540-88636-546
AFFILIATIONS: UTFPR, DAMEC/PPGEM, Av. Sete de Setembro 3165, 80230-901 Curitiba,
PR, Brazil
ABSTRACT: Cell formation considering the availability of alternative routings and
the processing capacity of available machines is a challenging optimization
problem, since it imposes the solution of a two step problem: i) assign machines to
cells; and ii) assign manufacturing parts (routings) to cells. The objective is to
minimize extra-cellular processing of tasks when routings of parts are selected. A
hybrid tabu search approach is proposed to solve this cell formation problem. The
proposed approach applies tabu search to assign machines to cells and branch-and-
bound to select routings. In order to reduce the search space, a set of feasibility
and pruning tests are proposed. A problem proposed and used at previous papers is
used to compare the results of the proposed approach and the results presented by
previous papers. © 2008 Springer Berlin Heidelberg.
AUTHOR KEYWORDS: Branch-and-bound; Group technology; Tabu search
INDEX KEYWORDS: Artificial intelligence; Bionics; Cellular manufacturing; Group
technology, Alternative routings; Branch and bounds; Branch-and-bound; Cell
formation problems; Cell formations; Cellular processing; Hybrid tabu searches;
Optimization problems; Processing capacities; Pruning tests; Routings; Search
spaces, Tabu search
REFERENCES: Burbidge, J.L., (1975) An Introduction to Group Technology, , John
Wiley, New York;
Irani, S.A., (1999) Handbook of Cellular Manufacturing Systems, , John Wiley, New
York;
Nsakanda, A.L., Diaby, M., Price, W.L., Hybrid Genetic Approach for Solving Large-
Scale Capacitated Cell Formation Problems with Multiple Routings (2006) European J.
Caux, C., Bruniaux, R., Pierreval, H., Cell Formation with Alternative Process
Plans and Machine Capacity Constraints: A New Combined Approach (2000) Int. J.
Nagi, R., Harhalakis, G., Proth, J.M., Multiple Routeings and Capacity
Considerations in Group Technology Applications (1990) Int. J. Production Research,
28, pp. 2243-2257;
Xambre, A.R., Vilarinho, P.M., A Simulated Annealing Approach for Manufacturing
Cell Formation with Multiple Identical Machines (2003) European J. of Operational
Research, 151, pp. 434-446;
Prabhaharan, G., Muruganandam, A., Asokan, P., Girish, B.S., Machine Cell Formation
for Cellular Manufacturing Systems Using an Ant Colony System Approach (2005) Int.
J. Adv. Manuf. Technol, 25, pp. 1013-1019;
Lei, D., Wu, Z., Tabu Search-Based Approach to Multi-Objective Machine-Part Cell
Formation (2005) Int. J. Production Research, 43, pp. 5241-5252;
Lei, D., Wu, Z., Tabu Search for Multi-Criteria Manufacturing Cell Design (2006)
Foulds, L.R., French, A.P., Wilson, J.M., The Sustainable Cell Formation Problem:
Manufacturing Cell Creation with Machine Modification Costs (2006) Computers &
Glover, F., Laguna, M., (1997) Tabu Search, , Kluwer Academic, Norwell;
Pearl, J., (1984) Heuristics: Intelligent search strategies for computer problem
solving, , Addison-Wesley, Reading
CORRESPONDENCE ADDRESS: Rodrigues, L. C. A.; UTFPR, DAMEC/PPGEM, Av. Sete de
Setembro 3165, 80230-901 Curitiba, PR, Brazil; email: [email protected]
ISSN: 03029743
ISBN: 3540886354; 9783540886358
SOURCE: Scopus
Stawowy, A.
8684892200;
Evolutionary strategy for manufacturing cell design
(2006) Omega, 34 (1), pp. 1-18. Cited 25 times.
24144447033&doi=10.1016%2fj.omega.2004.07.016&partnerID=40&md5=4ffa7fb7167001062cd5
3fe4072e4c6d
DOI: 10.1016/j.omega.2004.07.016
AFFILIATIONS: Faculty of Management, AGH University of Science and Technology,
Gramatyka 10, 30-067 Krakow, Poland
ABSTRACT: The problem of grouping parts into families and machines into cells
(manufacturing cell formation problem) is considered with the objective of
maximizing the grouping efficacy. A non-specialized and non-hybridized evolutionary
strategy (ES) is proposed and analyzed for solving this problem. The algorithm uses
a modified permutation with separators encoding scheme and unique concept of
separators' movements during mutation. The set of experiments confirmed that the
proposed approach outperforms any known heuristics. For 7 out of 34 problems
considered, better solutions have been found (with the same number of cells as in
literature), as compared to the previously published results. Moreover, there are 5
problems for which ES has produced the best known solutions with different number
of cells than from the literature. © 2004 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Cell formation problem; Heuristics
REFERENCES: Gallagher, C.C., Knight, W.A., Group technology production methods in
manufacture (1986), New York: Ellis Horwood Limited; King, J.R., Nakornchai, V.,
Machine-component group formation in group technology: Review and extension (1982)
Flexible Automation and Integrated Manufacturing, 3 (3-4), pp. 161-200;
Falkenauer, E., A new representation and operators for GAs applied to grouping
problems (1994) Evolutionary Computation, 2 (2), pp. 123-144;
Reeves, C.R., Hybrid genetic algorithms for bin-packing and related problems (1996)
Annals of Operational Research, 63, pp. 371-396;
Jones, D.R., Beltramo, M.A., Solving partitioning problems with genetic algorithms
(1991) Proceedings of the Fourth International Conference on Genetic Algorithms,
pp. 442-449;
Stawowy, A., The polynomial algorithms for the flowshop sequencing problem (1997),
PhD thesis (in Polish), Krakow: AGH University of Science and Technology; Nissen,
V., Solving the quadratic assignment problem with clues from nature (1994) IEEE
Transactions on Neural Networks, 1, pp. 66-72;
Gonçalves, J.F., Resende, M., A hybrid genetic algorithm for manufacturing cell
design (2002), AT&T Labs Research Technical Report TD-5FE6RN. Florham Park: AT&T
Labs Research; Waghodekar, P.H., Sahu, S., Machine-component cell formation in
937-948;
formation application (1989) Computers and Industrial Engineering, 16 (3), pp. 419-
426;
Boctor, F.F., A linear formulation of the machine-part cell formation problems
Research, 24 (2), pp. 451-464;
Research, 24 (5), pp. 1221-1233;
implementations-a state-of-the-art survey (1985) OMEGA, 13 (6), pp. 381-391;
113;
McCornick, W.T., Schweitzer, P.J., White, T.W., Problem decomposition and data
993-1009;
Research, 28 (1), pp. 145-152;
Research, 18 (2), pp. 213-232;
technology machine clustering problem (1985) OMEGA The International Journal of
387-397;
pp. 2097-2116;
Research, 27 (6), pp. 1035-1052;
Kumar, R., Vannelli, A., Strategic subcontracting for efficient disaggregated
1715-1728;
CORRESPONDENCE ADDRESS: Stawowy, A.; Faculty of Management, AGH University of
Science and Technology, Gramatyka 10, 30-067 Krakow, Poland; email:
[email protected]
ISSN: 03050483
CODEN: OMEGA
ABBREVIATED SOURCE TITLE: Omega
SOURCE: Scopus
Mahdavi, I., Paydar, M.M., Sharafuddin, I., Solimanpur, M.

16417373200;23025569300;36523940300;35615315700;
Simulated annealing approach to solve a cellular manufacturing system using mdmtsp
1, pp. 181-190.
84888243214&partnerID=40&md5=c594a6c2c9cf42134cba0ba063c94c00

Department of Computer Engineering, Mazandaran University of Science and
Technology, Babol, Iran;
Department of Mechanical Engineering, Faculty of Engineering, Urmia University,
Urmia, Iran
ABSTRACT: Design of cellular manufacturing systems involves many structural and
operational issues. One of important design steps is the formation of part families
and machine cells (cell formation). Despite a large number of papers on cell
formation being published, only a handful incorporates operation sequence in layout
design (intra-cell move calculations). We propose a solution that will solve the
part-family and machine cell formation problem by simultaneously considering the
within-cell layout problem. In this paper, the cellular manufacturing system is
formulated as a multiple departures single destination multiple travelling salesman
problem (MDmTSP) and a solution methodology based on simulated annealing is
proposed. The approach is illustrated by three examples and a comparison has been
done with CASE (Nair and Narendran 1998), genetic algorithm (Boulif and Atif 2006)
and CLASS (Mahdavi et al. 2008). Copyright © (2008) by Computers & Industrial
Engineering.
AUTHOR KEYWORDS: Cell formation; Layout design; MDmTSP; Simulated annealing
INDEX KEYWORDS: Cell formation; Layout designs; Machine cell formation problems;
MDmTSP; Operation sequences; Operational issues; Solution methodology; Travelling
salesman problem, Design; Industrial engineering; Simulated annealing; Traveling
salesman problem, Cellular manufacturing
REFERENCES: Akturk, M.S., Balkose, O., Part-machine grouping using a multi-
objective cluster analysis (1996) International Journal of Production Research, 34
(8), pp. 2299-2315;
Aykanat, C., Bultan, T., Haritaoglu, I., A fast neural-network algorithm for vlsi
cell placement (1998) Neural Networks, 11, pp. 1671-1684;
Baykasoglu, A., A metaheuristic algorithm to solve quadratic assignment
formulation of cell formation problems without presetting number of cells (2004)
Kaebernick, M.H., Harraf, A., Bazargan-Lari, Cell formation and layout designs in a
cellular manufacturing environment- A case study (2000) International Journal of
Cheng, C., Gupta, Y., Lee, W., Wong, K., A tspbased heuristic for forming machine
36, pp. 1325-1337;
Glover, F., Artificial intelligence, heuristic frameworks and tabu search (1990)
Managerial and Decision Economics, 11, pp. 365-378;
2079;
pp. 1449-1458;
Brown, E.C., James, T.L., Keeling, K.B., Grouping efficiency measures and their
pp. 63-78;
Science, 220 (4598), pp. 671-680;
Lenstra, J.K., KanRinnooy, A.H.G., Some simple applications of the travelling
Society, 50, pp. 509-516;
Mahdavi, I., Kaushal, O.P., Chandra, M., Graphneural network approach in cellular
Mahdavi, I., Javadi, B., Alipour, K.F., Slomp, J., Designing a new mathematical
International Journal of Advanced Manufacturing Technology, , Online First;
Majeed Ali, A.A., Vrat, P., Manufacturing cell formation: A neural network approach
(1999) Proceedings of the International Conference on Operations Management for
Global Economy Challenges and Prospects, pp. 565-571., Indian Institute of
Technology, New Delhi, India;
Research, 38 (5), p. 1201218;
Padberg, M., Giovanni, R., A branch-and-cut algorithm for the resolution of large-
scale symmetric travelling salesman problem (1991) SIAM Review, 33, pp. 60-100;
cellular manufacturing system (2001) The International Journal of Advanced
Shirrish, B., Nigel, J., Kabuka, M.R., A boolean neural network approach for the
travelling salesman problem (1993) IEEE Transaction on Computers, 42, pp. 1271-
1278;
Singh, N., (1996) System Approach to Computerintegrated Design and Manufacturing, ,
New York: Wiley;
Su, C.-T., Hsu, C.-M., Multi-objective machinepart cell formation through parallel
pp. 2185-2207;
Tavakkoli-Moghaddam, R., Javadian, N., Javadi, B., Safaei, N., (2007) Design of a
Facility Layout Problem in Cellular Manufacturing Systems with Stochastic Demands,
184, pp. 721-728., Applied Mathematics and Computation;
pp. 1609-1617;
(2004) International Journal OfAdvanced Manufacturing Technology, 2004, 23, pp.
916-924
ISBN: 9781627486828
SOURCE: Scopus
Javadian, N., Paydar, M.M., Sahebjamnia, N.

23485559000;23025569300;23986437400;
Designing a mathematical model to cell formation for cellular manufacturing systems
3, pp. 2187-2192.
84888237909&partnerID=40&md5=7563073fd3efad9f7ae434ea31e51b85

Young Researchers Club, Babol Branch, Islamic Azad University, Iran
ABSTRACT: During the last three decades of research, numerous algorithms have been
developed to solve cell formation problems and this research still remains of
interest to this day. Designing appropriate cells is the first step towards
configuring a cellular manufacturing system. Mathematical programming methods to
cell formation by different objective models have been used. This paper presents a
mathematical approach for the manufacturing cell formation. The objective function
of the proposed approach is to minimize the number of voids and exceptional
elements to generate optimal machine cells and part families. Computational results
with the model on a set of group technology problems available in the literature
are also presented. The approach produced solutions with grouping efficiency and
grouping efficacy that is any results previously reported in literature and
improved for problems. Copyright©(2008) by Computers & Industrial Engineering.
AUTHOR KEYWORDS: Cell formation; Grouping efficacy; Grouping efficiency;
Mathematical model
INDEX KEYWORDS: Cell formation; Cell formation problem; Computational results;
Exceptional elements; Grouping efficacy; Grouping efficiency; Manufacturing cell
formation; Mathematical approach, Group technology; Mathematical models;
Mathematical programming, Cellular manufacturing
REFERENCES: Adil, G.K., Ragamani, D., Strong, D., A mathematical model for cell
formation considering investment and operational costs (1993) European Journal of
Burbidge, J.L., A manual method for production flow analysis (1977) Production
Research, 24, pp. 451-464;
Research, 24 (5), pp. 1221-1264;
Cheng, C., Gupta, Y., Lee, W., Wong, K., A TSpbased heuristic for forming machine
pp. 1325-1337;
28 (8), pp. 1417-1433;
formation (2004) Computers&Industrial Engineering, 47, pp. 247-273;
Brown, E.C., James, T.L., Keeling, K.B., Grouping efficiency measures and their
pp. 63-78;
Society, 50, pp. 509-516;
51, pp. 53-57;
incomplete power set (1975) Journal of Cybernetics, 5, pp. 51-76;
pp. 285-314;
Seiffodini, H., Single linkage v/s average linkage clustering in machine cells
426;
Research, 34, pp. 3401-3416;
Research, 29, pp. 463-478;
Srinivasan, G., Narendran, T.T., GRAFICS - A non hierarchical clustering algorithm
463-478;
mace (1984) International Journal of Production Research, 22, pp. 937-948;
(2004) International Journal OfAdvanced Manufacturing Technology, 2004, 23, pp.
916-924
ISBN: 9781627486828
SOURCE: Scopus
Park, J.H., Seo, K.K., Jang, D.S.

9743618400;55496602300;7102794541;
Recycling cell formation using group technology for disposal products
(1999) Proceedings - 1st International Symposium on Environmentally Conscious
Design and Inverse Manufacturing, EcoDesign 1999, art. no. 747724, pp. 830-835.
Cited 5 times.
15844363407&doi=10.1109%2fECODIM.1999.747724&partnerID=40&md5=8b6ecb17def8d0b7ccbb2
c0bf29fa744
DOI: 10.1109/ECODIM.1999.747724
AFFILIATIONS: CAD/CAM Research Center, Korea Institute of Science and Technology,
South Korea;
Department of Industrial Engineering, Korea University, South Korea
ABSTRACT: The recycling cell formation problem means that disposal products are
classified into recycling part families using group technology in their end of life
phase. Disposal products have the uncertainties of product status by usage
influences. Recycling cells are formed considering design, process and usage
attributes. In this paper, a novel approach to the design of a cellular recycling
system is proposed, which deals with the recycling cell formation and assignment of
identical products concurrently. Fuzzy clustering and fuzzy-ART algorithms are
applied to describe the states of disposal product with the membership functions
and to make recycling cell formation. This approach leads to recycling and reuse of
the materials, components, and subassemblies and can evaluate the value at each
cell of disposal products. Application examples are illustrated by disposal
refrigerators, comparing fuzzy clustering with fuzzy-ART performance in cell
formation. © 1999 IEEE.
INDEX KEYWORDS: Cells; Cellular manufacturing; Clustering algorithms; Cytology;
Fuzzy clustering; Manufacture; Mechanical variables measurement; Membership
functions; Product design; Recycling, Application examples; Cell formation; Cell
formation problem; End of lives; Fuzzy ART; Part family; Recycling systems, Group
technology
REFERENCES: Alting, L., Brobech Legarth, J., (1995) Life Cycle and Design, Annals
of CIRP, 44, pp. 1-11;
Zusman, E., Kriwet, A., Seliger, G., Disassembly-oriented assessment methodology to
support design for recycling (1994) Annals of the CIRP, 43 (1);
Kusiak, A., The generalized group technology concept (1985) Int. Journal of
mathematics (1989) Int. Journal of Production Research, 27, pp. 1637-1651;
Chao-Hsien, H.J.C., A Fuzzy clustering approach to manufacturing cell formation
(1991) Int. Journal of Production Research, 29, pp. 1475-1487;
Carpenter, G.A., Grossberg, S., Rosen, D.B., Fuzzy art: Fast stable learning and
Huang, J., Georgiopoulos, M., Heileman, G.L., Fuzzy ART properties (1995) Neural
Networks, 8, pp. 203-213
EDITORS: Suga T., Yoshikawa H., Umeda Y., Kimura F., Yamamoto R.
ISBN: 0769500072; 9780769500072

ABBREVIATED SOURCE TITLE: Proc. - Int. Symp. Environ. Conscious Des. Inverse
Manuf., EcoDesign
SOURCE: Scopus
Wu, N., Salvendy, G., Wu, N.

7201444208;56763746600;57029614700;
A modified network approach for the design of cellular manufacturing systems
34 times.
0027606992&doi=10.1080%2f00207549308956798&partnerID=40&md5=9c6d341e2547672d87dec26
0da4d68c5
DOI: 10.1080/00207549308956798
AFFILIATIONS: Shenyang Institute of Automation, Chinese Academy of Sciences,
Shenyang, 110015, China;
United States
ABSTRACT: In considering the operation sequence constraints in manufacturing
systems, the cell formation problem is modelled by an undirected graph (network) in
this paper. Two efficient algorithms are presented based on this model. Algorithm 1
partitions the network by finding the minimum cut sets in the network so that the
resultant interaction between cells is minimal. Algorithm 2 is a simplified version
of algorithm 1 by selecting seed nodes in partitioning the network to further
reduce the amount of computation. Although algorithm 2 does not guarantee that the
intercell movements are minimal, a very good solution can still be obtained by
using it. When this method is extended it is also applicable to situations where
operation sequence constraints are ignored. The proposed method provides more
effective solutions than some other heuristic methods. © 1993 Taylor & Francis
Group, LLC.
INDEX KEYWORDS: Algorithms; Computational complexity; Constraint theory; Graphic
methods; Machinery; Mathematical models; Operations research, Cell formation
problem; Cellular manufacturing systems; Modified network approach; Operation
sequence constraints, Manufacture
pp. 101-113;
Carrie, A., Numerical taxonomy applied to group technology and plan layout (1973)
Choobineh, F., A framework for design of cellular manufacturing system (1988)
Ford, L.R., Fulkerson, D.R., A simple algorithm for finding maximal network flows
and an application to the Hitchcock problem (1957) Canadian Journal of Mathematics,
9, pp. 210-218;
Gomory, R.E., Hu, T.C., Multi-terminal network flows (1971) SIAM Journal of Applied
Mathematics, 9, pp. 551-571;
Khator, S.K., Irani, S.A., Cell-formation in group technology: A new approach
(1987) Computer and Industrial Engineering, 12, pp. 561-569;
Kumar, K.R., Vannelli, A., Strategic subcontracting for ellicient desegregrated
1728;
Kusiak, A., Branching algorithms for the group technology problem (1991) Journal of
Kusiak, A., Chow, W.S., Efficient solving of group technology problem (1987)
Rajagopalan, R., Batra, J.L., Design of cellular production systems: A
graphtheoretic approach (1975) International Journal of Production Research, 13,
pp. 271-579;
Seifoddini, H., Wolfe, M.P., Application of the similarity coefficient method in
Vakharia, A.J., Wemmerlov, D., Designing a cellular manufacturing system: A
material flow approach based on operation sequences (1990) IIE Transactions, 22,
pp. 84-97;
Research, 28, pp. 2075-2084;
Wemmerlov, D., Hyer, N.L., Cellular manufacturing in the US industry: A survey of
user (1989) International Journal of Production Research, 27, pp. 1511-1530
CORRESPONDENCE ADDRESS: Wu, N.; Shenyang Institute of Automation, Chinese Academy
of Sciences, Shenyang, 110015, China
ISSN: 00207543
SOURCE: Scopus
Logendran, R.
57207586498;
Simultaneous machine-part grouping approach in manufacturing cells
(1992) Computers and Industrial Engineering, 23 (1-4), pp. 77-80. Cited 1 time.
8352%2892%2990067-T&partnerID=40&md5=d83dfefd00379624e7bbd95c6d3764a0
DOI: 10.1016/0360-8352(92)90067-T
AFFILIATIONS: Department of Industrial, Manufacturing Engineering Oregon State
University Corvallis, OR 97331, United States
ABSTRACT: We present a comprehensive model including all of the operational
constraints for solving a cell formation problem in cellular manufacturing systems.
It is formulated as a generalized quadratic binary programming model with the
objective of minimizing total moves evaluated as a weighted sum of inter- and
intracell moves. Two most significant operational constraints included in the model
are the sequence of operations associated with each part and the capability of
assigning machines of the same type to different cells if two or more machines are
considered due to workload requirements. The original model is Transformed into a
linear binary programming model, and an example problem is solved using a
commercial programming package. The final assignment of parts and machines to cells
result in a lower total move than that evaluated from a previous study for the same
problem. © 1992.
INDEX KEYWORDS: Production engineering, Cell formation problem; Cellular
manufacturing systems; Hypothetical cell formation; Linear-binary programming
model; Simultaneous machine-part grouping, Machine tools
REFERENCES: Chan, Milner, Direct Clustering Algorithm for Group Formation in
Chandrasekharan, Rajagopalan, ZODIAC - An Algorithm for Concurrent Formation of
Part-Families and Machine-Cells (1987) International Journal of Production
Research, 25 (6), pp. 835-850;
Systems (1981) Proceeding of Ninth North American Metalworking Research Conference,
p. 503., Society of Mechanical Engineers, Dearborn, MI, USA;
King, Machine-Component Group in Production Flow Analysis: An Approach Using a Rank
Order Clustering Algorithm (1980) International Journal of Production Research, 18
(1), pp. 213-232;
Kusiak, Heragu, Group Technology (1987) Computers in Industry, 9, pp. 83-91;
Logendran, A Workload Based Model for Monimizing Total Intercell and Intracell
Moves in Cellular Manufacturing (1990) International Journal of Production
Reasearch, 28 (5), pp. 913-925;
McCormick, Schweitzer, White, Problem Decomposition and Daata Recognition by A
Clustering Technique (1972) Operations Research, 13, p. 567;
Schrage, (1989) Integer and Quadratic Programming with LINDO, , The Scientific
Press, Redwood City, CA;
Taha, (1975) Integer Programming: Theory, Applications, and Computations, ,
Academic Press Inc, New York;
Wemmerlov, Hyer, Research Issues in Cellular Manufacturing (1987) International
Journal of Production Research, 25, pp. 413-431
CORRESPONDENCE ADDRESS: Logendran, R.; Department of Industrial, Manufacturing
Engineering Oregon State University Corvallis, OR 97331, United States
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Aljuneidi, T., Bulgak, A.A.

57190386221;6603338561;
A mathematical model for designing reconfigurable cellular hybrid manufacturing-
remanufacturing systems
84979590814&doi=10.1007%2fs00170-016-9141-
z&partnerID=40&md5=aedf0bdd6fa9fe1da527191636ebd612
DOI: 10.1007/s00170-016-9141-z
University, 1455 de Maisonneuve Blvd., West Montréal, QC H3G 1M8, Canada
ABSTRACT: Sustainability is increasingly becoming a decisive issue in many aspects
of life. While sustainability appears to be a popular research area in general, one
cannot observe much emphasis on research in design issues of sustainable
manufacturing systems presently. In wake of this, this article presents a
simultaneous investigation of reconfigurable cellular manufacturing systems (CMSs)
and hybrid manufacturing-remanufacturing systems and proposes an integrated
approach in design optimization, analysis, and process planning aspects as an
attempt to address to a number of design issues for “sustainable manufacturing
systems.” A mixed integer linear programming (MILP) model, which considers a
classical cell formation problem in CMSs, bridged with a production planning
problem, in hybrid manufacturing-remanufacturing systems, while addressing to
“reconfiguration” issues for the CMS for different production periods, has been
developed. Numerical examples are provided. A detailed discussion of a numerical
example is presented to illustrate the proposed model. © 2016, Springer-Verlag
London.
AUTHOR KEYWORDS: Cellular manufacturing systems; Manufacturing-remanufacturing
systems; Mathematical programming; Sustainability; Sustainable manufacturing
INDEX KEYWORDS: Industrial research; Integer programming; Manufacture; Mathematical
programming; Production control; Reconfigurable hardware; Sustainable development,
Cell formation problem; Design optimization; Integrated approach; Mixed integer
linear programming model; Production Planning; Reconfigurable; Remanufacturing
system; Sustainable manufacturing, Cellular manufacturing
REFERENCES: Ahkioon, S., Bulgak, A.A., Bektas, T., Integrated manufacturing system
Oper Res, 192, pp. 414-428;
Ahkioon, S., Bulgak, A.A., Bektas, T., Cellular manufacturing system design with
routing flexibility, machine procurement, production planning and dynamics system
reconfiguration (2009) Int J Prod Res, 6, pp. 1573-1600;
Aras, N., Boyaci, T., Verter, V., Ferguson, M.E., Souza, G.C., Designing the
reverse logistics network (2010) Closed-loop supply chains: new developments to
improve the sustainability of business practices. CRC-Press, pp. 67-97., Taylor &,
Francis;
Atasu, A., Van Wassenhove, L., Souza, G., Environmental legislation regarding
product take-back and recovery (2010) Ferguson M, , Closed-loop supply chains,
Taylor and Francis;
Baki, F.M., Chaouch, A.B., Abdul-Kader, W., A heuristic solution procedure for the
dynamic lot sizing problem with remanufacturing and product recovery (2014) Comput
Oper Res, 43, pp. 225-236;
Bi, Z.M., Lang, S.Y.T., Shen, W., Wang, L., Reconfigurable manufacturing systems:
the state of the art (2008) Int J Prod Res, 46 (4), pp. 967-992;
Bulmus, C.S., Zhu, X.S., Teunter, R., Capacity and production decisions under a
remanufacturing strategy (2013) Int J Prod Econ, 145, pp. 359-370;
Chanintrakul, P., Coronado Mondragon, A.E., Lalwani, C., Wong, C.Y., Revere
logistics network design: a state-of-art literature review (2009) Int J Bus Perform
Supply Chain Model, 1, pp. 61-81;
Chen, M., Abrishami, P., A mathematical model for production planning in hybrid
manufacturing-remanufacturing systems (2014) Int J Adv Manuf Technol, 71, pp. 1187-
1196;
Eguia, I., Racero, J., Guerrero, F., Lozano, S., Cell formation and scheduling of
part families for reconfigurable cellular manufacturing systems using Tabu search
(2013) Trans Soc Model Simul Int, pp. 1-17;
Garbie, I.H., DFSME: design for sustainable manufacturing enterprises (an economic
viewpoint) (2013) Int J Prod Res, 51 (2), pp. 479-503;
advantages and design techniques (1984) J Oper Manag, 4, pp. 85-97;
Guide, V.D.R., Van Wassenhove, L.N., The evolution of closed-loop supply chain
research (2009) Oper Res, 57 (1), pp. 10-18;
Gunasekaran, A., Spalanzani, A., Sustainability of manufacturing and services:
investigations for research and applications (2012) Int J Prod Econ, 140, pp. 35-
47;
Javadian, N., Aghajani, A., Rezaeian, J., Sebdani, M., A multi-objective integrated
cellular manufacturing systems design with dynamics system reconfiguration (2011)
Jayal, A.D., Badurdeen, F., Dillon Jr, O.W., Jawahir, I.S., Sustainable
manufacturing: modeling and optimization challenges at the product, process and
system levels (2010) CIRP J Manuf Sci Technol, 2, pp. 144-152;
Jiang, Z., Fan, Z., Sutherland, W.J., Zhang, H., Zhang, X., Development of an
optimal method for remanufacturing process plan selection (2014) Int J Adv Manuf
Technol, 72, pp. 1551-1558;
Koren, Y., Heisel, U., Jovane, F., Moriwoki, T., Pritschow, G., Ulsoy, A.G., Van
Brussel, H., Reconfigurable manufacturing systems (1999) Ann CIRP, 2, pp. 1-13;
Koren, Y., Shapitalni, M., Design of reconfigurable manufacturing systems (2010) J
Manuf Syst, 29, pp. 130-141;
Laan, E.V., Marc Salomon, M., Rommert Dekker, R., An investigation of lead-time
effects in manufacturing/remanufacturing systems under simple PUSH and PULL control
strategies (1999) Eur J Oper Res, 115, pp. 195-214;
Laan, E.V., Marc Salomon, M., Rommert Dekker, R., Wassenhove, L.V., Inventory
control in hybrid systems with remanufacturing (1999) Manag Sci, 45 (5), pp. 733-
747;
Li, C., Liu, F., Cao, H., Wang, Q., A stochastic dynamic programming based model
for uncertain production planning of remanufacturing system (2009) Int J Prod Res,
47 (13), pp. 3657-3668;
Mehrabi, M.G., Ulsoy, A.G., Koren, Y., Reconfigurable manufacturing systems: key to
future manufacturing (2000) J Intell Manuf, 11, pp. 403-419;
Niroomand, I., Kuzgunkaya, O., Bulgak, A.A., Impact of reconfiguration
characteristics for capacity investment strategies in manufacturing systems (2012)
Int J Prod Econ, 139, pp. 288-301;
Parkinson, J.H., Thompson, G., Analysis and taxonomy of remanufacturing industry
practice (2003) J Process Mech Eng, 217 (3), pp. 243-256;
Ron, A.J., Sustainable production: the ultimate result of a continuous improvement
(1998) Int J Prod Econ, 56 (57), pp. 99-110;
Saad, S.M., The reconfiguration issues in manufacturing systems (2003) J Mater
Process Technol, 138, pp. 277-283;
review, evaluation and direction for future research (1998) Comput Ind Eng, 34, pp.
3-20;
Wemmerlov, U., Hyer, N., Procedures for part family/machine group identification
problem in cellular manufacturing (1986) J Oper Manag, 6, pp. 125-145;
Zanoni, S., Ferretti, I., Tang, O., Cost performance and bullwhip effect in a
hybrid manufacturing and remanufacturing system with different control policies
(2006) Int J Prod Res, 44 (18-19), pp. 3847-3862
CORRESPONDENCE ADDRESS: Bulgak, A.A.; Department of Mechanical and Industrial
Engineering, Concordia University, 1455 de Maisonneuve Blvd., Canada; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Utkina, I., Batsyn, M., Batsyna, E.

57191223664;37111907600;44461079500;
A branch and bound algorithm for a fractional 0-1 programming problem
255. Cited 1 time.
3-319-44914-2_20&partnerID=40&md5=3d41a0e3b6730eb52f2841f760556b38
DOI: 10.1007/978-3-319-44914-2_20
AFFILIATIONS: Department of Applied Mathematics and Informatics, Laboratory of
Algorithms and Technologies for Network Analysis, National Research University
Higher School of Economics, 136 Rodionova Street, Niznhy Novgorod, Russian
Federation
ABSTRACT: We consider a fractional 0-1 programming problem arising in
manufacturing. The problem consists in clustering of machines together with parts
processed on these machines into manufacturing cells so that intra-cell processing
of parts is maximized and inter-cell movement is minimized. This problem is called
Cell Formation Problem (CFP) and it is an NP-hard optimization problem with Boolean
variables and constraints and with a fractional objective function. Because of its
high computational complexity there are a lot of heuristics developed for it. In
this paper we suggest a branch and bound algorithm which provides exact solutions
for the CFP with a variable number of cells and grouping efficacy objective
function. This algorithm finds optimal solutions for 21 of the 35 popular benchmark
instances from literature and for the remaining 14 instances it finds good
solutions close to the best known. © Springer International Publishing Switzerland
2016.
AUTHOR KEYWORDS: Biclustering; Branch and bound; Cell formation; Exact solution;
Upper bound
INDEX KEYWORDS: Benchmarking; Boolean functions; Branch and bound method; Cells;
Cellular manufacturing; Cytology; Manufacture; Operations research, 0-1 programming
problem; Bi-clustering; Branch-and-bound algorithms; Cell formation; Cell formation
problem; Exact solution; Optimization problems; Upper Bound, Optimization
REFERENCES: Arkat, J., Abdollahzadeh, H., Ghahve, H., A new branch and bound
algorithm for cell formation problem (2012) Appl. Math. Model., 36, pp. 5091-5100;
configuration (1987) Int. J. Prod. Res, 25 (1), pp. 101-113;

(1991) Int. J. Prod. Res, 29 (2), pp. 343-356;
Brusco, J.M., An exact algorithm for maximizing grouping efficacy in part machine
Burbidge, J.L., The new approach to production (1961) Prod. Eng., 40 (12), pp. 3-
19;
Busygin, S., Prokopyev, O., Pardalos, P.M., Biclustering in data mining (2008)
Comput. Oper. Res., 35 (9), pp. 2964-2987;
cell formation problem (2013) Models, Algorithms, and Technologies for Network
Analysis. Springer Proceedings in Mathematics & Statistics, 59, pp. 43-69.,
Goldengorin, B. I., Kalyagin, V. A., Pardalos, P. M. (eds.), Springer, New York;
Int. J. Prod. Res, 11, pp. 399-416;

835-850;
1035-1052;
Dinkelbach Algorithm. Montreal, Quebec (2012) CIRRELT-2012-07, pp. 1-14;
(1925) Trans. ASME, 46, pp. 691-738;
Goldengorin, B., Krushinsky, D., Pardalos, P.M., Cell Formation in Industrial
Engineering (2013) Theory, Algorithms and Experiments. Springer Optimization and
Its Applications, 79, p. 206., Springer, New York;
the cell formation problem (2007) Comput. Oper. Res., 34 (7), pp. 2059-2079;
232;
Review and extension (1982) Int. J. Prod. Res., 20 (2), pp. 117-133;
J. Prod. Res, 28 (2), pp. 233-243;
(4), pp. 561-569;
Manuf. Syst, 6 (2), pp. 117-124;
Kusiak, A., Boe, J.W., Cheng, C., Designing cellular manufacturing systems:
Branchand-bound and A* approaches (1993) IIE Transactions, 25 (4), pp. 46-56;
reorganization by a clustering technique (1972) Oper. Res., 20 (5), pp. 993-1009;
Mitrofanov, S.P., (1933) Nauchnye Osnovy Gruppovoy Tekhnologii, p. 435., Lenizdat,
Oper. Res., 40 (4), pp. 980-990;
Res, 27 (7), pp. 1161-1165;
manufacturing systems cell formation problem (1998) Eur. J. Oper. Res, 105, pp.
537-551;
Srinivasan, G., Narendran, T.T., Mahadevan, B., An assignment model for the
partfamilies problem in group technology (1990) Int. J. Prod. Res, 28 (1), pp. 145-
152;
Econ., 9, pp. 73-81;
Zilinskas, J., Goldengorin, B., Pardalos, P.M., Pareto-optimal front of cell
formation problem in group technology (2015) J. Global Optim, 61 (1), pp. 91-108
CORRESPONDENCE ADDRESS: Batsyn, M.; Department of Applied Mathematics and
Informatics, Laboratory of Algorithms and Technologies for Network Analysis,
Russian Federation; email: [email protected]
EDITORS: Khachay M., Pardalos P., Kochetov Y., Beresnev V., Nurminski E.
ISSN: 03029743
ISBN: 9783319449135
SOURCE: Scopus
Lee, K., Ahn, K.-I.

55776917700;55421365300;
GT efficacy: A performance measure for cell formation with sequence data
14 times.
84885656251&doi=10.1080%2f00207543.2013.794317&partnerID=40&md5=afbabf3c743c84a70c9
2c040439655fe
DOI: 10.1080/00207543.2013.794317
AFFILIATIONS: Department of Industrial Engineering, College of Engineering, Hanyang
University, Seoul, South Korea
ABSTRACT: Cell formation in cell manufacturing design is a crucial step for
improving productivity. As input data for the cell formation problem, a part-
machine incidence matrix is given in binary format or in ordinal format. The
solutions for effective cell formation have to be compared using performance
measures. Grouping efficacy is used as a standard measure for evaluating solutions
based on a binary part-machine matrix, which does not consider ordinal data.
However, the representative measures, called standard measures, for the ordinal
part-machine matrix are absent. The existing measures designed for ordinal data
produce conflicting results and can lead to subjective decisions. In this paper, a
new objective measure called group technology (GT) efficacy is proposed for ordinal
data, reflecting on both intercellular movement and compactness within cells
simultaneously. The advantage of GT efficacy is demonstrated by comparing it with a
few previously-proposed measures. © 152013 © 2013 Taylor & Francis.
AUTHOR KEYWORDS: Cell formation; GT efficacy; Ordinal data; Performance measures
INDEX KEYWORDS: Cell formation; Cell formation problem; Cell manufacturing; GT
efficacy; Incidence matrices; Intercellular movement; Ordinal data; Performance
measure, Cellular manufacturing; Group technology, Matrix algebra
REFERENCES: Anvari, M., Mehrabad, M., Barzinpour, F., Machine-part cell formation
using a hybrid particle swarm optimization (2010) The International Journal of
Research, 24, pp. 451-463;
Chattopadhyay, M., Chattopadhyay, S., Dan, P.K., Machine-part cell formation
through visual decipherable clustering of self-organizing map (2011) The
Lin, S.-W., Ying, K.-C., Lee, Z.-J., Part-machine cell formation in group
technology using a simulated annealing-based meta-heuristic (2010) International
Mahdavi, I., Mahadevan, B., Class: An algorithm for cellular manufacturing system
and layout design using sequence data (2008) Robotics and Computer-integrated

Park, S., Suresh, N.C., Performance of fuzzy art neural network and hierarchical
2755-2768;
CORRESPONDENCE ADDRESS: Ahn, K.-I.; Department of Industrial Engineering, College
of Engineering, Hanyang University, Seoul, South Korea; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Paydar, M.M., Mahdavi, I., Sharafuddin, I., Solimanpur, M.

23025569300;16417373200;36523940300;35615315700;
Applying simulated annealing for designing cellular manufacturing systems using
MDmTSP
78049378825&doi=10.1016%2fj.cie.2010.09.003&partnerID=40&md5=e577a299c67bac073b582e
ee896244e0
DOI: 10.1016/j.cie.2010.09.003
Department of Computer Engineering, Mazandaran University of Science and
ABSTRACT: The design of cellular manufacturing systems involves many structural and
operational issues. One of the important design steps is the formation of part
families and machine cells (cell formation). Despite a large number of papers on
cell formation published worldwide, only a handful incorporates operation sequence
in layout design (intra-cell move calculations). We propose a solution to solve the
part-family and machine-cell formation problem considering the within-cell layout
problem, simultaneously. In this paper, the cellular manufacturing system is
formulated as a multiple departures single destination multiple travelling salesman
problem (MDmTSP) and a solution methodology based on simulated annealing is
proposed to solve the formulated model. Numerical examples show that the proposed
method is efficient and effective in finding optimal solutions. The results also
indicate that the proposed approach performs well compared to some well-known cell
formation methods. © 2010 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Cellular manufacturing; MDmTSP; Simulated annealing
INDEX KEYWORDS: Cell formation; Cell formation problem; Cell layout problem;
Cellular manufacturing systems; Design steps; Intra-cell move; Layout designs;
Machine cell; MDmTSP; Numerical example; Operation sequences; Operational issues;
Optimal solutions; Part family; Solution methodology; Travelling salesman problem,
Annealing; Computer simulation; Machine design; Simulated annealing; Traveling
salesman problem, Cellular manufacturing
REFERENCES: Ahi, A., Aryanezhad, M.B., Ashtianim, B., Makui, A., A novel approach
to determine cell formation, intracellular machine layout and cell layout in the
CMS problem based on TOPSIS method (2009) Computers & Operations Research, 36, pp.
1478-1496;
Akturk, M.S., Balkose, O., Part-machine grouping using a multi-objective cluster
analysis (1996) International Journal of Production Research, 34 (8), pp. 2299-
2315;
Akturk, M.S., Turkcan, A., Cellular manufacturing system design using a Holonistic
2347;
Aykanat, C., Bultan, T., Haritaoglu, I., A fast neural-network algorithm for VLSI
cell placement (1998) Neural Networks, 11, pp. 1671-1684;
Baykasoglu, A., A metaheuristic algorithm to solve quadratic assignment
formulation of cell formation problems without presetting number of cells (2004)
Bazargan-Lari, Kaebernick, M.H., Harraf, A., Cell formation and layout designs in a
cellular manufacturing environment - A case study (2000) International Journal of
Bektas, T., The multiple traveling salesman problem: An overview of formulations
and solution procedures (2006) Omega, 34, pp. 209-219;
manufacturing cell formation problem (2006) Computer Operation Research, 33, pp.
2219-2245;
(36), pp. 1325-1337;
Gavish, B., Srikanth, K., An optimal solution method for large-scale multiple
traveling salesmen problems (1986) Operations Research, 34 (5), pp. 698-717;
2079;
pp. 1449-1458;
pp. 63-78;
Science, 220 (4598), pp. 671-680;
Lenstra, J.K., Kanrinnooy, A.H.G., Some simple applications of the travelling
Society, 50, pp. 509-516;
Technology New Delhi, India;
Research, 38 (5), p. 1201218;
Nagi, R., Harhalakis, G., Proth, J.-M., Multiple routing and capacity
Singh, N., (1996) System Approach to Computer-integrated Design and
Manufacturing, , Wiley New York;
pp. 2185-2207;
materials flow approach based on operations sequence (1990) IIE Transactions, 22,
pp. 84-97;
Wemmerlöv, U., Hyer, N., Research issues in cellular manufacturing (1987)
pp. 1609-1617;
(2004) International Journal of Advanced Manufacturing Technology, 2004 (23), pp.
916-924;
Yadlapalli, S., Malik, W.A., Darbha, S., Pachter, M., A Lagrangian-based algorithm
for a multiple depot (2009) Multiple Traveling Salesmen Problem, Nonlinear
Analysis: Real World Applications, 10, pp. 1990-1999
[email protected]
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Kremljak, Z.
9746372000;
Case study for planning of cell production system
(2018) Annals of DAAAM and Proceedings of the International DAAAM Symposium, 29
(1), pp. 0125-0132.
85060087299&doi=10.2507%2f29th.daaam.proceedings.017&partnerID=40&md5=ed6228611ef4b
266da3ea4aa849c70b4
DOI: 10.2507/29th.daaam.proceedings.017
ABSTRACT: Two key decisions in designing cell production systems are cell formation
and layout design problems. In the cell formation problem, machine groups and part
families are determined while in the facility layout problem the location of each
machine in each cell and the location of each cell are decided. In the paper the
configuration model of the cell is presented on the specific data sets of the
applied schedule. The model evaluated the project, which was implemented for
planning of the production process and the capacities of the local manufacturer of
hydraulic equipment. The data were taken into account in 120 parts with 177
operations. Most of these operations were carried out on CNC machining centres and
turning centres. Our development model was based on operation due to the lack of
formal costs and benefits in the traditional cell production. The results show that
the solution with 25 cells was the lowest total cost alternative. © 2018, Danube
Adria Association for Automation and Manufacturing, DAAAM. All rights reserved.
AUTHOR KEYWORDS: Cell production; Cost model; Genetic algorithm; Grouping
INDEX KEYWORDS: Cells; Cellular manufacturing; Genetic algorithms; Hydraulic
machinery, Cell formation problem; Cell production; Cell production system;
Configuration model; Cost modeling; Facility layout problems; Grouping; Production
process, Cytology
REFERENCES: Boutsinas, B., Machine-part cell formation using biclustering (2013)
European Journal of Operational Research, 230 (3), pp. 563-572., ISSN 0377-2217;
systems (2013) Sadhana – Academy Proceedings in Engineering Sciences, 38 (3), pp.
421-428., ISSN 0256-2499;
Sahin, Y.B., Alpay, S., A metaheuristic approach for a cubic cell formation problem
(2016) Expert Systems with Applications, 65, pp. 40-51., ISSN 0957-4174;
Journal of Advanced Manufacturing Technology, 46 (9-12), pp. 1201-1213., ISSN 0268-
3768;
Defersha, F.M., Chen, M.Y., A comprehensive mathematical model for the design of
Economics, 103 (2), pp. 767-783., ISSN 0925-5273;
Shiyas, C.R., Pillai, V.M., Cellular manufacturing system design using grouping
efficacy-based genetic algorithm (2014) International Journal of Production
Research, 52 (12), pp. 3504-3517., ISSN 0020-7543;
(2015) Journal of Manufacturing Systems, 35, pp. 155-163., ISSN 0278-6125;
Ghosh, T., Doloi, B., Dan, P.K., Utilization-based grouping efficiency and multi-
criteria decision approach in designing of manufacturing cells, Proceedings of the
Institution of Mechanical Engineers (2017) Part B: Journal of Engineering
Manufacture, 231 (3), pp. 505-522., ISSN 0954-4054;
Computers & Industrial Engineering, 90, pp. 292-304., ISSN 0360-8352;
Karaulova, T., Shevtshenko, E., Work-cells concept development for high mix low
volume market conditions (2015) Procedia Engineering, 100, pp. 90-99., ISSN 1877-
7058;
Sowmiya, N., Srinivasa Gupta, N., Valarmathi, B., Ponnambalam, S.G., CORA-a
heuristic approach to machine-part cell formation in the presence of alternative
process plans (2017) The International Journal of Advanced Manufacturing
Technology, 91 (9-12), pp. 4275-4297., ISSN 0268-3768;
problem (2016) The International Journal of Advanced Manufacturing Technology, 86
(5-8), pp. 2243-2254., ISSN 0268-3768;
using neural networks (2009) Computers & Industrial Engineering, 56 (4), pp. 1340-
1347., ISSN 0360-8352;
formation problem (2012) Applied Mathematical Modelling, 36 (10), pp. 5091-5100.,
ISSN 0307-904X;
Zupan, H., Herakovic, N., Zerovnik, J., Berlec, T., Layout optimization of a
production cell (2017) International Journal of Simulation Modelling, 16 (4), pp.
603-616., ISSN 1726-4529;
Nie, X.D., Chen, X.D., Chen, X., Simulation study of flexible manufacturing cell
based on token-oriented Petri net model (2016) International Journal of Simulation
Modelling, 15 (3), pp. 566-576., ISSN 1726-4529;
Baykasoglu, A., Gorkemli, L., Agent-based dynamic part family formation for
cellular manufacturing applications (2015) International Journal of Production
Research, 53 (3), pp. 774-792., ISSN 0020-7543;
Matsui, M., A queuing/management consideration on Japanese production systems
(2002) Production Planning & Control, 13 (8), pp. 688-701., ISSN 0953-7287;
Du, Y., Chen, Q.X., The model and simulation of SMT production (2012) Applied
Mechanics and Materials, 217-219, pp. 1493-1496., Vols., pp., ISSN 1662-7482
EDITORS: Katalinic B.
PUBLISHER: Danube Adria Association for Automation and Manufacturing, DAAAM
ISSN: 17269679
ISBN: 9783902734204
ABBREVIATED SOURCE TITLE: Annals DAAAM Proc. Int. DAAAM Symp.
SOURCE: Scopus
Maroof, A., Tariq, A., Maqsood, S.

57188823511;55409746600;57188711373;
Makespan as a design tool for CMS design
(2016) Proceedings of 2015 International Conference on Emerging Technologies, ICET
2015, art. no. 7389194, .
84963555204&doi=10.1109%2fICET.2015.7389194&partnerID=40&md5=bc608d7ce7c0ca3e75eb45
5c7eadc756
DOI: 10.1109/ICET.2015.7389194
AFFILIATIONS: Department of Industrial Engineering, University of Engineering and
Technology, Peshawar, Pakistan;
Department of Mechanical Engineering, Wah Engineering College, University of Wah,
Punjab, Pakistan
ABSTRACT: Industries have to cope with millions of parts for production on daily
basis. Scheduling of those parts for production is a complex process. Parts having
properly scheduled processing rarely get delayed and therefore generally delivered
on time. Cellular Manufacturing System (CMS) is a proficient production system and
can be used as an effective replacement of Batch type manufacturing. Cell Formation
(CF) is the fundamental part of Cell design and its effectiveness is checked using
a performance index called Grouping Efficacy (GE).Part scheduling is very rarely
used as a design tool for Cell Formation Problem (CFP). A software based solution
is developed in this research to solve CFP by applying Genetic Algorithm (GA),
which is an Artificial Intelligence (AI) technique. The uniqueness of this approach
is that it presents an integrated approach for grouping parts into families and
machines into cells using Makespan as the performance factor. Results show that
minimizing the Make span maximizes the GE. © 2015 IEEE.
AUTHOR KEYWORDS: Artificial Intelligence; Cellular Manufacturing System; Grouping
Efficacy; Make span
INDEX KEYWORDS: Artificial intelligence; Cells; Cytology; Design; Genetic
algorithms; Manufacture; Scheduling, Cell formation problem; Complex Processes;
Grouping efficacy; Integrated approach; Make span; Performance factors; Performance
indices; Software-based solutions, Cellular manufacturing
REFERENCES: Urban, W., Nancy, L.H., Procedure for the parts family/machine group
identification problem in cellular manufacturing system (1986) Journal of
Operations Management, 6 (2), pp. 125-147., February;
Kusiak, A., (1990) Intelligent Manufacturing Systems, , Prentice-Hall, New Jersey;
Greene, T., Sadowski, R.A., A review of cellular manufacturing assumption
advantages & Design techniques (1984) Jouranal of Operations Management, 4 (2), pp.
85-97;
Mohammad, M.P., Mohammad, S.M., A hybrid geneticvariable neighborhood search
Alba, E., (2005) Parallel Metaheuristics: A New Class of Algorithms, , Hoboken, New
Jersey: John Wiley & sons. Inc;
Saeed, Z., Ming, L., A new genetic algorithm for the machine/ part grouping problem
involving processing time and lot sizes (2003) Computers and Industrial
Waqas, J., Adnan, T., Itikhar, H., A comparison of a standard genetic algorithm
with a hybrid genetic algorithm applied to cell formation problem Advances in
Mechanical Engineering, 2014;
Adnan, T., Iftikhar, H., Abdul, G., A hybrid genetic algorithm for machine-part
grouping (2009) Computers and Industrial Engineering, 56 (1), pp. 347-356;
Arora, P.K., Haleem, A., Singh, M.K., (2013) Recent Development of Cellular
Manufacturing Systems, 38, pp. 421-428., June;
Akhioon, S., Bulgak, A.A., Bektas, T., Cellular manufacturing systems designs with
reconfiguration (2009) International Journal of Production Research, 46 (6);
Sudhakara, R., Mahapatra, S.S., Manufacturing cell formation with production data
1347;
Shahid, M., Sahar, N., Khurshid, W.K., Alastair, hybrid genetic algorithm for job
shop scheduling problems and its sensitivity analysis (2012) Int. J. Intelligent
Systems Technologies and Applications, 11., NOS
ISBN: 9781509004362
ABBREVIATED SOURCE TITLE: Proc. Int. Conf. Emerg. Technol., ICET
SOURCE: Scopus
Wu, L., Suzuki, S.

57202867190;8649743800;
Cell formation design with improved similarity coefficient method and decomposed
mathematical model
1335-1352. Cited 13 times.
84934435089&doi=10.1007%2fs00170-015-6931-
7&partnerID=40&md5=d804077fdf0a4bea99f05bd101d7812c
DOI: 10.1007/s00170-015-6931-7
AFFILIATIONS: Department of Industrial Engineering and Management, Tokyo Institute
of Technology, 2-12-1, O-okayama, Meguro-ku, Tokyo, Japan
ABSTRACT: This research develops a new methodology for a cell formation problem in
the cellular manufacturing system. The methodology includes two phases. In the
first phase, an improved similarity coefficient method, which considers the
operation sequence and the number of repeated operations firstly in related
researches, is proposed to identify part families. A new decomposed mathematical
model is presented in the second phase, which considers some crucial operational
aspects such as alternative routing, machine capacity, part demand, operation time,
and lot splitting, to assign machines into part families for minimum machine cost,
operation cost, and inter-cell movement cost. The model puts emphasis on the effect
of trade-off between machine duplication and material inter-cell movement on
performance of the cell formation to optimize machine utilization and workload
balance. This paper also provides a concrete production schedule with optimum
system utilization for cell formation. Test problems and sensitivity analyses are
carried out to reveal the effectiveness and feasibility of the proposed
methodology. © 2015, Springer-Verlag London.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing system; Decomposed
mathematical model; Similarity coefficient method
INDEX KEYWORDS: Cells; Costs; Cytology; Economic and social effects; Industrial
research; Manufacture; Mobile security; Production control; Sensitivity analysis,
Cell formation; Cell formation problem; Concrete productions; Machine utilization;
Operation sequences; Operational aspects; Similarity coefficient methods; System
utilization, Cellular manufacturing
reconfiguration (2009) Eur J Oper Res, 192 (2), pp. 414-428;
Anderberg, M.R., (1973) Cluster analysis for applications, pp. 84-85., Academic,
New York;
Res, 36 (3), pp. 777-794;
Baroni-Urbani, C., Buser, M.W., Similarity of binary data (1976) Syst Biol, 25 (3),
pp. 251-259;
Chen, M.Y., A mathematical programming model for system reconfiguration in a
dynamic cellular manufacturing environment (1998) Ann Oper Res, 77, pp. 109-128;
Chen, H.W., Wang, A.M., Ning, R.X., Formation of mixed configuration cell based on
product demand prediction (2013) Int J Adv Manuf Technol, 66, pp. 417-430;
on number and average length of intra and intercellular movements (2013) Appl Math
Model, 37 (4), pp. 1884-1896;
Defersha, F.M., Chen, M.Y., A linear programming embedded genetic algorithm for an
Oper Res, 187 (1), pp. 46-69;
process and routing flexibilities and setup costs (2006) J Oper Res Soc, 57, pp.
1100-1112;
manufacturing cell creation with machine modification costs (2006) Comput Oper Res,
33 (4), pp. 1010-1032;
Green, T.J., Sadowski, R.P., A review of cellular manufacturing assumptions,
advantages and design techniques (1984) J Oper Manag, 4 (2), pp. 85-97;
manufacturing systems—a sequential modelling approach (1989) Comput Ind Eng, 16
(4), pp. 469-476;
alternative routing (1993) Int J Prod Res, 31 (6), pp. 1259-1273;
Gupta, T., Seifoddini, H., Production data based similarity coefficient or machine-
(1990) Int J Prod Res, 28 (7), pp. 1247-1269;
Holley, J.W., Guilford, J.P., A note on the G index of agreement (1964) Educ
Psychol Meas, 24, pp. 749-753;
Islam, K.M.S., Sarker, B.R., A similarity coefficient measure and machine–parts
720;
Jeon, G., Leep, H., Forming part families by using genetic algorithm and designing
machine cells under demand changes (2006) Comput Oper Res, 33 (1), pp. 263-283;
Kamrani, A.K., Parsoei, H.R., Chandhry, M.A., A survey of design methods for
manufacturing cells (1993) Comput Ind Eng, 25 (1-4), pp. 487-490;
cell formation (2013) Int J Adv Manuf Technol, 65, pp. 1247-1259;
approach to facility layout design and cell formation (2012) Int J Adv Manuf
Technol, 59, pp. 737-753;
(2003) Prod Plan Control, 14 (5), pp. 437-446;
McAuley, J., Machine grouping for efficiency production (1972) Prod Eng, 51 (2),
pp. 53-57;
classification analysis in group technology (1991) J Manuf Syst, 10 (6), pp. 442-
448;
framework (1994) J Manuf Syst, 13 (3), pp. 196-220;
Romesburg, H.C., (1984) Cluster analysis for researchers, , Lifetime Learning
Publications, Belmont;
Oper Res, 185 (2), pp. 563-592;
Sarker, B.R., Xu, Y., Operation sequences-based cell formation methods: a critical
survey (1998) Prod Plan Control, 9 (8), pp. 771-783;
(1), pp. 3-20;
and machine capacity (1997) Int J Adv Manuf Technol, 13, pp. 134-147;
dynamic cell formation problem with fuzzy parameters (2008) Int J Eng Trans A, 21
(2), pp. 159-172;
materials flow approach based on operation sequences (1990) IIE Trans, 22 (1), pp.
84-97;
(1984) Int J Prod Res, 28 (6), pp. 937-948;
part populations (1991) IIE Trans, 31 (1), pp. 11-20;
considerations in cellular manufacturing (1998) Ann Oper Res, 77, pp. 97-107;
Witte, J.D., The use of similarity coefficients in production flow analysis (1980)
Int J Prod Res, 18 (4), pp. 503-514;
and production volumes (2001) Int J Prod Res, 39 (13), pp. 2755-2768;
Yin, Y., Yasuda, K., Modification of existing similarity coefficients by
considering an operation sequence ratio in designing cellular manufacturing systems
(2002) Ind Eng Manag Syst, 1 (1), pp. 19-28;
problem: a taxonomy and review (2006) Int J Prod Econ, 101 (2), pp. 329-352
CORRESPONDENCE ADDRESS: Wu, L.; Department of Industrial Engineering and
Management, Tokyo Institute of Technology, 2-12-1, O-okayama, Meguro-ku, Japan
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Ilić, O.R.
7801578785;
An e-Learning tool considering similarity measures for manufacturing cell formation
84901418491&doi=10.1007%2fs10845-012-0709-
7&partnerID=40&md5=0a533c0595c83040226c8a75687a6b31
DOI: 10.1007/s10845-012-0709-7
AFFILIATIONS: Faculty of Management Sciences, University of Belgrade, Jove Ilića
154, 11040 Belgrade, Serbia
ABSTRACT: Manufacturing cell formation is the first step in the design of cellular
manufacturing system. The primary objective of this step is to cluster machines
into machine cells and parts into part families so that the minimum of intercell
trips will be achieved. This paper will be focused on the configuration of machine
cells considering three types of initial machine-part matrix: binary (zero-one)
matrix, production volume matrix, and operation time matrix. The similarity measure
uses only information from these types of matrix. A pure combinatorial programming
formulation will be developed to maximize the sum of similarity coefficients
between machine/part pairs. An e-Learning tool/application to help industrial
students and engineers for enhancing their cell formation capability is proposed.
This tool is designed to include a novel similarity coefficient-based heuristic
algorithm for solving the cell formation problem. To determine the performance of
the proposed tool, comparison is made with a well-known tool along a case study. ©
2012 Springer Science+Business Media New York.
AUTHOR KEYWORDS: Cell formation; Cluster analysis; Combinatorial problem; e-
Learning; Similarity measure/coefficient
INDEX KEYWORDS: Cluster analysis; E-learning; Flexible manufacturing systems;
Heuristic algorithms, Algorithm for solving; Cell formation; Cell formation
problem; Combinatorial problem; Manufacturing cell formation; Production volumes;
Similarity coefficients; Similarity measure, Cellular manufacturing
REFERENCES: Arvindh, B., Irani, S.A., Cell formation: The need for integrated
solution of the subproblems (1994) International Journal of Production Research, 32
(5), pp. 1197-1218., 10.1080/00207549408956995;
Bhandwale, A., Kesavadas, T., A methodology to incorporate product mix variations
in cellular manufacturing (2008) Journal of Intelligent Manufacturing, 19, pp. 71-
85., 10.1007/s10845-007-0046-4;
duplication in cellular manufacturing systems (2011) International Journal of
Advanced Manufacturing Technology, 57, pp. 1155-1173., 10.1007/s00170-011-3334-2;
International Journal of Approximate Reasoning, 47 (2), pp. 141-165.,
10.1016/j.ijar.2007.03.003;
152., 10.1049/tpe.1971.0022;
Engineer, 56, pp. 34-38., 10.1049/tpe.1977.0129;
cellular manufacture (1982) Journal of Manufacturing Systems, 1 (1), pp. 65-75.,
10.1016/S0278-6125(82)80068-X;
Research, 24, pp. 1221-1233., 10.1080/00207548608919798;
10.1080/00207548808947932;
Ertay, T., Simulation approach in comparison of a pull system in a cell production
system with a push system in a conventional production system according to flexible
cost: A case study (1998) International Journal of Production Economics, 56-57, pp.
145-155., 10.1016/S0925-5273(98)00035-8;
Ertay, T., Satoglu, S.I., System parameter selection with information axiom for the
new product introduction to the hybrid manufacturing systems under dual-resource
constraint (2012) International Journal of Production Research, 50 (7), pp. 1825-
1839., 10.1080/00207543.2011.560205;
Fazakerly, G., Research report on the human aspects of group technology and
123-135., 10.1080/00207547608956585;
(1993) International Journal of Production Research, 31 (1), pp. 235-250.,
10.1080/00207549308956723;
pp. 318-344;
systems with scheduling considering stochastic processing time (2010) International
Journal of Advanced Manufacturing Technology, 48, pp. 701-717., 10.1007/s00170-009-
2322-2;
Gupta, T., Design of manufacturing cell for flexible environment considering
alternative routings (1993) International Journal of Production Research, 31 (6),
pp. 1259-1273., 10.1080/00207549308956790;
system (1990) International Journal of Production Research, 28 (7), pp. 1247-1269.,
10.1080/00207549008942791;
(2008) International Journal of Advanced Manufacturing Technology, 36, pp. 1157-
1169., 10.1007/s00170-007-0928-9;
Huber, V.L., Hyer, N.L., The human factor in cellular manufacturing (1985) Journal
of Operations Management, 5 (2), pp. 213-228., 10.1016/0272-6963(85)90008-7;
Ilić, O., Analysis of the number of automated guided vehicles required in flexible
Technology, 9, pp. 382-389., 10.1007/BF01748483;
Ilić, O., (2003) Computer Integrated Manufacturing, , Belgrade: Faculty of
Management Sciences, University of Belgrade. (In Serbian);
Irani, S.A., Huang, H., (2005) Hybrid Cellular Layouts: New Ideas for Design of
Flexible and Lean Layouts for Jobshops, , Department of industrial, welding and
systems engineering, The Ohio State University Columbus;
Irani, S.A., Huang, H., Cascading flowlines and layout modules: Practical
strategies for machine duplication in facility layouts (2006) International Journal
of Flexible Manufacturing Systems, 17, pp. 119-149., 10.1007/s10696-006-8124-z;
Jabal-Ameli, M.S., Akart, J., Cell formation with alternative process routings and
Manufacturing Technology, 35, pp. 761-768., 10.1007/s00170-006-0753-6;
Jaccard, P., Nouvelles recherches sur la distribution florale (1908) Bulletin
Société Vaudoise des Sciences Naturelles, 44, pp. 223-270., (In French);
Jayakrishnan Nair, G., Narendran, T.T., ACCORD: A bicriterion algorithm for cell
Khilwani, N., Ulutas, B.H., Islier, A.A., Tiwari, M.K., A methodology to design
virtual cellular manufacturing systems (2011) Journal of Intelligent Manufacturing,
22, pp. 533-544., 10.1007/s10845-009-0314-6;
Research, 18, pp. 213-232., 10.1080/00207548008919662;
Journal of Production Economics, 60, pp. 433-438., 10.1016/S0925-5273(98)00156-X;
Kusiak, A., Chow, W.S., An algorithm for cluster identification (1987) IEEE
Transactions on Systems, Man and Cybernetics, 17 (4), pp. 696-699.,
10.1109/TSMC.1987.289363;
machine-part cell formation problem (2010) Computers& Operations Research, 37, pp.
2071-2081., 10.1016/j.cor.2010.02.007;
problems with consideration of multiple production factors (2010) International
Journal of Advanced Manufacturing Technology, 46, pp. 1201-1213., 10.1007/s00170-
009-2170-0;
search for manufacturing cell formation (2009) International Journal of Advanced
Manufacturing Technology, 40, pp. 362-372., 10.1007/s00170-007-1346-8;
the formation of cellular manufacturing systems (2010) International Journal of
51, pp. 53-57., 10.1049/tpe.1972.0006;
and similarity coefficient in the GT machine cell formation problem (1989)
10.1080/00207548908942656;
27 (1), pp. 19-25., 10.1016/j.jmsy.2008.07.002;
(2010) Expert Systems with Applications, 37 (7), pp. 5476-5483.,
10.1016/j.eswa.2010.02.064;
research (2010) European Journal of Operational Research, 206 (3), pp. 509-521.,
10.1016/j.ejor.2009.10.020;
Pattanaik, I.N., Sharma, B.P., Implementing lean manufacturing with cellular
layout: A case study (2009) International Journal of Advanced Manufacturing
Technology, 42, pp. 772-779., 10.1007/s00170-008-1629-8;
Purcheck, G., A mathematical classification as a basis for the design of group
technology production cells (1975) Production Engineer, 54, pp. 35-48.,
10.1049/tpe.1975.0027;
manufacturing system (2011) Applied Mathematical Modelling, 35, pp. 1810-1819.,
10.1016/j.apm.2010.10.011;
statistical review of the literature (1997) Operations Research, 45, pp. 508-520.,
10.1287/opre.45.4.508;
Romesburg, H.C., (1984) Cluster Analysis for Researchers, , Lifetime learning
publications, Wadsworth, Inc. Belmont;
Safaei, N., Mehrabad, M.S., Babakhani, M., Designing cellular manufacturing systems
under dynamic and uncertain conditions (2007) Journal of Intelligent Manufacturing,
18, pp. 383-399;
23, pp. 1047-1061;
Satoglu, S.I., Durmusoglu, M.B., Ertay, T., A mathematical model and a heuristic
approach for design of the hybrid manufacturing systems to facilitate one-piece
flow (2010) International Journal of Production Research, 48 (17), pp. 5195-5220.,
10.1080/00207540903089544;
Seifoddini, H., Wolfe, P.M., Application of similarity coefficient method in GT
(1986) IIE Transactions, 18, pp. 271-277., 10.1080/07408178608974704;
Review evaluation and directions for future research (1998) Computers& Industrial
Engineering, 34, pp. 3-20., 10.1016/S0360-8352(97)00147-2;
European Journal of Operational Research, 69, pp. 284-291., 10.1016/0377-
2217(93)90016-G;
Singh, N., (1996) System Approach to Computer-integrated Design and
Manufacturing, , Wiley New York;
Sneath, S.H.A., Sokal, R.R., (1973) Numerical Taxonomy, , W. H. Freeman San
Francisco;
(1), pp. 1-18., 10.1016/j.omega.2004.07.016;
grouping in manufacturing cell formation (1987) Computers& Industrial Engineering,
12 (3), pp. 215-222., 10.1016/0360-8352(87)90015-5;
of Intelligent Manufacturing, 16, pp. 189-205., 10.1007/s10845-004-5888-4;
MACE (1984) International Journal of Production Research, 22 (6), pp. 937-948.,
10.1080/00207548408942513;
Wei, N.C., Mejabi, O.O., A clustering approach for minimizing intercell trips in
cell formation (2008) Journal of Intelligent Manufacturing, 19, pp. 13-20.,
10.1007/s10845-007-0042-8;
Management, 6 (2), pp. 125-147., 10.1016/0272-6963(86)90021-5;
10.1080/00207548708919850;
formation with machine layout and scheduling (2007) Computers& Industrial
Engineering, 53 (2), pp. 277-289., 10.1016/j.cie.2007.06.021;
Economics, 101, pp. 329-352., 10.1016/j.ijpe.2005.01.014;
159-165., 10.1007/s00170-004-2143-2
CORRESPONDENCE ADDRESS: Ilić, O.R.; Faculty of Management Sciences, University of
Belgrade, Jove Ilića 154, 11040 Belgrade, Serbia; email: [email protected]
PUBLISHER: Kluwer Academic Publishers
ISSN: 09565515
CODEN: JIMNE
SOURCE: Scopus
Arkat, J., Farahani, M.H., Hosseini, L.

55912953100;36990344200;36925239500;
Integrating cell formation with cellular layout and operations scheduling
84864571101&doi=10.1007%2fs00170-011-3733-
4&partnerID=40&md5=50a13d5d1c4ca16f3f77c08c04e30ea3
DOI: 10.1007/s00170-011-3733-4
Pasdaran Boulevard, Sanandaj, Iran
ABSTRACT: Designing a cellular manufacturing (CM) system involves three major
decisions: cell formation (CF), cellular layout (CL), and cellular scheduling (CS).
The integrated design of CM systems is investigated in this paper by proposing two
mathematical models. The first model integrates cellular layout problem with cell
formation problem to determine optimal cell configuration and the layout of
machines and cells in order to minimize the total movement costs. The second model
takes also the cellular scheduling into consideration with the objective of
minimizing the total completion time of parts. Two genetic algorithms are developed
to solve the real-sized problems. The proposed models are formulated as mixed
integer linear programming, and two numerical examples are solved in order to
investigate the effects of integration in the CM systems design. The results show
that considering CF, CL, and CS decisions in a simultaneous manner can
significantly improve the performance of the CM systems. © Springer-Verlag London
Limited 2011.
AUTHOR KEYWORDS: Cell formation; Cellular layout; Cellular manufacturing systems;
Genetic algorithm; Operations scheduling
INDEX KEYWORDS: Cell configurations; Cell formation; Cell formation problem;
Cellular layout; Integrated designs; Mixed integer linear programming; Numerical
example; Operations scheduling; Total completion time, Genetic algorithms;
Mathematical models; Scheduling, Cellular manufacturing
REFERENCES: Reene, T.J., Sadowski, P.R., A review of cellular manufacturing
assumptions, advantages and design technique (1984) J Oper Manag, 4 (2), pp. 85-97;
Wemmerlov, U., Hyer, N.L., Procedures for the part family, machine group
identification problem in cellular manufacturing (1986) J Opers Manag, 6, pp. 125-
147;
formation with machine layout and scheduling (2007) Comput Ind Eng, 53, pp. 277-
289;
Hassan, M.D., Layout design in group technology manufacturing (1995) Int J Prod
Econ, 38, pp. 173-188;
Arvindh, B., Irani, A., Cell formation: The need for an integrated solution of
subproblems (1994) Int J Prod Res, 32 (5), pp. 1197-1218;
breakdowns in the generalized cell formation problem (2008) Int J Adv Manuf Tech,
39, pp. 838-850;
statistical review of the literature (1997) Oper Res, 45, pp. 508-520;
Review, evaluation and directions for future research (1998) Comput Ind Eng, 34,
pp. 3-20;
Mahadavi, I., Paydar, M.M., Solimanpur, M., Hidarzade, A., Genetic algorithm
machine-part cell formation problems (2010) Comput Oper Res, 37, pp. 2071-2081;
group layout in cellular manufacturing (1993) Int J Prod Econ, 32, pp. 16-65;
Jajodia, S., Minis, I., Harhalakis, G., Proth, J., CLASS: Computerized layout
solutions using simulated annealing (1992) Int J Prod Res, 30 (1), pp. 95-108;
Salum, L., The cellular manufacturing layout problem (2000) Int J Prod Res, 38 (5),
pp. 1053-1069;
Urban, T.L., Chiang, W., Russell, R., The integrated machine allocation and layout
problem (2000) Int J Prod Res, 38 (13), pp. 2911-2930;
layout (2004) Comput Oper Res, 31, pp. 1603-1619;
Manuf Tech, 39, pp. 943-953;
based on TOPSIS method (2009) Comput Oper Res, 36, pp. 1478-1496;
systems: A genetic algorithm approach (2006) Int J Prod Res, 44 (6), pp. 1217-1241;
simulated annealing approach (1993) Int J Prod Res, 31 (12), pp. 2927-2945;
joint cell formation and operation allocation in cellular manufacturing (1995) Int
J Prod Res, 31 (1), pp. 1-15;
scheduling problem (2004) Int J Prod Econ, 88, pp. 231-241;
Franca, P.M., Gupta, J.N.D., Mendes, A.S., Moscato, P., Veltink, K.J., Evolutionary
algorithms for scheduling a flow shop manufacturing cell with sequence dependent
family setups (2005) Comput Ind Eng, 48, pp. 491-506;
Reddy, V., Narendran, T.T., Heuristics for scheduling sequence-dependent set-up
jobs in flow line cells (2003) Int J Prod Res, 41 (1), pp. 193-206;
Heragu, S., (1997) Facilities Design, , PWS Publishing Company, Boston;
Pinedo, M., (2002) Scheduling: Theory, Algorithms, and Systems, , Prentice Hall,
New Jersey;
Holland, J., (1992) Adaptation in Natural and Artificial Systems, , MIT Press,
Cambridge
of Kurdistan, Pasdaran Boulevard, Sanandaj, Iran; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Ostrosi, E., Tautrim, J., Fukuda, S.

55925839200;35933002400;55697015100;
Consensual cell searching in cellular manufacturing design
78650174037&doi=10.1007%2fs00170-010-2660-
0&partnerID=40&md5=ef520e341c7e4024af04c191ca789dcd
DOI: 10.1007/s00170-010-2660-0
AFFILIATIONS: Lean Institute, c/o Dr. Jörg Tautrim Engineering, 76209 Karlsruhe,
Germany;
Stanford University, 228 Hamilton Ave., Palo Alto, CA 94301, United States;
Tokyo Metropolitan University, 3-29-5, Kichijoji-Higashicho, Musashino, Tokyo 180-
0002, Japan
ABSTRACT: This paper presents an approach to consensual cell formation in cellular
manufacturing design. The cell formation is a multi-measurable criteria problem.
However, a number of factors limit the possibility of simultaneously considering
multiple criteria during the cell formation. During the cellular manufacturing
system design, the engineers must know the cells responding individually to each
criterion. Thus, for discerning the consensus in multiple-criteria cell formation
problem, a formal approach is proposed. The problem of consensus searching is
formulated as the problem of searching the best overlap between potential
solutions, called conjecture, under some constraints. Two models are proposed. The
first model is devoted to the consensus conjecture which satisfies globally the set
of measurable criteria. The second model addresses the problem of nucleus
recognition. Thus, the problem of consensus searching is an alternative to the
multiple-criteria problem optimisation. The results confirm the assumption that the
cell formation is a process of searching and evaluating the consensual information.
© 2010 Springer-Verlag London Limited.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing design; Consensus
identification; Multiple criteria
systems; Consensus identification; Formal approach; Multiple criteria;
Optimisations; Potential solutions, Design; Systems analysis, Cellular
manufacturing
REFERENCES: Ballakur, A., Steudel, H.J., A within-cell utilisation based heuristic
for designing cellular manufacturing systems (1987) Int J Prod Res, 25 (5), pp.
639-665., 10.1080/00207548708919868;
(1990) J Manuf Syst, 9 (3), pp. 222-232., 10.1016/0278-6125(90)90053-K;
objectives in cell formation decision (1990) J Oper Manag, 9 (4), pp. 465-480.,
10.1016/0272-6963(90)90005-X;
Burbidge, J., Production flow analysis (1963) Prod Eng, 42, pp. 742-752.,
10.1049/tpe.1963.0114;
Burbidge, J., Production flow analysis (1971) Prod Eng, 50, pp. 139-152.,
10.1049/tpe.1971.0022;
Sundaram, R.M., Lian, W.S., An approach for cellular manufacturing systems (1990)
Manuf Rev, 3 (2), pp. 91-97;
275., DOI 10.1007/s00170-003-1619-9;
International Journal of Advanced Manufacturing Technology, 39 (910), pp. 943-953.,
10.1007/s00170-007-1274-7;
Journal of Advanced Manufacturing Technology, , 10.1007/s00170-009-2170-0;
theoretic approach (1975) Int J Prod Res, 13 (6), pp. 567-579.,
10.1080/00207547508943029;
algorithm for cellular manufacturing (1986) Int J Prod Res, 24 (2), pp. 451-464.,
0582.90050 10.1080/00207548608919741;
grouping part-machines families (1986) Int J Prod Res, 24 (2), pp. 387-400., 880426
10.1080/00207548608919736;
method (1990) Int J Prod Res, 28 (2), pp. 325-336., 10.1080/00207549008942714;
incomplete power set (1975) J Cybern, 5, pp. 51-63., 411628
10.1080/01969727508545920;
Purcheck, G.F.K., Machine-component group formation: An heuristic method for
flexible production cells and flexible manufacturing systems (1985) Int J Prod Res,
23, pp. 911-943., 10.1080/00207548508904757;
Kusiak, A., The generalised group technology concept (1987) Int J Prod Res, 25 (4),
pp. 561-569., 10.1080/00207548708919861;
Int J Prod Res, 26 (7), pp. 1161-1172., 10.1080/00207548808947932;
Gunasingh K.Raja, Lashkari, R.S., Cell formation problem in cellular manufacturing
system. A sequential modelling approach (1989) Computers and Industrial
cellular manufacturing systems-an integer programming approach (1991) Comput Ind
Eng, 20 (1), pp. 111-117., 10.1016/0360-8352(91)90046-9;
machine capacity (1997) The International Journal of Advanced Manufacturing
Technology, 13 (2), pp. 834-840., 10.1007/BF01225760;
(1993) Int J Prod Res, 31 (4), pp. 933-945., 10.1080/00207549308956767;
McCormick, W.T., Schweitzer, P., White, T.W., Problem decomposition and data
0249.90046 10.1287/opre.20.5.993;
using a rank order clustering algorithm (1980) Int J Prod Res, 18 (2), pp. 213-
232., 10.1080/00207548008919662;
Review and extension (1982) Int J Prod Res, 20 (2), pp. 117-133.,
10.1080/00207548208947754;
cellular manufacture (1982) J Manuf Syst, 1 (1), pp. 65-74., 10.1016/S0278-
6125(82)80068-X;
clustering for group technology (1986) Int J Prod Res, 24 (5), pp. 1221-1233.,
10.1080/00207548608919798;
based on the fuzzy set theory (1990) J Manuf Syst, 11 (1), pp. 61-67.,
10.1016/0278-6125(92)90018-B;
Manuf Syst, 6 (2), pp. 117-124., 10.1016/0278-6125(87)90035-5;
Kusiak, A., EXGT-S: A knowledge based system for group technology (1987) Int J Prod
Res, 26 (5), pp. 887-904., 10.1080/00207548808947908;
Malavé, C.O., Ramachandaran, S., Neural network-based design of cellular
manufacturing systems (1991) J Intell Manuf, 2, pp. 305-314., 10.1007/BF01471178;
Lee, H., Malavé, C.O., Ramachandran, S., A self-organizing neural network approach
for the design of cellular manufacturing systems (1992) J Intell Manuf, 3, pp. 325-
332., 10.1007/BF01577273;
10), pp. 1001-1009., DOI 10.1007/s00170-006-0518-2;
McAuley, J., Machine grouping for efficient production (1972) Prod Eng, 51 (2), pp.
53-57., 10.1049/tpe.1972.0006;
group technology (1986) IIE Trans, 18 (3), pp. 271-277., 10.1080/07408178608974704;

MACE (1984) Int J Prod Res, 22 (6), pp. 937-948., 10.1080/00207548408942513;
group technology (1989) Int J Prod Res, 27 (12), pp. 2053-2062.,
10.1080/00207548908942674;
formations (1990) J Manuf Syst, 9 (1), pp. 55-68., 10.1016/0278-6125(90)90069-T;
machine-component grouping decisions in the design of cellular manufacturing system
(1990) Int J Prod Res, 28 (7), pp. 1247-1269., 10.1080/00207549008942791;
Prabhakaran, G., Janakiraman, T.N., Sachithanandam, M., Manufacturing data-based
combined dissimilarity coefficient for machine cell formation (2002) International
Journal of Advanced Manufacturing Technology, 19 (12), pp. 889-897., DOI
10.1007/s001700200101;
Mutel, B., De Guio, R., Clément, A., Recognition of cellular manufacturing under
management constraints (1989) Annals of the CIRP, 38 (1), pp. 451-454.,
10.1016/S0007-8506(07)62744-9;
Lemoine, Y., Mutel, B., Automatic recognition of production cells and part
families. TMR Ellis (1983) Advances in CAD/CAM, pp. 239-249., O.I. Semenkov (eds).
North-Holland Publishing Company Amsterdam;
(1987) Int J Prod Res, 25 (4), pp. 561-569., 10.1080/00207548708919861;
Akturk, M.S., Balkose, H.O., Part-machine grouping using a multiobjective cluster
analysis (1996) Int J Prod Res, 34, pp. 2299-2315., 0930.90017
10.1080/00207549608905026;
cell formation (2000) The International Journal of Advanced Manufacturing
Technology, 16 (7), pp. 491-497., 10.1007/s001700070057;
S0736584505000414;
Gupta, Y., Gupta, M., Kumar, A., Sundaram, C., A genetic algorithm based approach
to cell composition and layout design problems (1996) Int J Prod Res, 34, pp. 447-
482., 10.1080/00207549608904913;
pp. 829-853., DOI 10.1080/00207540512331311859;
The International Journal of Advanced Manufacturing Technology, 28, pp. 950-956.,
10.1007/s00170-004-2441-8;
simulated annealing (1998) Int J Prod Res, 36, pp. 2185-2207., 0940.90527
10.1080/002075498192805;
mathematics (1989) Int J Prod Res, 27 (9), pp. 1637-1651.,
10.1080/00207548908942644;
Ben-Arieh, D., Triantaphyllou, E., Quantifying data for group technology with
weighted fuzzy features (1992) Int J Prod Res, 30 (6), pp. 1285-1299.,
10.1080/00207549208942957;
Ben-Arieh, D., Lee, S.E., Chang, P.T., Fuzzy part coding for group technology
(1996) European Journal of Operational Research, 92 (3), pp. 637-648., DOI
10.1016/0377-2217(95)00155-7;
Dasari, R.V., Moon, Y.B., Analysis of part families for group technology
applications using decision trees (1997) The International Journal of Advanced
Manufacturing Technology, 13 (2), pp. 116-124., 10.1007/BF01225758;
Mutel, B., Ostrosi, E., Feature-based manufacturing cell formation using a fuzzy-
set approach (2002) International Journal of Computer Integrated Manufacturing, 15
(2), pp. 152-167., DOI 10.1080/09511920110049800;
Tautrim, J., Ostrosi, E., Ferney, M., Lean manufacturing and business design
architecture: Efficient and effective implementation of lean manufacturing
engineering (2006) International Journal of Advanced Manufacturing Systems, 10 (1),
pp. 1-8;
Suh, N.P., Cochran, D.S., Lima, P.C., Manufacturing system design (1998) Annals of
the CIRP, 47 (2), pp. 627-639., 10.1016/S0007-8506(07)63245-4;
Shaked, A., Sutton, J., Natural oligopolies (1983) Econometrica, 51 (5), pp. 1469-
1484., 0521.90026 10.2307/1912285;
Moorthy, S., Product and price competition in a duopoly (1988) Mark Sci, 7 (2), pp.
161-168., 10.1287/mksc.7.2.141;
Mendelson, H., Lee, D., Adoption of information technology under network effects
(2007) Inf Syst Res, 18 (4), pp. 395-413., 10.1287/isre.1070.0138;
Choudhary, V., Tyagi, R.K., Economic incentives to adopt electronic payment schemes
under competition (2009) Decis Support Syst, 46 (2), pp. 552-561.,
10.1016/j.dss.2008.10.006
CORRESPONDENCE ADDRESS: Ostrosi, E.; Laboratoire Mecatronique3M, Université de
Technologie de Belfort-Montbéliard, Belfort Cedex 90010, France; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Vin, E., Francq, P., Delchambre, A.

8360139700;23392368200;6603821707;
An adapted genetic algorithm to solve generalized cell formation
(2009) IFAC Proceedings Volumes (IFAC-PapersOnline), 13 (PART 1), pp. 1233-1238.
79960927881&doi=10.3182%2f20090603-3-RU-
2001.0285&partnerID=40&md5=044f78c56bf937a19c39ca550a277fba
DOI: 10.3182/20090603-3-RU-2001.0285
AFFILIATIONS: BEAMS Department, Université Libre de Bruxelles (ULB), Brussels, B-
1050, Belgium;
CoDE Department, Université Libre de Bruxelles (ULB), Brussels, B-1050, Belgium
ABSTRACT: This paper addresses the cell formation problem with alternative process
plans and machine capacity constraints. Given alternative process plans, machine
capacities and quantities of parts to produce, the problem consists in defining
preferential process and routing for each part (grouping of operations into
machines) optimizing machines grouping into manufacturing cells. The problem can be
decomposed in two distinct sub-problems: operations grouping on resources, yielding
flows between the machines, and grouping of these latter into independent cells.
The objective of the proposed method is to optimize both groupings (operations on
machines and machines into cell) minimizing of the inter-cellular moves. To solve
simultaneously both grouping interdependent problems, we propose a modified
grouping genetic algorithm (SIGGA). In our adapted grouping genetic algorithm, each
chromosome is composed of two parts, one part for each problem. According to
different application rates, the genetic operators are applied on the first, on the
second problem, or on both problems. Finally, the population chromosomes
simultaneously evolve in both problems. © 2009 IFAC.
INDEX KEYWORDS: Alternative process plans; Application rates; Capacity constraints;
Cell formation; Cell formation problem; Genetic operators; Grouping genetic
algorithms; On-machines; Sub-problems, Cellular manufacturing; Chromosomes;
Flexible manufacturing systems; Genetic algorithms; Mobile telecommunication
systems; Optimization; Process control, Mathematical operators
Engineering, 41 (2), pp. 227-240., DOI 10.1016/S0360-8352(01)00056-0, PII
S0360835201000560;
Engineers), 29 (7), pp. 599-610;
10.1016/S0925-5273(99)00065-1;
S0736584505000414;
Falkenauer, E., (1998) Genetic Algorithm and Grouping Problem, , Wiley & Sons;
pp. 1259-1273;
cell formation techniques (1996) International Journal of Factory Automation and
Information Management, 3 (3-4), pp. 225-265;
integer programming model employing genetic algorithms (1996) IIE Transactions
Research, 18 (2), pp. 213-232;
10.1016/j.amc.2007.01.060, PII S0096300307001014;
10.1016/S0360-8352(00)00074-7;
Sofianopoulou, S., Manufacturing cell design with alterantive process plans and/or
707-720;
S0925527301001645;
Vin, E., De Lit, P., Delchambre, A., A multiple objective grouping genetic
of Intelligent Manufacturing, 16 (2), pp. 189-206;
manufacturing cell formation problem (2008) Expert Systems with Applications, 34
(3), pp. 1609-1617;
885-906;
Research, 38 (2), pp. 385-395., DOI 10.1080/002075400189473
CORRESPONDENCE ADDRESS: Vin, E.; BEAMS Department, Université Libre de Bruxelles
(ULB), Brussels, B-1050, Belgium; email: [email protected]
ISSN: 14746670
ISBN: 9783902661432
SOURCE: Scopus
Mroue, H., Dao, T.-M.

56202277100;23011197400;
Manufacturing and fractional cell formation using a new binary digit grouping
algorithm with a Pwavroid solution explorer toolkit
(2014) Advanced Materials Research, 933, pp. 97-105. Cited 1 time.
84902238982&doi=10.4028%2fwww.scientific.net
%2fAMR.933.97&partnerID=40&md5=00e7280ec39704524798e4c9435b36f0
DOI: 10.4028/www.scientific.net/AMR.933.97
AFFILIATIONS: AÉROÉTS, Office G-S062, 323 Peel Street, Montreal QC H3C 3R9, Canada;
Superior Technology School, Office A-2912, 1100 Notre-Dame Street West, Montreal QC
H3C 1K3, Canada
ABSTRACT: A new algorithm is presented in order to search for the optimal solution
of the manufacturing and fractional cell formation problem. In addition, this paper
introduces a new toolkit, which is used to search for the various candidate
solutions in a periodic and a waving (diversified) manner. The toolkit consists of
15 tools that play a major role in speeding up the obtainment of the final solution
as well as in increasing its efficiency. The application of the binary digit
grouping algorithm leads to the creation of manufacturing cells according to the
concept of group technology. The nonzero entries, which remain outside the
manufacturing cells, are called exceptional elements. When a lot of such elements
is obtained, an additional cell called fractional (or remainder) cell may be
formed; the aim of which is to reduce their number. This algorithm was tested by
using illustrative examples taken from the literature and succeeded to give better
or at least similar results when compared to those of other well-known algorithms.
© (2014) Trans Tech Publications, Switzerland.
AUTHOR KEYWORDS: Binary digit grouping algorithm; Cell formation; Exceptional
elements; Fractional cell; Manufacturing cell; Pwavroid toolkit solution
explorer
INDEX KEYWORDS: Cellular manufacturing; Flexible manufacturing systems; Group
technology; Production engineering, Cell formation; Cell formation problem;
Exceptional elements; Grouping algorithm; Its efficiencies; Nonzero entries;
Optimal solutions; Pwavroid toolkit solution explorer, Algorithms
REFERENCES: Asokan, P., Prabhakaran, G., Machine-Cell Grouping in Cellular
Manufacturing Systems Using Non traditional Optimization Techniques - A Comparative
Study (2001) The International Journal of Advanced Manufacturing Technology, 18
(2), pp. 140-147;
Xiaodan, W., Chao-Hsien, C., Yunfeng, W., Weili, Y., A genetic algorithm for
cellular manufacturing design and layout (2007) European Journal of Operational
Research, 181, pp. 156-167;
Mosbah, B.A., Dao, T.-M., Optimization of group scheduling using simulation with
the meta-heuristic Extended Great Deluge (EGD) approach (2010) Industrial
Engineering and Engineering Management (IEEM), 2010 IEEE International Conference;
Mark, K.L., Wong, Y.S., An Adaptive Genetic Algorithm for Manufacturing Cell
Formation (2000) The International Journal of Advanced Manufacturing Technology, 16
(7), pp. 491-497;
Journal of Intelligent Manufacturing, 10 (5), pp. 437-447;
Solimanpur, M., Saeedi, S., Solving cell formation problem in cellular
manufacturing using ant- colony-based optimization (2010) The International Journal
The International Journal of Advanced Manufacturing Technology, 28 (9), pp. 950-
956;
Venkumar, P., Haq, N.A., Fractional cell formation in group technology using
modified ART1 neural networks (2006) The International Journal of Advanced
Manufacturing Technology, 28 (7-8), pp. 761-765., doi: 10.1007/s00170-004-2421-z;
Srinlvasan, G., Narendran, T.T., An assignment model for the part-families problem
pp. 145-152;
Chandrasekharan, M.P., Rajagopalan, R., GROUPABIL1TY: An analysis of the properties
PUBLISHER: Trans Tech Publications
ISSN: 10226680
ISBN: 9783038350910
ABBREVIATED SOURCE TITLE: Adv. Mater. Res.
SOURCE: Scopus
Vaghefinezhad, S., Wong, K.Y.

55270294100;12546114100;
A genetic algorithm approach for solving group technology problem with process plan
flexibility
(2012) Proceedings - 2012 14th International Conference on Modelling and
Simulation, UKSim 2012, art. no. 6205550, pp. 52-58. Cited 1 time.
84863103045&doi=10.1109%2fUKSim.2012.16&partnerID=40&md5=9baf9c72188598ea58ed63fde1
1d5ab5
DOI: 10.1109/UKSim.2012.16
AFFILIATIONS: Faculty of Mechanical Engineering, Universiti Teknologi Malaysia,
81310 UTM Johor Bahru, Malaysia
ABSTRACT: A more and more competitive environment and constantly changing
customers' favors have forced producers to enhance quality, efficiency and
flexibility. The cellular manufacturing system (CMS) which is a manufacturing
application of the group technology (GT) theory, has been known as one of the
recent technological innovations for providing more productivity and flexibility.
Different aspects of CMS have been continuously investigated in the recent years.
In the previous studies, minimizing the total number of intercellular movement or
exceptional parts has been considered as an objective. In this paper, a multi-
objective mathematical model for solving the group technology problem with process
route flexibility has been developed and described. The objective functions are
minimizing the total intercellular movement, machines' idle time and the total
required setup time while satisfying a number of constraints. A solver based on
genetic algorithm (GA) has been created and validated using the Visual Studio C#
programming language. Finally, the created software has been utilized to solve the
cell formation problem (CFP) in an industrial case company. © 2012 IEEE.
AUTHOR KEYWORDS: cellular manufacturing; group technology; machine-part grouping
problem
INDEX KEYWORDS: Cell formation problem; Competitive environment; Genetic algorithm
approach; Idle time; Intercellular movement; Machine-part grouping; Manufacturing
applications; Multi objective; Objective functions; Process plan; Process route;
Set-up time; Technological innovation; Technology problems; Visual studios,
Cellular manufacturing; Genetic algorithms; Group technology; Mathematical models;
Problem oriented languages, Problem solving
REFERENCES: Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the US industry: A
survey of users (1989) International Journal of Production Research, 27, pp. 1511-
1530;
Kusiak, A., (1992) Intelligent Design and Manufacturing, , Wiley;
Anderson, E.J., (1996) The Management of Manufacturing, , Addison-Wesley Publishing
Company, Inc;
Krajewski, L.J., Ritzman, L.P., (1996) Operations Management: Strategy and
Analysis, , Addison-Wesley Publishing Company, Inc;
Rembold, U., Blume, C., Dillman, R., (1985) Computer Integrated Manufacturing
Technology and Systems, , Marcel Dekker, Inc;
Waters, D., (1996) Operations Management, , Addison Wesley Publishing Company, Inc;
on Systems, Man and Cybernetics, 24, pp. 203-214;
Venugopal, V., Narendran, T.W., Design of cellular manufacturing systems based on
asymptotic forms of a boolean matrix (1993) European Journal of Operational
Research, 67, pp. 405-417;
Joines, J., Culbreth, C.T., King, R.E., Manufacturing cell design:An integer
85;
Research, 38, pp. 385-395;
3651-3669;
scheduling of virtual manufacturing cells (VMCs) (2010) Computers & Operations
Research, 37, pp. 1148-1156;
(2011) Expert Systems with Applications, 38, pp. 9597-9602
CORRESPONDENCE ADDRESS: Vaghefinezhad, S.; Faculty of Mechanical Engineering,
Universiti Teknologi Malaysia, 81310 UTM Johor Bahru, Malaysia; email:
[email protected]
ISBN: 9780769546827
ABBREVIATED SOURCE TITLE: Proc. - Int. Conf. Model. Simul., UKSim
SOURCE: Scopus
Contreras-Méndez, M., Aguilar-Fernández, M., Cristóbal-Vázquez, I.M.

56155282200;56154816800;56155193500;
On solving the problem of manufacturing cell formation using decision factors in a
genetic algorithm
(2012) 62nd IIE Annual Conference and Expo 2012, pp. 638-646.
84900305611&partnerID=40&md5=c8f1319f124f266c79386ade5486eb1a
AFFILIATIONS: Instituto Politécnico Nacional, UPIICSA, Iztacalco, Distrito Federal,

08400, Mexico
ABSTRACT: The main purpose of group technology in a manufacturing context is the
design and creation of production cells in which each cell specializes in producing
one family of components (i.e. parts). This is achieved through clustering parts
and machines based on the quantity of similar operations. The main problem of
switching between a traditional manufacturing layout to a Group Technology-based
layout is grouping parts into families. As result of an exhaustive survey of
previous contributions, a revised and improved genetic algorithm is proposed to
solve the cell formation problem. This algorithm includes a part-allocation scheme
that assigns parts to machine cells by means of decision factors. These factors
quantify each part contribution to the global solution efficiency. Other feature
that distinguishes this algorithm is the retention of good characteristics from
previous methodologies such as the chromosome codification and removes the burden
of local heuristics used to allocate pieces to machines. In order to validate this
proposal, a total of 28 problems were selected from the scientific literature and
solved through the proposed algorithm.
AUTHOR KEYWORDS: Decision factors; Genetic algorithms; Group technology;
Manufacturing cell formation
INDEX KEYWORDS: Cellular manufacturing; Exhibitions; Flexible manufacturing
systems; Genetic algorithms; Group technology, Cell formation problem; Decision
factors; Global solutions; Manufacturing cell formation; Production cells;
Scientific literature; Technology-based; Traditional manufacturing, Problem solving
REFERENCES: Groover, M., (2001) Solutions Manual: Automation, Production Systems
and Computer-Integrated Manufacturing, , Prentice Hall, Upper Saddle River, New
Jersey;
cell formation in cellular manufacturing Journal of Software Engineering &
Kamrani, A., Parsaei, H., A methodology for the design of manufacturing systems
using group technology (1994) Production Planning & Control, 5 (5), p. 450;
Burbidge, J., The simplification of material flow systems (1982) International
Journal of Production Research, 20 (3), p. 339;
Wemmerlov, U., Hyert, N., Research issues in cellular manufacturing (1987)
International Journal of Production Research, 25 (3), p. 413;
Transactions, 34 (9), p. 837;
Bedworth, D., Henderson, M., Wolfe, P., (1991) Computer-integrated Design and
Manufacturing, , McGraw-Hill, New York;
Frazier, G., Spriggs, M., Achieving competitive advantage through group technology
(1996) Business Horizons, 39 (3), p. 83;
Onyeagoro, E., Group technology cell design: A case study (1995) Production
Planning & Control, 6 (4), p. 365;
Ivanov, E., Grayson, T., (1968) Group Production Organization and Technology, ,
Business Publications Ltd. London;
Mitrofanov, S., Madison, W., (1961) Scientific Principles of Group Technology, ,
Defense Technical Information Center;
Petrov, V., (1968) Flowline Group Production Planning, , Business Publications Ltd.
London;
Shu Ming, N., On the characterization and measure of machine cells in group
technology (1996) Operations Research, 44 (5), p. 735;
Chen, H., Guerrero, H., A general search algorithm for cell formation in group
technology (1994) International Journal of Production Research, 32 (11), p. 2711;
Moujahid, A., Inza, I., Larrañaga, P., (1996) Algoritmos Genéticos, Universidad del
País Vasco, , Departamento de Ciencias de la Computación e Inteligencia Artificial;
Sharif, H., El-Kilany, K., Helaly, M., A genetic algorithm approach to the group
technology problem (2008) International Multi Conference of Engineers & Computer
Scientists 2008, pp. 1755-1760;
Tolmos, P., (2002) Introducción a Los Algoritmos Genéticos Y Sus Aplicaciones, ,
Asociación Española de Profesores Universitarios de Matemáticas aplicadas a la
Economía y la Empresa;
Prabhaharan, G., Asokan, P., Girish, B., Muruganandam, A., Machine cell formation
for cellular manufacturing systems using an ant colony system approach (2005) The
pp. 1989-2007;
Murugan, M., Selladurai, V., Manufacturing cell design with reduction in setup time
through genetic algorithm (2007) Asian Research Publication Network;
Contreras, M., (2011) Estudio Sobre la Tecnología de Grupos Y Su Integración de la
Manufactura Integrada Por Computadora, , Master of Industrial Engineering Thesis,
Instituto Politecnico Nacional, UPIICSA, Mexico;
Estévez, P., Optimización mediante algoritmos genéticos (1997) Anales del Instituto
de Ingenieros de Chile, 109 (2), pp. 83-92;
Araujo, L., Cervigón, C., (2009) Algoritmos Evolutivos: Un Enfoque Práctico, ,
Alfaomega, Spain;
Domingo, R., González, C., Calvo, R., Análisis del diseño y programación de celdas
en entornos de fabricación ágil (2004) Información Tecnológica, 15, pp. 55-60;
state-of-the-art review (1999) International Journal of Production Research, 37
(14), p. 3335
PUBLISHER: Institute of Industrial Engineers

ABBREVIATED SOURCE TITLE: IIE Annu. Conf. Expo
SOURCE: Scopus
Mahdavi, I., Paydar, M.M.

16417373200;23025569300;
Optimization of cellular manufacturing systems design using sequence data
1, pp. 191-197.
84888226823&partnerID=40&md5=b2168fed713f61d4c92db6bacd86626d

Science and Technology, Babol, Iran
ABSTRACT: Cell formation problem in Cellular Manufacturing System (CMS) design has
attracted the attention of researchers for more than three decades. However, the
use of sequence data for cell formation has been considered less frequently.
Sequence data provides valuable information about the flow patterns of various jobs
in a manufacturing system. Therefore, it is only natural to expect that the use of
sequence data results not only in identifying the part families and machine groups
but also in the layout of the machines within each cell. This study proposes an
efficient mathematical model for the CMS design problem, which handles the cell
formation and layout design simultaneously. We seek to minimize the total cost of
inter-cell and intra-cell (forward and backward) movements and the cost of
machines. This model also considers the minimum utilization level of each cell to
achieve the higher performance of cell utilization. Two examples from the
literature are solved by the LINGO software package to validate and verify the
proposed model. Copyright © (2008) by Computers & Industrial Engineering.
AUTHOR KEYWORDS: Cell formation; Cell utilization; Layout design; Mathematical
model; Sequence data
INDEX KEYWORDS: Cell formation; Cell formation problem; Cell utilizations; Design
problems; Forward-and-backward; Layout designs; Part family; Sequence data, Cells;
Cytology; Design; Industrial engineering; Mathematical models; Software packages,
pp. 101-113;
Research, 25, pp. 639-665;
Chiang, C.-P., Lee, S.-D., A genetic-based algorithm with the optimal partition
Computer Integrated Manufacturing, 17, pp. 346-375;
Kiang, M.Y., Kulkarni, U.R., Tam, K.Y., Selforganizing map network as an
interactive clustering tool - an application to group technology (1995) Decision
Lee, S.-D., Chen, Y.-L., A weighted approach for cellular manufacturing design:
International Journal of Advanced Manufacturing Technology, , Online First;
Park, S., Suresh, N.C., Performance of fuzzy art neural network and hierarchical
clustering for part- machine grouping based on operation sequences (2003)
Control, , Chapman and Hall Publishing, London, UK;
pp. 84-97;
Management, 6 (2), pp. 125-147;
2755-2768;
181, pp. 156-167
ISBN: 9781627486828
SOURCE: Scopus
Ponnambalam, S.G., SudhakaraPandian, R., Mahapatra, S.S., Saravanasankar, S.
7005929538;24173456100;34881914000;23975020200;
Modified ART1 neural networks for cell formation using production data
(2008) 4th IEEE Conference on Automation Science and Engineering, CASE 2008, art.
no. 4626507, pp. 603-608. Cited 5 times.
54949148411&doi=10.1109%2fCOASE.2008.4626507&partnerID=40&md5=9684fd8979d0c16f64e07
dcbca5a72ac
DOI: 10.1109/COASE.2008.4626507
AFFILIATIONS: School of Engineering, Monash University, 46150 Petaling Jaya,
Malaysia;
Kalasalingam University, India;
National Institute of Technology, Rourkela, India
ABSTRACT: In the present work, an attempt has been made to form disjoint machine
cells using modified ART1 (Adaptive Resonance Theory) to handle the real valued
workload matrix. The methodology first allocates the machines to various machine
cells and then parts are assigned to those cells with the aid of degree of
belongingness through a membership index. The proposed algorithm uses a
supplementary procedure to effectively take care of the problem of generating cells
with single machine that may be encountered at times. A modified grouping
efficiency (MGE) is proposed to measure the performance of the clustering
algorithm. The results of modified ART1 algorithm are compared with the results
obtained from K-means clustering and genetic algorithm. The modified ART1 results
are also compared with the literature results in terms of number of exceptional
elements. The performance of the proposed algorithm is tested with genetic
algorithm and K-means clustering algorithm. The results distinctly indicate that
the proposed algorithm is quite flexible, fast and efficient in computation for
cell formation problems and can be applied in industries with convenience. ©2008
IEEE.
AUTHOR KEYWORDS: Adaptive resonance theory networks; Cell formation; Grouping
efficiency.; K-means clustering
INDEX KEYWORDS: Algorithms; Boolean functions; Cells; Cellular manufacturing;
Cytology; Flow of solids; Genetic algorithms; Network protocols; Neural networks;
Resonance; Sensor networks; Water supply systems, Adaptive resonance theories;
Adaptive resonance theory networks; And genetic algorithms; Art1 neural networks;
Cell formation; Cell formation problems; Cell formations; Efficient; Exceptional
elements; Flexible; Grouping efficiencies; Grouping efficiency.; K-means
clustering; Literature results; Machine cells; Production datum; Single-machine;
Workload matrices, Clustering algorithms
REFERENCES: Burbidge, J.L., A Manual Method of Production Flow Analysis (1977) The
Production Engineer, 56, pp. 34-38;
King, (1980) Machine Component grouping in production flow analysis: An approach
using a rank order clustering algorithm, International Journal of Production
Research, 18 (2), pp. 213-232;
Rajagopalan, Batra, Design of cellular manufacturing systems: A graph theoretic
Research, 24 (5), pp. 1221-1233;
Chandrasekaran, M.P., Rajagopalan, R., ZODIAC: An algorithm for concurrent
formation of part families and machine cells (1987) International Journalof
Srinivasan, G., Narendran, T.T., A non hierarchical clustering algorithm for group
technology GRAFICS (1991) International Journal of Production Research, 29 (3), pp.
463-478;
Boctor, F.F., (1991) A linear formulation of the machine-partcell formation
problem, International Journal of Production Research, 29, pp. 343-346;
Venugopal, V., Narendran, T.T., (1992) A genetic algorithm approach to the machine
component grouping problem with multiple objectives, Computers and Industrial
Engineering22, pp. 469-480;
Jayakrishnannair, Narendran, T.T., CASE: A clustering algorithm for cell formation
with sequence data (1998) International Journal of Production Research, 36, pp.
157-179;
Jose Fernando, Maurico, (2002) A Hybrid Genetic Algorithm in cell formation
problems, AT&T Labs Research Technical Report TD-5FE6RN, AT&T Labs Research,
Florham Park, NJ 07932 USA; Wu, Low, Wu, A tabu search approach to the cell
formation problem (2004) International Journal of Advanced Manufacturing
Kao, Y., Moon, Y.B., A Unified Group Technology Implementation Using the
backpropagation Learning Rule of Neural Networks (1991) Computers and Industrial
Engineering, 20 (4), pp. 425-437;
Carpenter, G.A., Grossberg, S., Adaptive Resonance Theory, A Handbook of Brain
Theory and Neural Networks (2002) MIT Press, , Second Edition, Massachusetts, USA;
Kaparthi, S., Suresh, N.C., Machine Component cell formation in GT: A NN approach
Chen, Cheng, C.S., A neural network-based cell formation algorithm in cellular
318;
Pao, Y.-H., (1989) Adaptive Pattern Recognition and Neural Networks, , Addison
-Wesley Publishing Company, New York Inc;
Kumar.K.R and Chandrasekaran.M.P, (1990) Grouping efficacy: A quantitative
criterion forgoodness of block diagonal forms of binary matrices in group
technology., International Journal of Production Research, 28, 2233-243;
Zolfaghari, Liang, M., A new genetic algorithm for the machine/part grouping
Syswerda, (1991) Scheduling optimization using genetic algorithm. Handbook of
Genetic Algorithms, , Van Nostrand Reinhold, Newyork;
Venkumar.P and A.N.Haq, Manufacturing Cell Formation Using Modified ART1 Networks,
International Journal of Advanced Manufacturing Technology, 26 (2005), 906-
916CORRESPONDENCE ADDRESS: Ponnambalam, S. G.; School of Engineering, Monash
University, 46150 Petaling Jaya, Malaysia; email: [email protected]
ISBN: 9781424420230
ABBREVIATED SOURCE TITLE: IEEE Conf. Autom. Sci. Eng., CASE
SOURCE: Scopus
Kao, Y., Li, Y.L.

23034954300;57192533836;
Ant colony recognition systems for part clustering problems
15 times.
46149115431&doi=10.1080%2f00207540601078054&partnerID=40&md5=14529f8012e3b4b3a16fce
aba7d22737
DOI: 10.1080/00207540601078054
AFFILIATIONS: Department of Information Management, Tatung University, Taipei, 104,
Taiwan
ABSTRACT: Cellular manufacturing requires an effective part clustering method to
start up the manufacturing cell design. This paper presents a new part clustering
algorithm that uses the concept of the recognition system of artificial ants. The
proposed algorithm mimics the random meetings of real ants to build up the ability
of object recognition and then to form many initial part clusters with high
similarities. These initial part clusters are further merged into larger and larger
clusters in an agglomerative way until the designated number of part families is
reached. The characteristics of artificial ants, such as randomization and
collective behaviour, allow the algorithm to re-cluster wrongly grouped parts into
the proper clusters. As a result this can eliminate the chaining effects resulting
from the interference of abnormal parts during the clustering process. This
algorithm has been developed into a software system called the ant colony
recognition system (ACRS). A number of problems selected from the literature have
been solved by ACRS, and the evaluation results indicate that ACRS is able to solve
the cell formation problems effectively.
AUTHOR KEYWORDS: Ant algorithms; Cell formation; Cluster analysis; Group
technology
INDEX KEYWORDS: Boolean functions; Cellular manufacturing; Computer software;
Flexible manufacturing systems; Flow of solids; Object recognition, Ant colonies;
cell design; cell formation problems; Clustering methods; Clustering problems;
Clustering processes; Evaluation results; recognition systems; Software systems;
Start ups, Clustering algorithms
REFERENCES: Askin, G., Steven, H.C., Jeffrey, B.G., Asoo, J.V., A hamiltonian path
Int. J. Prod. Res, 29, pp. 1081-1100;
Bonabeau, E., Dorigo, M., Theraulaz, G., (1999) Swarm Intelligence: From Natural to
Artificial Systems, , Oxford University Press: New York;
Burbidge, L.J., (1975) The Introduction of Group Technology, , John and Sons: New
York;
(1973) Int. J. Prod. Res, 11, pp. 399-416;
cellular manufacture (1982) J. Manuf. Sys, 1, pp. 65-75;
algorithm for cellular manufacturing (1986) Int. J. Prod. Res, 25, pp. 835-850;
formation of part-families and machine-cell (1987) Int. J. Prod. Res, 25, pp. 835-
850;
Chu, C.H., Tsai, M.S., A comparison of three array-based clustering techniques for
manufacturing cell formation (1990) Int. J. Prod. Res, 28, pp. 1417-1433;
Deneubourg, J.L., Goss, S.N., Sendova-Franks, A., Detrain, C., Chretien, L., The
dynamics of collective sorting robot-like ants and ant-like robots (1991)
Proeedings of the 1st Conference on Simulation of Adaptive Behavior, pp. 356-363;
De Witte, J., The use of similarity coefficient in production flow analysis (1980)
Int. J. Prod. Res, 18, pp. 503-514;
Dorigo, M., Di Caro, G., The ant colony optimization meta-heuristic (1999) New
Ideas in Optimization, , edited by D. Corne, M. Dorigo and F. Glover, McGraw-Hill:
London;
Dorigo, M., Stutzle, T., (2004) Ant Colony Optimization, , MIT Press: Cambridge,
MA;
- an analysis of their performance (1991) Comput. Indust. Eng, 20, pp. 461-468;
Islam, K., Md, S., Sarker, B.R., A similarity coefficient measure and machine-parts
grouping in cellular manufacturing systems (2000) Int. J. Prod. Res, 38, pp. 699-
720;
using a rank order clustering algorithm formation in group technology (1980) Int.
J. Prod. Res, 18, pp. 213-232;
Review and extension (1982) Int. J. Prod. Res, 20, pp. 117-133;
J. Prod. Res, 28, pp. 233-243;
Kusiak, A., The generalized group technology concept (1987) Int. J. Prod. Res, 25,
pp. 561-569;
Kusiak, A., (2000) Computational Intelligence in Design and Manufacturing, , John
Wiley & Sons: New York;
Labroche, N., Monmarche, N., Venturini, G., A new clustering algorithm based on the
chemical recognition system of ants (2002) Proceedings of ECAI 2002, pp. 345-349;
Labroche, N., Monmarche, N. and Venturini, G., AntClust: ant clustering and web
usage mining. In GECCO 2003, LNCS 2723, edited by E. Cantú-Paz, et al., pp. 25-36,
2003 (Springer-Verlag: Berlin, Heidelberg); Lumer, E. and Faieta, B., Diversity and
adaptation in populations of clustering ants, in Proceeding of the Third
International Conference on Simulation of Adaptive Behavior: From Animals to
Animats, edited by D. Cliff, P. Husbands, J.A, Meyer and S.W. Wilson, pp. 501-508,
1994 (MIT Press: Cambridge, MA); Mansouri, S.A., Moattar Husseini, S.M., Newman,
S.T., A review of the modern approaches to multi-criteria cell design (2000) Int.
J. Prod. Res, 38, pp. 1201-1218;
McAuley, J., Machine grouping for efficient production (1972) Prod. Eng, 51, pp.
53-57;
for solving the cell formation problem in group technology (1991) J. Oper. Manage,
10, pp. 44-72;
Monmarche, N., Slimane, M., Venturini, G., AntClass: Discovery of clusters in
numeric data by a hybridization of an ant colony with the Kmeans algorithm (1999)
Internal Repport, E3i (213), pp. 1-21., Université de Tours, France;
approach (1990) Int. J. Adv. Manuf. Technol, 5, pp. 278-291;
framework (1994) J. Manuf. Sys, 13, pp. 196-220;
Rajagopalan, R., Batra, J., Design of cellular production systems - a graph
theoretic approach (1975) Int. J. Prod. Res, 13, pp. 567-579;
case study at Harnischfeger (1999) Int. J. Prod. Res, 37, pp. 3263-3273;
Selim, H.M., Askin, R.G., Vakharia, A.J., review evaluation and directions for
future research (1998) Comput. Ind. Eng, 34, pp. 3-20., Cell formation in group
technology;
manufacturing, Part I, A survey (1993) Int. J. Prod. Res, 31, pp. 1133-1142;
manufacturing, Part II, A extension and comparison (1993) Int. J. Prod. Res, 31,
pp. 1315-1326;
Singh, N., Rajamani, D., (1996) Cellular Manufacturing Systems - Design, Planning
and Control, , Chapman & Hall: London;
2158;
Srinivasan, G., Narendran, T.T., GRAFICS - a nonhierarchical clustering algorithm
for group technology (1991) Int. J. Prod. Res, 29, pp. 463-478;
Stanfel, E.L., Machine clustering for economic production (1985) Eng. Costs and
Prod. Economics, 9, pp. 73-81;
state-of-the-art-review (1999) Int. J. Prod. Res, 37, pp. 3335-3357;
Mace (1984) Int. J. Prod. Res, 22, pp. 937-948;
problem involving processing times and lot sizes (2003) Comput. Ind. Eng, 45, pp.
713-731
University, Taipei, 104, Taiwan; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Dehnavi-Arani, S., Saidi-Mehrabad, M., Ghezavati, V.

56521529300;18435197300;24402704900;
An integrated model of cell formation and scheduling problem in a cellular
manufacturing system considering automated guided vehicles' movements
(2019) International Journal of Operational Research, 34 (4), pp. 542-561.
85065618179&doi=10.1504%2fIJOR.2019.099108&partnerID=40&md5=429bd2fe73bcfa1e0172c74
8a4b638ca
DOI: 10.1504/IJOR.2019.099108
Technology, Narmak, Tehran, 16844, Iran;
School of Industrial Engineering, Islamic Azad University, South Tehran Branch,
Tehran, Iran
ABSTRACT: In this paper, an integrated mathematical model for cellular
manufacturing system (CMS) incorporating cell formation problem (CFP) and intra-
cell scheduling is considered. It is assumed that in order to make the flexibility
in handling system, automated guided vehicles (AGVs) are responsible for
transferring the exceptional parts from one cell to another cell. Employing the
AGVs in CMS can be challenging from mathematical model's point of view. In other
words, despite the common constraints in CFP and intra-cell scheduling, several
constraints such as AGVs' movement, preventing the AGVs' collision as well as
parts' pickup/delivery by AGVs must be taken to account. There is no comprehensive
model including the role of AGVs in a CMS. Hence, we endeavour to formulate CFP,
scheduling and role of AGVs at the same time. The objective function is to minimise
the sum of the maximum completion time (makespan) and inter-cellular movements of
parts. The proposed nonlinear model is transformed to a linear form in order to
solve it for optimality. Eventually, two small-size computational experiments are
generated and ran on the GAMS.9 commercial software to show the efficiency and
accuracy of the proposed model. © 2019 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing system; CFP;
CMS; Inter-cellular AGV; Intra-cell scheduling
REFERENCES: Behnamian, J., Fatemi Ghomi, S., Joly, F., Amirtaheri, O., Minimizing
makespan on a three-machine flowshop batch scheduling problem with transportation
using genetic algorithm (2012) Applied Soft Computing Journal, 12 (2), pp. 768-777;
Chandrasekar, K., Genetic algorithm approach for integrating cell formation with
machine layout and cell layout (2013) International Journal of Operational
Research, 16 (2), pp. 155-171;
Chang, C., Chang, C., A linearization method for mixed {0, 1} polynomial programs
Deep, K., Machine cell formation: Using genetic algorithm-based heuristic
considering alternative route (2015) International Journal of Operational Research,
24 (1), pp. 83-101;
Applications, 39 (3), pp. 2408-2414;
Fahmi, S.A., Elmekkawy, T.Y., Balakrishnan, S., Mathematical formulations for
scheduling in manufacturing cells with limited capacity buffers (2010)
Glover, F., Woolsey, E., Technical note-converting the 0-1 polynomial programming
problem to a 0-1 linear program (1974) Operations Research, 22 (1), pp. 180-182;
Hamana, R., Konishi, M., Imai, J., Simultaneous optimization of production and
transportation planning by using logic cut algorithm (2007) Mem Fac Eng Okayama
Univ, 41 (3), pp. 31-43;
Jolai, F., Tavakkoli-Moghaddam, R., Golmohammadi, A., Javadi, B., An
Khayat, G., Langevin, A., Reopel, D., Integrated production and material handling
scheduling using mathematical programming and constraint programming (2006)
Lacomme, P., Moukrim, A., Tchernev, N., Résolution conjointe de problèmes
d'ordonnancement et de la gestion du chariot filoguidé: Couplage branch and bound-
simulation à événements discrets (2000) Congrès ROADEF, pp. 128-139;
(12), pp. 2071-2081;
Li, Y., Li, X., Gupta, N.D., Solving the multi-objective flowline manufacturing
cell scheduling problem by hybrid harmony search (2015) Expert Systems with
Applications, 42 (3), pp. 1409-1417;
Megala, N., Rajendran, C., An improved ant-colony algorithm for the grouping of
machine-cells and part-families in cellular manufacturing systems (2013)
Rafiei, H., Rabbani, M., Gholizadeh, H., Dashti, H., A novel hybrid SA/GA algorithm
for solving an integrated cell formation-job scheduling problem with sequence-
dependent set-up times (2015) International Journal of Management Science and
Engineering Management, 11 (3), pp. 1-9;
Saidi-Mehrabad, M., Dehnavi-Arani, S., Evazabadian, F., Mahmoodian, V., An ant
colony algorithm (ACA) for solving the new integrated model of job shop scheduling
and conflict-free routing of AGVs (2015) Computers & Industrial Engineering, 86
(1), pp. 2-13;
cost uncertainty (1998) International Journal of Production Economics, 55 (1), pp.
97-109;
Sollimanpur, M., Elmi, A., A tabu search approach for cell scheduling problem with
pp. 639-645;
Tavakkoli-Moghaddam, R., Javadian, N., Khorrami, Y., Gholipour-Kanani, Y., Design
cellular manufacturing system (2010) Expert Systems with Applications, 37 (3), pp.
2661-2669;
Zhange, Q., Manier, H., Manier, M.A., A genetic algorithm with tabu search
procedure for flexible job shop scheduling with transportation constraints and
bounded processing times (2012) Computers and Operations Research, 39 (7), pp.
1713-1723
CORRESPONDENCE ADDRESS: Dehnavi-Arani, S.; Department of Industrial Engineering,
Iran University of Science and TechnologyIran; email: [email protected]
ISSN: 17457645
SOURCE: Scopus
Hazarika, M.
56241400000;
Machine Cell Formation with Alternative Routings based on Genetic Algorithm
(2018) Procedia Computer Science, 133, pp. 357-367.
85051343584&doi=10.1016%2fj.procs.2018.07.044&partnerID=40&md5=aca08e3191b3763c0dea
b0b8515801d0
DOI: 10.1016/j.procs.2018.07.044
AFFILIATIONS: Department of Mechanical Engineering, Assam Engineering College,
Guwahati, 781013, India
ABSTRACT: In automated batch type production systems, machine-part cell formation
problems (CFP) have long drawn attention of researchers. The objective of CFP in
cellular manufacturing system (CMS) is to identity machine cells and part families
in order to minimize the intercellular movements of parts as well as maximize the
utilization of machines. Optimum cell formation results reduction in total
production times, in-process inventories, material handling cost, labor cost/times,
paper works, number of machine set-ups, set-up times. It also simplifies process
plans, management and improves product quality, productivity, utilization of
resources. Since the modern manufacturing machines are generally multifunctional,
so the processing of parts can be performed by number of alternative routes. The
objectives of this study are to determine the optimal machine cells with optimal
processing route and balanced machine cells (minimum cell load variation). Here a
genetic algorithm heuristic approach is presented for six benchmark problems with
multiple process routes, sequence of processes and parts volume. Computational
outcome show that the proposed heuristic gives better result comparatively with the
well-known existing methods in terms of total intercellular movements. © 2018 The
Author(s).
AUTHOR KEYWORDS: Alternative process routings; Cellular manufacturing system;
Genetic algorithm; Intercellular movement of parts; Route selection
INDEX KEYWORDS: Cells; Cytology; Flow control; Genetic algorithms; Heuristic
methods; Materials handling; Robotics; Transportation routes; Wages, Alternative
process routings; Batch type productions; Cell formation problem; In-process
inventories; Intercellular movement; Material handling costs; Route Selection;
Utilization of resources, Cellular manufacturing
REFERENCES: Logendran, R., A workload based model for minimizing total intercell
and intracell moves in cellular manufacturing. (1990) Int J Prod Res, 28 (5), pp.
913-925;
designing cellular manufacturing systems. (1987) Int J Prod Res, 25 (5), pp. 639-
665;
2059-2079;
Ali, H.K., Karimi, B., Noktehdan, A., A novel discrete particle swarm optimization
algorithm for the manufacturing cell formation problem. (2014) Int J Adv Manuf
Technol, 73 (9-12), pp. 1543-1556;
the machine-part cell formation problem (2017) Materials Today: Proceedings, 4 (2),
pp. 1442-1451;
based on genetic algorithm. (2015) 2015 IEEE Workshop on Computational
Intelligence: Theories, Applications and Future Directions (WCI), pp. 1-6;
Kusiak, A., The generalized group technology concept. (1987) Int J Prod Res, 25
(4), pp. 561-569;
technology problem with multiple process routings. (1997) Computers & Industrial
Engineering, 32 (1), pp. 207-220;
problem in cellular manufacturing. (1992) Computers & Industrial Engineering, 22
(1), pp. 95-100;
alternative routeing. (1993) Int J Prod Res, 31 (6), pp. 1259-1273;
production factors. (2002) Int J Prod Res, 40 (4), pp. 885-906;
multiple process routings. (2013) Computers & Industrial Engineering, 66 (4), pp.
781-790;
Hazarika, M., Laha, D., A Heuristic approach for Machine Cell Formation problems
with Alternative Routings. (2016) Procedia Computer Science, 89, pp. 228-242;
Kusiak, A., (1990) Intelligent Manufacturing Systems., , Prentice Hall Press
Englewood Cliffs, NJ;
Li, J., Ding, Z., Lei, W., Fuzzy Cluster Analysis and Fuzzy Pattern Recognition
Methods for Formation of Part Families (1986) Proceedings of 14th NAMRC Conference,
pp. 558-563;
formation. (1991) Int J Prod Res, 29 (7), pp. 1475-1487;
manufacturing cell formation problems. (2008) Expert Systems with Applications, 34
(3), pp. 1609-1617;
Xing, B., Fulufhelo, V.N., Battle, K., Gao, W., Marwala, T., Application of
artificial intelligence (AI) methods for designing and analysis of reconfigurable
cellular manufacturing system (RCMS) (2009) 2009 2nd International Conference on
Adaptive Science & Technology (ICAST), pp. 402-409;
Miljkovic, Z., Babic, B., Machine-Part Family Formation by Using ART-1 Simulator
and FLEXY. (2005) FME Transactions, 33 (3), pp. 157-162;
problems. (2002) Int J Prod Res, 40 (9), pp. 2141-2158;
Ali, H.K., Karimi, B., Noktehdan, A., A novel discrete particle swarm optimization
algorithm for the manufacturing cell formation problem. (2014) Int J Adv Manuf
Technol, 73 (9-12), pp. 1543-1556;
grouping. (2009) Computers & Industrial Engineering, 56 (1), pp. 347-356;
Diaz, J.A., Luna, D., Luna, R., A GRASP heuristic for the manufacturing cell
formation problem. (2012) Top, 20 (3), pp. 679-706;
Gupta, N.S., Devika, D., Valarmathi, B., Sowmiya, N., Shinde, A., CARI-a heuristic
approach to machine-part cell formation using correlation analysis and relevance
index. (2014) Int J Prod Res, 52 (24), pp. 7297-7309;
formulation of machine cells in group technology. (1997) Int J Prod Res, 35 (2),
pp. 501-512;
Chen, C.-L., Cotruvo, N.A., Baek, W., A simulated annealing solution to the cell
formation problem. (1995) Int J Prod Res, 33 (9), pp. 2601-2614;
Sun, D., Lin, L., Batta, R., Cell formation using tabu search. (1995) Computers &
manufacturing systems cell formation problem. (1998) European Journal of Operations
Research, 105 (3), pp. 537-551;
Hazarika, M., Laha, D., Genetic Algorithm approach for Machine Cell Formation with
Alternative Routings (2018) Materials Today: Proceedings, 5 (1), pp. 1766-1775;
Raja, S., Anbumalar, V., An effective methodology for cell formation and intra cell
machine layout design in cellular manufacturing system using parts visit data and
operation sequence data. (2016) J. Braz. Soc. Mech. Sci. Eng., 38 (3), pp. 869-882;
Kim, C.O., Baek, B.J.-G., Baek, J.-K., A two-phase heuristic algorithm for cell
formation problems considering alternative part routes and machine sequences.
(2004) Int J Prod Res, 42 (18), pp. 3911-3927;
multiple process routings. (2013) Computers & Industrial Engineering, 66 (4), pp.
781-790;
cellular manufacturing systems. (2007) Int J Prod Res, 45 (4), pp. 913-934;
sequence data. (1998) Int J Prod Res, 36 (1), pp. 157-180;
George, A.P., Chandrasekharan, R., Ghosh, S., An analytical-iterative clustering
and ratio-level data. (2003) Int J Adv Manuf Technol, 22 (1-2), pp. 125-133;
replicate machines. (1999) Int J Prod Res, 37 (3), pp. 707-720;
multiple routes and multiple objectives. (2000) Int J Prod Res, 38 (2), pp. 385-395
CORRESPONDENCE ADDRESS: Hazarika, M.; Department of Mechanical Engineering, Assam
Engineering CollegeIndia; email: [email protected]
EDITORS: Zoppi M., Muthuswamy S.
ISSN: 18770509
SOURCE: Scopus
Tavakkoli-Moghaddam, R., Saidi-Mmehrabad, M., Safaei, N.

56491438400;55913497400;8886880300;
A new generalized cell formation model in uncertainty and dynamic conditions by
assuming routing flexibility and machine relocation
(2005) Proceedings of the 35th International Conference on Computers and Industrial
Engineering, ICC and IE 2005, pp. 1893-1898.
84886875500&partnerID=40&md5=301a5c3c62375d9747d651c962dee5b2

University of Tehran, P.O. Box: 11365, 4563, Tehran, Iran;
Tehran, Iran
ABSTRACT: This paper presents a fuzzy nonlinear mix-integer model of a cell
formation problem with uncertain demand and multi-period planning horizon. The
objectives are to optimize the number of cells by minimizing the machine costs and
inter-cell material handling. The proposed model is restricted to machine and cell
capacity. Each product has several process plans (i.e., routing flexibility). In
dynamic condition, a multi-period planning horizon is considered in which product
mix and demand in each period are different such as seasonal products. As a result,
the best cells designed for one period may not be efficient cells for subsequent
periods. Thus, it is possible that some of machines are relocated from a cell in
the current period to other in the next period (i.e., machine relocation). Also,
the optimum number of cells may be changed from a period to other (i.e., cell
size). Furthermore in many industries, the demand of products is imprecise (i.e.,
uncertainty condition). However, we can estimate the demand for each product by
experts' experiences in a fuzzy environment. The proposed model is verified by the
Lingo software under a number of instances and computational results are reported.
AUTHOR KEYWORDS: Cell formation; Fuzzy nonlinear-integer programming; Uncertainty
and dynamic conditions
INDEX KEYWORDS: Cell formation; Cell formation problem; Computational results;
Dynamic condition; Fuzzy environments; Material handling; Planning horizons;
Routing flexibility, Cellular manufacturing; Cytology; Industrial engineering;
Integer programming; Network routing; Routing algorithms, Cells
REFERENCES: Baykasogylu, A., Gindy, N., A simulated annealing algorithm for dynamic
layout problem (2001) Computers and Operation Research, 28 (1), pp. 1403-1426;
Black, J.T., (1991) The Design of the Factory with a Future, , New York: McGraw-
Hill;
(2000) Int. Journal of Production Economics, 64, pp. 279-284;
Gindy, N.N.Z., Ratchev, T.M., Case, K., Component grouping for group technology
applications - A fuzzy clustering approach with validity measure (1995) Int.
Lacksonen, T.A., Static and dynamic layout problems with varying areas (1994)
Lacksonen, T.A., Preprocessing for static and dynamic layout problems (1997)
1077-1094;
Monteruiln, B., Laforge, A., Dynamic layout design given a scenario tree of
probable future (1992) European Operational Research, 63, pp. 271-286;
(1997) Journal of Intelligent Manufacturing, 8, pp. 147-156;
flexible cellular manufacturing (1996) International Journal of Production Planning
and Control, 7 (6), pp. 585-593;
Computation, , Article in Press;
Wang, T.-Y., Shaw, C.-F., Chen, Y.-L., Machine selection in flexible manufacturing
cell: A fuzzy multiple attribute decision-making approach (2000) International
Xu, H., Wang, H., Ben, P., Part family formation for group technology applications
based on fuzzy mathematics (1989) International Journal of Production Research, 27
(9), pp. 1637-1651
CORRESPONDENCE ADDRESS: Department of Industrial Engineering, Faculty of
Engineering, University of Tehran, P.O. Box: 11365, 4563, Tehran, Iran
ISBN: 9755612653; 9789755612652

ABBREVIATED SOURCE TITLE: Proc. Int. Conf. Comput. Ind. Eng., ICC IE
SOURCE: Scopus
Keyhanian, S., Ahmadi, A., Karimi, B.

56118726800;57192408758;57193142554;
An Integrated Model of Scheduling and Configuration of the Operating Theater
(2018) 2018 5th International Conference on Control, Decision and Information
Technologies, CoDIT 2018, pp. 498-505. Cited 1 time.
85050232519&doi=10.1109%2fCoDIT.2018.8394879&partnerID=40&md5=051ce69d9b18dc39d5e6e
e1c044cfd44
DOI: 10.1109/CoDIT.2018.8394879
AFFILIATIONS: Amirkabir University of Technology (Tehran Polytechnic), Department
of Industrial Engineering and Management Systems, Tehran, Iran
ABSTRACT: We present a multi-objective binary programming model which considers
surgical cases scheduling among operating rooms and the configuration of surgical
instruments in limited capacity hospital trays, simultaneously. Many mathematical
models have been developed previously in the literature addressing different
challenges in health-care logistics such as assigning operating rooms, leveling
beds, and etc. But what happens inside the operating rooms along with the inventory
management of required instruments for various operations, and also their
integration with surgical scheduling have been poorly discussed. Our model
considers the minimization of movements between trays during a surgery which
recalls the famous cell formation problem in group technology. This assumption can
also provide a major potential contribution to robotic surgeries. The tray
configuration problem which consumes surgical instruments requirement plan (SIRP)
and sequence of surgical procedures based on required instruments (SI-RO) is nested
inside the bin packing problem. This modeling approach helps us understand that
most of the same-output solutions will not be necessarily identical when it comes
to the rearrangement of surgeries among rooms. A numerical example has been dealt
with via a proposed nested simulated annealing (SA) optimization approach which
provides insights about how various configurations inside a solution can alter the
optimal condition. © 2018 IEEE.
INDEX KEYWORDS: Cellular manufacturing; Group technology; Inventory control;
Operating rooms; Robotic surgery; Scheduling; Simulated annealing; Surgery, Bin
packing problem; Binary programming models; Cell formation problem; Integrated
modeling; Inventory management; Optimization approach; Surgical instrument;
Surgical procedures, Surgical equipment
REFERENCES: Defersha, F.M., Chen, M., A comprehensive mathematical model for the
design of cellular manufacturing systems (2006) International Journal of Production
Economics, 103 (2), pp. 767-783;
Duong, T.A., Lam, K.H., (2004) Combining Constraint Programming and Simulated
Annealing on University Exam Timetabling in RIVF;
Hanset, A., Meskens, N., Duvivier, D., Using constraint programming to schedule an
operating theatre inHealth (2010) IEEE Care Management (WHCM) 2010 IEEE Workshop
on;
Kämpke, T., Simulated annealing: Use of a new tool in bin packing (1988) Annals of
Operations Research, 16 (1), p. 327332;
Lundy, M., Mees, A., Convergence of an annealing algorithm (1986) Mathematical
Programming, 34 (1), p. 111124;
Luo, L., Surgical scheduling based on offline binpacking inService (2012) Systems
and Service Management (ICSSSM) 2012 9th International Conference on, , IEEE;
May, J.H., The surgical scheduling problem: Current research and future
opportunities (2011) Production and Operations Management, 20 (3), pp. 392-405;
Oostrum, J.M., A master surgical scheduling approach for cyclic scheduling in
operating room departments (2008) OR Spectrum, 30 (2), pp. 355-374;
Oostrum, J.M., A method for clustering surgical cases to allow master surgical
scheduling (2011) INFOR: Information Systems and Operational Research, 49 (4), pp.
254-260;
Rao, R., Iyengar, S., Binpacking by simulated annealing (1994) Computers &
Mathematics with Applications, 27 (5), pp. 71-82;
Thompson, J.M., Dowsland, K.A., A robust simulated annealing based examination
timetabling system (1998) Computers & Operations Research, 25 (7), pp. 637-648;
Thompson, J.M., Dowsland, K.A., Variants of simulated annealing for the examination
timetabling problem (1996) Annals of Operations Research, 63 (1), pp. 105-128;
Vijayakumar, B., A dual binpacking approach to scheduling surgical cases at a
publiclyfunded hospital (2013) European Journal of Operational Research, 224 (3),
pp. 583-591
CORRESPONDENCE ADDRESS: Ahmadi, A.; Amirkabir University of Technology (Tehran
Polytechnic), Department of Industrial Engineering and Management SystemsIran
ISBN: 9781538650653
ABBREVIATED SOURCE TITLE: Int. Conf. Control, Decis. Inf. Technol., CoDIT
SOURCE: Scopus
Aljuneidi, T., Bulgak, A.A.

57190386221;6603338561;
Designing a Cellular Manufacturing System featuring remanufacturing, recycling, and
disposal options: A mathematical modeling approach
(2017) CIRP Journal of Manufacturing Science and Technology, 19, pp. 25-35. Cited 4
times.
85019948787&doi=10.1016%2fj.cirpj.2017.04.005&partnerID=40&md5=393bc728c0efcade2b6a
a26922aabb4a
DOI: 10.1016/j.cirpj.2017.04.005
University, 1455 de Maisonneuve Blvd., West, MontréalQuébec H3G 1M8, Canada
ABSTRACT: While “sustainability” in the manufacturing sector is becoming a pivotal
issue, one should consequently expect a growing research interest in design
problems in “Sustainable Manufacturing Systems” (SMSs). When a product ceases to be
of any further use to the customer in it is current condition, it is relinquished.
Accordingly, there is a need for a product recovery options in a sustainable
environment. Recycling and remanufacturing are the most two advanced product
recovery options. An efficient recycling and remanufacturing network leads to an
efficient design of Sustainable Manufacturing enterprise. This article presents a
simultaneous investigation of Reconfigurable Cellular Manufacturing Systems and
Hybrid Manufacturing-Remanufacturing Systems (HMRSs), and proposes an integrated
approach in design optimization, analysis, and process planning aspects as an
attempt to address to a large number of design issues for Sustainable Manufacturing
Systems. The options of remanufacturing, recycling, and disposing are introduced. A
mixed integer linear programming (MILP) model, which considers a classical cell
formation problem in Cellular Manufacturing Systems (CMSs), bridged with a
production planning problem, in Hybrid Manufacturing-Remanufacturing Systems, while
addressing to “reconfiguration” issues for the CMS for different production
periods, has been developed. A numerical example is presented to illustrate the
proposed model. © 2017 CIRP
AUTHOR KEYWORDS: Mathematical programming; Recycling; Remanufacturing;
Sustainable Manufacturing; Sustainable Manufacturing System design
INDEX KEYWORDS: Industrial research; Integer programming; Manufacture; Mathematical
programming; Production control; Recycling; Sustainable development; Waste
management, Cell formation problem; Design optimization; Manufacturing sector;
Mixed integer linear programming model; Remanufacturing; Remanufacturing system;
Sustainable environment; Sustainable manufacturing, Cellular manufacturing
REFERENCES: Abbey, J.D., Meloy, M.G., Daniel, V., Guide, R., Jr., Atalay, S.,
Remanufactured Products in Closed-loop Supply Chains for Consumer Goods (2015)
Production and Operations Management, 24 (3), pp. 488-503;
Adamo, D.I., Rosa, P., Remanufacturing in Industry: Advices from the Field (2016)
The International Journal of Advanced Manufacturing Technology, 86, pp. 2575-2584;
Ahkioon, S., Bulgak, A.A., Bektas, T., Integrated Manufacturing System Design with
Production Planning & Dynamic System Reconfiguration (2009) European Journal of
Ahkioon, S., Bulgak, A.A., Bektas, T., Cellular Manufacturing System Design with
Routing Flexibility, Machine Procurement, Production Planning & Dynamic System
Reconfiguration (2009) International Journal of Production Research, 47 (6), pp.
1573-1600;
Aljuneidi, T., Bulgak, A.A., A Mathematical Model for Designing Reconfigurable
Cellular Hybrid Manufacturing-remanufacturing Systems (2016) The International
Aljuneidi, T., Bulgak, A., Dynamic Cellular Remanufacturing System (DCRS) Design
(2015) World Academy of Science, Engineering and Technology, International Science
Index 101, International Journal of Mechanical, Aerospace, Industrial, Mechatronic
and Manufacturing Engineering, 9 (5), pp. 793-797;
Aljuneidi, T., Bulgak, A., Design of Cellular Manufacturing Systems Considering
Dynamic Production Planning and Worker Assignments (2016) Journal of Mathematics
and System Sciences, 6, pp. 1-15;
Allais, R., Gobert, J., A Multidisciplinary Method for Sustainability Assessment of
PSS: Challenges and Developments (2016) CIRP Journal of Manufacturing Science and
Amin, S.H., Zhang, G., A Proposed Mathematical Model for Closed-loop Network
Configuration Based on Product Life Cycle (2012) International Journal of Advanced
Aras, N., Boycaci, T., Verter, V., Designing Reverse Logistics Network in Closed
Loop Supply Chains: New Developments to Improve Sustainability of Business
Practices (2010), CRC Press, Taylor and Francis; Arora, P.K., Haleem, A., Singh,
M.K., Recent Development of Cellular Manufacturing Systems (2013) Sadhana—Academy
Proceedings in Engineering Science, 38 (3), pp. 421-428;
Askin, G.R., Contributions to the Design and Analysis of Cellular Manufacturing
Systems (2013) International Journal of Production Research, 51 (23-24), pp. 6778-
6787;
Atasu, A., Van Wassenhove, L.N., Environmental Legislation on Product Take-Back and
Recovery in Closed Loop Supply Chains: New Developments to Improve sustainability
of Business Practices (2010), CRC Press, Taylor and Francis; Bhattacharya, A.,
Mohapatra, P., Kumar, V., Dey, P.K., Brady, M., Tiwari, M.K., Nudurupati, S.S.,
Green Supply Chain Performance Measurement Using Fuzzy ANP-based Balanced
Scorecard: a Collaborative Decision-making Approach (2014) Production Planning &
Control, 25 (8), pp. 698-714;
Bi, Z., Pomalaza, C., Singh, Z., Nicolette-Baker, A., Pettit, B., Heckley, C.,
Reconfigurable Machines to Achieve System Adaptability and Sustainability: A
Practical Case Study (2014) The Proceedings of the Institution of Mechanical
Engineers, Part B: Journal of Engineering Manufacture, pp. 1-13;
Chang, C.C., Wu, H.T., Wu, W.C., An Efficient Approach to Determine Cell Formation,
Cell Layout, and Intracellular Machine Sequence in Cellular Manufacturing System
Chanintrakul, P., Coronado Mondragon, A.E., Lalwani, C., Wong, C.Y., Revere
Logistics Network Design: A State-of-art Literature Review (2009) International
Journal of Business Performance and Supply Chain Modeling, 1, pp. 61-81;
Chen, M., Abrishami, P., A Mathematical Model for Production Planning in Hybrid
Manufacturing-remanufacturing Systems (2014) International Journal of Advanced
Choi, Y.C., Xirouchakis, P., A Holistic Production Planning Approach in a
Reconfigurable Manufacturing System with Energy Consumption and Environmental
Effects (2015) International Journal of Computer Integrated Manufacturing, 28 (4),
pp. 379-394;
Corum, A., Vayvay, O., Bayaraktar, E., The Impact of Remanufacturing on Total
Inventory Cost and Order Variance (2014) Journal of Clean Production, 85, pp. 442-
452;
Cucchiella, F., D'Adamo, I., Lenny Koh, S.C., Rosa, P., Recycling of WEEEs: An
Economic Assessment of Present and Future e-waste Streams (2015) Renewable and
Sustainable Energy Reviews, 51, pp. 263-272;
Defersha, F.M., Chen, M., A Comprehensive Mathematical Model for the Design of
Cellular Manufacturing Systems (2006) International Journal of Production
Economics, 103 (2), pp. 767-783;
Demirel, O.N., Gokcen, H., A Mixed Integer Programming Model for Remanufacturing in
Reverse Logistics Environment (2008) International Journal of Advanced
Dey, P.K., Cheffi, W., Green Supply Chain Performance Measurement Using the
Analytic Hierarchy Process: A Comparative Analysis of Manufacturing Organisations
(2013) Production Planning & Control, 24 (8-9), pp. 702-720;
Doh, H.H., Lee, D.H., Generic Production Planning Model for Remanufacturing Systems
Dubey, R., Gunasekaran, A., Childe, J.S., The Design of Responsive Sustainable
Supply Chain Network under Uncertainty (2015) International Journal of Advanced
Erenay, B., Suer, G.A., Huang, J., Maddisetty, S., Comparison of Layered Cellular
Manufacturing System Design Approaches (2015) Computers & Industrial Engineering,
85, pp. 346-358;
Esmaeilian, B., Behdad, S., Wang, B., The Evolution and Future of Manufacturing: A
Review (2016) Journal of Manufacturing Systems, 39, pp. 79-100;
Francalanza, E., Borg, J., Constantinescu, C., Development and Evaluation of a
Knowledge-based Decision-making Approach for Designing Changeable Manufacturing
Systems (2017) CIRP Journal of Manufacturing Science and Technology, 16, pp. 81-
101;
Garbie, I.H., An Analytical Technique to Model and Assess Sustainable Development
Index in Manufacturing Enterprises (2014) International Journal of Production
Research, 52 (16), pp. 4876-4915;
Garbie, I.H., DFSME: Design for Sustainable Manufacturing Enterprises (An Economic
Viewpoint) (2013) International Journal of Production Research, 51 (2), pp. 479-
503;
Garbie, I.H., Sustainability Optimization in Manufacturing Enterprises (2015)
Procedia CIRP, 26, pp. 504-509;
Garbie, I.H., Parsaei, H.R., Leep, H.R., Introducing New Parts into Existing
Cellular Manufacturing Systems Based on a Novel Similarity Coefficient (2005)
Giri, B.C., Sharma, S., Optimizing a Closed-loop Supply Chain with Manufacturing
Defects and Quality Dependent Return Rate (2015) Journal of Manufacturing Systems,
35, pp. 92-111;
Guide, V.D.R., Van Wassenhov, L.N., The Evolution of Closed-Loop Supply Chain
Research (2009) Operation Research, 57 (1), pp. 10-18;
Gunasekaran, A., Spalanzani, A., Sustainability of Manufacturing and Services:
Investigations for Research and Applications (2012) International Journal of
Guo, J., Ya, G., Optimal Strategies for Manufacturing/Remanufacturing System with
the Consideration of Recycled Products (2015) Computers and Industrial Engineering,
89, pp. 226-234;
Haapala, K.R., Zhao, F., Camelio, J., Sutherland, J.W., Skerlos, S.J., Dornfeld,
D.A., Jawahir, I.S., Rickli, J.L., A Review of Engineering Research in Sustainable
Manufacturing (2013) Journal of Manufacturing Science and Engineering-Transactions
of the Asme, 135 (4), p. 16;
Harik, R., El Hachem, W., Medini, K., Bernard, A., Towards a Holistic
Sustainability Index for Measuring Sustainability of Manufacturing Companies (2015)
Hasanov, P., Jaber, M.Y., Zolfaghari, S., Production, Remanufacturing and Waste
Disposal Models for the Cases of Pure and Partial Backordering (2012) Applied
Mathematics Modelling, 36, pp. 5249-5261;
Inderfurth, K., Optimal Policies in Hybrid Manufacturing/remanufacturing Systems
with Product Substitution (2004) International Journal of Production Economics, 90,
pp. 325-343;
Izui, K., Murakumo, Y., Suemitsu, I., Nishiwaki, S., Noda, A., Nagatani, T.,
Multiobjective Layout Optimization of Robotic Cellular Manufacturing Systems (2013)
Computer and Industrial Engineering, 64, pp. 537-544;
Jayal, A.D., Badurdeen, F., Dillon, O.W., Jr., Jawahir, I.S., Sustainable
Manufacturing: Modeling and Optimization Challenges at the Product, Process and
System Levels (2010) CIRP Journal of Manufacturing Science and Technology, 2, pp.
144-152;
Joines, J.A., Culbreth, C.T., King, R.E., Manufacturing Cell Design: An Integer
Programming Model Employing Genetic Algorithms (1996) IIE Transactions, 28, pp. 69-
85;
Govindan, K., Jha, P.C., Garg, K., Product Recovery Optimization in Closed-loop
Supply Chain to Improve Sustainability in Manufacturing (2016) International
Kannan, D., Diabat, A., Alrefaei, M., Govindan, K., Yong, G., A Carbon Footprint
Based Reverse Logistics Network Design Model (2012) Resources, Conservation and
Recycling, 67, pp. 75-79;
Kant, R., Pattanaik, N.L., Pandey, V., Framework for Strategic Implementation of
Cellular Manufacturing in Lean Production Environment (2015) Journal of
Manufacturing Technology Research, 6 (3-4), pp. 177-191;
Koren, Y., Heisel, U., Jovane, F., Moriwoki, T., Pritschow, G., Ulsoy, A.G., Van
Brussel, H., Reconfigurable Manufacturing Systems (1999) Annals of the CIRP, 2, pp.
1-13;
Koren, Y., Shapitalni, M., Design of Reconfigurable Manufacturing Systems (2010)
Krajnc, D., Glavic, P., A Model for Integrated Assessment of Sustainable
Development (2005) Resources Conservation and Recycling, 43 (2), pp. 189-208;
Larimian, T., Zarabadi, Z.S.S., Sadeghi, A., Developing a Fuzzy AHP Model to
Evaluate Environmental Sustainability from the Perspective of Secured by Design
Scheme—A Case Study (2013) Sustainable Cities and Society, 7, pp. 25-36;
Lee, J.Y., Lee, Y.T., A Framework for a Research Inventory of Sustainability
Assessment in Manufacturing (2014) Journal of Cleaner Production, 79, pp. 207-218;
Medini, K., Boucher, X., An Approach for Steering Products and Services Offering
Variety towards Economic and Environmental Sustainability (2016) CIRP Journal of
Manufacturing Science and Technology, 15, pp. 65-73;
Mehrabi, M.G., Ulsoy, A.G., Koren, Y., Reconfigurable Manufacturing Systems: Key to
Future Manufacturing (2000) Journal of Intelligent Manufacturing, 11, pp. 403-419;
Molina, A., Rodriguez, C.A., Ahuett, H., Cortés, J.A., Ramírez, M., Jiménez, G.,
Martinez, S., Next-generation Manufacturing Systems: Key Research Issues in
Developing and Integrating Reconfigurable and Intelligent Machines (2005)
Niakan, F., Baboli, A., Moyaux, T., Botta-Genoulaz, V., A Bi-objective Model in
Sustainable Dynamic Cell Formation Problem with Skill-based Worker Assignment
Niroomand, I., Kuzgunkaya, O., Bulgak, A.A., Impact of Reconfiguration
Characteristics for Capacity Investment Strategies in Manufacturing Systems (2012)
Parkinson, J.H., Thompson, G., Analysis and Taxonomy of Remanufacturing Industry
Practice (2003) Journal of Process Mechanical Engineering, 217 (3), pp. 243-256;
Pigosso, D.C.A., McAloone, T.C., Maturity-based Approach for the Development of
Environmentally Sustainable Product/Service-systems (2016) CIRP Journal of
Manufacturing Science and Technology, 15, pp. 33-41;
Renzi, C., Leali, F., Cavazzuti, M., Andisano, O.A., A Review on Artificial
Intelligence Applications to the Optimal Design of Dedicated and Reconfigurable
Manufacturing Systems (2014) International Journal of Advanced Manufacturing
Difrancesco, R.M., Huchzermeier, A., Closed-loop Supply Chains: A Guide to Theory
and Practice (2016) International Journal of Logistics Research and Applications,
19 (5), pp. 443-464;
Saad, S.M., The Reconfiguration Issues in Manufacturing Systems (2003) Journal of
Materials Processing Technology, 138, pp. 277-283;
Schonberger, R.J., Brown, K.A., Missing Link in Competitive Manufacturing Research
and Practice: Customer-responsive Concurrent Production (2017) Journal of
Operations Management, 49-51, pp. 83-87;
Vakharia, A.J., Slim, H., Group Technology (1994) The Handbook of Design,
Manufacturing, and Automation, pp. 435-460., R.C. Dorf A. Kusiak Wiley New York;
Wang, J., Zhao, J., Wang, X., Optimum Policy in Hybrid Manufacturing
Remanufacturing System (2011) Computers and Industrial Engineering, 60, pp. 411-
419;
Wiendahl, H.P., Greim, H., Nyhuis, P., Zäh, M., Wiendahl, H., Duffie, N.,
Changeable Manufacturing—Classification, Design and Operation (2007) CIRP Annals—
Xiong, Y., Zhao, Q.W., Zhou, Y., Manufacturer-remanufacturing vs Supplier-
remanufacturing in a Closed-loop Supply Chain (2016) International Journal of
Youssef, A.M.A., ElMaraghy, A.H., Optimal Configuration Selection for
Reconfigurable Manufacturing System (2007) International Journal of Flexible
Manufacturing System, 19, pp. 67-106;
Zeng, X., Yang, C., Chiang, J.F., Li, J., Innovating e-waste Management: From
Macroscopic to Microscopic Scales (2017) Science of the Total Environment, 575, pp.
1-5;
Zhang, X., Zhang, H., Jiang, Z., Wang, Y., A Decision-making Approach for End-of-
life Strategies Selection of Used Parts (2016) International Journal of Advanced
Manufacturing Technology, 87 (5-8), pp. 1457-1464
CORRESPONDENCE ADDRESS: Bulgak, A.A.; Department of Mechanical and Industrial
Engineering, Concordia University, 1455 de Maisonneuve Blvd., West, Montréal,
ISSN: 17555817
ABBREVIATED SOURCE TITLE: CIRP J. Manuf. Sci. Technol.
SOURCE: Scopus
Raja, S., Anbumalar, V.

57213222500;56392910300;
An effective methodology for cell formation and intra-cell machine layout design in
cellular manufacturing system using parts visit data and operation sequence data
(2016) Journal of the Brazilian Society of Mechanical Sciences and Engineering, 38
(3), pp. 869-882. Cited 5 times.
84958019995&doi=10.1007%2fs40430-014-0280-
6&partnerID=40&md5=ead23754b5ed566a6c65d3dfcf83ff57
DOI: 10.1007/s40430-014-0280-6
AFFILIATIONS: Department of Mechanical Engineering, PSNA College of Engineering and
Technology, Dindigul, 624622, India;
Department of Mechanical Engineering, Velammal College of Engineering and
Technology, Madurai, 625009, India
ABSTRACT: Cellular manufacturing is an efficient approach for implementing the
principles of Group Technology in a manufacturing environment. Most of the previous
studies in CMS have focused mainly on cell formation problem. However, only few
researches have discussed on CFP and CLP, simultaneously. In this paper, we present
a new heuristic approach based on modified flow matrix which simultaneously
considers cell formation, intracellular machine layout, exceptional elements and
voids issues in the CMS design using sequence data and number of parts visit data
between the machines. Above-mentioned data provide valuable information about the
various jobs in a manufacturing system. The objective of our proposed approach is
to group similar parts and corresponding different machines in same cells and
additionally considering the sequence of machines, exceptional elements and voids.
Moreover, our proposed approach considers inter-cell movement, backward movements,
number of voids and number of operations. A new performance measure modified group
technology efficacy is proposed for evaluating the performance of the proposed
methodology. Two well-known benchmark problems from the literature are considered
and results are compared with the existing methods. The results clearly
demonstrated that our proposed approach outperforms the previously proposed
methods. © 2014, The Brazilian Society of Mechanical Sciences and Engineering.
AUTHOR KEYWORDS: Cell formation problem; Cell layout design; Cellular
manufacturing system; Parts visit data; Sequence data
REFERENCES: Mcauley, J., Machine grouping for efficient production (1972) Prod Eng,
51, pp. 53-57;
Seiffodini, H., Single linkage V/S average linkage clustering in machine cells
9, pp. 73-81;
850;
Kusiak, A., The generalised group technology concept (1987) Int J Prod Res, 25, pp.
561-569;
Mahdavi, I., Javadi, B., Fallah-alipour, K., Slomp, J., Designing a new
(2007) Appl Math Comput, 190, pp. 662-670;
Viswanathan, Configuring cellular manufacturing systems: a quadratic integer
programming and a simple interchange heuristic (1995) Int J Prod Res, 33, pp. 361-
376;
Burbidge, J.L., A manual method for production flow analysis (1977) Prod Eng, 56,
pp. 34-38;
Burbidge, J.L., (1989) Production flow analysis, , Clarendon Press, Oxford;
the cell formation problem (2007) Comput Oper Res, 34, pp. 2059-2079;
Nair, G.J., Narendran, T.T., CASE: a clustering algorithm for cell formation with
Mahdavi, I., Mahadevan, B., CLASS: an algorithm for cellular manufacturing system
and layout design using sequence data (2008) Robot Comput Integr Manuf, 24, pp.
488-497;
materials flow approach based on operations sequences (1990) IIE Trans, 22, pp. 84-
97;
(1985) Eng Costs Prod Econ, 9, pp. 125-134;
formations (1988) J Manuf Syst, 9, pp. 55-68;
Int J Prod Res, 26, pp. 1161-1172;
Sarker, B.R., Xu, Y., Operation sequences-based cell formation methods: a critical
survey (1998) Prod Plan Control, 9, pp. 771-783;
Liao, T.W., Design of line-type cellular manufacturing systems for minimum
operating and material-handling costs (1994) Int J Prod Res, 32, pp. 387-397;
Trans, 29, pp. 561-571;
Lee, S.-D., Chiang, C.-P., A cut-tree-based approach for clustering machine cells
in the bidirectional linear flow layout (2001) Int J Prod Res, 39, pp. 3491-3512;
approach for the cell formation in bi-directional linear flow layout (2004) Comput
Integr Manuf, 17, pp. 346-375;
Houshyar, A., McGinnis, L.F., A heuristic for assigning facilities to locations to
minimize WIP travel distance in a linear facility (1990) Int J Prod Res, 28, pp.
1485-1498;
Afentakis, P., A loop layout design problem for flexible manufacturing systems
(1989) Int J Flex Manuf Syst, 1, pp. 175-196;
Int J Prod Res, 42, pp. 3911-3927;
Yin, Y., Yasuda, K., Reconsidering generalized similarity coefficient via a
sequence ratio (2004) Int J Ind Eng Theory Appl Pract, 11, pp. 140-150;
434-446;
Hu, G.H., Chen, Y.P., Zhou, Z.D., Fang, H.C., A genetic algorithm for the inter-
cell layout and material handling system design (2007) Int J Adv Manuf Technol, 34,
pp. 1153-1163;
Nouri, H., Tang, S.H., Hang, T.B.T., Anuar, M.K., BASE: a bacteria foraging
algorithm for cell formation with sequence data (2010) J Manuf Syst, 29, pp. 102-
110;
Mahdavi, I., Shirazi, B., Mahdi Paydar, M., A flow matrix-based heuristic algorithm
for cell formation and layout design in cellular manufacturing system (2008)
International J Adv Manuf Technol, 39, pp. 943-953;
based on TOPSIS method (2009) Comput Oper Res, 36 (5), pp. 1478-1496;
formation with machine layout and scheduling (2007) Comput Ind Eng, 53, pp. 227-
289;
(2009) Exp Syst Appl, 36 (2), pp. 3652-3661;
Chan, F.T.S., Lau, K.W., Chan, L.Y., Choy, K.L., Two-stage approach for machine-
part grouping and cell layout problems (2006) Robot Comput Integr Manuf, 22, pp.
217-238;
Chan, F.T.S., Lau, K.W., Chan, L.Y., Lo, V.H.Y., Cell formation problemwith
consideration of both intracellular and intercellular movements (2008) Int J Prod
Res, 46 (10), pp. 2589-2620;
Fariborz, J., Tavakkoli-Moghaddam, R., Golmohammadi, A., Javadi, B., An
Electromagnetism-like algorithm for cell formation and layout problem (2012) Exp
Syst Appl, 39, pp. 2172-2182;
Chang, C.-C., Wub, T.-H., Wu, C.-W., An efficient approach to determine cell
Mahdavi, I., Teymourian, E., Baher, N.T., Kayvanfar, V., An integrated model for
solving cell formation and cell layout problem simultaneously considering new
situations (2013) J Manuf Syst, 32, pp. 655-663;
Lee, K., Ahn, K.-I., GT efficacy: a performance measure for cell formation with
sequence data (2013) Int J Prod Res, 51 (20), pp. 6070-6081;
Aneke, N.A.G., Carrie, A.S., A design technique for the layout of multiproduct flow
lines (1986) Int J Prod Res, 24, pp. 471-481;
Abue-zeid, B.I.M., Zaidi, G.M.E.L., Sequence and cost considerations of materials
flow in the design of cellular manufacturing systems (2006) In: 7th Asia pacific
industrial engineering and management systems conference;
J Prod Res, 28, pp. 233-243;
formation for group technology applications (1990) Int J Prod Res, 28, pp. 185-198
CORRESPONDENCE ADDRESS: Raja, S.; Department of Mechanical Engineering, PSNA
College of Engineering and TechnologyIndia; email: [email protected]
ISSN: 16785878
ABBREVIATED SOURCE TITLE: J. Braz. Soc. Mech. Sci. Eng.
SOURCE: Scopus
Erozan, İ., Torkul, O., Ustun, O.

41261305600;6507811230;55911445000;
Proposal for a decision support software for the design of cellular manufacturing
systems with multiple routes
84925510143&doi=10.1007%2fs00170-014-6397-
z&partnerID=40&md5=7ef1acf88c9695252ad73f3162800f01
DOI: 10.1007/s00170-014-6397-z
AFFILIATIONS: Dumlupınar University, Kütahya, Turkey;
Sakarya Üniversity, Sakarya, Turkey
ABSTRACT: This study presents operational decision support software to efficiently
solve cell formation problems with multiple routes. The software includes two
revised algorithms that assist decision makers in choosing the best cellular
layout. These revised algorithms are the multiobjective genetic algorithm that uses
two different scalarization methods such as conic scalarization and weighted sum
scalarization and the fuzzy c-means algorithm for problems with multiple routes.
From these algorithms, the multiobjective genetic algorithm with conic
scalarization has important advantages over many multiobjective approaches in the
literature for being able to reach all efficient solutions for linear and nonlinear
multiobjective models. These revised algorithms and the decision support software
were tested on some data sets collected from an engine manufacturing plant and the
literature. The test results showed that, in many cases, the revised multiobjective
genetic algorithm with conic scalarization results in better performance than the
revised fuzzy c-means algorithm and the methods used in the test problems for
problems with multiobjective and multiple routes. Practitioners and researchers can
use this operational decision support software and the multiobjective genetic
algorithm with conic scalarization to obtain higher-quality cellular layout
solutions compared with other software applications in the literature. © 2014,
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Decision support systems
INDEX KEYWORDS: Application programs; Artificial intelligence; Clustering
algorithms; Copying; Decision making; Decision support systems; Fuzzy clustering;
Fuzzy systems; Genetic algorithms; Manufacture; Problem solving; Software testing,
Cell formation; Cell formation problem; Decision support software; Fuzzy C-means
algorithms; Multi-objective genetic algorithm; Multiobjective approach; Operational
decision support; Software applications, Cellular manufacturing
REFERENCES: Franc, P.M., Gupta, J.N.D., Mendes, P.M., Veltink, K.J., Evolutionary
algorithms for scheduling a flowshop manufacturing cell with sequence dependent
family setups (2005) Comput Ind Eng, 48, pp. 491-506;
Aktürk, M.S., Balköse, H.O., Part-machine grouping using a multi-objective cluster
analysis (1996) Int J Prod Res, 34 (8), pp. 2299-2315;
layout and operations scheduling (2012) Int J Adv Manuf Technol, 61, pp. 6637-6647;

for manufacturing optimization: problems, solutions, and comparisons (2000) IEEE
Trans Evol Comput, 4, pp. 93-113;
the design of cellular manufacturing layouts (2007) Comput Ind Eng, 52, pp. 380-
403;
Ehrgott, M., (2005) Multicriteria optimization, , Springer, Berlin:;
Gasimov, R.N., Characterization of the Benson proper efficiency and scalarization
in nonconvex vector optimization (2001) Multiple criteria decision making in the
new millennium, pp. 189-198., Koksalan M, Zionts S, (eds), Lecture notes in
economics and mathematical systems, Springer, Berlin:;
Kasimbeyli, R., A conic scalarization method in multi-objective optimization (2013)
J Glob Optim, 56, pp. 279-297;
Alia, O.M., Mandava, R., Aziz, M.E., Harmony search-based cluster initialization
for fuzzy c-means segmentation of MR images (2009) TENCON 2009–2009 I.E. region 10
conference, pp. 1-6;
Runkler, T.A., Katz, C., Fuzzy clustering by particle swarm optimization. IEEE Int.
Conf. on Fuzzy Systems (2006) Vancouver, pp. 601-608;
Taha, Z., Rotsam, S., A hybrid fuzzy AHP-PROMETHEE decision support system for
machine tool selection in flexible manufacturing cell (2012) J Intell Manuf, 23,
pp. 2137-2149;
Chang, C.C., Development of a web-based decision support system for cell formation
problems considering alternative process routings and machine sequences (2010) J
Softw Eng Appl, 3, pp. 160-166;
Mahadevan, B., Srinivasan, G., (2003) Software for manufacturing cell formation:
issues and experiences, , GT/CM World Symposium, Columbus:;
Luong, L., He, J., Abhary, K., Qiu, L., A decision support system for cellular
manufacturing system design (2002) Computers and Industrial Engineering, 42 (2-4),
pp. 457-470., 26th international conference on computers and industrial
engineering;
Chow, W.S., Kawaleshka, O., Expert support system for designing cellular
manufacturing (1991) Technol Manag, pp. 440-443;
Nunkaew, W., Phruksaphanrat, B., Novel efficient relaxation reference method for
part-machine clustering with assignment of duplicated machines. Paper presented at
the International Conference on Information Science, Electronics and Electrical
Engineering, Hokkaido, Japan (2014) April, pp. 26-28;
Hyer, N.L., Wemmerlov, U., (2002) Reorganizing the factory: competing through
cellular manufacturing, , Productivity, Portland:;
machine-component grouping decisions in the design of cellular manufacturing
systems (1990) Int J Prod Res, 28, pp. 1247-1269;
and production volumes (2001) Int J Prod Res, 39, pp. 2755-2768;
Wynn, M.T., Dumas, M., Fidge, C.F., Hofstede, A.H.M., Van der Aalst, W.M.P.,
Castellanos, M., Mendling, J., Weber, B., Business process simulation for
operational decision support (2007) Informal proceedings of the international
workshop on business process intelligence (BPI, 2007, pp. 55-66., QUT, Brisbane:;
Marler, R.T., Arora, S.J., The weighted sum method for multiobjective optimization:
new insights (2009) Struc Multidiscip Optim, 41 (6), pp. 853-862;
Kasimbeyli, R., A conic scalarization method in multi-objective optimization (2011)
Journal of Global Optimization, 56, pp. 279-297;
Kasimbeyli, R., Computing efficient solutions of nonconvex multi-objective problems
via scalarization (2011) Recent advances in signal processing, computational
geometry and systems theory, pp. 193-198., Lazard M, Bukis A, Shmaliy Y, (eds),
WSEAS, Florence:;
Kasimbeyli, R.A., Nonlinear cone separation theorem and scalarization in nonconvex
vector optimization (2010) SIAM J Optim, 20, pp. 1591-1619;
Wang, J., An approach to determining the optimal cell number of manufacturing cell
formation (2013) Telkomnika, 11 (4), pp. 1781-1786;
Wierzbicki, A.P., The use of reference objectives in multiobjective optimization
(1980) Multiple criteria decision making: theory and applications, pp. 468-486.,
Fandel G, Gal T, (eds), Lecture notes in economics and mathematical systems, vol.
177, Springer, Berlin:;
formation with machine layout and scheduling (2007) Comput Ind Eng, 53 (2), pp.
277-289;
replicate machines (1999) Int J Prod Res, 37 (3), pp. 707-720;
technology problem with multiple process routings (1997) Comput Ind Eng, 32 (1),
pp. 207-220;
561-569;
245;
(1994) Int J Prod Res, 32, pp. 273-297;
Gasimov, R.N., Sipahioglu, A., Sarac, T., A multi-objective programming approach to
1.5-dimensional assortment problem (2007) Eur J Oper Res, 179, pp. 64-79
CORRESPONDENCE ADDRESS: Erozan, İ.; Dumlupınar UniversityTurkey
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Safaei, N., Zuashkiani, A.

8886880300;16481680500;
Manufacturing system design by considering multiple machine replacements under
discounted costs
(2012) IIE Transactions (Institute of Industrial Engineers), 44 (12), pp. 1100-
1114. Cited 1 time.
84866631588&doi=10.1080%2f0740817X.2012.654845&partnerID=40&md5=93bfb75ad6bab50696a
0bc1f51b059fd
DOI: 10.1080/0740817X.2012.654845
AFFILIATIONS: Department of Mechanical and Industrial Engineering, University of
Toronto, ON M5S 1G8, Canada
ABSTRACT: This article investigates the effect of equipment replacement on the
design phase of multi-machine manufacturing systems, given a finite horizon and
discounted costs. For the most part, the manufacturing system design literature has
focused on the design issue, ignoring equipment replacement and its economic
impact. The design phase generally consists of equipment selection, process
routing, and layout decisions. The authors propose an explicit mathematical form
for the operating costs of equipment and their salvage values based on their
previous experience of life cycle costing projects. The design phase of cellular
manufacturing systems, the so-called cell formation problem, is used. The problem
is formulated as a non-linear mixed-integer programming model and solved using a
proposed branch-and-bound algorithm. The algorithm employs a depth-first branching
strategy in conjunction with a bounding procedure with a heuristic method. Selected
numerical examples demonstrate the applicability of the model and verify the
performance of the proposed algorithm. The results enable the best equipment mix
and product process routes to be chosen based on the given horizon and economic
factors; in addition, information is obtained about which equipment should be
replaced and at what time point this replacement should occur. © 2012 Taylor &
Francis Group, LLC.
AUTHOR KEYWORDS: cellular manufacturing systems; discounted costs; Manufacturing
system design; multi-machine systems; replacement
INDEX KEYWORDS: Bounding procedures; Branch-and-bound algorithms; Cell formation
problem; Depth first; Design issues; Design phase; Discounted costs; Economic
factors; Economic impacts; Equipment replacement; Equipment selection; Finite
horizons; Life cycle costing; Mathematical forms; Mixed-Integer Programming;
Multimachine systems; Multiple machine; Numerical example; Process routing; Product
process; replacement; Time points, Algorithms; Cellular manufacturing; Costs;
Design; Heuristic methods; Integer programming; Manufacture; Systems analysis,
Equipment
REFERENCES: Bellman, R.E., Equipment replacement policy (1955) SIAM Journal on
Applied Mathematics, 3, pp. 133-136;
Chand Suresh, Sethi Suresh, Planning horizon procedures for machine replacement
models with several possible replacement alternatives (1982) Naval research
logistics quarterly, 29 (3), pp. 483-493;
Cheevaprawatdomrong, T., Smith, R.L., A paradox in equipment replacement under
technological improvement (2003) Operations Research Letters, 31 (1), pp. 77-82.,
DOI 10.1016/S0167-6377(02)00153-0, PII S0167637702001530;
Goldstein, T., Ladany, S.P., Mehrez, A., Dual machine replacement model: A note on
planning horizon procedures for machine replacements (1986) Operations Research, 34
(6), pp. 938-941;
Goldstein, T., Ladany, S., Mehrez, A., A discounted machine replacement model with
an expected technological breakthrough (1988) Naval Research Logistics, 35 (2), pp.
209-220;
Jardine, A.K.S., Tsang, A.H.C., (2006) Maintenance, Replacement, & Reliability:
Theory and Applications, , Taylor and Francis, Boca Raton, FL;
Karabakal, N., Lohmann, J.R., Bean, J.C., A Lagrangian algorithm for the parallel
replacement problem with capital rationing constraints (1994) Management Science,
40 (3), pp. 305-319;
Leung, L.C., Tanchoco, J.M.A., Multiple machine replacement analysis (1990)
Engineering Costs and Production Economics, 20, pp. 265-275;
Lundin, R.A., Morton, T.E., Planning horizons for the dynamic lot size model, Zabel
vs. protective procedures and computational results (1975) Operations Research, 23
(4), pp. 711-734;
Research, 37 (14), pp. 3119-3138;
Mellichamp, J.M., Kwont, O.-J., Wahab, A.F.A., FMS designer: An expert system for
flexible manufacturing system design (2004) International Journal of Production
Research, 28, pp. 2013-2024;
Nair, S.K., Hopp, W.J., A model for equipment replacement due to technological
obsolescence (1992) European Journal of Operational Research, 63, pp. 207-221;
Oeltjenbruns, H., Kolarik, W.J., Schnadt-Kirschner, R., Strategic planning in
manufacturing systems-AHP application to an equipment replacement decision (1995)
Ozbayrak, M., Akgun, M., Turker, A.K., Activity-based cost estimation in a
push/pull advanced manufacturing system (2004) International Journal of Production
Pierskalla, W., Voelker, J., A survey of maintenance models: The control and
surveillance of deteriorating systems (1976) NavalResearch Logistics, 23, pp. 353-
388;
Rajagopalan, S., Capacity expansion and equipment replacement: A unified approach
(1998) Operations Research, 46 (6), pp. 846-857;
Rajamani, D., Szwarc, D., A mathematical model for multiple machine replacement
with material handling and relocation considerations (1994) Engineering
Optimization, 22 (3), pp. 213-229;
Safaei, N., Banjevic, D., Jardine, A.K.S., Economic life of capital equipments in a
cellular manufacturing system (2009) Proceedings of the 13th IFAC Symposium on
Information Control Problems in Manufacturing, pp. 81-86;
Safaei, N., Banjevic, D., Jardine, A.K.S., Impact of the use-based maintenance
policy on the performance of cellular manufacturing systems (2010) International
10.1016/j.ejor.2006.12.058, PII S0377221707000811;
Safaei, N., Tavakkoli-Moghaddam, R., Integratedmulti-period cell formation and
Safaei, N., Tavakkoli-Moghaddam, R., Sassani, F., A seriesparallel redundant
reliability system for the cellular manufacturing design (2009) Proceedings of the
Institution of Mechanical Engineers, Part O, Journal of Risk and Reliability, 223
(3), pp. 233-250;
Sassani, F., A simulation study on performance improvement of group technology
cells (1990) International Journal of ProductionResearch, 28, pp. 293-300;
Sethi, S., Chand, S., Planning horizon procedures for machine replacement models
(1979) Management Sciences, 25, pp. 483-493;
Simms, B.W., Lamarre, B.G., Jardine, A.K.S., Boudreau, A., Optimal buy, operate and
sell policies for fleets of vehicles (1984) European Journal of Operational
Research, 15 (2), pp. 183-195., DOI 10.1016/0377-2217(84)90208-X;
Stapleton, R.C., Hemmings, D.B., Scholefield, H.H., Technical change and the
optimal life of assets (1972) Operational Research Quarterly, 23 (1), pp. 45-59;
Sullivan, W.G., McDonald, T.N., Van Aken, E.M., Equipment replacement decisions and
lean manufacturing (2002) Robotics and Computer-Integrated Manufacturing, 18 (3-4),
pp. 255-265., DOI 10.1016/S0736-5845(02)00016-9, PII S0736584502000169;
Suresh, N.C., A generalized multi-machine replacement model for flexible automation
investments (1992) IIE Transactions, 24 (2), pp. 131-143;
Tanchoco, J.M.A., Leung, L.C., Input-output model for equipment replacement
decisions (1987) Engineering costs and production economics, 11 (2), pp. 69-78.,
DOI 10.1016/0167-188X(87)90013-9;
Tang Jen, Tang Kwei, Note on parallel machine replacement (1993) Naval Research
Logistics, 40 (4), pp. 569-573;
(2003) Product and TechnicalHandbook, , Timken The Timken Company
CORRESPONDENCE ADDRESS: Safaei, N.; Department of Mechanical and Industrial
Engineering, University of Toronto, ON M5S 1G8, Canada; email:
[email protected]
ISSN: 0740817X
CODEN: IIETD
SOURCE: Scopus
Islier, A.A.
55663506400;
Group technology by an ant system algorithm
times.
27744508049&doi=10.1080%2f0020754047000298566&partnerID=40&md5=a0000bcf0f9fd91b2279
7268b9041d94
DOI: 10.1080/0020754047000298566
AFFILIATIONS: Osmangazi University, Industrial Engineering Department, 26030
Bademlik, Eskisehir, Turkey
ABSTRACT: Clustering of items to form meaningful groups is a theoretically
challenging problem. Moreover, it has considerable practical value in
manufacturing. Therefore, extensive research is conducted in this field and
numerous techniques have been developed. The starting point of these techniques is
usually part-machine incidence matrices. This data structure models the cell
formation problem as well. Here, the aim is to get a block-diagonalized structure.
This is the basic problem of group technology. This paper presents a novel and
potent technique to solve this basic problem. The grouping problem is first
represented as an artificial ant system. Then better and better groupings are
obtained as semi-blind ants find their way by a communication-supported random
search process. Finally, the proposed technique is compared with other AI
methodologies, namely genetic algorithms, simulated annealing and tabu search. The
main concern in this evaluation phase was to devise an environment appropriate for
a fair assessment. For that reason, the stated techniques are formulated with the
simplest possible configurations and parallel structures. Tests made using the
well-known data sets from the literature revealed a remarkable outcome: ant systems
perform better than the other AI techniques as far as an equal number of solution
alternatives are concerned. © 2005 Taylor & Francis Ltd.
AUTHOR KEYWORDS: Ant systems; Artificial ant colonies; Cellular manufacturing;
Group technology
INDEX KEYWORDS: Data reduction; Genetic algorithms; Group technology; Problem
solving; Random processes; Search engines; Simulated annealing, Ant systems;
Artificial ant colonies; Cell formation problems; Tabu search, Cellular
manufacturing
REFERENCES: Askin, R.G., Standrige, C.R., (1993) Modeling and Analysis of
Manufacturing Systems, , Wiley: New York;
Beatty, C.A., Implementing advanced manufacturing technologies: Rules of the road
(1992) Sloan Management Review, SUMMER, pp. 49-60;
Boktor, F., A linear formulation of the machine-part cell formation problem (1991)
Int. J. Prod. Res., 29, pp. 343-356;
Bullnheimer, B., Kotsis, G., Strauss, C., Parallelization strategies for the Ant
System (1997) Selected Papers of High Performance Software for Nonlinear
Optimization: Status and Perspectives, HPSNO'97, , edited by Murli, Pardalos and
Toraldo, Kluwer Series in Applied Optimization, Kluwer: Dordrecht;
Burbidge, J.L., A manual method for production flow analysis (1977) The Prod. Eng.,
57, pp. 34-38;
Int. J. Prod. Res., 30, pp. 1209-1219;
Burges, A.G., Morgan, I., Vollmann, T.E., Cellular manufacturing: Its impact on
total factory (1993) Int. J. Prod. Res., 31, pp. 2059-2077;
Int. J. Prod. Res., 11, pp. 399-416;
Chan, H.W., Milner, D.A., Direct clustering algorithm for group formation in
cellular manufacture (1982) J. Manuf. Sys., 1, pp. 65-74;
835-850;
1035-1052;
Chow, W.S., Hawaleshka, A novel machine grouping and knowledge-based approach for
cellular manufacturing (1993) Euro. J. Oper. Res., 69, pp. 357-375;
Chu, C.H., Manufacturing cell formation by competitive learning (1993) Int. J.
Prod. Res., 31, pp. 829-843;
(1991) Int. J. Prod. Res., 29, pp. 1475-1487;
(1991) European Conference on Artificial Life, Paris, pp. 134-142., Elsevier:
Amsterdam;
Da Silveira, G., A methodology of implementation of cellular manufacturing (1999)
Int. J. Prod. Res., pp. 467-479;
De Witte, I., The use of similarity coefficients in production flow analysis (1980)
Int. J. Prod. Res., 18, pp. 503-514;
Dorigo, M., Di Caro, G., Gambardella, L.M., Ant algorithms for discrete
optimization (1999) Artificial Life, 5, pp. 137-172;
Dorigo, M., Gambardella, L.M., A study of some properties of Ant-Q (1996) PPSN -
Fourth International Conference on Parallel Problem Solving from Nature, pp. 656-
665., edited by Voigt, Ebeling, Rechenberg and Schwefel (Springer: Berlin);
Dorigo, M., Maniezzo, V., Colorni, A., (1991) Positive Feedback As a Search
Strategy, , Technical Report 91-016, Laboratorio di Calcolatori, Dipartimento di
Elettronica Politechnico di Milano;
Dorigo, M., Maniezzo, V., Colorni, A., The Ant System: Optimization by a colony of
cooperating agents (1996) IEEE Trans. Syst., Man, and Cybernetics - Part B, 26, pp.
1-13;
Ferreira, J.F., Pradin, B., A methodology for cellular manufacturing design (1993)
Int. J. Prod. Res., 31, pp. 235-250;
Manufacture, , Wiley: New York;
Glover, F., Tabu search: A tutorial (1990) Interfaces, 20, pp. 74-94;
Glover, F., Greenberg, H.J., New approaches for heuristic search: A bilateral
linkage with artificial intelligence (1989) Euro. J. Op. Res., 39, pp. 119-130;
Groover, M.P., (1987) Automation, Production Systems and CIM, , Prentice Hall
International: Engelwood Cliff, NJ;
Heragu, S.S., Group technology and cellular manufacturing (1994) Trans. Syst., Man
and Cybernetics, 24, pp. 203-215;
Islam, K.M., Sarker, R.B., A similarity coefficient measure and machine-parts
grouping in cellular manufacturing systems (1999) Int. J. Prod. Res., 38, pp. 699-
720;
Islier, A.A., Forming manufacturing cells by using a genetic algorithm (2001)
Anadolu Univ. J. Sci. Tech., 2, pp. 137-157;
Kamrani, A.K., Parsei, H.R., A methodology for forming manufacturing cells using
manufacturing and design attributes (1992) Comp. Industr. Eng., 23, pp. 73-76;
Kaparthi, S., Suresh, N.C., Machine-component cell formation in GT: A neural
network approach (1990) Int. J. Prod. Res., 30, pp. 1353-1367;
algorithm for part-machine grouping in GT (1993) Euro. J. Op. Res., 69, pp. 342-
356;
King, J.R., Nakornchai, V., Machine component group formation in group technology -
Review and extension (1982) Int. J. Prod. Res., 20, p. 117;
Kotter, J.P., Leading change: Why transformation efforts fail (1995) Harvard
Business Review, MARCH-APRIL, pp. 59-67;
J. Prod. Res., 28, pp. 233-243;
manufacturing (1987) Int. J. Prod. Res., 25, pp. 1715-1728;
Lee, H., Diaz, G., A network flow approach to solve clustering problems in GT
(1993) Int. J. Prod. Res., 31, pp. 603-612;
research presumptions with practice (1999) Int. J. Prod. Res., 37, pp. 3119-3138;
McAuley, J., Machine grouping for effective production (1972) The Prod. Eng., 52,
pp. 53-57;
attractiveness of group technology and cellular layouts (1990) Manage. Sci., 36,
pp. 1567-1578;
Purcheck, G., A mathematical classification as a basis for design of group
technology production cells (1975) Prod. Eng., 54, p. 34;
Purcheck, G., Machine-component group formation: An heuristic method for flexible
production cells and FMS (1985) Int. J. Prod. Res., 23, pp. 911-943;
theoretic approach (1975) Int. J. Prod. Res., 13, p. 567;
Sarker, B.R., Mondal, S., Grouping efficiency measures of cellular manufacturing
(1999) Int. J. Prod. Res., 37, pp. 285-314;
Sarker, R.B., Saiful Islam, K.M., Relative performances of similarity and
dissimilarity measures (1999) Comp. and Ind. Eng., 37, pp. 769-807;
Seifoddini, H., Machine-component group analysis versus the similarity coefficient
method in cellular manufacturing applications (1990) Comp. Ind. Eng., 18, pp. 333-
339;
case study at Harnishfeger (1999) Int. J. Prod. Res., 37, pp. 3263-3273;
manufacturing Part I (1993) Int. J. Prod. Res., 31, pp. 1133-1142;
Singh, N., Design of cellular manufacturing systems: An invited review (1993) Euro.
J. Op. Res., 69, pp. 284-291;
replicate machines (1999) Int. J. Prod. Res., 37, pp. 707-720;
Tam, K.Y., A simulated annealing algorithm for allocating space to manufacturing
cells (1992) Int. J. Prod. Res., 30, pp. 63-87;
Venugopal, V., Soft-computing-based approaches to group technology problem: A
state-of-the-art review (1999) Int. J. Prod. Res., 37, pp. 3335-3357;
component grouping problem (1992) Comp. and Ind. Eng., 22, pp. 469-480;
Venugopal, V., Narendran, T.T., Machine cell formation through neural network model
(1994) Int. J. Prod. Res., 32, pp. 2105-2116;
MACE (1984) Int. J. Prod. Res., 22, p. 937;
Wemmerlov, V., Hyer, N.L., Cellular manufacturing in US industry: A survey of users
(1989) Int. J. Prod. Res., 27, pp. 1511-1530;
Zhao, C., Wu, Z., A genetic algorithm for cell formation with multiple routes and
multiple objectives (2000) Int. J. Prod. Res., 38, pp. 385-395;
(2002) Int. J. Prod. Res., 40, pp. 2141-2158
CORRESPONDENCE ADDRESS: Islier, A.A.; Osmangazi University, Industrial Engineering
Department, 26030 Bademlik, Eskisehir, Turkey; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Rezaei-Malek, M., Razmi, J., Tavakkoli-Moghaddam, R., Taheri-Moghaddam, A.

55943655500;6506234931;56491438400;56951291700;
Towards a psychologically consistent cellular manufacturing system
times.
84974851615&doi=10.1080%2f00207543.2016.1192299&partnerID=40&md5=151ccca402f1dc62c4
423e59ffab4b6e
DOI: 10.1080/00207543.2016.1192299
LCFC, Arts et Métiers Paris Tech, Metz, France
ABSTRACT: In cellular manufacturing systems (CMSs), an operator plays an important
role. Because operators work for long-time periods in a production area, an
increase in job satisfaction and system productivity occurs if the consistency of
operators’ personal characteristics are considered in the design of CMSs. In a CMS,
a cell formation problem (CFP) focuses on grouping and allocating machines, part
families and operators to manufacturing cells. This paper considers a decision-
making style (DMS) as an operator’s personal characteristic index in a CFP for
designing a psychologically consistent CMS. DMS influences not only the interaction
between two operators, but also the work that operator does on a machine. Hence,
this paper develops a novel multi-objective mathematical model for the CFP
considering consistency between each two operators in each cell and consistency
between operator and his/her assigned machine(s). Because of possibility of a
change in the primary DMS of a person to the backup one, this paper tackles this
issue by applying a probabilistic procedure. Two hybrid meta-heuristic algorithms
are developed for the large-sized test problems. In addition, the PROMETHEE-II
method is applied to select the best Pareto solution. Finally, a real case study is
presented to show the applicability of the developed approach. © 2016 Informa UK
Limited, trading as Taylor & Francis Group.
AUTHOR KEYWORDS: cell formation; cellular manufacture; decision-making style;
metaheuristics; multi-criteria decision-making
INDEX KEYWORDS: Cells; Cytology; Decision making; Heuristic algorithms; Job
satisfaction; Manufacture; Mathematical operators, Best Pareto solutions; Cell
formation; Cell formation problem; Hybrid Meta-heuristic; Meta heuristics; Multi
criteria decision making; Personal characteristics; System productivity, Cellular
manufacturing
REFERENCES: Adil, G.K., Rajamani, D., Strong, D., A Mathematical Model for Cell
Formation Considering Investment and Operational Costs (1993) European Journal of
Albadawi, Z., Bashir, H.A., Chen, M., A Mathematical Approach for the Formation of
Manufacturing Cells (2005) Computers and Industrial Engineering, 48, pp. 3-21;
Asl-Najafi, J., Zahiri, B., Bozorgi-Amiri, A., Taherimoghaddam, A., A Dynamic
Closed-Loop Location-inventory Problem under Disruption Risk (2015) Computers &
Azadeh, A., Rezaei-Malek, M., Evazabadian, F., Sheikhalishahi, M., Improved Design
of CMS by Considering Operators Decision-Making Styles (2015) International Journal
Cesaní, V.I., Steudel, H.J., A Study of Labor Assignment Flexibility in Cellular
Manufacturing Systems (2005) Computers and Industrial Engineering, 48, pp. 571-591;
Chen, M., A Mathematical Programming Model for System Reconfiguration in a Dynamic

Cellular Manufacturing Environment (1998) Annals of Operations Research, 77, pp.
109-128;
Deb, K., (2001) Multi-Objective Optimization Using Evolutionary Algorithms, , New
York: John Wiley & Sons;
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T., A Fast and Elitist Multiobjective
Genetic Algorithm: NSGA-II (2002) IEEE Transactions on Evolutionary Computation, 6,
pp. 182-197;
Driver, M.J., (1979) Individual Decision Making and Creativity: Organizational
Behavior, , Columbus, GA: Grid Pub;
Driver, M.J., Brousseau, K.R., Hunsaker, P.L., (1998) The Dynamic Decision Maker:
Five Decision-Making Styles for Executive and Business Success, , New York: Harper
and Row;
Ebrahimipour, V., Najjarbashi, A., Sheikhalishahi, M., Multi-Objective Modeling for
Preventive Maintenance Scheduling in a Multiple Production Line (2012) Journal of
Ertay, T., Ruan, D., Data Envelopment Analysis Based Decision Model for Optimal
Operator Allocation in CMS (2005) European Journal of Operational Research, 164,
pp. 800-810;
Gao, H., Diao, M., Cultural Firework Algorithm and Its Application for Digital
Filters Design (2011) International Journal of Modelling, Identification and
Control, 14, pp. 324-331;
Heragu, S.S., (2006) Facilities Design, , 2nd ed, Boston, MA: iUniverse;
Javadi, B., Jolai, F., Slomp, J., Rabbani, M., Tavakkoli-Moghaddam, R., An
Integrated Approach for the Cell Formation and Layout Design in Cellular
Manufacturing Systems (2013) International Journal of Production Research, 51, pp.
6017-6044;
Levenshtein, V.I., Binary Codes Capable of Correcting Deletions, Insertions, and
Reversals (1966) Soviet Physics Doklady, 10, pp. 707-710;
Li, J., Zheng, S., Tan, Y., Adaptive Fireworks Algorithm (2014) Proceeding of the
2014 IEEE Congress on Evolutionary Computation (CEC), pp. 3214-3221., Beijing:;
Liu, J., Zheng, S., Tan, Y., The Improvement on Controlling Exploration and
Exploitation of Firework Algorithm (2013) Advances in Swarm Intelligence, Volume
7928 of the Series Lecture Notes in Computer Science, pp. 11-23., Berlin,
Heidelberg: Springer;
Liu, J., Zheng, S., Tan, Y., S-metric Based Multi-Objective Fireworks Algorithm
(2015) Proceeding of the 2015 IEEE Congress on Evolutionary Computation (CEC), pp.
1257-1264., Sendai:;
Mahdavi, I., Mahadevan, B., CLASS: An Algorithm for Cellular Manufacturing System
and Layout Design Using Sequence Data (2008) Robotics and Computer Integrated
Mahdavi, I., Aalaei, A., Paydar, M.M., Solimanpur, M., Designing a Mathematical
Model for Dynamic Cellular Manufacturing Systems Considering Production Planning
and Worker Assignment (2010) Computers and Mathematics with Applications, 60, pp.
1014-1025;
Mahdavi, I., Teymourian, E., Baher, N.T., Kayvanfar, V., An Integrated Model for
Solving Cell Formation and Cell Layout Problem Simultaneously Considering New
Situations (2013) Journal of Manufacturing Systems, 32, pp. 655-663;
Michalos, G., Makris, S., Chryssolouris, G., The Effect of Job Rotation during
Assembly on the Quality of Final Product (2013) CIRP Journal of Manufacturing
Science and Technology, 6, pp. 187-197;
Mohammadi, M., Forghani, K., A Novel Approach for Considering Layout Problem in
Cellular Manufacturing Systems with Alternative Processing Routings and
Subcontracting Approach (2014) Applied Mathematical Modelling, 38, pp. 3624-3640;
Mousazadeh, M., Torabi, S.A., Zahiri, B., A Robust Possibilistic Programming
Approach for Pharmaceutical Supply Chain Network Design (2015) Computers and
Chemical Engineering, 82, pp. 115-128;
Paydar, M.M., Mahdavi, I., Sharafuddin, I., Solimanpur, M., Applying Simulated
Annealing for Designing Cellular Manufacturing Systems Using MDmTSP (2010)
Paydar, M.M., Saidi-Mehrabad, M., Teimoury, E., A Robust Optimisation Model for
Generalised Cell Formation Problem Considering Machine Layout and Supplier
Selection (2014) International Journal of Computer Integrated Manufacturing, 27,
pp. 772-786;
Rafiei, H., Ghodsi, R., A Bi-objective Mathematical Model toward Dynamic Cell
Formation Considering Labor Utilization (2013) Applied Mathematical Modelling, 37,
pp. 2308-2316;
Rafiei, H., Rabbani, M., Koushan, M., Effect of Motivation and Learning Curve in
Dynamic Cell Formation and the Worker Assignment Problem (2012) International
Journal of Engineering & Research Technology, 1, pp. 2277-9655;
Rajamani, D., Singh, N., Aneja, Y., Integrated Design of Cellular Manufacturing
Systems in the Presence of Alternative Process Plans (1990) International Journal
Rezaei-Malek, M., Tavakkoli-Moghaddam, R., Robust Humanitarian Relief Logistics
Network Planning (2014) Uncertain Supply Chain Management, 2, pp. 73-96;
Rezaei-Malek, M., Tavakkoli-Moghaddam, R., Salehi, N., Robust Planning of Medical
Supplies with Time Windows in a Humanitarian Relief Logistic Network (2014)
Proceeding of the 44th International Conference on Computers and Industrial
Engineering (CIE44), , Istanbul: October 14–16;
Rezaei-Malek, N., Rezaei-Malek, M., Tavakkoli-Moghaddam, R., Rate of Improvement
Banking Service Based on Knowledge Management and Mobile Banking–case Study: Mellat
Bank (2014) Proceeding of the 6th Knowledge Management Conference, , Tehran:
February 26;
Rezaei-Malek, M., Tavakkoli-Moghaddam, R., Zahiri, B., Bozorgi-Amiri, A., An
Interactive Approach for Designing a Robust Disaster Relief Logistics Network with
Perishable Commodities (2016) Computers and Industrial Engineering, 94, pp. 201-
215;
Sakhaii, M., Tavakkoli-Moghaddam, R., Bagheri, M., Vatani, B., A Robust
Optimization Approach for an Integrated Dynamic Cellular Manufacturing System and
Production Planning with Unreliable Machines (2015) Applied Mathematical Modelling,
40, pp. 169-191;
Satoglu, S., Suresh, N.C., A Goal-Programming Approach for Design of Hybrid
Cellular Manufacturing Systems in Dual Resource Constrained Environments (2009)
Schaller, J., Designing and Redesigning Cellular Manufacturing Systems to Handle
Demand Changes (2007) Computers and Industrial Engineering, 53, pp. 478-490;
Sedighy, S.Q., Shakouri, G.H., Rezaei-Malek, M., A Novel Multi-Objective
Mathematical Model for Planning an Auxiliary Public Transportation Network: A
Covering-Routing Approach (2015) Journal of Economic Computation and Economic
Cybernetics Studies and Research, 49, pp. 239-262;
Selim, H.M., Askin, R.G., Vakharia, A.J., Cell Formation in Group Technology:
Review, Evaluation and Directions for Future Research (1998) Computers and
Shtubt, A., Modelling Group Technology Cell Formation as a Generalized Assignment
Solimanpur, M., Foroughi, A., A New Approach to the Cell Formation Problem with
Alternative Processing Routes and Operation Sequence (2011) International Journal
Süer, G.A., Bera, I.S., Optimal Operator Assignment and Cell Loading When Lot-
splitting is Allowed (1998) Computers and Industrial Engineering, 35, pp. 431-434;
Szwarc, D., Rajamani, D., Bector, C.R., Cell Formation Considering Fuzzy Demand and
Machine Capacity (1997) The International Journal of Advanced Manufacturing
Tan, Y., Zhu, Y., Fireworks Algorithm for Optimization (2010) Advances in Swarm
Intelligence Lecture Notes in Computer Science, 6145, pp. 355-364;
Tan, Y., Yu, C., Zheng, S., Ding, K., Introduction to Fireworks Algorithm (2013)
International Journal of Swarm Intelligence Research, 4, pp. 39-70;
Dynamic Cell Formation Problem Using Metaheuristics (2005) Applied Mathematics and
Tavakkoli-Moghaddam, R., Ranjbar-Bourani, M., Mirzahosseinian, H., Aryanezhad,
M.B., A New Multi-Objective Model for a Cell Formation Problem Considering Machines
Utilization and Alternative Process Routes (2009) IJE Transactions A: Basics, 22,
pp. 21-32;
Turcksin, L., Bernardini, A., Macharis, C., A Combined AHP-PROMETHEE Approach for
Selecting the Most Appropriate Policy Scenario to Stimulate a Clean Vehicle Fleet
(2011) Procedia Social and Behavioral Sciences, 20, pp. 954-965;
Tzeng, G.-H., Huang, J.-J., (2011) Multiple Attribute Decision Making: Methods and
Applications, , Boca Raton: CRC Press, Taylor & Francis Group;
Yu, C., Kelley, L., Zheng, S., Tan, Y., Fireworks Algorithm with Differential
Mutation for Solving the CEC 2014 Competition Problems (2014) Proceeding of the
2014 IEEE Congress on Evolutionary Computation (CEC), pp. 3238-3245., Beijing:;
Yu, C., Li, J., Tan, Y., Improve Enhanced Fireworks Algorithm with Differential
Mutation (2014) Proceeding of the 2014 IEEE International Conference on Systems,
Man and Cybernetics (SMC), pp. 264-269., San Diego:;
Zahiri, B., Tavakkoli-Moghaddam, R., Mohammadi, M., Jula, P., Multi-Objective
Design of an Organ Transplant Network under Uncertainty (2014) Transportation
Research Part E: Logistics and Transportation Review, 72, pp. 101-124;
Zahiri, B., Tavakkoli-Moghaddam, R., Pishvaee, M.S., A Robust Possibilistic
Programming Approach to Multi-Period Location–allocation of Organ Transplant
Centers under Uncertainty (2014) Computers & Industrial Engineering, 74, pp. 139-
148;
Zahiri, B., Torabi, S.A., Mousazadeh, M., Mansouri, S.A., Blood Collection
Management: Methodology and Application (2015) Applied Mathematical Modelling, 39,
pp. 7680-7696;
Zahiri, B., Tavakkoli-Moghaddam, R., Rezaei-Malek, M., An MCDA-DEA Approach for
Mixed-Model Assembly Line Balancing Problem under Uncertainty (2016) Journal of
Intelligent & Fuzzy Systems, 30, pp. 2737-2748;
Zhalechian, M., Tavakkoli-Moghaddam, R., Zahiri, B., Mohammadi, M., Sustainable
Design of a Closed-Loop Location-Routing-Inventory Supply Chain Network under Mixed
Uncertainty (2016) Transportation Research Part E: Logistics and Transportation
Review, 89, pp. 182-214;
Zhang, B., Zhang, M., Zheng, Y.-J., Improving Enhanced Fireworks Algorithm with New
Gaussian Explosion and Population Selection Strategies (2014) Advances in Swarm
Intelligence, Volume 8794 of the Series Lecture Notes in Computer Science, pp. 53-
63., Springer;
Zhang, B., Zhang, M.-X., Zheng, Y.-J., A Hybrid Biogeography-Based Optimization and
Fireworks Algorithm (2014) Proceeding of the 2014 IEEE Congress on Evolutionary
Computation (CEC), pp. 3200-3206., Beijing:;
Zheng, S., Janecek, A., Li, J., Tan, Y., Dynamic Search in Fireworks Algorithm
(2014) Proceeding of the 2014 IEEE Congress on Evolutionary Computation (CEC), pp.
3222-3229., Beijing:;
Zheng, Y.-J., Xu, X.-L., Ling, H.-F., Chen, S.-Y., A Hybrid Fireworks Optimization
Method with Differential Evolution Operators (2015) Neurocomputing, 148, pp. 75-82;
Zitzler, E., Künzli, S., Indicator-Based Selection in Multiobjective Search (2004)

Parallel Problem Solving from Nature–PPSN VIII, Volume 3242 of the Series Lecture
Notes in Computer Science, pp. 832-842., Springer;
Zitzler, E., Thiele, L., Multiobjective Optimization Using Evolutionary Algorithms
- a Comparative Case Study (1998) Parallel Problem Solving from Nature–PPSN V,
Volume 1498 of the Series Lecture Notes in Computer Science, pp. 292-301.,
Springer;
Zitzler, E., Laumanns, M., Thiele, L., (2001) SPEA2: Improving the Strength Pareto
Evolutionary Algorithm, , Eidgenössische Technische Hochschule Zürich (ETH),
Zurich: Institut für Technische Informatik und Kommunikationsnetze (TIK)
CORRESPONDENCE ADDRESS: Razmi, J.; School of Industrial Engineering, College of
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus

56029842600;16417373200;23025569300;
New criteria for configuration of cellular manufacturing considering product mix
variation
84978083370&doi=10.1016%2fj.cie.2016.06.021&partnerID=40&md5=c72824f012e930804e84c0
4842a2223e
DOI: 10.1016/j.cie.2016.06.021
Department of Industrial Engineering, Babol University of Technology, Babol, Iran
ABSTRACT: This paper deals with configuring manufacturing cells when product mix
variation occurs. Most of researches have addressed the cell formation problem when
part-machine incidence matrix is constant even for dynamic/stochastic case. But to
the nature of CMS in manufacturing products in mid-variety and mid-volume, the
product mix variation is not too far-fetched. Product mix variation causes the
part-machine incidence matrix to change. To formulate the proposed problem two
different criteria are considered which one relates to worker experts and another
to worker relations. The first object considers the maximizing the expert levels in
manufacturing cells. While the second object tries to maximize the interest levels
in manufacturing cells. To make these concepts practical, a mathematical
formulation which minimizes the voids of both worker-machine and worker-worker
incidence matrices is developed. Due to the non-homogenous nature of the objective
functions and possible conflicts, a bi-objective programming approach is applied.
To find the Pareto-optimal front, the augmented ε-constraint method (AUGMECON) is
applied. Since AUGMECON may not provide non-dominated set in a reasonable time,
especially for large-size instances, NSGAII algorithm is customized and applied to
produce optimal/near optimal Pareto solutions. To assess the performance of the
proposed NSGAII algorithm, several randomly generated test problems were solved for
a set of well-known multi-objective performance metrics. © 2016 Elsevier Ltd
AUTHOR KEYWORDS: Cellular manufacturing systems; NSGAII; Product mix variation;
Worker interest; ε-constraint method
INDEX KEYWORDS: Cells; Cytology; Flexible manufacturing systems; Manufacture;
Pareto principle, Bi objective programming; Cell formation problem; Constraint
methods; Epsilon-constraint method; Mathematical formulation; NSGA-II; Product mix
variations; Worker interest, Cellular manufacturing
REFERENCES: Aramoon Bajestani, M., Rabbani, M., Rahimi-Vahed, A.R., Baharian
Khoshkhou, G., A multi objective scatter search for a dynamic cell formation
problem (2009) Computers & Operations Research, 36, pp. 777-794;
Askin, R.G., Huang, Y., Forming effective worker teams for cellular manufacturing
Bérubé, J.F., Gendreau, M., Potvin, J.Y., An exact ε-constraint method for bi-
objective combinatorial optimization problems: Application to the Traveling
Salesman Problem with Profits (2009) European Journal of Operational Research, 194,
pp. 39-50;
Bidanda, B., Ariyawongrat, P., LaScola Needy, K., Norman, B.A., Tharmmaphornphilas,
W., Human related issues in manufacturing cell design, implementation, and
operation: A review and survey (2005) Computers & Industrial Engineering, 48, pp.
507-523;
cubic cell formation problem considering different worker skills (2014) Computers &
Bootaki, B., Mahdavi, I., Paydar, M.M., New bi-objective robust design-based
utilization towards dynamic cell formation problem with fuzzy random demands (2015)
Chankong, V., Haimes, Y.Y., Multi-objective decision making: Theory and methodology
(1983), North-Holland; Chu, C.H., Tsai, C.C., A heuristic algorithm for grouping
manufacturing cells (2001) Proceedings of the 2001 IEEE congress on evolutionary
computation, Seoul, Korea, pp. 310-317;
Collette, Y., Siarry, P., Multi-objective optimization: Principles and case studies
(2003), Springer New York; Corne, D., Jerram, N.R., Knowles, J., Oates, J., PESA-
II: Region-based selection in evolutionary multiobjective optimization (2001)
Proceedings of the genetic and evolutionary computation conference, San Francisco,
CA;
Corne, D.W., Knowles, J.D., Oates, M.J., The Pareto envelope-based selection
algorithm for multiobjective optimization (2000) Proceedings of sixth international
conference on parallel problem solving from nature, 18–20 September, 2000, ,
Springer Paris, France;
Deb, K., Multi-objective optimization using evolutionary algorithms (2001), John
Wiley and Sons Chichester; Deb, K., Pratap, A., Agarwal, S., Meyarivan, T., A fast
and elitist multiobjective genetic algorithm: NSGA-II (2002) IEEE Transactions on
Evolutionary Computation, 6 (2), pp. 182-197;
a cellular manufacturing system (2014) Journal of Manufacturing Systems, 33, pp.
578-588;
63, pp. 842-854;
Esmaili, M., Amjady, N., Shayanfar, H.A., Multi-objective congestion management by
modified augmented ε-constraint method (2011) Applied Energy, 88 (3), pp. 755-766;
Fonseca, C.M., Fleming, P.J., Multiobjective genetic algorithms (1993) IEE
colloquium on ‘genetic algorithms for control systems engineering’, 28 May, 1993, ,
IEE London, UK;
Fonseca, C.M., Fleming, P.J., On the performance assessment and comparison of
stochastic multiobjective optimizers (1996) Parallel problem solving from nature
IV, pp. 584-593., W. Ebeling I. Rechenberg H.P. Schwefel H.M. Voigt Springer-Verlag
Berlin, Germany;
Giri, R., Srinivas, J., Mouli, K.V.V.C., An optimal design approach for a cellular
manufacturing system (2007) Proceedings of the Institution of Mechanical Engineers,
Part B: Journal of Engineering Manufacture, 221 (6), pp. 1101-1106;
Goldberg, D.E., Genetic algorithms: Search, optimization and machine learning
(1989), Addison-Wesley Inc MA; Haimes, Y., Lasdon, L., Wismer, D., On a bi-
criterion formulation of the problems of integrated system identification and
system optimization (1971) IEEE Transactions on Systems, Man and Cybernetics, 1
(3), pp. 296-297;
Hajela, P., Lin, C.Y., Genetic search strategies in multicriterion optimal design
(1992) Structural Optimization, 4 (2), pp. 99-107;
Horn, J., Nafpliotis, N., Goldberg, D.E., A niched Pareto genetic algorithm for
multiobjective optimization (1994) Proceedings of the first IEEE conference on
evolutionary computation, IEEE world congress on computational intelligence, 27–29
June, 1994, , IEEE Orlando, FL, USA;
Knowles, J.D., Corne, D.W., Approximating the nondominated front using the Pareto
archived evolution strategy (2000) Evolutionary Computation, 8 (2), pp. 149-172;
Konak, A., Coit, D.W., Smith, A.E., Multi-objective optimization using genetic
algorithms: A tutorial (2006) Reliability Engineering and System Safety, 91, pp.
992-1007;
Lu, H., Yen, G.G., Rank-density-based multiobjective genetic algorithm and
benchmark test function study (2003) IEEE Transactions on Evolutionary Computation,
7 (4), pp. 325-343;
Mavrotas, G., Effective implementation of thee-constraint method in multi-objective
mathematical programming problems (2009) Applied Mathematical Computations, 213
(2), pp. 455-465;
Mitrofanov, S.P., The scientific principles of group technology (1966), National
Lending Library Translation Boston Spa, Yorks, UK; Murata, T., Ishibuchi, H., MOGA:
Multi-objective genetic algorithms (1995) Proceedings of the 1995 IEEE
international conference on evolutionary computation, 29 November–1 December, 1995,
, IEEE Perth, WA, Australia;
Othman, M., Bhuiyan, N., Gouw, G.J., Integrating workers’ differences into
workforce planning (2012) Computers & Industrial Engineering, 63, pp. 1096-1106;
Paydar, M.M., Mahdavi, I., Valipoor khonakdari, S., Solimanpur, M., Developing a
International Journal of Operational Research, 11, pp. 408-424;
Schaffer, J.D., Multiple objective optimization with vector evaluated genetic
algorithms (1985) Proceedings of the international conference on genetic algorithm
and their applications;
Seifoddini, H., Djassemi, M., Sensitivity analysis in cellular manufacturing system
in the case of product mix variation (1996) Computers & Industrial Engineering, 31
(1-2), pp. 163-167;
genetic algorithms (1994) Evolutionary Computation, 2 (3), pp. 221-248;
Süer, G.A., Bera, I.S., Optimal operator assignment and cell loading when lot-
splitting is allowed (1998) Computers & Industrial Engineering, 35 (3-4), pp. 431-
434;
Süer, G.A., Dagli, C., Intra-cell manpower transfers and cell loading in labor-
intensive manufacturing cells (2005) Computers & Industrial Engineering, 48, pp.
643-655;
Süer, G.A., Tummaluri, R., Multi-period operator assignment considering skills,
learning and forgetting in labour-intensive cells (2008) International Journal of
Wood, A.J., Wollenberg, B.F., Power generation, operation and control (1996), 2nd
ed. Wiley New York; Yin, Y., Yasuda, K., Similarity coefficient methods applied to
the cell formation problem: A taxonomy and review (2006) International Journal of
Zitzler, E., Deb, K., Thiele, L., Comparison of multiobjective evolutionary
algorithms: Empirical results (2000) Evolutionary Computation, 8 (2), pp. 173-195;
Zitzler, E., Laumanns, M., Thiele, L., SPEA2: Improving the strength Pareto
evolutionary algorithm (2001), Swiss Federal Institute Techonology Zurich,
Switzerland; Zitzler, E., Thiele, L., Multiobjective evolutionary algorithms: A
comparative case study and the strength Pareto approach (1999) IEEE Transactions on
Evolutionary Computation, 3 (4), pp. 257-271
Mazandaran University of Science and TechnologyIran; email:
[email protected]
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Chattopadhyay, M., Dan, P.K., Mazumdar, S.

56439159300;26325403400;56269106300;
Application of visual clustering properties of self organizing map in machine-part
cell formation
84655165003&doi=10.1016%2fj.asoc.2011.11.004&partnerID=40&md5=b3c0d318e6e1c6b85d8e3
7058169a5e7
DOI: 10.1016/j.asoc.2011.11.004
AFFILIATIONS: Department of Computer Application, Pailan College of Management and
Technology, Kolkata 700104, India;
Industrial Engineering, School of Engineering and Technology, West Bengal
University of Technology, Kolkata 700064, India;
Department of Business Management, University of Calcutta, Kolkata, India
ABSTRACT: Cellular manufacturing (CM) is an approach that includes both flexibility
of job shops and high production rate of flow lines. Although CM provides many
benefits in reducing throughput times, setup times, work-in-process inventories but
the design of CM is complex and NP complete problem. The cell formation problem
based on operation sequence (ordinal data) is rarely reported in the literature.
The objective of the present paper is to propose a visual clustering approach for
machine-part cell formation using self organizing map (SOM) algorithm an
unsupervised neural network to achieve better group technology efficiency measure
of cell formation as well as measure of SOM quality. The work also has established
the criteria of choosing an optimum SOM size based on results of quantization
error, topography error, and average distortion measure during SOM training which
have generated the best clustering and preservation of topology. To evaluate the
performance of the proposed algorithm, we tested the several benchmark problems
available in the literature. The results show that the proposed approach not only
generates the best and accurate solution as any of the results reported, so far, in
literature but also, in some instances the results produced are even better than
the previously reported results. The effectiveness of the proposed approach is also
statistically verified. © 2011 Elsevier B.V. All rights reserved.
AUTHOR KEYWORDS: Cellular manufacturing; Map size; Operation sequence; Self
organizing map; SOM quality measure; Visual clustering
INDEX KEYWORDS: Bench-mark problems; Cell formation; Cell formation problem;
Distortion measures; High production rate; Job shop; NP complete problems;
Operation sequences; Ordinal data; Quantization errors; Self organizing; Set-up
time; SOM quality measure; Technology efficiency; Unsupervised neural networks;
Visual clustering; Work-in-process inventory, Algorithms; Benchmarking; Cells;
Flexible manufacturing systems; Group technology; Machine shops; Self organizing
maps, Cellular manufacturing
REFERENCES: Mitrafanov, S.P., (1966) The Scientific Principles of Group Technology,
, National Lending Library Translation UK;
Burbidge, J.L., Production flow analysis (1963) The Production Engineer, 42 (12),
p. 742;
Burbidge, J.L., (1979) Group Technology in Engineering Industry, , Mechanical
Engineering Publications London;
Tompkins, J.A., White, J.A., Bozer, Y.A., Frazelle, E.H., Tanchoco, J.M.A.,
Trevino, J., (1996) Facilities Planning, , Wiley New York;
International Journal of Advanced Manufacturing Technology, 39 (910), pp. 943-953.,
10.1007/s00170-007-1274-7;
Suresh, N.C., Slomp, J., Kaparthi, S., Sequence-dependent clustering of parts and
machines: A fuzzy ART neural network approach (1999) International Journal of
Dixit, R.A., Mishra, P.K., Cell formation considering real-life production
parameters (2010) International Journal of Manufacturing Technology and Management,
20 (14), pp. 197-221;
Bu, W., Liu, Z., Tan, J., Industrial robot layout based on operation sequence
optimization (2009) International Journal of Production Research, 47 (15), pp.
4125-4145;
Pandian, S.R., Mahapatra, S.S., Manufacturing cell formation with production data
1347;
10.1080/00207540500478843, PII 791537541;
Kumar, L., Jain, P.K., Part-machine group formation with operation sequence, time
and production volume (2008) International Journal of Simulation Modelling, 7 (4),
pp. 198-209;
survey (1998) Production Planning and Control, 9 (8), pp. 771-783;
formations (1990) Journal of Manufacturing Systems, 9 (1), pp. 55-68;
Choobineh, F., Framework for the design of cellular manufacturing systems (1988)
S0736584507000737;
Part A: Systems and Humans, 29 (1), pp. 100-104;
Srinivasulu, S., Jain, A., A comparative analysis of training methods for
artificial neural network rainfall-runoff models (2006) Applied Soft Computing
Journal, 6 (3), pp. 295-306., DOI 10.1016/j.asoc.2005.02.002, PII
S1568494605000190;
Ravi, V., Kurniawan, H., Thai, P.N.K., Kumar, P.R., Soft computing system for bank
performance prediction (2008) Applied Soft Computing Journal, 8 (1), pp. 305-315.,
DOI 10.1016/j.asoc.2007.02.001, PII S156849460700018X;
Singh, S.P., Sharma, R.R.K., A review of different approaches to the facility
layout problems (2006) International Journal of Advanced Manufacturing Technology,
30 (5-6), pp. 425-433., DOI 10.1007/s00170-005-0087-9, Intelligent Disassembly in
the Demanufacturing Process;
manufacturing system (2011) Applied Soft Computing, 11 (6), pp. 4195-4202;
S0925527305000496;
Kohonen, T., (1991) Proceedings of IEEE, Vol. 78, pp. 1464-1480;
Kohonen, T., (1997) Self-organizing Maps, , Springer Berlin;
Kohonen, T., (1998) Proc. 8th Int. Conf. on Artificial Neural Networks (ICANN'98),
p. 65., L. Niklasson, M. Boden, T. Ziemke, Springer London;
Flexer, A., On the use of self-organizing maps for clustering and visualization
(2001) Intelligent Data Analysis, 5 (5), pp. 373-384;
Abonyi, J., Nemth, S., Vincze, C., Arva, P., Process analysis and product quality
estimation by self-organizing maps with an application to polyethylene production
(2003) Computers in Industry, 52 (3), pp. 221-234;
Heikkinen, M., Hiltunen, T., Liukkonen, M., Kettunen, A., Kuivalainen, R.,
Hiltunen, Y., A modelling and optimization system for fluidized bed power plants
Jamsa-Jounela, S.-L., Vermasvuori, M., Enden, P., Haavisto, S., A process
monitoring system based on the Kohonen self-organizing maps (2003) Control
Engineering Practice, 11 (1), pp. 83-92., DOI 10.1016/S0967-0661(02)00141-7, PII
S0967066102001417;
Kohonen, T., Oja, E., Simula, O., Visa, A., Kangas, J., Engineering applications of
the self-organizing map (1996) Proceedings of the IEEE, 84 (10), pp. 1358-1384;
Liukkonen, M., Havia, E., Leinonen, H., Hiltunen, Y., Application of self-
organizing maps in analysis of wave soldering process (2009) Expert Systems with
Applications, 36 (3), pp. 4604-4609;
Liukkonen, M., Havia, E., Leinonen, H., Hiltunen, Y., Quality-oriented optimization
of wave soldering process by using self-organizing maps (2011) Applied Soft
Computing, 11 (1), pp. 214-220;
Hébrail, G., Hugueney, B., Lechevallier, Y., Rossi, F., Exploratory analysis of
functional data via clustering and optimal segmentation (2010) Neurocomputing, 73
(79), pp. 1125-1141;
Khosravi, M.H., Safabakhsh, R., Human eye sclera detection and tracking using a
modified time-adaptive self-organizing map (2008) Pattern Recognition, 41 (8), pp.
2571-2593;
Mari, M., Nadal, M., Schuhmacher, M., Domingo, J.L., Application of self-organizing
maps for PCDD/F pattern recognition of environmental and biological samples to
evaluate the impact of a hazardous waste incinerator (2010) Environmental Science
and Technology, 44 (8), pp. 3162-3168., 10.1021/es1000165;
Moschou, V., Ververidis, D., Kotropoulos, C., Assessment of self-organizing map
variants for clustering with application to redistribution of emotional speech
patterns (2007) Neurocomputing, 71 (1-3), pp. 147-156., DOI
10.1016/j.neucom.2007.08.013, PII S0925231207002263, Dedicated Hardware
Architectures for Intelligent Systems;
Yu, J., A hybrid feature selection scheme and self-organizing map model for machine
health assessment (2011) Applied Soft Computing, 11 (5), pp. 4041-4054;
Pandit, Y.P., Badhe, Y.P., Sharma, B.K., Tambe, S.S., Kulkarni, B.D.,
Classification of Indian power coals using K-means clustering and Self Organizing
Map neural network (2011) Fuel, 90 (1), pp. 339-347;
Zhang, K., Chai, Y., Yang, S.X., Self-organizing feature map for cluster analysis
in multi-disease diagnosis (2010) Expert Systems with Applications, 37 (9), pp.
6359-6367;
Johnsson, M., Balkenius, C., Haptic perception with self-organizing ANNs and an
anthropomorphic robot hand (2010) Journal of Robotics, p. 9., 10.1155/2010/860790
Article ID 860790;
Johnsson, M., Balkenius, C., Sense of touch in robots with self-organizing maps
(2011) IEEE Transactions on Robotics, 27 (3), pp. 498-507.,
10.1109/TRO.2011.2130090;
Yamada, S., Recognizing environments from action sequences using self-organizing
maps (2004) Applied Soft Computing Journal, 4 (1), pp. 35-47., DOI
10.1016/j.asoc.2003.07.001, PII S1568494603000553;
Kohonen, T., (2001) Self-organizing Maps, , Springer Berlin, Germany;
Oja, M., Kaski, S., Kohonen, T., Bibliography of self-organizing map (SOM) papers:
1998-2001 addendum (2002) Neural Computing Surveys, 3, pp. 1-156;
Chang, P.C., Liao, T.W., Combining SOM and fuzzy rule base for flow time prediction
in semiconductor manufacturing factory (2006) Applied Soft Computing Journal, 6
(2), pp. 198-206., DOI 10.1016/j.asoc.2004.12.004, PII S1568494605000116;
Corona, F., Mulas, M., Baratti, R., Romagnoli, J.A., On the topological modeling
and analysis of industrial process data using the SOM (2010) Computers & Chemical
Engineering, 34 (12), pp. 2022-2032., (9);
Fuertes, J.J., Domínguez, M., Reguera, P., Prada, M.A., Díaz, I., Cuadrado, A.A.,
Visual dynamic model based on self-organizing maps for supervision and fault
detection in industrial processes (2010) Engineering Applications of Artificial
Intelligence, 23 (1), pp. 8-17;
Kasslin, M., Kangas, J., Simula, O., Process state monitoring using self-organizing
maps (1992) Artificial Neural Networks 2, 1., I. Aleksander, J. Taylor, North-
Holland Amsterdam, The Netherlands;
Alhoniemi, E., Hollmén, J., Simula, O., Vesanto, J., Process monitoring and
modeling using the self-organizing map (1999) Integrated Computer-aided
Fernandez, E.A., Balzarini, M., Improving cluster visualization in self-organizing
maps: Application in gene expression data analysis (2007) Computers in Biology and
Medicine, 37 (12), pp. 1677-1689., DOI 10.1016/j.compbiomed.2007.04.003, PII
S0010482507000844;
Chu, C.-H., Manufacturing cell formation by competitive learning (1993)
Kiang, M.Y., Kulkarni, U.R., Tam, K.Y., Self-organising map network as an
interactive clustering tool - An application to group technology (1995) Decision
Inho, J., Jongtae, R., Generalized machine cell formation considering material flow
and plant layout using modified self-organizing feature maps (1997) Computers &
Kuo, R.J., Chi, S.C., Teng, P.W., Generalized part family formation through fuzzy
self-organizing feature map neural network (2001) Computers and Industrial
Engineering, 40 (1-2), pp. 79-100., DOI 10.1016/S0360-8352(00)00073-5, PII
S0360835200000735;
Kiang, Y.M., Extending the Kohonen self-organizing map networks for clustering
analysis (2001) Computational Statistics & Data Analysis, 38, pp. 161-180;
Ampazis, N., Minis, I., Design of cellular manufacturing systems using Latent
Semantic Indexing and Self Organizing Maps (2004) Computational Management Science,
1 (34), pp. 275-292;
10.1080/00207540500507450, PII NUQ6025836653G03;
Chattopadhyay, M., Chattopadhyay, S., Dan, P., Machine-part cell formation through
visual decipherable clustering of self-organizing map (2011) The International
Journal of Advanced Manufacturing Technology, 52 (912), pp. 1019-1030;
Pandian, S.R., Mahapatra, S.S., Cell formation with ordinal-level data using ART1-
based neural networks (2008) International Journal of Services and Operations
Management, 4 (5), pp. 628-630;
Kaski, S., Data exploration using self-organizing maps (1997) Acta Polytechnica
Scandinavia, 82;
Vesanto, J., SOM-based data visualization methods (1999) Intelligent data analysis,
3 (2), pp. 111-126., DOI 10.1016/S1088-467X(99)00013-X;
Hautaniemi, S., Yli-Harja, O., Astola, J., Kauraniemi, P., Kallioniemi, A., Wolf,
M., Ruiz, J., Kallioniemi, O.-P., Analysis and visualization of gene expression
microarray data in human cancer using self-organizing maps (2003) Machine Learning,
52 (12), pp. 45-66., (22);
Ultsch, A., Siemon, H., Exploratory data analysis: Using Kohonen networks on
transputers (1989) Technical Report 329, University of Dortmund, , Germany;
Skupin, A., Agarwal, P., What is a self-organizing map? (2008) Self-organising
Maps: Applications in Geographic Information Science, pp. 1-20., P. Agarwal, A.
Skupin, John Wiley & Sons Chichester, England;
Tasdemir, K., Exploring topology preservation of SOMs with a graph based
visualization (2008) Lecture Notes in Computer Science, 5326, pp. 180-187;
Pölzlbauer, G., Survey and comparison of quality measures for selforganizing maps
(2004) Proceedings of the Fifth Workshop on Data Analysis (WDA'04), pp. 67-82., J.
Paralc, G. Pölzlbauer, A. Rauber, June 24-27 Elfa Academic Press Sliezsky dom,
Vysoke Tatry, Slovakia;
Alhoniemi, E., Himberg, J., Parhankangas, J., Vesanto, J., (2002) SOM Toolbox -
Online Documentation, , http://www.cis.hut.fi/projects/somtoolbox/;
Kivilnoto, K., Topology preservation in self-organizing maps (1996) Proceedings of
ICNN'96, IEE International Conference on Neural Networks. IEEF, pp. 294-299.,
Service Center Piscataway;
Lampinen, J., Oja, E., Clustering properties of hierarchical self-organizing maps
(1992) Journal of Mathematical Imaging and Vision, 2 (23), pp. 261-272;
Vesanto, J., Sulkava, M., Hollmen, J., On the decomposition of the self-organizing
map distortion measure (2003) Proceedings of the Workshop on Self-organizing Maps,
WSOM'03, pp. 11-16;
Vesanto, J., Alhoniemi, E., Clustering of the self-organizing map (2000) IEEE
Transactions on Neural Networks, 11 (3), pp. 586-600;
Wilppu, R., (1997) The Visualisation Capability of Self-organizing Maps to Detect
Deviation in Distribution Control, , TUCS Technical Report No. 153. Turku Centre
for Computer Science, Finland;
Kohonen, T., (1984) Self-organization and Associative Memory, , Springer
Heidelberg;
Haykin, S., (1999) Neural Networks, A Comprehensive Foundation, , 2nd edition
Prentice Hall;
Ghaseminezhad, M.H., Karami, A., A novel self-organizing map (SOM) neural network
for discrete groups of data clustering (2011) Applied Soft Computing, 11 (4), pp.
3771-3778;
Kulkarni, U.R., Kiang, Y.M., Dynamic grouping of parts in flexible manufacturing
Systems- A self-organizing neural networks approach (1995) European Journal of
707-720;
36 (1), pp. 157-179;
(13), pp. 2755-2768., DOI 10.1080/00207540010005060;
CORRESPONDENCE ADDRESS: Chattopadhyay, M.; Department of Computer Application,
Pailan College of Management and Technology, Kolkata 700104, India; email:
[email protected]
ISSN: 15684946
SOURCE: Scopus
Banerjee, I., Das, P.

57210688123;56418842400;
Group technology based adaptive cell formation using predator-prey genetic
algorithm
81155149866&doi=10.1016%2fj.asoc.2011.07.021&partnerID=40&md5=b10eeae28b47220acb7c1
9889c6ec032
DOI: 10.1016/j.asoc.2011.07.021
AFFILIATIONS: Videonetics Technology Pvt. Ltd., Kolkata 700 091, India;
SQC and or Division, Indian Statistical Institute, Kolkata 700 108, India
ABSTRACT: In recent years, there has been a considerable growth of application of
group technology in cellular manufacturing. This has led to investigation of the
primary cell formation problem (CFP), both in classical and soft-computing domain.
Compared to more well-known and analytical techniques like mathematical programming
which have been used rigorously to solve CFPs, heuristic approaches have yet gained
the same level of acceptance. In the last decade we have seen some fruitful
attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony
Optimization to find solutions of the CFP. The primary aim of this study is to
investigate the applicability of a fine grain variant of the predator-prey GA
(PPGA) in CFPs. The algorithm has been adapted to emphasize local selection
strategy and to maintain a reasonable balance between prey and predator population,
while avoiding premature convergence. The results show that the algorithm is
competitive in identifying machine-part clusters from the initial CFP matrix with
significantly less number of iterations. The algorithm scaled efficiently for large
size problems with competitive performance. Optimal cluster identification is then
followed by removal of the bottleneck elements to give a final solution with
minimum inter-cluster transition cost. The results give considerable impetus to
study similar NP-complete combinatorial problems using fine-grain GAs in future. ©
2011 Elsevier B.V. All rights reserved.
AUTHOR KEYWORDS: Bottleneck; Cell formation problem; Cellular manufacturing;
Diagonal cluster; Grouping efficacy; Intra-cluster density; Predator-prey
genetic algorithm; Transitional cost
INDEX KEYWORDS: Bottleneck; Cell formation problem; Diagonal cluster; Grouping
efficacy; Predator-Prey, Cells; Cellular manufacturing; Genetic algorithms; Group
technology; Heuristic methods; Mathematical programming; Population statistics,
Clustering algorithms
REFERENCES: Parsaei, H., Leep, R., Jeong, G., (2002) Principles of Group Technology
and Cellular Manufacturing Systems, , Chichester Wiley;
Kamrani, A.K., Logendran, R., (1998) Group Technology and Cellular Manufacturing
Methodologies and Applications, , Taylor & Francis Group;
Suresh, N.C., Kay, J.M., (1997) Group Technology and Cellular Manufacturing, State-
of-the-Art Synthesis of Research and Practice, , 1st ed. Springer;
Irani, S.A., (1999) Handbook of Cellular Manufacturing Systems, , 1st ed. Wiley-
Interscience;
Deb, K., Uday, B.R.N., Investigating Predator-Prey Algorithms for Multi-Objective
Optimization KanGAL Report No. 2005010;
Li, X., A real-coded predator-prey genetic algorithm for multi-objective
optimization (2003) Evolutionary Multi-criterion Optimization (EMO'03), 2632, pp.
207-221;
pp. 117-133;
1009;
Research, 18, pp. 213-219;
(3), pp. 387-397., DOI 10.1016/0377-2217(86)90032-9;
Shafer, S.M., Kern, G.M., A Mathematical programming approach for dealing with
Malakooti, B., Nima, R.M., Yang, Z., Integrated group technology, cell formation,
process planning, and production planning with application to the emergency room
Kusiak, A., Chung, Y.K., GT/ART: Using neural networks to form machine cells (1991)
Manufacturing Review, 4 (4), pp. 293-301;
Miljković, Z., Babić, B., Machine-part family formation by using ART-1 simulator
and FLEXY (2005) FME Transactions, 33 (3), pp. 157-162;
152;
Gindy, N.N.G., Ratchev, T.M., Case, K., Component grouping for GT applications - A
machine-component matrix formation in cellular manufacturing (1996) European
Journal of Operational Research, 93 (1), pp. 88-97., DOI 10.1016/0377-
2217(95)00036-4;
(8), pp. 2219-2245., DOI 10.1016/j.cor.2005.02.005, PII S0305054805000481;
2059-2079., DOI 10.1016/j.cor.2005.08.010, PII S0305054805002649;
3651-3669., DOI 10.1080/00207540110068781;
Conalves, J.F., Resende, M.G.C., An evolutionary algorithm for manufacturing cell
(3), pp. 1609-1617;
Chandrasekharan, M.P., Rajagopalan, R., GROUPABIL1TY: An analysis of the properties
Burbidge, J.L., An introduction of group technology (1969) Proceedings of the
Seminar on Group Technology, , Turin;
10 (2), pp. 93-108., PII S0951521097000013;
Irani, S.A., Ramakrishnan, R., Production flow analysis using STORM (1995)
Planning, Design, and Analysis of Cellular Manufacturing Systems. Manufacturing
Research and Technology, 24, pp. 299-346., A.K. Kamrani, H.R. Parsaei, D.H. Liles,
Elsevier Science Publishing Amsterdam, The Netherlands;
Rogers, D.F., Kulkarni, S.S., Optimal bivariate clustering and a genetic algorithm
with an application in cellular manufacturing, Discrete Optimization (2005)
CORRESPONDENCE ADDRESS: Banerjee, I.; Videonetics Technology Pvt. Ltd., Kolkata 700
091, India; email: [email protected]
ISSN: 15684946
SOURCE: Scopus
Manzini, R., Bindi, F., Pareschi, A.

6701312938;34871274100;6602835468;
The threshold value of group similarity in the formation of cellular manufacturing
systems
15 times.
77951095046&doi=10.1080%2f00207540802644860&partnerID=40&md5=4d64e830d7161f90641b4b
32496fbc6c
DOI: 10.1080/00207540802644860
AFFILIATIONS: Dipartimento di Ingegneria Delle Costruzioni Meccaniche, Nucleari,
Aeronautiche e di Metallurgia, Bologna University, Bologna, Italy
ABSTRACT: Cellular manufacturing is an effective alternative to batch-type
production systems where different products are intermittently produced in small
lot sizes with frequent setups, large in-process storage quantities, long
production lead times, decreasing throughputs, and complex planning and control
functions. An effective approach to forming manufacturing cells and introducing
families of similar parts, consequently increasing production volumes and machine
utilisation, is the use of similarity coefficients in conjunction with clustering
procedures. In a similarity coefficients-based approach, the results of the
clustering analysis depend on the minimum admissible level of similarity adopted
for the generic group of clustered items. This is the so-called threshold value of
group similarity. The aim of this paper is to identify effective values of the
threshold value of group similarity to help practitioners and managers of
manufacturing systems form machine groups and related part families. The proposed
threshold values for a given similarity coefficient are based on calculation of the
percentile of aggregations generated by the adopted clustering algorithm. The
importance of the proposed measure of group similarity has been demonstrated by
experimental analysis conducted on a large set of significant instances of the cell
formation problem in the literature. This analysis can also support the best
determination of this percentile-based cut value especially when the number of
manufacturing cells is not known in advance. © 2010 Taylor & Francis.
AUTHOR KEYWORDS: Cell formation (CF) problem; Cellular manufacturing (CM);
Clustering algorithm; Group technology (GT); Similarity coefficient; Similarity
coefficient based method (SCM)
systems; Clustering analysis; Clustering procedure; Experimental analysis; In-
process; Increasing production; Lead time; Lot size; Manufacturing cells;
Manufacturing system; Part family; Planning and control; Production system;
Similarity coefficient; Similarity coefficients, Clustering algorithms; Flexible
manufacturing systems; Group technology, Cellular manufacturing
REFERENCES: Armour, G.C., Buffa, E.S., A heuristic algorithm and simulation
approach to relative location of facilities (1963) Management Science, 9 (1), pp.
294-309;
Boctor, F.F., A linear formulation of the machine-part cell formation problems
pp. 2097-2116;
Chan, F.T.S., Cell formation problem with consideration of both intracellulart and
intercellular movements (2008) International Journal of Production Research, 46
(10), pp. 2589-2620;
Chandrasekharan, M.P., Rajagopalan, R., An ideal seed non-hieraechical clustering
Research, 24 (2), pp. 451-464;
Research, 24 (5), pp. 1221-1233;
Research, 27 (6), pp. 1035-1052;
Daita, S.T.S., Irani, S.A., Kotamraju, S., Algorithms for production flow analysis
Fraser, K., Harris, H., Luong, L., Improving the implementation effectiveness of
cellular manufacturing: A comprehensive framework for practitioners (2007)
Fraser, K., Harris, H., Luong, L., Team-based cellular manufacturing: A review and
survey to identify important social factors (2007) Journal of Manufacturing
Technology Management, 18 (6), pp. 714-730;
Islam, K.S., Sarker, B.R., A similarity coefficient measure and machine-parts
Flexible Automation and Integrated Manufacturing, 3 (3-4), pp. 161-200;
Research, 18 (2), pp. 213-232;
pp. 117-133;
387-397;
Kumar, R., Vannelli, A., Strategic subcontracting for efficient disaggregated
1715-1728;
Lee, M.K., Luong, H.S., Abhary, K., Genetic algorithm based cell design considering
alternative routing (1997) Computer Integrated Manufacturing Systems, 10 (2), pp.
93-107., May;
Manzini, R., Framework for designing a flexible cellular assembly system (2004)
Manzini, R., Persona, A., Regattieri, A., Framework for designing and controlling a
multicellular flexible manufacturing system (2006) International Journal of
Services and Operations Management, 2 (1), pp. 1-21;
implementations - A state-of-the-art survey (1985) OMEGA: The International Journal
of Management Science, 13 (6), pp. 381-391;
Research, 31 (5), pp. 1133-1142;
handling cost in machine-component grouping (1987) IIE Transactions, 19 (3), pp.
266-270;
formation application (1989) Computers and Industrial Engineering, 16 (3), pp. 419-
426;
case study at Harnischfeger (1999) International Journal of Production Research, 37
(14), pp. 3263-3273;
Sobhanallahi, M.A., Threshold value for the number of cells in group technology
Sokal, R.R., Sneath, P.H.A., (1968) Principle of Numerical Taxonomy, , San
Francisco, CA: W.H. Freeman;
Research, 28 (1), pp. 145-152;
Stawowy, A., Evolutionary strategy for manufacturing cell design (2004) OMEGA. The
48, pp. 471-489;
Yin, Y., Yasuda, K., Similarity coefficient methods applied to cell formation
CORRESPONDENCE ADDRESS: Manzini, R.; Dipartimento di Ingegneria Delle Costruzioni
Meccaniche, Nucleari, Aeronautiche e di Metallurgia, Bologna University, Bologna,
Italy; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Sadat Khorasgani, S.M., Ghaffari, M.

57196121305;57062150500;
Developing a cellular manufacturing model considering the alternative routes, tool
assignment, and machine reliability
3 times.
85031936306&doi=10.1007%2fs40092-017-0239-
1&partnerID=40&md5=dacd60745913da6c8a087456b3fd2602
DOI: 10.1007/s40092-017-0239-1
AFFILIATIONS: Department of Industrial Engineering, Naragh Branch, Islamic Azad
University, Naragh, Iran
ABSTRACT: The cell formation (CF) is one of the most important steps in the design
of a cellular manufacturing system (CMS), which it includes machines’ grouping in
cells and part grouping as separate families, so that the costs are minimized. The
various aspects of the problem should be considered in a CF. The machine
reliability and the tool assigned to them are the most important problems which
have to be modeled correctly. Another important aspect in CMS is material handling
costs that they consist of inter-cell and intra-cell movement costs. Moreover,
setup and tool replacement costs can be effective in CF decision making. It is
obvious that CF cannot be completed without considering the number of demand. With
considering of all of the above aspects, an extended linear integer programming is
represented for solving the cell formation problem (CFP) in this study. The
objective is to minimize the sum of inter-cell movement, intra-cell movement, tool
replacement, machine breakdown, and setup costs. In the other terms, for states
that cost of movement is higher than tool-changing cost, although a part can have
the inter- and/or intra-cell movements, the model tries to find a solution which
part is allocated to one cell and with changing the tools, processes of that part
is completed. In addition, to validate the model and show its efficiency and
performance, several examples are solved by branch and bound (B&B) method. © 2017,
The Author(s).
AUTHOR KEYWORDS: Alternative processing routes; Branch and bound; Cell formation
problem; Machine reliability; Material handling costs; Tool assignment
routings and machine reliability consideration (2008) Int J Adv Manuf Technol, 35
(7-8), pp. 761-768;
Technol, 39 (7-8), pp. 838-850;
multi-objective parametric programming (2009) Math Comput Model, 50 (3), pp. 407-
420;
Ballakur, A., (1985) An Investigation of Part Family/Machine Group Formation in
Designing a Cellular Manufacturing System, , Ph.D. Thesis, University of Wisconsin-
Madison;
problems with fixed cell cost (2004) Comput Oper Res, 31 (1), pp. 21-37;
(2005) Int J Prod Res, 43 (8), pp. 1587-1605;
(2011) Comput Ind Eng, 60 (1), pp. 7-15;
analysis of cellular manufacturing systems (2007) Int J Prod Econ, 105 (1), pp.
243-262;
routing capability in presence of unreliable machines (2001) Int J Prod Econ, 74
(1), pp. 175-182;
stochastic cellular manufacturing problem: a queuing-based analysis (2011) Expert
Syst Appl, 38 (3), pp. 1326-1335;
Heragu, S.S., Group technology and cellular manufacturing (1994) IEEE Trans Syst
Man Cybernetics, 24 (2), pp. 203-215;
John, E.G., Davies, A., Thomas, A.J., approach to group technology’after SK
Mukhopadhyay, K. Ramesh Babu and KV Vijai Sai (2009) Int J Prod Res, 47 (1), pp.
289-298;
and machine reliability (2014) Asia-Pac J Oper Res, 31 (4), p. 1450021;
Kusiak, A., The generalized group technology concept (1987) Int J Prod Res, 25 (4),
pp. 561-569;
cellular manufacturing (2007) Int J Prod Res, 45 (5), pp. 1049-1062;
systems in the presence of machine breakdown (1997) Int J Prod Econ, 53 (3), pp.
239-256;
presence of alternative routing (1999) Int J Prod Res, 37 (14), pp. 3289-3304;
and worker assignment (2010) Comput Math Appl, 60 (4), pp. 1014-1025;
system (2012) J Manuf Syst, 31 (2), pp. 214-223;
Malavé, C.O., Ramachandran, S., Neural network-based design of cellular
manufacturing systems (1991) J Intell Manuf, 2 (5), pp. 305-314;
Mitrovanov, S.P., (1966) Scientific principles of group technology, , National
Lending Library for Science and Technology, Boston Spa, Yorkshire, England (Transl.
from Nauchnye osnovy gruppovoi tekhnologii, Leningrad, 1959. Transl. by Harris E.
Text ed. by Grayson TJ, 1966);
Res, 171 (3), pp. 1051-1070;
using neural networks (2009) Comput Ind Eng, 56 (4), pp. 1340-1347;
Paydar, M.M., Sahebjamnia, N., Designing a mathematical model for cell formation
problem using operation sequence (2009) J Appl Oper Res, 1 (1), pp. 30-38;
statistical review of the literature (1965–1995) (1997) Oper Res, 45 (4), pp. 508-
520;
(1), pp. 3-20;
and control, , Springer Science & Business Media, Berlin;
alternative processing routes and operation sequence (2011) Int J Prod Res, 49
(19), pp. 5833-5849;
Valipour, M., Variations of land use and irrigation for next decades under
different scenarios (2016) Irriga, 1 (1), pp. 262-288;
Valipour, M., Banihabib, M.E., Behbahani, S.M.R., Comparison of the ARMA, ARIMA,
and the autoregressive artificial neural network models in forecasting the monthly
inflow of Dez dam reservoir (2013) J Hydrol, 476, pp. 433-441;
organizing map networks in a cellular manufacturing system (2006) Int J Prod Res,
44 (20), pp. 4257-4271;
modified ART1 neural networks (2006) Int J Adv Manuf Technol, 28 (7-8), pp. 761-
765;
Yadollahi, M.S., Mahdavi, I., Paydar, M.M., Jouzdani, J., Design a bi-objective
rate of machines (2014) Int J Prod Res, 52 (24), pp. 7401-7415;
problem: a taxonomy and review (2006) Int J Prod Econ, 101 (2), pp. 329-352;
flows (2005) Int J Adv Manuf Technol, 27 (1), pp. 159-165;
Zakarian, A., Kusiak, A., Modeling manufacturing dependability (1997) IEEE Trans
Robot Autom, 13 (2), pp. 161-168
CORRESPONDENCE ADDRESS: Ghaffari, M.; Department of Industrial Engineering, Naragh
Branch, Islamic Azad UniversityIran; email: [email protected]
ISSN: 17355702
SOURCE: Scopus
Sormaz, D., Arumugam, J., Suer, G.

6603795125;6507636176;6701905922;
Comparative study of constructive and improvement algorithms for cell formation
with alternative routings
(2015) IFAC-PapersOnLine, 28 (3), pp. 861-868.
84953870913&doi=10.1016%2fj.ifacol.2015.06.191&partnerID=40&md5=33ff61e1593f1aebcff
0873e1e60c34c
DOI: 10.1016/j.ifacol.2015.06.191
AFFILIATIONS: Ohio University, Department of Industrial and Systems Engineering,
Athens, OH, United States
ABSTRACT: This paper describes a comparison of genetic algorithm and state space
search algorithm for simultaneous formation of manufacturing cells and selection of
process plans for parts with alternative plans. Both algorithms perform two
simultaneous decisions: selection of process plan for parts between several
alternatives, and assignment of parts and required machines to manufacturing cells.
For genetic algorithm, a chromosome represents an assignment of machines to cells,
and fitness function defined as number of inter-cell transfer is used to select the
part route alternative with minimal inter-cell movements. The space search
algorithm is based on classification and ordering of machines and application of
space search to recursively assign the most critical machines and parts to cells.
Both algorithms have been studied with several decision making criteria:
intercellular traffic, size of the machine cells, ratio of state space expansion,
and so on. The results presented in the paper include inter-cell transfers and the
cell size. Both algorithms have been applied to the same set of cell formation
problems with alternate routings from literature and representative results are
shown. Performance of both algorithms is evaluated with respect to the quality of
the obtained solution (as compared with different algorithms on the same problem
from literature). The conclusions from this experiment are presented at the end of
the paper. © 2015, IFAC (International Federation of Automatic Control) Hosting by
AUTHOR KEYWORDS: Genetic algorithms; Group technology; Manufacturing system
engineering
INDEX KEYWORDS: Cells; Cellular manufacturing; Cytology; Decision making; Flexible
manufacturing systems; Genetic algorithms; Group technology; Learning algorithms;
Manufacture; Quality control, Alternate routings; Alternative routings; Cell
formation problem; Comparative studies; Decision making criteria; Intercellular
traffic; Simultaneous formation; State space search algorithm, Algorithms
Wang, C.R., Formation of Machine cells and part families, a modified p-median model
and a comparative study (1997) International Journal of Production Research, 35
(5), pp. 1259-1286;
Irani, S.A., (1999) Handbook of Cellular Manufacturing Systems, , John Wiley &
Sons, New York;
alternative process plans (1996) Computers & Ind Eng, 30 (3), pp. 423-431;
plans and Machine capacity constraints: A new combined approach (2000) Intl Journal
of Production Economics, 64, pp. 279-284;
Gonçalves, J.F., MGC resende an evolutionary algorithm for manufacturing cell
formation (2004) Computers & Industrial Engineering;
Mahdavi, I., Paydar, M.M., Solimanpur, M., Genetic algorithm approach for solving a
cell formation problem in cellular manufacturing (2009) Expert Systems with
Applications;
Lee, M.K., Luong, H.S., Abhay, K., A genetic algorithm based cell design
10 (2), pp. 93-107;
manufacturing cell formation problems (2008) Expert Systems with Applications;
Gen, M., Cheng, R., (2000) Genetic Algorithms and Engineering Optimization, , John
Wiley & Sons;
cell formation with alternative process plans International Journal of Production
Research, 46 (2), pp. 345-369;
Burbidge, J.L., (1989) Production Flow Analysis for Planning Group Technology, ,
Oxford University Press, Oxford, New York;
Adil, G.K., Rajamani, D., Strong, D., Cell formation considering alternative
1380;
pp. 69-85;
Han, J.-H., (1998) Formation of Part and Machine Cells with Consideration of
Alternative Process Plans, , MSc. Thesis, Ohio University;
Kasilingam, R.G., Lashkari, R.S., Cell formation in the presence of alternative
Control, 2 (2), pp. 135-141
EDITORS: Dolgui A., Sasiadek J., Zaremba M.
ISSN: 24058963
ABBREVIATED SOURCE TITLE: IFAC-PapersOnLine
SOURCE: Scopus
Saral, J., Arumugam, S., Venkat, I., Somasundaram, A.

57188880888;7006467632;36338095000;6506701545;
Cellular manufacturing problem - A graph theoretic approach
(2019) Journal of Advanced Mechanical Design, Systems and Manufacturing, 13 (3), .
85072560686&doi=10.1299%2fjamdsm.2019jamdsm0061&partnerID=40&md5=c02edc0a7f3ee0d8a8
acef5528eb4cee
DOI: 10.1299/jamdsm.2019jamdsm0061
AFFILIATIONS: National Centre for Advanced Research in Discrete Mathematics,
Kalasalingam Academy of Research and Education, Anand Nagar, Krishnankoil,
Tamilnadu 626126, India;
School of Computing and Information, Universiti Teknologi Brunei, Brunei
Darussalam;
Department of Mathematics BITS, Pilani-Dubai, Dubai International Academic City,
United Arab Emirates
ABSTRACT: The cell formation problem which arises in cellular manufacturing can be
formulated in graph theoretic terms. The input for a cellular manufacturing problem
consists of a set X of m machines and a set of Y of p parts and an m × p matrix A =
(aij), where aij = 1 or 0 according as the part pj is processed on the machine mi.
This data can be represented as a bipartite graph G with bipartition X, Y and mi is
joined to pj if aij = 1. Let G1, G2, . . ., Gk be nontrivial connected subgraphs of
G such that V(G1), V(G2), . . ., V(Gk) forms a partition of V(G). Then π = {G1, G2,
. . ., Gk} is called a k-cell partition of G. Any edge of G with one end in Gi and
the other end in Gj with i , j represents an inter cellular movement of a part. One
of the objectives in cellular manufacturing problem is to minimize the inter
cellular movements of parts. Let β(G, π) denote the number of edges in G with one
end in V(Gi) and other end in V(Gj). Let β(G, k) = minπβ(G, π), where the minimum
is taken over all kcell partitions π of G. In this paper we propose a graph
theoretic algorithm using Depth-First-Search to solve the cellular manufacturing
problem for the case when k = 2. Comparison of the results that we have obtained
with solutions obtained by other known algorithms shows that our algorithm gives a
better solution. © 2019 The Japan Society of Mechanical Engineers.
AUTHOR KEYWORDS: Bipartite graph; Cellular manufacturing problem; Depth-First-
Search; Exceptional elements
INDEX KEYWORDS: Graph theory, Bipartite graphs; Cell formation problem; Cellular
manufacturing problems; Connected subgraphs; Depth first search; Exceptional
elements; Graph theoretic algorithm; Graph theoretic approach, Cellular
manufacturing
REFERENCES: Angra, S., Sehgal, P., Samsudeen Noori, Z., Cellular manufacturing-A
time-based analysis to the layout problem (2008) International Journal of
Chandrasekaran, M.P., Rajagopalan, R., MODRoC: An extension of rank order
Research, 24 (5), pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., An Ideal seed Non-hierarchical Clustering
Research, 24 (2), pp. 451-464;
Chartrand, G., Lesniak, L., (2005) Graphs and Digraphs, , Fourth Edition, CRC
Press;
Chen, S.J., Cheng, C.S., A Neural Network-based Cell Formation Algorithm in
Cellular Manufacturing (1995) International Journal of Production Research, 33 (2),
pp. 293-318;
problem in cellular manufacturing (1992) Computers and Industrial Engineering, 22
(1), pp. 95-100;
Algorithms, , PHI;
Fábrega, J., Fiol, M.A., On the extraconnectivity of graphs (1996) Discrete Math,
155, pp. 49-57;
Industrial Engineering, 42 (2-4), pp. 377-382;
Hong, Y., Realizability of fault-tolerant graphs (2016) Bull. Malays. Math. Sci.
Soc., 39 (2), pp. 619-631;
Jayakrishna Nair, G., Narendran, T.T., Gropuing index: A new quantitative criterion
for goodness of block diagonal forms in group technology (1996) International
pp. 117-133;
pp. 2633-2646;
Miltenburg, J., Zhang, W., A comparative evaluation of nine well known algorithms
pp. 135-149;
Nagendra Prashar, B.S., Somasundar, H.V., A new measure for determining the
goodness of solutions in group technology cell formation (1998) Industrial
Engineering Journal (IIIE), 27 (8), pp. 12-20;
Naadimuthu, G., Gultom, P.G., Lee, E.S., Fuzzy clustering in cell formation with
3137-3147;
Nagendra Prashar, B.S., (2009) Cellular Manufacturing Systems: An Integrated
Approach;
Rajagopalan, R., Batra, J.L., Design of Cellular production systems-A Graph
567-579;
419-426;
Seifoddini, H.K., Duplication process in machine cells formation in group
technology (1989) IIE Transactions, 21 (4), pp. 382-388;
manufacturing using ant-colony-based optimization (2010) The International Journal
Sun, Y., Zhou, S., Tree connectivities of Cayley graphs on abelian groups with
small degrees (2016) Bull. Malays. Math. Sci. Soc., 39 (4), pp. 1673-1685;
Suresh Kumar, C., Chandrasekaran, M.P., Grouping efficacy: A quantitative criterion
for goodness of block diagonal form of binary matrices in group technology (1990)
Engineering, 22 (4), pp. 469-480;
Venugopal, V., Narendran, T.T., Design of cellular manufacturing systems based on
asymptotic forms of a Boolean matrix (1993) European Journal of Operational
Research, 67 (3), pp. 405-417;
the design of cellular manufacturing layouts (2007) Computers and Industrial
Engineering, 52 (4), pp. 380-403;
Waghodekar, P.H., Sahu, S., Machine-component cell in group technology: MaCE (1984)
2053-2062;
Yang, W., Qin, C., Chen, M., On cyclic edge-connectivity and super-cyclic edge-
connectivity of double-orbit graphs (2016) Bull. Malays. Math. Sci. Soc., 39 (1),
pp. 13-27;
in cellular manufacturing (2001) Computers and Industrial Engineering, 39 (1-2),
pp. 1-17
CORRESPONDENCE ADDRESS: Saral, J.; National Centre for Advanced Research in
Discrete Mathematics, Kalasalingam Academy of Research and Education, Anand Nagar,
India; email: [email protected]
PUBLISHER: Japan Society of Mechanical Engineers
ISSN: 18813054
ABBREVIATED SOURCE TITLE: J. Adv. Mech. Des. Syst. Manuf.
SOURCE: Scopus
Mak, K.L., Wang, X.X.

7102680226;9246057600;
Production scheduling and cell formation for virtual cellular manufacturing systems
0036354947&doi=10.1007%2fs001700200136&partnerID=40&md5=6e72da48cd8b62cd7c7362d4b49
3189b
DOI: 10.1007/s001700200136
AFFILIATIONS: Department of Industrial and Manufacturing Systems Engineering, The
University of Hong Kong, Pokfulam Road, Hong Kong
ABSTRACT: In this paper, an approach using the concept of genetic algorithms is
proposed as a powerful but simple means of scheduling the manufacturing operations
of a virtual cellular manufacturing system (VCMS). A mathematical model is
developed to describe the characteristics of a VCMs, which includes the constraints
related to the delivery due dates of the various products and the maximum
capacities of the manufacturing resources. The objectives are to set up virtual
manufacturing cells and to formulate feasible production schedules for all
manufacturing operations, in order to minimise the total material and component
travelling distance incurred in manufacturing the products. A new genetic based
scheduling algorithm is proposed as an optimisation tool to determine the solution.
The proposed algorithm differs from the conventional genetic algorithms in that the
populations of the candidate solutions consist of individuals from various age-
groups, and each individual is incorporated with an age attribute to enable its
birth and survival rates to be governed by predefined ageing patterns. By
generating the evolution of the populations with the genetic operators of
selection, crossover and mutation, the proposed approach provides excellent results
by maintaining a better balance between the exploitation and the exploration of the
solution space, and thus improves the computational speed and the solution quality.
The condition ensuring stable search performance is also derived. The superiority
of the proposed algorithm is illustrated by solving the production-scheduling and
cell-formation problems for a virtual cellular manufacturing system, and the
results are compared with those obtained by using a conventional optimisation
technique.
AUTHOR KEYWORDS: Cell formation problem; Genetic algorithms; Production
scheduling; Virtual cellular manufacturing system
INDEX KEYWORDS: Computer integrated manufacturing; Computer software; Genetic
algorithms; Materials handling; Mathematical models; Optimization; Production
control; Scheduling, Cell formation; Production scheduling; Virtual cellular
manufacturing systems, Cellular manufacturing
REFERENCES: Gerwin, D., Kolodny, H., (1992) Management of Advanced Manufacturing
Technology: Strategy, Organization and Innovation, , John Wiley, New York;
Greene, T.J., Sadowski, R.P., A review of cellular manufacturing assumptions,
advantages and design techniques (1984) Journal of Operations Management, 4 (2),
pp. 85-97;
Flynn, B.B., Jacobs, F.R., An experimental comparison of cellular (group
technology) layout with process layout (1987) Decision Science, 18 (4), pp. 562-
581;
Suresh, N.C., Partitioning work centres for group technology: Analytical extension
and shop simulation investigation (1992) Decision Science, 23 (2), pp. 267-290;
principles (1985) Journal of Operations Management, 5 (2), pp. 151-167;
McLean, C.L., Bloom, H.M., Hopp, T.H., The virtual manufacturing cell Proceedings
of Fourth IFAC/IFIP Conference on Information Control Problems in Manufacturing
Technology, Gaithersburg, MD, 1982;
Drolet, J.R., Scheduling virtual cellular manufacturing systems (1989), PhD
dissertation, Purdue University; Kannan, V.R., Ghosh, S., Cellular manufacturing
using virtual cells (1995) International Journal of Operations and Production
Management, 16 (5), pp. 99-112;
Holland, J.H., (1975) Adaptation in Natural and Artificial Systems, , The
University of Michigan Press, Ann Arbor;
Learning, , Addison-Wesley;
Michalewicz, Z., (1996) Genetic Algorithms + Data Structure = Evolution Programs, ,
Springer-Verlag, New York;
Kuo, B.C., (1991) Automatic Control Systems, 6th Edn., , Prentice-Hall;
Michalewicz, Z., Genetic algorithms numerical optimization, and constraints (1995)
Proceedings of the 6th International Conference on Genetic Algorithms, pp. 151-158
CORRESPONDENCE ADDRESS: Mak, K.L.; Department of Industrial Engineering, The
University of Hong Kong, Haking Wong Building, Pokfulam Road, Hong Kong, Hong Kong
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Nouri, H., Hong, T.S.

36768934300;54787835500;
A bacteria foraging algorithm based cell formation considering operation time
84865270649&doi=10.1016%2fj.jmsy.2012.03.001&partnerID=40&md5=520610b0edcb06f730b9d
bc765eebe57
DOI: 10.1016/j.jmsy.2012.03.001
AFFILIATIONS: Faculty of Engineering, Sanandaj Branch, Islamic Azad University,
Sanandaj, Iran;
Faculty Engineering, University Putra Malaysia, 43400 Serdang, Selangor Darul
Ehsan, Malaysia
ABSTRACT: The cellular manufacturing system (CMS) is considered as an efficient
production strategy for batch type production. The CMS relies on the principle of
grouping machines into machine cells and grouping machine parts into part families
based on pertinent similarity measures. The bacteria foraging algorithm (BFA) is a
new in development computation technique extracted from the social foraging
behavior of Escherichia coli (E. coli) bacteria. Ever since Kevin M. Passino
invented the BFA, one of the main challenges has been employment of the algorithm
to problem areas other than those for which the algorithm was proposed. This
research work inquires the first applications of this emerging novel optimization
algorithm to the cell formation (CF) problem. In addition, a newly developed BFA-
based optimization algorithm for CF is discussed. In this paper, an attempt is made
to solve the cell formation problem meanwhile taking into consideration number of
voids in cells and a number of exceptional elements based on operational time of
the parts required for processing in the machines. The BFA is suggested to create
machine cells and part families. The performance of the proposed algorithm is
compared with a number of algorithms that are most commonly used and reported in
the corresponding scientific literature such as similarity coefficients methods
(SCM), rank order clustering (ROC), ZODIAC, GRAFICS, MST, GATSP, GP, K-harmonic
clustering (KHM), K-means clustering, C-link clustering, modified ART1, GA (genetic
algorithm), evolutionary algorithm (EA), and simulated annealing (SA) using defined
performance measures known as modified grouping efficiency and grouping efficacy.
The results lie in favor of better performance of the proposed algorithm. © 2012
The Society of Manufacturing Engineers.
AUTHOR KEYWORDS: Bacteria foraging algorithm; Cell formation; Operation time
INDEX KEYWORDS: Batch type; Cell formation; Cell formation problem; Computation
techniques; Efficient production; Escherichia coli (E. coli); Exceptional elements;
Foraging behaviors; GA (genetic algorithm); Grouping efficacy; Grouping efficiency;
K-means clustering; Machine cell; Operation time; Optimization algorithms; Part
family; Performance measure; Problem areas; Rank order; Scientific literature;
Similarity coefficients; Similarity measure, Bacteria; Cellular manufacturing;
Escherichia coli; Genetic algorithms; Simulated annealing, Clustering algorithms
REFERENCES: Acharya, D.P., Panda, G., Mishra, S., Lakhshmi, Y.V.S., Bacteria
foraging based independent component analysis (2007) Proceedings of the
International Conference on Computational Intelligence and Multimedia Applications,
Vol. 2, pp. 527-531;
Carlos, A., Sebastian, L., A particle swarm optimization algorithm for part -
Machine grouping (2006) Journal of Robotics and Computer-Integrated Manufacturing,
22, pp. 468-474;
Askin Ronald, G., Subramanian, P., Cost-based heuristic for group technology
113;
Ateme-Nguema, B.H., Dao, T.-M., Optimization of cellular manufacturing systems
design using the hybrid approach based on the ant colony and tabu search techniques
Engineering Management, pp. 668-673., DOI 10.1109/IEEM.2007.4419274, 4419274, IEEM
2007: 2007 IEEE International Conference on Industrial Engineering and Engineering
Management;
pp. 2097-2116;
Burbidge, J.L., A manual method of production flow analysis (1977) Journal of
Burbidge, J.L., Production flow analysis (1971) Journal of Production Engineer, 50
(4-5), pp. 139-152;
Research, 24 (2), pp. 451-464;
Research, 24 (5), pp. 1221-1233;
Chandrashekharan, M.P., Rajagopalan, R., ZODIAC-analgorithm for concurrent
manufacturing cell design (2008) First International Workshop on Knowledge
Discovery and Data Mining. Adelaide, pp. 72-75., Australia (WKDD-2008);
117-133;
Kumar, S.C., Chandrasekharan, M.P., Grouping efficacy: A quantitative criterion for
Kusiak, A., Lee, H., Neural computing-based design of components for cellular
1777-1790;
Lim, C.M., Ponnambalam, S.G., A hybrid GA/PSO for the concurrent design of cellular
manufacturing system (2008) IEEE International Conference on Systems, Man and
Cybernetics, pp. 1855-1860., [Singapore];
Mahapatra, S.S., Pandian Sudhakara, R., Genetic cell formation using ratio level
data in cellular manufacturing system (2008) International Journal of Advanced
Majhi, B., Panda, G., Bacterial foraging based identification of nonlinear dynamics
system (2007) Proceedings of IEEE International Congress on Evolutionary
Computation (CEC-2007), pp. 1636-1641., [Singapore];
Majhi, B., Panda, G., Particle swarm optimization based efficient adaptive channel
equalizer for digital communication (2007) Proceedings of International Conference
on Trends in Intelligent Electronics Systems (TIES), , [Chennai];
Majhi, B., Panda, G., Choubey, A., On the development of a new adaptive channel
equalizer using bacterial foraging optimization technique (2006) Proceedings of
IEEE Annual India Conference (INDICON-2006), pp. 1-6., New Delhi, India;
Majhi, R., Panda, G., Sahoo, G., Dash, P.K., Das, D.P., Stock market prediction of
S&P 500 and DJIA using Bacterial Foraging Optimization technique (2008) 2007 IEEE
Congress on Evolutionary Computation, CEC 2007, pp. 2569-2575., DOI
10.1109/CEC.2007.4424794, 4424794, 2007 IEEE Congress on Evolutionary Computation,
CEC 2007;
Mc Cormick, W.T., Schweitzer, J.P.J., White, T.W., Problem decomposition and data
993-1009;
Mishra, S., Hybrid least-square adaptive bacterial foraging strategy for harmonic
estimation (2005) IEE Proceedings: Generation, Transmission and Distribution, 152
(3), pp. 379-389., DOI 10.1049/ip-gtd:20049016;
Mishra, S., Bhende, C.N., Bacterial foraging technique-based optimized active power
filter for load compensation (2007) IEEE Transactions on Power Delivery, 22 (1),
pp. 457-465., DOI 10.1109/TPWRD.2006.876651;
Andres, P., Trindade Athila, R., Victor, P., Ochi Luiz, S., A numerical comparison
between simulated annealing and evolutionary approaches to the cell formation
problem (2010) Journal of Expert Systems with Applications, 37, pp. 5476-5483;
Panda, G., Majhi, B., Mishra, S., Nonlinear system identification using bacterial
foraging based learning (2006) Proceedings of Third International Conference on
Artificial Intelligence in Engineering Technology (ICAIET-2006), pp. 120-125., Kota
kinabalu, Malaysia;
Passino, K.M., Biomimicry of bacterial foraging for distributed optimization and
control (2002) IEEE Control Systems Magazine, 22 (3), pp. 52-67., DOI
10.1109/MCS.2002.1004010;
10.1016/j.ejor.2006.12.058, PII S0377221707000811;
382-388;
Research, 29, pp. 463-478;
pp. 463-478;
Srinivasan, G., A clustering algorithm for machine cell formation using minimum
spanning tree (1994) International Journal of Production Research, 32, pp. 2149-
2158;
Stanfel Larry, E., Machine clustering for economic production (1985) Journal of
Engineering Costs and Production Economic, 9, pp. 73-81;
Tripathy, M., Mishra, S., Bacteria foraging-based solution to optimize both real
power loss and voltage stability limit (2007) IEEE Transactions on Power Systems,
22 (1), pp. 240-248., DOI 10.1109/TPWRS.2006.887968;
Tripathy, M., Mishra, S., Lai, L.L., Zhang, Q.P., Transmission loss reduction based
on FACTS and bacteria foraging algorithm (2006) Lecture Notes in Computer Science
(including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in
Bioinformatics), 4193 LNCS, pp. 222-231., Parallel Problem Solving from Nature,
PPSN IX - 9th International Conference, Procedings;
Ulagammai, M., Venkatesh, P., Kannan, P.S., Prasad Padhy, N., Application of
bacterial foraging technique trained artificial and wavelet neural networks in load
forecasting (2007) Neurocomputing, 70 (16-18), pp. 2659-2667., DOI
10.1016/j.neucom.2006.05.020, PII S0925231207000926;
Unler, A., Gungor, Z., Applying K-harmonic means clustering to the part-machine
classification problem (2009) Journal of Expert Systems with Applications, 36, pp.
1179-1194;
Operational Research, 63 (3), pp. 409-422., DOI 10.1016/0377-2217(92)90158-6;
manufacturing systems (1992) Computers in Industry, 20 (1), pp. 11-23., DOI
10.1016/0166-3615(92)90124-6;
(3), pp. 1609-1617., DOI 10.1016/j.eswa.2007.01.012, PII S0957417407000280;
Wu, T., Chung, S., Chang, C., Hybrid simulated annealing algorithm with mutation
operator to the cell formation problem with alternative process routings (2009)
Journal of Expert Systems with Applications, 36, pp. 3652-3661;
problem involving processing times and lot sizes (2003) Journal of Computers and
Industrial Engineering, 45, pp. 713-731
CORRESPONDENCE ADDRESS: Nouri, H.; Faculty of Engineering, Sanandaj Branch, Islamic
Azad University, Sanandaj, Iran; email: [email protected]
ISSN: 02786125
CODEN: JMSYE
SOURCE: Scopus
Takahashi, K., Manago, K., Hirotani, D., Morikawa, K.

35447754100;56646359200;8965061600;7202244201;
An adaptive cellular manufacturing system for producing two kinds of products in
unreliable cells
(2013) 22nd International Conference on Production Research, ICPR 2013, .
84929430093&partnerID=40&md5=5d2b44acb7c7501294f6eaa8601282e3
AFFILIATIONS: Dept. of System Cybernetics, Faculty of Engineering, Hiroshima

University, 1-4-1, Kagamiyama, Higashi-Hiroshima, 739-8527, Japan
ABSTRACT: In order to produce a variety of products effectively, cellular
manufacturing systems (CMSs) process a collection of similar products (products
families) on a dedicated cluster of machines or manufacturing processes (cells).
Performance of CMSs depends on the formation, and there is a lot of literature on
the cell formation problem. Most of traditional cell formation procedure ignores
any change in demand over time caused by product redesign and uncertainties due to
volume variation, part mix variation, and resource unreliability. In today's
business environment, product life cycles are short, and demand volumes and product
mix can vary frequently. Also, even in the automated systems, machines are
unreliable. As one of the methods for changes in demand, redesigning CMS and
dynamic CMSs are considered by various researchers. In the dynamic CMSs, the
formation of cells is redesigned period by period as demand changes. However, all
of them formulate the problem as multi-period problems, and the cell configuration
is redesigned period by period. There is no literature on real-time redesign of
cell with failures. Therefore, this paper deals with the CMSs that consist of
unreliable cells for producing two kinds of products with demand fluctuations. Each
cell can produce both of the products by switching the setup, but it is unreliable.
For the CMSs, an adaptive CMS that can change the product producing in a cell
responding to real-time changes in demand and cell failures is proposed. Markov
chain model of the system is proposed, and the performance of total cost that
consists of inventory holding, stock out, and cell switching costs is analyzed and
compared with that of previous CMS. Results show the effectiveness of the proposed
adaptive CMS.
AUTHOR KEYWORDS: Adaptive cell formation; Cellular manufacturing; Markov chain
model; Unreliable machine
INDEX KEYWORDS: Automation; Cells; Chains; Cytology; Life cycle; Manufacture;
Markov processes; Mobile security, Business environments; Cell formation; Cell
formation problem; Cell formation procedures; Demand fluctuations; Manufacturing
process; Markov chain models; Unreliable machine, Cellular manufacturing
REFERENCES: Singh, N., Rajamani, D., Cellular manufacturing systems: Design (1993)
Planning and Control, , Chapman & Hall;
pp. 285-314;
Mansouri, S.A., Moattar, S.M., Newman, S.T., A review of the modern approaches to
multicriteria cell design (2000) International Journal of Production Research, 38,
pp. 1201-1218;
Pillai, V.M., Subbarao, K., A robust cellular manufacturing design for dynamic part
population using a genetic algorithm (2008) International Journal of Production
Research, 46, pp. 5191-5210;
24, pp. 909-930;
Bhaskar, K., Srinivasan, G., Static and dynamic operator allocation problems in
35, pp. 3467-3481;
in cellular manufacturing systems (2008) International Journal of Production
Research, 46, pp. 6389-6413;
Safaeri, N., Saidi-Mehrabad, M., Jabal-Ameli, M.S., A hybrid simulated annealing
for solving an extended model of dynamic cellular manufacturing system (2008)
Bajastani, M.A., Rabbani, M., Rahimi-Vahed, A.R., Khoshkhou, G.B., A multi-
objective scatter search for a dynamic cell formation (2009) Computers and
and part demand: A cellular manufacturing systems design model (2009) International
Ahkioon, S.A., Bulgak, A.A., Bektas, T., Integrated cellular manufacturing systems
Ahkioon, S.A., Bulgak, A.A., Bektas, T., Cellular manufacturing systems design with
reconfiguration (2009) International Journal of Production Research, 47, pp. 1573-
1600;
Safaeri, N., Tavakkoli-Moghaddam, R., Integrated multi-period cell formation and
Mahdavi, I., Aalaei, A., Paydar, M.M., Solimanpur, M., Multi-objective cell
Takahashi, K., Yoshikawa, T., Hirotani, D., Morikawa, K., An adaptive cellular
manufacturing system for responding to changes in demand (2009) Proc. of 2009 Int.
Conf. Computers & Industrial Engineering, pp. 708-713., Troyes (France;
Gharbi, A., Hajji, A., Dhouib, K., Production rate control of an unreliable
manufacturing cell with adjustable capacity (2011) International Journal of
CORRESPONDENCE ADDRESS: Takahashi, K.; Dept. of System Cybernetics, Faculty of
Engineering, Hiroshima University, 1-4-1, Kagamiyama, Japan
PUBLISHER: International Foundation for Production Research (IFPR)

ABBREVIATED SOURCE TITLE: Int. Conf. Prod. Res., ICPR
SOURCE: Scopus
Ateme-Nguema, B.H., Dao, T.-M.

23974482600;23011197400;
Optimization of cellular manufacturing systems design using the hybrid approach
based on the ant colony and tabu search techniques
Engineering Management, art. no. 4419274, pp. 668-673. Cited 13 times.
40649114763&doi=10.1109%2fIEEM.2007.4419274&partnerID=40&md5=4805afdbdd31f03aeb6d4a
3e746121cb
DOI: 10.1109/IEEM.2007.4419274
AFFILIATIONS: Engineering and Management Department, University of Abiti-
témiscamingue, University of Quebec, Canada;
Mechanical and Manufacturing Engineering Department, Ecole de Technologie
Supérieure, University of Québec, Canada
ABSTRACT: Cellular Systems Design Problems (CSDP) constitute an important issue in
the design of Cellular Manufacturing Systems (CMS). A few years back, it emerged as
the best alternative in manufacturing systems, representing a compromise between
the efficiency of serial and the flexibility of batch production systems. In this
paper, we propose a hybrid approach for solving the CSDP for large industrial data
sets. This procedure comprises an Ant Colony Optimization (ACO) and the Tabu Search
(TS) procedure, which is added in order to improve the quality of the ACO solutions
obtained. The problem is formulated as a binary integer programming model that
might minimize the dissimilarities existing between machines or parts, and that is
characterized as an NP-complete model. With this proposed approach, the results
obtained show that it is efficient in terms of the quality and computational time
of the solutions. To demonstrate the potential ability of the proposed approach, a
numerical example has been investigated. © 2007 IEEE.
AUTHOR KEYWORDS: Ant systems; Cell formation problem; Flexible manufacturing;
Optimization; Simulation
INDEX KEYWORDS: Game theory; Problem solving; Production engineering; Quality
control; Tabu search, Ant systems; Cell formation problems; Flexible manufacturing,
Cellular automata
REFERENCES: Kumar, K.R., Vannelli, A., Strategic subcontracting for efficient
disaggregated manufacturing (1987) Int. J. of Production Research, 25, pp. 1715-
1728;
case study at Harnischfeger (1999) Int. J. of Production Research, 37, pp. 3263-
3273;
Zhao, C., Wu, Z., A genetic algorithm for cell formation with multiple routes and
multiple objectives (2000) Int. J. of Production Research, 40, pp. 385-395;
Chadrasekharan, M.P., Rajagopalan, R., ZODIAC - an algorithm for concurrent
formation of part-families and machine-cells (1987) Int. J. of Production Research,
26, pp. 835-850;
Askin, R.G., Standrige, C.R., (1993) Modelling and analysis of manufacturing
systems, , New-York, NY: John Wiley & Sons;
Wemerlov, V., Hyer, N.L., Cellular manufacturing in US industry: A survey of users
(1989) Int. J. of Production Research, 27 (9), pp. 1511-1530;
Int. J. of Production Research, 30, pp. 1209-1219;
McCauley, J., Machine grouping for effective production (1972) The Production Eng,
52, pp. 53-57;
Int. J. of Production Research, 11, pp. 399-416;
Rajagopalan, R., Batra, J.L., Design of cellular production system - a graph
theoretic approach (1975) Int. J. of Production Research, 13 (6), pp. 567-579;
Purcheck, G., A mathematical classification as a basis for design of group
technology production cells (1975) The Production Eng, 54 (1), pp. 35-48;
King, J.R., Machine component group formation in group technology (1980) Omega, 8
(2), pp. 193-199;
Chow, W.S., Hawaleshka, A novel machine grouping and knowledge-based approach for
cellular manufacturing (1993) European Journal of Operational Research, 69, pp.
357-375;
algorithm for part-machine grouping in GT (1993) European J. of Operational
Research, 69, pp. 342-356;
Venugopal, V., Soft-computing-based approaches to group technology problem: A
state-of-the-art review (1999) Int. J. of Production Research, 37, pp. 3335-3357;
Islier, A.A., Group technology by ant system algorithm (2005) Int. J. of Production
Research, 43 (5), pp. 913-932;
Islam, K.R., Sarker, B.R., A similarity coefficient measure and machine-part
grouping in cellular manufacturing systems (2000) Int. J. of Production Research,
38 (3), pp. 699-720;
Dorigo, M., Maniezzo, V., Colorni, A., Ant system: Optimization by a colony of
cooperating agents (1996) IEEE trans. on Syst., Manufacturing and Cybernetics -
part B, 26 (1), pp. 29-41;
Ateme, B.H., Dao, T.M., Quantized Hopfield neural networks for combinatorial
optimization problems: Cell formation case study (2007) J. of Manufacturing Science
and Eng, , under press
CORRESPONDENCE ADDRESS: Ateme-Nguema, B.H.; Engineering and Management Department,
University of Abiti-témiscamingue, University of QuebecCanada
ISBN: 1424415292; 9781424415298

SOURCE: Scopus
Kim, C.O., Baek, J.-G., Jun, J.

7409879549;7103228722;24343922400;
A machine cell formation algorithm for simultaneously minimising machine workload
imbalances and inter-cell part movements
23244467357&doi=10.1007%2fs00170-003-1619-
9&partnerID=40&md5=da8acadc7001d9a058bacfcd5e89a481
DOI: 10.1007/s00170-003-1619-9
AFFILIATIONS: Department of Information and Industrial Engineering, Yonsei
University, 120-749 Seoul, South Korea;
Department of Industrial Systems Engineering, Induk Institute of Technology, 139-
749 Seoul, South Korea;
Research Institute for Information and Communication Technologies, Korea
University, 136-701 Seoul, South Korea
ABSTRACT: This paper considers a multi-objective machine cell problem, in which
part types have several alternative part routings and the expected annual demand of
each part type is known. This problem is characterised as optimally determining
part type (routing) sets and corresponding machine cells such that total inter-cell
part movements and total machine workload imbalances are simultaneously minimised.
Due to the complexity of the problem, a two-stage heuristic algorithm is proposed,
and computational experiments were conducted to verify the performance of the
algorithm. © Springer-Verlag London Limited 2005.
AUTHOR KEYWORDS: Alternative part routings; Inter-cell part movements; Machine
cell formation problem; Machine workload imbalances; Multi-objective function;
Two-stage heuristic algorithm
INDEX KEYWORDS: Algorithms; Cellular manufacturing; Computational methods; Customer
satisfaction; Heuristic methods; Productivity, Alternative part routings; Inter-
cell part movements; Machine cell formation problems; Machine workload imbalances;
Multi-objective functions; Two-stage heuristic algorithms, Machine components
REFERENCES: Burbidge, J.L., (1997) Production Flow Analysis for Planning Group
Technology, , Clarendon Press, Oxford;
Review, evaluation and directions for future research (1998) Comp Industr Engin, 34
(1), pp. 3-20;
multiple routes and multiple objectives (2000) Int J Rod Res, 38 (2), pp. 385-395;
Suresh, N.C., Slomp, J., A multi-objective procedure for labour assignment and
grouping in capacitated cell formation problems (2001) Int J Prod Res, 39 (18), pp.
4103-4131;
Kusiak, A., (1990) Intelligent Manufacturing Systems, , Prentice-Hall, Englewood
Cliffs, NJ;
alternative part process plans (1996) Comp Industr Engin, 30 (3), pp. 423-431;
Caux, C., Bruniaux, R., Pierreval, H., Cell formation with alternative process plan
and machine capacity constraints: A new combined approach (2000) Int J Prod Econ,
64, pp. 279-284;
production factors (2002) Int J Prod Res, 40 (4), pp. 885-906;
technology problem with multiple process routings (1997) Comp Industr Engin, 32
(1), pp. 207-220;
(2000) Int J Prod Res, 38 (1), pp. 229-240;
Eiselt, H.A., Sandblom, C.L., Spielberg, K., Richards, R., (2000) Integer
Programming and Network Models, , Springer, Berlin Heidelberg New York
CORRESPONDENCE ADDRESS: Kim, C.O.; Department of Information and Industrial
Engineering, Yonsei University, 120-749 Seoul, South Korea; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Cheng, C.-H., Madans, M.S., Motwan, J.

8417752800;57194849227;57028637700;
Designing cellular manufacturing systems by a truncated tree search
times.
0030086356&doi=10.1080%2f00207549608904907&partnerID=40&md5=c6068f5ff3988d902201a9b
8fced4afd
DOI: 10.1080/00207549608904907
AFFILIATIONS: Depanment of Systems Engineering and Engineering Management, The
Chinese University of Hong Kong, Shatin, NT, Hong Kong;
Management Department, University of Wisconsin-Whitewater, Whitewater, WI, 53190,
United States;
Department of Management, Seidman School of Business, Grand Valley State
University, 301 W. Fulton, Grand Rapids, MI, 49504, United States
ABSTRACT: The cell formation problem in designing cellular manufacturing systems is
formulated as a 0-1 quadratic programming model. The objective of the model is to
minimize intercellular moves using distance as a measure. A truncated tree search
algorithm to solve the cell formation problem is presented. The performance of the
algorithm is tested on several problems obtained from the literature. Comparison of
the results of the algorithm with some existing approaches is presented. In
addition, this paper extends the truncated tree search approach to deal with
multiple machines in the cell formation problem. © 1996 Taylor & Francis Group,
LLC.
INDEX KEYWORDS: Algorithms; Manufacture; Mathematical models; Mathematical
programming; Performance; Problem solving; Trees (mathematics), Cell formation;
Cellular manufacturing systems; Quadratic programming; Truncated tree search,
Systems analysis
REFERENCES: Boe, J.W., Cheng, C.H., A close neighbour algorithm for designing
29 (10), pp. 2097-2116;
algorithm for group technology (1986) International Journal of Production Research,
24 (6), pp. 835-850;
Omega, 20 (4), pp. 493-501;
pp. 117-133;
Kusiak, A., (1990) Intelligent Manufacturing Systems, , New Jersey: Prentice Hall);
Branch-and-bound and A approaches (1993) HE Transactions, 25 (4), pp. 46-56;
Journal of Manufacturing System, 6 (2), pp. 117-124;
formation applications (1989) Computer and Industrial Engineering, 16 (3), pp. 419-
426
CORRESPONDENCE ADDRESS: Cheng, C.-H.; Depanment of Systems Engineering and
Engineering Management, The Chinese University of Hong Kong, Shatin, NT, Hong Kong
ISSN: 00207543
SOURCE: Scopus
Rajagopal, V., Chandrasekar, K., Victor Raj, M.

57213086451;57212793254;36717026600;
Cell formation using tabu search for design of cellular manufacturing system
(2015) International Journal of Computer Aided Engineering and Technology, 7 (1),
pp. 81-91. Cited 1 time.
84919667232&doi=10.1504%2fIJCAET.2015.066170&partnerID=40&md5=5f3f9fe61b315b5cf8dc9
57a7fb9dfa3
DOI: 10.1504/IJCAET.2015.066170
AFFILIATIONS: Sardar Raja College of Engineering, Alangulam, Tirunelveli,
Tamilnadu, 627808, India
ABSTRACT: A large number of non-traditional search algorithms are available for
function optimisation. The 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 minimising the number of exceptional elements. An efficient tabu search
(TS) algorithm is proposed to solve cell formation problem because it perform
considerable search before terminating to provide a good solution to the problem.
In this work the implementation of tabu search for the design of cell formation
problem and minimise the number of exceptional elements has been done by this
method and it is compared with other existing methods. Copyright © 2015
Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation; Group technology; Tabu search
formation of manufacturing cells (2005) Computers & Industrial Engineering, 48 (1),
pp. 3-21;
Research, 25 (5), pp. 639-655;
Boctor, F., A linear formulation of the machine part cell formation problem (1991)
Burbidge, J.L., Production flow analysis (1971) Production Engineering, 50 (4-5),
pp. 139-152;
Research, 24 (2), pp. 451-464;
Co, H.C., Araar, A., Configuring cellular manufacturing system (1988) International
formation for group technology applications (1990) Int J Prod Res, 28 (1), pp. 185-
198;
Rajagopalan, R., Batra, J., Design of cellular production systems-A graph
theoretical approach (1975) Int J Prod Res, 13 (6), pp. 256-268;
systems in the presence of alternate process plans (1990) International Journal of
in cellular manufacturing (2001) Computers & Industrial Engineering, 39 (1-2), pp.
1-17
CORRESPONDENCE ADDRESS: Victor Raj, M.; Sardar Raja College of EngineeringIndia
ISSN: 17572657
ABBREVIATED SOURCE TITLE: Int. J. Comput. Aided Eng. Technol.
SOURCE: Scopus
Yin, Y., Yasuda, K.

35739337500;13405856800;
Reconsidering generalized similarity coefficient via a sequence ratio
3943053430&partnerID=40&md5=a815e171a76f133fcc76b52c4bb2e45a
AFFILIATIONS: Dept. of Pub. Plcy./Social Studies, Yamagata University, 1-4-12,

Kojirakawa-cho, Yamagata-shi 990-8560, Japan;
Grad. Sch. of Economics/Management, Tohoku University, Kawauchi, Aoba-Ku, Sendai
980-8576, Japan
ABSTRACT: Generalized Similarity Coefficient (GSC) is an extension of Jaccard
similarity coefficient to deal with cell formation problems that incorporate
alternative process routings. A drawback of GSC is that it ignores the impact of
material flows. Due to this drawback, flexibilities brought by alternative process
routings have been wiped out. The contribution of this paper is to overcome this
drawback by introducing a sequence ratio. We extend GSC to take into account
operation sequences of parts. We also propose a heuristic algorithm that improves
solutions obtained by Average Linkage Clustering (ALC) algorithm. Comparative
experimentations are executed to test the new similarity coefficient and the
extended-ALC algorithm, and the results of comparison show that the new approach
not only performs superior than previous GSC and ALC, but also reflects the real-
life production situations accurately. Significance: The new similarity coefficient
can model three different scenarios: a traditional cell formation problem; a cell
formation problem which incorporates alternative process routings, and a cell
formation problem which incorporates both alternative process routings and
operation sequences that exist in the real-life production. © International Journal
of Industrial Engineering.
AUTHOR KEYWORDS: ALC algorithm; Alternative process routings; Cell formation;
Operation sequence; Similarity coefficient
INDEX KEYWORDS: Algorithms; Calculations; Flexible manufacturing systems; Heuristic
methods; Mathematical models; Matrix algebra; Optimization; Process engineering;
Production engineering, Alternative process routings; Average linkage clustering
algorithm; Cell formation; Operation sequence; Similarity coefficient, Cellular
manufacturing
REFERENCES: Chen, C.L., Cotruvo, N.A., Baek, W., A simulated annealing solution to
the cell formation problem (1995) International Journal of Production Research, 33,
pp. 2601-2614;
1259-1273;
alternative part process plans (1996) Computers Industrial Engineering, 30, pp.
423-431;
Lozano, S., Guerrero, F., Eguia, I., Onieva, L., Cell design loading in the
Research, 37, pp. 3289-3304;
Nagi, R., Harhalakis, G., Proth, J.M., Multiple routeings capacity c]onsiderations
Research, 28, pp. 2243-2257;
survey (1998) Production Planning Control, 9, pp. 771-783;
426;
Shafer, S.M., Rogers, D.F., Similarity distance measures for cellular
manufacturing: Part 1. A survey (1993) International Journal of Production
Research, 31, pp. 1133-1142;
manufacturing: Part 2 An extension and comparison (1993) International Journal of
Sofianopoulou, S., Part and machine partitioning problem in cellular manufacturing:
Multiple machine environment (1996) Yugoslav Journal of Operations Research, 6, pp.
183-191;
707-720;
Research, 105, pp. 537-551;
Sun, D., Kim, L., Batta, R., Cell formation using tabu search (1995) Computers and
Tarsuslugil, M., Bloor, J., The use of similarity coefficients cluster analysis in
production flow analysis (1979) Proceedings 20th International Machine Tool Design
Research Conference, pp. 525-532., Birmingham UK September;
materials flow approach based on operation equencess (1990) IEE Transactions, 22,
pp. 84-97;
clustering techniques dissimilarity measures applied to the cell formation problem
technology problem with multiple process routings (1997) Computers Industrial
17;
mltiple routes and multiple objectives (2000) International Journal of Production
CORRESPONDENCE ADDRESS: Yin, Y.; Dept. of Pub. Plcy./Social Studies, Yamagata
University, 1-4-12, Kojirakawa-cho, Yamagata-shi 990-8560, Japan; email:
[email protected]
ISSN: 10724761
CODEN: IJIEF
SOURCE: Scopus
Seo, K.-K., Park, J.-H.

55496602300;9743618400;
Adaptive clustering algorithm for recycling cell formation: An application of fuzzy
ART neural networks
(2004) KSME International Journal, 18 (12), pp. 2137-2147.
15844365835&doi=10.1007%2fBF02990218&partnerID=40&md5=0a0cb95581ece84b820cadfcc35ca
cd1
DOI: 10.1007/BF02990218
AFFILIATIONS: Department of Industrial Information, Sangmyng University, San 98-20,
Anso-Dong, Chonan, Chungnam 330-720, South Korea;
CAD/CAM Research Center, Korea Inst. of Sci. and Technology, P.O.Box 131,
Cheongryang, Seoul, South Korea
ABSTRACT: The recycling cell formation problem means that disposal products are
classified into recycling part families using group technology in their end-of-life
phase. Disposal products have the uncertainties of product status by usage
influences during product use phase, and recycling cells are formed design, process
and usage attributes. In order to deal with the uncertainties, fuzzy set theory and
fuzzy logic-based neural network model are applied to recycling cell formation
problem for disposal products. Fuzzy C-mean algorithm and a heuristic approach
based on fuzzy ART neural network is suggested. Especially, the modified Fuzzy ART
neural network is shown that it has a good clustering results and gives an
extension for systematically generating alternative solutions in the recycling cell
formation problem. Disposal refrigerators are shown as examples.
AUTHOR KEYWORDS: Fuzzy ART neural network; Fuzzy C-Mean Algorithm; Fuzzy Theory;
Recycling Cell Formation
INDEX KEYWORDS: Cells; Expert systems; Fuzzy sets; Mathematical models; Neural
networks; Recycling, Fuzzy ART neural network; Fuzzy C-Mean Algorithms; Fuzzy
theory; Recycling cell formation, Algorithms
REFERENCES: Alting, L., Legarth, J.B., Life cycle and design (1995) Annals of CIRP,
44, pp. 1-11;
Ha, M.Y., Jeon, C.H., Choi, D.S., Choi, H.-J., A numerical study on the
triboelectrostatic separation of PVC materials from mixed plastics for waste
plastic recycling (2003) KSME International Journal, 17 (10), pp. 1485-1495;
Huang, J., Georgiopoulos, M., Heileman, G.L., Fuzzy ART properties (1985) Neural
Knight, W.A., Sodhi, M., Design for bulk recycling: Analysis of materials
separation (2000) Annals of the CIRP, 49, pp. 83-86;
Park, J.H., Seo, K.K., Approximate life cycle assessment of product concepts using
multiple regression analysis and artificial neural networks (2003) KSME
International Journal, 17 (12), pp. 1969-1976;
Park, J.-H., Seo, K.-K., Jang, D.-S., Recycling cell formation using group
technology for disposal products (1999) 1st International Symposium on
Environmentally Conscious Design and Inverse Manufacturing, pp. 830-835;
Roche, T., Man, E., Browne, J., Development of a CAD integrated DFE workbench tool
(2001) Proceedings of the 2001 IEEE International Symposium on Electronics & the
Environment, pp. 16-24;
Rose, C.M., Stevels, A., Ishii, K., A new approach to End-of-Life Design Advisor
(ELDA) (2000) Proceedings of the 2000 IEEE International Symposium on Electronics &
the Environment, pp. 99-104;
Simon, M., Design for dismantling (1991) Professional Engineering, (NOVEMBER), pp.
20-22;
Simon, M., Fogg, B., Chambellant, M., Design for cost-effect disassembly (1992)
Technical Paper, Manchester Polytechnic University, , UK;
Williams, J., Shi, L.H., Analysis of remanufacturer waste streams for electronic
products (2001) Proceedings of the 2001 IEEE International Symposium on Electronics
& the Environment, pp. 279-284;
Zusman, E., Kriwet, A., Seliger, G., Disassembly-oriented assessment methodology to

support design for recycling (1994) Annals of the CIRP, 43, pp. 9-14
CORRESPONDENCE ADDRESS: Seo, K.-K.; Department of Industrial Information, Sangmyng
University, San 98-20, Anso-Dong, Chonan, Chungnam 330-720, South Korea; email:
[email protected]
PUBLISHER: Korean Society of Mechanical Engineers
ISSN: 12264865
ABBREVIATED SOURCE TITLE: KSME Int. J.
SOURCE: Scopus
Venugopal, V., Narendran, T.T.

7102019737;7003728237;
Machine-cell formation through neural network models
56 times.
0000321963&doi=10.1080%2f00207549408957061&partnerID=40&md5=181831382ff3f50da9cc1c2
c181a842a
DOI: 10.1080/00207549408957061
AFFILIATIONS: Operations Management and Systems Area, XLRI, Jamshedpur, India;
Industrial Engineering and Management Division, Indian Institute of Technology,
Madras, India
ABSTRACT: Identification of machine-cells is one of the most important problems in
the design of cellular manufacturing systems (CMSs). It involves decomposing a
manufacturing system into machine-cells by grouping machines and parts. Several
algorithms with varying degrees of success have been proposed and utilised to solve
this problem. Among the modern tools, neural network models have the potential to
solve the machine-cell formation problem. Choosing the competitive learning model,
adaptive resonance theory (ART) model and self-organizing feature map (SOFM) model
from neural network theory for this purpose, we demonstrate their suitability for
solving the machine-cell formation problem. Applications on trial problems show the
viability for solving the machine-cell formations problem and stand testimony to
the practical utility of neural network models in designing CMSs. © 1994 Taylor &
Francis Group, LLC.
42, p. 472;
recognition: Attentions, memory consolidation and amnesia (1986) Brain Structure,
Learning and Memory, , edited by J. Daviset ai, AAAS Symposium Series;
Carrie, A.S., Numerical taxonomy applied to group technology and planl layout
Chan, H.M., Milner, D.A., Direct clustering algorithms for group formation in
Ciiandrasekharan, M.P., Rajagopalan, R., An ideal seed non-hierarchical clustering
Research, 24 (2), pp. 451-464;
Chu, C.H., Cluster analysis in manufacturing cellular formation (1989) Omega, 17
(3), pp. 289-296;
Grossburg, S., Adaptive pattern classification and universal recording I: Parallel
development and coding of neural feature detectors (1976) Biological Cybernetics,
23, pp. 187-202;
Kandiixer, L., Onur, L., (1989) An Analysis of Part Family Machine Group Formation
Techniques: Evaluation and Extensions, , Research Report IEOR-8907, Faculty of
Engineering and Science, Bilkent University, Turkey;
Kapartih, S., Suresii, N.C., A neural network system for shape based classification
and coding of parts (1991) International Journal of Production Research, 29 (9),
pp. 1771-1784;
King, J.R., Machine-component grouping in production flow analysis; an approach
Research, 18 (2), pp. 213-232;
pp. 117-133;
Koiienen, T., (1984) Self-Organization and Associative Memory, , Berlin: Springer-
Verlag);
Lippman, R.P., (1987) An Introduction to Computing with Neural Nets. Ieee ASSP
Magazine (April), 4, pp. 4-22;
992-1009;
McAuiiy, J., Machine grouping for efficient production (1972) Production Engineer,
51 (2), pp. 53-57;
5 (4), pp. 277-291;
implementation (1985) Omega, 13, pp. 577-579;
Panngrselvam, R., Balalasubramanian, K.N., Algorithm grouping of operation
sequences (1985) Engineering Costs and Production Economics, 9, pp. 125-135;
Rumelhart, D.E., McCleland, J.L., (1987) Parallel Distributed Processing, 2.,
Cambridge: MIT Press;
Srinivasan, G., Narendran, T.T., GRAFICS: A non-hierarchical clustering method for
group technology problem (1991) International Journal of Production Research, 29,
pp. 463-478;
Venugopal, V., Narendran, T.T., Neural network models for design retrieval in
manufacturing systems (1992) Computers in Industry, 20, pp. 11-23;
Wasserman, P.D., (1989) Neural Computing: Theory and Practice, , New York:
Reinhold)
CORRESPONDENCE ADDRESS: Venugopal, V.; Operations Management and Systems Area,
XLRI, Jamshedpur, India
ISSN: 00207543
SOURCE: Scopus
Modrak, V., Semanco, P.

55909906100;36722420100;
Optimisation of manufacturing cell formation algorithm through parameters of
genetic operators
84963636390&partnerID=40&md5=7a25bfeaedf9d0785e87ad7a7912cbc5
AFFILIATIONS: Faculty of Manufacturing Technologies, Technical University of

Kosice, Presov, Slovakia
ABSTRACT: Genetic algorithms are frequently used for a number of optimisation
problems in operations research including manufacturing cell formation problem. In
this paper are explored possibilities of Taguchi experimental design for a
calibration of genetic algorithm parameters for manufacturing cell formation
problems considering production data. For this purpose two groups of experiments
will be constructed and compared. This work provides further evidence that the
efficiency of genetic algorithm is dependent on initial parameters.
AUTHOR KEYWORDS: Exceptional elements; Experimental testing; Genetic algorithm;
Genetic operators
INDEX KEYWORDS: Algorithms; Flexible manufacturing systems; Genetic algorithms;
Industrial research; Manufacture; Operations research; Optimization; Parameter
estimation, Algorithm parameters; Exceptional elements; Experimental testing;
Genetic operators; Initial parameter; Manufacturing cell formation; Optimisation
problems; Taguchi experimental design, Cellular manufacturing
REFERENCES: Hertz, A., Jaumard, B., Ribeiro, C., Formosinho, F.W., A multicriteria
tabu search approach to cell formation problems in group technology with multiple
objectives (1994) Recherche Operationelle/Oper. Res, 28, pp. 303-328;
Slier, G.A., Vazquez, R., Cortes, M., A hybrid approach of genetic algorithms and
local optimizers in cell loading (2005) Computers and Industrial Engineering, 48
(3), pp. 625-641;
Semanco, P., Modrak, V., Hybrid GA-based improvement heuristic with makespan
criterion for flow-shop scheduling problems (2011) Communications in Computer and
Information Science, 220 (2), pp. 11-18;
Holland, J.H., (1975) Adaptation in Natural and Artificial Systems, , Ann Arbor.
Michigan: The University of Michigan Press;
Tsaui, J.T., Liu, T.K., Chou, J.H., (2004) Hybrid Taguchi-genetic Algorithm for
Global Numerical Optimization;
machinecomponent grouping problem with multiple objectives (1992) Comput. Ind.
Eng., 22, pp. 469-480;
constrained optimization problems with genetic algorithms (1994) Proceeding of the
1994 IEEE International Symposium EC, pp. 579-584., Orlando: FL;
Gupta, Y.P., Gupta, M.C., Kumar, A., Sundaram, C.A., A genetic algorithm-based
approach to cell composition and layout design problems (1996) Int. J. Prod. Res,
34, pp. 447-482;
Alsultan, K.S., Fedjki, C.A., A genetic algorithm for the part family formation
problem (1997) Production Planning Fit Conotrol, 8, pp. 788-796;
Op. Res, 109, pp. 286-298;
manufacturing cells (1999) International Journal of Production Economics, 60 (61),
pp. 421-426;
cellular manufacturing systems in a lumpy demand environment (2001) Eur. J. Op.
Res., 134, pp. 346-364;
problem involving processing times and lot sizes (2003) Comput. Ind. Eng., 45, pp.
713-731;
Falkenauer, E., (1998) Genetic Algorithms and Grouping Problems, , New York: Wiley;
Meents, I., A genetic algorithm for the group-technology problem, applications of

evolutionary computing (2001) Proceedings of the EvoWorkshops 2001: EvoCOP, pp. 90-
99., EvoFlight, EvolASP, EvoLearn, and EvoSTIM, Como: Italy;
829-853;
Goldberg, D.E., (1989) Genetic Algorithms in Search Optimization, and Machine
Learning, Reading, , MA: Addison-Wesley Press;
problems (2002) International Journal of Production Research, 40, pp. 2141-2158;
Phadke, M.S., (1989) Quality Engineering Using Robust Design, , USA: Prentice-Hall
CORRESPONDENCE ADDRESS: Modrak, V.; Faculty of Manufacturing Technologies,
Technical University of KosiceSlovakia; email: [email protected]
EDITORS: Kacem I.

SOURCE: Scopus
Seifoddini, H.
7003581042;
Machine-component group analysis versus the similarity coefficient method in
cellular manufacturing applications
8352%2890%2990055-Q&partnerID=40&md5=c790038a4f86edd69ff5b6c1c2be3ff0
DOI: 10.1016/0360-8352(90)90055-Q
Wisconsin-Milwaukee, Milwaukee, WI 53201, United States
ABSTRACT: Among approaches to the machine cell formation problem, the similarity
coefficient method and machine-component group analysis have been widely used to
form machine cells for cellular manufacturing applications. While algorithms based
on machine-component group analysis work effectively in cases of disjoint machine-
component groups, they do not provide satisfactory solutions in the presence of
bottleneck machines. The similarity coefficient method overcomes this problem. This
paper compares these two approaches when applied to the machine cell formation
problem. © 1990.
INDEX KEYWORDS: Flexible Manufacturing Systems; Mathematical Techniques -
Algorithms, Cellular Manufacturing; Machine Component Group Analysis; Similarity
Coefficient Method, Computer Programming
REFERENCES: Chan, Milner, Direct clustering algorithm for group formation in
cellular manufacturing (1982) J. Mfg Syst., 1 (1), pp. 65-74;
King, Machine-component grouping in production flow analysis: an approach using a
rank order clustering algorithm (1980) Int. J. Prod. Res., 18, pp. 213-237;
pp. 53-57;
Seifoddini, Wolfe, Application of the similarity coefficient method in machine
cells formation in group technology (1986) AIEE Trans., 18 (3), pp. 271-277;
Seifoddini, Wolfe, Selecting the threshold value based on material handling cost in
group technology applications (1987) AIIE Tans., 19 (3), pp. 266-270;
57, pp. 34-38;
Seifoddini, Incorporation of the production volume in machine cells formation in
group technology applications (1987) Proc. of the 9th Int. Conf. on Production
Research, , Cincinnati, Ohio;
Anderberg, (1973) Cluster Analysis for Applications, , Academic Press, New York;
Sneath, Sokal, (1973) Numerical Taxonomy, , Freeman, San Francisco, Calif;
McCormick, Schweitzer, White, Problem decomposition and data reorganization by
clustering techniques (1972) Ops Res., 20, pp. 993-1009;
King, Nakoranchai, Machine-component group formation in group technology: review
133;
Vanelli, Kumar, A method for finding minimal bottle-neck cells for grouping part-
machine families† (1986) International Journal of Production Research, 24 (2), pp.
387-400;
Seifoddini, Cost-based machine-component grouping model: in group technology (1984)
Unpublished Ph.D. Dissertation, , Oklahoma State University;
Gupta, A production data based machine-component grouping model in cellular
manufacturing (1988) Unpublished PhD. Dissertation, , Industrial and Systems
Engineering Department, University of Wisconsin, Milwaukee;
Askin, Subramanion, A within-cell utilization based heuristic for designing
25 (5), pp. 639-665;
Ballakur, Steudel, Cellular manufacturing systems (1987) Int. J. Prod. Res., 25
(5), pp. 639-665;
J. Prod. Res., 11 (4), pp. 399-416;
Chakravaty, Shtub, An integrated layout for group technology with in-process
inventory costs (1984) International Journal of Production Research, 22 (3), pp.
431-442;
for group technology (1986) Int. J. Proc. Res., 24, pp. 451-464;
Dewitte, The use of similarity coefficients in production flow analysis (1980)
Kusiak, The generalized group technology concept (1987) Int. J. Prod. Res., 25 (4),
pp. 569-961;
Rajagopalan, Batra, Design of cellular production systems: a graph-theoretic
approach (1975) Int. J. Prod. Res., 13 (6), pp. 567-579
CORRESPONDENCE ADDRESS: Seifoddini, H.; Department of Industrial and Systems
Engineering, University of Wisconsin-Milwaukee, Milwaukee, WI 53201, United States
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Defersha, F.M., Chen, M.

14035061800;55584802279;
A parallel genetic algorithm for dynamic cell formation in cellular manufacturing
systems
26 times.
53349118242&doi=10.1080%2f00207540701441962&partnerID=40&md5=8fcdf5c668302f1e3d8da8
05f52a71f9
DOI: 10.1080/00207540701441962
University, 1455 de Maisonneuve W, Montreal, QC H3G 1M8, Canada
ABSTRACT: Instead of using expensive multiprocessor supercomputers, parallel
computing can be implemented on a cluster of inexpensive personal computers.
Commercial accesses to high performance parallel computing are also available on
the pay-per-use basis. However, literature on the use of parallel computing in
production research is limited. In this paper, we present a dynamic cell formation
problem in manufacturing systems solved by a parallel genetic algorithm approach.
This method improves our previous work on the use of sequential genetic algorithm
(GA). Six parallel GAs for the dynamic cell formation problem were developed and
tested. The parallel GAs are all based on the island model using migration of
individuals but are different in their connection topologies. The performance of
the parallel GA approach was evaluated against a sequential GA as well as the off-
shelf optimization software. The results are very encouraging. The considered
dynamic manufacturing cell formation problem incorporates several design factors.
They include dynamic cell configuration, alternative routings, sequence of
operations, multiple units of identical machines, machine capacity, workload
balancing, production cost and other practical constraints.
AUTHOR KEYWORDS: Cellular manufacturing; Genetic algorithm; Integer programming;
Parallel computing
INDEX KEYWORDS: Algorithms; Boolean functions; Cells; Cytology; Flexible
manufacturing systems; Genetic algorithms; Manufacture; Optimization; Parallel
algorithms; Parallel processing systems; Personal computers; Problem solving;
Sequential switching; Supercomputers, Alternative routings; Cellular manufacturing
systems; Design factors; Dynamic cell configuration; Dynamic cell formation;
Genetic algorithm; High performance parallel computing; Identical machines; Integer
programming; Island models; Manufacturing cell formation; Manufacturing systems;
Optimization software; Parallel computing; Parallel GA; Parallel genetic algorithm;
Production costs; Production research; Work load balancing, Cellular manufacturing
REFERENCES: Alba, E., Troya, J.M., Influence of the migration policy in parallel
distributed gas with structured and panmictic populations (2000) Appl. Intel, 12,
pp. 163-181;
planning horizons (2005) J. Manuf. Tech. Manage, 16, pp. 516-530;
(1995) Math. Comp. Model, 21 (12), pp. 61-73;
Baxter, F., Information technology and global changing science (1990) Conference on
Global Change: Economic Issues in Agriculture, , Forestry and Natural Resources,
Washington, DC, 19-21 November;
Cantú-Paz, E., (2000) Efficient and Accurate Parallel Genetic Algorithms, , Kluwer
Academic Publishers: Norwell, MA;
Chaudhry, S.S., Luo, W., Application of genetic algorithms in production and
operations management: A review (2005) Int. J. Prod. Res, 43, pp. 4083-4101;
cellular manufacturing environment (1998) Ann. Oper. Res, 74, pp. 109-128;
cellular manufacturing systems (2006) Int. J. Prod. Econ, 103, pp. 767-783;
genetic-algorithm-based, heuristic (2006) Int. J. Prod. Res, 44, pp. 2421-2444;
Goldberg, D.E., (1989) Genetic Algorithms in Search, Optimisation, and Machine
Learning, , Addison-Wesley: New York, NY;
Gordon, V.S., Whitley, D., Serial and parallel genetic algorithms as function
optimisers (1993) Proceedings of the 5th International Conference on Genetic
Algorithms, pp. 177-183., edited by S. Forrest, pp, Morgan Kaufmann: San Mateo, CA;
component grouping in decisions in the design of a cellular manufacturing systems
(1990) Int. J. Prod. Res, 28, pp. 1247-1269;
Jeon, G., Leep, H., Forming part families by using genetic algorithm and designing
machine cells under demand changes (2006) Comp. Oper. Res, 33, pp. 263-283;
Kusiak, A., The generalised group technology concept (1987) Int. J. Prod. Res, 25,
pp. 561-569;
approach to multi-criteria cell design (2000) Int. J. Prod. Res, 38, pp. 1201-1218;
uncertain production requirements with presence of routing flexibility, , PhD
thesis, Virginia Polytechnic Institute and State University, Blacksburg, VA;
Nowostawski, M., Poli, R., Parallel genetic algorithm taxonomy (1999) Proceedings
of the 3rd International Conference on Knowledge-Based Intelligent Information
Engineering System, pp. 88-92., Adelaide, Australia;
Rosenblatt, M.J., The dynamics of plant layout (1986) Manage. Sci, 32, pp. 76-86;
Selim, H.M., Askin, R.G., Vakharia, A.J., review evaluation and direction for
future research (1998) Comp. Indust. Eng, 34, pp. 2-30., Cell formation in group
technology;
dynamic cell formation problem using metaheuristics (2005) Appl. Math. Comp, 170,
pp. 761-780;
algorithms (2005) Lecture Notes in Comp. Sci, 3777, pp. 213-227;
Tompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A., (2003) Facilities
Planning, , Wiley: New York, NY;
Wemmerlöv, U., Hyer, N.L., Procedures for part-family/machine group identification
problem in cellular manufacturing (1986) J. Oper. Manage, 6, pp. 125-145;
Implementation experiences and performance improvements (1997) Int. J. Prod. Res,
35, pp. 29-49;
part populations (1999) HE Trans, 31, pp. 11-20
Engineering, Concordia University, 1455 de Maisonneuve W, Montreal, QC H3G 1M8,
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus

55910439800;6603156425;
Manufacturing cell design with alternative routings in generalized group
technology: Reducing the complexity of the solution space
17 times.
33847055945&doi=10.1080%2f00207540600719674&partnerID=40&md5=98abfe9ee2d58e06bd387f
f6b47ee85a
DOI: 10.1080/00207540600719674
Karaoli and Demetriou Str., 185 34 Piraeus, Greece
ABSTRACT: In the presence of alternative routings, the manufacturing cell design
involves the solution of a large number of (simple) cell-formation problems. We
present a bounding scheme which examines all combinations of alternative routings
and solves only a few cell-formation problems, thereby limiting the solution space
which is searched heuristically. This leads to increased reliability for the
solutions obtained. The resulting algorithm is shown to be applicable for problems
arising in practice frequently, when the initial design includes relatively few
exceptional elements, and machine duplication and/or genuine multiple process plans
are used correctively, to eliminate the remaining intercellular traffic.
AUTHOR KEYWORDS: Alternative routings; Complexity; Generalized group technology;
Manufacturing cell design; Solution space
INDEX KEYWORDS: Algorithms; Heuristic methods; Operations research, Bounding
scheme; Cell design; Machine duplication; Solution space, Problem solving
formation in generalized group technology (2001) Comput. Ind. Eng, 41, pp. 227-240;
Burbidge, J.L., (1975) The Introduction of Group Technology, , Wiley: New York;
Chen, J.-S., Heragu, S.S., Stepwise decomposition approaches for large scale
formation problems (1999) Eur. J. Oper. Res, 113, pp. 64-79;
Theory of NP-Completeness, , Freeman: New York;
formation for group technology applications (1990) Int. J. Prod. Res, 28, pp. 185-
198;
Heragu, S.S., Chen, J.-S., Optimal solution of cellular manufacturing system
design: Bender's decomposition approach (1998) Eur. J. Oper. Res, 107, pp. 175-192;
technology cell formation (1991) Int. J. Prod. Res, 29, pp. 1535-1547;
Kusiak, A., (1990) Intelligent Manufacturing Systems, , Prentice-Hall: Englewood
Cliffs, NJ;
(1994) Int. J. Prod. Res, 32, pp. 273-397;
algorithm for manufacturing cell design (1999) J. Oper. Res. Soc, 50, pp. 509-516;
considerations in group technology applications (1990) Int. J. Prod. Res, 28, pp.
2243-2257;
cell formation problem, in Proceedings of the 2nd Balkan Conference on OR, October
1993, Salonica, Greece, 1994; Sofianopoulou, S., Part and machine partitioning
problem in cellular manufacturing: Multiple machine environment (1996) Yugoslav J.
Oper. Res, 6, pp. 183-191;
formation of machine cells in group technology (1997) Int. J. Prod. Res, 35, pp.
501-511;
Sofianopoulou, S., Manufacturing cell design with alternative process plans and/or
replicate machines (1999) Int. J. Prod. Res, 37, pp. 707-720;
inter-cell layout problem in cellular manufacturing (2004) Eur. J. Oper. Res, 157,
pp. 592-606;
manufacturing systems cell formation problem (1998) Eur. J. Oper. Res, 105, pp.
537-551;
approach and a tabu search algorithm (2003) Int. J. Prod. Res, 41, pp. 2531-2546;
users (1989) Int. J. Prod. Res, 27, pp. 1511-1530;
technology problem with multiple process routings (1997) Comput. Ind. Eng, 32, pp.
207-220;
problem with alternative process plans (2004) Int. J. Adv. Manuf. Technol, 24, pp.
834-840
University of Piraeus, 80 Karaoli and Demetriou Str., 185 34 Piraeus, Greece;
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Lee, Kyung-Mi, Yamakawa, Takeshi, Lee, Keon-Myung

55737423800;35517861400;56996411200;
Machine-part grouping for cellular manufacturing systems: A neural network approach
(1997) International Conference on Knowledge-Based Intelligent Electronic Systems,
Proceedings, KES, 2, pp. 575-580. Cited 2 times.
0030691715&partnerID=40&md5=9429360575362d46764e5946921dbd75
AFFILIATIONS: Kyushu Inst of Technology, Fukuoka, Japan

ABSTRACT: The machine cell formation problem is one to group machines into machine
families and parts into part families so as to minimize bottleneck machines,
exceptional parts, and inter-cell part movements in cellular manufacturing systems
and flexible manufacturing systems. This paper proposes a new machine cell
formation method based on the adaptive Hamming net which is a neural network model.
To see the applicability of the method, it shows some experiment results and
compares the proposed method with other cell formation methods. From the
experiments, we can see that the proposed method can produce good cells for the
machine cell formation problem.
INDEX KEYWORDS: Adaptive control systems; Neural networks; Problem solving,
Adaptive Hamming net; Cell formation; Group technology (GT), Flexible manufacturing
systems
CORRESPONDENCE ADDRESS: Lee, Kyung-Mi; Kyushu Inst of Technology, Fukuoka, Japan
PUBLISHER: IEEE, Piscataway, NJ, United States
CODEN: 00267
ABBREVIATED SOURCE TITLE: Int Conf Knowledge Based Intell Electron Syst Proc KES
SOURCE: Scopus
Pandian, R.S., Mahapatra, S.S.

24173456100;34881914000;
Cell formation with operational time using ART1 networks
(2010) International Journal of Services and Operations Management, 6 (4), pp. 377-
397. Cited 3 times.
77952033019&doi=10.1504%2fIJSOM.2010.032915&partnerID=40&md5=137c186fa8e04014464ae9
12e6e474e5
DOI: 10.1504/IJSOM.2010.032915
AFFILIATIONS: Department of Mechanical Engineering, Kalasalingam University,
Virudhunagar, India;
Department of Mechanical Engineering, National Institute of Technology, Rourkela
769008 Orissa, India
ABSTRACT: Cell formation problems are typically combinatorial optimisation problems
and pose difficulties to obtaining quality solutions. Researchers have proposed
various algorithms based on different approaches to obtain disjoint machine cells.
The major limitations of these approaches lie in the fact that real-life production
factors, such as operational times, lot sizes and sequence of operations for
different parts are not taken into account. In the present work, an attempt has
been made to propose an Adaptive Resonance Theory 1 (ART1) algorithm to handle the
real valued workload matrix. ART1 algorithm is one of the types of Artificial
Neural Networks that is used in many applications such as image processing, data
clustering, pattern recognition, etc. It is one of the prominent approaches found
in literature for cell formation problems. A Modified Grouping Efficiency (MGE) is
proposed to measure the performance of the algorithm. The performance of the
proposed algorithm is compared with that of the K-means method and Genetic
Algorithm (GA). The results distinctly indicate that the proposed algorithm is
quite flexible, fast and efficient in computation for cell formation problems and
can be conveniently applied in industries. Copyright © 2010 Inderscience
Enterprises Ltd.
AUTHOR KEYWORDS: Adaptive resonance theory 1; ART1; Cell formation; Grouping
efficiency; K-means clustering
REFERENCES: Ashish, G., Bhabesh, N., Multi-objective rule mining using genetic
algorithms (2004) Information Sciences, 163, pp. 123-133;
113;
Bandyopadhyay, S., Maulik, U., An evolutionary technique based on K-means algorithm
for optimal clustering in RN (2002) Information Sciences, 146, pp. 221-237;
pp. 2097-2116;
Carpenter, G.A., Grossberg, S., (2002) Adaptive Resonance Theory, A Handbook of
Brain Theory and Neural Networks, , 2nd ed., Massachusetts: MIT Press;
Research, 24 (2), pp. 451-464;
Research, 24 (5), pp. 1221-1233;
Research, 27 (6), pp. 1035-1052;
pp. 293-318;
Cheung, Y-M., K-means: A new generalized K-means clustering algorithm (2003)
Pattern Recognition Letters, 24, pp. 2883-2893;
Chu, C.H., Tsai, M., The array based clustering techniques (1990) International
Grossberg, S., Adaptive pattern classification and universal recoding. II:
Feedback, expectation, olfaction and illusions (1976) Biological Cybernetics, 23,
pp. 187-202;
Jose Fernando, M., A hybrid genetic algorithm in cell formation problems (2002)
AT&T Labs Research Technical Report TD-5FE6RN, , AT&T Labs Research, Florham Park,
NJ 07932, USA;
Kao, Y., Moon, Y.B., A unified group technology implementation using the back
propagation learning rule of neural networks (1991) Computers and Industrial
Engineering, 20 (4), pp. 425-437;
Kaparthi, S., Suresh, N.C., Machine component cell formation in GT: A NN approach
pp. 117-133;
Kumar, C.S., Chandrasekaran, M.P., Grouping efficacy: A quantitative criterion for
Kumar, P., Singh, N., Tewari, N.K., A nonlinear goal programming model for the
loading problem in a flexible manufacturing system (1987) Engineering Optimization,
12 (4), pp. 315-323;
Kusiak, A., Similarity coefficient algorithms for solving the group technology
problem (1992) International Journal of Production Research, 30 (11), pp. 2633-
2646;
Kusiak, A., Chow, C.H., The generalized group technology concept (1987)
Lee, M., Evolution of behaviors in autonomous robot using artificial neural network
and genetic algorithm (2003) Information Sciences, 155, pp. 43-60;
multicellular flexible manufacturing system (2006) Int. J. Services and Operations
Management, Vol., 2 (1), pp. 1-21;
McCornick, W.T., Schweitzer, P.J., White, T.W., Problem decomposition and data
993-1009;
implementations-a state-of-the-art survey (1985) OMEGA: The International Journal
of Management Science, 13 (6), pp. 381-391;
Pao, Y-H., (1989) Adaptive Pattern Recognition and Neural Networks, , New York
Inc.: Addison-Wesley Publishing Company;
new weighted grouping efficiency measure (2001) IIE Transactions, 33 (1), pp. 11-
27;
(1989) IIE Transactions, 21 (4), pp. 382-388;
method in cellular manufacturing applications (1990) Computers and Industrial
Engineering, 18 (3), pp. 333-339;
Srinivasan, G., Narendran, T.T., Mahadevan, B., An assignment model for the part
Research, 28 (1), pp. 145-152;
Research, 28 (1), pp. 145-152;
Sudhakara, P.R., Mahapatra, S.S., Cell formation with ordinal-level data using
ART1-based neural networks (2008) Int. J. Services and Operations Management, 4
(5), pp. 618-630;
Syswerda, G., Scheduling optimization using genetic algorithm (1991) Handbook of
Genetic Algorithms, New York: Van Nostrand Reinhold;
Venkumar, P., Haq, A.N., Complete and fractional cell formation using Kohonen self
Wang, J., Takefuji, Y., (1993) Neural Networks in Design and Manufacturing, ,
Singapore: World Scientific Publishing Company;
Wu, T-H., Low, C., Wu, W-T., A tabu search approach to the cell formation problem
CORRESPONDENCE ADDRESS: Mahapatra, S. S.; Department of Mechanical Engineering,
National Institute of Technology, Rourkela 769008 Orissa, India; email:
[email protected]
ISSN: 17442370
ABBREVIATED SOURCE TITLE: Int. J. Serv. Oper. Manage.
SOURCE: Scopus

56235396300;7004884370;
Evolving knowledge for the solution of clustering problems in cellular
manufacturing
11 times.
5144228750&doi=10.1080%2f00207540410001711845&partnerID=40&md5=f7a0ce47cf02c0ed4545
1dec54c76137
DOI: 10.1080/00207540410001711845
AFFILIATIONS: Sch. of Comp. Sci. and Engineering, Cyprus College, 6 Diogenous
Street, Engomi, 1516 Nicosia, Cyprus;
Department of Automatic Control, University of Sheffield, Sheffield, United Kingdom
ABSTRACT: Hierarchical clustering has been widely used for the solution of problems
in the area of cellular manufacturing. Hierarchical clustering procedures utilize
coefficients that quantify the level of similarity between pairs of machines or
parts in the plant. An evolutionary methodology is proposed for the construction of
new similarity coefficients that can be used by standard hierarchical clustering
methodologies for the solution of cell-formation problems. A typical application is
presented for the simplest case of the cell-formation problem. However, alternative
similarity coefficients can be evolved for advanced formulations of the problem by
suitably modifying the set of fitness cases that constitute the environment of the
evolutionary process.
INDEX KEYWORDS: Algorithms; Cellular radio systems; Economic and social effects;
Group technology; Hierarchical systems; Mathematical models; Societies and
institutions, Cell-formations; Cellular manufacture; Multistage processes, Problem
solving
Programming: An Introduction, , San Francisco: Morgan Kaufman;
Boctor, F.F., A linear formulation of the machine-part cell- Formation problem
2097-2116;
Research, 24, pp. 1221-1233;
Research, 24, pp. 451-464;
Transactions in Evolutionary Computation, 4, pp. 93-113;
Dimopoulos, C., Zalzala, A.M.S., Investigating the use of genetic programming for a
classic one-machine scheduling problem (2001) Advances in Engineering Software, 32,
pp. 489-498;
to cell-composition and layout design problems (1996) International Journal of
Jaccard, P., Nouvelles recherches sur la distribution florale (1908) Bulletin De La
Societe Vaudoise De Sciences Naturell, 44, pp. 223-270;
Koza, J.R., (1992) Genetic Programming: on the Programming of Computers by Means of
Natural Selection, , Cambridge, MA: MIT Press;
397;
1728;
51, pp. 53-57;
Michalewtcz, Z., (1992) Genetic Algorithms + Data Structures = Evolution
Programs, , New York: Springer;
Mitrovanov, S.P., (1966) The Scientific Principles of Group Technology, , Boston
Spa: National Lending Library Translation;
pp. 385-1314;
Singh, N., Cellular manufacturing systems: An invited review (1993) European
Sneath, P.H.A., The application of computers to taxonomy (1957) Journal of General
and Production Economics, 9, pp. 73-81
CORRESPONDENCE ADDRESS: Dimopoulos, C.; Sch. of Comp. Sci. and Engineering, Cyprus
College, 6 Diogenous Street, Engomi, 1516 Nicosia, Cyprus; email:
[email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Selim, H.M., Askin, R.G., Vakharia, A.J.

55142046600;7004386108;7003543855;
Cell formation in group technology: Review, evaluation and directions for future
research
0031629991&partnerID=40&md5=7aadef0f9411dbec10181ea3abc163f4
AFFILIATIONS: Production Engineering Department, Coll. of Engineering and

Technology, Helwan, Cairo, Egypt;
Syst. and Indust. Eng. Department, University of Arizona, Tucson, AZ 85721, United
States;
Dept. of Decis. and Info. Sciences, College of Business Administration, University
of Florida, Gainesville, FL 32611, United States
ABSTRACT: This paper discusses and reviews a fundamental issue in cellular
manufacturing - cell formation. This problem is of strategic and operational
importance in that it affects the fundamental structure and the overall layout of a
cellular manufacturing system. We first provide a comprehensive mathematical
formulation of the cell formation problem and then propose a methodology-based
classification of prior research. This classification is used in reviewing the most
recent literature on the cell formation problem. Based on a comparison and critical
evaluation, we highlight the shortcomings of current approaches and also outline
directions for future research. © 1998 Published by Elsevier Science Ltd. All
rights reserved.
INDEX KEYWORDS: Computational methods; Group technology; Systems analysis;
Technological forecasting, Cell formation, Cellular manufacturing
REFERENCES: Wemmerlöv, U., Hyer, N.L., Procedures for the part family/machine group
1409-1421;
Designing a Cellular Manufacturing System, , Unpublished PhD thesis, University of
Wisconsin-Madison;
1728;
Vakharia, A.J., Selim, H.M., Group technology (1994) The Handbook of Design.
Manufacturing and Automation, pp. 435-460., ed. R. C. Dorf and A. Kusiak. Wiley,
New York;
Barker, A., Group technology and machining cells in the small-batch production of
valves (1970) Machinery and Production Engineering, 116, pp. 2-6;
Purcheck, G.F.K., Combinatorial grouping -a lattice theoretic method for the design
Askin, R.G., Vakharia, A.J., Group technology - Cell formation and operation (1991)
The Automated Factory Handbook: Technology and Management, pp. 317-366., ed. D. I.
Cleland and B. Bidanda. TAB Books, New York;
Damodaran, V., Singh, N., Lashkari, R.S., Design of cellular manufacturing systems
with refixturing and material handling considerations Applied Stochastic Models and
Data Analysis, , forthcoming;
De Beer, C., De Witte, J., Production flow synthesis (1978) CIRP Annals, 27, pp.
389-1341;
Burbidge, J.L., Production flow analysis (1963) The Production Engineer, 42, p.
742;
Burbidge, J.L., (1975) The Introduction of Group Technology, , Heinemann, London;
El-Essawy, I.F.K., (1971) The Development of Component Flow Analysis As a
Production Systems' Design for Multi-product Engineering Companies, , PhD thesis,
UMIST, U.K;
El-Essawy, I.F.K., Torrance, J., Component flow analysis - An effective approach to
production systems' design (1972) Production Engineer, 51, p. 165;
Mitrofanov, S., (1966) Scientific Principles of Group Technology, , National
Lending Library, London, UK;
117-133;
397;
Research, 27, pp. 1035-1052;
Research, 28, pp. 913-925;
Askin, R.G., Creswell, J.B., Goldberg, J.B., Vakharia, A.J., A hamiltonian path
De Vries, M., (1976) Group Technology: An Overview and Bibliography, ,
Machinability Data Center, Cincinnati, OH;
Logendran, R., Effect of the identification of key machines in the cell formation
problem of cellular manufacturing systems (1990) Computers and Industrial
McCormick, W.T., Scweitzer, P.J., White, T.W., Problem decomposition and data
reorganization by a cluster technique (1972) Operations Research, 20, pp. 993-1009;
Sahay, A., Seifoddini, H., An algorithm for forming machine-component cell in group
technology (1987) Proceedings of the Ninth International Conference on Production
Research, , Cincinnati, OH;
2062;

Choi, M.J., Riggs, W.E., GT coding and classification systems for manufacturing
cell design (1991) Production and Inventory Management Journal, 32, pp. 28-32;
Vakharia, A.J., Askin, R.G., Sen, S., Cell formation in group technology: A
mathematical programming approach (1989) Proceedings, DSI National Meeting, pp.
178-180., New Orleans;
Research, 31, pp. 1133-1142;
formation of part families and machines cells (1987) International Journal of
Srinvasan, G., Narendran, T., Grafics - A nonhierarchical clustering algorithm for
478;
theoretic approach (1975) International Journal of Production Research, 13, pp. 56-
68;
Ferreira, J.F., Ribeiro, C., Pradin, B., A methodology for cellular manufacturing
design (1993) International Journal of Production Research, 31, pp. 235-250;
Kusiak, A., The generalized group technology problem (1987) International Journal
Research, 28, pp. 1555-1572;
King, J.R., Machine-component group formation in group technology (1980) OMEGA: The
Wei, J.C., A note on change to group technology: Process organization is obsolete
Elmaraghy, H.A., Gu, P., Feature based expert parts assignment in cellular
manufacturing (1988) Journal of Manufacturing Systems, 8, pp. 139-152;
programming model (1990) Mathematical Computer Modelling, 13, pp. 71-82;
Kasilingam, J.A.K., Bhole, S.D., Cell formation in flexible manufacturing systems
under resource constraints (1990) Computers and Industrial Engineering, 19, pp.
437-441;
Purcheck, G.F.K., Machine-component group formation: A heuristic method for
flexible production cells and flexible manufacturing systems (1985) International
Purcheck, G.F.K., A mathematical classification as a basis for the design of group
technology production cells (1974) The Production Engineer, 54, p. 35;
Olivia-Lopez, E., Purcheck, G.F.K., Load balancing for group technology planning
and control (1979) International Journal of MTDR, 19, pp. 259-274;
91;
Swain, R.W., Lee, E.K., Group technology: Part family/machine group formation by
mathematical programming (1989) ORSA/TIMS Joint National Meeting, , Denver;
search approach International Journal of Production Research, , forthcoming;
Vakharia, A.J., Kaku, B.K., An investigation of the impact of demand changes on a
cellular manufacturing system (1993) Decision Sciences, 24, pp. 909-930;
and similarity coefficients to the GT cell formation problem (1989) International
Damodaran, V., Lashkari, R.S., Singh, N., A production planning model for cellular
manufacturing systems with refixturing considerations (1992) International Journal
16, pp. 235-245;
Singh, N., Aneja, Y.P., Rana, S.P., A bicriterion framework for operations
assignment and routing flexibility analysis in cellular manufacturing systems
Research, 25, pp. 639-665;

weighted fuzzy features (1992) International Journal of Production Research, 30,
pp. 1285-1299;
139;
Burbidge, J.L., A manual method of production flow analysis (1977) The Production
Engineer, 56, p. 34;
Burbidge, J.L., (1979) Group Technology in the Engineering Industry, , Mechanical
Engineering Publications, London, UK;
Journal of Production Research, 20, p. 339;
Research, 24, pp. 1221-1233;
Chu, C.H., Manufacturing cell formation by competitive learning (1993)
Studies, pp. 301-318., ed. A. Kusiak. North-Holland, New York;
Frazier, G.V., Gaither, N., Seed selection procedures for cell formation heuristics
Gongaware, T., Ham, I., Cluster analysis application for group technology
manufacturing systems (1991) Proceedings Ninth North American Manufacturing
Research Conference., pp. 503-508;
1259-1273;
layout design and intercell flows for the machine sharing problem (1993)
Kang, S., Wemmerlöv, U., A work load-oriented heuristic methodology for
Research, 18, pp. 213-232;
Logendran, R., West, T.M., A comparison of methodologies for efficient part-machine
cluster formation (1991) Computers and Industrial Engineering, 21, pp. 285-289;
Logendran, R., West, T.M., A machine-part grouping algorithm in cellular
manufacturing (1990) Computers and Industrial Engineering, 19, pp. 57-61;
Okogbaa, O.G., Chen, M., Changchit, C., Shell, R.L., Manufacturing system cell
567-579;
Sheu, C., Krajewski, L.J., (1990) Strategic Formation of Manufacturing Cells, ,
Working Paper, Fisher College of Business, Ohio State University, Columbus, OH;
Shiko, G., A process planning-oriented approach to part family formation in group
technology applications (1992) International Journal of Production Research, 30,
pp. 1739-1752;
Srinvasan, G., Narendran, T.T., Mahadevan, B., An assignment model for the part-
Research, 28, pp. 145-152;
Stanfel, L.E., A successive approximations method for a cellular manufacturing
problem (1989) Annals of Operations Research, 17, pp. 13-30;
approach (1997) International Journal of Production Research, , in press;
pp. 84-97;
machine families (1993) International Journal of Production Research, 31, pp. 325-
349;
Research, 28, pp. 2075-2084;
Research, 24, pp. 1171-1192;
technology) layout with process layout (1987) Decision Sciences, 18, pp. 562-581;
Steudel, H.J., Simshop: A job shop/cellular manufacturing simulator (1986) Journal
of Manufacturing Systems, 5, pp. 181-189;
Shafer, S.M., Meredith, J.R., An empirically-based simulation study of functional
versus cellular layouts with operations overlapping (1993) International Journal of
Operations and Production Management, 13, pp. 47-62;
Hyer, N., Wemmerlöv, U., Group technology in the U.S. Manufacturing industry: A
27, pp. 1287-1304;
Selim, H.M., Vakharia, A.J., Askin, R.G., (1995) Flexibility in Cellular
Manufacturing: a Framework and Measures, , Working paper 95-108, Department of DIS,
College of Business Administration, University of Florida, Gainesville, FL;
Ahmed, M.N., Ahmed, N., Nandkeolyar, U., A volume and material handling cost based
heuristic for designing group technology cells (1991) Journal of Operations
Al-Qattan, I., Designing flexible manufacturing cells using branch and bound method
Anderberg, M.R., (1973) Cluster Analysis for Applications, , Academic Press, New
York;
Askin, R.G., Mitwasi, M.G., Integrating facility layout with process selection and
capacity planning (1992) European Journal of Operational Research, 57, pp. 162-173;
Astrop, A., The Serck-Audko cell system of production (1996) Machinery and
Production Engineering, 115, pp. 1002-1006;
Astrop, A., The Serck-Audko cell system of production (1970) Machinery and
Production Engineering, 116, pp. 82-88;
Basu, A., Hyer, N.L., Shtub, A., A structured approach to the adoption of Group
Technology (1994) International Journal of Production Research, 1 (1), pp. 77-98;
Chu, C.H., Cluster analysis in manufacturing cellular formation (1989) OMEGA: The
Chu, C.H., Lee, W., A comparison of 0-1 integer programming models for
manufacturing cell formation (1989) Proceedings, National Decision Sciences
Institute Conference, , New Orleans;
28, pp. 1417-1433;
Craig, R.J., Moore, J.M., Turner, W.C., Planned production flexibility (1975)
De Beer, C., Van Gerwen, R., De Witte, J., Analysis of engineering production
systems as a base for product-oriented reconstruction (1976) CIRP Annals, 25, pp.
439-441;
Dornbush, E.U., Eiche, F.M., Coding parts graphically (1969) American Machinist,
113, p. 105;
Manufacturing, , Ellis Horwood, Chichester, U.K;
Garza, O., Smunt, T.L., Countering the negative impact of intercellular flow in
cellular manufacturing (1990) Journal of Operations Management, 10, pp. 92-117;
pp. 461-468;
Hertz, A., Jaumard, B., Ribeiro, C.C., A Tabu search approach to cell formation
problems in Group Technology (1991) TIMS XXX - SOBRAPO XXIII Joint International
Meeting, , Rio de Janeiro;
Hertz, A., Jaumard, B., Ribeiro, C.C., A graph theory approach to subcontracting,
machine duplication and intercell moves in cellular manufacturing Discrete Applied
Mathematics, , forthcoming;
Hertz, A., Jaumard, B., Ribeiro, C.C., (1993) A Multi-criteria Tabu Search Approach
to Cell Formation Problems in Group Technology with Multiple Objectives, , MCC
21/93, Department of Computer Science, Catholic University of Rio de Janeiro;
Houtzeel, A., MICLASS, a classification system based on group technology (1975) SME
Technical Paper MS75-721, , Chicago, IL;
Hussein, M., Leonard, R., The design of standard cells for group technology by the
use of machine tool and workpiece statistics (1976) Proceedings of the 16th
International Machine Tool Design and Research Conference, pp. 87-98., Macmillan,
London;
Hyer, N., Wemmerlöv, U., Group Technology oriented coding systems: Structure,
applications, and implementation (1985) Production and Inventory Management
Journal, 26, pp. 55-78;
Hyer, N., The potential of group technology for U.S. Manufacturing (1984) Journal
of Operations Management, 4, pp. 183-202;
Ingram, F.B., Group Technology (1982) Production and Inventory Management Journal,
23, pp. 19-34;
Irani, S.A., Cohen, P.H., Cavalier, T.M., Design of cellular manufacturing systems
(1992) Transactions of the ASME, 114, pp. 352-361;
Jacobs, F.R., (1985) Computerized Production Flow Analysis, Softcover Software: 28
Microcomputer Programs for Ies and Managers, pp. 61-67., ed. G.E. Whitehouse. IE
and Management Press, Atlanta, GA;
Kandiller, L., (1992) A Comparative Study on Cell Formation in Cellular
Manufacturing Systems, , Working paper, Department of Industrial Engineering,
Bilkent University, Turkey;
Kaparthi, S., Suresh, N.C., A neural network system for shape-based classification
and coding of rotational parts (1991) International Journal of Production Research,
29, pp. 1771-1784;
pp. 1353-1367;
Karanzalis, T., Family parts line production: A new manufacturing concept (1980)
Industrial Management Seminar No. 35, 35., Milwaukee, WI;
(1970) AT & T Bell Labs. Technical Journal, 49, pp. 291-307;
Li, J., Ding, Z., Fuzzy cluster analysis and fuzzy pattern recognition method for
formation of part families (1982) Proceedings, 16th NAMRC, SME, pp. 558-563;
Lemoine, Y., Mutel, B., Automatic recognition of production cells and part families
(1983) Advances in CAD/CAM, , ed. T. M. R. Ellis and O. I. Semenkov, 239-248.
North-Holland, Amsterdam;
Logendran, R., A model for duplicating bottleneck machines in the presence of
budgetary limitations in cellular manufacturing (1992) International Journal of
attractiveness of Group Technology layouts (1990) Management Science, 36, pp. 1567-
1578;
implementation - A state-of-the-art survey (1985) OMEGA: The International Journal
of Management Science, 13, pp. 381-391;
Opitz, H., (1979) A Classification to Describe Workpieces, , Pergamon, Oxford;
Opitz, H., Eversheim, W., Wiendahl, H.P., Workpiece classification and its
industrial application (1969) International Journal of MTDR, 9, p. 39;
Peters, J., Dumong, W., Van Dyck, F., Group Technology at work (1974) American
Machinist, 118, pp. 40-44;
Philips, H., Step painlessly into group technology (1971) Metalworking Production,
pp. 36-38., January;
Rajagopalan, M.P., Chandrasekharan, R., An ideal seed non-hierarchical clustering
Research, 24, pp. 451-464;
Ransom, G.M., (1972) Group Technology, , McGraw-Hill, New York;
Ranta, J., The impact of electronics and information technology on the future
trends and applications of CIM technologies (1989) Trends and Impacts of Computer
Integrated Manufacturing, , ed. J. Ranta. IIASA, A-2361 Laxenburg, Austria;
Rao, H.A., Gu, P., Design of cellular manufacturing systems: A neural network
approach (1993) International Journal of Production Research, 30, pp. 407-424;
Robinson, D., Duckstein, L., Polyhedral dynamics as a tool for machine-part group
Seifoddini, H., Performance evaluation of hybrid cells (1992) IIE Transactions, 24,
pp. 84-88;
Seifoddini, H., Duplication process in machine cells in group technology (1989) IIE
Selim, H.M., Vakharia, A.J., Askin, R.G., Mathematical models of cell formation:
Review and extensions (1991) TIMS/ORSA Nashville Meeting, , May 12-15;
Selvam, R.P., Balasubramaniam, K.N., Algorithmic grouping of operation sequences
Singh, N., Mohanty, B.K., Fuzzy multi-objective routing problems with application
to process planning in manufacturing systems (1991) International Journal of
Tatikonda, M.V., Wemmerlöv, U., Adoption and implementation of group technology
classification and coding systems: Insights from seven case studies (1992)
Vakharia, A.J., Cell formation in group technology: A framework for evaluation
Vannelli, A., Kumar, K.R., A method for finding minimal bottleneck cells for group
387-400;
Vannelli, A., Kumar, K.R., Minimal bottleneck cell approach for generating part-
machine families in cellular manufacturing (1988) Computer Integrated
Manufacturing, , ed. I. B. Turkara et al., Springer-Verlag, Berlin
CORRESPONDENCE ADDRESS: Selim, H.M.; Production Engineering Department, Coll. of
Engineering and Technology, Helwan, Cairo, Egypt
ISSN: 03608352
CODEN: CINDD
DOCUMENT TYPE: Review
SOURCE: Scopus
Wei, J.C., Gaither, N.

7403085258;6701536929;
A capacity constrained multiobjective cell formation method
6125%2890%2990053-K&partnerID=40&md5=65d8395d3e057654c439151a3cd68984
DOI: 10.1016/0278-6125(90)90053-K
AFFILIATIONS: University of Notre Dame, Notre Dame, IN, United States;
Texas A and M University, College Station, TX, United States
ABSTRACT: This study addresses a fundamental difficulty in designing cellular
manufacturing (CM) systems, the cell formation problem. This problem has its
strategic importance in that it affects the fundamental structure and overall
layout of a CM system. A heuristic model is developed which assigns parts and
machines to manufacturing cells while taking into account machine capacities,
product routings, relevant costs, and several objectives of production systems. A
full factorial experimental design is used to evaluate the effects of environmental
factors on the performance of the heursitic model. Large cell formation problems
are solved with the heuristic model to further characterize the model with respect
to solution characteristics and computer run time. © 1990.
AUTHOR KEYWORDS: Cellular Manufacturing; Group Technology; Heuristics;
Multiobjective Programming
REFERENCES: Hyer, The Potential of Group Technology for U.S. Manufacturing (1984)
Wemmerlöv, Hyer, Research Issues in Cellular Manufacturing (1987) International
Voss, managing New Manufacturing Technology (1986) Operations Management
Association Monograph No. 1, , Michigan State University, East Lansing, Michigan;
Hetzner, Tornastsky, Manufacturing Technology in the 1980s (1983) Management
Science, 29, pp. 951-961;
Problem in Cellular Manufacturing (1986) Journal of Operations Management, 6, pp.
125-147;
McAuley, Machine Grouping for Efficient Production (1972) Production Engineer, 51,
pp. 53-57;
King, Machine-Component Grouping in Production Flow Analysis: An approach Using
Rank Order Clustering Algorithm (1980) International Journal of Production
Research, 18, pp. 213-232;
King, Nakornchai, Machine-Component Group Formation for Group Technology Review and
Extension (1982) International Journal of Production Research, 20, pp. 117-133;
Chan, Milner, Direct Clustering Algorithm for Group Formulation in Cellular
Manufacturing (1982) Journal of Manufacturing Systems, 1, pp. 65-75;
for Cellular Manufacturing (1986) International Journal of Production Research, 24,
pp. 451-464;
Chandrasekharan, Rajagopalan, ZODIAC—An Algorithm for Part-Families and Machine-
Cells (1987) International Journal of Production Research, 25, pp. 835-850;
Kusiak, Chow, Efficient Solving of the Group Technology Problem (1987) Journal of
Kumar, Vannelli, Strategic Subcontracting for Efficient Disaggregated Manufacturing
Rajagopolan, Batra, Design of Cellular Production Systems: A Graph-Theoretic
Approach (1975) International Journal of Production Research, 13, pp. 567-579;
Ballakur, Steudel, A Within-Cell Utilization Based Heuristic for Designing Cellular
Manufacturing Systems (1987) International Journal of Production Research, 25, pp.
639-665;
Ang, Willey, A Comparative Study of the Performance of Pure and Hybrid Group
Technology Manufacturing Systems Using Computer Simulation Techniques (1984)
Sinha, Hollier, A Review of Production Control Problems in Cellular Manufacturing
Zionts, Wallenius, An Interactive Programming Method for Solving the Multiple
Criteria Problem (1976) Management Science, 22, pp. 652-663;
Benayoun, deMontgolfier, Tergny, Laritchev, Linear Programming with Multiple
Objective Functions: Step Method (STEM) (1971) Mathematical Programming, 1, pp.
366-375
CORRESPONDENCE ADDRESS: Wei, J.C.; University of Notre Dame, Notre Dame, IN, United
States
ISSN: 02786125
CODEN: JMSYE
SOURCE: Scopus
Hu, B., Chen, M., Defersha, F.M.

56512934700;55584802279;14035061800;
An Integrated method for multiobjectives cell formation in cellular manufacturing
systems
34249802044&doi=10.1504%2fIJMTM.2007.013324&partnerID=40&md5=69576e0943f3fc293c46d6
f2c1a2e4dc
DOI: 10.1504/IJMTM.2007.013324
AFFILIATIONS: Management College, Huazhong University of Science and Technology,
1037 Luoyu Road, Wuhan 43007, China;
Department of Mechanical and Industrial Engineering, Concordia University, 1455
Maisonneuve West, Montreal, Que. H3G 1M8, Canada;
Management College, China;
Advanced Management Institute, Huazhong University of Science and Technology
(HUST), Wuhan, China;
Department of Mechanical and Industrial Engineering, Concordia University,
Montreal, Canada
ABSTRACT: In this research, an integrated method was developed to solve a
multiobjective cell formation problem. The method consists of an integer
programming model, a heuristic algorithm for generating alternative cell
formations, a computer simulation model for investigating system performances and a
Back Propagation (BP) artificial neural network model for selecting the best system
configuration. The criteria considered in solving the overall cell formation
problem include system related costs, part completion times, queue lengths and
machine utilisation. The BP neural network is designed to incorporate expert
experience to evaluate different cell formations considering system costs and
performances. Numerical examples are provided to test and illustrate the model and
the developed method. Copyright © 2007 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Back Propagation (BP) neural networks; Cell formation; Computer
simulation; Integer programming
INDEX KEYWORDS: Back Propagation (BP) neural networks; Cell formation; Machine
utilization; Part completion times, Backpropagation; Computer simulation; Heuristic
algorithms; Integer programming; Mathematical models; Neural networks; Numerical
methods, Cellular manufacturing
REFERENCES: Asokan, P., Prabhakaran, G., Kumar, G.S., Machine-cell grouping in
cellular manufacturing systems using non-traditional optimisation techniques - a
comparative study (2001) International Journal of Advanced Manufacturing
the subproblems (1994) International Journal of Production Research, 32, pp. 1197-
1218;
Bor-Yuh, L., Fu-Kwun, W., A simulation study of sequencing heuristics in a cellular
flexible assembly system with hybrid order shipment environments (1999) Simulation
Practice and Theory, 7, pp. 31-46;
109-128;
Dimitri, G.-G., Aharon, G., Optimal job-shop scheduling with random operations and
cost objectives (2002) International Journal of Production Economics, 76, pp. 147-
157;
Haykin, S., (1999) Neural Networks, A Comprehensive Foundation, , 2nd edition,
Printice Hall;
design: Bender's decomposition approach (1998) European Journal of Operational
Research, 107, pp. 175-192;
Jamal, A.M.M., Neural network and cellular manufacturing: The benefits of applying
a neural network model to cellular manufacturing (1993) Industrial Management and
Data Systems, 93, pp. 21-25;
Lockwood, W.T., Mahmoodi, F., Mosier, C.T., Scheduling unbalanced cellular
manufacturing systems with lot splitting (2000) International Journal of Production
Research, 38, pp. 951-966;
manufacturing cell design (1999) OR; The Journal of the Operational Research
Society, 50, pp. 509-516;
Malakooti, B., Yang, Z., A variable-parameter unsupervised learning clustering
neural network approach with application to machine-part group formation (1995)
278-291;
Nemhauser, G.L., Wolsey, L.A., (1988) Integer and Combinatorial Optimization, ,
Wiley, NY;
Olorunniwo, F.O., Changes in production planning and control systems with
implementation of cellular manufacturing (1996) Production and Inventory
Reisman, A., Kumar, A., Cheng, C.H., Cellular manufacturing: A statistical review
of the literature (1997) Operations Research, 45, pp. 508-535;
Rao, H.A., Gu, P., A multi-constraint neural network for the pragmatic design of
33, pp. 1049-1070;
Sarker, B.R., Mondai, S., Grouping efficiency measures in cellular manufacturing: A
pp. 285-314;
Schrage, L., (1991) UNDO: An Optimization Modeling System, , Danvers, MA: Boyd and
Fraser;
Shinn, A., Williams, T., A stitch in time: A simulation of cellular manufacturing
(1998) Production and Inventory Management Journal, 39, pp. 72-77;
Sin-hoon, H., Chee-kwong, L., JIT Scheduling rules: A simulation evaluation (1988)
Omega, 26, pp. 381-395;
Singh, N., (1996) Systems approach to computer-integrated design and manufacturing,
, Wiley, NY;
Song, S.-J., Choi, J.-H., Integrated autonomous cellular manufacturing - A new
concept for the 21 st century (2001) International Journal of Manufacturing
Technology and Management, 3, pp. 293-307;
Suresh, N.C., Kaparthi, S., The performance of fuzzy ART neural network for group
pp. 1693-1713;
machines: A Fuzzy ART neural network approach (1999) International Journal of
Engineering, Concordia University, 1455 Maisonneuve West, Montreal, Que. H3G 1M8,
ISSN: 13682148
SOURCE: Scopus
Pai, P.-F., Chang, P.-T., Lee, S.-Y.

8392557900;7403573918;8392557800;
Part-machine family formation using genetic algorithms in a fuzzy environment
18844390716&doi=10.1007%2fs00170-003-1944-
z&partnerID=40&md5=7f210404d94846a2804a4d6e3c2f53a3
DOI: 10.1007/s00170-003-1944-z
AFFILIATIONS: Department of Industrial Engineering, Da-Yeh University, Chang-Hwa
515, Taiwan;
Department of Industrial Engineering and Enterprise Information, Tung-Hai
University, Taichung, Taiwan
ABSTRACT: In traditional cell-formation problems, it is assumed that each part is
developed on a single machine. However, in many realistic situations, the
suitability of alternative machines for developing the same part feature is
frequently vague. Therefore, the fuzzy relation is ideally suited to represent this
vague and uncertain cell-formation problem. Furthermore, part-machine family
formation problems are usually NP-complete. In this study, a genetic algorithm (GA)
is used to deal with the problem. The aim of this study is to design a GA-based
algorithm to solve the part-machine family formation problem in a fuzzy
environment. The results of computational tests presented are very promising. ©
Springer-Verlag London Limited 2004.
AUTHOR KEYWORDS: Fuzzy set theory; Genetic algorithms; Part-machine family
formation
INDEX KEYWORDS: Computational methods; Fuzzy sets; Linear programming; Matrix
algebra; Optimization; Problem solving; Self organizing maps, Cell-formation; Fuzzy
environments; Fuzzy set theory; Part-machine family formation, Genetic algorithms
REFERENCES: Akin, G., Cesswell, S.H., Goldberg, J.B., Vakharia, J., A Hamiltonian
path approach to reordering the part-machine matrix for cellular manufacturing
(1991) Int J Prod Res, 29 (6), pp. 1081-1100;
coefficients and a parallel genetic TSP algorithm formulation and comparison (1995)
Math and Comput Model, 21 (12), pp. 61-73;
Ben-Arieh, D., Lee, S.E., Chang, P.T., Theory and methodology: Fuzzy part coding
for group technology (1996) Eur J Oper Res, 92, pp. 637-648;
weighted fuzzy features (1992) Int J Prod Res, 30 (6), pp. 1285-1299;
Cheng, C.H., Gupta, Y.P., Lee, W.H., Wong, W.F., A TSP-based heuristic for forming
Chu, C.H., An improved neural network for manufacturing cell formation (1997)
Decision Support Syst, 20, pp. 279-295;
(1991) Int J Prod Res, 29 (7), pp. 1475-1487;
Gindy, N.N.Z., Ratchev, T.M., Case, K., Component grouping for GT applications - A
fuzzy clustering approach with validity measure (1995) Int J Prod Res, 33 (9), pp.
2493-2509;
Gungor, Z., Arikan, F., Application of fuzzy decision making in part-machine
grouping (2000) Int J Prod Econ, 63, pp. 181-193;
problem (1996) Comp Industrial Eng, 30 (4), pp. 941-955;
J Prod Res, 28, pp. 233-243;
Kuo, R.J., Chi, S.C., Teng, P.W., Generalized part family formation through fuzzy
self-organizing feature map neural network (2001) Comp Industrial Eng, 40, pp. 79-
100;
Leem, C.W., Chen, J.J., Fuzzy-set-based machine-cell formation in cellular
manufacturing (1996) J Intell Manufact, 7, pp. 355-364;
Liao, T.W., Classification and coding approaches to part family formation under a
fuzzy environment (2001) Fuzzy Sets Syst, 122, pp. 425-441., 2001;
manufacturing cells (1999) Int. J Prod Econ, 60-61, pp. 421-426;
systems (2001) Comp Indust Eng, 39, pp. 125-144;
Pai, P.F., Lee, E.S., Parts clustering by self organizing map neural network in a
fuzzy environment (2001) Comp Math Appl., 421 (2), pp. 179-188;
27 (7), pp. 1161-1165;
Su, C.T., A fuzzy approach for part family formation (1995) Proceedings of the IEEE
Industry Application Society 30th Annual Meeting, (OCTOBER), pp. 289-292., Orlando,
Florida;
Szwarc, D., Rajamani, D., Bector, C.R., Cell formation considering demand and
machine capacity (1997) Int J Prod Res, 13, pp. 134-147;
Tsai, C.C., Chu, C.H., Barta, A.T., Fuzzy linear programming approach to
manufacturing cell formation (1994) IEEE World Congress on Computational
Intelligence, 2, pp. 1406-1411;
mathematics (1989) Int J Prod Res, 27 (9), pp. 1637-1651;
in cellular manufacturing (2001) Comp Indust Eng, 39, pp. 1-17;
Zhang, C., Wang, H., Concurrent formation of part families and machine cells based
on the fuzzy set theory (1992) J Manufact Syst, 11 (1), pp. 61-67
CORRESPONDENCE ADDRESS: Pai, P.-F.; Department of Industrial Engineering, Da-Yeh
University, Chang-Hwa 515, Taiwan; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Sun, D., Lin, L., Batta, R.

7403969095;26643139300;35579035100;
Cell formation using tabu search
0029342673&partnerID=40&md5=feeea790df2342829f7dc83db658aee3
AFFILIATIONS: Department of Industrial Engineering, State University of New York at

Buffalo, Amherst, NY 14260, United States
ABSTRACT: We present a tabu search-based cell formation algorithm in this paper.
The cell formation problem studied here is to group machines into cells such that
the material movement between cells is minimized. By using a weighted graph to
represent the material movement between machines, we model the cell formation
problem as a graph partition problem. The algorithm solves this problem through
improving a cell configuration using the tabu search technique. A binary-tree data
structure and a look-ahead scheme are developed for the algorithm to increase its
efficiency and effectiveness. Our computational results show that this algorithm is
capable of generating very good cell configurations in moderate computational time.
© 1995.
INDEX KEYWORDS: Algorithms; Computational methods; Data structures; Problem
solving; Trees (mathematics), Cell formation algorithm; Graph partition problem;
Material movement; Tabu search, Production engineering
CORRESPONDENCE ADDRESS: Sun, D.; Department of Industrial Engineering, State
University of New York at Buffalo, Amherst, NY 14260, United States
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Liu, C.-M., Wu, J.-K.

7409792517;57067185500;
Machine cell formation: Using the simulated annealing algorithm
349. Cited 9 times.
0011746454&doi=10.1080%2f09511929308944585&partnerID=40&md5=834d1f80d4160fe861e4a9e
6a8f87519
DOI: 10.1080/09511929308944585
AFFILIATIONS: Institute of Industrial Engineering, National Tsing-Hua University,
Hsinchu, Taiwan
ABSTRACT: The application of the simulated annealing algorithm to machine cell
formation problems is presented in this paper. This general algorithm is not
influenced by the initial machine-component incidence matrix and has the potential
of being extended to solve more complex problems. The concept of penalty costs is
introduced into the objective functions to prevent the solution from violating
given constraints. Two cooling schedules for the simulated annealing algorithm are
adopted to detect the applicability of the algorithm to machine cell formation
problems. The results show that the simulated annealing algorithm is able to find a
near-optimal solution within a polynomial time even for the large-scale problems of
machine cell formation. © 1993 Taylor & Francis Group, LLC.
(1), pp. 101-113;
Ballakur, A., Strudel, H.J., A within-cell utilization based heuristic for
Research, 25 (5), pp. 639-665;
Bhat, M.Y., Haupt, A., An efficient clustering algorithm. Ieee transactions on
systems (1976) Man and Cybernetics, 6, pp. 61-64;
Cerny, Y., Thermodynamical approach to the travelling salesman problem: An
efficient simulation algorithm (1985) Journal of Optimization Theory and
Research, 24 (2), pp. 451-464;
Research, 24 (5), pp. 1221-1233;
formation of partfamilies and machine-ceijs (1987) International Journal of
Chu, C.H., Cluster analysis in manufacturing cellular formation (1989) OMEGA:
International Journal of Management Sciences, 17 (3), pp. 289-295;
De Witre, J., The use of similarity coefficients in production flow analysis (1980)
International Journal Oj Production Research, 18 (4), pp. 503-514;
Dutra, S.P., Lashikari, R.S., Nadoli, G., Ravi, L., A heuristic procedure for
determining manufacturing families from design-based grouping for flexible
manufacturing systems (1986) Computers and Industrial Engineering, 10 (3), pp. 193-
201;
Studies, pp. 301-315., A. Kusiak (Editor), (Amsterdam: Elsevier;
manufacturing systems (1981) Manufacturing Engineering Transactions, p. 503;
systems-an integer programming approach (1989) Intemational Foumol of Produclion
Research, 27 (9), pp. 1465-1473;
cellular manufacturing systems-an integer programming approach (1991) Computers and
Industrial Engineering, 20 (1), p. 111;
Harhalakis, G., Nagi, R., Roth, J.M., An efficient heuristic in manufacturing cell
Jain, A.K., Kasilingam, R.G., Bhole, S.D., Cell formation in flexible manufacturing
systems under resource constraints (1990) Computers and Industrial Engineering, 19
(1-4), pp. 437-441;
using a rank order clustering algorithm (1980) International Joumal of Production
Research, 18 (2), pp. 213-232;
Review and extension (1982) International Joumal of Production Research, 20 (2),
pp. 117-133;
Kirkpatrick, S., Gelatf, C.D., Vecchi, M.P., Optimization by simulated annealing
(1983) Science, 220, pp. 671-680;
manufacturing (1987) International Joumal of Production Research, 25 (12), pp. 715-
1728;
manufacturing systems (1986) European Joumal of Operational Research, 24 (2), pp.
387-397;
Joumal of Manufacturing Systems, 6 (2), pp. 117-124;
Lenstra, Clustering a data array and the travelling salesman problem (1974)
Logendran, R., A workload based model for minimizing total imercell and intracell
moves in cellular manufacturing (1990) Intemational Joumal of Production Research,
28 (5), pp. 913-925;
McCormick, W.T., Schweitzer, P.J., White, P.W., Problem decomposition and data
1009;
Metropolis, N., Rosenhluth, A.W., Rosenhluth, M.N., Teller, A.H., Teller, E.,
Equation of state calculations by fast computing machines (1953) Journal of
Chemical Physics, 21, pp. 1087-1092;
Purcheck, G.F.K., Machine-component group formation: An heuristic method for
flexible production cells and flexible manufacturing systems (1985) International
567-579;
improper machine assignment in group technology applications (1989) Intemational
Seifodoini, H., Duplication process in machine cells formation in group technology
(1989) IIE Transactions, 21 (4), pp. 382-388;
handling cost in machinecomponent grouping (1987) IIE Transactions, 19 (3), pp.
266-270;
Slagle, J.R., Chang, C.L., Heller, S.R., A clustering and data reorganizing
algorithm (1975) IEEE Transactions on Systems, Man and Cybernetics, 5, p. 125;
Srinivasan, G., Narendran, T.T., Mahadevan, B., An assignmen i model for the part-
Research, 28 (1), pp. 145-152;
Steuoel, H.J., Ballakur, A., A dynamic programming based heuristic for machine
Engineering, 12 (3), pp. 215-222;
Tahucanon, M.T., Ojha, R., Icrma-a heuristic approach for intercell flow reduction
in cellular manufacturing systems (1987) Material Flow, 4 (3), pp. 189-197;
(1), pp. 84-97;
Van Laarhoven, P.J.M., Aarts, E.H.L., (1987) Simulated Annealing: Theory and
Applications, , D. Reidel, Hingham, MA);
24 (2), pp. 387-400;
Research, 28 (11), pp. 2075-2084;
Waghodekar, P.H., Sahu, S., Machinecomponent cell formation in group technology:
group technology (1989) International Joumal of Production Research, 27 (12), pp.
2053-2062;
Wu, S.P., Chang, P.L., The synthetic index algorithm: An improved cluster analysis
procedure for machine cell formation (1990) Intemational Joumal of Computer
Integrated Manufacturing, 3 (5), pp. 299-313
CORRESPONDENCE ADDRESS: Liu, C.-M.; Institute of Industrial Engineering, National
Tsing-Hua University, Hsinchu, Taiwan
ISSN: 0951192X
SOURCE: Scopus
Seifoddini, H.
7003581042;
Machine grouping - Expert systems. Comparison between single linkage and average
linkage clustering techniques in forming machine cells
8352%2888%2990088-5&partnerID=40&md5=79689323df2426e67798ed7f6665e8fb
DOI: 10.1016/0360-8352(88)90088-5
AFFILIATIONS: Industrial and Systems Engineering Department, University of
Wisconsin, Milwaukee, United States
ABSTRACT: This paper compares the single linkage and average linkage clustering
techniques when applied to the machine cells formation problem and points out the
advantages and disadvantages of each technique. © 1988.
INDEX KEYWORDS: Industrial Plants--Computer Applications; Productivity--Computer
Applications, Cellular Manufacturing Systems; Linkage Clustering Techniques; Slink
Algorithm, Computer Programming
REFERENCES: Anderberg, (1973) Cluster Analysis for Applications, , Academic press,
N.Y;
Ballakur, Steudel, Cellular Manufacturing Systems (1987) Inter. Jor. Prod. Res.;
Burbidge, Production Flow Analysis (1963) Production Engineer;
Burbridge, (1975) The Introduction of Group Technology, , John Wiley;
Burbidge, A Manual Method of Production Flow Analysis (1977) The Production
Engineer;
Inter. Jor. Prod. Res.;
for Group Technology (1986) Inter. Jor. Prod. Res.;
DeWitte, The Use of Similarity Coefficients in Production Flow Analysis (1980)
King, Nakoranchaiv, Machine-Component Group Formation in Group Technology Review
and Extension (1982) Inter. Jor. Prod. Res.;
Kusiak, The Generalized Group Technology Concept (1987) Inter. Jor. Prod. Res.;
McAuley, Machine Grouping for Efficient Production (1972) Production Engineer;
McCormick, Schweitzer, White, Problem Decomposition and Data Reorganization by
Clustering Techniques (1972) Operations Research;
Mitrofanov, S.P., “Scientific Basis of Group Production,” Proceedings of 1st
International Seminar on Group Technology, Turin, Italy; Rajagopalan, Batra, Design
of Cellular Production Systems: A Graph-Theoretic Approach (1982) Inter. Jor. Prod.
Res.;
Seifoddini, (1984) Cost-Based Machine-Component Grouping Model: in Group
Technology, , Unpublished Ph.D. Dissertation, Oklahoma State University;
Seifoddini, Wolfe, Application of the Similarity Coefficient Method in Machine
Cells Formation in Group Technology (1986) American Institute of Industrial
Engineers (AIEE) Transactions;
Seifoddini, Wolfe, Selection of the Threshold Value Based on Material Handling Cost
in Group Technology Applications (1987) AIIE Transactions;
Sneath, Sokal, (1973) Numerical Taxonomy, , Freeman and Company;
Vannelli, Ravikumar, A Method for Finding Minimal Bottleneck Cells for Grouping
Part-Machine Families (1987) Inter. Jor. Prod. Res.;
Waghodekar, Sahu, Machine-Component Cell Formation in Group Technology: MACE (1984)
Wemmerlov, Hyer, Procedure for Part-Family/Machine Group Identification Problem in
Cellular Manufacturing (1986) Journal of Operations Management
CORRESPONDENCE ADDRESS: Seifoddini, H.; Industrial and Systems Engineering
Department, University of Wisconsin, Milwaukee, United States
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Ramabhatta, V., Nagi, R.

6506732591;7003354438;
An integrated formulation of manufacturing cell formation with capacity planning
and multiple routings
(1998) Annals of Operations Research, 77, pp. 79-95. Cited 32 times.
0032384755&partnerID=40&md5=b0ef52d1ea5aa0a089da6b56bf3a1e54
AFFILIATIONS: Department of Industrial Engineering, 342 Bell Hall, Stt. Univ. of

New York at Buffalo, Buffalo, NY 14260, United States
ABSTRACT: This paper presents an integrated mathematical programming formulation of
the manufacturing cell formation problem introduced by Nagi et al. The formulation
incorporates critical production planning issues that include long-term projected
production requirements, resource capacity constraints, functionally identical
machines and alternative process plans in the cell formation problem, with a common
objective of minimizing the resulting intercell material handling effort. This
problem is NP-hard. The previous work presented a heuristic solution based on
decomposing the integrated problem into capacitated route selection and cell
formation sub-problems that are solved iteratively until convergence. Like all fast
heuristics, the method may suffer from poor solution quality, and non-heuristic
methods cannot address problems of typical industrial dimensions because they would
require exorbitant amounts of computing time. To overcome both these deficiencies,
this paper (i) presents a 0-1 Mixed Integer Linear Programming (MILP) formulation
alternative to the integrated cell formation problem, (ii) based on this
formulation, develops a branch-and-bound procedure that provides improved solutions
compared to those obtained by the heuristic of Nagi et al. (1990), and (iii) makes
possible derivation of lower bounds to assess the quality gap when optimal
solutions are unavailable or require excessive computing time. This work is
important because it allows for better solutions to realistic industrial-sized
problem instances.
AUTHOR KEYWORDS: Branch-and-bound algorithm; Cellular manufacturing; Group
Technology; Manufacturing cell formation; Mixed integer linear programming
REFERENCES: Askin, R., Subramanian, S.B., A cost-based heuristic for Group
Technology configuration (1987) International Journal of Production Research, 25,
pp. 101-113;
Atamani, A., Lashkari, R.S., Caron, R.J., A mathematical programming approach to
Research, 25, pp. 639-665;
Berkelaar, M.R.C.M., Dirks, J.J., ftp://ftp.es.ele.tue.nl/pub/lp\_solve, 1p solve;
Research, 24, pp. 451-464;
Chu, C., Cluster analysis in manufacturing cell formation (1989) Omega, 17, pp.
289-295;
Garey, M.R., Johnson, D.S., (1979) Computers and Intractability: a Guide to the
Theory of NP-Completeness, , Freeman, New York;
Ghosh, S., Mahanti, A., Nagi, R., Nau, D., Manufacturing cell formation by state-
space search (1996) Annals of Operations Research, 65, pp. 35-54;
formation for Group Technology applications (1990) International Journal of
Heragu, S.S., Kusiak, A., (1988) Operations Research, 36, pp. 258-268;
Heragu, S.S., Kusiak, A., Efficient models for the facility layout problem (1991)
International Journal of Operations Research, 53, pp. 1-13;
King, J.R., Machine component grouping production flow analysis: An approach using
Research, 18, pp. 213-232;
Kusiak, A., Chow, W.S., Efficient solving of the Group Technology problem (1987)
Logendran, R., Nudtasomboon, N., Minimizing the makespan of a group scheduling
problem: A new heuristic (1991) International Journal of Production Economics, 22,
pp. 217-230;
considerations in Group Technology applications (1990) International Journal of
Group Technology (1986) IIE Transactions, 18, pp. 271-277;
Singh, N., Design of cellular manufacturing systems: An invited overview (1993)
764;
Vakharia, A.J., Wemmerlöv, U., Design of cellular manufacturing system: A material
flow approach based on operation sequences (1990) IIE Transactions, 22, pp. 84-97;
Vishwanathan, S., Configuring cellular manufacturing systems: A quadratic integer
programming formulation and a simple interchange heuristic (1995) International
CORRESPONDENCE ADDRESS: Ramabhatta, V.; Department of Industrial Engineering, 342
Bell Hall, Stt. Univ. of New York at Buffalo, Buffalo, NY 14260, United States;
ISSN: 02545330
SOURCE: Scopus
Kochikar, V.P., Narendran, T.T.

6603359527;7003728237;
Logical cell formation in FMS, using flexibility-based criteria
(1998) International Journal of Flexible Manufacturing Systems, 10 (2), pp. 163-
182+184. Cited 17 times.
https://www.scopus.com/inward/record.uri?eid=2-s2.0-0032041163&doi=10.1023%2fA
%3a1008049515026&partnerID=40&md5=3bf0e963ba4fb631c284e37ffce00ac0
DOI: 10.1023/A:1008049515026
AFFILIATIONS: Education Department, Infosys Technologies Ltd., Electronics City,
Bangalore, India;
Industrial Engineering Division, Indian Institute of Technology, Madras, India
ABSTRACT: Flexible manufacturing systems often are organized into a cellular
architecture for ease of operation. The formation of these cells sometimes has been
treated as an extension of the conventional cell-formation problem. This paper
argues that, owing to the existence of flexible routing and transfer capabilities,
the cell-formation problem in FMSs should be treated as quite distinct from that in
conventional manufacturing systems and shows that a flexibility-based procedure is
apt for overcoming the deficiencies of earlier forays into this area. Manufacturing
cell flexibility is defined as a composite of three flexibility measures:
producibility, processivity, and transferability. The problem of cell formation is
modeled as flexibility maximization, and a procedure is developed for the
simultaneous formation of machine cells and part families, while heuristically
maximizing within-cell flexibility.
AUTHOR KEYWORDS: Cell formation; Flexible manufacturing systems; Manufacturing
flexibility; Reachability graphs
INDEX KEYWORDS: Cellular manufacturing; Computational complexity; Graph theory;
Heuristic methods; Optimization; Problem solving; Process control; Scheduling;
Automation; Mathematical models; Production control, Cell formation; Manufacturing
flexibility; Reachability graphs; Logical cell formations, Flexible manufacturing
systems
REFERENCES: Al-Qattan, I., Designing flexible manufacturing cells using branch and
bound method (1990) International Journal of Production Research, 28 (2), pp. 325-
336;
Arbib, C., Lucertini, M., Nicolo, F., Workload balancing and part transfer
minimization in FMS (1991) International Journal of Flexible Manufacturing Systems,
3 (1), pp. 5-25., January;
Barad, M., Sipper, D., Manufacturing flexibility - Definitions and petri net
modeling (1988) International Journal of Production Research, 26 (2), pp. 237-251;
Browne, J., Dubois, D., Rathmill, K., Sethi, S., Stecke, K.E., Classification of
flexible manufacturing systems (1984) FMS Magazine, pp. 114-117., April;
Chan, D.Y., Bedworth, D.D., Design of a scheduling system for flexible
pp. 2037-2049;
Hatono, I., Yamagata, K., Tamura, H., Modeling and on-line scheduling of FMS using
stochastic petri nets (1991) IEEE Transactions on Software Engineering, SE-17 (2),
pp. 126-132;
Hutchinson, J., Leong, K., Snyder, D., Yard, P., Scheduling approaches for a random
job shop flexible manufacturing system (1991) International Journal of Production
Research, 29 (5), pp. 1053-1067;
Jain, A.K., Kasilingam, R.G., Bhole, S.D., Joint consideration of cell formation
and tool provision in flexible manufacturing systems (1991) Computers and
Kannan, V.R., Incorporating the impact of learning in assessing the effectiveness
of cell manufacturing (1996) International Journal of Production Research, 34 (12),
pp. 3327-3340;
Kochikar, V.P., Narendran, T.T., A framework for assessing the flexibility of
pp. 2873-2895;
Kumar, R., Kusiak, A., Vanelli, A., Grouping parts and components in flexible
397;
Kusiak, A., The part families problem in FMS (1985) Annals of Operations Research,
3, pp. 279-284;
Labs, W., Cell control - The hardware, the software, the controversies (1989)
Instrumentation and Control Systems, pp. 89-95., August;
Lin, Y.-J., Solberg, J.J., Effectiveness of flexible routing control (1991)
International Journal of Flexible Manufacturing Systems, 3 (1), pp. 189-211.,
January;
Nagi, R., Harhalakis, G., Proth, J.M., Multiple routing and capacity consideration
Research, 28 (12), pp. 2243-2258;
Purcheck, G., Machine-cell formation: A heuristic methodology for flexible
Seidmann, A., On-line scheduling of a robotic manufacturing cell with stochastic
sequence-dependent processing rates (1987) International Journal of Production
Research, 25 (6), pp. 907-924;
Seifoddini, H., Djasseni, M., Threshold value of quality index for formation of
cells (1996) International Journal of Production Research, 34 (12), pp. 3401-3416;
Shafer, S.M., Charnes, J.M., Offsetting lower routing flexibility in cellular
567;
Slack, N., Manufacturing system flexibility - An assessment procedure (1988)
Computer-Integrated Manufacturing Systems, 1 (1), pp. 25-31;
Stecke, K.E., Formulation and solution of nonlinear integer production planning
problems for flexible manufacturing systems (1983) Management Science, 29 (3), pp.
273-288;
Stecke, K.E., A hierarchical approach to solving machine grouping and loading
problems in flexible manufacturing systems (1986) European Journal of Operational
Research, 24, pp. 369-378;
Stecke, K.E., Procedures to determine part mix ratios for independent demands in
flexible manufacturing systems (1992) IEEE Transactions on Engineering Management,
EM39 (4), pp. 359-369;
Stecke, K.E., Kim, I., A study of FMS part type selection approaches for short-term
production planning (1988) International Journal of Flexible Manufacturing Systems,
1 (1), pp. 7-29;
Stecke, K.E., Kim, I., A flexible approach to part type selection in flexible flow
systems using part mix ratios (1991) International Journal of Production Research,
29 (1), pp. 53-75., January;
Upton, D.H., Barash, M.M., A grammatical approach to routing flexibility in large
manufacturing systems (1988) Journal of Manufacturing Systems, 7 (3), pp. 209-222;
Ventura, J.A., Chen, F., Wut, C.-H., Grouping parts and tools in flexible
Wilhelm, W.E., Shin, H.-M., Effectiveness of alternative operations in an FMS
Yao, D.D., Pei, F.F., Flexible parts routing in manufacturing systems (1990) IIE
Transactions, 22 (1);
Zhang, C., Wang, H.-P., Concurrent formation of part families and machine cells
using fuzzy set theory (1992) Journal of Manufacturing Systems, 11 (1), pp. 61-67
CORRESPONDENCE ADDRESS: Kochikar, V.P.; Education Department, Infosys Technologies
Ltd., Electronics City, Bangalore, India
ISSN: 09206299
CODEN: IFMSE
ABBREVIATED SOURCE TITLE: Int J Flexible Manuf Syst
SOURCE: Scopus
Cheng, C.H., Gupta, Y.P., Lee, W.H., Wong, K.F.

8417752800;7102638805;56165058900;7404759311;
A TSP-based heuristic for forming machine groups and part families
78 times.
0032071783&doi=10.1080%2f002075498193345&partnerID=40&md5=9ad7d1b2b12517534511d8c3b
3ab6172
DOI: 10.1080/002075498193345
AFFILIATIONS: Department of Systems Engineering and Engineering Management, The
Chinese University of Hong Kong, Shatin, NT, Hong Kong, Hong Kong;
College of Business and Administration, The University of Colorado at Denver,
Denver, CO, 80217, United States
ABSTRACT: Cellular manufacturing has been proposed as a layout approach to improve
manufacturing efficiency and productivity. In implementing cellular manufacturing,
parts are grouped into part families based on their similarity in manufacturing,
and machines are grouped into machine cells to reduce intercellular movement of
parts. To model the cellular manufacturing problem, a machinepart incidence matrix
is often used. A cell formation algorithm must produce machine cells and associated
part families to minimize intercellular movement of parts. In this paper, the cell
formation problem is formulated as a travelling salesman problem (TSP) and a
solution methodology based on genetic algorithms (GAs) is proposed to solve the
TSP-cell formation problem. The proposed algorithm is compared very favourably to a
well-known algorithm available in the literature. © 1998 Taylor & Francis Group,
LLC.
INDEX KEYWORDS: Computational methods; Genetic algorithms; Mathematical models;
Matrix algebra; Problem solving; Process control; Production control; Productivity;
Scheduling, Machine part incidence matrix; Travelling salesman problem (TSP),
REFERENCES: Askin, R.G., Cresswell, S.H., Goldberg, J.B., Vakharia, A.J., A
Hamiltonian path approach to reordering the part-machine matrix for cellular
1100;
Boe, W.J., Cheng, C.H., A close neighbour algorithm for designing a cellular
manufacturing system (1991) International Journal of Production Research, 29, pp.
2097-2116;
Research, 24, pp. 451-464;
Chandrasekharan, M.P., Rajagopalan, R., Modroc-an extension of rank order
Research, 24, pp. 1221-1233;
293-318;
Omega, 20, pp. 493-501;
Cheng, C.H., A tree search algorithm for designing cellular manufacturing system
(1993) Omega, 21, pp. 489-496;
Davis, L., Job shop scheduling with genetic algorithms (1985) Proceedings of the
First International Conference on Genetic Algorithms., pp. 136-140., San Mateo, CA:
Morgan Kaufmann;
Glover, F., Artificial intelligence, heuristic frameworks and tabu search (1990)
Managerial and Decision Economics, 11, pp. 365-378;
Learning, , Reading, MA: Addison-Wesley);
Goldberg, D.E., Lingle, R., Alleles loci and the tsp (1985) Proceedings of the
California (CA: Morgan Kaufmann;
Gunasingh, R.K., Lashkari, R.S., Machine grouping problem in cellular manufacturing
Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P., Configuration space analysis of
traveling salesman problems (1985) Journal Physique, 46, pp. 1277-1292;
397;
1728;
Kusiak, A., The part-families problem in flexible manufacturing systems (1985)
2633-2646;
Lenstra, J.K., Kan Rinnooy, A.H.G., Some simple applications of the travelling
Lin, S., Kernighan, B.W., An effective heuristic algorithmfor travelling salesman
problem (1973) Operation Research, pp. 498-516;
Martin, O., Otto, S.W., Felten, E.W., Large-step Markov chains for the travelling
salesman problem (1991) Complex Systems, 2, pp. 299-326;
Meauley, A., Machine grouping for efficient production (1972) Production
Programs, , Hong Kong: Springer);
Miliotis, P., Using cutting planes to solve the symmetric travelling salesman
problem (1978) Mathematical Progamming, 15, pp. 177-188;
for solving the cell formation in group technology (1991) Journal of Operations
implementation (1985) Omega, 13, pp. 381-391;
Oliver, I.M., Smith, D.J., Holland, J.R.C., A study of permutation crossover
operators on the traveling salesman problem (1987) Proceedings of the Second
International Conference on Genetic Algorithms, pp. 224-230., San Mateo,
California, CA: Morgan Kaufmann;
Rajamani, S.N., Aneja, Y.P., Integrated design of cellular manufacturing systems in
the presence of alternative process plans (1990) International Journal of
Shafer, S.M., Rogers, D.E., Similarity and distance measures for cellular
manufacturing part I: A survey (1993) International Journal of Production Research,
31, pp. 1133-1142;
Shirrish, B., Nigel, J., Kabuka, M.R., A boolean neural network approach for the
travelling salesman problem (1993) IEEE Transaction on Computers, 42, pp. 1271-
1278;
Research, 32, pp. 2149-2158;
Srinivasan, G., Narendran, T.T., Grafics - a non-hierarchical clustering algorithm
463-478;
Decision Science, 21, pp. 416-433;
Whitley, D., The genitor algorithm and selection pressure: Why rank-based
allocation of reproductive trials is best (1989) Proceedings of the Third
California, CA: Morgan Kaufmann;
Whitley, D., Starkweather, T., Fuquay, D.A., Scheduling problems and travelling
salesman: The genetic edge recombination operator (1989) Proceedings of the Third
California, CA: Morgan Kaufmann
CORRESPONDENCE ADDRESS: Gupta, Y.P.; College of Business and Administration, The
University of Colorado at Denver, Denver, CO, 80217, United States
ISSN: 00207543
SOURCE: Scopus
Brusco, M.J., Steinley, D.

7004522283;13905871200;
Exact and approximate algorithms for part-machine clustering based on a
relationship between interval graphs and Robinson matrices
Cited 4 times.
34848922052&doi=10.1080%2f07408170701411393&partnerID=40&md5=10986c74c7a534ebc89de9
dc17834268
DOI: 10.1080/07408170701411393
AFFILIATIONS: Department of Marketing, Florida State University, Tallahassee, FL,
United States;
Department of Psychological Sciences, University of Missouri-Columbia, Columbia,
MO, United States
ABSTRACT: An important manufacturing cell formation problem requires permutations
of the rows (parts) and columns (machines) of a part-machine incidence matrix such
that the reordered matrix exhibits a block-diagonal form. Numerous objective
criteria and algorithms have been proposed for this problem. In this paper, a new
perspective is offered that is based on the relationship between the consecutive
ones property associated with interval graphs and Robinson structure within
symmetric matrices. This perspective enables the cell formation problem to be
decomposed into two permutation subproblems (one for rows and one for columns) that
can be solved optimally using dynamic programming or a branch-and-bound algorithm
for matrices of nontrivial size. A simulated annealing heuristic is offered for
larger problem instances. Results pertaining to the application of the proposed
methods for a number of problems from the literature are presented.
AUTHOR KEYWORDS: Branch and bound; Cellular manufacturing; Dynamic programming;
Facility layout; Interval graphs; Robinson matrix
INDEX KEYWORDS: Algorithms; Dynamic programming; Graphic methods; Matrix algebra;
Plant layout; Simulated annealing, Interval graphs; Part-machine incidence matrix;
Robinson matrix, Cellular manufacturing
Press, New York, NY;
Armour, G.C., Buffa, E.S., A heuristic algorithm and simulation approach to
relative location of facilities (1963) Management Science, 9, pp. 294-309;
Askin, R.G., Creswell, S.H., Goldberg, J.B., Vakharia, A.J., A Hamiltonian path
2097-2116;
Brusco, M.J., Optimal and heuristic methods for the minimum-backtracking row layout
problem (2004) IIE Transactions, 36, pp. 181-189;
Brusco, M.J., Stahl, S., Using quadratic assignment methods to generate initial
permutations for least-squares unidimensional scaling of symmetric proximity
matrices (2000) Journal of Classification, 17, pp. 197-223;
Brusco, M.J., Stahl, S., (2005) Branch-and-Bound Applications in Combinatorial Data
Analysis, , Springer, New York, NY;
Research, 24, pp. 1221-1233;
Crama, Y., Oosten, M., Models for machine-part grouping in cellular manufacturing
Fulkerson, D.R., Gross, O.A., Incidence matrices and interval graphs (1965) Pacific
Journal of Mathematics,., 15, pp. 835-855;
Groover, M.P., (1987) Automation, Production Systems and Computer Integrated
Manufacturing, , Prentice-Hall, Englewood Cliffs, NJ;
Heragu, S.S., Alfa, A.S., Experimental analysis of simulated annealing based
algorithms for the layout problem (1992) European Journal of Operational Research,
57, pp. 190-202;
Kendall, D.G., Incidence matrices, interval graphs, and seriation in archaeology
(1969) Pacific Journal of Mathematics, 28, pp. 565-570;
King, J.R., Nakornchai, V., Machine-component group formation technology: Review
and extension (1982) International Journal of Production Research, 20, pp. 117-133;
Kouvelis, P., Chiang, W.C., Yu, G., Optimal algorithms for row layout problems in
automated manufacturing systems (1995) IIE Transactions, 27, pp. 99-104;
Kumar, K.R., Vanelli, A., Strategic subcontracting for efficient disaggregated
1728;
McCauley, J., Machine grouping for efficient production (1972) Production Engineer,
51, pp. 53-57;
1009;
Picard, J.C., Queyranne, M., On the one-dimensional space allocation problem (1981)
Robinson, W.S., A method for chronologically ordering archeological deposits (1951)
American Antiquity, 16, pp. 293-301;
pp. 285-314;
techniques in forming machine cells (1988) Computers and Industrial Engineering,
15, pp. 210-216;
Suryanarayanan, J.K., Golden, B.L., Wang, Q., A new heuristic for the linear
placement problem (1991) Computers and Operations Research, 18, pp. 255-262;
pp. 84-97
CORRESPONDENCE ADDRESS: Brusco, M.J.; Department of Marketing, Florida State
University, Tallahassee, FL, United States
ISSN: 0740817X
CODEN: IIETD
SOURCE: Scopus
Xambre, A.R., Vilarinho, P.M.

6505827041;23135680400;
A simulated annealing approach for manufacturing cell formation with multiple
identical machines
times.
2217%2802%2900836-6&partnerID=40&md5=d361fcec8785d3f98fbf0048e998758c
DOI: 10.1016/S0377-2217(02)00836-6
AFFILIATIONS: Departamento de Economia, Universidade de Aveiro, Campus de Santiago,
3810-193 Aveiro, Portugal
ABSTRACT: One of the crucial steps in the design of a cellular manufacturing system
is the cell formation problem, which involves grouping the parts into part families
and machines into manufacturing cells, so that parts with similar processing
requirements are manufactured within the same cell. When modelling this problem it
is usually assumed that the specific machine in which each operation is carried out
is known. In a cellular manufacturing system where multiple, functionally
identical, machines are available, a new degree of freedom can be introduced into
this problem - the allocation of the operations to specific machines. In this paper
a mathematical programming model for the cell formation problem with multiple
identical machines, which minimises the intercellular flow, is presented. Due to
the combinatorial nature of this problem a simulated annealing algorithm was
developed to solve it. © 2003 Elsevier B.V. All rights reserved.
AUTHOR KEYWORDS: Cellular manufacturing systems; Manufacturing; Simulated
annealing
INDEX KEYWORDS: Algorithms; Mathematical programming; Problem solving; Simulated
annealing, Block diagonal form (BDF), Cellular manufacturing
algorithms for cell formation (1997) IIE Transactions, 29, pp. 53-67;
742-752;
2601-2614;
Del Valle, A.G., Balarezo, S., Tejero, J., A heuristic workload-based model to form
cells by minimizing intercellular movements (1994) International Journal of
Deutsch, S.J., Freeman, S.F., Helander, M., Manufacturing cell formation using an
improved p-median model (1998) Computers and Industrial Engineering, 34 (1), pp.
135-146;
facilities (1994) International Journal of Production Research, 32 (1), pp. 125-
140;
formation based on a new similarity coefficient which considers alternative routes
during machine failure (1998) Computers and Industrial Engineering, 35, pp. 479-
482;
Science, 220 (4598), pp. 671-680;
Kusiak, A., The part families problem in Flexible Manufacturing Systems (1985)
Seifoddini, H., Hsu, C.-P., Comparative study of similarity coefficients and
clustering algorithms in cellular manufacturing (1994) Journal of Manufacturing
Systems, 13 (2), pp. 119-127;
technology using minimum spanning tree (1994) International Journal of Production
Research, 32 (9), pp. 2149-2158;
pp. 2185-2207;
formation (1990) Journal of Manufacturing Systems, 9 (1), pp. 55-68;
(14), pp. 3335-3357;
Wu, N., Salvendy, G., An efficient heuristic for the design of cellular
manufacturing systems with multiple identical machines (1999) International Journal
of Production Research, 37 (15), pp. 3519-3540
CORRESPONDENCE ADDRESS: Xambre, A.R.; Departamento de Economia, Universidade de
Aveiro, Campus de Santiago, 3810-193 Aveiro, Portugal; email: [email protected]
ISSN: 03772217
CODEN: EJORD
SOURCE: Scopus
Islam, K.M.S., Sarker, B.R.

26651826300;7004982967;
A similarity coefficient measure and machine-parts grouping in cellular
times.
0034651058&doi=10.1080%2f002075400189374&partnerID=40&md5=0d21f037c9f9e19d8894d52cc
cc19525
DOI: 10.1080/002075400189374
AFFILIATIONS: Dept. of Indust. and Mfg. Syst. Eng., Louisiana State University,
Baton Rouge, LA 70803-6409, United States
ABSTRACT: For more than three decades, similarity coefficient measures-one of the
important tools for solving group technology problems-have gained the attention of
the research community in cellular manufacturing systems. A new similarity
coefficient measure that uses a set of important characteristic properties for
grouping is developed here for use as an intermediate tool to form cohesive cells.
A mathematical model that uses this similarity coefficient for optimally solving
the cell-formation problems in cellular manufacturing is developed. A heuristic
procedure that improves the optimal methodology in term of solution capability of
the large instances is devised for an efficient solution. Both the optimal
methodology and the heuristic are applied to some well-known problems from
literature to compare the grouping efficiencies. The similarity coefficient and the
solution methodologies developed are able to solve the cell formation problems
efficiently.
INDEX KEYWORDS: Group technology; Heuristic methods; Machine components;
Mathematical models; Problem solving, Machine-parts grouping, Cellular
manufacturing
REFERENCES: Anderbero, M.R., (1973) Cluster Analysis for Applications, pp. 84-85.,
New York: Academic Press;
Ang, C.L., Willey, P.C.T., A comparative study of the performance of pure and
hybrid group technology manufacturing systems using computer simulation technique
Askin, R.G., Subramaniam, S.P., A cost based heuristic for group technology
Baroni-Urbani, C., Buser, M.W., Similarity of binary data (1976) Systematic

Zoology, 25, pp. 251-259;
Bishop, Y.M.M., Fienberg, S.F., Holland, P.W., (1975) Discrete Multivariate
Analysis: Theory and Practice, , Cambridge, MA: MIT Press;
The minimum-cost machine-part cell formation problem (1996) International Journal
Chandrasekharan, M.P., Rajagopalan, R., An ideal seed non-hierarchical algorithm
for cellular manufacturing (1986) International Journal of Production Research, 24,
pp. 451-464;
MODROC: An extension to rank order clustering for group technology (1986)
ZODIAC: An algorithm for concurrent formation of part-families and machine-cells
Groupability: An analysis of the properties of binary data matrices for GT (1989)
Holley, J.W., Guilford, J.P., A note on the G index of agreement (1964) Educational
Faud. Sci. Nat., 44, pp. 223-270;
Research, 18, pp. 213-232;
117-133;
Kusiak, A., An expert system for group technology (1987) Industrial Engineering,
19, pp. 56-61;
The generalized group technology concept (1987) International Journal of Production
Research, 25, pp. 561-569;
technology problems (1992) International Journal of Production Research, 30, pp.
2633-2646;
as applied to the group technology configuration problem (1997) OMEGA,
Ng, S.M., On the characterization and measure of machine cells in group technology
Ng, S.M., Lin, T.L., (1994) On the effectiveness of the measures in group
technology, , Working paper, Department of ISMT, Hong Kong University of Science
and Technology, Hong Kong, China;
Rogers, D.J., Tanimoto, T.T., A computer programming for classical plants (1960)
Science, 132, pp. 1115-1118;
Romesburg, H.C., (1984) Cluster Analysis for Researchers, pp. 142-162., Belmont,
CA: Lifetime Learning Publications, Wadsworth, Inc;
Sarker, B.R., The resemblance coefficients in group technology: A survey and com
parative study of relational matrices (1996) Computers and Industrial Engineering,
30, pp. 103-116;
Sarker, B.R., Balan, C.V., Cell formation with operations times for even
distribution of workloads (1996) International Journal of Production Research, 34,
pp. 1447-1468;
Sarker, B.R., Islam, K.M.S., Relative performance of similarity or dissimilarity
measures in cellular manufacturing systems (1999) Computers and Industrial
Engineering, , submitted for publication;
new weighted grouping efficiency measure (1999) IIE Transactions on Design and
Manufacturing, , to be published;
routings (1998) Journal of the Operational Research Society, 49, pp. 953-965;
pp. 285-314;
Sarker, B.R., Xu, Y., Operations sequences-based cell formation methods: A critical
survey (1998) Production Planning & Control, 9, pp. 771-783;
Designing multi-product lines in cellular manufacturing: Material flow control
based on operation sequences (1999) IIE Transactions on Operations Engineering, ,
to be published;
Sarker, B.R., Wilhelm, W.E., Hogg, G.L., Locating sets of identical machines in a
linear layout (1998) Annals of Operations Research, 77, pp. 183-207;
versus Jaccard's similarity coefficient (1991) Proceedings of the 13th Annual
Conference on Computers and Industrial Engineering, 21, pp. 263-266;
Research, 31, pp. 1133-1142;
Similarity and distance measures for cellular manufacturing. Part II. An extension
and comparison (1993) International Journal of Production Research, 31, pp. 1315-
1326;
and Control, , London, UK: Chapman and Hall;
Sneath, P.H.A., Some thoughts on bacterial classification (1957) Journal of General
The application of computers to taxonomy (1957) Journal of General Microbiology,
17, pp. 201-226;
Sneath, P.H.A., Sokal, R.R., (1973) Numerical Taxonomy, pp. 130-137., San
Francisco: W.H. Freeman;
relationship (1984) University of Kansas Science Bulletin, 38, pp. 1409-1438;
Research, 28, pp. 145-152;
24, pp. 387-400;
Waghodekar, P.H., Sahu, S., Machine component cell formation in group technology,
median model and a comparative study (1997) International Journal of Production
Research, 35, pp. 1259-1286;
Wei, J.C., Kern, G.M., Commonality analysis: A linear clustering algorithm for
2062
CORRESPONDENCE ADDRESS: Islam, K.M.S.; Dept. of Indust. and Mfg. Syst. Eng.,
Louisiana State University, Baton Rouge, LA 70803-6409, United States; email:
[email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Rafiei, H., Rabbani, M., Gholizadeh, H., Dashti, H.

27967949000;57208701862;55780054300;36452222000;
A novel hybrid SA/GA algorithm for solving an integrated cell formation–job
scheduling problem with sequence-dependent set-up times
(2016) International Journal of Management Science and Engineering Management, 11
(3), pp. 134-142. Cited 7 times.
85029909524&doi=10.1080%2f17509653.2014.1003109&partnerID=40&md5=6ee1ff73fd06c05658
a651008dd82103
DOI: 10.1080/17509653.2014.1003109
AFFILIATIONS: School of Industrial and Systems Engineering, College of Engineering,
ABSTRACT: Cell formation problems attempt to assign machines and products to
manufacturing cells so as to minimize inter-cell moves, in which some other aspects
of the manufacturing system, such as time of order delivery, have been mostly
neglected. To fill the gap, this paper addresses the cell formation problem and job
scheduling simultaneously. To this end, a mixed integer nonlinear program is
proposed to address issues related to both cell formation and job scheduling in a
job shop layout. The proposed model minimizes the costs of operations and
transportation in a single-period setting, since the problem considered is a
strategic problem. Moreover, a hybrid simulated-annealing/genetic (SA/GA) algorithm
is developed to cope with the complexity of the proposed model. Finally, numerical
experiments are reported that validate the performance of the hybrid algorithm
developed. © 2015 International Society of Management Science and Engineering
Management.
Group scheduling; Simulated annealing
REFERENCES: Allison, J.D., Combining Petrov’s heuristic and the CDS heuristic in
group scheduling problems (1990) Computers & Industrial Engineering, 19, pp. 457-
461;
Cheng, R., Gen, M., Tsujimura, Y., A tutorial survey of job-shop scheduling
problems using genetic algorithms – Part I: Representation (1996) Computers &
Cheng, R., Gen, M., Tsujimura, Y., A tutorial survey of job-shop scheduling
problems using genetic algorithms – Part II: Hybrid genetic search strategies
Chu, C.-H., Tsai, C.-C., A heuristic genetic algorithm for grouping manufacturing
cells (2001) Proceedings of the IEEE Congress on Evolutionary Computation 27–30 May
2001, 1, pp. 310-317., Seoul, South Korea;
Economics, 103, pp. 767-783;
63, pp. 842-854;
systems with scheduling considering stochastic processing time (2009) The
formation design: Benders’ decomposition approach (2011) Expert Systems with
Goldberg, D.E., Holland, J.H., Genetic algorithms and machine learning (1988)
Machine Learning, 3, pp. 95-99;
Holland, J.H., Adaptation in Natural and Artificial Systems (1975) An Introductory
Analysis with Applications to Biology, Control, and Artificial Intelligence, , Ann
Arbor, MI: University of Michigan Press;
Research, 33, pp. 263-283;
85;
Kusiak, A., (1990) Intelligent Manufacturing Systems, 448p., Old Tappan, NJ:
Prentice Hall;
Logendran, R., Nudtasomboon, N., Minimizing the makespan of a group scheduling
problem: A new heuristic (1991) International Journal of Production Economics, 22,
pp. 217-230;
Low, C., Wu, T.-H., Hsu, C.-M., Mathematical modelling of multi-objective job shop
scheduling with dependent setups and re-entrant operations (2005) The International
Journal of Advanced Manufacturing Technology, 27, pp. 181-189;
Programs, , Berlin: Springer;
Oysu, C., Bingul, Z., Application of heuristic and hybrid-GASA algorithms to tool-
path optimization problem for minimizing airtime during machining (2009)
Engineering Applications of Artificial Intelligence, 22, pp. 389-396;
Ponnambalam, S.G., Reddy, M.M., A GA-SA multiobjective hybrid search algorithm for
integrating lot sizing and sequencing in flow-line scheduling (2003) International
pp. 2308-2316;
Rafiei, H., Rabbani, M., Dashti, H., Nourmohammadzadeh, A., Cell formation problem
with alternative process plans and alternative routes considering defect rate
(2013) International Journal of Scientific & Engineering Research, 4, pp. 1817-
1823;
Reeves, C.R., (1993) Modern Heuristic Techniques for Combinatorial Problems, , New
York, NY: Wiley;
Roach, A., Nagi, R., A hybrid GA-SA algorithm for just-in-time scheduling of multi-
level assemblies (1996) Computers & Industrial Engineering, 30, pp. 1047-1060;
231-241;
Vaithianathan, R., McRoberts, K.L., On scheduling in a GT environment (1982)
Wang, L., Zheng, D., An effective hybrid optimization strategy for job-shop
scheduling problems (2001) Computers & Operations Research, 28, pp. 585-596;
181, pp. 156-167;
Zhang, C., Li, P., Rao, Y., Li, S., A new hybrid GA/SA algorithm for the job shop
(2005) Proceedings of the 5Th European Conference on Evolutionary Computation in
Combinatorial Optimization (Evocop) 30 March–1 April 2005, 3448, pp. 246-259.,
Lausanne, Switzerland, Lecture Notes in Computer Science, Berlin: Springer;
CORRESPONDENCE ADDRESS: Rabbani, M.; School of Industrial and Systems Engineering,
ISSN: 17509653
ABBREVIATED SOURCE TITLE: Int. J. Manage. Sci. Eng. Manage.
SOURCE: Scopus
Onwubolu, G.C., Songore, V.

7003469218;6507822382;
A tabu search approach to cellular manufacturing systems
0034161077&doi=10.1080%2f095372800232351&partnerID=40&md5=5b77e18f81685e25f6a45877c
c452414
DOI: 10.1080/095372800232351
AFFILIATIONS: Olivine Industries, P.O. Box 797, Harare, Zimbabwe;
Department of Industrial Engineering, National University of Science and
Technology, P.O. Box AC 939, Bulawayo, Zimbabwe
ABSTRACT: A tabu search metaheuristic-based cell formation procedure is presented
in this paper. The cell formation problem solved here is to group machines and
part-families simultaneously into cells so that intercellular movements are
minimized. An option for considering the minimization of cell load variation is
included and another which combines minimization of intercellular movements and
cell load variation exists. The algorithm solves this problem through improving a
cell configuration using the tabu search metaheuristic. The designer is allowed to
specify the number of cells required a priori and impose lower and upper bounds on
cell size. This makes the tabu search scheme flexible for solving the cell
formation problems, The solution procedure was found to perform well on tested
large-scale problems and published data sets. the results of computational tests
presented are very encouraging. © 2000, Taylor & Francis Group, LLC. All rights
reserved.
AUTHOR KEYWORDS: Cellular manufacturing; Group technology; Metaheuristics; Tabu
search
INDEX KEYWORDS: Algorithms; Costs; Group technology; Heuristic methods; Industrial
research; Planning; Problem solving, Tabu search, Cellular manufacturing
REFERENCES: Boctor, F.F., A linear formulation of the machine part cell formation
clustering of group technology (1986) International Journal of Production Research,
24, pp. 1221-1233;
Research, 24, pp. 451-464;
Cheng, C.H., A tree search algorithm for designing a cellular manufacturing system
(1993) Omega, 21, pp. 489-496;
Chevalier, P.W., Group technology as a CAD/CAM integrator in batch manufacturing
Chow, W.W., (1992) Efficient Clustering and Knowledge Based Approach for Solving
Cellular Manufacturing Problems, , PhD dissertation, University of Manitoba,
Canada;
International J Ournal of Production Research, 18, pp. 503-514;
Glover, F., Future paths for integer programming and links with artificial
Glover, F., Tabu search (1989) ORSA Journal on Computing, 1, pp. 190-206;
Glover, F., Tabu search (1990) ORSA Journal on Computing, 2, pp. 190-206;
Glover, F., Laguna, M., Tabu search (1993) Modern Heuristic Techniques for
Combinatorial Problems, pp. 70-150., C. R. Reeves (ed.), London: Blackwell
Scientific;
Groover, M.P., (1987) Automation, Production Systems and Computer Integrated
Manufacturing, , Boston: Kluwer- Nijhoff;
Gunasingh, R.K., Lashkari, R.S., Machine grouping problem in cellular manufacturing
machine-component group decisions in the design of a cellular manufacturing system
Hansen, P., The steepest ascent mildest descent heuristic for combinatorial
programming (1986) Proceedings of Congress on N Umerical Methods in Combinatorial
Programming, , Capri, Italy Academic Press;
Harhalakis, G., Nagi, R., Proth, J.M., Anefficient heuristic in manufacturing cell
Hertz, A., De Werra, D., The tabu search metaheuristic: How we saw it (1990) Annals
of Mathematics and Artificial Intelligence, 1, pp. 111-121;
Hindi, K.S., (1997) Effective and Efficient Solution of the Machine-Part Formation
Problem;
Khator, S.K., Irani, S.A., Cell formation in group technology:a new approach (1987)
using rank order clustering algorithm (1980) International J Ournal of Production
Research, 18, pp. 213-232;
pp. 193-199;
Review and extension (1982) International J Ournal of Production Research, 20, pp.
117-133;
Kumar, K.R., Kusiak, A., Vannelli, A., Grouping parts and components in flexible
397;
Kusiak, A., The generalised group technology concept (1987) International J Ournal
Kusiak, A., Boe, J.W., Cheng, C.H., Designing cellular manufacturing systems:
Branch-and-bound and A approaches (1993) IIE Transactions, 25, pp. 46-56;
of Robotics and Automation, 4, pp. 457-471;
51, pp. 53-57;
1009;
approach (1990) International Journal of Advance Manufacturing, 11, pp. 149-159;
and similarity coeff cients to the GT machine cell formation problem (1989)
Onwubolu, G.C., Redesigning jobshop to cellular manufacturing systems (1998)
International Journal of Integrated M Anufacturing Systems, 9, pp. 377-382;
Rajamani, S.N., Aneja, Y.P., Integrated design of cellular manufacturing systems in
the presence of alternative process plans (1990) International Journal of
Rajagopalan, R., Betra, J.L., Design of cellular production systems - a graph
567-579;
Seifoddini, H.S., (1984) Cost Based Machine-Component Grouping Model: In Group
Technology, , Ph.D. dissertation, Oklahoma State University, Stillwater, Okla;
Seifoddini, H.S., A note on the similarity coefficient method and the problem of
and Control, , London: Chapman & Hall;
Song, S., Hitomi, K., GT Cell formation for minimising the intercell part flow
(1992) International J Ournal of Production Research, 30, pp. 2737-2753;
Srinivasan, G., Narendaran, T.T., Mahadevan, B., An assignment model for the part
Research, 28, pp. 145-152;
24, pp. 387-400;
grouping problem with multiple objectives (1992) Computers in Industrial
Research, 28, pp. 2075-2084;
2062;
Wu, N., Slavendy, G., A modified network approach for the design of cellular
1409-1421
ISSN: 09537287
SOURCE: Scopus
Mak, K.L., Wong, Y.S., Wang, X.X.

7102680226;26637607500;9246057600;
Adaptive genetic algorithm for manufacturing cell formation
0033690389&doi=10.1007%2fs001700070057&partnerID=40&md5=a0d7e0f68a91a984d3db9d436da
2b471
DOI: 10.1007/s001700070057
AFFILIATIONS: Dept. of Indust. and Mfg. Syst. Eng., University of Hong Kong, Hong
Kong, Hong Kong;
Dept. of Indust. and Mfg. Syst. Eng., University of Hong Kong, Haking Wong
Building, Pokfulam Road, Hong Kong, Hong Kong
ABSTRACT: An adaptive genetic approach is proposed as an effective means of
providing the optimal solution to the manufacturing cell formation problem in the
design of cellular manufacturing systems. The proposed approach generates the
optimal formation of machine cells and part families by sequencing the rows and
columns of a machine-part incidence matrix, so as to maximize the bond energy of
the incidence matrix. In order to enhance the performance of the genetic search
process, an adaptive scheme is adopted, so that the genetic parameters can be
adjusted during the genetic search process. The effectiveness of the proposed
approach is demonstrated by applying it to two numerical examples and 11 benchmark
problems obtained from the literature. The computational results show that the
proposed approach provides a powerful but simple means of solving the manufacturing
cell formation problem and thus facilitates the design of cellular manufacturing
systems.
INDEX KEYWORDS: Adaptive algorithms; Cellular manufacturing; Computational methods;
Genetic algorithms; Group technology; Problem solving; Process engineering;
Production engineering, Genetic search process; Machine-part incidence matrix,
Computer integrated manufacturing
REFERENCES: Wemmerlöv, U., Hyer, N.L., Research issues in cellular manufacturing
Opitz, H., (1970) A Classification System to Describe Workpieces, , Pergamon Press,
New York;
Abou-Zeid, M.R., (1973) SAGT: A New Coding and Classification System and the
Systems Analysis of Metal Cutting Operations, , PhD Dissertation, West Lafayette,
IN, Purdue University;
Chu, C.H., Tsai, C.C., A comparison of three array-based clustering techniques for
28, pp. 1417-1433;
603-612;
Kusiak, A., EXGT-S: A knowledge based system for group technology (1988)
Chu, C.H., Tsai, C.C., Manufacturing cell formation in a fuzzy environment (1993)
Proceedings of the National Decision Sciences Institute Conference, pp. 1432-1434;
Arizono, I., Kato, M., Yamamoto, A., Ohta, H., A new stochastic neural network
model and its application to grouping parts and tools in flexible manufacturing
systems (1995) International Journal of Production Research, 33 (6), pp. 1285-1289;
ElMaraghy, H.A., Gu, P., Knowledge-based system for assignment of parts to machines
(1988) International Journal of Advanced Manufacturing Technology, 3, p. 33;
Learning, , Addison-Wesley, Reading;
Chandrasekharan, K.P., Rajagopolan, R., Groupability: An analysis of the properties
Research, 27, pp. 1035-1052;
Srinivasan, G., Narendran, T.T., Mahadevan, B., An assignment model for part-
Research, 28 (1), pp. 145-152;
Engineering, 22 (4), pp. 469-480;
Chandrasekharan, K.P., Rajagopolan, R., ZODIAC - An algorithm for concurrent
formation of part-families and machine cells (1987) International Journal of
CORRESPONDENCE ADDRESS: Mak, K.L.; Univ of Hong Kong, Hong Kong, Hong Kong
PUBLISHER: Springer-Verlag London Ltd., London, United Kingdom
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Seifoddini, H.K.
7003581042;
Single linkage versus average linkage clustering in machine cells formation
applications
8352%2889%2990160-5&partnerID=40&md5=d14f366c144cd2d1c2d2ff93a6d0a95f
DOI: 10.1016/0360-8352(89)90160-5
AFFILIATIONS: University of Wisconsin-Milwaukee, Milwaukee, WI 53201, United States
ABSTRACT: Machine cells formation is the process of identifying families of similar
parts (part-families) and forming the associated machine cells such that one or
more part-families can be processed within a single cell. Among approaches to the
machine cells formation problem the similarity coefficient method (SCM) has the
capability of incorporating manufacturing data such as production volume, sequence
of operations, and processing times into the machine cells formation process.
Single Linkage Clustering (SLINK) and Average Linkage Clustering (ALC) are two
widely used clustering techniques based on SCM. While SLINK is simple and has
minimal computational requirement, it may generate machine cells in which a large
number of machines are far apart in terms of similarity. ALC, on the other hand,
overcomes this problem but requires more computations. This paper discusses the
application of these two techniques to the machine cells formation problem. © 1989.
INDEX KEYWORDS: Industrial Plants--Layout; Materials Handling--Automation;
Production Control, Average Linkage Clustering; Machine Cells Formation; Similarly
Coefficient Method; Single Linkage Clustering, Machine Shops
REFERENCES: Ballakur, Steudel, A within-cell utilization based heuristic for
Research, 25 (5), pp. 638-665;
King, Nakoranchaiv, Machine-component group formation in group technology: review
133;
Kusiak, The generalized group technology concept (1987) Int. J. Prod. Res., 25 (4),
pp. 561-569;
pp. 53-57;
Seifoddini, Wolfe, Application to the similarity coefficient method in machine
cells formation in group technology (1986) Trans. Am. Inst. ind. Engrs, pp. 271-
277;
Anderberg, (1973) Cluster Analysis for Applications, , Academic Press, New York;
Seifoddini, Cost-based machine-component grouping model: in group technology (1984)
Unpublished Ph.D. Dissertation, , Oklahoma State University;
J. Prod. Res., 11 (4), pp. 399-416;
for group technology (1986) Int. J. Prod. Res., 24 (6);
DeWitte, The use of similarity coefficients in production flow analysis (1980)
Waghodekar, Sahu, Machine-component cell formation in group technology: MACE (1984)
Int. J. Prod. Res., 22 (6), pp. 937-948;
Sneath, Sokal, (1973) Numerical Taxonomy, , Freeman, San Francisco;
Burbidge, Production flow analysis (1963) Production Engineer, 42, p. 742;
56, p. 34;
McCormick, Schweitzer, White, Problem decomposition and data reorganization by
clustering techniques (1972) Operations Research, 20, p. 993;
Mitrofanov, Scientific basis of group production (1969) Proc. 1st Int. Sem. on
Group Technology, , Turin, Italy;
Rajagopalan, Batra, Design of cellular production systems A graph-theoretic
Seifoddini, Wolfe, Selection of the threshold value based on material handling cost
in group technology applications (1987) Trans. Am. Inst. ind. Engrs, pp. 260-266;
Vannelli, Ravikumar, A method for finding minimal bottleneck cells for grouping
part-machine families (1986) Int. J. Prod. Res., 24, pp. 387-400;
Wemmerlov, Hyer, Procedures for the part family/machine group identification
problem in cellular manufacturing (1986) Journal of Operations Management, 6 (2),
pp. 125-147
CORRESPONDENCE ADDRESS: Seifoddini, H.K.; University of Wisconsin-Milwaukee,
Milwaukee, WI 53201, United States
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Wu, L., Li, L., Tan, L., Niu, B., Wang, R., Feng, Y.
57202867190;57213397578;57212102999;8977798100;57212108352;54903818400;
Improved similarity coefficient and clustering algorithm for cell formation in
(2019) Engineering Optimization, .
85075942292&doi=10.1080%2f0305215X.2019.1692204&partnerID=40&md5=d46a9fb5429af875e7
c7789ca76c0b58
DOI: 10.1080/0305215X.2019.1692204
AFFILIATIONS: College of Management, Shenzhen University, Shenzhen, China;
College of Management, Shenzhen Institute of Information Technology, Shenzhen,
China;
College of Mathematics and Statistics, Shenzhen University, Shenzhen, China
ABSTRACT: Cell formation plays an important role in the design of cellular
manufacturing systems. Among many methods utilized to solve the cell formation
problem, the similarity coefficient method is the most widely used owing to its
high flexibility and low computational requirement. However, generalized similarity
coefficients ignore material flow, which is closely related to operation sequence
and repeated operations. Moreover, most similarity coefficient-based clustering
algorithms focus on the number of inter-cell movements but disregard distinction of
the movement effort. To overcome these limitations, this study improves the
generalized similarity coefficient method to form part families. In addition, a new
clustering algorithm is presented to assign machines to cells with minimum
intensity of material inter-cell movement, which depends on the frequency,
production volume and difficulty level of inter-cell movement. Experimental results
demonstrate that the proposed method has superior sensitivity and effectiveness for
solving the cell formation problem. © 2019, © 2019 Informa UK Limited, trading as
Taylor & Francis Group.
AUTHOR KEYWORDS: Cell formation; cellular manufacturing system; clustering
algorithm; inter-cell movement; similarity coefficient method
REFERENCES: Alhourani, F., Clustering Algorithm for Solving Group Technology
Problem with Multiple Process Routings (2013) Computers & Industrial Engineering,
66, pp. 781-790;
Alhourani, F., Cellular Manufacturing System Design Considering Machines
Reliability and Parts Alternative Process Routings (2016) International Journal of
Alhourani, F., Seifoddini, H., Machine Cell Formation for Production Management in
Cellular Manufacturing Systems (2007) International Journal of Production Research,
45, pp. 913-934;
Askin, R.G., Zhou, M., Formation of Independent Flowline Cells Based on Operation
Requirements and Machine Capabilities (1998) IIE Transactions, 30 (4), pp. 319-329;
Baroni-Urbani, C., Buser, M.W., Similarity of Binary Data (1976) Systematic

Zoology, 25, pp. 251-259;
Bychkov, I., Batsyn, M., An Efficient Exact Model for the Cell Formation Problem
with a Variable Number of Production Cells (2018) Computers & Operations Research,
91, pp. 112-120;
Choobineh, F., A Framework for the Design of Cellular Manufacturing Systems (1988)
4038-4045;
Feng, H., Da, W., Xi, L., Pan, E., Xia, T., Solving the Integrated Cell Formation
and Worker Assignment Problem Using Particle Swarm Optimization and Linear
Programming (2017) Computers & Industrial Engineering, 110, pp. 126-137;
Goyal, K.K., Jain, P.K., Jain, M., A Comprehensive Approach to Operation Sequence
Similarity Based Part Family Formation in the Reconfigurable Manufacturing System
(2013) International Journal of Production Research, 51 (6), pp. 1762-1776., ;
Gupta, T., Seifoddini, H., Production Data Based Similarity Coefficient for Machine
Component Grouping Decisions in the Design of a Cellular Manufacturing System
Ilić, O.R., An E-Learning Tool Considering Similarity Measures for Manufacturing
Cell Formation (2014) Journal of Intelligent Manufacturing, 25 (3), pp. 617-628;
Imran, M., Kang, C., Lee, Y.H., Jahanzaib, M., Aziz, H., Cell Formation in a
Cellular Manufacturing System Using Simulation Integrated Hybrid Genetic Algorithm
Irani, S.A., Huang, H., (2005), Hybrid Cellular Layouts: New Ideas for Design of
Flexible and Lean Layouts for Jobshops. Columbus, OH: Department of Industrial,
Welding and Systems Engineering, The Ohio State University; Islam, K.M.S., Sarker,
B.R., A Similarity Coefficient Measure and Machine–Parts Grouping in Cellular
pp. 699-720;
Kao, Y., Lin, C.H., A PSO-Based Approach to Cell Formation Problems with
Alternative Process Routings (2012) International Journal of Production Research,
50 (15), pp. 4075-4089;
Kong, T., Seong, K., Song, K., Lee, K., Two-Mode Modularity Clustering of Parts and
Activities for Cell Formation Problems (2018) Computers & Operations Research, 100,
pp. 77-88;
Kumar, C.S., Chandrasekharan, M.P., Grouping Efficacy: A Quantitative Criterion for
Kumar, R., Singh, S.P., A Similarity Score-Based Two-Phase Heuristic Approach to
Solve the Dynamic Cellular Facility Layout for Manufacturing Systems (2017)
Engineering Optimization, 49 (11), pp. 1848-1867;
Kusiak, A., The Part Families Problem in Flexible Manufacturing Systems (1985)
Annals of Operations Research, 3 (6), pp. 277-300;
Li, X., Baki, M.F., Aneja, Y.P., An Ant Colony Optimization Metaheuristic for
Machine-Part Cell Formation Problems (2010) Computers & Operations Research, 37
(12), pp. 2071-2081;
Liu, C., Wang, J., Leung, J.Y.T., Li, K., Solving Cell Formation and Task
Scheduling in Cellular Manufacturing System by Discrete Bacteria Foraging Algorithm
McAuley, J., Machine Grouping for Efficient Production (1972) Production Engineer,
51, pp. 53-57;
Nair, G.J., Narendran, T.T., Case: A Clustering Algorithm for Cell Formation with
Sequence Data (1998) International Journal of Production Research, 36, pp. 157-180;
Niakan, F., Baboli, A., Moyaux, T., Botta-Genoulaz, V., A Bi-objective Model in
Sustainable Dynamic Cell Formation Problem with Skill-Based Worker Assignment
Noktehdan, A., Seyedhosseini, S., Saidi-Mehrabad, M., A Metaheuristic Algorithm for
the Manufacturing Cell Formation Problem Based on Grouping Efficacy (2016)
Nouri, H., Hong, T.S., Development of Bacteria Foraging Optimization Algorithm for
Cell Formation in Cellular Manufacturing System Considering Cell Load Variations
Paydar, M.M., Saidi-Mehrabad, M., A Hybrid Genetic-Variable Neighborhood Search
Rabbani, M., Farrokhi-Asl, H., Ravanbakhsh, M., Dynamic Cellular Manufacturing
System Considering Machine Failure and Workload Balance (2019) Journal of
Industrial Engineering International, 15, pp. 25-40;
Renna, P., Ambrico, M., Design and Reconfiguration Models for Dynamic Cellular
Manufacturing to Handle Market Changes (2015) International Journal of Computer
Romesburg, H.C., (1984) Cluster Analysis for Researchers, pp. 142-162., Belmont,
CA: Lifetime Learning Publications, Wadsworth;
Seifoddini, H., Single Linkage Versus Average Linkage Clustering in Machine Cells
Formation Applications (1989) Computers & Industrial Engineering, 16 (3), pp. 419-
426;
Tian, Y., Li, D., Zhou, P., Wang, L., Coordinated Scheduling of Intercell
Production and Intercell Transportation in the Equipment Manufacturing Industry
(2016) Engineering Optimization, 48 (12), pp. 2046-2063;
Waghodekar, P.H., Sahu, S., Machine-Component Cell Formation in Group Technology:
Won, Y., Kim, S., Multiple Criteria Clustering Algorithm for Solving the Group
Technology Problem with Multiple Process Routings (1997) Computers & Industrial
Engineering, 32 (1), pp. 207-220;
Won, Y., Logendran, R., Effective Two-Phase P-Median Approach for the Balanced Cell
Formation in the Design of Cellular Manufacturing System (2015) International
Wu, L., Suzuki, S., Improved Similarity Coefficient Method for Cell Formation with
Considering Operation Sequences and Times (2014) Innovation and Supply Chain
Wu, L., Suzuki, S., Cell Formation Design with Improved Similarity Coefficient
Method and Decomposed Mathematical Model (2015) International Journal of Advanced
Yilmaz, E., Erol, R., A Mathematical Programming Model for Reconfiguration of
Flexible Manufacturing Cells (2015) Engineering Optimization, 47 (2), pp. 184-203;
Yin, Y., Yasuda, K., Similarity Coefficient Methods Applied to the Cell Formation
Problem: A Taxonomy and Review (2006) International Journal of Production
Economics, 101, pp. 329-352;
Hybridization of Simulated Annealing with Genetic Algorithm for Cell Formation
Problem (2016) International Journal of Advanced Manufacturing Technology, 86 (5-
8), pp. 2243-2254;
Zohrevand, A.M., Rafiei, H., Zohrevand, A.H., Multi-objective Dynamic Cell
Formation Problem: A Stochastic Programming Approach (2016) Computers & Industrial
CORRESPONDENCE ADDRESS: Feng, Y.; College of Management, Shenzhen UniversityChina;
ISSN: 0305215X
CODEN: EGOPA
SOURCE: Scopus
Deep, K., Singh, P.K.

56611638100;55568517790;
Machine cell formation: Using genetic algorithm-based heuristic considering
alternative route
times.
84938796438&doi=10.1504%2fIJOR.2015.070863&partnerID=40&md5=754b3a3eb9f9c39b3c13d16
c5ba78390
DOI: 10.1504/IJOR.2015.070863
AFFILIATIONS: Department of Mechanical Engineering, Guru Jambeshwar University of
Science and Technology, Hissar, 125 001, India;
Department of Mechanical Engineering, Sant Longowal Institute of Engineering and
Technology, Longowal, 148 106, India
ABSTRACT: In this paper, genetic algorithm-based heuristic is proposed to solve the
cell formation problem. The proposed algorithm selects the optimum part route with
certain set of machines before clustering the machine cell. A heuristic is applied
within the genetic algorithm for assignment of parts to independent cell. Further,
trade-off between part inter-cell movement and machine duplication is permitted to
optimise the machine cell design. The proposed model simultaneously considers
relevant production data such as production volume, alternative part process route,
operation sequence and process time. Conventional optimisation method for the
optimal cell formation problem requires significant amount of time and large memory
space. Hence, a genetic algorithm-based heuristic method has been developed for
solving the proposed model. To evaluate the computational performance of the
proposed approach, the algorithm is tested on four benchmark problems collected
from literature. The results approve the effectiveness of the proposed method in
the manufacturing cell formation. © 2015 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Alternative routing; Cellular manufacturing; Genetic algorithm;
Operation sequence
1361-1380;
Akturk, M.S., Turkcan, A., Cellular manufacturing system design using hedonistic
2347;
Technology, 32 (6), pp. 531-536;
Systems, , John Wiley & Sons, New York;
Chandrasekar, K., Venkumar, P., Genetic algorithm approach for integrating cell
formation with machine layout and cell layout (2013) International Journal of
Planning, Design, and Analysis of Cellular Manufacturing Systems, pp. 1-46.,
Kamrani, A.K., Parsaei, H.R. and Liles, D.H. (Eds.), Elsevier, Amsterdam, The
Netherlands;
Felix, T.S., Two stage approach for machine part grouping and cell layout problems
(2006) Robotics and Computer Integrated Manufacturing, 22 (3), pp. 217-238;
Learning, , Addision-Wesley, MA;
pp. 1259-1273;
Holland, J.H., (1975) Adaption in Natural and Artificial Systems, , The University
of Michigan Press, Ann Arbor, MI;
69-85;
50 (15), pp. 4075-4089;
considering alternative routing (1997) Computer Integrated Manufacturing System, 10
(2), pp. 93-107;
Research, 18 (2), pp. 213-232;
cell formation in cellular manufacturing (2004) International Journal of Advanced
Kusiak, A., Cheng, C., A branch and bound algorithm for solving the group
technology problem (1990) Annals of Operation Research, 26 (1-4), pp. 415-431;
cellular manufacturing systems in presence of alternative process plans (1994)
Nagi, R., Harkalakis, G., Proth, J.M., Multiple routings and capacity consideration
Research, 28 (12), pp. 2243-2257;
systems in the presence of alternate process plans (1990) International Journal of
Rajasekharan, R., Peters, B.A., Yang, T., A genetic algorithm for facility layout
design in flexible manufacturing systems (1998) International Journal of Production
Research, 36 (1), pp. 95-110;
Reeves, C., Genetic algorithms (2003) Handbook of Meta Heuristics, pp. 55-82.,
Glover, F. and Kochenberger, G.A. (Eds.), Kluwer Academic, Dordrecht;
Reeves, C.R., Genetic algorithm for the operation researcher (1997) INFORMS Journal
on Computing, 9 (3), pp. 231-250;
Sarker, B.R., Li, K., Simultaneous route selection and cell formation: A mixed
integer programming time-cost model (1997) Integrated Manufacturing Systems, 8 (6),
pp. 374-377., MCB University Press;
Review, evaluation and direction for future research (1998) Computer and Industrial
European Journal of Operation Research, 69 (3), pp. 284-291;
707-720;
Solimanpur, M., Vrat, P., Shankar, R., A multi objective genetic algorithm approach
to design of cellular manufacturing systems (2004) International Journal of
Suel, D.R., (1998) Manufacturing Facility Location Planning and Design, pp. 95-
110., PWS-kent, Boston;
885-906
CORRESPONDENCE ADDRESS: Deep, K.; Department of Mechanical Engineering, Guru
Jambeshwar University of Science and TechnologyIndia
ISSN: 17457645
SOURCE: Scopus
Onwubolu, G.C., Mutingi, M.

7003469218;6507057867;
Genetic algorithm approach to cellular manufacturing systems
(2001) Computers and Industrial Engineering, 39 (1-2), pp. 125-144. Cited 139
times.
8352%2800%2900074-7&partnerID=40&md5=ae770797ec2e2797136a2e3f7dbd4f3a
DOI: 10.1016/S0360-8352(00)00074-7
AFFILIATIONS: Department of Technology, Univ. of the S. Pac., P.O. Box 1168, Suva,
Fiji;
Olivine Industries Ltd., Birmingham/Plymouth Rd., S., Harare, Zimbabwe
ABSTRACT: A genetic algorithm (GA) metaheuristic-based cell formation procedure is
presented in this paper. The cell formation problem solved here is to
simultaneously group machines and part-families into cells so that intercellular
movements are minimized. An option for considering the minimization of cell load
variation is included and another, which combines minimization of intercellular
movements and cell load-variation, exists. The algorithm solves this problem
through improving a cell configuration using the GA metaheuristic. The designer is
allowed to specify the number of cells required a priori and impose lower and upper
bounds on cell size. This makes the GA scheme flexible for solving the cell
formation problems. The solution procedure was found to perform well on tested
large-scale problems and published data sets. Moreover, the proposed procedure
compares very favorably to a well-known algorithm, and another TSP-based heuristic
available in the literature. The results of computational tests presented are very
encouraging.
INDEX KEYWORDS: Computational complexity; Computer integrated manufacturing; Data
reduction; Genetic algorithms; Group technology; Heuristic methods; Problem
solving; Process engineering; Production control, Metaheuristics, Cellular
manufacturing
REFERENCES: Askin, R.G., Subramaniam, S.P., A cost-based heuristic for group
(1), pp. 101-113;
Boe, W.J., Cheng, C.H., A close neighbour algorithm for designing a cellular
2097-2116;
Research, 24 (2), pp. 451-464;
formation of part-families (1987) International Journal of Production Research, 25,
pp. 835-850;
Research, 36 (5), pp. 1325-1337;
Goldberg, D.E., (1989) Genetic Algorithms: In Search, Optimization and Machine
Learning, , Reading, MA: Addison Wesley;
Grefenstette, J.J., Incorporating problem specific knowledge into genetic
algorithms (1987) Genetic Algorithms and Simulated Annealing, , L. Davis. London:
Pitman;
Hindi, K.S., Hamam, Y.M., Solving the part families problem in discrete-parts
manufacture by simulated annealing (1994) Production Planning and Control, 5 (2),
pp. 160-164;
Hsu, C.M., Su, C.T., Multi-objective machine-component grouping in cellular
manufacturing: A genetic algorithm (1998) Production Planning and Control, 9 (2),
pp. 155-166;
Business Review, 62 (4), pp. 140-149;
(6), pp. 1353-1368;
Research, 18 (2), pp. 213-232;
pp. 117-133;
Kumar, K.R., Vannelli, A., Strategic subcontracting for efficient disaggregate
1715-1728;
Kumar, K.R., Kusiak, A., Vannelli, A., Grouping parts and components in flexible
397;
2633-2646;
Liepins, G.E., Hilliard, M.R., Genetic algorithms as a paradigm for machine
learning (1986) Paper Presented at the ORSA/TIMS Joint National Meeting, , Miami,
FL;
reorganisation by a clustering technique (1972) Operations Research, 29 (5), pp.
993-1009;
approach (1990) International Journal of Advance Manufacturing, 11 (3), pp. 149-
159;
Mosier, L., Taube, C., Weighted similarity measure heuristics for the group
Onwubolu, G.C., Songore, V., A tabu search-based approach to cellular manufacturing
systems (2000) Production Planning and Control, 11 (2), pp. 153-164;
Rajagopalan, R., Betra, J.L., Design of cellular production systems - A graph
567-579;
Sarker, R.B., Xu, Y., Operations sequences-based cell formation methods: A critical
survey (1998) Production Planning and Control, 9 (8), pp. 771-783;
problem for cellular manufacturing (1991) Journal of Operations Management, 10 (1),
pp. 28-43;
24 (2), pp. 387-400;
Engineering, 22 (4), pp. 469-480;
Management, 6 (2), pp. 125-148;
Whitley, D., (1989) The Genitor Algorithm and Selection Pressure: Why Rank-based
Allocation of Reproductive Trials is Best - Proceedings of the Third International
Conference of Genetic Algorithms, pp. 116-121., Don Mateo, California, Los Altos,
CA: Morgan Kaufmann
CORRESPONDENCE ADDRESS: Onwubolu, G.C.; Univ of the South Pacific, Suva, Fiji
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Zhao, Linhu, Tsujimura, Yasuhiro, Gen, Mitsuo

57199021194;35585082400;7005506986;
Genetic algorithm for fuzzy clustering
(1996) Proceedings of the IEEE Conference on Evolutionary Computation, pp. 716-719.
Cited 27 times.
0029722809&partnerID=40&md5=8df722ec45da17056d2c55c8358419b2
AFFILIATIONS: Ashikaga Inst of Technology, Ashikaga, Japan

ABSTRACT: In this paper, we present a genetic algorithm for fuzzy clustering. The
initialization procedure and genetic operators such as selection, crossover and
mutation are carefully created, and the efficiency of the proposed algorithm is
demonstrated by two numerical examples, the one is the butterfly, and the other is
the manufacturing cell formation problem.
INDEX KEYWORDS: Fuzzy sets; Manufacture; Matrix algebra; Membership functions;
Optimization; Vectors, Cellular manufacturing; Fuzzy clustering; Group technology,
Genetic algorithms
CORRESPONDENCE ADDRESS: Zhao, Linhu; Ashikaga Inst of Technology, Ashikaga, Japan
CODEN: 00166
ABBREVIATED SOURCE TITLE: Proc IEEE Conf Evol Comput Proc
SOURCE: Scopus
Won, Y., Lee, K.C.

7102129121;35330125000;
Group technology cell formation considering operation sequences and production
volumes
52 times.
0035840752&doi=10.1080%2f00207540010005060&partnerID=40&md5=bb968c47e44e43bd89f3fe4
c6e03512f
DOI: 10.1080/00207540010005060
AFFILIATIONS: School of Business Administration, Jeonju University, 1200, 3Ga
Hyoja-dong, Wansan-Gu, Chonju, Chonbuk, 560-759, South Korea;
School of Business Administration, Sung Kyun Kwan University, Myung Ryun 3-53,
Chong No-Gu, Seoul 110-745, South Korea
ABSTRACT: In this paper a new approach for minimizing intercell part flows in
cellularmanufacturing is proposed. Two types of production data-based part-machine
incidence matrices (PMIMs) are developed to reflect the real-field data such as the
operation sequences and production volumes of the parts to be manufactured. The
type I production data-based PMIM represents the actual flows to or from machines
by parts. A 0-1 linear formulation using the type I production data-based PMIM is
developed to minimize the total intercell flows. Once the type I production data-
based PMIM is obtained, a type II production data-based PMIM is constructed to
reflect the actual intercell flows by bottleneck parts requiring operations outside
its corresponding cell. Computational results with the well known data sets in
literature show that the proposed production data-based PMIMs can be used as the
fundamental replacements over the classical binary PMIM in the cell formation
problem, and the mathematical model based on the new PMIMs reflecting the real-
field data can be applied effectively to proper medium-sized cell formation
problems.
INDEX KEYWORDS: Cellular manufacturing; Computational methods; Manufacturing data
processing; Mathematical models; Matrix algebra; Operations research; Production
engineering, Operations sequence; Part machine incidence matrix; Production
volumes, Group technology
Boctor, F.F., The minimum cost, machine-part cell formation problem (1996)
Burbidge, J.L., (1975) The Introduction of Group Technology, , (London: Heinemann);
Planning, Design, and Analysis of Cellular Manufacturing Systems, pp. 1-46., edited
by A. K. Kamrani, H. R. Parsaei and D. H. Liles (Amsterdam: Elsevier);
machine-part grouping decisions in the design of a cellular manufacturing system
formation for group technology (1990) International Journal of Production Research,
28, pp. 185-198;
Nair, G.J., Narendran, T.T., ACCORD: A bicriterion algorithm for cell formation
Research, 37, pp. 539-556;
77, pp. 79-95;
707-720;
Vakharia, A.J., Wemmerlöve, U., Designing a cellular manufacturing system: A
pp. 84-97;
Verma, P., Ding, F.Y., A sequence-based materials flow procedure for designing
manufacturing cell (1995) International Journal of Production Research, 33, pp.
3267-3281;
Wicks, E.M., Reasor, R.J., Designing manufacturing systems with dynamic part
populations (1999) IIE Transactions, 31, pp. 11-20;
36, pp. 2099-2114
ISSN: 00207543
SOURCE: Scopus
Wemmerlöv, U., Hyer, N.L.

6601920402;6602787118;
Procedures for the part family/machine group identification problem in cellular
manufacturing
6963%2886%2990021-5&partnerID=40&md5=70e78b3ba04f18575ad97a8ab18bc6fb
DOI: 10.1016/0272-6963(86)90021-5
AFFILIATIONS: University of Wisconsin-Madison, Madison, WI, United States;
University of North Carolina-Chapel Hill, Chapel Hill, NC, United States
ABSTRACT: One of the first, and most important, problems faced in the design of a
cellular manufacturing system is the identification of part families and machine
groups and the simultaneous or subsequent evaluation of the associated cell
properties. This cell formation problem is embedded in a larger cell design
process. This article first discusses the general cell design process and its
objectives and then proposes a framework for structuring the cell formation
problem, which encompasses four basic solution approaches. These approaches are
based on the fundamental ways part families and machine groups are identified and
matched within the cell formation process. The framework is then used to classify
descriptive and analytic procedures for the part family/machine group
identification problem found in the literature. In all, over 70 such contributions
are categorized and briefly reviewed. Promising procedures are identified and areas
where additional research is needed are highlighted. It can be concluded that cell
formation, despite the reliance on computerized procedures, is a process that is
difficult to formalize and that requires a large portion of human insight and
decision making. © 1986.
REFERENCES: Astrop, The Serck-Audko Cell System of Production (1969) Machinery and
Production Engineering, 115 (2980), pp. 1002-1006;
Astrop, The Serck-Audko Cell System of Production (1970) Machinery and Production
Engineering, 116 (2984), pp. 82-88;
Barker, Group Technology and Machining Cells in the Small-Batch Production of
Valves (1970) Machinery and Production Engineering, 116 (2982), pp. 2-6;
Berk, Productivity Techniques for Job Shops—C-Cells (1982) Production & Inventory
Management Review and APICS News, pp. 17-19;
Black, Cellular Manufacturing Systems Reduce Setup Time, Make Small Lot Production
Economical (1983) Industrial Engineering, 15 (11), pp. 36-48;
Browne, Chan, Rathmill, The Development of an FMS Design Procedure (1984)
Proceedings of the First ORSA/TIMS Special Interest Conference, pp. 217-229., Ann
Arbor, Mich;
Burbidge, Production Flow Analysis (1963) Production Engineer, 42 (12), p. 742;
Burbidge, Production Flow Analysis (1969) Group Technology: Proceedings of an
International Seminar, pp. 89-123., International Center for Advanced Technical and
Vocational Training, Turin, Italy;
Burbidge, Production Flow Analysis (1971) Production Engineer, 50 (4-5), pp. 139-
152;
Burbidge, (1975) The Introduction of Group Technology, , Heinemann, London;
Burbidge, A Manual Method of Production Flow Analysis (1977) Production Engineer,
56 (10), pp. 34-38;
Burbidge, (1979) Group Technology in the Engineering Industry, , Mechanical
Engineering Publications Ltd, London;
Burbidge, The Simplification of Material Flow Systems (1982) International Journal
Burgam, FMS Control: Covering all the Angles (1984) CAD/CAM Technology, pp. 11-14;
Manufacturing (1982) Journal of Manufacturing Systems, 1 (1), pp. 65-75;
Dale, GT Reviewed (1977) Machinery and Production Engineering, 131 (3383), pp. 372-
381;
de Beer, van Gerwen, de Witte, Analysis of Engineering Production Systems as a Base
for Product-Oriented Reconstruction (1976) CIRP Annalen, 25, pp. 439-441;
de Beer, de Witte, Production Flow Synthesis (1978) CIRP Annalen, 27, pp. 341-389;
DeVries, (1976) Group Technology, An Overview and Bibliography, , Machinability
Data Center, Cincinnati, Ohio;
deWitte, The Use of Similarity Coefficients in Production Flow Analysis (1980)
Dumolien, Santen, Cellular Manufacturing Becomes Philosophy of Management at
Components Facility (1983) Industrial Engineering, 15 (11), pp. 72-76;
Durie, A Survey of Group Technology and Its Potential for User Application in the
UK (1970) Production Engineer, 49 (2), pp. 51-61;
Edwards, Choosing Your Method for Group Technology (1970) Metalworking Production,
pp. 57-58;
Edwards, The Family Grouping Philosophy (1971) International Journal of Production
Research, 9 (2), pp. 337-352;
Edwards, (1971) Readings in Group Technology, , The Machinery Publishing Company,
Ltd, Brighton;
El-Essawy, Torrance, Component Flow Analysis (1972) Production Engineer, 51, pp.
165-170;
Gallagher, Knight, (1973) Group Technology, , Butterworths, London;
Gallagher, Southern, Abraham, A Factory Component Profile for Group Technology
(1973) Machinery and Production Engineering, 122 (3145), pp. 284-289;
Gallagher, Group Technology in the Plastics Moulding Industry (1973) The Production
Engineer, 52 (4), pp. 127-132;
Garratt, The Cell System of Machine Grouping for Batch Production (1969) Machinery
and Production Engineering, 115 (2978), pp. 922-927;
Gettelman, Organize Production for Parts—NotProcesses (1971) Modern Machine Shop,
pp. 50-61;
Systems (1981) Proceedings: Ninth North American Metalworking Research
Conference, , Society of Manufacturing Engineers, Dearborn, Michigan;
GT Symposium (1967) Machinery and Production Engineering, 110 (2836), pp. 653-655;
Ham, Introduction to Group Technology (1976) SME Technical Paper MMR76-03, ,
Society of Manufacturing Engineers, Dearborn, Michigan;
Hawkins, Herbert's Big Switch to GT (1973) Metalworking Production, pp. 102-105;
Hollingum, GT Proves Worth in the Quiet Way (1972) The Engineer, 234 (6043), pp.
38-39;
Howarth, Group Technology—Using the Opitz System (1968) Production Engineer, 47
(1), pp. 25-35;
Hussain, Leonard, The Design of Standard Cells for Group Technology by the Use of
Machine Tool and Workpiece Statistics (1976) Proceedings: 16th International
Machine Tool Design and Research Conference, pp. 87-98., Macmillan, London;
Hyer, The Potential of Group Technology for US Manufacturing (1984) Journal of
Hyer, Wemmerlöv, Group Technology and Productivity (1984) Harvard Business Review,
pp. 140-149;
Hyer, Wemmerlöv, Group Technology Oriented Coding Schemes: Structures, Application
and Implementation (1985) Production and Inventory Management, 26 (2), pp. 55-78;
Jackson, (1980) The Cell System of Production, , Business Books, London;
Karanzalis, Family Parts Line Production: A New Manufacturing Concept (1970) Paper
presented at Industrial Management Seminar No. 35, , Milwaukee, Wisconsin;
King, Machine-Component Group Formation in Group Technology (1979) Preprints: 5th
International Conference on Production Research, pp. 40-44., Holland Organ Central,
The Hague, Netherlands;
King, Machine Component Grouping in Production Flow Analysis: An Approach Using
Research, 18 (2), pp. 213-232;
King, Nakornchai, Machine-Component Group Formation for Group Technology Review and
Extension (1982) International Journal of Production Research, 20 (2), pp. 117-133;
Koenig, Gongaware, Ham, Applications of Group Technology and Management of a

Miscellaneous Parts Shop (1981) Proceedings: 9th North American Metalworking
Research Conference, , Society of Manufacturing Engineers, Dearborn, Michigan;
Kruse, Swinfield, Thornley, Design of a Group Technology Plant and Its Associated
Production Control System (1975) The Production Engineer, 54 (7-8), pp. 417-421;
Kusiak, The Part Families Problem in Flexible Manufacturing Systems (1984) Working
Paper #06/84, , Third Edition, Technical University of Nova Scotia;
Law, Materials Flow Reduction Through Production Flow Analysis (1980) Proceedings:
8th North American Metalworking Research Conference, pp. 58-63., Society of
Manufacturing Engineers, Dearborn, Michigan;
Malik, Connolly, Sabberwal, Considerations for the Formation of Cells in Group
Manufacture (1974) Proceedings of the 14th International Machine Tool Design and
Research Conference, pp. 155-163., Macmillan, London;
Marklew, Improved Production Procedures at the Works of Churchill-Redman (1966)
Machinery and Production Engineering, 109 (2809), pp. 556-560;
McAuley, Machine Grouping for Efficient Production (1972) Production Engineer, 51
(2), pp. 53-57;
Clustering Technique (1972) Operations Research, pp. 993-1008;
Mitrofanov, (1966) Scientific Principles of Group Technology, , National Lending
Library, London;
Nagakar, Fogg, Chishom, Application of Group Technology to the Manufacture of
Sheetmetal Components (1979) CIRP Annalen, 28 (1), pp. 407-411;
New Efficiency Stems from Family Grouping (1966) Metalworking Production, pp. 63-
65;
Norton, Fogg, Small Companies, Management and the Cell System (1975) CIRP
Manufacturing Systems, pp. 47-62;
Oliva-Lopez, Purcheck, Load Balancing for Group Technology Planning and Control
(1979) International Journal of Machine Tool Design and Research, 19 (4), pp. 259-
274;
Opitz, Wiendahl, Group Technology and Manufacturing Systems for Small and Medium
Quantity Production (1971) International Journal of Production Research, 9 (1), pp.
181-203;
Phillips, Step Painlessly into Group Technology (1971) Metalworking Production, pp.
36-38;
Phillips, El Gomayel, (1977) Group Technology Applied to Product Design, , Purdue
University Press, West Lafayette, Indiana;
Pike, Application of Group Technology in South Africa (1978) FWP Journal, 18 (3),
pp. 7-20;
Pullen, A Survey of Cellular Manufacturing Cells (1976) Production Engineer, 55
(9), pp. 451-454;
Purcheck, A Mathematical Classification as a Basis for the Design of Group
Technology Cells (1975) The Production Engineer, 54 (1), pp. 35-49;
Purcheck, Linear Programming Method for the Combinatorial Grouping of an Incomplete
Power Set (1975) Journal of Cybernetics, 5 (4), pp. 51-76;
Purcheck, Combinatorial Analysis in Planning for Cellular Manufacture (1977) Paper
presented at 90th International Seminar on Manufacturing Systems;
Rajagopalan, Batra, Design of Cellular Production Systems: A Graph-Theoretic
Approach (1975) International Journal of Production Research, 13 (6), pp. 567-579;
Ranson, Toms, Group Technology at Serck Audko (1969) Group Technology: Proceedings
of an International Seminar, pp. 237-261., International Center for Advanced
Technical and Vocational Training, Turin, Italy;
Sidders, Flow Production of Parts in Small Batches (1962) Machinery and Production
Engineering, 100 (1204), p. 231;
Tilsley, Lewis, Flexible Cell Production Systems—A Realistic Approach (1977) CIRP
Annalen, 26 (1), pp. 269-271;
Tuttle, Call it GT or Yankee Savvy, Families of Parts Bring Savings (1974)
Production, 74 (5), pp. 88-91;
Wemmerlöv, Comments on the ‘Direct Clustering Algorithm for Group Formation in
Cellular Manufacture’ (1984) Journal of Manufacturing Systems, 3 (1), pp. vii-ix;
Whitfield, Group Technology for One-Off Non Repetitive Manufacture (1973) The
Production Engineer, 52 (3), pp. 81-85
CORRESPONDENCE ADDRESS: Wemmerlöv, U.; University of Wisconsin-Madison, Madison,
WI, United States
ISSN: 02726963
CODEN: JOTME
SOURCE: Scopus
Soolaki, M., Arkat, J., Ahmadizar, F.

54416473500;55912953100;23974269900;
Modeling the trade-off between manufacturing cell design and supply chain design
640-647.
85047514054&doi=10.5829%2fije.2018.31.04a.16&partnerID=40&md5=5757db25a0121bbf14d83
14d7a302044
DOI: 10.5829/ije.2018.31.04a.16
Kurdistan, Iran
ABSTRACT: Nowadays, we are witnessing the growth of firms that distribute the
production capacity of their products to a wide geographic range to supply the
demand of several markets. In this article, the relationships and interactions
between cell design and supply chain design are investigated. For this purpose, a
novel integrated model is presented for designing dynamic cellular manufacturing
systems in supply chain design. Different components in the supply chain design,
such as location of production facilities at a number of candidate sites,
procurement of raw materials from suppliers, shipment of raw materials to
production facilities, manufacturing of products, and distribution of products to
markets are considered in dynamic environments. The costs concerning these
components are minimized. Since the proposed problem is NP-hard, however, a genetic
algorithm is presented for application of the model to real-sized instances.
Numerical examples demonstrate that the algorithm performs successfully in
searching for optimal or near-optimal solutions. © 2018 Materials and Energy
Research Center. All Rights Reserved.
AUTHOR KEYWORDS: Cell Formation Problem; Dynamic Cellular Manufacturing Systems;
Genetic Algorithm; Supply Chain Design
INDEX KEYWORDS: Economic and social effects; Genetic algorithms; Product design;
Supply chains, Cell formation problem; Dynamic cellular manufacturing systems;
Dynamic environments; Integrated modeling; Near-optimal solutions; Production
capacity; Production facility; Supply chain design, Cellular manufacturing
REFERENCES: Jain, V., (2006) Hybrid Approaches to Model Supplier Related Issues in
A Dynamic Supply Chain, , Ph.D. Mechanical Engineering Department, Indian Institute
of Technology Delhi, India;
Wemmerlöv, U., Hyer, N.L., Cellular manufacturing in the us industry: A survey of
1530;
Rao, P.P., Mohanty, R., Impact of cellular manufacturing on supply chain
management: Exploration of interrelationships between design issues (2003)
International Journal of Manufacturing Technology and Management, 5 (5-6), pp. 507-
520;
Tavakkoli-Moghaddam, R., Makui, A., Khazaei, M., Ghodratnama, A., Solving a new bi-
objective model for a cell formation problem considering labor allocation by multi-
objective particle swarm optimization (2011) International Journal of Engineering-
Transactions A: Basics, 24 (3), pp. 249-257;
Azadnia, A., A multi-objective mathematical model for sustainable supplier
selection and order lot-sizing under inflation (2016) International Journal of
Engineering-Transactions B: Applications, 29 (8), pp. 1141-1150;
Saxena, L.K., Jain, P., An integrated model of dynamic cellular manufacturing and
Benhalla, S., Gharbi, A., Olivier, C., Multi-plant cellular manufacturing design
within a supply chain (2011) Journal of Operations and Logistics, 4 (1), pp. 1-17;
Graves, S.C., Willems, S.P., Optimizing the supply chain configuration for new
products (2005) Management Science, 51 (8), pp. 1165-1180;
Kazemi, M., Gol, S.S., Tavakkoli-Moghaddam, R., Kia, R., Khorrami, J., A
mathematical model for assessing the effects of a lot splitting feature on a
dynamic cellular manufacturing system (2017) Production Engineering, 11 (4-5), pp.
557-573;
Heydari, H., Paydar, M.M., Mahdavi, I., An integrated model of cellular
manufacturing and supplier selection considering product quality (2017) Journal of
Optimization in Industrial Engineering, 10 (22), pp. 39-48;
Economics, 183, pp. 667-679;
Aalaei, A., Kayvanfar, V., Davoudpour, H., Integrating multi-dynamic virtual
cellular manufacturing systems into multi- ; Market allocation and production
planning (2017) Proceedings of The Institution of Mechanical Engineers, Part B:
Journal of Engineering Manufacture, , 0954405417731465;
Aalaei, A., Davoudpour, H., Designing a mathematical model for integrating dynamic
cellular manufacturing into supply chain system (2012) AIP Conference Proceedings,
AIP, 1499, pp. 239-246;
Aalaei, A., Davoudpour, H., Revised multi-choice goal programming for incorporated
dynamic virtual cellular manufacturing into supply chain management: A case study
(2016) Engineering Applications of Artificial Intelligence, 47, pp. 3-15;
Soolaki, M., Arkat, J., Supply chain design considering cellular structure and
alternative processing routings (2018) Journal of Industrial and Systems
Soolaki, M., Arkat, J., Incorporating dynamic cellular manufacturing into strategic
supply chain design (2018) The International Journal of Advanced Manufacturing
Technology, 95 (5-8), pp. 2429-2447
of KurdistanIran; email: [email protected]
ISSN: 17281431
SOURCE: Scopus
Soolaki, M., Arkat, J., Ahmadizar, F.

54416473500;55912953100;23974269900;
Modeling the trade-off between manufacturing cell design and supply chain design
(2018) International Journal of Engineering, Transactions B: Applications, 31 (4),
pp. 300-307.
85047330882&partnerID=40&md5=7dd302c8ae18d8ee52f0297b6aea8531

Kurdistan, Iran
ABSTRACT: Nowadays, we are witnessing the growth of firms that distribute the
production capacity of their products to a wide geographic range to supply the
demand of several markets. In order to investigate such companies, the
relationships and interactions between cell design and supply chain design are
investigated in this article. For this purpose, a novel integrated model is
presented for designing dynamic cellular manufacturing systems in supply chain
design. Different components in the supply chain design, such as location of
production facilities at a number of candidate sites, procurement of raw materials
from suppliers, shipment of raw materials to production facilities, manufacturing
of products, and distribution of products to markets are considered in dynamic
environments, and the costs concerning these components are minimized. Since the
proposed problem is NP-hard, however, a genetic algorithm is presented for
application of the model to real-sized instances. Numerical examples demonstrate
that the algorithm performs successfully in searching for optimal or near-optimal
solutions. © 2018 Materials and Energy Research Center. All rights reserved.
AUTHOR KEYWORDS: Cell formation problem; Dynamic cellular manufacturing systems;
Genetic algorithm; Supply chain design
INDEX KEYWORDS: Economic and social effects; Genetic algorithms; Product design;
Supply chains, Cell formation problem; Dynamic cellular manufacturing systems;
Dynamic environments; Integrated modeling; Near-optimal solutions; Production
capacity; Production facility; Supply chain design, Cellular manufacturing
REFERENCES: Jain, V., (2006) Hybrid Approaches to Model Supplier Related Issues in
A Dynamic Supply Chain, , Ph.D. Mechanical Engineering Department, Indian Institute
of Technology Delhi, India;
Wemmerlöv, U., Hyer, N.L., Cellular manufacturing in the us industry: A survey of
1530;
Rao, P.P., Mohanty, R., Impact of cellular manufacturing on supply chain
management: Exploration of interrelationships between design issues (2003)
International Journal of Manufacturing Technology and Management, 5 (5-6), pp. 507-
520;
Tavakkoli-Moghaddam, R., Makui, A., Khazaei, M., Ghodratnama, A., Solving a new bi-
objective model for a cell formation problem considering labor allocation by multi-
objective particle swarm optimization (2011) International Journal of Engineering-
Transactions A: Basics, 24 (3), pp. 249-257;
Azadnia, A., A multi-objective mathematical model for sustainable supplier
selection and order lot-sizing under inflation (2016) International Journal of
Engineering-Transactions B: Applications, 29 (8), pp. 1141-1150;
Saxena, L.K., Jain, P., An integrated model of dynamic cellular manufacturing and
Benhalla, S., Gharbi, A., Olivier, C., Multi-plant cellular manufacturing design
within a supply chain (2011) Journal of Operations and Logistics, 4 (1), pp. 1-17;
Graves, S.C., Willems, S.P., Optimizing the supply chain configuration for new
products (2005) Management Science, 51 (8), pp. 1165-1180;
Kazemi, M., Gol, S.S., Tavakkoli-Moghaddam, R., Kia, R., Khorrami, J., A
mathematical model for assessing the effects of a lot splitting feature on a
dynamic cellular manufacturing system (2017) Production Engineering, 11 (4-5), pp.
557-573;
Heydari, H., Paydar, M.M., Mahdavi, I., An integrated model of cellular
manufacturing and supplier selection considering product quality (2017) Journal of
Optimization in Industrial Engineering, 10 (22), pp. 39-48;
Economics, 183, pp. 667-679;
Aalaei, A., Kayvanfar, V., Davoudpour, H., Integrating multi-dynamic virtual
cellular manufacturing systems into multi-market allocation and production planning
(2017) Proceedings of The Institution of Mechanical Engineers, Part B: Journal of
Engineering Manufacture, , 0954405417731465;
Aalaei, A., Davoudpour, H., Designing a mathematical model for integrating dynamic
cellular manufacturing into supply chain system (2012) AIP Conference Proceedings,
AIP, 1499, pp. 239-246;
dynamic virtual cellular manufacturing into supply chain management: A case study
(2016) Engineering Applications of Artificial Intelligence, 47, pp. 3-15;
Soolaki, M., Arkat, J., Supply chain design considering cellular structure and
alternative processing routings (2018) Journal of Industrial and Systems
supply chain design (2018) The International Journal of Advanced Manufacturing
Technology, 95 (5-8), pp. 2429-2447
ISSN: 1728144X
ABBREVIATED SOURCE TITLE: Int. J. Eng. Trans. B Applic.
SOURCE: Scopus
Soto, R., Crawford, B., Vásquez, L., Zulantay, R., Jaime, A., Ramírez, M.,
Almonacid, B.
24403038600;23395875300;57197727509;57197728605;57197732937;57197732430;56407124500
;
Solving the manufacturing cell design problem using the artificial bee colony
algorithm
484. Cited 1 time.
3-319-69456-6_39&partnerID=40&md5=000eb6f2686dfa1fc4458df3520a941f
DOI: 10.1007/978-3-319-69456-6_39
ABSTRACT: The manufacturing cell design problem (MCDP) proposes to divide an
industrial production plant into a number of manufacturing cells. The main
objective is to identify an organization of machines and parts in a set of
manufacturing cells to allow the transport of parts to be minimized. In this
research, the metaheuristic algorithm called Artificial Bee Colony (ABC) is
implemented to solve the MCDP. The ABC algorithm is inspired by the ability of bees
to get food, the way they look for it and exploit it. We performed two types of
experiments using two and three cells, giving a total of 90 problems that have been
used to solve the MCDP using ABC. In the results experiments, good results are
obtained solving the 90 proposed problems and reaching the 90 global optimum
values. Finally, the results are contrasted with two classical metaheuristics and
two modern metaheuristics. © Springer International Publishing AG 2017.
AUTHOR KEYWORDS: Animal behavior; Artificial bee colony; Cell formation problem;
Metaheuristic; Nature inspired algorithms
INDEX KEYWORDS: Artificial intelligence; Cells; Cytology; Evolutionary algorithms;
Flexible manufacturing systems; Heuristic algorithms; Manufacture; Optimization,
Animal behavior; Artificial bee colonies; Cell formation problem; Metaheuristic;
Nature inspired algorithms, Cellular manufacturing
formation considering investment and operational costs (1993) Eur. J. Oper. Res, 69
(3), pp. 330-341;
problem (1997) Comput. Ind. Eng, 32 (1), pp. 169-185;
Almonacid, B., (2017) Dataset - Solving the Manufacturing Cell Design Problem Using
the Artificial Bee Colony, , https://figshare.com/articles/Dataset, August, Solving
the Manufacturing Cell Design Problem using the Artificial Bee Colony/5270983;
Atmani, A., Lashkari, R., Caron, R., A mathematical programming approach to joint
cell formation and operation allocation in cellular manufacturing (1995) Int. J.
Prod. Res, 33 (1), pp. 1-15;
(1991) Int. J. Prod. Res, 29 (2), pp. 343-356;
Burbidge, J.L., Production flow analysis for planning group technology (1991) J.
Oper. Manag, 10 (1), pp. 5-27;
Deriche, R., Fizazi, H., The artificial bee colony algorithm for unsupervised
classification of meteorological satellite images (2015) Int. J. Comput. Appl, 112
(12);
improved p-median model (1998) Comput. Ind. Eng, 34 (1), pp. 135-146;
Duran, O., Rodriguez, N., Consalter, L.A., (2008) Hybridization of PSO and a
Discrete Position Update Scheme Techniques for Manufacturing Cell Design, 5317, pp.
503-512., Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS, Springer, Heidelberg;

Expert Syst. Appl, 37 (2), pp. 1563-1567;
Karaboga, D., Basturk, B., (2007) Artificial Bee Colony (ABC) Optimization
Algorithm for Solving Constrained Optimization Problems, 4529, pp. 789-798., Melin,
P., Castillo, O., Aguilar, L.T., Kacprzyk, J., Pedrycz, W. (eds.) IFSA 2007. LNCS,
Kusiak, A., The part families problem in flexible manufacturing systems (1985) Ann.
Oper. Res, 3 (6), pp. 277-300;
Li, B., Liu, F., Bai, X., Artificial bee colony algorithm optimization for human-
machine interface layout of cabin driver’s desk (2015) Proceedings of the Fourth
International Conference on Information Science and Cloud Computing (ISCC 2015), ,
Guangzhou, China, 18–19 December 2015;
516;
Menon, N., Ramakrishnan, R., Brain tumor segmentation in MRI images using
unsupervised artificial bee colony algorithm and FCM clustering (2015) 2015
International Conference on Communications and Signal Processing (ICCSP), pp. 0006-
0009., IEEE;
scale capacitated cell formation problems with multiple routings (2006) Eur. J.
Oper. Res, 171 (3), pp. 1051-1070;
Oliva-Lopez, E., Purcheck, G., Load balancing for group technology planning and
control (1979) Int. J. Mach. Tool Des. Res, 19 (4), pp. 259-274;
Purcheck, G.F., (1975) A Linear Programming Method for the Combinatorial Grouping
of an Incomplete Power Set;
clustering algorithms in cellular manufacturing (1994) J. Manuf. Syst, 13 (2), pp.
119-127;
Shargal, M., Shekhar, S., Irani, S., Evaluation of search algorithms and clustering
efficiency measures for machine-part matrix clustering (1995) IIE Trans, 27 (1),
pp. 43-59;
Soto, R., Crawford, B., Almonacid, B., Paredes, F., (2015) A Migrating Birds
Optimization Algorithm for Machine-Part Cell Formation Problems, 9413, pp. 270-
281., Sidorov, G., Galicia-Haro, S.N. (eds.) MICAI 2015. LNCS, Springer, Cham;
(2016) Sci. Program;
Soto, R., Crawford, B., Vega, E., Johnson, F., Paredes, F., (2016) Solving
Manufacturing Cell Design Problems Using a Shuffled Frog Leaping Algorithm, 407,
pp. 253-261., Gaber, T., Hassanien, A.E., El-Bendary, N., Dey, N. (eds.), November
28-30, 2015,Beni Suef, Egypt. AISC, Springer, Cham;
satisfiability (2012) Expert Syst. Appl, 39 (13), pp. 11423-11427;
technology using minimum spanning trees (1994) Int. J. Prod. Res, 32 (9), pp. 2149-
2158;
1617;
cell formation with multiple identical machines (2003) Eur. J. Oper. Res, 151 (2),
pp. 434-446;
Yurtkuran, A., Emel, E., A discrete artificial bee colony algorithm for single
machine scheduling problems (2016) Int. J. Prod. Res, pp. 1-19
CORRESPONDENCE ADDRESS: Vásquez, L.; Pontificia Universidad Católica de
EDITORS: Phon-Amnuaisuk S., Ang S.-P., Lee S.-Y.
ISSN: 03029743
ISBN: 9783319694559
SOURCE: Scopus
Kao, Y., Chen, C.-C.

23034954300;55251045900;
Automatic clustering for generalised cell formation using a hybrid particle swarm
optimisation
12 times.
84898044491&doi=10.1080%2f00207543.2013.867085&partnerID=40&md5=37a967aff2f2c37f285
7219324f9945b
DOI: 10.1080/00207543.2013.867085
AFFILIATIONS: Department of Information Management, Tatung University, Taipei,
Taiwan
ABSTRACT: This paper considers the cell formation (CF) problem in which parts have
alternative process routings and the number of machine cells is not known a priori.
Very few studies address these two practical issues at the same time. This paper
proposes an automatic clustering approach based on a hybrid particle swarm
optimisation (PSO) algorithm that can automatically evolve the number and cluster
centres of machine cells for a generalised CF problem. In the proposed approach, a
solution representation, comprising an integer number and a set of real numbers, is
adopted to encode the number of cells and machine cluster centres, respectively.
Besides, a discrete PSO algorithm is utilised to search for the number of machine
cells, and a continuous PSO algorithm is employed to perform machine clustering.
Effectiveness of the proposed approach has been demonstrated for test problems
selected from the literature and those generated in this study. The experimental
results indicate that the proposed approach is capable of solving the generalised
machine CF problem without predetermination of the number of cells. © 2013 Taylor
and Francis.
AUTHOR KEYWORDS: alternative process routings; automatic clustering; cell
formation problem; particle swarm optimisation
INDEX KEYWORDS: Cells; Cellular manufacturing; Cytology; Particle swarm
optimization (PSO), Alternative process routings; Automatic clustering; Cell
formation problem; Hybrid particles; Integer numbers; Particle swarm optimisation;
Practical issues; Solution representation, Clustering algorithms
REFERENCES: Adenso-Daz, B., Lozano, S., Racero, J., Guerrero, F., Machine cell
formation in generalized group technology (2001) Computers & Industrial
Engineering, 41 (2), pp. 227-240;
1380;
hybrid particle swarm optimization (2010) The International Journal of Advanced
Baykasolu, A., A meta-heuristic algorithm to solve quadratic assignment
Díaz, J.A., Luna, D.E., Zetina, C.A., A hybrid algorithm for the manufacturing cell
formation problem (2013) Journal of Heuristics, 19 (1), pp. 77-96;
Falkenauer, E., (1998) Genetic Algorithms for Grouping Problems, , New York: Wiley;

alternative part process plans (1996) Computers & Industrial Engineering, 30 (3),
pp. 423-431;
2059-2079;
Jarboui, B., Cheikh, M., Siarry, P., Rebai, A., Combinatorial Particle Swarm
Optimization (CPSO) for partitional clustering problem (2007) Applied Mathematics
and Computation, 192 (2), pp. 337-345;
cell formation (2013) The International Journal of Advanced Manufacturing
Kao, Y., Lin, C.H., A pso-based approach to cell formation problems with
50 (15), pp. 4075-4089;
process plans in flexible manufacturing systems (1991) Production Planning &
Control, 2 (2), pp. 135-141;
algorithm (1997) Proceedings of IEEE International Conference on Systems Man, and
pp. 2633-2646;
10 (2), pp. 93-108;
(12), pp. 2071-2081;
manufacturing system (2011) Applied Soft Computing, 11 (6), pp. 4195-4202;
16 (3), pp. 235-245;
707-720;
pp. 1989-2007;
in the presence of multiple process routes (1994) Engineering Optimization, 22 (3),
pp. 231-240;
technology problem with multiple process routings (1997) Computers & Industrial
Engineering, 32 (1), pp. 207-220;
problem with alternative process plans (2004) The International Journal of Advanced
pp. 346-360;
Yildiz, A.R., A comparative study of population-based optimization algorithms for
turning operations (2012) Information Sciences, 210, pp. 81-88;
Yildiz, A.R., A new hybrid particle swarm optimization approach for structural
design optimization in the automotive industry (2012) Proceedings of the
Institution of Mechanical Engineers, Part D: Journal of Automobile Engineering, 226
(10), pp. 1340-1351;
Yildiz, A.R., Optimization of cutting parameters in multi-pass turning using
artificial bee colony-based approach (2013) Information Sciences, 220, pp. 399-407;
Yildiz, A.R., A new hybrid artificial bee colony algorithm for robust optimal
design and manufacturing (2013) Applied Soft Computing, 13 (5), pp. 2906-2912;
Yildiz, A.R., Hybrid taguchi-differential evolution algorithm for optimization of
multi-pass turning operations (2013) Applied Soft Computing, 13 (3), pp. 1433-1439;
Yildiz, A.R., Comparison of evolutionary-based optimization algorithms for

structural design optimization (2013) Engineering Applications of Artificial
Intelligence, 26 (1), pp. 327-333;
Yildiz, A.R., A new hybrid differential evolution algorithm for the selection of
optimal machining parameters in milling operations (2013) Applied Soft Computing,
13 (3), pp. 1561-1566;
Yildiz, A.R., Solanki, K.N., Multi-objective optimization of vehicle
crashworthiness using a new particle swarm based approach (2012) The International
885-906
University, Taipei, Taiwan; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Eguia, I., Racero, J., Guerrero, F., Lozano, S.

7801457881;14034572500;7005991206;7004141022;
Cell formation and scheduling of part families for reconfigurable cellular
manufacturing systems using Tabu search
(2013) SIMULATION, 89 (9), pp. 1056-1072. Cited 18 times.
84884225290&doi=10.1177%2f0037549713491590&partnerID=40&md5=4db2dd630bc615f13c189de
a3b2b182a
DOI: 10.1177/0037549713491590
AFFILIATIONS: Department of Industrial Engineering I, University of Seville, Spain
ABSTRACT: A reconfigurable cellular manufacturing system (RCMS) consists of
multiple reconfigurable machining cells, each of which has one or more
reconfigurable machine tools (RMTs), a setup station, and an automatic material
handling and storage system. As part of the RCMS design process, similar parts must
be grouped into part families and the RMTs must be arranged to form parallel cell
configurations. A RCMS is designed at the outset for rapid changes in its
components, allowing the production of multiple part families in each parallel
cell. This paper proposes a new approach to simultaneously solve the cell formation
and the scheduling of part families for an effective working of a RCMS. A new mixed
integer linear programming model is used to represent both problems at the same
time with the objective of minimizing production costs. Two types of production
costs are considered: reconfiguration (i.e. setup) costs for changing from one
family to the next one, and under-utilization costs for not using the RMT
resources. A small size example is used to illustrate this integrated methodology.
Computational experiments have been carried out adapting some larger instances from
the literature on cellular manufacturing systems. Solving large instances optimally
becomes prohibitive in terms of computational effort. That is why an approximate
method, based on a Tabu search (TS) algorithm, has also been developed. Results
show the ability of this algorithm to find good-quality production schedules of
part families in a RCMS without requiring long computing times. It can be concluded
that a RCMS can attain manufacturing flexibility without losing cost-effectiveness
and that the approach proposed in this paper can efficiently solve real-world
problems. © 2013, The Society for Modeling and Simulation International. All rights
reserved.
AUTHOR KEYWORDS: cell formation problem; Reconfigurable manufacturing system;
scheduling problem; Tabu search algorithm
INDEX KEYWORDS: Cell formation problem; Computational experiment; Manufacturing
flexibility; Mixed integer linear programming model; Reconfigurable machine tool;
Reconfigurable manufacturing system; Scheduling problem; Tabu search algorithms,
Algorithms; Computer aided manufacturing; Costs; Linear programming; Production
control; Scheduling; Tabu search, Cellular manufacturing
REFERENCES: Molina, A., Rodriguez, C.A., Ahuett, H., Next-generation manufacturing
systems: key research issues in developing and integrating reconfigurable and
intelligent machines (2005) Int J Computer Integr Manuf, 18, pp. 225-236;
Tolio, T., Matta, A., Karaesmen, F., A new system architecture compared with
conventional production system architectures (2000) Int J Prod Res, 38, pp. 4159-
4169;
Dupont-Gatelmand, C., A survey of flexible manufacturing systems (1981) J Manuf
Syst, 1, pp. 1-16;
Koren, Y., (2010) The global manufacturing revolution, , Hoboken, NJ: John Wiley &
Sons;
Koren, Y., Heisel, U., Jovane, F., Reconfigurable manufacturing systems (1999) Ann
CIRP, 48, pp. 1-14;
Xiaobo, Z., Jiancai, W., Zhenbi, L., A stochastic model of a reconfigurable
manufacturing system, part 1: a framework (2000) Int J Prod Res, 38, pp. 2273-2285;
Lei, M., Yang, X., Tseng, M., Design and intelligent machine center: strategy and
practice (1998) J Mechatron, 8, pp. 275-281;
Oper Res, 69, pp. 284-291;
Suresh, N.C., Kay, J.M., (1988) Group technology and cellular manufacturing. State-
of-the-art synthesis of research and practice, , (Eds.). Norwell, MA: Kluwer
Academic Publishers;
implementation experiences and performance improvements (1997) Int J Prod Res, 35,
pp. 29-49;
Pattanaik, L.N., Jain, P.K., Mehta, N.K., Cell formation in the presence of
reconfigurable machines (2007) Int J Adv Manuf Technol, 34, pp. 335-345;
Pattanaik, L.N., Kumar, V., Multiple levels of reconfiguration for robust cells
formed using modular machines (2010) Int J Ind Syst Eng, 8, pp. 424-441;
Yu, J.M., Doh, H.H., Kim, H.W., Iterative algorithms for part grouping and loading
in cellular reconfigurable manufacturing systems (2012) J Oper Res Soc, 63, pp.
1635-1644;
Xing, B., Nelwamondo, F.V., Battle, K., Application of artificial intelligence (AI)
methods for designing and analysis of reconfigurable cellular manufacturing system
(RCMS) (2009), 1, pp. 402-409., Proceedings of the 2nd International Conference on
Adaptive Science & Technology; Heragu, S.S., Group technology and cellular
manufacturing (1994) IEEE Tran Syst Man Cybern, 24, pp. 203-215;
Lozano, S., Guerrero, F., Eguia, I., Cell design and loading in the presence of
alternative routing (1999) Int J Prod Res, 37, pp. 3289-3304;
and control, , Suffolk, UK: Chapman & Hall;
Mehrabi, M.G., Ulsoy, A.G., Koren, Y., Reconfigurable manufacturing systems: key to
future manufacturing (2000) J Intell Manuf, 11, pp. 403-419;
Galan, R., Racero, J., Eguia, I., A systematic approach for product families
formation in reconfigurable manufacturing systems (2007) Rob Comput Integr Manuf,
23, pp. 489-502;
problem (1995) J Oper Manage, 13, pp. 117-138;
review, evaluation and directions for future research (1998) Comput Ind Eng, 34,
pp. 3-20;
Johnson, D.S., McGeoch, L.A., The traveling salesman problem: a case study (1997)
Local search in combinatorial optimization, pp. 215-310., In: Aarts EHL Lenstra JK
(eds) London: John Wiley and Sons;
Galan, R., Racero, J., Eguia, I., A methodology for facilitating reconfiguration in
manufacturing: the move towards reconfigurable manufacturing systems (2007) Int J
Bektas, T., The multiple traveling salesman problem: an overview of formulations
and solution procedures (2006) Omega, 34, pp. 209-219;
Christofides, N., Mingozzi, A., Toth, P., Exact algorithms for the vehicle routing
problem, based on spanning tree and shortest path relaxations (1981) Math Program,
20, pp. 255-282;
Miller, C.E., Tucker, A.W., Zemlin, R.A., Integer programming formulations and the
travelling salesman problem (1960) J ACM, 7, pp. 326-329;
clustering efficiency measures for machine-part matrix clustering (1995) IIE Trans,
27, pp. 43-59;
Cheng, C.H., Madan, M.S., Motwani, J., Knapsack-based algorithms for designing
cellular manufacturing systems (1996) J Oper Res Soc, 47, pp. 1468-1476;
Seifodini, H., Single linkage versus average linkage clustering in machine cell
reorganisation by a clustering technique (1972) Oper Res, 20, pp. 993-1009;
Crama, Y., Oosten, M., Models for machine-part grouping in cellular manufacturing
(1996) Int J Prod Res, 34, pp. 1693-1713;
Askin, R.G., Subramanian, P., Cost-based heuristic for group technology
Chen, S.J., Cheng, C.S., Neural network-based cell formation algorithm in cellular
(1991) Int J Prod Res, 29, pp. 343-356;
Askin, R.G., Cresswell, S.H., Goldberg, J.B., Hamiltonian path approach to
reordering the part-machine matrix for cellular manufacturing (1991) Int J Prod
Res, 29, pp. 1081-1100;
Lin, T.L., Dessouky, M.M., Kumar, K.R., Heuristic-based procedure for the weighted
production-cell formation problem (1996) IIE Trans, 28, pp. 579-589;
1052;
Wei, J.C., Kern, G.M., Commonality analysis. A linear cell clustering algorithm for
group technology (1989) Int J Prod Res, 27, pp. 2053-2062;
Adenso-Diaz, B., Glover, F., Ghaziri, H., (1996) Heuristic optimization and neural
networks in operations management and engineering, , Paraninfo;
intelligence (1986) Comput Oper Res, 13, pp. 533-549;
Glover, F., Tabu Search: A tutorial (1990) Interfaces, 20, pp. 74-94;
Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M., An analysis of several heuristics
for the travelling salesman problem (1977) SIAM J Comput, 6, pp. 563-581
CORRESPONDENCE ADDRESS: Eguia, I.; Escuela Superior de Ingenieros, Camino de los
Descubrimientos s/n, 41092 Sevilla, Spain
ISSN: 00375497
ABBREVIATED SOURCE TITLE: Simulation
SOURCE: Scopus
Khilwani, N., Ulutas, B.H., Islier, A.A., Tiwari, M.K.

16319375900;6602524363;55663506400;35427952100;
A methodology to design virtual cellular manufacturing systems
80053406256&doi=10.1007%2fs10845-009-0314-
6&partnerID=40&md5=0d0c82514c20bae9e8bbb5255cdb6ece
DOI: 10.1007/s10845-009-0314-6
AFFILIATIONS: Wolfson School of Mechanical and Manufacturing Engineering,
Loughborough University, Loughborough, United Kingdom;
Department of Industrial Engineering, Eskisehir Osmangazi University, Meselik,
26480 Eskisehir, Turkey;
Department of Industrial Engineering and Management, Indian Institute of
Technology, Kharagpur 721 302, India
ABSTRACT: Virtual Cellular Manufacturing System is a new type of cellular system
that emerged as a promising alternative for designing cells in real time. The
problem is complex and time consuming NP-hard problem in its nature. This study was
conducted to design virtual cells that maximizes similarity index and minimizes
lead time. Amathematical model and an effective solution procedure were proposed.
Several randomly generated data sets were used along a case study to test the
performance of the proposed approach. The effects of inherent parameters of virtual
systems were investigated and compared by using particular performance measures. ©
Springer Science+Business Media, LLC 2009.
AUTHOR KEYWORDS: Cell formation problem; Quick response manufacturing; Similarity
index; Virtual cells
INDEX KEYWORDS: Cell formation problem; Cellular system; Data sets; Effective
solution; Leadtime; NP-HARD problem; Performance measure; Quick response
manufacturing; Real time; Similarity indices; Virtual cells; Virtual cellular
manufacturing system; Virtual systems, Cells; Computational complexity; Real time
systems, Cellular manufacturing
REFERENCES: Adil, G.K., Rajamani, D.A., Strong, D., Mathematical model for cell
Engineers), 29 (7), pp. 599-610;
Ballakur, A., (1985) Investigation of Part Family/machine Group Formation in
Designing A Cellular Manufacturing System, , PhD thesis, University of Wisconsin,
Madison, WI;
Baykasoglu, A., Capability based distributed layout approach for virtual
pp. 2597-2618., doi:10.1080/0020754031000087229;
Baykasoglu, A., A meta heuristic algorithm to solve quadratic assignment
Journal of Intelligent Manufacturing, 15, pp. 753-759.,
doi:10.1023/B:JIMS.0000042661.56171.bb;
Benjaafar, S., Machine sharing and performance of cellular manufacturing systems
(1995) Journal of Materials Processing Technology, 52, pp. 91-101.,
doi:10.1016/0924-0136(94)01574-K;
Benjaafar, S., Heragu, S.S., Irani, S.A., Next generation factory layouts: Research
challenges and recent progress (2002) Interfaces, 32 (6), pp. 58-76;
in cellular manufacturing (2008) Journal of Intelligent Manufacturing, 19 (1), pp.
71-85., DOI 10.1007/s10845-007-0046-4;
Burbidge, J.L., (1975) The Introduction of Group Technology, , New York, NY: Wiley;
Chowdary, B.V., Slomp, J., Suresh, N.C., A new concept of virtual cellular
manufacturing (2005) West Indian Journal of Engineering, 28 (1), pp. 45-60.,
Technical Paper;
Drolet, J.R., (1989) Scheduling Virtual Cellularmanufacturing Systems, , PhD
Dissertation, Purdue University, West Lafayette, IN;
Computers and Industrial Engineering, 31 (1-2), pp. 139-142;
Garbie, I.H., Parsaei, H.R., Leep, H.R., Introducing new parts into existing
cellular manufacturing systems based on a novel similarity coefficient (2005)
10.1080/00207540412331270432;
Hyer, N.L., Brown, K.A., The discipline of real cells (1999) Journal of Operations
Management, 17, pp. 557-564., doi:10. 1016/S0272-6963(99)00003-0;
layout design and inter-cell flows for the machine sharing problem (1993)
doi:10.1080/00207549308956757;
Kannan, V.R., Ghosh, S., A virtual cellular manufacturing approach to batch
production (1996) Decision Sciences, 27 (3), pp. 519-539;
Kannan, V.R., Ghosh, S., Cellular manufacturing using virtual cells (1996)
International Journal of Operations and Production Management, 16 (5), pp. 99-112.,
DOI 10.1108/01443579610113979;
pp. 117-133., doi:10.1080/00207548208947754;
Ko, K.C., Egbelu, P.J., Virtual cell formation (2003) International Journal of
Production Research, 41 (11), pp. 2365-2389., doi:10.1080/0020754031000087193;
Pearce, D.J., Kelly, P.H.J., A dynamic topological sort algorithm for directed
acyclic graphs (2006) ACM Journal of Experimental Algorithmics, 11, pp. 1-24., 1.7;
A dynamic model for a highly dynamic environment (1995) Computers and Industrial
Engineering, 29 (1-4), pp. 221-225., doi:10.1016/0360-8352(95)00075-C;
systems under dynamic and uncertain conditions (2007) Journal of Intelligent
Shambu, G., Suresh, N.C., Performance of hybrid cellular manufacturing systems: A
120 (2), pp. 436-458., DOI 10.1016/S0377-2217(98)00371-3;
S0736584504001036;
Suresh, N.C., Slomp, J., Performance comparison of virtual cellular manufacturing
with functional and cellular layouts in DRC settings (2005) International Journal
Suri, R., (1998) Quick Response Manufacturing, pp. 85-148., Portland: Productivity
Press;
Suri, R., (2003) QRM and POLCA: A Winning Combination for Manufacturing Enterprises
in the 21st Century, , Technical Report, Center for quick response manufacturing,
University of Wisconsin, Madison, USA;
Manufacturing Systems, 11 (3), pp. 291-314., DOI 10.1023/A:1008117329327;
Wei, N.-C., Mejabi, O.O., A clustering approach for minimizing intercell trips in
cell formation (2008) Journal of Intelligent Manufacturing, 19 (1), pp. 13-20., DOI
10.1007/s10845-007-0042-8
CORRESPONDENCE ADDRESS: Ulutas, B.H.; Department of Industrial Engineering,
Eskisehir Osmangazi University, Meselik, 26480 Eskisehir, Turkey; email:
[email protected]
ISSN: 09565515
CODEN: JIMNE
SOURCE: Scopus
Nunkaew, W., Phruksaphanrat, B.

36662751600;6507608358;
Concurrent cell formation for cellular manufacturing system by preemptive fuzzy
goal programming
(2011) IMECS 2011 - International MultiConference of Engineers and Computer
Scientists 2011, 2, pp. 1151-1156. Cited 2 times.
79960592578&partnerID=40&md5=a441388173965c4cbb649b73bc96227e
AFFILIATIONS: Industrial Engineering Department, Thammasat University, Rangsit

Campus, Klongluang, Pathum-thani, 12120, Thailand
ABSTRACT: A new concurrent cell formation method for solving a Cell Formation (CF)
problem in a Cellular Manufacturing System (CMS) is developed and proposed in this
research. To solve such problem, conventionally a facility planner needs to
classify parts into families and group machines into cells, respectively. However,
existing methods for solving the CF problem are difficult and complicated.
Moreover, efficient solutions of some of those methods are not guarantee. So, the
efficient method based on two important performance measures, called Exceptional
Elements (EE) and the Void Elements (VE) of a perfect grouping, are developed.
Preemptive Fuzzy Goal Programming (P-FGP) is applied to these two performance
measures for finding the efficient solution. The problems of grouping part family
and machine cells can be simultaneously easily solved. Moreover, machines and parts
grouping can also be adjustable to find preferred solutions by use of P-FGP. The
numerical examples existed in the literatures are shown to demonstrate the
efficiency of the proposed model over the conventional method.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing system;
Concurrent formation method; Preemptive fuzzy goal programming
system; Conventional methods; Efficient method; Exceptional elements; Formation
method; Fuzzy goal programming; Machine cell; Numerical example; Part family;
Performance measure; Preferred solutions; Void elements, Cells; Computer science;
Computer systems programming; Engineers; Industrial research; Numerical methods;
Problem solving, Cellular manufacturing
REFERENCES: Chandrasekharan, M.P., Rajagopalan, R., ZODIAC - An algorithm for
concurrent formation of part-families and machine-cells (1987) International
Chu, C.H., Hayya, J.C., A fuzzy dlustering approach to manufacturing cell formation
families in cellular manufacturing (1998) Computers Industrial Engineering, 35, pp.
81-84;
2053-2062;
Li, L., Lai, K.K., A fuzzy approach to the multiobjective transportation problem
(2000) Computer & Operation Research, 27, pp. 43-57;
El-Wahed, W.F.A., A multi-objective transportation problem under fuzziness (2001)
Romero, C., (1990) Handbook of Critical Issues in Goal Programming, , Pergamon
Press;
Zeleny, M., (1982) Multiple Criteria Decision Making, , McGraw-Hill Book Company;
Hannan, E.L., On fuzzy goal programming (1981) Decision Sciences, pp. 522-531;
Li, Y.J., Hwang, C.L., (1994) Fuzzy Multiple Objective Decision Making: Methods and
Applications, , Springer-Verlag Berlin Heidelberg;
Yoon, K.P., Hwang, C.L., (1995) Multiple Attribute Decision Making: An
Introduction, , SAGE Publications;
Chen, C.T., Extensions of the TOPSIS for group decision-making under fuzzy
environment (2000) Fuzzy Sets and Systems, 114, pp. 1-9;
Abo-Sinna, M.A., Amer, A.H., Ibrahim, A.S., Extensions of TOPSIS for large scale
multi-objective non-linear programming problems with block angular structure (2008)
Applied Mathematical Modelling, 32, pp. 292-302
CORRESPONDENCE ADDRESS: Nunkaew, W.; Industrial Engineering Department, Thammasat
University, Rangsit Campus, Klongluang, Pathum-thani, 12120, Thailand; email:
[email protected]
ISBN: 9789881925121
ABBREVIATED SOURCE TITLE: IMECS - Int. MultiConference Eng. Comput. Scientists
SOURCE: Scopus
Arkat, J., Saidi, M., Abbasi, B.

55912953100;54384689100;14420854700;
Applying simulated annealing to cellular manufacturing system design
33847731424&doi=10.1007%2fs00170-005-0358-
5&partnerID=40&md5=a6b885ab7ca8e74948c3bace94c2f335
DOI: 10.1007/s00170-005-0358-5
AFFILIATIONS: Industrial Engineering, Iran University of Science and Technology,
Farjam Ave., Narmak, Tehran, Iran;
Industrial Engineering, Sharif University of Technology, Azadi Ave., Tehran, Iran
ABSTRACT: Cell formation and cellular layout design are the two main steps in
designing a cellular manufacturing system (CMS). In this paper, we will present an
integrated methodology based on a new concept of similarity coefficients and the
use of simulated annealing (SA) as an optimization tool. In comparison with the
previous works, the proposed methodology takes into account relevant production
data, such as alternative process routings and the production volumes of parts. The
SA-based optimization tool is parallel in nature and, hence, can reduce the
computation time significantly, so it is capable of handling large-scale problems.
Finally, the SA-based procedure is compared with a genetic algorithm (GA) based
procedure and it will be shown that the SA-based algorithm can be as effective as a
GA-based algorithm, but with less computational time and effort. © Springer-Verlag
London Limited 2007.
AUTHOR KEYWORDS: Cell formation problem; Cellular manufacturing systems;
Similarity coefficients; Simulated annealing algorithm
INDEX KEYWORDS: Cellular manufacturing; Computational mechanics; Data reduction;
Genetic algorithms; Optimization; Systems analysis, Cellular manufacturing system
(CMS); Computational time; Production data, Simulated annealing
formation considering investment and operational costs (1993) Eur J Oper Res, 69
(3), pp. 330-341;
algorithms for cell formation (1997) IIE Trans, 29 (1), pp. 53-67;
Armani, A., Lashkari, R.S., Caron, R.T., A mathematical programming approach to
joint cell formation and operation allocation in cellular manufacturing (1995) Int
J Prod Res, 33 (1), pp. 1-15;
(1991) Int J Prod Res, 29 (2), pp. 343-356;
improved p-median model (1998) Comput Ind Eng, 34 (1), pp. 135-146;
formation based on a new similarity coefficient which considers alternative routes
during machine failure (1998) Comput Ind Eng, 35 (3-4), pp. 479-482;
Kazerooni, M., Luong, L.H.S., Abhary, K., Cellformation using genetic algorithms
(1995) Int J Flex Autom Integ Manuf, 3, pp. 219-235;
Kazerooni, M., Luong, L.H.S., Abhary, K., Machinechain similarity, a new approach
to cell formation (1995) Proceedings of the 11th International Conference on
Computer-Aided Production Engineering, pp. 97-105., London, UK, September;
Kirkpatrick, S., Gelatt Jr, C.D., Vecchi, M.P., Optimization by simulated annealing
(1983) Science, 220 (4598), pp. 671-680;
Annals Oper Res, 3, pp. 279-300;
Lee, S., Zhang, C., Wang, H.-P., Fuzzy set-based procedures for manufacturing cell
formation (1991) Proceedings of die 1991 ASME Winter Annual Meeting, Symposium on
Design, Analysis, and Control of Manufacturing Cells, 53, pp. 31-45., Black JT,
Jiang BC, Wiens GJ ed;
manufacturing cells (1993) Int J Prod Res, 31 (8), pp. 1757-1766;
Luong, L.H.S., Kazerooni, M., Abhary, K., Genetic algorithms in manufacturing
system design (2001) Computational intelligence in manufacturing handbook, , Kusiak
A, Wang J ed, CRC Press, Boca Raton, Florida;
Seifoddini, H., Hsu, C.-P., Comparative study of similarity coefficients and
clustering algorithms in cellular manufacturing (1994) J Manuf Syst, 13 (2), pp.
119-127;
27 (1), pp. 43-59;
Oper Res, 69 (3), pp. 284-291;
Srinivasan G (1994) A. clustering algorithm for machine cell formation in group
technology using minimum spanning tree. Int J Prod Res 32(9):2149-2158; Su, C.-T.,
Hsu, C.-M., Multi-objective machine-part cell formation through parallel simulated
annealing (1998) Int J Prod Res, 36 (8), pp. 2185-2207;
formation (1990) J Manuf Syst, 9 (1), pp. 55-68;
Venugopal V, Narendran TT (1994) Machine-cell formation through neural network
models. Int J Prod Res 32(9):2105-211.6; Waghogekar, P.H., Sahu, S., Group
technology: A research bibliography (1983) OPSEARCH, 29 (4), pp. 225-249;
cell formation with multiple identical machines (2003) Eur J Oper Res, 151 (2), pp.
434-446
CORRESPONDENCE ADDRESS: Arkat, J.; Industrial Engineering, Iran University of
Science and Technology, Farjam Ave., Narmak, Tehran, Iran; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Torres-Velázquez, R., Estivill-Castro, V.

6507616571;55915978700;
Local search for Hamiltonian Path with applications to clustering visitation paths
times.
3042706282&doi=10.1057%2fpalgrave.jors.2601770&partnerID=40&md5=918180771b52aa7031e
f1da5cbe4d7fa
AFFILIATIONS: PHI Investigation Operativa, Direction de Empresas SA de CV,
Av.Acoxpa 24-506A,Col.Prados Coapa, Tlalpan DF, 14390, Mexico;
Griffith University, Brisbane, 4111 QLD, Australia
ABSTRACT: Clustering a data array has been found useful in the design of web-sites
and distributed database system. We show that a critical step during this
clustering process is related to solving the Longest Hamiltonian Path Problem, a
well known NPcomplete problem. Using the grouping of visitation paths of web-users
as a case study, we test several heuristic algorithms. As a result of our
experiments, we identify a successful method for dealing with this problem. Our
algorithm spends less CPU time and provides better quality solutions than the most
recent approach.
AUTHOR KEYWORDS: 2-opt; Bond energy algorithm (bea); Cell formation problems;
Clustering a matrix of attributes; Local search
INDEX KEYWORDS: Algorithms; Approximation theory; Benchmarking; Combinatorial
mathematics; Database systems; Heuristic methods; Matrix algebra; Operations
research; Optimization; Websites, 2-opt; Bond energy algorithm (BEA); Cell
formation problems; Clustering a matrix of attributes; Local search, Hamiltonians
REFERENCES: McCormick Jr., W.T., Schweitzer, P.J., White, T.W., Problem
decomposition and data reorganization by a clustering technique (1972) Opns Res,
20, pp. 993-1009;
Chinchwadkar, G.S., Goh, A., An overview of vertical partitioning in object
oriented databases (1999) Comput J, 42, pp. 39-50;
Lin, X., Orlowska, M., Zhang, Y., A graph based cluster approach for vertical
partitioning in database design (1993) Data Knowl Engng, 11, pp. 151-169;
Özsu, M.T., Valduriez, P., (1999) Principles of Distributed Database Systems, 2nd
Edn., , Prentice-Hall: Englewood Cliffs, NJ;
Xiao, J., Zhang, Y., Jia, X., Li, T., Measuring similarity of interests for
clustering web-users (2001) Australian Computer Science Communications. Database
Technologies, Proceedings of the 12th Australasian Database Conference ADC 2001,
23, pp. 107-114., Orlowska ME and Roddick JR (eds). IEEE Computer Society: Silver
Spring, MD;
Amirahnadi, F., Choobineh, F., Identifying the composition of a cellular
manufacturing system (1996) Int J Prod Res, 34, pp. 2471-2488;
Askin, R.G., Cresswell, S.H., Golberd, J.B., Vakharia, A.J., A Hamiltonian Path
Int J Prod Res, 29, pp. 1081-1100;
Boctor, F.F., The minimum-cost, machine-part cell formation problem (1996) Int J
Prod Res, 34, pp. 1045-1063;
Lozano, S., Adenso-Diaz, B., Eguia, I., Oniseva, L., A one-step tabu search
algorithm for manufacturing cell design (1999) J Opl Res Soc, 50, pp. 509-516;
routings (1998) J Opl Res Soc, 49, pp. 953-965;
Hochbaum, D.S., (1997) Approximation Algorithms for NP-Hard Problems, , PWS
Publishing Company: Boston, MA;
Perkowitz, M., Etzioni, O., Adaptive web sites: Automatically synthesizing web
pages (1998) Proceedings of the 15th National Conference on Artificial
Intelligence, Madison, WI, July 1998 American Association for Artificial
Intelligence, pp. 727-732., AAAI Press;
Doyle, J., Clumping data in 2-way tables: A user-oriented perspective (1994) J Opl
Res Soc, 45, pp. 203-213;
Arhalakis, G., Lu, T., Minis, I., Nagi, R., A practical method for design of
hybrid-type production facilities (1996) Int J Prod Res, 34, pp. 897-918;
Cheng, C.-H., A branch and bound clustering algorithm (1995) IEEE Trans Systems Man
Cybern, 25, pp. 895-898;
Veeramani, D., Mani, K., A polynomial-time algorithm for optimal clustering in a
special class of 0,1-matrices (1996) Int J Prod Res, 34, pp. 2587-2611;
Ng, S.M., Bond energy, rectilinear distance and a worstcase bound for the group
technology problem (1991) J Opl Res Soc, 42, pp. 571-578;
Aarts, E., Lenstra, J.K., Introduction (1997) Local Search in Combinatorial
Optimization, pp. 1-17., Aarts E and Lenstra JK (eds) John Wiley amp; Sons, New
York;
Croes, G.A., A method for solving traveling-salesman problems (1958) Opns Res, 5,
pp. 791-812;
Garey, M.R., Johnson, D.S., (1979) Computers and Intractability. A Guide to the
Theory of NP-Completeness, , WH Freeman and Company: New York;
Garfinkel, R.S., Motivation and modelling (1985) The Traveling Salesman Problem,
pp. 17-36., Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (eds). John Wiley
amp; Sons, New York;
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., (1985) The
Traveling Salesman Problem, , John Wiley amp; Sons, New York;
Lenstra, J.K., Clustering a data array and the traveling-salesman problem (1974)
Opns Res, 22, pp. 413-414;
Fredman, M.L., Johnson, D.S., McGeoch, L.A., Ostheimer, G., Data structures for
traveling salesmen (1995) J Algorithms, 18, pp. 432-479;
Lin, S., Kernighan, B.W., An effective heuristic for the traveling- Salesman
problem (1973) Opns Res, 21, pp. 498-516;
Johnson, D.S., McGeoch, L.A., The traveling salesman problem: A case study (1997)
Local Search in Combinatorial Optimization, pp. 215-310., E Aarts and JK Lenstra
(eds). John Wiley amp; Sons, New York;
Kindervater, G.A.P., Savelsbergh, M.W.P., Vehicle routing: Handling edge exchanges
(1997) Local Search in Combinatorial Optimization, p. 337., E Aarts and JK Lenstra
(eds). John Wiley amp; sons, New York;
Chandra, B., Karloff, H., Tovey, C., New results on the old k-opt algorithm for the
traveling salesman problem (1999) SIAM J Comput, 28, pp. 1998-2029
CORRESPONDENCE ADDRESS: Torres-Velázquez, R.; PHI Investigation Operativa,
Direction de Empresas SA de CV, Av.Acoxpa 24-506A,Col.Prados Coapa, Tlalpan DF,
14390, Mexico; email: [email protected]
ISSN: 01605682
CODEN: JORSD
ABBREVIATED SOURCE TITLE: J Oper Res Soc
SOURCE: Scopus
Dahel, N.-E., Smith, S.B.

7801565879;56120534800;
Designing flexibility into cellular manufacturing systems
times.
0027574351&doi=10.1080%2f00207549308956767&partnerID=40&md5=d05ee9d75e80b22e7272123
fca8466f6
DOI: 10.1080/00207549308956767
AFFILIATIONS: Department of Information Systems and Operations Management, College
of Business Administration, The University of Toledo, Toledo, OH, 43606, United
States;
Stuart School of Business, Illinois Institute of Technology, Chicago, IL, 60616,
United States
ABSTRACT: The formation of cells for cellular manufacturing is often driven by many
desirable but conflicting goals. The minimization of intercell moves and the
maximization of cell flexibility are examples of such goals. Two models are
proposed for this problem. A 0–1 integer program minimizes intercell moves subject
to machine capacity and cell size constraints. A multiobjective model is then used
to form cells which are both flexible and have minimum interactions. Both models
group parts and machines simultaneously into the number of cells selected by the
cell designer. Computer solutions to a numerical example are obtained and
discussed. © 1993 Taylor & Francis Group, LLC.
INDEX KEYWORDS: Computer applications; Mathematical models; Mathematical
programming; Optimization, Cell flexibility; Cell formation problem; Cellular
manufacturing systems; Intercell moves, Manufacture
REFERENCES: Ang, C.L., Willey, P., A comparative study of the performance of pure
and hybrid group technology manufacturing systems using computer simulation
233;
Bhat, M.Y., Haupt, A., An efficient clustering algorithm (1976) IEEE Transactions
on Systems, Man, and Cybernetics, SMC, 6, pp. 61-64;
formulation of part-families and machine-cells (1987) International Journal of
Cohon, J.L., (1978) Multiobjectioe Programming and Planning, , New York: Academic
Press);
Dewitte, J., The use of similarity coefficients in production flow analysis (1980)
Dahel, N.-E., (1988) An Optimization Framework for the Cellularization of Cellular
Manufacturing Systems, , Unpublished doctoral dissertation, Illinois Institute of
Technology;
Research, 24 (5), pp. 1171-1192;
King, J.R., Machine-component grouping in production flowanalysis: An approach
Research, 18 (2), pp. 213-232;
pp. 117-133;
Kuziak, A., The generalized group technology concept (1987) International Journal
Engineer, 51 (2), pp. 53-57;
993-1009;
567-579;
Schrage, L., (1985) Linear, Integer and Quadratic Programming with LINDO, , Palo
Alto, CA: The Scientific Press);
Seifoddint, H., Wolfe, P.M., Application of the similarity coefficient method in
Tilsley, R., Mowbray, M., Lewis, F.A., Flexible cell production systems-A realistic
approach (1977) Annals of the CIRP, 25, pp. 269-271;
Vannelli, A., Kumar, K.R., A method for finding minimal bollIe-neck cells for
24 (2), pp. 387-400;
Wemmerlov, U., Hyer, L.N., Cellular manufacturing in the U.S. Industry: Asurvey of
CORRESPONDENCE ADDRESS: Dahel, N.-E.; Department of Information Systems and
Operations Management, College of Business Administration, The University of
Toledo, Toledo, OH, 43606, United States
ISSN: 00207543
SOURCE: Scopus
Huq, Faizul
7005850671;
Labor issues in the implementation of group technology cellular manufacturing
(1992) Production and Inventory Management Journal, 33 (4), pp. 15-20. Cited 30
times.
0027111887&partnerID=40&md5=f46cc9a3bbbaa35271230b0185112e7b
AFFILIATIONS: Univ of Texas at Arlington, Arlington, United States

ABSTRACT: Group technology (GT) and cellular manufacturing have become popular
terms in any discussion of manufacturing philosophy. GT involves identifying parts
manufactured in similar ways in order to facilitate scheduling and producing them
as a group. Like parts are grouped by virtue of their similarities using a
classification and coding scheme, and are separated by their essential differences.
According to Morris and Tersine [8] a primary application of GT 'is in batch
manufacturing where product variety is high and traditional layout design is by
equipment function.' Most U.S. manufacturers subscribe to the traditional layout
design, and thus are ideal for a GT conversion. Implementation of GT, however,
involves conversion of the traditional layouts to 'product-oriented layouts that
are referred to as cells'. The cells consists of groups of machines that process
similar parts. There are a number of different techniques used in organizing part
families and matching machine groupings. These techniques revolve around efficient
cell formation and optimal cell design. Regrettably, the GT techniques are weak in
their consideration of the human factors that effect the implementation of new
manufacturing systems. In this article, the labor issues that must be considered
before implementing GT will be discussed.
INDEX KEYWORDS: employment; Human engineering; Inspection; Personnel; Plant layout;
Scheduling; Vision, Cell formation problems; Celullar manufacturing;
Classification; Coding procedures; Group technology; Labor issues; Part families
organization, Manufacture
CORRESPONDENCE ADDRESS: Huq, Faizul; Univ of Texas at Arlington, Arlington, United
States
ISSN: 08978336
CODEN: PIMJE
ABBREVIATED SOURCE TITLE: Prod Invent Manage J
SOURCE: Scopus
Logendran, R.
57207586498;
Group scheduling problem: Key to flexible manufacturing systems
8352%2892%2990076-V&partnerID=40&md5=4d6aa814d6b33b97521ff04375770c45
DOI: 10.1016/0360-8352(92)90076-V
AFFILIATIONS: Department of Industrial, Manufacturing Engineering Oregon State
University Corvallis, OR 97331, United States
ABSTRACT: We present an efficient heuristic algorithm for determining the sequence
which minimizes the makespan of a group scheduling problem at the first level. The
problem, therefore, focuses on scheduling of parts (jobs) in a part family. In the
generation of partial schedules at each iteration, a job with a high mean total
processing time is given a higher priority than others. An example problem, chosen
from a real world application, is used to implement, the algorithmic steps. For
this example, it has also been shown that the makespan determine by the proposed
heuristic is smaller than that determined previously by two documented algorithms.
© 1992.
INDEX KEYWORDS: Algorithms; Heuristic methods; Scheduling, Cell formation problem;
Cellular manufacturing systems; Group scheduling problem; Heuristic algorithm,
REFERENCES: Al-Qattan, Designing GT Cells Enhanced by Group Scheduling: Key to
Flexible Manufacturing Systems (1988) Proceedings, IIE Integrated Systems
Conference;
Askin, Chiu, A Graph Partitioning Procedure for Machine Assignment and Cell
Formation in Group Technology (1990) International Journal of Production Research,
28 (8), p. 1555;
Manufacture (1982) Journal of Manufacturing Systems, 1, p. 1;
Cho, Enscore, Jr., Ham, A Heuristic Algorithm for Multistage Group Scheduling
Problem to Minimize Total Tardiness (1982) Proceedings of the Society of
Manufacturing Engineers;
Harhalakis, Nagi, Proth, An Efficient Heuristic in Manufacturing Cell Formation for
Group Technology Applications (1990) International Journal of Production Research,
28 (1), pp. 185-198;
Johnson, Optimal Two- and Three-Stage Production Schedules with Set-Up Times
Included (1954) Naval Research Logistics Quarterly, 1, pp. 61-68;
King, Machine-Component Grouping in Production Flow Analysis: An Approach Using
Research, 18 (2), pp. 213-232;
Logendran, Workload Based Model for Minimizing Total Intercell and Intracell Moves
in Cellular Manufacturing (1990) International Journal of Production Research, 28
(5), pp. 913-925;
Logendran, A Model for Duplicating Bottleneck Machines in the Presence of Budgetary
Limitations in Cellular Manufacturing (1991) International Journal of Production
Research, 29 (2), pp. 375-390
CORRESPONDENCE ADDRESS: Logendran, R.; Department of Industrial, Manufacturing
Engineering Oregon State University Corvallis, OR 97331, United States
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Wu, N.
7201444208;
An efficient approach to the cell formation with multiple machines for same machine
type
(1997) Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 14 (6), .
77449105743&partnerID=40&md5=5622b077a84d8db1caa88e26ad46221f
AFFILIATIONS: Department of Mechatronics Engineering, Shantou University, Shantou,

515063, China
ABSTRACT: In the real manufacturing systems, often there are multiple machines for
same machine types due to the capacity requirement. But up to now, the existing
algorithms cannot model such cell formation problem, so the result may be improper.
In this paper, such a problem is well-modeled by the presented network model, so an
efficient approach to cell formation is proposed.
AUTHOR KEYWORDS: Cell formation; Manufacturing systemi; Network model
REFERENCES: Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the US industry: A
survey of user (1989) International Journal of Production Research, 27, pp. 1511-
1530;
Kern, G.M., Wei, J.C., Eliminating exceptional elements in group technology (1991)
classification analysis in group technology (1991) Journal of Manufacturing
Systems, 10, pp. 442-488;
dealing with exceptional elements (1992) International Journal of Production
Research, 30, pp. 1029-1036;
pp. 84-97;
Research, 28, pp. 2057-2084;
Wu, N.Q., Salvendy, G., A modified network approach for the design of cellular
1409-1412
CORRESPONDENCE ADDRESS: Wu, N.; Department of Mechatronics Engineering, Shantou
University, Shantou, 515063, China
ISSN: 10008152
CODEN: KLYYE
ABBREVIATED SOURCE TITLE: Kong Zhi Li Lun Yu Ying Yong
SOURCE: Scopus
Durga Rajesh, K.V., Chalapathi, P.V., Chaitanya, A.B.K., Sairam, V., Anildeep, N.
57203667069;57208834660;57190815872;57190809903;57190812589;
measuring parameters for cell formation applications
(2016) ARPN Journal of Engineering and Applied Sciences, 11 (15), pp. 9212-9215.
Cited 8 times.
84983349066&partnerID=40&md5=1e38c4a476876aaf01670a774490c0dc
AFFILIATIONS: Department of Mechanical Engineering, K L University, Vaddeswaram,

Guntur District, Andhra Pradesh, India
ABSTRACT: In cellular manufacturing, formation of cell is a complex and crucial
step to increase the machine utilization and productivity of an organisation.
Binary format or ordinal data are given as input for the part-machine incidence
matrix of the cell formation problem. The cell formation problem may contain two or
more solutions due to its ill structure. These solutions may be compared using
performance measures and the optimal solution can be identified. A standard measure
known as Grouping Efficacy produce some conflicting results in some ill structure
data. In this paper a new performance measure in binary data known as Modified
Grouping Efficacy (MGE) is introduced to nullify the conflicting results obtained
by standard Grouping Efficacy. Similarly there are only very few performance
measures used as standard measures for ordinal data like GT Efficacy and Global
Efficiency. However, these performance measures can lead to subjective decisions
which reduce productivity of the organisation. So, in order to improve productivity
we have taken a new objective measure known as New Average Measure of Flexibility
(NAMF). The advantages of both proposed performance measures are demonstrated by
comparing with existing performance measures. © 2006-2016 Asian Research Publishing
Network (ARPN).
AUTHOR KEYWORDS: Average measure of flexibility; Binary format; Cell formation;
Modified grouping efficacy; Ordinal format; Performance measures
REFERENCES: Diaz, J.A., Luna, D., Luna, R., A GRASP heuristic for the manufacturing
cell formation problem (2010) Springer, 20, pp. 679-706;
Lee, K., Ahn, K.-I., GT efficacy: a performance measure for cell formation with
sequence data (2013) International Journal of Production Research, 51, pp. 6070-
6081;
Ham, I., Hitomi, K., Yoshida, T., (1985) Applications to production management, ,
Kluwer Nijhoffpublishing;
in cellular manufacturing (2001) Computers and industrial engineering, 39, pp. 1-
17;
systems (2013) Indian Academy of sciences, 38, pp. 421-428;
problem: A taxonomy and review (2006) International journal of Production
Economics, 101, pp. 329-352;
Hamza, S.A., Yulian, E., Adesta, T., Similarity coefficient measures applied to
integrate feasibility assessment and the design of cellular manufacturing systems
(2013) Australian Journal of Basic and Applied Sciences, 7, pp. 257-266;
Durga Rajesh, K.V., Performance Analysis of Selected Cell Formation Techniques for
the Design of a Cellular Manufacturing System (2014) International Journal of
Applied Engineering Research, 9, pp. 12141-12153;
Research, 18, pp. 213-232;
CORRESPONDENCE ADDRESS: Durga Rajesh, K.V.; Department of Mechanical Engineering, K
L UniversityIndia; email: [email protected]
ISSN: 18196608
ABBREVIATED SOURCE TITLE: ARPN J. Eng. Appl. Sci.
SOURCE: Scopus
Alhourani, F.
15847952900;
Machines reliability consideration in the generalized group technology problem
(2015) Journal of International Business and Economics, 15 (1), pp. 7-16.
84943532036&doi=10.18374%2fJIBE-15-
1.1&partnerID=40&md5=e4e01c0a7377b6415f5dfc22e8be6fd4
DOI: 10.18374/JIBE-15-1.1
AFFILIATIONS: University of Tampa, Tampa, FL, United States
ABSTRACT: Cell formation is an important problem in the design of cellular
manufacturing systems. Most cell formation methods appeared in the literature
assume that each part has one process plan and all machines are 100% reliable.
However, this is not realistic in the manufacturing systems. Considering parts
alternative process routings and machines reliability together can help in
realistic selection of process routings for parts. Also, considering these factors
in addition to operations sequence and production volumes makes the problem more
realistic. These factors are rarely considered all together in the machine cell
formation problem in the literature. Also, most of the methods appeared in the
literature used mathematical programming procedures. These procedures usually take
large amount of computational efforts to solve the problem when classical
optimization methods are used, especially for large-sized problems. Procedures
using the similarity coefficient method are more flexible in incorporating various
important production data. A new procedure that is based on the Similarity
Coefficient Method is developed for solving the machine cell formation problem
considering all the above mentioned important production factors. © 2015,
International Academy of Business and Economics. All rights reserved.
AUTHOR KEYWORDS: Group technology; Machine cell formation; Similarity coefficient
method
REFERENCES: Alhourani, F., Clustering algorithm for solving group technology
problem with multiple process routings (2013) Computers and Industrial Engineering,
66, pp. 781-790;
45, pp. 913-934;
considerations (2011) Computers and Industrial Engineering, 60, pp. 7-15;
Islam, K.S., Sarker, B.R., A similarity coefficient and machine-parts grouping in
38, pp. 699-720;
pp. 35-44;
Wang, H., A survey of maintenance policies of deteriorating systems (2002) European
partmachine grouping in cellular manufacturing (2007) International Journal of
CORRESPONDENCE ADDRESS: Alhourani, F.; University of TampaUnited States
PUBLISHER: International Academy of Business and Economics
ISSN: 15448037
ABBREVIATED SOURCE TITLE: J. Int. Bus. Econ.
SOURCE: Scopus
Chu, C.-H.
8319645300;
Recent advances in mathematical programming for cell formation
(1995) Manufacturing Research and Technology, 24 (C), pp. 3-46. Cited 36 times.
77957096111&doi=10.1016%2fS1572-4417%2806%2980034-
3&partnerID=40&md5=e124d5ceda490c38ec186c9b7bf2060b
DOI: 10.1016/S1572-4417(06)80034-3
AFFILIATIONS: Department of Management, College of Business, Iowa State University
of Science Technology, 300 Carver Hall, Ames, Iowa 50011, United States
ABSTRACT: Cell formation, one major problem with cellular manufacturing, involves
the process of grouping the parts with similar design features or processing
requirements into part families and the corresponding machines into machine cells.
Numerous analytical approaches to solve the problem have been introduced, among
which mathematical programming models and heuristic procedures constitute the
greatest part of the literature. This chapter presents a state-of- the-art review
based on a systematic survey of the literature. Survey results should help answer
or clarify many related questions for the cellular manufacturing community.
Examples have been provided to help the interested reader use earlier studies to
develop mathematical programming models. The purpose of this study is twofold: (1)
to examine the state-of-the-art of mathematical programming's use in cell formation
and (2) to illustrate the way by which a variety of cell formation problems can be
formulated by means of mathematical programming. Examples with different
objectives, constraints, and structures are provided, which not only represent
typical cell formation problems, but also can be used to demonstrate the way by
which the same scenario can be modeled through either objectives or constraints. ©
1995 Elsevier B.V.
REFERENCES: Adil, G.K., Rajamani, D., Strong, D., A Mathematical Model for Cell
Formation Considering Investment and Operational Costs (1993) European Journal of
Ahmed, M.U., Ahmed, N.U., Nandkeolyar, U., A Volume and Material Handling Cost
Based Heuristic for Designing Cellular Manufacturing Cells (1991) Journal of
Al-Qattani, I., Designing Flexible Manufacturing Cells Using a Branch and Bound
Method (1990) International Journal of Production Research, 28 (2), pp. 325-336;
Alfa, A.S., Chen, M., Heragu, S.S., Integrating the Grouping and Layout Problems in
Cellular Manufacturing Systems (1992) Computers & Industrial Engineering, 23, pp.
1-4;
Alfa, A.S., Chen, M., Heragu, S.S., Integrating the Grouping and Layout Problems in
Cellular Manufacturing Systems (1992) Computers & Industrial Engineering, 23, pp.
55-58;
Askin, R.G., Chiu, K.S., A Graph Partitioning Procedure for Machine Assignment and
Cell Formation in Group Technology (1990) International Journal of Production
Research, 28 (8), pp. 1555-1572;
Boctor, F.F., A Linear Formulation of the Machine Cell Formation Problem (1991)
Burbidge, J.L., Production Flow Analysis (1963) The Production Engineer, 42, pp.
742-752;
Chandrasekharan, M.P., Rajagopalan, R., An Ideal Seed Non-Hierarchical Clustering
Research, 24, pp. 451-464;
Cheng, C., A Tree Search Algorithm for Designing a Cellular Manufacturing System
(1993) OMEGA, 21 (4), pp. 489-496;
Choobineh, F., A Framework for the Design of Cellular Manufacturing Systems (1988)
Chu, C.H., Pan, P., A Comparison of Hierarchical Clustering Techniques for
Manufacturing Cellular Formation (1988) Proceedings of the Third International
Conference on CAD/CAM, Robotics, and Factory of the Future, Vol. II, pp. 151-154;
Chu, C.H., Lee, W., A Comparison of 0–1 Integer Programming Models for Cellular
Manufacturing (1989) Proceedings of the National Decision Sciences Institute
Conference, pp. 181-184;
Chu, C.H., Clustering Analysis in Manufacturing Cellular Formation (1989) OMEGA,
17, pp. 289-295;
Chu, C.H., Tsai, M., A Comparison of Three Array-Based Clustering Techniques for
Manufacturing Cellular Formation (1990) International Journal of Production
Research, 28, pp. 1417-1433;
Chu, C.H., Hayya, J.C., Fuzzy Clustering Approach to Manufacturing Cell Formation
Chu, C.H., Shih, W.L., Simulated Annealing for Manufacturing Cell Formation (1992)
Chu, C.H., Tsai, C.C., Manufacturing Cell Formation in a Fuzzy Environment (1993)
Chu, C.H., A Neural Network Model for Manufacturing Cell Formation (1994) Working
paper, , January Department of Management, Iowa State University;
Co, H.C., Araar, A., Configuring Cellular Manufacturing Systems (1988)
Dahel, N.E., An Operation Sequence Based Model for Cell Formation Decisions (1993)
Proceedings of the National Decision Science Institute Conference, pp. 1519-1521;
Ferreira Ribeiro, J.F., Pradin, B., A Methodology for Cellular Manufacturing Design
Frazier, G.V., Gaither, N., Olson, D., A Procedure for Dealing with Multiple
Objectives in Cell Formation Decisions (1990) Journal of Operations Management, 9
(4), pp. 465-480;
Gongaware, T.A., Ham, I., Cluster Analysis Applications for Group Technology
Manufacturing Systems (1981) Manufacturing Engineering Transactions, pp. 503-508;
Gunasingh, K.R., Lashkari, R.S., The Cell Formation Problem in Cellular
Manufacturing Systems — A Sequential Modeling Approach (1989) Computers &
Gunasingh, K.R., Lashkari, R.S., Machine Grouping Problem in Cellular Manufacturing
Systems — An Integer Programming Approach (1989) International Journal of
Gunasingh, K.R., Lashkari, R.S., Simultaneous Grouping of Parts and Machines in
Cellular Manufacturing Systems — An Integer Programming Approach (1991) Computers &
Gupta, Y.P., Gupta, M.C., Sundram, C., Kumar, A., Minimizing Total Intercell and
Intracell Moves in Cellular Manufacturing: A Genetic Algorithm Approach (1992)
Proceedings of the Decision Sciences Institute Conference, pp. 1523-1525;
Han, C., Ham, I., Multiobjective Cluster Analysis for Part Family Formations (1986)
Harhalakis, G., Nagi, R., Proth, J.M., An Efficient Heuristic in Manufacturing Cell
Formation for Group Technology Applications (1990) International Journal of
Hyer, N.L., Wemmerlöv, U., Group Technology Oriented Coding Systems: Structures,
Applications and Implementation (1985) Production and Inventory Management, 26, pp.
55-78;
Kamrani, A.K., Parsaei, H.R., A Group Technology Based Methodology for Machine Cell
Formation in a Computer Integrated Manufacturing Environment (1993) Computers &
King, J.R., Machine-Component Group Formation in Group Technology (1980) OMEGA, 8,
pp. 193-199;
King, J.R., Machine-Component Grouping in Production Flow Analysis: An Approach
Research, 18, pp. 213-232;
King, J.R., Nakornchai, V., Machine-Component Group Formation in Group Technology:
Review and Extension (1982) International Journal of Production Research, 20, pp.
117-133;
Kusiak, A., The Part Families Problem in Flexible Manufacturing Systems (1985)
Kusiak, A., Heragu, S.S., Group Technology (1987) Computers in Industry, 9 (2), pp.
83-91;
Kusiak, A., Cheng, C., A Branch-and-Bound Algorithm for Solving the Group
Technology Problem (1990) Annals of Operational Research, 26, pp. 415-431;
Lashkari, R.S., Dutta, S.P., Nadoli, G., Part Family Formation in Flexible
Manufacturing Systems — An Integer Programming Approach (1987) Modern Production
Management Systems, pp. 627-635., Kusiak A. Elsevier Science Publishers B.V;
Lee, H., Garcia-Diaz, A., A Network Flow Approach to Solve Clustering Problem in
Group Technology (1993) International Journal of Production Research, 31 (3), pp.
603-612;
Lee, W., Chu, C.H., An Efficient Heuristic for Grouping Part Families (1990)
Midwest DSI Proceedings, pp. 62-64;
Logendran, R., Methodology for Converting a Functional Manufacturing System into a
Cellular Manufacturing System (1993) International Journal of Production Economics,
29 (1), pp. 27-41;
Logendran, R., A Binary Integer Programming Approach for Simultaneous Machine-Part
Grouping in Cellular Manufacturing Systems (1993) Computers & Industrial
Engineering, 24 (3), pp. 329-336;
Mcauley, J., Machine Grouping for Efficient Production (1972) The Production
Min, H., Shin, D., Simultaneous Formation of Machine and Human Cells in Group
Technology: A Multiple Objective Approach (1993) International Journal of
Nagi, R., Harhalakis, G., Proth, J.M., Multiple Routings and Capacity
Considerations in Group Technology Applications (1990) International Journal of
Purcheck, G.F.K., A Mathematical Classification as a Basis for the Design of Group-
Technology Production Cells (1975) The Production Engineer, pp. 35-48., January;
Purcheck, G.F.K., A Linear-Programming Method for the Combinatorial Grouping of an
Incomplete Power Set (1975) Journal of Cybernetics, 5 (4), pp. 51-76;
Rajamani, D., Singh, N., Aneja, Y.P., Integrated Design of Cellular Manufacturing
Systems in the Presence of Alternative Process Plans (1990) International Journal
Rajamani, D., Singh, N., Aneja, Y.P., A Model for Cell Formation in Manufacturing
Systems with Sequence Dependence (1992) International Journal of Production
Research, 30 (6), pp. 1227-1236;
Rajamani, D., Singh, N., Aneja, Y.P., Selection of Parts and Machines for
Cellularization: A Mathematical Programming Approach (1992) European Journal of
Sankaran, S., Multiple Objective Decision Making Approach to Cell Formation: A Goal
Programming Model (1990) Mathematical Computational Modeling, 13 (9), pp. 71-82;
Sankaran, S., Kasilingam, R.G., On Cell Size and Machine Requirements Planning in
Group Technology Systems (1993) European Journal of Operational Research, 69 (3),
pp. 373-383;
Selvam, R.P., Balasubramanian, K.N., Algorithmic Grouping of Operation Sequences
Shafer, S., Rogers, D.F., A Goal Programming Approach to the Cell Formation Problem
Shafer, S., Kern, G.M., Wei, J.C., A Mathematical Programming Approach for Dealing
with Exceptional Elements in Cellular Manufacturing (1992) International Journal of
Shafer, S.M., Rogers, D.F., Similarity and Distance Measures for Cellular
Manufacturing: Part I — A Survey (1993) International Journal of Production
Research, 31 (5), pp. 1133-1142;
Shafer, S.M., Rogers, D.F., Similarity and Distance Measures for Cellular
Manufacturing: Part II — An Extension and Comparison (1993) International Journal
Shtub, A., Modeling Group Technology Cell Formation as a Generalized Assignment
Song, S., Hitomi, K., GT Cell Formation for Minimizing the Intercell Parts Flow
Srinivasan, G., Narendran, T.T., Mahadevan, B., An Assignment Model for the Part-
Families Problem in Group Technology (1990) International Journal of Production
Research, 28 (1), pp. 145-152;
Steudel, H.J., Ballakur, A., A Dynamic Programming Based Heuristic for Machine
Grouping in Manufacturing Cell Formation (1987) Computers & Industrial Engineering,
12 (3), pp. 215-222;
Vakharia, A.J., Methods of Cell Formation in Group Technology: A Framework for
Evaluation (1986) Journal of Operations Management, 6 (3-4), pp. 257-271., May/Aug;
Vakharia, A.J., Chang, Y.L., Selim, H.M., Cell Formation in Group Technology: A
Combinatorial Search Approach (1992) Proceedings of the National Decision Sciences
Institute Conference, pp. 1310-1312;
Vakharia, A.J., Kaku, B.K., Redesigning a Cellular Manufacturing System to Handle
Long-Term Demand Changes: A Methodology and Investigation (1993) Decision Sciences,
24 (5), pp. 909-930;
Component Grouping Problem with Multiple Objectives (1992) Computers & Industrial
Engineering, 22 (4), pp. 469-480;
Venugopal, V., Narendran, T.T., Cell Formation in Manufacturing Systems Through
Simulated Annealing: An Experimental Evaluation (1992) European Journal of
Vohra, T., Chen, D.S., Chang, J.C., Chen, H.C., A Network Approach to Cell
Formation in Cellular Manufacturing (1990) International Journal of Production
Research, 28 (11), pp. 2075-2084;
Wei, J.C., Gaither, N., An Optimal Model for Cell Formation Decisions (1990)
Wei, J.C., Gaither, N., A Capacity Constrained Multiobjective Cell Formation Method
Wemmerlöv, U., Hyer, N.L., Procedures for the Part Family/Machine Group
Identification Problem in Cellular Manufacturing (1986) Journal of Operations
Wemmerlöv, U., Hyer, N.L., Research Issues in Cellular Manufacturing (1987)
CORRESPONDENCE ADDRESS: Chu, C.-H.; Department of Management, College of Business,
Iowa State University of Science Technology, 300 Carver Hall, Ames, Iowa 50011,
United States
ISSN: 15724417
ABBREVIATED SOURCE TITLE: Manuf. Res. Technol.
SOURCE: Scopus
Shtubt, A.
57030282100;
Modelling group technology cell formation as a generalized assignment problem
times.
0024656202&doi=10.1080%2f00207548908942586&partnerID=40&md5=d1af4a95e4ca1fdd929358d
55a29e515
DOI: 10.1080/00207548908942586
AFFILIATIONS: Department of Industrial Engineering, Tel Aviv University, Ramat,
Aviv, 69978, Israel
ABSTRACT: The formation of part families and technology cells is a step in
implementing Group Technology, In this paper we show that the simple cell-formation
problem is equivalent to the Generalized Assignment Problem (GAP). Furthermore, we
show that the general case of cell formation, in which several process plans are
considered for each part type, is also equivalent to the GAP. © 1989 Taylor &
Francis Group, LLC.
INDEX KEYWORDS: Mathematical Programming; Process Control--Computer Applications;
Systems Science and Cybernetics--Heuristic Programming, Generalized Assignment
Problem; Group Technology; Integer Programming; Technology Cell Formation, Systems
Analysis
Fisher, M.L., Jaikumar, R., Van Wassenhove, L.N., A multiplier adjustment method
for the Generalized Assignment Problem (1986) Management Science, 9, p. 1095;
Research, 18, p. 213;
review and extension (1982) International Journal of Production Research, 20, p.
117;
Klastorin, T.D., An effective subgradient algorithm for the generalized assignment
problem (1979) Computers and Operations Research, 6, p. 155;
of Production Research, 25, p. 561;
Martello, S., Toth, P., An alogorithm for the generalized assignment problem (1981)
Operational Research, , J. P. Brans (editor), Amsterdam: North-Holland;
Ross, G.T., Soland, R.M., A branch and bound algorithm for the generalized
assignment problem (1977) Mathematical Programming, 8, p. 91;
Vanelli, A., Kumar, K.R., A method for finding minimal bottle-neck cells for
24, p. 387
CORRESPONDENCE ADDRESS: Shtubt, A.; Department of Industrial Engineering, Tel Aviv
University, Ramat, Aviv, 69978, Israel
ISSN: 00207543
SOURCE: Scopus
Shashikumar, S., Raut, R.D., Narwane, V.S., Gardas, B.B., Narkhede, B.E., Awasthi,
A.
57209105934;42262603800;57205744381;57191519812;55642871600;57203055159;
A novel approach to determine the cell formation using heuristics approach
(2019) OPSEARCH, 56 (3), pp. 628-656.
85066507517&doi=10.1007%2fs12597-019-00381-
4&partnerID=40&md5=8189cb8fd0ce75105dd71fa32f233f73
DOI: 10.1007/s12597-019-00381-4
AFFILIATIONS: Department of Mechanical Engineering, K.J. Somaiya College of
Engineering, Vidhyavihar (East), Mumbai, 400077, India;
Department of Operations and Supply Chain Management, National Institute of
Industrial Engineering (NITIE), Vihar Lake, NITIE, Powai, Mumbai, Maharashtra
400087, India;
Department of Production Engineering, Veermata Jijabai Technological Institute
(VJTI), H.R Mahajani Marg, Matunga, Mumbai, Maharashtra 400019, India;
Department of Industrial Engineering and Management Systems, National Institute of
Industrial Engineering (NITIE), Vihar Lake, NITIE, Powai, Mumbai, Maharashtra
400087, India;
Concordia Institute for Information Systems Engineering (CIISE), Concordia
University, Montreal, H3G2W1, Canada
ABSTRACT: Cellular manufacturing is a vital part of lean manufacturing. It is an
application of group technology. Three problems in cellular manufacturing are cell
formation, machine layout and cell layout problems. However, these problems are NP-
hard optimisation problems and cannot be solved using exact methods. A difficult
part is to form the machine groups or cells, also called Cell Formation Problem and
several techniques have been proposed to solve the same. In this paper, the Cell
Formation Problem is solved using an integrated approach of heuristics along with
Genetic Algorithm and Membership Index. Heuristics technique is used for domain
selection which is used in Genetic Algorithm as the initial population. Genetic
Algorithm is useful for optimising the results of machine assignment to cells, and
Membership Index is used to assign parts to the cells. The performance is analysed
using performance measures such as group technology efficiency and some exceptional
elements. The proposed computational methodology is tested on standard problems of
diverse size from literature papers using the hybrid approach. Results from test
problems show that the proposed method is effective and efficient. The paper is
useful from the practicality aspect and also relevant from current research and
industry trends. © 2019, Operational Research Society of India.
Heuristics; Hybrid approach; Membership index
REFERENCES: Batsyn, M.V., Batsyna, E.K., Bychkov, I.S., (2019) On Np-Completeness
of the Cell Formation Problem;
Belal, M.A., Haggag, M.H., A structured-population genetic-algorithm based on
hierarchical hypercube of genes expressions (2013) Int. J. Comput. Appl., 64 (22),
pp. 5-18;
cellular manufacture (1982) J. Manuf. Syst., 1 (1), pp. 65-75;
Chang, C.C., Wu, T.S., Li, F.C., An efficient tabu search approach to determine
cell formation, cell layout, and intracellular machine layout in the cellular
manufacturing system (2013) Expert Syst. Appl. Int. J., 36 (2), pp. 3652-3661;
Costa, A., Cappadonna, F.A., Fichera, S., A hybrid genetic algorithm for minimizing
makespan in a flow-shop sequence-dependent group scheduling problem (2017) J.
Intell. Manuf., 28 (6), pp. 1269-1283;
Devaki, P., Valarmathi, M.L., Job scheduling using genetic algorithm with qos
satisfaction in grid (2012) Eur. J. Sci. Res., 74 (2), pp. 272-285;
El-Mihoub, T.A., Hopgood, A.A., Nolle, L., Battersby, A., Hybrid genetic
algorithms: a review (2006) Eng. Lett., 13 (2), pp. 124-137;
similarity coefficient (2008) J. Ind. Syst. Eng., 1 (4), pp. 318-344;
Ghosh, T., Sengupta, S., Chattopadhyay, M., Dan, P.K., Meta-heuristics in cellular
manufacturing: a state-of-the-art review (2011) Int. J. Ind. Eng. Comput., 2 (5),
pp. 198-215;
Golmohammadi, A., Bani-Asadi, H., Zanjani, H., Tikani, H., A genetic algorithm for
preemptive scheduling of a single machine (2016) Int. J. Ind. Eng. Comput., 7 (4),
pp. 607-614;
185-198;
alternative routings (2018) Mater. Today Proc., 5 (1), pp. 1766-1775;
Imran, M., Kang, C., Lee, Y.H., Jahanzaib, M., Aziz, H., Cell formation in a
cellular manufacturing system using simulation integrated hybrid genetic algorithm
(2017) Comput. Ind. Eng., 105, pp. 123-135;
Jiang, P., Ding, K., Leng, J., Towards a cyber-physical-social-connected and
service-oriented manufacturing paradigm: social Manufacturing (2016) Manuf. Lett.,
7, pp. 15-21;
Joshua, R., Raj, S., Vasudevan, V., Grid scheduling with smart genetic algorithm
(2011) Int. J. Grid Comput. Multi Agent Syst., 2 (1), pp. 1-10;
Kheirkhah, A., Ghajari, A., A three-phase heuristic approach to solve an integrated
cell formation and production planning problem (2018) Uncertain Supply Chain
Manag., 6 (2), pp. 213-228;
Khorasgani, S.M.S., Ghaffari, M., Developing a cellular manufacturing model
considering the alternative routes, tool assignment, and machine reliability (2018)
J. Ind. Eng. Int., 14 (3), pp. 627-636;
Kia, R., Baboli, A., Javadian, N., Tavakkoli, M.R., Kazemi, M., Khorrami, J.,
Solving a group layout design model of a dynamic cellular manufacturing system with
alternative process routings, lot splitting and flexible reconfiguration by
simulated annealing (2012) Comput. Oper. Res., 39 (11), pp. 2642-2658;
Kumar, R., Singh, S.P., Designing robust stochastic bi-objective cellular layout in
manufacturing systems (2017) Int. J. Manag. Concepts Philos., 10 (2), pp. 147-164;
Leno, I.J., Sankar, S.S., Ponnambalam, S.G., MIP model and elitist strategy hybrid
GA–SA algorithm for layout design (2018) J. Intell. Manuf., 29 (2), pp. 369-387;
Lopez, F.G., Gover, M.R., Leskela, J., Sauer, E.M., Schirmer, L., Wyssmann, J.,
Attachment styles, shame, guilt, and collaborative problem-solving orientations
(1997) Personal Relationships, 4 (2), pp. 187-199;
Mahapatra, S.S., Pandian, S.R., Genetic cell formation using ratio level data in
cellular manufacturing systems (2008) Int. J. Adv. Manuf. Technol., 38 (5), pp.
630-640;
Mohammadi, M., Forghani, K., A dynamic programming enhanced simulated annealing
algorithm for solving bi-objective cell formation problem with duplicate machines
(2015) Decis. Sci. Lett., 4 (2), pp. 261-276;
Mojtaba, S., Reza, T.M., A grouping genetic algorithm for the cell formation
problem (2009) Int. J. Nat. Eng. Sci., 3 (1), pp. 73-78;
attractiveness of group technology cellular layouts (1990) Manag. Sci., 36, pp.
1567-1578;
Mulvey, J.M., Crowde, H.P., Cluster analysis: an application of Lagrangian
relaxation (1979) Manag. Sci., 25 (4), pp. 329-340;
Murugaiyan, P., Ramasamy, P., Hybrid genetic algorithm for machine-component cell
formation (2015) Intell. Inf. Manag., 7 (3), pp. 107-122;
Pandey, R., Agrawal, M., Tomar, A.S., Concept of group technology in the field of
cellular manufacturing and design of manufacturing system (2017) Imp. J.
Interdiscip. Res., 3 (5), pp. 1099-1103;
Patel, J.N., Patel, S.V., Approaches to solve cell formation, machine layout and
cell layout problem: a Review (2014) Trans. Mach. Learn. Artif. Intell., 2 (5), pp.
80-96;
Paydar, M.M., Mahdavi, I.S.I., Solimanpur, M., Applying simulated annealing for
designing cellular manufacturing systems using MDmTSP (2010) Comput. Ind. Eng. J.,
59, pp. 929-936;
for cellular manufacturing systems using an ant colony system approach (2005) Int.
J. Adv. Manuf. Technol., 25 (9), pp. 1013-1019;
with capacity planning and routing (1998) Ann. Oper. Res., 77 (2), pp. 79-95;
cell formation in cellular manufacturing (2010) J. Softw. Eng. Appl., 3 (7), pp.
674-682;
Shahparvari, S., Chiniforooshan, P., Hybridization of genetic algorithm and linear
programming for solving cell formation problem with alternative process routings
(2012) Proceedings of the World Congress on Engineering and Computer Science;
replicate machines (1999) Int. J. Prod. Res., 37 (3), pp. 707-720;
supply chain design (2018) Int. J. Adv. Manuf. Technol., 95 (5-8), pp. 2429-2447;
Soto, R., Crawford, B., Aste Toledo, A., Castro, C., Paredes, F., Olivares, R.,
Solving the manufacturing cell design problem through binary cat swarm optimization
with dynamic mixture ratios (2019) Comput. Intell. Neurosci, 2019;
Tambuskar, D.P., Narkhede, B.E., Mahapatra, S.S., A novel algorithm for machine
cell formation to enhance agility of manufacturing supply chain (2012) Proceedings
of 1St International Conference on BPSCM, pp. 22-23., SOA University, Bhubaneshwar;
Thanh, L., Ferland, J.A., Elbenani, B., Thuc, N.D., Nguyen, V.H., A computational
study of hybrid approaches of metaheuristic algorithms for the cell formation
problem (2015) J. Oper. Res. Soc., 45 (2), pp. 96-110;
Utkina, I.E., Batsyn, M.V., Batsyna, E.K., A branch-and-bound algorithm for the
simulated annealing: an experimental evaluation (1992) Eur. J. Oper. Res., 63, pp.
409-422;
considerations in cellular manufacturing (1998) Ann. Oper. Res., 77 (3), pp. 97-
107;
434-446;
cellular manufacturing design and layout (2007) Eur. J. Oper. Res., 181, pp. 156-
167;
Yin, Y., Stecke, K.E., Li, D., The evolution of production systems from industry
2.0 through industry 4.0 (2018) Int. J. Prod. Res., 56 (1-2), pp. 848-861;
genetic algorithms (2004) J. Manuf. Technol. Manag., 15 (6), pp. 433-444
CORRESPONDENCE ADDRESS: Awasthi, A.; Concordia Institute for Information Systems
Engineering (CIISE), Concordia UniversityCanada; email: [email protected]
PUBLISHER: Springer
ISSN: 00303887
ABBREVIATED SOURCE TITLE: Opsearch
SOURCE: Scopus
Arikaran, P., Jayabalan, V.

54386519000;15762676400;
A grouping genetic algorithm for solving the machine component grouping problem
(2011) European Journal of Scientific Research, 63 (3), pp. 347-357.
80955123488&partnerID=40&md5=e06d9ed9cd61b75e5c4d8803907b6a82
AFFILIATIONS: Department of Manufacturing Engineering, Anna University, Chennai-

600 025, India
ABSTRACT: In manufacturing, the machine-part cell formation problem addresses the
issues surrounding the formation of part families based on the processing
requirements of the components and the identification of machine groups based on
their ability to process specific part families. Cell formation is often the first
step in solving facility layout design problems. Past research has shown that one
key aspect of attaining efficient grouping of parts and machines is the block-
diagonalization of the given machine-part incidence matrix. This paper presents a
Proposed Grouping Genetic Algorithm (Pro-GGA) that has been developed for solving
the cell formation problem partially adopting Falkenauer's (1998) grouping genetic
algorithm (GGA), which is an extension of general GAs. The Pro-GGA employs a
combined rank and roulette wheel selection, which is a new mechanism for creating
successive generations. The Pro-GGA gauges the quality of the GGA's solutions using
the measurement of efficacy (Kumar and Chandrasekharan 1990). The Pro-GGA performs
very well when applied to a variety of problems from the literature. With a minimal
number of parameters and a straightforward encoding, Pro-GGA is able to match
solutions with several highly complex algorithms and heuristics that were
previously employed to solve these problems. © EuroJournals Publishing, Inc. 2011.
AUTHOR KEYWORDS: Cell formation; Cellular manufacture; Genetic Algorithms; Group
technology; Meta-heuristics
pp. 101-113;
Khouja, A.H.M., Vergara, F.E., Use of genetic algorithms to solve production and
operations management problems - A review (2003) International Journal of
Boe, W.J., Cheng, C.H., Close neighbour algorithm for designing cellular
2097-2116;
3651-3669., DOI 10.1080/00207540110068781;
genetic algorithm (2003) Computers and Operations Research, 30 (11), pp. 1575-
1593., DOI 10.1016/S0305-0548(02)00085-0, PII S0305054802000850;
the binary data matrices for group technology's (1989) International Journal of
Research, 36 (5), pp. 1325-1337;
Algorithms, , Cambridge: MA: MIT Press;
Transactions On Evolutionary Computations, 4, pp. 93-113;
Falkenauer, E., (1998) Genetic Algorithms and Grouping Problems, p. 220., New York:
Wiley;
Holland, J.H., (1975) Adaptation In Natural and Artificial Systems, , Ann Arbor Mi:
University Of Michigan Press;
Hwang, H., Ji-Ung, S., A genetic-algorithm-based heuristic for the GT cell
formation problem (1996) Computers and Industrial Engineering, 30 (4), pp. 941-
955., DOI 10.1016/0360-8352(96)00044-7;
2059-2079., DOI 10.1016/j.cor.2005.08.010, PII S0305054805002649;
King, J.R., Nakornchai, V., Machine-component group formation in-group technology:
117-133;
1721;
manufacturing cells (1999) International Journal of Production Economics, 60, pp.
421-426;
manufacturing cell design (1999) Computers and Industrial Engineering, 36, pp. 379-
389;
Pierreval, H.C., Pairs, C.J.L., Viguier, F., Evolutionary Approaches to the design
and organization of manufacturing systems (2003) Computers and Industrial
certain constraints (2000) International Journal of Production Economics, 64 (1),
pp. 267-278., DOI 10.1016/S0925-5273(99)00064-X;
Rao, H.A., Pham, S.N., Gu, P., Genetic Algorithms-based approach for design of
Reeves, C.R., Genetic Algorithm for flow shop sequencing (1995) Computers and
Research, 28 (1), pp. 145-152;
463-478;
1989-2007;
S0925527301001645;
part populations (1999) IIE Transactions (Institute of Industrial Engineering), 31,
pp. 11-20;
pp. 829-853., DOI 10.1080/00207540512331311859;
2158., DOI 10.1080/00207540210131851
CORRESPONDENCE ADDRESS: Arikaran, P.; Department of Manufacturing Engineering, Anna
University, Chennai- 600 025, India; email: [email protected]
ISSN: 1450216X
ABBREVIATED SOURCE TITLE: Eur. J. Sci. Res.
SOURCE: Scopus

35789896200;7203045062;
Design of flexible manufacturing cell considering uncertain product mix requirement
(2008) International Journal of Agile Systems and Management, 3 (1-2), pp. 37-60.
Cited 4 times.
84863703315&doi=10.1504%2fIJASM.2008.019598&partnerID=40&md5=1d8cb9cb21e6da243885b9
1fc5582128
DOI: 10.1504/IJASM.2008.019598
Engineering, Indian School of Mines University, Dhanbad, India;
Department of Mechanical Engineering, M.N.N.I.T., India
ABSTRACT: In the real-world manufacturing, the requirement of number and the
attribute of product may not be known exactly at the time of designing the
manufacturing cell. The design of manufacturing cell requires to identify machine
groups and part families in Cellular Manufacturing (CM) system. The success of a CA
system is sensitive to fluctuations in the demand for products and the product mix.
A large number of papers on manufacturing cell design have been published so far,
but very few of them have considered random product mix constraint at the design
stage. Little work has been reported which incorporated real-life production
parameters like operation sequence, production volume, batch size, material
handling capacity, processing time, setup time, machine capacity and cost factors.
Considerations of these important parameters make the cell formation problem more
complex, but realistic. This paper presents a new formulation of the part
family/machine cell formation problem that addresses the dynamic nature of the
production environment by considering a multiperiod forecast of product mix and
demand during the formation of part families and machine cells. The computational
procedure of the algorithm has been illustrated by an example. Numerical results
indicate that the proposed methodology is flexible, efficient and may be effective
even for industrial problems. Copyright © 2008 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Cellular manufacturing systems; Intercell movement; Operation
sequence; Random product mix
weighted similarity coefficients (2005) Computers and Industrial Engineering, 48,
pp. 553-570;
(1996) International Journal of Production Research, 34 (5), pp. 1361-1380., ) ‘ ’;
Askin, R.G., Subramanian, P.S., Cost-based heuristic for group technology

(2001) Integrated Manufacturing Systems, 12, pp. 258-274;
139., Nos;
Burke, L.I., Kamal, S., Fuzzy art and cellular manufacturing (1992) Artificial
Neural Networks in Engineering, pp. 779-1184;
37;
Carpenter, G.A., Grossberg, S., A massive architecture for a self organizing neural
pattern recognition (1987) Computer Vision, Graphics Image Processing, pp. 54-115;
of binary data machines for group technology (1989) International Journal of
formation problem (1995) International Journal of Production Research, 33 (9), p.
1995;
2601-2614;
109-128;
cellular manufacturing system (2006) International Journal of Production Economics,
103, pp. 767-783;
Dixit, A.R., Mishra, P.K., Machine-cell formation using genetic algorithm (2004)
National Conference on Advance Manufacturing and Robotics, pp. 293-299., ) ‘ ’,
Central Mechanical Engineering Research Institute, West Bengal, India;
Dixit, A.R., Mishra, P.K., Heuristic based approach of cell formation considering
and Engineering Management, 2, pp. 1101-1107., ) ‘ ’, London, ICMEEM_44 The World
Congress on Engineering 2007 Proceedings book (978-988-98671-2-6);
Dobando, D., Lozano, S., Bueno, J.M., Larraneta, J., Cell formation using a Fuzzy
Min-Max neural network (2002) International Journal of Production Research, 40 (1),
pp. 93-107;
Gupta, Y.P., Gupta, M.C., Kumar, A., Sundaram, C., Minimising total intercell and
Intracell moves cellular manufacturing system: A genetic algorithm approach (1995)
Harhalakis, G., Nagi, R., Xie, X.L., Manufacturing cell design using simulated
annealing: An industrial application (1990) Journal of Intelligent Manufacturing,
pp. 1-8;
Harhalakis, G., Nagi, R., Proth, J.M., Manufacturing cell formation under random
Jayakrishnan, N.G., Narender, T.T., CASE: A clustering algorithm for cell formation
157-179;
Kumar, K.R., Vannelli, A., Strategic subcontracting for efficient dis-aggregated
1715-1728;
Kusiak, A., Chow, W.S., Efficient solving of the group technology (1987) Journal of
Minimising intercell movements and balancing workload among duplicated machines
Lozano, S., Canca, D., Gurrreo, F., Garcia, J.M., Machine grouping using sequence-
based similarity coefficients and neural network (2001) Robotics and Computer
Mungwattana, A., (2000) Designing Cellular Manufacturing Systems for Dynamic and
Uncertain Production Requirement with Presence of Routing Flexibility, , PhD
Thesis, Virginia Polytechnic Institute and state University;
Muruganandam, A., Prabharan, G., Asokan, P., Baskaran, V., A memetic algorithm
approach to the cell formation problem (2005) International Journal of Advance
Peker, A., Kara, Y., Parameter setting of the Fuzzy ART neural network to part-
42 (6), pp. 1257-1278;
373-383;
Sarker, B.R., Xu, Y., Operation sequences-based formation methods: A critical
demand changes (2007) Computers and Industrial Engineering;
flexible cellular manufacturing (1996) International Journal of Production,
Planning and Control, 7, pp. 585-593;
2185-2207;
pp. 84-97;
Venugopal, V., Narendran, T.T., Cell formation in manufacturing systems through a
simulated annealing: An experimental evolution (1992) European Journal of
Wicks, E., (1995) Designing Cellular Manufacturing Systems with Time Varying
Product Mix and Recourse Availability, , PhD Thesis, Virginia Polytechnic Institute
and state University;
Wicks, E.M., Reasor, D.J., Designing cellular manufacturing systems with dynamic
1409-1421;
Yasuda, K., Yin, Y., Dissimilarity for solving the cell formation problem in
cellular manufacturing (2001) Computers and Industrial Engineering, 39, pp. 1-17;
pp. 829-853;
855-906;
problem involving processing time and lot size (2003) Computers and Industrial
CORRESPONDENCE ADDRESS: Dixit, A.R.; Department of Mechanical Engineering and
Mining Machinery Engineering, Indian School of Mines UniversityIndia; email:
[email protected]
ISSN: 17419174
ABBREVIATED SOURCE TITLE: Int. J. Agil. Syst. Manag.
SOURCE: Scopus
Eski, O., Ozkarahan, I.

14037503300;6601996431;
A simulation based fuzzy goal programming model for Cell Formation
(2007) Proceedings - Fourth International Conference on Fuzzy Systems and Knowledge
Discovery, FSKD 2007, 3, art. no. 4406287, pp. 493-498. Cited 1 time.
44049090694&doi=10.1109%2fFSKD.2007.124&partnerID=40&md5=e0dc52dd88b20259f4568fd4e8
fa7655
DOI: 10.1109/FSKD.2007.124
AFFILIATIONS: Dokuz Eylul University, Department of Industrial Engineering, Turkey;
Troy University, Department of Computer Science, United States

ABSTRACT: Cell formation decisions are made based on several factors such as
machining times, utilization, workload, alternative routings, capacities, operation
sequences. Most of the traditional Cell Formation procedures ignore the existence
of stochastic production requirements and alternative routes. In this study, a
simulation based Fuzzy Goal Programming model is proposed for solving cell
formation problems considering stochastic production requirements and alternative
routes. A tabu search based solution methodology is used for solution. © 2007 IEEE.
INDEX KEYWORDS: Cell Formation; Fuzzy goal programming model, Computer simulation;
Logic programming; Mathematical models; Network routing, Fuzzy logic
REFERENCES: Baykasoglu, A., Solution of Goal Programming Models Using a Basic Taboo
Search Algorithm (1999) Journal of the Operational Research Society, 50, pp. 960-
973;
Baykasoglu, A., Gokcen, T., A Tabu Search Approach to Fuzzy Goal Programs and an
Application to Aggregate Production Planning (2006) Engineering Optimization, 31,
pp. 155-177;
Chen, L.H., Tsai, F.C., Fuzzy Goal Programming with different importance priorities
(2001) European Jour. Of. Operational Res, 133, pp. 548-556;
Fang Hu, C., Teng, C.J., Li, S.Y., A Fuzzy Goal Programming Approach to multi-
objective Optimization Problem with Priorities (2007) European Jour. Of.
Operational Res, 176, pp. 1319-1333;
Gen, M., Ida, K., Tsujimura, Y., Kim, C.E., Large scale 0-1 Fuzzy Goal Programming
and Its Application to Reliability Optimization Problem (1993) Computers Ind.
Glover, F., Tabu Search-Part 1 (1989) ORSA Journal on Computing, 1, pp. 190-206;
Glover, F., Tabu Search-Part 2 (1990) ORSA Journal on Computing, 2, pp. 4-32;
Layout Design and Inter-cell Flows for the Machine Sharing Problem (1993) Int.
Rheault, M., Drolet, J., Abdulnour, G., Physically Reconfigurable Virtual Cells: A
Dynamic Model for a Highly dymic Environment (1995) Computers and Industrial
Saad, S.M., Baykasoglu, A., Gindy, G., An Integrated Framework for reconfiguration
of Cellular Manuacturing Systems Using Virtual Cells (2002) Production
Planning&Control, 13, pp. 381-393;
Selim, H., Askin, R.G., Vakharia, A.J., Cell Formation in Group Technology:Revew,
evaluation and directions for future research (1998) Computers and Ind. Eng, 34,
pp. 3-20;
Shanker, R., Vrat, P., Some Design Issues in Cellular Manufacturing Using the Fuzzy
Programming Approach (1997) Int. Journal of Prod. Research, 37, pp. 2545-2563
CORRESPONDENCE ADDRESS: Eski, O.; Dokuz Eylul University, Department of Industrial
EngineeringTurkey; email: [email protected]
ISBN: 0769528740; 9780769528748

ABBREVIATED SOURCE TITLE: Proc. Int. Conf. Fuzzy Sys. Knowl. Discov. FSKD
SOURCE: Scopus
Mosier, C.T., Martin, G.E.

6701802350;57191113430;
CELLULAR PRODUCTION SYSTEMS: A CONCURRENT CLUSTER ANALYTIC FRAMEWORK
(1995) Production and Operations Management, 4 (4), pp. 414-420. Cited 1 time.
84987013519&doi=10.1111%2fj.1937-
5956.1995.tb00302.x&partnerID=40&md5=16ea5e47b9f828de5ff4b2930958ee85
DOI: 10.1111/j.1937-5956.1995.tb00302.x
AFFILIATIONS: Clarkson University, Potsdam, 13699-5790 USA Party Lite Gifts,
Hannawa Falls, Potsdam, New York, 13699–5790, United States;
Party Lite Gifts, Hannawa Falls, New York, 13647, United States
ABSTRACT: We propose an agglomerative heuristic cluster analysis framework for
application to the part‐family and machine‐cell formation problems associated with
group technology. This framework addresses the notion of concurrently forming
clusters of parts (families) and machines (cells) based on natural between‐part and
between‐machine relationships and the strength of association relating pairs of
parts with pairs of machines. An illustrative model is presented and operational
aspects demonstrated using a small problem. © 1995 Production and Operations
Management Society
AUTHOR KEYWORDS: CELLULAR MANUFACTURING SYSTEM DESIGN; CLUSTER ANALYSIS;
FACILITIES PLANNING
REFERENCES: Anderberg, M.R., (1973) Cluster Analysisfir Applications, , Academic
Press, New York;
Klastorin, T.D., “An Alternative Method for Hospital Partition Determination Using
Hierarchical Cluster Analysis,” (1983) Operations Research, 30 (1), pp. 1134-1147;
McCormick, W.T., Schweitzer, P.J., White, T.W., “Problem Decomposition and Data
Reorganization by a Clustering Technique,” (1972) Operations Research, 20 (5), pp.
993-1009;
Mosier, C.T., “An experiment investigating the application of clustering procedures
and similarity coefficients to the GT machine cell formation problem,” (1989)
CORRESPONDENCE ADDRESS: Mosier, C.T.; Clarkson University, Potsdam, 13699-5790 USA
Party Lite Gifts, Hannawa Falls, Potsdam, New York, 13699–5790, United States
ISSN: 10591478
ABBREVIATED SOURCE TITLE: Prod. Oper. Manage.
SOURCE: Scopus
Saidi-Mehrabad, M., Safaei, N.

18435197300;8886880300;
A new model of dynamic cell formation by a neural approach
1001-1009. Cited 48 times.
34547340263&doi=10.1007%2fs00170-006-0518-
2&partnerID=40&md5=9cd34df1ba873246079d2e146a4d64d8
DOI: 10.1007/s00170-006-0518-2
Technology, P.C. 16844 Tehran, Iran
ABSTRACT: This paper proposes a nonlinear integer model of cell formation under
dynamic conditions. The cell formation (CF) problem is a portion of a cellular
manufacturing strategy (CMS), in which the parts and machines are clustered with
the aim of minimizing the material handling cost. In most previous research the
cell formation problem has always been under static conditions in which cells are
formed for a single-period planning horizon where product mix and demand are
constant. In contrast, in dynamic conditions, a multi-period planning horizon is
considered, where the product mix and demand in each period is different. This
occurs in seasonally or monthly production. As a result, the best cell design for
one period may not be efficient for subsequent periods. To verify the presented
model, different problems have been solved and results are reported. Where the cell
formation problem belongs to NP class, the use of a novel approach is necessary. In
this research, we apply a neural approach based on mean filed theory for solving
the proposed model. In this approach, the network weights are updated by an
interaction procedure. The proposed model is solved by LINGO software and an
optimum solution is obtained. Comparison of optimum and neural approach solutions
shows the efficiency of the presented neural network approach. © 2006 Springer-
Verlag London Limited.
INDEX KEYWORDS: Cellular manufacturing; Materials handling; Neural networks;
Optimization; Strategic planning, Cell formation (CF); Cellular manufacturing
strategy (CMS); LINGO software, Dynamic programming
REFERENCES: Shafer, S., Rogers, D., A goal programming approach to the cell
formation problem (1991) J Oper Manag, 10 (1), pp. 28-43;
cell formation (1998) Ann Oper Res, 77 (1), pp. 97-107;
cell formation condition (1998) Ann Oper Res, 77 (1), pp. 109-128;
Baykasogylu, A., Gindy, N., A simulated annealing algorithm for dynamic layout
problem (2001) Comput Oper Res, 28 (1), pp. 1403-1426;
Lacksonen, T.A., Static and dynamic layout problems with varying areas (1994) J
Oper Res Soc, 45, pp. 59-69;
Lacksonen, T.A., Preprocessing for static and dynamic layout problems (1997) Int J
Prod Res, 35, pp. 1095-1106;
Chu, C., Manufacturing cell formation by competitive learning (1993) Int J Prod
Res, 31, pp. 829-843;
Dobado, D., Lozano, S., Eguia, I., Larraneta, J., (1999) Parallel fuzzy clustering
of parts and machines for cellular manufacturing. Flexible automation and
intelligent manufacturing, pp. 437-487., Begell House, New York, pp;
Lozano, S., Dobado, D., Eguia, I., Guerrero, F., Canca, D., Fuzzy neural network
for part family formation (1999) Intelligent engineering systems through artificial
neural networks, 9, pp. 1141-1146., ASME, New York, pp;
Canco, D., Onieva, L., Guerrero, F., Racero, J., (1999) Application of the
Hopfield-Tank model to part-machine grouping. Flexible automation and intelligent
manufacturing, pp. 489-499., Begell House, New York, pp;
Lozano, S., Canca, D., Guerrero, F., Garcia, J.M., Machine grouping using sequence-
based similarity coefficients and neural networks (2001) Robot Comput-Integr Manuf,
17 (1), pp. 399-404;
formation using a new self-organizing neural network (2002) Comp Ind Eng, 42 (2),
pp. 377-382;
Chen, S., Cheng, C., A neural network-based cell formation algorithm in cellular
Peterson, C., Anderson, J.R., A mean-field theory learning algorithm for neural
networks (1987) Complex Syst, 1, pp. 995-1019;
Peterson, C., Anderson, J.R., Neural networks and NP-complete optimization
problems; a performance study on the graph bisection problem (1988) Complex Syst,
2, pp. 59-89
CORRESPONDENCE ADDRESS: Saidi-Mehrabad, M.; Department of Industrial Engineering,
Iran University of Science and Technology, P.C. 16844 Tehran, Iran; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Wu, N., Salvendy, G.
7201444208;56763746600;
An efficient heuristic for the design of cellular manufacturing systems with
multiple identical machines
7 times.
0033207763&doi=10.1080%2f002075499190167&partnerID=40&md5=3d1e46af9c819da8d72dba65c
2ddad79
DOI: 10.1080/002075499190167
AFFILIATIONS: Department of Mechatronics Engineering, Guangdong University of
Technology, Guangzhou, 510090, China;
United States
ABSTRACT: In practice, in a manufacturing system, there are multiple machines of
some machine types to meet the capacity requirements. Therefore, this factor should
be taken into consideration in the design of cellular manufacturing systems (CMS).
On one hand, this is a constraint to be satisfied for the cell formation problem,
on the other hand, appropriate assignments of identical machines to different cells
will reducte and simplify intercell flows. Thus, we should make use of this
advantage in cell formation. The problem is that we do not know the specific
machine within the identical machines that are to be used for the processing of an
operation, and so it is difficult to assign operations to a specific machine within
the group of identical machines. By using the information of operation sequences
for each part type, we present a graphical model that can describe the part
families with respect to the machine types of multiple machines. Thus, the
identical machines can be assigned into different cells based on the part families
without involving complex computation. With the model developed here, a merging-
and-breaking heuristic is proposed to solve concurrently both the traditional cell
formation problem and the assignments of the identical machines to different cells.
Three examples are taken to show the power and application of the approach. © 1999
Taylor and Francis Group, LLC.
INDEX KEYWORDS: Heuristic methods; Industrial management; Machinery; Mathematical
models; Scheduling; Systems analysis, Cell formation; Multiple identical machines,
pp. 101-113;
Chandrasekaran, M.P., Rajagopalan, R., ZODIAC—An algorithm for concurrent formation
of part families and machine cells (1987) International Journal of Production
Research, 25, pp. 835-850;
Chen, Y.T., Young, R.E., PACIES: A part code identification expert system (1988)
Cheng, C.-H., Madan, M.S., Motwani, J., Designing cellular manufacturing systems by
pp. 349-361;
Choobineh, F., A framwork for design of cellular manufacturing system (1988)
Manufacturing, pp. 1-50;
Ham, I.H.K., Yoshida, T., (1985) Group Technology, , Boston: Kluwer-Nijhoff);
on System, Man, and Cybernetics, 24, pp. 203-215;
Kern, G.M., Wei, J.C., Eliminating exceptional elements in group technology (1991)
Research, 18, pp. 213-219;
Kumar, K.R., Vannelli, A., Strategic subcontracting for efficient desegregated
1728;
of Production Research, 25, pp. 561-569., 1991, Branching algorithms for the group
technology problem. Journal of Manufacturing Systems, 10, 332-343;
Kusiak, A., Chow, W.S., An efficient cluster identification algorithm (1987) IEEE
Transactions on System, Man, and Cybernetics, 17, pp. 696-699;
Minis, I., Harhalakis, G., Jajodia, S., Manufacturing cell formation with multiple,
functionally identical machines (1990) Manufacturing Review, 3, pp. 252-261;
Seifoddni, H., Wolfe, P.M., Application of the similarity coefficient method in
new hierarchical methodology (1995) International of Production Research, 33, pp.
1761-1784;
pp. 84-97;
Research, 28, pp. 2057-2084;
Wemmerlov, U., Hyer, N.B., Research issues in cellular manufacturing (1987)
International Journal of Production Research, 25, pp. 413-431., 1989, Cellular
manufacturing in the US industry: a survey of user. International Journal of
Production Research, 27, 1511-1530;
Wu, N.Q., A concurrent approach to cell formation and assignment of identical
36, pp. 2099-2114;
1409-1412;
Xie, X., Manufacturing cell formation under capacity constraints (1993) Applied
Stochastic Models and Data Analysis, 9, pp. 87-96
CORRESPONDENCE ADDRESS: Salvendy, G.; School of Industrial Engineering, Purdue
University, West Lafayette, IN, 47907, United States
ISSN: 00207543
SOURCE: Scopus
Wu, N.
57212668057;
A concurrent approach to cell formation and assignment of identical machines in
group technology
22 times.
0032143770&doi=10.1080%2f002075498192797&partnerID=40&md5=a16aa6b8b94d5c67b624468b3
2a11b5b
DOI: 10.1080/002075498192797
AFFILIATIONS: Science Center, Shantou University, Shantou, 515063, China
ABSTRACT: In designing a cellular manufacturing system, an important way to reduce
and simplify intercell flows is to identify shared machines and duplicate them to
some cells. However, the shared machines may not be properly identified by the
existing cell formation methods. Thus, some unnecessary machine duplication may be
made in the sense of capacity requirement and capital investment. In fact, for
practical applications, the number of machines of a machine type should be
determined by the capacity requirement of the parts to be produced in the system,
and should be the constraint for the cell formation problem. Therefore, multiple
identical machines should be appropriately assigned into different cells in
designing a cellular manufacturing system. To overcome this drawback of the
existing methods, in this paper a network model is developed for the design of a
cellular manufacturing system. In the model, the machine type which has only one
machine is represented by a simple node. The machine type which has two or more
machines is represented by a complex node. Thus, this model can describe multiple
machines of the same type. Based on this model, a new approach is presented. By the
proposed approach, the cell formation problem and the proper assignment of
identical machines are solved concurrently. Therefore, the proposed approach
provides a more effective solution than the existing methods. © 1998 Taylor and
Francis Group, LLC.
INDEX KEYWORDS: Concurrent engineering; Constraint theory; Machine tools;
Mathematical models; Resource allocation, Cell formation methods; Group technology;
Intercell flows, Flexible manufacturing systems
pp. 1351-1380;
742;
Burbidge, J.L., Zelenovic, D.M., Using PFA to plan GT for new factory (1983)
Material Flow, pp. 129-140;
Chandrasekaran, M.P., Rajagopalan, R., ZODIAC-An algorithm for concurrent formation
of part families and machine cells (1987) International Journal of Production
Research, 25, pp. 835-850;
2601-2614;
Chen, Y.T., Young, R.E., PACIES: A part code identification expert system (1988)
Choobineh, F., A framework for design of cellular manufacturing system (1988)
Manufacturing, pp. 1-50., New York: Wiley;
Gupta, Y., Gupta, M., Kumar, A., Sunaram, C., A genetic algorithm-based approach to
cell composition and layout design problems (1996) International Journal of
Ham, I.H.K., Yoshida, T., (1985) Group Technology, , Boston, MA: Kluwer-Nijhoff);
on System, Man, and Cybernetics, 24, pp. 203-215;
Resarch, 18, pp. 213-219;
Kumar, K.R., Vannelli, A., Strategic subcontracting for efficient desegregated
1728;
Kusiak, A., Chow, W.S., An efficient cluster identification algorithm (1987) IEEE
Transactions on System, Man, and Cybernetics, 17, pp. 696-699;
567-579;
group technology (1987) IIE Transactions, pp. 271-277;
dealing with exceptional elements (1992) International Journal of Production
Research, 30, pp. 1029-1036;
33 (6), pp. 1761-1784;
pp. 84-97;
Verma, P., Ding, F.-Y., A sequence-based materials flow procedure for designing
pp. 3267-3281;
Research, 28, pp. 2057-2084;
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in US industry: A survey of users
1409-1412
CORRESPONDENCE ADDRESS: Wu, N.; Science Center, Shantou University, Shantou,
515063, China
ISSN: 00207543
SOURCE: Scopus
Jain, A.K., Kasilingam, R.G., Bhole, S.D.

57199316644;6603995406;7003905365;
Cell formation in flexible manufacturing systems under resource constraints
8352%2890%2990154-E&partnerID=40&md5=fa955379e54a902587e6863450604bfc
DOI: 10.1016/0360-8352(90)90154-E
AFFILIATIONS: Industrial Systems Engineering University of Regina, Regina, Sask.
S4S 0A2, Canada
ABSTRACT: In this paper, the cell formation problem in Flexible Manufacturing
Systems under resource constraints is discussed. A 0-1 integer programming model is
developed to form the machine-part groups and to decide on the number of machines
and the number of copies of tools required to achieve minimum overall system cost.
The model takes into account the processing time available on any machine, tool
lives and the processing requirements of the parts. The model is illustrated using
a numerical example. © 1990.
INDEX KEYWORDS: Computer Programming - Algorithms; Machine Components -
Manufacture; Machine Shops - Inventory Control; Machine Tools - Mathematical
Models; Mathematical Programming, Cell Formation Model (CFM); Cellular
Manufacturing Systems; Group Technology (GT); Integer Programming Model; Machine
Parts Grouping; Resource Constraints, Flexible Manufacturing Systems
REFERENCES: Groover, (1987) Automation, Production Systems and Computer Integrated
Manufacturing, , Prentice-Hall, Inc, New Jercey;
Ham, Hitomi, Yoshida, (1985) Group Technology, , Kluwer-Nijhoff Publishing, Boston;
Burbidge, (1975) Introduction to Group Technology, , John Wiley and Sons, New York;
Choobineh, A framework for the design of cellular manufacturing systems (1988)

(2), pp. 53-57;
Rajgopalan, Batra, Design of cellular production systems. A graph theoretic
King, Nakornchai, Machine - component group formation in group technology review
133;
Kusiak, Chow, Efficient solving of the GT problem (1987) Journal of Manufacturing
Systems, 6 (2), pp. 117-124;
Kasilingam, (1989) Mathematical modeling of the cell formation problems in FMS, ,
Unpublished Ph.D. Dissertation, Department of Industrial Engineering, University of
Windsor, Windsor, Canada;
King, Machine-component grouping in production flow analysis; an approach using a
rank order cluster algorithm (1980) International Journal of Production Research,
18 (2), pp. 213-232
CORRESPONDENCE ADDRESS: Jain, A.K.; Industrial Systems Engineering University of
Regina, Regina, Sask. S4S 0A2, Canada
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Hwang, H., Oh, Y.H.

57013250000;7402126176;
Another similarity coefficient for the p-median model in group technology
1342284852&partnerID=40&md5=3b0ec635e9ac0a354f621fe281005066
AFFILIATIONS: Department of Industrial Engineering, Korea Adv. Inst. of Sci. and

Technol, 373-1 Kusong-dong Yusong-gu, Taejon 305-701, South Korea
ABSTRACT: This paper deals with the cell formation problem in which machine cells
and part families are identified for a given machine-part incidence matrix. The p-
median model is one of the widely used mathematical programming formulations which
require a similarity coefficient to be solved. Modifying the similarity measure of
Viswanathan [1], we propose another measure to enhance the performance of the
model. The validity of the proposed measure is examined through a comparative study
with other existing solution approaches in terms of grouping efficiency.
AUTHOR KEYWORDS: Group technology; p-median model; Similarity coefficient
INDEX KEYWORDS: Cellular manufacturing; Machine components; Mathematical models;
Mathematical programming; Matrix algebra, p-median model; Similarity coefficient,
Group technology
REFERENCES: Viswanathan, S., A new approach for solving the p-median problem in
2700;
group technology International Journal of Production Research, 27, pp. 2053-2062;
117-133;
Panneerselvam, R., Balasubramanian, K.N., Algorithm grouping of operation sequences
Seiffodini, H., Wolfe, P.M., Application of similarity coefficient method in group
technology (1986) IIE Transactions, 18, pp. 271-277;
Chandrasekaran, M.P., Rajagopalan, R., MODROC - An extension of rank order
Research, 24, pp. 1221-1233;
Seiffodini, H., Single linkage v/s average linkage clustering in machine cells
Research, 28, pp. 145-152;
145-152
Inst. of Sci. and Technol, 373-1 Kusong-dong Yusong-gu, Taejon 305-701, South
Korea; email: [email protected]
ISSN: 13682148
SOURCE: Scopus
Oba, F., Kato, K., Yasuda, K., Tsumura, T.

35594077400;57188555952;13405856800;7005906907;
CAFPLAN-I: COMPUTER AIDED FACTORY PLANNING SYSTEM-I.
(1985) pp. 395-400.
0022281437&partnerID=40&md5=22450eefff2bb1310806f2dbb622a6a7
AFFILIATIONS: Univ of Osaka Prefecture, Jpn, Univ of Osaka Prefecture, Jpn

ABSTRACT: This paper deals with the problem of cell formation encountered in the
early stage of the fundamental design process for the realization of Cellular
Manufacturing Systems based on Group Technology. CAFPLAN-I is a human-computer
interactive software package which has been developed to solve the cell formation
problem. It is particularly useful for such practical situations that alternative
machines exist in manufacturing processes. This paper presents the basic concept
and the cell formation procedure through the application of CAFPLAN-I to a
hypothetical case study.
INDEX KEYWORDS: DATA PROCESSING - Manufacturing Applications; SYSTEMS SCIENCE AND
CYBERNETICS - Man Machine Systems, CELLULAR MANUFACTURING; FACTORY PLANNING SYSTEM;
FMS, INDUSTRIAL PLANTS
CORRESPONDENCE ADDRESS: Oba, F.; Univ of Osaka Prefecture, Jpn, Univ of Osaka
Prefecture, Jpn
PUBLISHER: Springer-Verlag, Berlin, West Ger
ISBN: 354015762X
SOURCE: Scopus
Yin, Y., Yasuda, K.

8237087600;13405856800;
Manufacturing cell's design in consideration of various production factors
times.
0037051306&doi=10.1080%2f00207540110101639&partnerID=40&md5=4344616a9dd2830b64eaa6f
ac4d225ee
DOI: 10.1080/00207540110101639
AFFILIATIONS: Industrial and Management Science, Tohoku University, Kawauchi, Aoba-
ku, Sendai 980-8576, Japan
ABSTRACT: A cell formation problem is introduced that incorporates various real-
life production factors such as the alternative process routing, operation
sequence, operation time, production volume of parts, machine capacity, machine
investment cost, machine overload, multiple machines available for machine types
and part process routing redesigning cost. None of the cell formation models in the
literature has considered these factors simultaneously. A similarity coefficient is
developed that incorporates alternative process routing, operation sequence,
operation time and production volume factors. Although very few studies have
considered the machine capacity violated issue under the alternative process
routing environment, owing to the difficulties of the issue discussed here, these
studies fail to deal with the issue because they depend on some unrealistic
assumptions. Five solutions have been proposed here and are used to cope with this
difficulty. A heuristic algorithm that consists of two stages is developed. The
developed similarity coefficients is used in stage 1 to obtain basic machine cells.
Stage 2 solves the machine-capacity violated issue, assigns parts to cells, selects
process routing for each part and refines the final cell formation solution. Some
numerical examples are used to compare with other related approaches in the
literature and two large size problems are also solved to test the computational
performance of the developed algorithm. The computational results suggest that the
approach is reliable and efficient in either the quality or the speed for solving
cell formation problems.
INDEX KEYWORDS: Algorithms; Costs; Heuristic methods; Inventory control;
Investments; Operations research, Alternative process routing; Cell formation;
Machine capacity; Operation sequence; Operation time, Cellular manufacturing
50, pp. 139-152;
Research, 24, pp. 451-464;
formation (1988) Proceedings of the International Industrial Engineering
Conference, Orlando, FL, pp. 495-500;
De Beer, C., De Witte, J., Production flow synthesis (1978) Annals of the CIRP, 27,
pp. 389-392;
El-Essawy, I.G.K., Torrance, J., Component flow analysis - An effective approach to
production systems' design (1972) Production Engineer, 51, pp. 165-170;
1259-1273;
Ham, I., Hitomi, K., Yoshida, T., (1985) Group Technology: Applications to
Production Management, , (Boston: Kluwer-Nijhoff);
423-431;
pp. 193-199;
Research, 18, pp. 213-232;
117-133;
1728;
Kuslak, A., The generalized group technology concept (1987) International Journal
51, pp. 53-57;
Purcheck, G.F.K., Combinatorial grouping: A lattice-theoretic method for the design
Purcheck, G.F.K., A mathematical classification as a basis for the design of group-
567-579;
pp. 508-520;
Seifoddini, H.K., Wolfe, P.M., Selection of a threshold value based on material
270;
Sofianopoulos, S., Manufacturing cells design with alternative process plans and/or
707-720;
materials flow approach based on operation sequences (1990) IEE Transactions, 22,
pp. 84-97;
24, pp. 387-400;
1409-1421;
17;
CORRESPONDENCE ADDRESS: Yasuda, K.; Industrial and Management Science, Tohoku
University, Kawauchi, Aoba-ku, Sendai 980-8576, Japan; email:
[email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Krushinsky, D., Goldengorin, B.

25121113400;6506538311;
An exact model for cell formation in group technology
(2012) Computational Management Science, 9 (3), pp. 323-338. Cited 15 times.
84865405946&doi=10.1007%2fs10287-012-0146-
2&partnerID=40&md5=370c947eb59efc4443e1251c03a92bb6
DOI: 10.1007/s10287-012-0146-2
AFFILIATIONS: Department of Operations, University of Groningen, P. O. Box 800,
9700 AV Groningen, Netherlands;
LATNA, Laboratory of Algorithms and Technologies for Networks Analysis, Department
of Applied Mathematics and Informatics, Nizhny Novgorod branch of The National
Research University Higher School of Economics, B. Pecherskaya, 25/12, 603155
Nizhny Novgorod, Russian Federation
ABSTRACT: Despite the long history of the cell formation problem (CF) and
availability of dozens of approaches, very few of them explicitly optimize the
objective of cell formation. These scarce approaches usually lead to intractable
formulations that can be solved only heuristically for practical instances. In
contrast, we show that CF can be explicitly modelled via the minimum multicut
problem and solved to optimality in practice (for moderately sized instances). We
consider several real-world constraints that can be included into the proposed
formulations and provide experimental results with real manufacturing data. © 2012
The Author(s).
AUTHOR KEYWORDS: Cell formation; Group technology; Minimum multicut
REFERENCES: Adil, G.K., Rajamani, D., The tradeoff between intracell and intercell
moves in group technology cell formation (2000) J Manuf Syst, 19 (5), pp. 305-317;
Ahi, A., Aryanezhad, M., Ashtiani, B., Makui, A., A novel approach to determine
based on TOPSIS method (2009) Comput Oper Res, 36 (5), pp. 1478-1496.,
doi:10.1016/j.cor.2008.02.012;
matching processing requirements and operator capabilities (2010) J Opl Res Soc,
61, pp. 827-839., doi:10.1057/jors.2008.181;
Boulif, M., Atif, K., An exact multiobjective epsilon-constraint approach for the
manufacturing cell formation problem (2006) Proceedings of the international
conference on service systems and service management, 2, pp. 883-888., doi: 10.
1109/ICSSSM. 2006. 320737;
Burbidge, J.L., The new approach to production (1961) Prod Eng, 40, pp. 3-19;
Burbidge, J.L., Production flow analysis for planning group technology (1991) J
Oper Manag, 10 (1), pp. 5-27., doi:10.1016/0272-6963(91)90033-T;
Burlet, M., Goldschmidt, O., A new and improved algorithm for the 3-cut problem
(1997) Oper Res Lett, 21, pp. 225-227;
formation problems (1999) Eur J Oper Res, 113, pp. 64-79;
Dimaggio, P.A., McAllister, S.R., Floudas, C.A., Feng, X.J., Rabinowitz, J.D.,
Rabitz, H.A., Biclustering via optimal re-ordering of data matrices in systems
biology: rigorous methods and comparative studies (2008) BMC Bioinformatics, 9 (1),
p. 458;
formation problem (2006) Int J Prod Econ, 102, pp. 1-21;
Goldschmidt, O., Hochbaum, D.S., A polynomial algorithm for the k-cut problem for
fixed k (1994) Math Oper Res, 19 (1), pp. 24-37;
Kaparthi, S., Suresh, N.C., Machine-component cell formation in group technology: a
neural network approach (1992) Int J Prod Res, 30 (6), pp. 1353-1367;
using a rank order clusterng algorithm (1980) Int J Prod Res, 18 (2), pp. 213-232;
Madeira, S.C., Oliveira, A.L., Biclustering algorithms for biological data
analysis: a survey (2004) IEEE-ACM T Comput BI, 1 (1), pp. 24-45;
reorganization by a clustering technique (1972) Oper Res, 20 (5), pp. 993-1009.,
doi:10.1287/opre.20.5.993;
Boston: National Lending Library of Science and Technology;
Ng, S.M., Worst-case analysis of an algorithm for cellular manufacturing (1993) Eur
J Oper Res, 69, pp. 384-398;
Ravi, R., Sinha, A., Approximating k-cuts using network strength as a lagrangean
relaxation (2008) Eur J Oper Res, 186, pp. 77-90;
Saran, H., Vazirani, V., Finding k-cuts within twice the optimal (1995) SIAM J
Comput, 24 (1), pp. 101-108;
(1), pp. 3-20;
Wei, J.C., Kern, G.M., Commonality analysis. A linear cell clustering algorithm for
(2004) Comput Ind Eng, 46 (3), pp. 495-510., doi:10.1016/j.cie.2004.01.010;
modified ART1 method (2008) Eur J Oper Res, 188 (1), pp. 140-152.,
doi:10.1016/j.ejor.2007.03.047;
problem: a taxonomy and review (2006) Int J Prod Econ, 101 (2), pp. 329-352.,
doi:10.1016/j.ijpe.2005.01.014
CORRESPONDENCE ADDRESS: Krushinsky, D.; Department of Operations, University of
Groningen, P. O. Box 800, 9700 AV Groningen, Netherlands; email:
[email protected]
ISSN: 1619697X
ABBREVIATED SOURCE TITLE: Comput. Manage. Sci.
SOURCE: Scopus
Gómez, A.T., Galafassi, C., Das Chagas Linck, I.C., Wickert, T.I.
24767323600;49963615000;49963230600;49964984000;
A study for manufacturing cell formation approach considering setup
(2011) ICINCO 2011 - Proceedings of the 8th International Conference on Informatics
in Control, Automation and Robotics, 1, pp. 43-48. Cited 1 time.
80052559896&partnerID=40&md5=64767ddc60add9cc8cffe4fe4ad3b94b
AFFILIATIONS: Universidade do Vale do Rio dos Sinos, Av. Unisinos - 950, São
Leopoldo, Brazil
ABSTRACT: This paper proposes a comparison among the exact methods Rank Ordered
Cluster, Single Linkage Clustering and the metaheuristics Tabu Search and Genetic
Algorithm for Manufacturing Cell Formation Problem. The Manufacturing Cell
Formation consists of group machines for processing similar parts or components in
order to minimize setup time. Setup time can be defined as the period of downtime
between the processing of two consecutive batches. To validate the algorithms
results, a metric, group efficacy, is applied to determine the result quality,
moreover, the results are compared with examples in the literature.
AUTHOR KEYWORDS: Genetic algorithm; Manufacturing cell formation; Meta-heuristic;
Setup; Tabu search
INDEX KEYWORDS: Exact methods; Manufacturing cell formation; Meta heuristics;
Metaheuristic; Set-up time; Setup; Single linkage clustering, Cellular
manufacturing; Clustering algorithms; Flexible manufacturing systems; Genetic
algorithms; Information science; Tabu search, Robotics
(1), pp. 101-113;
pp. 2097-2116;
DOI 10.1016/S0360-8352(02)00184-5, PII S0360835202001845;
Research, 24 (5), pp. 1221-1264;
Research, 24 (2), pp. 451-464;
Chandrasekharan, M.P., Rajagopalan, R., Group ability: Analysis of the properties
Glover Fred, Future paths for integer programming and links to artificial
intelligence (1986) Computers and Operations Research, 13 (5), pp. 533-549., DOI
10.1016/0305-0548(86)90048-1;
Holland, J.H., Adaptation in natural and artificial systems (1975) Ann Arbor, , MI:
2059-2079., DOI 10.1016/j.cor.2005.08.010, PII S0305054805002649;
Research, 18 (2), pp. 213-232;
pp. 117-133;
(3), pp. 387-397., DOI 10.1016/0377-2217(86)90032-9;
Ravi Kumar, K., Vannelli, A., Strategic subcontracting for efficient disaggregate
1715-1728;
pp. 2633-2646;
993-1009;
10.1016/S0360-8352(00)00074-7;
cellformation problems in machine scheduling (2008) Annals of Operations Research,
166, pp. 163-182;
10), pp. 1001-1009., DOI 10.1007/s00170-006-0518-2;
(2001) European Journal of Operational Research, 130 (3), pp. 588-611., DOI
10.1016/S0377-2217(99)00419-1;
Seifoddini, H., Wolfe, P.M., Application of the similarity coeffcient method in
Srinivasan, G., Narendran, T., GRAPHICS - A non-hierarchical clustering algorithm
463-478;
Advanced;
CORRESPONDENCE ADDRESS: Gómez, A.T.; Universidade do Vale do Rio dos Sinos, Av.
Unisinos - 950, São Leopoldo, Brazil; email: [email protected]
ISBN: 9789898425744
ABBREVIATED SOURCE TITLE: ICINCO - Proc. Int. Conf. Informatics Control, Autom.
Rob.
SOURCE: Scopus
Mukattash, A.M., Adil, M.B., Tahboub, K.K.

14321787700;15747102900;6603748552;
Heuristic approaches for part assignment in cell formation
8352%2802%2900020-7&partnerID=40&md5=9df4ad243a7b7769146428974bd06bf6
DOI: 10.1016/S0360-8352(02)00020-7
AFFILIATIONS: Department of Information Technology, Al-Balqa Applied University,
Al-Salt, Jordan;
Industrial Engineering Department, University of Technology, Baghdad, Iraq;
Industrial Engineering Department, University of Jordan, Amman, Jordan
ABSTRACT: Since the cell formation problem is considered to be a complex and multi-
criteria problem, then no single algorithm can provide all the promised benefits.
To gain more benefits of the cell formation, three heuristic procedures are
developed in this paper to give the designer more flexibility to generate cells.
Given a cell formation solution, the heuristics are designed to assign parts to the
cells in the presence of alternative process plans, multiple alternative (parallel)
machines, or when processing times are taken into consideration. © 2002 Elsevier
Science Ltd. All rights reserved.
AUTHOR KEYWORDS: Group technology; Heuristics; Machine cell formation; Part
assignment
INDEX KEYWORDS: Algorithms; Group technology; Heuristic methods; Machine
components, Machine cell formation, Cellular manufacturing
1361-1380;
2315;
Ang, C.L., On the performance of hybrid multi-cell flexible manufacturing systems
feasibility of cellular manufacturing without initial machine-part matrix
clustering (1994) International Journal of Production Research, 32 (8), pp. 1909-
1938;
Asfahl, C.R., (1992) Robots and manufacturing automation, , Singapore: Wiley;
Askin, R.G., A graph partitioning procedure or machine assignment and cell
formation in group technology (1990) International Journal of Production Research,
28 (8), pp. 1555-1572;
Bedworth, D.D., Balley, J.E., (1987) Integrated production control systems, , USA:
Wiley;
Buzacott, J.A., Shanthikumar, J.G., (1993) Stochastic models of manufacturing
systems, , Englewood Cliffs, NJ: Prentice-Hall;
Chandrasekharan, M.O., Rajagopalan, R., An ideal seed non-hierarchical clustering
Research, 24 (2), pp. 451-464;
Chen, S.I., Cheng, C.S., A neural network-based cell formation algorithm in
pp. 293-318;
Chen, H.G., Guerrero, H.H., A general search algorithm for cell formation in group
2724;
Chen, F.T.S., Jayaprakash, B., Tang, N.K.H., Design of automated cellular
manufacturing systems with simulation modeling: A case study (1995) International
Journal of Computer Application in Technology, 8 (12), pp. 1-11;
Chow, W.S., Hawaleshka, O., Minimising intercellular parts movements in
31 (9), pp. 2161-2170;
Gindy, N.Z., Ratchev, T.M., Case, K., Component grouping for cell formation using
resource elements (1996) International Journal of Production Research, 34 (3), pp.
727-752;
Kem, G.M., Wei, J.C., The cost of eliminating exceptional elements in group
(8), pp. 1535-1547;
Kusiak, A., EXGT-S: A knowledge based system for group technology (1988)
pp. 2633-2646;
Liange, M., Taboun, S.M., Converting functional manufacturing systems into Focused
machine cells - A bicriterion approach (1995) International Journal of Production
Research, 33 (8), pp. 2147-2161;
Park, Y.T., Wemmerlov, U., A shop structure generator for cell formation research
Rao, H.A., Gu, P., A multi-constraint neural network for the pragmatic design of
33 (4), pp. 1049-1070;
Sarker, B.R., Balan, C.V., Cell formation with operation times of jobs for even
distribution of workloads (1996) International Journal of Production Research, 34
(5), pp. 1447-1468;
techniques in forming machine cells (1988) Computers Industrial Engineering, 15
(14), pp. 210-216;
Solomon, M.M., Millen, R.A., Afentakis, P., The formation of subfamilies for
machine loading of flow-line cells (1995) International Journal of Production
Research, 33 (9), pp. 2357-2374;
pp. 463-478;
Suresh, N.C., Kaparth, S., Performance of fuzzy ART neural network for group
(7), pp. 1693-1713;
Suresh, N.C., Slomp, J., Aparthi, S., The capacitated cell formation problem: A new
hierarchical methodology (1995) International Journal of Production Research, 33
(6), pp. 1761-1784;
Vajpayee, S.K., (1995) Principles of computer-integrated manufacturing, , Englewood
Cliffs, NJ: Prentice-Hall;
Venugopal, V., Narendran, T.T., Machine-cell formation through neural models (1994)
Viswanathan, S., Configuring cellular manufacturing systems: A quadratic integer
2700;
CORRESPONDENCE ADDRESS: Tahboub, K.K.; Industrial Engineering Department,
University of Jordan, Amman, Jordan; email: [email protected]
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Wicks, E.M., Reasor, R.J.

6701823349;6505956377;
Designing cellular manufacturing systems with dynamic part populations
Cited 95 times.
%3a1007516532572&partnerID=40&md5=c0a29b212fc609f686ca698b72e24717
DOI: 10.1023/A:1007516532572
AFFILIATIONS: Department of Industrial Engineering, University of Missouri-
Columbia, Columbia, MO 65211, United States;
Eastman Chemical Company, PO Box 1973, Kingsport, TN 37662-5284, United States
ABSTRACT: The effectiveness of a cellular manufacturing system is sensitive to
fluctuations in the demand for products and the product mix. This paper presents a
new formulation of the part family/machine cell formation problem that addresses
the dynamic nature of the production environment by considering a multi-period
forecast of product mix and demand during the formation of part families and
machine cells. The goal of the multi-period formulation is to obtain a cellular
design that continues to perform well with respect to the design objectives as the
part population changes with time.
INDEX KEYWORDS: Inventory control; Planning; Production; Productivity, Machine cell
formation; Product mix, Cellular manufacturing
REFERENCES: Wemmerlöv, U., Johnson, D.J., Cellular manufacturing at 46 user plants:
Journal of Production Research, , 35(1), 29-49;
Burbidge, J.L., Production flow analysis (1963) Production Engineer, , 42, 742-752;
Management, , 6(2), 125-147;
Joines, I.A., King, R.E., Culbreth, C.T., A comprehensive review of production-
Flexible Automation and Intelligent Manufacturing, , 3(3/4), 161-200;
Vakharia, A.J., Kaku, U.K., Redesigning a cellular manufacturing system to handle
, 24(5), 909-929;
Seifoddini, H., Djassemi, M., Sensitivity analysis in cellular manufacturing in the
case of product mix variations (1996) Computers and Industrial Engineering, ,
31(1/2), 163-167;
Manufacturing Systems, , 9(1), 69-75;
Harhalakis, G., Loannou, G., Minis, I., Nagi, R., Manufacturing cell formation
under random product demand (1994) International Journal of Production Research, ,
32(1), 47-64;
Research, , 25(5), 639-665;
International Journal of Production Research, , 25(3), 413-431;
Jordan, P.C., Frazier, G.V., (1993) Is the Full Potential of Cellular Manufacturing
Being Achieved? Production and Inventory Management Journal, , 34(1) First Quarter,
70-71;
Oitodile, O.P., Mehrez, A., Grznar, J., Cellular manufacturing: A taxonomic review
framework (1994) Journal of Manufacturing Systems, , 13(3), 198-220;
Chu, C.-H., (1995) Recent Advances in Mathematical Programming for Cell Formation,
in Planning, Design, and Analysis of Cellular Manufacturing Systems, Kamrani, A.K.,
Parsaei, H.R., and Liles, D.H., (Eds), Elsevier Science, Amsterdam, the
Netherlands, Pp. 3-46.;
Holland, J.H., (1975) Adaptation in Natural and Artificial Systems, University of
Michigan Press, Ann Arbor, MI.;
Engineering, , 22(4), 469-480;
Production Research, , 34(2), 447-482;
programming model employing genetic algorithms (1996) HE Transactions, , 28(1), 69-
85;
Goldberg, D.E., Genetic Algorithms in Search, Optimization, and Machine Learning
(1989) Addison-Wesley, Reading, MA.
CORRESPONDENCE ADDRESS: Wicks, Elin M.; Univ of Missouri-Columbia, Columbia, United
States
PUBLISHER: Kluwer Academic Publishers, Dordrecht, Netherlands
ISSN: 0740817X
CODEN: IIETD
SOURCE: Scopus
Burke, Laura I., Kamal, Soheyla

7102048603;7006560965;
Fuzzy ART for cellular manufacturing
(1992) Intelligent Engineering Systems Through Artificial Neural Networks, 2, pp.
0027105453&partnerID=40&md5=4bed7c7e26d199b003c3d782a0d4f330
AFFILIATIONS: Lehigh Univ, Bethlehem, United States

ABSTRACT: The fuzzy ART neural network has great potential for the cell formation
problems of group technology. Unlike competitive learning, when a new part or
machine is added to the system, ART networks can continue to learn and incorporate
new information. Also, the vigilance parameter of ART can identify significantly
different parts or machines, while competitive learning cannot. Fuzzy ART accepts
binary or continuous information. It possesses the same stability properties as
ART1, and a simpler architecture than ART2. Even with binary patterns, the fuzzy
ART weight vectors may attain continuous values, leading to interpretability.
INDEX KEYWORDS: Cellular manufacturing; Fuzzy sets; Learning systems; Vectors,
Adaptive resonance theory (ART), Neural networks
CORRESPONDENCE ADDRESS: Burke, Laura I.; Lehigh Univ, Bethlehem, United States
EDITORS: Dagli C.H., Burke L.I., Shin Y.C.
PUBLISHER: ASME, Fairfield, NJ, United States
CODEN: IEANF
ABBREVIATED SOURCE TITLE: Intell Eng Syst Artif Neural Networks
SOURCE: Scopus
Majazi Dalfard, V.
54400780200;
New mathematical model for problem of dynamic cell formation based on number and
average length of intra and intercellular movements
84870254814&doi=10.1016%2fj.apm.2012.04.034&partnerID=40&md5=8a724fbd93d7c1aa5bcc76
9f39bb7779
DOI: 10.1016/j.apm.2012.04.034
AFFILIATIONS: Young Researchers Club, Kerman Branch, Islamic Azad University,
Kerman, Iran
ABSTRACT: This article presents a new nonlinear integer programming model for
dynamic cell formation problem in cell manufacturing system. Difference between
this model and other models developed thus far lies in implementation of the idea
of more material flow in shorter distance in formation of cells. The presented
model is NP-hard. A new strategy known as simulated annealing embedded in branch
and cut was developed to solve the problem. In comparison with standard branch and
cut, results of solving different problems showed speed and efficiency of simulated
annealing embedded in branch and cut. © 2012 Elsevier Inc.
AUTHOR KEYWORDS: Formation of dynamic cell
INDEX KEYWORDS: Average length; Branch and cut; Cell manufacturing; Dynamic cell
formation; Intercellular movement; Material Flow; New mathematical model; Non-
linear integer programming; NP-hard, Cellular manufacturing; Integer programming;
Linear programming; Simulated annealing, Problem solving
REFERENCES: Rheault, M., Drolet, J., Abdulnour, G., Physically reconfigurable
virtual cells: a dynamic model for a highly dynamic environment (1995) Comput. Ind.
Eng., 29, pp. 221-225;
cellular manufacturing system (1997) Comput. Ind. Eng., 33, pp. 239-242;
cell formation (1998) Ann. Oper. Res., 77, pp. 97-107;
cell formation condition (1998) Ann. Oper. Res., 77, pp. 109-128;
part populations (1999) IIE Trans., 31, pp. 11-20;
cellular manufacturing: a review and future directions (2007) Eur. J. Oper. Res.,
117, pp. 281-309;
Mungwattana, A., Design of Cellular Manufacturing Systems for Dynamic and Uncertain
Production Requirements with Presence of Routing Flexibility, , Ph.D. thesis,
Virginia Polytechnic Institute and State University, Blackburg, VA, 2000;
Tavakkoli Moghaddam, R., Aryanezhad, M.B., Safaei, N., Azaron, A., Solving a
170, pp. 761-780;
Saidi Mehrabad, M., Safaei, N., A new model of dynamic cell formation by a neural
approach (2007) Int. J. Adv. Manuf. Technol., 33, pp. 1001-1009;
Res., 36, pp. 777-794;
Safaei, N., Saidi Mehrdad, M., Jabal Ameli, M.S., A hybrid simulated annealing for
solving an extended model of dynamic cellular manufacturing systems (2008) Eur. J.
Oper. Res., 185, pp. 563-592;
Int. J. Prod. Econ., 120, pp. 301-319;
Oper. Res., 187, pp. 46-69;
Kioon, S.A., Bulgak, A.A., Bektas, T., Integrated cellular manufacturing system
design with production planning and dynamic system reconfiguration (2009) Eur. J.
Oper. Res., 192, pp. 414-428;
Model., 34, pp. 1078-1092;
Herrán, A., Defersha, F.M., Chen, M., Dela Cruz, J.M., An integrated multi-period
planning of the production and transportation of multiple petroleum products in a
single pipeline system (2011) Int. J. Ind. Eng. Comput., 2, pp. 19-44
CORRESPONDENCE ADDRESS: Majazi Dalfard, V.; Young Researchers Club, Kerman Branch,
Islamic Azad University, Kerman, Iran; email: [email protected]
ISSN: 0307904X
CODEN: AMMOD
SOURCE: Scopus
Manimaran, A., Prabhakaran, G., Venkumar, P.

57188809087;6602999346;8931792000;
Manufacturing cell formation using artificial immune system
(2011) International Journal of Computer Aided Engineering and Technology, 3 (5-6),
84869764893&doi=10.1504%2fIJCAET.2011.042363&partnerID=40&md5=70e88ab3c13327d2c822a
bd0b07b0334
DOI: 10.1504/IJCAET.2011.042363
AFFILIATIONS: Department of Mechanical Engineering, N.P.R. College of Engineering
and Technology, Dindigul, Tamil Nadu, 624401, India;
Department of Mechanical Engineering, Sri Ramachandra Institute of Technology, Sri
Ramachandra University, Chennai, Tamil Nadu, 600116, India;
Department of Mechanical Engineering, Kalasalingam University, Virudhunagar, Tamil
Nadu, 626190, India
ABSTRACT: The cellular manufacturing system is a well-known strategy which improves
the production efficiency and cutting down the manufacturing cost. The main problem
in designing cellular manufacturing system is cell formation, which is concerned
with grouping parts with similar processing required into part families and
associated machines into machines and minimises the exceptional elements. This
paper presents the artificial immune system method to solve the manufacturing cell
formation problems with the objective to minimise the exceptional elements. This
method is applied to the existing datasets found in the literature and it is found
to out performs other methods. Copyright © 2011 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Affinity mutation; AIS; Artificial immune system; Cellular
manufacturing systems; Clonal selection; CMS; Exceptional elements; Grouping
efficacy; Receptor editing
REFERENCES: Andres, C., Lozano, S., A particle swarm optimization algorithm for
part-machine grouping (2006) Robotics and Computer-Integrated Manufacturing, 22,
pp. 468-474;
Carter, J.H., The immune system as a model for pattern recognition and
classification (2000) Journal of the American Medical Information Association, 7
(1), pp. 28-41;
Carvalho, D.R., Freitas, A.A., An immunological algorithm for discovering small -
disjunction rules in data mining (1991) Proceedings of the Genetic and Evolutionary
Computation Conference, pp. 401-404., in Specter et al. (Eds.);
Chandrasekaran, M., Asokan, P., Kumanan, S., Balamurugan, T., Nickolas, S., Solving
job scheduling problems using artificial immune system (2006) International Journal
Chen, T., You, P.S., Immune algorithms-based approach for redundant reliability
problems with multiple component choices (2005) Computers & Industrial Engineering,
56 (2), pp. 195-205;
Das Gupta, D., Gonzalez, F., An immunity based technique to characterize intrusions
in computer networks (2002) IEEE Transactions on Evolutionary Computation, 6 (3),
pp. 281-291;
De Castro, L.N., Zuben, V., Recent development in biologically inspired computing
idea (2005) Group Publishing, pp. 104-146;
Goncalves, J.F., Resenda, M.G.G., An evolutionary algorithm for manufacturing cell
Hunt, J.E., Cooke, D.E., Learning using an artificial immune system (1996) Journal
of Net Work and Computer Applications, 19, pp. 189-212;
Khilwani, N., Prakash, A., Shankar, R., Tiwari, M.K., Fast clonal algorithm (2008)
Engineering Applications of Artificial Intelligence, 21, pp. 106-128;
for solving cell formation problem in group technology (1991) Journal of Operations
Miyamoto, A., Nakamura, H., Kruszka, L., Application of the improved immune
algorithm to structural design support system (2004) Journal of Structural
Engineering-ASCE, 130 (1), pp. 108-119;
Tan, K.C., Goh, C.K., Mamun, A.A., Ei, E.Z., An evolutionary artificial immune
system for multi objective optimization (2008) European Journal of Operational
Research, 187, pp. 371-392;
multiple routes and multiple objectives (2000) International Journal Production
Research, 38 (2), pp. 385-395
CORRESPONDENCE ADDRESS: Venkumar, P.; Department of Mechanical Engineering,
Kalasalingam University, Virudhunagar, Tamil Nadu, 626190, India; email:
[email protected]
ISSN: 17572657
SOURCE: Scopus
Modrak, V., Pandian, S., Knuth, P.

55909906100;57197232453;36118749800;
Possibilities of GA in optimization of manufacturing cell formation
(2011) Journal of Engineering and Applied Sciences, 6 (7), pp. 79-84.
84859880547&partnerID=40&md5=8ae743f99225a4b440360c538cc3a2b8
AFFILIATIONS: Faculty of Manufacturing Technologies, Technical University of Kosice

(TUKE) Bayerova, Presov, Slovakia;
Kalasalingam University Anandnagar, Krishnankoil, (Via) Srivilliputtur, Virudunagar
Dist., Tamil Nadu, India
ABSTRACT: Optimization of manufacturing cell formation includes a whole virtual
cell formation procedure and has NP-hard complexity. In the last decades,
evolutionary algorithms have been widely applied to real-world optimization
including to manufacturing cell formation problems. Genetic algorithms (GAs) are
possibly the most widespread variant of evolutionary algorithms and are now
frequently used for a number of optimization problems in operation management. In
this study it is discussed about theoretical and practical aspects of GA to bridge
the gap between hypothetical analysis and real time implementation of GA in a given
domain. © 2006-2011 Asian Research Publishing Network (ARPN).
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Genetic algorithm
REFERENCES: Miltenburg, J., Zhang, W., A Comparative Evaluation of Nine Well known
Algorithms for Solving the Cell Formation Problem in Group Technology (1991)
Michigan: The University of Michigan Press;
51 (2), pp. 53-57;
Rajagopalan, R., Batra, J.L., Design of Cellular Production System - A Graph
Theoretic Approach (1975) International Journal of Production Research, 13 (6), pp.
567-579;
Boctor, F.F., A Linear Formulation of the Machine-Part Cell Formation Problem
Waghodekar, P.H., Sahu, S., Machine-Component Cell Formation in Group Technology
(1984) MACE. International Journal of Production Research, 22 (6), pp. 937-948;
Venugopal, V., Soft-Computing Based Approaches to the Group Technology Problem: A
State-of-the-Art Review (1999) International Journal of Production Research, 37
(14), pp. 3335-3357;
Sudhakara Pandian, R., Mahapatra, S.S., (2007) Application of soft computing
techniques for cell formation considering operational time and sequence, pp. 42-
50., An unpublished thesis submitted at National Institute of Technology, Rourkela,
India;
Venugopal, V., Narendran, T.T., A Genetic Algorithm Approach to the Machine
Suresh, N.C., Slomp, J., Kaparthi, S., Sequence-dependent Clustering of Parts and
Machines a Fuzzy ART Neural Network Approach (1999) International Journal of
Zolfaghari, S., Liang, M., A New Genetic Algorithm for the Machine/Part Grouping
Problem Involving Processing Times and Lot Sizes (2003) Computers and Industrial
Sudhakara Pandian, R., Mahapatra, S.S., Manufacturing Cell Formation with
Production Data using Neural Network (2009) Computers and Industrial Engineering,
56, pp. 1340-1347;
Research, 18, pp. 213-232;
Research, 25, pp. 639-665;
Boctor, F.F., The minimum-cost, machine-part cell formation problem (1996)
Research, 24, pp. 451-464;
manufacturing system (2010) Applied Soft Computing Journal, ,
DOI:10.1016/j.asoc.2011.03.013
CORRESPONDENCE ADDRESS: Modrak, V.; Faculty of Manufacturing Technologies,
Technical University of Kosice (TUKE) Bayerova, Presov, Slovakia; email:
[email protected]
ISSN: 1816949X
ABBREVIATED SOURCE TITLE: J. Eng. Appl. Sci.
SOURCE: Scopus
Adil, G.K., Ghosh, J.B.

24392168900;7201715729;
Forming GT cells incrementally using GRASP
1402-1408. Cited 11 times.
27544466274&doi=10.1007%2fs00170-004-2113-
8&partnerID=40&md5=59879b0a8e4e8e119885a39ab885ed12
DOI: 10.1007/s00170-004-2113-8
AFFILIATIONS: Shailesh J. Mehta School of Management, Indian Institute of
Technology, Bombay, Mumbai 400076, India
ABSTRACT: Most research in cell design assumes that the entire plant is converted
into group technology cells at once. However, empirical findings in recent papers
suggest otherwise, that is, most industries have converted only part of the plant
into manufacturing cells and most cells in industries are created and implemented
sequentially over time. In this paper, we develop a mathematical model and a
heuristic approach based on greedy random adaptive search procedures (GRASP) to
address incremental cell formation problem. The methodology allows forming cells
gradually and converting a fraction of the plant into cells. © Springer-Verlag
London Limited 2004.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; GRASP
INDEX KEYWORDS: Cellular manufacturing; Group technology; Heuristic methods;
Mathematical models; Problem solving, Cell design; Cell formation; Empirical
findings; Greedy random adaptive search procedures (GRASP), Industrial management
REFERENCES: Adil, G.K., Rajamani, D., Strong, D., Assignment, allocation and
simulated annealing algorithms for cell formation (1997) IIE Trans, 29 (1), pp. 53-
67;
Burbidge, J.L., Production flow analysis (1971) Prod Eng, 50, pp. 139-152;
Choi, M.J., An exploratory study of contingency variables that affect the
conversion to cellular manufacturing systems (1996) Int J Prod Res, 34 (6), pp.
1475-1496;
Planning, Design and Analysis of Cellular Manufacturing Systems, pp. 3-46., Kamrani
AK, Parsaei HR, Liles DH (eds). Elsevier, Amsterdam;
King, J.R., Machine component grouping in production flow analysis an approach
using rank order clustering (1980) Int J Prod Res, 18, pp. 213-232;
Klincewicz, J.G., Rajan, A., Using GRASP to solve the component grouping problem
(1994) Naval Res Logist, 41, pp. 893-912;
57;
Miltenburg, J., Montazemi, A.R., Revisiting the cell formation problem assigning
parts to production systems (1993) Int J Prod Res, 31, pp. 2727-2746;
Moussa, S.E., Kamel, M.S., Partitioning techniques for cellular manufacturing
(1995) Planning, Design and Analysis of Cellular Manufacturing Systems, pp. 73-95.,
Kamrani AK, Parsaei HR, Liles DH (eds). Elsevier, Amsterdam;
(1995) Int J Prod Res, 33 (5), pp. 1323-1337;
Seiffodini, H., Wolfe, P.M., Application of the similarity coefficient method in
group technology (1986) HE Trans, 18, pp. 271-277;
Oper Res, 69, pp. 284-291;
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the U.S. industry-a survey of
(2000) Int J Prod Res, 38 (3), pp. 481-507
CORRESPONDENCE ADDRESS: Adil, G.K.; Shailesh J. Mehta School of Management, Indian
Institute of Technology, Bombay, Mumbai 400076, India; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Agarwal, D., Sahu, S., Ray, P.K.

7202076490;7202907651;55424774500;
Cell formation in cellular manufacturing: An AHP-based framework for evaluation of
various techniques
0346937330&doi=10.1504%2fIJMTM.2003.003707&partnerID=40&md5=c13a48db6658bcac48e7b22
6ec92f33c
DOI: 10.1504/IJMTM.2003.003707
AFFILIATIONS: Dept. of Industrial Eng. and Mngmnt., Indian Institute of Technology,
Kharagpur - 721302, India
ABSTRACT: The cell formation problem in cellular manufacturing has been addressed
by a wide range of different techniques, and by a large number of researchers.
Whilst algorithms capable of addressing a number of different concerns have been
developed, there is a strong need for the development of a comprehensive framework
with which to evaluate the performance of these algorithms, and to provide
guidelines to determine their appropriateness. In this paper, the need for an
evaluation framework is stressed, and an Analytic Hierarchy Process (AHP) based
framework for evaluation of the cell formation techniques is proposed, and
illustrated with an example.
AUTHOR KEYWORDS: Analytic hierarchy process; Cell formation; Cellular
manufacturing; Group technology; Grouping efficiency; Multi-criteria decision
making
INDEX KEYWORDS: Algorithms; Computer integrated manufacturing; Decision making;
Efficiency; Flexible manufacturing systems; Group technology; Performance, Analytic
hierarchy process; Bond energy algorithm; Cell formation; Grouping efficacy; Multi-
criteria decision making; Total bond energy measure, Cellular manufacturing
REFERENCES: Venugopal, V., Narendran, T.T., A genetic algorithm approach to the
machine-component grouping with multiple objectives (1992) Computers & Industrial
Engineering, 22 (4), pp. 469-480;
Selim, H.M., Askin, R.S., Vakharia, A.J., Cell formation in group technology:
Review, evaluation and directions for further research (1998) Computers &
Offodile, O., Mehrej, A., Grznar, J., Cellular manufacturing: A taxonomic review
Miltenberg, J., Zheng, W., A comparative evaluation of nine well-known algorithms
for solving the cell formation problem in GT (1991) Journal of Operation
28 (8), pp. 1417-1433;
Hsu, C., Su, C., Multi-objective machine-component grouping in cellular
manufacturing: A genetic algorithm (1988) Production Planning & Control, 9, pp.
155-166;
manufacturing - Part 2, a survey (1993) International Journal of Production
Research, 31 (6), pp. 1315-1326;
OMEGA: International Journal of Management, 20 (4), pp. 493-501;
Cheng, C.H., Kumar, A., Motwani, J., A comparative examination of selected cellular
manufacturing clustering algorithms (1990) International Journal of Operations and
Production Management, 15 (12), pp. 86-97;
Saaty, T.L., (1990) The Analytic Hierarchy Process, , RWS Publications, Pittsburgh,
USA;
Partovi, F., Burton, J., Banerjee, A., Application of analytical hierarchy process
in operations management (1990) International Journal of Operations and Production
King, J.R., Machine component grouping in production flow analysis an approach
using rank order clustering (1980) International Journal of Production Research, 18
(2), pp. 213-222;
McCormick, W.T., Schweitzer, P.J., White, T.E., Problem decomposition and data
MACE (1984) International Journal of Production Research, 22 (9), pp. 937-948
CORRESPONDENCE ADDRESS: Agarwal, D.; Dept. of Industrial Eng. and Mngmnt., Indian
Institute of Technology, Kharagpur - 721302, India; email: [email protected]
ISSN: 13682148
SOURCE: Scopus
Li, J., Chu, C.-H., Wang, Y., Yan, W.

55720807900;8319645300;8204398700;7402221591;
An improved fuzzy C-means algorithm for manufacturing cell formation
(2002) IEEE International Conference on Fuzzy Systems, 2, pp. 1505-1510. Cited 4
times.
0036458582&partnerID=40&md5=f4cc1edc856632e3cd82711c42eeeff1
AFFILIATIONS: School of Management, Hebei University of Tech., Tianjin 300130,

China;
School of Info. Sciences and Tech., Pennsylvania State University, University Park,
PA 16802, United States;
School of Electrical Engineering, Hebei University of Tech., Tianjin 300130, China
ABSTRACT: This paper presents an improved fuzzy C-means algorithm to solve the
manufacturing cell formation problems. The proposed algorithm, which integrates the
subtractive algorithm (to produce an initial solution), the fuzzy C-means (FCM)
algorithm and a solution selecting procedure (to identify the best solution),
remedies the major weaknesses of original FCM clustering. We test the performance
of the proposed algorithm with 20 data sets from open literature and 60 generated
data sets. Our experiments show that the proposed approach performs much better
than the original FCM and the solutions are consistent with the best solutions
found in references or the control solutions.
INDEX KEYWORDS: Fuzzy c-means algorithm; Manufacturing cell formation; Subtractive
algorithm, Algorithms; Cellular neural networks; Data reduction; Data structures;
Fuzzy sets; Mathematical models, Artificial intelligence
REFERENCES: Chu, C.H., Manufacturing cell formation by competitive learning (1993)
Review, evaluation and directions for future research (1998) Computers & IE, 34,
pp. 3-20;
Gindy, N.N.Z., Ratchev, T.M., Case, K., Component grouping for GT applications-A
1651;
Zhang, C., Wang, H.P., Concurrent formation of part families and machine cell based
on the fuzzy set theory (1992) Journal of Manufacturing Systems, 11 (1), pp. 61-67;

Bezdek, J.C., Pattern recognition with fuzzy objective function algorithms (1981),
New York: Plenum Press; Chu, C.H., Hayya, J.C., A fuzzy clustering approach to
29 (7), pp. 1475-1487;
Josien, K., Liao, T.W., Integrated use of fuzzy C-means and fuzzy KNN for GT part
family and machine cell formation (2000) International Journal of Production
Research, 38 (15), pp. 3513-3536;
1077-1094;
Susanto, S., Kennedy, R.D., Price, J.W.H., A new fuzzy-C-Means and assignment
type clusters separately (1999) Production Planning & Control, 10 (4), pp. 375-388;
Sen, S., Dave, R.N., Application of noise clustering in group technology (1999) The
18th International Conference of the North American Fuzzy Information Processing
Society, pp. 366-370;
Chiu, S.L., Fuzzy model identification based on cluster estimation (1994) Journal
of Intelligent and Fuzzy Systems, 2 (3), pp. 267-278;
Jang, J.S.R., Sun, C.T., Mizutani, E., Neuro-fuzzy and soft computing - a
computational approach to learning and intelligence (1997), Prentice-Hall; Mak,
K.L., Wong, Y.S., Wang, X.X., An adaptive genetic algorithm for manufacturing cell
pp. 491-497;
Kumar, C.S., Chandrasekham, K.P., Grouping efficacy: A quantitative criterion for
Research, 24, pp. 451-464;
Moon, Y.B., Forming part-machine families for cellular manufacturing: A neural-
5, pp. 278-291;
pp. 293-318;
397;
Chu, C.H., An improved neural network for manufacturing cell formation (1997)
29 (9), pp. 1771-1784;
Dasari, R.V., Moon, Y.B., Analysis of part families for group technology
applications using decision trees (1997) International Journal of Advanced
CORRESPONDENCE ADDRESS: Li, J.; School of Management, Hebei University of Tech.,
Tianjin 300130, China
ISSN: 10987584
CODEN: PIFSF
ABBREVIATED SOURCE TITLE: IEEE Int Conf Fuzzy Syst
SOURCE: Scopus
Wicks, E.M., Reasor, R.J.

6701823349;6505956377;
Designing cellular manufacturing systems with dynamic part populations
84934444077&doi=10.1080%2f07408179908969801&partnerID=40&md5=1f195929c325e9d07723ff
e6aab71905
DOI: 10.1080/07408179908969801
AFFILIATIONS: Department of Industrial Engineering, University of Missouri-
Columbia, Columbia, M065211, United States;
Eastman Chemical Company, PO Box 1973, Kingsport, TN, 37662-5284, United States
ABSTRACT: The effectiveness of a cellular manufacturing system is sensitive to
fluctuations in the demand for products and the product mix. This paper presents a
new formulation of the part family/machine cell formation problem that addresses
the dynamic nature of the production environment by considering a multi-period
forecast of product mix and demand during the formation of part families and
machine cells. The goal of the multi-period formulation is to obtain a cellular
design that continues to perform well with respect to the design objectives as the
part population changes with time. © 1999, Taylor and Francis Group, LLC.
REFERENCES: Wemmerlöv, U., Johnson, D.J., Cellular manufacturing at 46 user plants
implementation experiences and performance improvements (1997) International
752;
Management, 6 (2), pp. 125-147;
Flexible Automation and Intelligent Manufacturing, 3 (3-4), pp. 161-200;
long-term demand changes a methodology and investigation (1993) Decision Sciences,
24 (5), pp. 909-929;
Seifoddini, H., Djassemi, M., Sensitivity analysis in cellular manufacturing in the
case of product mix variations (1996) Computers and Industrial Engineering, 31 (1-
2), pp. 163-167;
(1), pp. 47-64;
Research, 25 (5), pp. 639-665;
Wemmerlov, U., Hyer, N.X., Research issues in cellular manufacturing (1987)
Jordan, P.C., Frazier, G.V., Is the full potential of cellular manufacturing being
achieved? (1593) Production and Inventory Management Journal, 34 (1), pp. 70-71.,
First Quarter;
Offodile, O.F., Mehrez, A., Grznar, J., Cellular manufacturing a taxonomic review
Chu, C.-H., Recent advances in mathematical programming for cell formation (1995)
Planning, Design, and Analysis of Cellular Manufacturing Systems, pp. 3-46.,
Kamrani, A.K., Parsaei, H.R., and Liles, D.H., (eds), Elsevier Science, Amsterdam,
The Netherlands;
cormpoent grouping problem with multiple objectives (1992) And Industrial
Engineering, 22 (4), pp. 469-480;
tc cell composition and layout design problems (1996) International Journal of
Joines, J.A., Culbreth, C.T., Kinjj, R.E., Programming model employing genetic
algorithms (1996) HE Transactions, 28 (1), pp. 69-85;
Goldberg, D.E., (1989) Genetic Algorithms in Search, Optimization. and Machine
Learning, , Addison-Wesley, Reading, MA
ISSN: 0740817X
SOURCE: Scopus
Vakharia, A.J., Chang, Y.-L.

7003543855;7501842245;
Cell formation in group technology: A combinatorial search approach
24 times.
0031186050&doi=10.1080%2f002075497195056&partnerID=40&md5=fdb26a0083cdecaeba3ab4b02
a1bfb59
DOI: 10.1080/002075497195056
AFFILIATIONS: Decision and Information Sciences Department, College of Business
Administration, University of Florida, Gainesville, FL, 32611-7160, United States;
Ivan Allen College of Management, Policy and International Affairs, Georgia
Institute of Technology, Atlanta, GA, 30332, United States
ABSTRACT: This paper addresses the cell formation problem in group technology (GT).
We develop two heuristic methods for generating solutions to the problem. These
methods are based on two powerful combinatorial search methods simulated annealing
and tabu search. The performance of the heuristics is examined using randomly
generated, published and industry data. The results indicate that the simulated
annealing based heuristic is the preferred technique in the context of the problem
addressed in this paper. Further, we also demonstrate that the simulated annealing
based heuristic generates near-optimal solutions to the cell formation model
formulated in this paper. © 1997 Taylor & Francis Group, LLC.
INDEX KEYWORDS: Algorithms; Combinatorial mathematics; Heuristic methods;
Mathematical models; Problem solving; Simulated annealing, Cell formation; Group
technology, Flexible manufacturing systems
REFERENCES: Askin, R.G., Goldberg, J.B., Creswell, S.H., Vakharia, A.J., A
Hamiltonian path approach for restructuring the part-machine matrix for cellular
1081-1100;
113;
Askin, R.G., Vakharia, A.J., Group technology-cell formation and operation. Chapter
19 in (1990) The Automated Factory Handbook: Technology and Management, pp. 317-
366., D. I. Cleland and B. Bidanda (eds), University of Pittsburgh (New York: TAB
Books);
Burbidge, J.L., (1975) The Introduction of Group Technology, , New York: Wiley);
Burbidge, J.L., (1979) Group Technology in the Engineering Industry, , London:
Mechanical Engineering Publications);
Cheh, K.H., Goldberg, J.B., Askin, R.G., A note on the effect of neighbourhood
structure in simulated annealing (1991) Computers and Operations Research, 18 (6),
pp. 537-547;
intelligence (1986) Computers and Operations Research, 13 (5), pp. 533-549;
Glover, F., Tabu search-Part I (1989) ORSA Journal on Computing, 1 (3), pp. 190-
206;
Harhalakis, G., Proth, J.M., Xie, L., Manufacturing cell design using simulated
annealing: An industrial application (1990) Journal of Intelligence Manufacturing,
2 (3), pp. 75-82;
Hyer, N., The potential of group technology for US manufacturing (1984) Journal of
(8);
Johnson, D.S., Aragon, C.R., Mc Geoch, L.A., Schevon, C., Optimization by simulated
annealing: An experimental evaluation; part I, graph partitioning (1989) Operations
Research, 37 (6), pp. 865-892;
Johnson, D.S., Aragon, C.R., Mc Geoch, L.A., Schevon, C., Optimization by simulated
annealing: An experimental evaluation; part II, Graph coloring and number
partitioning (1991) Operations Research, 39 (3), pp. 378-406;
Marsten, R.E., The design of the xMp mathematical programming library (1981) ACM
Transactions on Mathematical Software, 7 (4), pp. 481-497;
Mc Auley, J., Machine grouping for efficient production (1972) Production Engineer,
pp. 53-57., (February), pp;
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E., Equation of
steady state calculation by fast computing machines (1953) Journal of Chemical
Physics, 21, pp. 1087-1092;
Ransom, G.M., (1972) Group Technology, , New York: McGraw-Hill);
Selim, H., Askin, R.G., Vakharia, A.J., (1995) Cell Formation in Group Technology:
Review, Evaluation and Directions for Future Research, , Working Paper #95-110, DIS
Department, College of Business Administration, University of Florida, Gainesville,
FL 32611, USA;
Shafer, S.M., Rodgers, D.F., A goal programming approach to the cell formation
problem for cellular manufacturing (1991) Journal of Operations Management, 10 (1),
p. 2843;
Singhal, J., Marsten, R.E., Morin, T.L., Fixed order branch-and-bound methods for
mixed-integer programming (1989) ORSA Journal on Computing, 1 (1), pp. 44-51;
Skorin-Kapov, J., Tabu search applied to the quadratic assignment problem (1989)
ORSA Journal on Computing, 2 (1), pp. 33-45;
Vakharia, A.J., Askin, R.G., Sen, S., Cell formation in group technology: A
mathematical programming approach (1989) Proceedings of the DSI Annual Meeting, 1,
pp. 178-180., New Orleans;
Vakharia, A.J., Chang, Y.L., A simulated annealing approach to scheduling a
manufacturing cell (1990) Naval Research Logistics, 37, pp. 559-577;
(1), pp. 84-97;
Van Laarhoven, P.J.M., Aarts, E.H.L., (1987) Simulated Annealing: Theory and
Applications, , (Dordrecht, Netherlands: Kluwer Academic);
Wemmerlov, U., Heyer, N.L., Procedures for the part family/machine group
Management, 6 (2), pp. 125-147;
CORRESPONDENCE ADDRESS: Vakharia, A.J.; Decision and Information Sciences
Department, College of Business Administration, University of Florida, Gainesville,
FL, 32611-7160, United States
ISSN: 00207543
SOURCE: Scopus
Akturk, M.S., Sr.

57208893391;
A note on the within-cell layout problem based on operation sequences
0029733114&doi=10.1080%2f09537289608930330&partnerID=40&md5=dd96851a485477d4fe559c8
f3b506e92
DOI: 10.1080/09537289608930330
AFFILIATIONS: Department of Industrial Engineering, Bilkent University, Bilkent,
Ankara, 06533, Turkey
ABSTRACT: The existing studies in the literature usually ignore the within-cell
layout problem while forming part families andmanufacturing cells. A new approach
is proposed to solve thepart-family and machine-cell formation problem and to
determinethe spatial arrangement of machines in each cell
simultaneously.Furthermore, a dissimilarity measure between parts based onoperation
sequences is presented since the operation sequences notonly specify the type of
machine tools needed but also impact theflow of material. As a result, we can both
minimize the materialhandling cost and streamline the material flow in each cell. ©
AUTHOR KEYWORDS: Cell layout; Cellular manufacturing; Operation sequence; Part
similarity
INDEX KEYWORDS: Mathematical models; Problem solving; Production control, Cell
layout; Cellular manufacturing; Operation sequences; Part similarity, Computer
aided manufacturing
REFERENCES: Choobineh, F., A framework for the design of cellular manufacturing
Greene, T.J., Sadowski, R.P., Cellular manufacturing control (1982) Journal of
Gunasekaran, A., Goyal, S.K., Virtanen, I., Yu-Olli, P., An investigation into the
application of group technology in advanced manufacturing systems (1994)
Kamrani, A.K., Parsaei, H.R., A methodology for the design of manufacturing systems
using group technology (1994) Production Planning & Control, 5, pp. 450-464;
Kaufman, L., Rousseeuw, P.J., (1989) Finding Groups in Data, , John Wiley & Sons,
New York);
Sarker, B.R., Wilhelm, W.E., Hogg, G.L., Measures of backtracking and bi-
directional flow in one dimensional machine location problems (1994) Production
Planning & Control, 5, pp. 282-291;
Vakharia, A., Wemmerlûv, U., Designing a cellular manufacturing system: A materials
flow approach based on operations sequences (1990) IIE Transactions, 22, pp. 84-97
CORRESPONDENCE ADDRESS: Akturk, M.S.; Department of Industrial Engineering, Bilkent
University, Bilkent, Ankara, 06533, Turkey
ISSN: 09537287
SOURCE: Scopus
Dagli, C., Huggahalli, R.

7006792258;8874861800;
Machine-part family formation with the adaptive resonance theory paradigm
times.
0000317717&doi=10.1080%2f00207549508930185&partnerID=40&md5=5f4246c0e999e2e13befc94
3ac333f6e
DOI: 10.1080/00207549508930185
AFFILIATIONS: Engineering Management Department, University of Missouri-Rolla,
Rolla, MO, 65401, United States;
Department of Electrical and Computer Engineering, University of South Carolina,
Columbia, SC, 29208, United States
ABSTRACT: The ARTI neural network paradigm employs a heuristic where new vectors
arc compared with group representative vectors for classification. ARTI is adapted
for the cell formation problem by reordering input vectors and by using a better
representative vector. This is validated with both test cases studied in literaure
as well as synthetic matrices. Algoriihmns for effective use of ARTI are proposed.
This approach is observed to produce sufficiently accurate results and is therefore
promising in both speed and functionality. For the automatic generation of an
optimal family formation solution a decision support system can be integrated with
ARTI. © 1995 Taylor & Francis Group, LLC.
REFERENCES: Banerjee, K.G., Redford, A.H., Visual inspection of components for
mechanized assembly (1982) International Journal of Production Research, 20 (5),
pp. 545-553;
Burbridge, J.L., A manual method of production flow analysis (1977) Production
Dagli, C., Huggahalli, R., Neural Network Approach to Group Technology (1991)
Knowledge Based Systems and Neural Networks-Techniques and Applications, pp. 213-
228., R. Sharda, J. Y., Cheung, and N. J. Cochran (Eds) (New York: Elsevier;
Dagli, C., Sen, C.F., ARTI Neural Network Approach to Large-Scale Group Technology
Problems (1992) Robotics and Manufacturing: Recent Trends in Research, Education
and Applications, 4., M. Jamshidi, R. Lumia, J. Mulling and M. Shahinpoor (Eds)
(New York: ASME Press;
Dagli, C., (1994) Artificial Neural Networks for Intelligent Manufacturing, ,
London: Chapman and Hall);
El-Essawy, I., Torrance, J., Component flow analysis-an effective approach to
production systems design (1972) Production Engineer, 51, p. 165;
Flynn, B.B., The effects of setup time on output capacity in cellular manufacturing
Groover, M., (1987) Automation. Production Systems and Computer Integrated
Manufacturing, , 2nd edition, New Jersey: Prentice Hall);
Gupta, R., Tomkins, J.A., An examination of the dynamic behaviour of part families
pp. 73-86;
Huggahalli, R., (1991) A Neural Network Approach to Group Technology, , MS thesis,
University of Missouri-Rolla;
Hyer, N.L., (1984) Group Technology at Work, , Society of Manufacturing Engineers;
Hyer, L., Wemmerlov, U., Group technology in US manufacturing industry: A survey of
current practices (1989) International Journal of Production Research, 27 (8), pp.
1287-1304;
Kaparthi, S., Suresh, C., Machine-component cell formation in group technology:
Neural network approach (1992) International Journal of Production Research, 30
(6), pp. 1353-1368;
pp. 117-133;
Kumar, K.R., Vannelli, A., A method of finding minimal bottleneck cells for
grouping part-machines families (1986) International Journal for Production
Research, 24 (2), pp. 387-400;
(1986) Control and Cybernetics, 15 (2), pp. 139-154;
manufacturing systems (1991) Journal of Intelligent Manufacturing, 2 (5), pp. 305-
314;
Moon, Y., Interactive activation and competition model for machine-part family
formation (1990) Proceedings of the International Journal Conference on Neural
Networks, 2, pp. 667-670., Washington D.C;
Sahay, A.K., Seifoddini, H., An algorithm for forming machine-component cell in
group technology (1987) Proceedings of the 9Th International Conference on
group technology (1986) IIE Transactions, pp. 271-277., September;
(1989) IIE Transactions, pp. 382-388., December;
Simpson, P.K., Artificial Neural Systems-Foundations (1990) Paradigms, Applications
and Implementations, , (New York: Pergamum), 1st edition;
Wasserman, D., (1989) Neural Computing-Theory and Practice, , Van Nostrand
Reinhold;
Decision Sciences, 21 (2), pp. 243-257
CORRESPONDENCE ADDRESS: Dagli, C.; Engineering Management Department, University of
Missouri-Rolla, Rolla, MO, 65401, United States
ISSN: 00207543
SOURCE: Scopus
Krishna, Srinivasan, Narendran, T.T.

57197559343;7003728237;
Bi-criteria model of the grouping problem in FMS
(1993) Modelling, Measurement & Control D: Manufacturing, Management, Human &
Socio-Economic Problems, 8 (3), pp. 31-44.
0027842103&partnerID=40&md5=72bd0de4ce5c9b44479798c301d7ac62
AFFILIATIONS: Indian Inst of Technology, Madras, India
ABSTRACT: This study addresses the problem of grouping while maximizing flexibility
in an FMS. Real-time scheduling in FMS is facilitated by the reduction of
complexity that arises from the large spectrum of parts, by formation of part
families. While existing procedures treat the cell formation problem in FMS as a
conventional grouping problem, this approach utilizes a flexibility-based procedure
which identifies a process plan for each part based on maximization of flexiblities
for the entire system and then solves the grouping problem. A bi-criteria non-
linear integer program is formulated and solved through Simulated Annealing.
INDEX KEYWORDS: Mathematical models; Optimization; Scheduling, Bicriteria model;
Grouping problem; Integer programming; Real time scheduling, Flexible manufacturing
systems
CORRESPONDENCE ADDRESS: Krishna, Srinivasan; Indian Inst of Technology, Madras,
India
ISSN: 09896074
CODEN: MMSPE
ABBREVIATED SOURCE TITLE: Modell Meas Control D
SOURCE: Scopus
Vakharia, A.J., Wemmerlov, U.

7003543855;6601920402;
Designing a cellular manufacturing system: a materials flow approach based on
operation sequences
Cited 204 times.
0025399180&doi=10.1080%2f07408179008964161&partnerID=40&md5=6031e8e34224b2f94f455ad
17975fa62
DOI: 10.1080/07408179008964161
AFFILIATIONS: Department of Management Information Systems, Karl Eller Graduate
School of Management, The University of Arizona, Tucson, AZ, 85721, United States;
University of Wisconsin-Madison, Madison, WI, 53706, United States
ABSTRACT: This paper presents a cell formation method which integrates the issues
of cell formation and within-cell material flows. A coefficient which assesses the
similarity of two parts in terms of their operation sequences is proposed and used
to form part families and cells. Further, the within-cell machine sequence and
machine loads are explicitly considered in the design process. The methodology has
been operationalized through several computer programs (written in FORTRAN 77) and
implemented on an IBM/PC, An application of the design methodology to a
hypothetical cell formation problem is provided. © 1990 Taylor & Francis Group,
LLC.
INDEX KEYWORDS: Industrial Plants--Layout; Mathematical Techniques--Heuristic,
Cellular Manufacturing Systems; Materials Flow; Operation Sequences, Production
Control
REFERENCES: Armour, G.C., Buffa, E.S., A Heuristic Algorithm and Simulation
Approach to the Relative Location of Facilities (1963) Management Science, 9 (2),
pp. 294-309;
Ballalcur, A., (1985) An Investigation of Pan Family/Machine Group Formation in
Designing a Cellular Manufacturing System, , Unpublished Ph.D. Thesis, University
of Wisconsin-Madison;
Browne, J., Dubois, D., Rathmill, K., Sethi, S.P., Stecke, K.E., Classification of
Flexible Manufacturing Systems (1984) The FMS Magazinel, 2, pp. 114-117;
Burbidge, J.L., (1975) The Introduction of Group Technology, , John Wiley and Sons,
New York;
Carrie, A., Numerical Taxonomy Applied to Group Technology and Plant Layout (1973)
Carrie, A., The Layout of Milai-BrdrtLines (1975) International Journal of
Carter, M.F., Designing Flexibility into Automated Manufacturing Systems (1986)
Proceedings Ctlhe Second ORSA/T1MS Conference on Flexible Manufacturing Sysrems,
pp. 107-118., Elsevier Science Publishers, Amsterdam;
Chan, H.M., Milner, D.A., EbsritClustering Algorithm for Group Formation in
Cellular Manufacture (1982) Journal of Manufacturing Systems 1,1, pp. 65-74;
Chandrasekharan, M.P., Rajagopalan, R., MODROC: An Extension of Rank Otrihr
Research, 24 (5), pp. 1221-1233;
De Beer, C., De Witte, J., Production Flow Synthesis (1978) CIRP Armais, 27, pp.
389-392;
De Witte, J., The Use of Similarity Coefficients in Production Flow Analysis (1980)
Dumolien, W.J., Santen, W.P., 0=1 lular Manufacturing Becomes Philosophy of
Management at Component Ehcility (1983) Industrial Engineering, pp. 72-76;
Flynn, B.B., Jacobs, F.R., A SimulationComparison of Group Technology with
TraditionalJob ShopManufacturing (1986) International Journal Cf Production
Research, 24 (5), pp. 1171-1192;
Hull, R.W., (1983) Zero Inventories, , Dow Jones-Irwin, Homewood, Illinois;
Hollier, R.H., The Layoutof Multi-Product Lmes (1963) International Journal of
King, J.R., Nakomchai, V., Machine-Component Group Formation in Group Technology;
Review and Extension (1982) International Journal Cf Production Research, 20 (2),
pp. 117-133;
Kumar, K.R., Vannelli, A., Design of Flexible Production System: Capacity Balancing
and Subcontracting Strategies (1986) Proceed Ings Rf the Secondorsa/Tims Conference
on Flexible Manufacturing Systans, pp. 203-208., Elsevier Science Publishers,
Amsterdam;
Llewellynn, R.W., Travel Charting with Realistic Criteria (1958) Journal Cf
pp. 53-57;
Monden, Y., (1983) Toyota Production System, , Industrial Engineering and
Management Press, Atlanta, Georgia;
Rajagopalan, R., Batra, J.L., Design of Cellular Production Sys- tans: A Graph-
Theoretic Approach (1982) International Journal of Production Research, 13 (6), pp.
567-579;
Reed, R., (1967) Plant Location, Layout and Maintenance, , Richard D. Irwin, Inc..
Illinois;
Schonberger, R.J., (1982) Japanese Manufacturing Techniques: Nine Hidden Lessons in
Simplicity, , Free Press, New York;
Seifoddini, H., Wolfe, P.M., Selection of a Threshold Value Based on Material
Handling Cost in Machine-Component Grouping (1981) HE Transactions, 19 (3), pp.
266-270;
Selvam, R.P., Balasubraraanian, K.N., Algorithmic Grouping of Operation Sequences
Stanfel, L.E., Machine Clustering for Economic Production (1985) Engineering Costs
Tilsley, R., Lewis, F.A., Flexible Cell Manufacturing Systems-A Realistic Approach
(1977) CIRP Armais, 24, pp. 269-271;
Vanndli, A., Kumar, K.R., A Method forFinding Minimal Bottle Neck Cells for
Grouping Part -M achine Emilies (1986) International Journal of Production
Research, 24 (2), pp. 387-400;
Wemmerl, U., Hyer, N.L., Procedures for the Part Family Machine Group
Identification Problem in Cellular Manufacture (1986) Journal of Operations
Management, 6 (2), pp. 125-147;
Wemmerlov, U., Vakharia, A.J., (1988) Dynamic and Intermittent Job and Family
Scheduling of a Flow-Line Manufacturing Cell, , Working paper, Graduate School of
Business, University of Wisconsin- Madison
ISSN: 0740817X
SOURCE: Scopus
Li, J., Chu, C.-H., Wang, Y., Yan, W.

55720807900;8319645300;8204398700;7402221591;
An improved fuzzy clustering method for cellular manufacturing
21 times.
33847039679&doi=10.1080%2f00207540600634923&partnerID=40&md5=016710d7a718df9c2cb442
365a38dacf
DOI: 10.1080/00207540600634923
AFFILIATIONS: School of Management, Hebei University of Technology, Tianjin 300130,
China;
School of Information Systems, Singapore Management University, 80 Stamford Road,
Singapore 178902, Singapore;
School of Electrical Engineering and Automation, Hebei University of Technology,
Tianjin 300130, China
ABSTRACT: Fuzzy c-means (FCM) has been successfully adapted to solve the
manufacturing cell formation problem. However, when the problem becomes larger and
especially if the data is ill structured, the FCM may result in clustering errors,
infeasible solutions, and uneven distribution of parts/machines. In this paper, an
improved fuzzy clustering algorithm is proposed to overcome the deficiencies of
FCM. We tested the effects of algorithm parameters and compared its performance
with the original and two popular FCM modifications. Our study shows that the
proposed approach outperformed other alternatives. Most of the solutions it
obtained are close to and in some cases better than the control solutions.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Fuzzy c-means; Fuzzy
clustering
INDEX KEYWORDS: Algorithms; Data structures; Fuzzy control; Problem solving, Cell
formation; Fuzzy c means; Fuzzy clustering, Cellular manufacturing
REFERENCES: Batra, J.L., Rajagopalan, R., A composite components through graphs and
fuzzy clusters (1977) Proceedings of the 18th International MTDR Conference, ,
London;
Ben-Arieh, D., Lee, S.E., Chang, P.T., Fuzzy part coding for group technology
(1996) Euro. J. Op. Res, 92, pp. 637-648;
weighted fuzzy features (1992) Int. J. Prod. Res, 30 (6), pp. 1285-1299;
Algorithms, , Plenum Press: New York;
Burke, L.I., Kamal, S., Fuzzy ART and cellular manufacturing (1992) ANNIE 92
Conference Proceedings, pp. 779-784;
Burke, L.I., Kamal, S., Neural networks and the part family/machine group formation
problem in cellular manufacturing: A framework using fuzzy ART (1995) J. Manuf.
Syst, 14, pp. 148-159;
Chiu, S.L., Fuzzy model identification based on cluster estimation (1994) J. Intel.
Fuzzy Syst, 2 (3), pp. 267-278;
Chu, C.H., Clustering analysis in manufacturing cellular formation (1989) OMEGA,
17, pp. 289-295;
Planning, Design and Analysis of Cellular Manufacturing Systems, pp. 3-46., edited
by A.K. Kamrani, H.R. Parsaei, and D.H. Liles, pp, Elsevier Science: New York;
Chu, C.H., An improved neural network for manufacturing cell formation (1997) Dec.
Sup. Syst, 20, pp. 279-295;
(1991) Int. J. Prod. Res, 29 (7), pp. 1475-1487;
Gill, A., Sector, C.R., A fuzzy linguistic approach to data quantification and
construction of distance measures for the part family formation problem (1997) Int.
J. Prod. Res, 35 (9), pp. 2565-2578;
Gindy, N.N.Z., Ratchev, T.M., Case, K., Component grouping for GT applications - a
fuzzy clustering approach with validity measure (1995) Int. J. Prod. Res, 33 (9),
pp. 2493-2509;
grouping (2000) Int. J. Prod. Econ, 63, pp. 181-193;
Gupta, T., Seifoddini, H., Production data-based similarity coefficient for
system (1990) Int. J. Prod. Res, 28 (7), pp. 1247-1267;
Hop, N.V., Tabucanon, M.T., Fuzzy multi-attribute decision-making for grouping of
electronic components in process planning (2000) Prod. Plan. & Cont, 11 (7), pp.
677-688;
family and machine cell formation (2000) Int. J. Prod. Res, 38 (15), pp. 3513-3536;
and coding of rotational parts (1991) Int. J. Prod. Res, 29 (9), pp. 1771-1784;
Kaparthi, S., Suresh, N.C., Performance of selected part-machine grouping
techniques for data sets of wide ranging sizes and imperfection (1994) Dec. Sci,
25, pp. 515-539;
J. Prod. Res, 28, pp. 233-243;
Kuo, R.J., Chi, S.C., Den, B.W., A fuzzy Kohonen's feature map neural network with
application to group technology (1999) International Joint Conference on Neural
Networks, 5, pp. 3098-3101;
manufacturing (1996) J. Intel. Manuf, 7, pp. 355-364;
Li, J., Ding, Z., Wei, W., Fuzzy cluster analysis and fuzzy pattern recognition
methods for formation of part families (1988) NAMRC, Society of Manufacturing
Engineers, pp. 558-563;
machine-component matrix formation in cellular manufacturing (1996) Euro. J. Op.
Res, 93, pp. 88-97;
Review, evaluation and directions for future research (1998) Comp. & IE, 34, pp. 3-
20;
Suresh, N.C., Kaparthi, S., Performance of fuzzy ART neural network for group
technology cell formation (1994) Int. J. Prod. Res, 32, pp. 1693-1713;
(1998) Group Technology and Cellular Manufacturing: A State-of-the-Arr Synthesis of
Research and Practice, , Suresh, N.C. and Kay, J.M, Eds, Kluwer Academic
Publishers: Boston;
new hierarchical methodology (1995) Int. J. Prod. Res, 33, pp. 1761-1784;
type clusters separately (1999) Prod. Plan. & Cont, 10 (4), pp. 375-388;
machine capacity (1997) Inr. J. Adv. Manuf. Tech, 13, pp. 134-147;
Tsai, C.C., Chu, C.H., Barta, T.A., Modeling and analysis of a manufacturing cell
formation problem with fuzzy mixed-integer programming (1997) IIE Trans, 23, pp.
533-547;
state-of-the-art review (1999) Int. J. Prod. Res, 37 (14), pp. 3335-3357;
identification problem in cellular manufacture (1986) J. Op. Manage, 6, pp. 125-
147;
mathematics (1989) Int. J. Prod. Res, 27 (9), pp. 1637-1651;
Zhang, C., Wang, H.P., Concurrent formation of part families and machine cell based
on the fuzzy set theory (1992) J. Manuf. Syst, 11 (1), pp. 61-67
CORRESPONDENCE ADDRESS: Chu, C.-H.; School of Information Systems, Singapore
Management University, 80 Stamford Road, Singapore 178902; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Trindade, Á.R., Ochi, L.S.

14829578700;8935888900;
Um algoritmo evolutivo híbrido para a Formação de Células de Manufatura em sistemas
de produção
(2006) Pesquisa Operacional, 26 (2), pp. 255-294. Cited 3 times.
33749474133&partnerID=40&md5=03155e730190d29900f9f8f83a6cf64e
AFFILIATIONS: Instituto de Computação, Universidade Federal Fluminense (UFF),

Niterói - RJ, Brazil
ABSTRACT: The Manufacturing Cell Formation Problem (MCFP) is a crucial component of
a cell production design in a manufacturing system. This problem is composed by a
set of parts of products to be manufactured and machines. The objective is to
construct manufacturing clusters by associating products with cell machines. This
paper presents a new hybrid evolutionary algorithm to solve the MCFP. Computational
results with the proposed algorithm on a set of instances available in the
literature are also presented. For 8 out of 36 instances considered, the propose
method overcame the previous results from the literature and for 26 instances, the
same best solutions were found.
AUTHOR KEYWORDS: Evolutionary algorithms; Genetic algorithms; Heuristics
REFERENCES: Aljaber, N., Baek, W., Chen, C.L., A tabu search Approach to the cell
formation problem (1997) Computers Industrial Engineering, 32 (1), pp. 169-185.,
[ABC97];
Aiex, R.M., Resende, M.G.C., Ribeiro, C.C., Probability distribution of solution
time in GRASP: An experimental investigation (2002) Journal of Heuristics, 8, pp.
343-373., [Ai02];
Boley, D., Gini, M., Gross, R., Han, E.H., Hastings, K., Karypis, G., Kumar, V.,
Moore, J., Partitioning based clustering for Web document categorization (1999)
Decision Support Systems, 27, pp. 329-341., [BGH99];
Bastos, L., Ochi, L.S., Macambira, E.M., A relative neighborhood GRASP for the
SONET ring assignment problem (2005) Proc. of the International Network
Optimization Conference - 2005 (INOC 2005), pp. 833-838., [BOM05a], Book 3. Co-
sponsored by INFORMS. Lisbon - Portugal;
Bastos, L., Ochi, L.S., Macambira, E.M., GRASP with path relinking for the SONET
ring assignment problem (2005) Proc. of the 5 th International Conference on Hybrid
Intelligence Systems (HIS2005), pp. 239-244., [BOM05b]. Co-sponsored by IEEE
Systems, Man, and Cybernetics Society;
Brown, E.C., Sumichrast, R.C., CF-GGA: A grouping genetic algorithm for the cell
3651-3669., [BS01];
Burbidge, J.L., The first step in planning group technology (1996) International
Journal of Production Economics, 43, pp. 261-266., [Bu96];
Cheng, C.H., Gupta, Y.P., Lee, W.H., Wong, K.F., A TSP based heuristic for forming
Research, 36 (5), pp. 1325-1337., [CGLW98];
Research, 24 (5), pp. 1221-1233., [CR86];
Production Research, 25 (6), pp. 835-850., [CR87];
Davis, L., (1991) Handbook of Genetic Algorithms, , [Da91]. VNR Computer Library;
227-240., [DLRG01];
programming for the solution of simple cell formation problems (2001) International
Journal of Production Research, 39 (1), pp. 1-19., [DM01];
Dias, C.R., Ochi, L.S., Efficient evolutionary algorithms for the clustering
problems in directed graphs (2003) Proc. of the IEEE Congress on Evolutionary
Computation (IEEE-CEC), pp. 983-988., [DO03]. Canberra, Australia (CD-ROM);
Ericsson, M., Resende, M.G.C., Pardalos, P.M., A genetic algorithm for the weight
setting problem in OSPF routing (2002) Journal of Combinatorial Optimization, 6,
pp. 299-333., [ERP02];
Feo, T., Resende, M.G.C., Greedy randomized adaptive search procedures (1995)
Journal of Global Optimization, 6, pp. 109-133., [FR95];
Filho, G.R., Lorena, L.A.N., A constructive evolutionary approach to the machine-
part cell formation problem (2000) Buildings Competencies for International
Manufacturing - Perspectives for Developing Countries, pp. 340-348., [FL00];
França, P.M., Sosa, N.M., Pureza, V., An adaptive tabu search algorithm for the
capacitated clustering problem (1999) International Transactions in Operational
Research, 6, pp. 655-678., [FSP99];
(1998) Evolutionary Computation, , [Fog98] Fogel, D.B. [editor]. IEEE Press, Inc;
Glover, F., Laguna, M., (1997) Tabu Search, , [GL97]. Kluwer Academic Publishers;
Future paths for integer programming a links to artificial intelligence (1986)
Computers & Operational Research, 5, pp. 533-549., [Glo86] Glover, F;
Goldschmidt, O., Laugier, A., Olinick, E.V., SONET/SDH ring assignment with
capacity constraints (2003) Discrete Applied Mathematics, 129, pp. 99-128.,
[GLO03];
Gonçalves, J.F., Mendes, J.J.M., Resende, M.G.C., A hybrid genetic algorithm for
the job shop scheduling problems (2004) European Journal of Operational Research, ,
[GMR04]. To appear;
Gao, L., Rosenberg, A.L., Sitaraman, R.K., Optimal clustering of tree sweep
computations for high-latency parallel environments (1999) IEEE Trans. on Parallel
and Distributed Systems, 10 (8), pp. 813-824., [GRS99];
Gerasoulis, A., Yang, T., A comparison of Clustering heuristics for scheduling
directed acyclic graphs on multiprocessors (1992) Journal of Parallel and
Distributed Computing, 16, pp. 276-291., [GY92];
Hansen, P., The steepest ascent mildest descent heuristic for combinatorial
programming (1986) Proc. of the Congress on Numerical Methods in Combinatorial
Optimization, , [Hans86], Capri, Italy;
Hou, E.S.H., Ansari, N., Ren, H., A genetic algorithm for multiprocessor scheduling
(1994) IEEE Trans. on Parallel and Distributed Systems, 5 (2), pp. 113-120.,
[HAR94];
Holland, J.H., (1975) Adaptation in Natural and Artificial Systems, , [Holl75].
annealing: An industrial application (1990) Technical Report, , [HPX90], University
of Maryland;
programming model employing genetic algorithms (1996) IIE Transaction, 28, pp. 69-
85., [JCK96];
Joglekar, P., Chung, Q.B., Tavana, M., Note on a comparative evaluation of nine
well-known algorithms for solving the cell formation problem in group technology
(2001) Journal of Applied Mathematics & Decision Sciences, 5 (3), pp. 253-268.,
[JCT01];
Kirkpatrick, S., Gellat, C.D., Vecchi, M.P., Optimization by simulated annealing
(1983) Science, 220, pp. 671-680., [KGV83];
Karypis, G., Kumar, V., A parallel algorithm for multilevel graph partitioning and
sparse matrix ordering (1998) Journal of Parallel and Distributed Computing, 48,
pp. 71-95., [KK98];
Lorena, L.A.N., Furtado, J.C., Constructive genetic algorithm for clustering
problems (2001) Evolutionary Computation, 9 (3), pp. 309-327., [LF01];
Macambira, E.M., (2003) Modelos e Algoritmos de Programação Inteira No Projeto de
Redes de Telecomunicações, , [Mac03]. Tese de Doutorado em Engenharia de Sistemas e
Computação - COPPE/UFRJ. [Orientadores: Nelson Maculan e Cid C. Souza];
Masters, T., (1995) Advanced Algorithms for Neural Networks, , [Mast95]. John Wiley
& Sons;
Mester, D., Braysy, O., Active guided evolution strategies for large-scale vehicle
routing problems with time windows (2005) Computers & Operations Research, 32 (6),
pp. 593-614., [MB05];
Mladenovic, N., A Variable neighborhood algorithm - A new metaheuristic for
combinatorial optimization (1995) Optimization Days, p. 112., [Mla95]. Abstract of
papers presented, Montréal;
Michalewicz, Z., (1994) Genetic Algorithm + Data Structures = Evolution Programs, ,
[Mi94]. AI Series - Springer Verlag, NY;
Moscato, P., On evolution, search, optimization, genetic algorithms and martial
arts: Towards memetic algorithms (1989) Caltech Concurrent Computation Program, ,
[Mos89], C3P Report 8226;
Maheshwari, P., Shen, H., An efficient clustering algorithm for partitioning
parallel programs (1998) Parallel Computing, 24, pp. 893-909., [MS98];
Mak, K.L., Wong, Y.S., Wang, X.X., An adaptative genetic algorithm for
manufacturing cell formation (2000) The International Journal of Advanced
Manufacturing Technology, 16, pp. 491-497., [MWW00];
Ochi, L.S., Drummond, L.M.A., Vianna, D.S., A parallel genetic algorithm for the
vehicle routing problems (1998) Future Generation on Computer Systems, 14 (5-6),
pp. 285-292., [ODV98]. Elsevier;
systems (2001) Computers and Industrial Engineering, 39 (1-2), pp. 125-144.,
[OM01];
Oduguwa, V., Tiwari, A., Roy, R., Evolutionary computing in manufacturing industry:
An overview of recent applications (2004) Applied Soft Computing, , [OTR04]. To
appear;
Ochi, L.S., Vianna, D.S., Drummond, L.M.A., An asynchronous parallel metaheuristic
for the period vehicle routing problems (2001) Future Generation on Computer
Systems, 17, pp. 379-386., [OVD01]. Elsevier;
Plaquin, M., Pierreval, H., Cell formation using evolutionary algorithm with
certain constraints (2000) International Journal of Production Economics, 64 (1-3),
pp. 267-278., [PP00];
Resende, M.G.C., Gonçalves, J.F., An evolutionary algorithm for manufacturing cell
formation (2004) Computers and Industrial Engineering, 47, pp. 247-273., [RG04];
Resende, M.G.C., Ribeiro, C.C., Greedy randomized adaptive search procedures (2003)
Handbook of Metaheuristics, pp. 219-249., [RR03] [edited by F. Glover and G.
Kochenberger], Kluwer Academic Publishers;
(2001) European Journal of Operational Research, 130, pp. 588-611., [Sa01];
Evaluation and direction for future research (1998) Computers and Industrial
Engineering, 34 (1), pp. 3-20., [SAV98];
Sun, D., Lin, L., Batta, R., Cell Formation using tabu search (1995) Computers
Industrial Engineering, 3 (28), pp. 485-494., [SLB95];
Santos, H.G., Ochi, L.S., Marinho, E.H., Drummond, L.M.A., Combining an
evolutionary algorithm with data mining to solve a vehicle routing problem (2006)
NEUROCOMPUTING, , [SOMD06]. To appear Elsevier;
process routes by genetic algorithms (2002) International Journal of Production
Economics, 76 (3), pp. 219-228., [US02];
Vakharia, A.J., Wemmerlov, U., A Comparative investigation of hierarchical
problem (1995) Journal of Operations Management, 13, pp. 117-138., [VW95];
Xambre, A.R., Vilarinho, P.M., A Simulated annealing approach for manufacturing
Operational Research, 151, pp. 434-446., [XV03];
Wang, J., A Linear assignment clustering algorithm based on the least similar
cluster representatives (1999) IEEE Transactions on Systems, Man, and Cybernetics -
Part A: Systems and Humans, 1 (29), pp. 100-104., [Wa99];
users (1989) International Journal of Production Research, 27 (9), pp. 1511-1530.,
[WH89];
Wysk, R.A., (1997) Chapter 18 Lean - Manufacturing, ,
http://www.engr.psu.edu/cim/ie550lean.pdf, [Wy97]. Manufacturing Systems Course.
Department of Industrial and Manufacturing Engineering, Penn State University.
Disponivel (01/2005) em;
Research, 38 (2), pp. 385-395., [ZW00]
CORRESPONDENCE ADDRESS: Ochi, L.S.; Instituto de Computação, Universidade Federal
Fluminense (UFF), Niterói - RJ, Brazil; email: [email protected]
ISSN: 01017438
LANGUAGE OF ORIGINAL DOCUMENT: Portuguese
ABBREVIATED SOURCE TITLE: Pesqui. Oper.
SOURCE: Scopus
Kizil, M., Özbayrak, M.

6701718639;56503651100;
A tradeoff analysis between process plan selection and cell formation in cellular
manufacturing
2442422224&doi=10.1007%2fs00170-003-1669-
z&partnerID=40&md5=1655124c8258b05915b7d20c37a3576d
DOI: 10.1007/s00170-003-1669-z
AFFILIATIONS: Department of Industrial Engineering, Selcuk University, Konya,
Turkey;
Department of Systems Engineering, Brunel University, Uxbridge, Middlesex UB8 3PH,
United Kingdom
ABSTRACT: In this paper, an algorithm to evaluate the tradeoff between conflicting
objectives in process plan selection and cell formation is developed. Consideration
of the minimisation of intercell material movement in cellular manufacturing is
necessary but not in itself sufficient to produce a system for which the total work
content is minimised. Solving the process plan selection and the cell formation
problem for all possible alternative process plans is a time-consuming task, and
therefore not economically justifiable. The algorithm is illustrated through the
use of a sample problem that shows how it is possible to create a cell using the
algorithm presented in this paper.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Clustering; Process
plan selection; Work content
INDEX KEYWORDS: Algorithms; Industrial economics; Linear programming; Materials
handling; Mathematical models; Problem solving; Productivity, Cell formation;
Clustering; Process plan selection; Work content, Cellular manufacturing
REFERENCES: Seo, Y., Egbelu, J.P., Process plan selection based on product mix and
production volume (1996) Int J Prod Res, 34 (9), pp. 2639-2655;
Secco-Suardo, G., Optimization of closed queuing networks (1978) Research Report, ,
ESL-FR, MIT, Electronics Systems Laboratory, Cambridge, MA;
Sundaram, M.R., Doshi, K., Cellular manufacturing system design with alternative
routing consideration (1993) Comp Indust Engin, 25 (1), pp. 477-480;
Kimmemia, J., Gershwin, S.B., Flow optimization in flexible manufacturing systems
(1985) Int J Prod Res, 23 (1), pp. 81-96;
Yao, D., Shantikumar, J.G., Some resource allocation problems in multi cell systems
(1986) Proceedings of the ORSA/TIMS Conference on FMS, Operations Research and
Applications, , Elsevier, Amsterdam;
Leung, L.C., Tanchoco, J.M.A., A profit maximization model for machine/part
assignment in a manufacturing system (1986) Int J Engin Cost Prod Econ, 10, pp. 57-
67;
Beaulieu, A., Gharbi, A., Ait-Kadi, An algorithm for the cell formation and the
machine selection problems in the design of a cellular manufacturing system (1997)
Int J Prod Res, 35 (7), pp. 1857-1874;
Avonts, L.H., Vanwassenhove, L.N., The part mix and routing mix problem in FMS: A
coupling between an LP model and a closed queuing network (1988) Int J Prod Res, 26
(12), pp. 1891-1902;
Tetzlaff, U., (1990) Optimal Design of Flexible Manufacturing Systems, ,
Dissertation, University of Heidelberg;
Kasilingham, K.R., Lashkari, R.S., Simultaneous grouping of parts and machines in
cellular manufacturing systems - An integer programming approach (1991) Comp Indust
Engin, 20 (1), pp. 111-127;
Sofianpolou, S., Manufacturing cell design with alternative process plans and/or
Review and extension (1982) Int J Prod Res, 20 (2), pp. 117-133;
Kizil, M., The design and evaluation of cellular manufacturing systems with
alternative routing considerations (2000) Working Paper, , Rensselaer Polytechnic
Institute, Troy, NY;
Fourer, R., Gay, D.M., Kernighan, B.W., (1993) AMPL: A Modeling Language for
Mathematical Programming, , Duxbury Press/Brooks/Cole Publishing Company, Florence,
KY
CORRESPONDENCE ADDRESS: Özbayrak, M.; Department of Systems Engineering, Brunel
University, Uxbridge, Middlesex UB8 3PH, United Kingdom; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Seifoddini, H.
7003581042;
A note on the similarity coefficient method and the problem of improper machine
assignment in group technology applications
97 times.
0024699683&doi=10.1080%2f00207548908942614&partnerID=40&md5=0bef1b8abc6fa9c2380b74e
1a74326d9
DOI: 10.1080/00207548908942614
Wisconsin-Milwaukee, P.O. Box 784, Milwaukee, WI, 53201, United States
ABSTRACT: Among the models developed to form machine cells in group technology
applications, those based on the similarity coefficient method (SCM) are more
flexible in incorporating the manufacturing data into the machine cells formation
process. SCM is the application of clustering techniques to the machine cells
formation problem. When SCM is used to form the machine cells, some bottleneck
machines are not initially assigned to proper cells. These machines should be
reexamined and be reassigned to their proper cells in order to reduce the number of
intercellular moves. This problem is referred to as 'improper machine assignment'
and is the subject of discussion in this paper. © 1989 Taylor & Francis Group, LLC.
INDEX KEYWORDS: Production Engineering--Design; Productivity, Group Technology;
Machine Assignment; Similarity Coefficient Method, Industrial Plants
REFERENCES: Anderberg, M.R., (1973) Cluster Analysis for Applications, , New York:
Academic Press);
Burbidge, J.L., Production flow analysis on a computer (1973) Proceedings of the
Third Annual Conference of the Institution of Production Engineers;
Burbidge, J.L., (1975) The Introduction of Group Technology, , New York: John Wiley
& Sons);
King, J.R., Nakoranchai, V., Machine-component group formation in group technology:
117-133;
567-579;
Seifoddini, H., (1984) Cost Based Machine-Component Grouping Model in Group
Technology, , Unpublished Ph.D. dissertation, Oklahoma State University,
Stillwater, Oklahoma;
Seifoddini, H., Incorporation of production volume in machine cells formation in
group technology applications (1987) Proceedings of the Ixth International
Conference on Production Research, , Cincinnati, Ohio);
Seifoddini, H., Wolfe, M.P., Application of the similarity coefficient method in
group technology (1986) I.I.E. Transactions, pp. 271-277., September;
Seifoddini, H., Wolfe, M.P., Selection of a threshold value based on material
handling cost in machine-component grouping (1987) I.I.E. Transactions, pp. 266-
270., September;
Sneath, P.H., Sokal, R.R., (1973) Numerical Taxonomy, , San Francisco: W. H.
Freeman & Co.);
Vannelli, A., Ravikumar, K., A method of finding minimal bottleneck cells for
24, pp. 387-400
CORRESPONDENCE ADDRESS: Seifoddini, H.; Department of Industrial and Systems
Engineering, University of Wisconsin-Milwaukee, P.O. Box 784, Milwaukee, WI, 53201,
United States
ISSN: 00207543
SOURCE: Scopus
Rabbani, M., Keyhanian, S., Manavizadeh, N., Farrokhi-Asl, H.

57208701862;56118726800;37761692300;57115278000;
Integrated dynamic cell formation-production planning: A new mathematical model
(2017) Scientia Iranica, 24 (5), pp. 2550-2566. Cited 2 times.
85042507384&doi=10.24200%2fsci.2017.4387&partnerID=40&md5=194f987b8baa02681e3700584
277ed3c
DOI: 10.24200/sci.2017.4387
Department of Industrial Engineering and Management Systems, Amirkabir University
of Technology, Tehran, Iran;
Department of Industrial Engineering, Khatam University, Tehran, Iran;
Tehran, Iran
ABSTRACT: In this paper, a dynamic cell formation problem is presented considering
some new and special characteristics. The concept of machine requirement by lucky
parts, the parts which are allowed to be produced in a specific period, is combined
with the depreciable property of machines. Therefore, purchasing and selling of
machines according to their book-value and generating income have been taken into
account. This leads to a new vantage characteristic in cell formation where, in
each period, we deal only with the types and number of machines required. The new
mathematical model is presented and solved by exact and ant colony optimization
methods for three problem sizes. © 2017 Sharif University of Technology. All rights
reserved.
AUTHOR KEYWORDS: Ant colony optimization; Dynamic cell formation; Dynamic
production planning; Integrated mathematical model; Lot splitting
INDEX KEYWORDS: Ant colony optimization; Artificial intelligence; Cells; Cytology;
Planning; Production control, Ant colony optimization methods; Cell formation;
Dynamic cell formation; Dynamic production; Lot splitting; Machine requirements;
New mathematical model; Production Planning, Cellular manufacturing
reconfiguration (2009) Eur. J. Oper. Res., 192, pp. 414-428;
Aryanezhad, M.B., Deljoo, V., Mirzapour Ale-Hashem, S.M.J., Dynamic cell formation
and the worker assignment problem: A new model (2009) Int. J. Adv. Manuf. Technol.,
41, pp. 329-342;
approach to the cell formation problem (2005) Int. J. Adv. Manuf. Technol., 25, pp.
988-997;
approach (2009) Int J. Adv. Manuf. Technol., 33, pp. 1001-1009;
Jolai, F., Tavakkloi-Moghaddam, R., Golmohammadi, A., Javadi, B., An
Electromagnetism-like algorithm for cell formation and layout problem (2012) Expert
Syst. Appl., 39 (2), pp. 2172-2182;
Wei, N.C., Liao, T.J., Chao, I.M., Wu, P., Chang, Y.C., An electromagnetism-like
mechanism method for solving dynamic cell formation problems (2013) Journal of
Asian Scientific Research, 3 (10), pp. 1022-1035;
(4), pp. 2308-2316;
considering social criteria (2016) Applied Mathematical Modelling, 40 (4), pp.
2674-2691;
manufacturing systems (2009) Journal of Manufacturing Systems, 28, pp. 132-139;
demand changes (2007) Computers & Industrial Engineering, 53, pp. 478-490;
problems with consideration of multiple production factors (2010) Int. J. Adv.
Manuf. Technol., 46, pp. 1201-1213;
Pitombeira-Neto, A.R., Gonçalves-Filho, E.V., A simulation-based evolutionary
multiobjective approach to manufacturing cell formation (2010) Computers &
Javadian, N., Aghajani, A., Rezaeian, J., Sebdani, M.J.G., A multi-objective
reconfiguration (2011) International Journal of Advanced Manufacturing Technology,
56 (1-4), pp. 307-317;
conditions (2008) Fuzzy Sets and Systems, 159, pp. 215-236;
Int. J. Production Economics, 120, pp. 301-314;
formation problem using a scatter search approach (2009) Int. J. Adv. Manuf.
Technol., 44, pp. 318-329;
Saxena, L.K., Jain, P.K., Dynamic cellular manufacturing systems design: A
comprehensive model (2011) Int. J. Adv. Manuf. Technol., 53, pp. 11-34;
cellular manufacturing systems (2006) Int. J. Production Economics, 103, pp. 767-
783;
manufacturing system (2011) Applied Mathematical Modeling, 35 (4), pp. 1810-1819;
Dorigo, M., Colorni, A., Maniezzo, V., An investigation of some properties of an
ant algorithm (1992) PPSN, 92, pp. 509-520;
Megala, N., Rajendran, C., An improved ant-colony algorithm for the grouping of
machine-cells and part-families in cellular manufacturing systems (2013)
Hosseinabadi Farahani, M., Hosseini, L., An ant colony optimization approach for
the machine-part cell formation problem (2011) International Journal of
Computational Intelligence Systems, 4 (4), pp. 486-496;
Stützle, T., Dorigo, M., (1999) Ant Colony Algorithms for Quadratic Assignment
Problem: New Ideas in Optimization, , McGraw Hill, New York;
Dorigo, M., Stützle, T., (2004) Ant Colony Optimization, , MIT Press;
Maniezzo, V., Gambardella, L.M., De Luigi, F., (2004) Ant Colony Optimization: New
Optimization Techniques in Engineering, , Springer-Verlag
CORRESPONDENCE ADDRESS: Rabbani, M.; School of Industrial Engineering, College of
PUBLISHER: Sharif University of Technology
ISSN: 10263098
ABBREVIATED SOURCE TITLE: Sci. Iran.
SOURCE: Scopus
Zhou, B., Lu, Y.

7401906826;57194188243;
Integrated optimal method for cell formation and layout problems based on hybrid SA
algorithm with fuzzy simulation
(2017) High Technology Letters, 23 (1), pp. 1-6.
85019113544&doi=10.3772%2fj.issn.1006-
6748.2017.01.001&partnerID=40&md5=43f09cf122d0bf8e0fc0202b156abd31
DOI: 10.3772/j.issn.1006-6748.2017.01.001
AFFILIATIONS: School of Mechanical Engineering, Tongji University, Shanghai,
201804, China
ABSTRACT: To adapt to the complex and changeable market environment, the cell
formation problems (CFPs) and the cell layout problems (CLPs) with fuzzy demands
were optimized simultaneously. Firstly, CFPs and CLPs were described formally. To
deal with the uncertainty fuzzy parameters brought, a chance constraint was
introduced. A mathematical model was established with an objective function of
minimizing intra-cell and inter-cell material handling cost. As the chance
constraint of this problem could not be converted into its crisp equivalent, a
hybrid simulated annealing(HSA) based on fuzzy simulation was put forward. Finally,
simulation experiments were conducted under different confidence levels. Results
indicated that the proposed hybrid algorithm was feasible and effective. Copyright
© by HIGH TECHNOLOGY LETTERS PRESS.
AUTHOR KEYWORDS: Cell formation and cell layout problem; Chance constraint; Fuzzy
demand; Fuzzy simulation; Simulated annealing algorithm
INDEX KEYWORDS: Cellular manufacturing; Cytology; Functions; Materials handling;
Simulated annealing, Cell layout problem; Chance constraint; Fuzzy demand; Fuzzy
simulation; Simulated annealing algorithms, Cells
REFERENCES: Hearago, S.S., Group technology and cellular manufacturing (1994) IEEE
Transaction on Systems, Man and Cybernetic, 24 (2), pp. 203-215;
71-85;
Nouri, H., Tang, S.H., Hang, T.B.T., BASE: a bacteria foraging algorithm for cell
formation with sequence data (2010) Journal of Manufacturing Systems, 29 (2), pp.
102-110;
incidence matrices in multi-dimensional cellular manufacturing system (2012)
Won, Y., Currie, K., An effective P-median model considering production factors in
machine cell/part family formation (2006) Journal of Manufacturing Systems, 25 (1),
pp. 58-64;
and layout design using sequence data (2008) Robotics and Computer Integrated
Chan, F.T.S., Lau, K.W., Chan, P.L.Y., Two-stage approach for machine-part grouping
and cell layout problems (2006) Robotics and Computer Integrated Manufacturing, 22
(3), pp. 217-238;
Chan, F.T.S., Lau, K.W., Chan, L.Y., Cell formation problem with consideration of
both intracellular and intercellular movements (2008) International Journal of
Kia, R., Shirazi, H., Javadian, N., A multi-objective model for designing a group
layout of a dynamic cellular manufacturing system (2013) Journal of Industrial
Aghajani, A., Didehbani, S.A., Zadahmad, M., A multi-objective mathematical model
for cellular manufacturing systems design with probabilistic demand and machine
reliability analysis (2014) International Journal of Advance Manufacturing
technology, 75 (5-8), pp. 755-770;
Liu, B.D., Iwamura, K., Chance constrained programming with fuzzyparameters (1998)
Fuzzy Sets and Systems, 94 (2), pp. 227-237;
Zhou, J., Liu, B.D., Modeling capacitated location-allocation problemwith fuzzy
demands (2007) Computers and Industrial Engineering, 53 (3), pp. 454-468;
Nasab, H.H., A hybrid fuzzy-GA algorithm for the integrated machine allocation
problem with fuzzy demands (2014) Applied Soft Computing, 23 (5), pp. 417-431;
pp. 117-133;
Iwaruma, K., Liu, B.D., A genetic algorithm for chance constrained programming
(1996) Journal of Information & Optimization Sciences, 17 (2), pp. 409-422
CORRESPONDENCE ADDRESS: Zhou, B.; School of Mechanical Engineering, Tongji
UniversityChina; email: [email protected]
PUBLISHER: Inst. of Scientific and Technical Information of China
ISSN: 10066748
CODEN: HTLEF
ABBREVIATED SOURCE TITLE: High Technol Letters
SOURCE: Scopus
Xiaoqing, W., Jiafu, T., Jun, G., Mei, C.

23493881000;55804452600;24921592500;36913438800;
A nonlinear multi-objective model of dynamic cell formation
(2008) Chinese Control and Decision Conference, 2008, CCDC 2008, art. no. 4597460,
pp. 988-991.
52349104042&doi=10.1109%2fCCDC.2008.4597460&partnerID=40&md5=b7aff53c06d4cd7ade8e38
986cedeeda
DOI: 10.1109/CCDC.2008.4597460
AFFILIATIONS: Key Laboratory of Integrated Automation of Process Industry of MOE,
Northeastern University, Shenyang 110004, China
ABSTRACT: The real advantage of dynamic cellular manufacturing system is the
ability to operate under dynamic conditions required by today's production
characters of short product life cycle, high production variety, unpredictable
demand, and short delivery time, where the product mix and demand in each period is
different. This paper addresses dynamic cell formation problem, and presents three
major objectives for obtaining successful dynamic cell formation. Meanwhile, a
nonlinear multi-objective mathematical model of dynamic cell formation is proposed,
and the model comprises utilization rate of machines capacity, number of
exceptional parts and other practical problems. The proposed model is verified by
the commercial solver CPLEX software under a modest instance and computational
results are reported. ©2008 IEEE.
AUTHOR KEYWORDS: Cellular manufacturing; Dynamic cell formation; Machine
capacity; Nonlinear multi-objective model
INDEX KEYWORDS: Cells; Cytology; Life cycle; Manufacture; Mathematical models;
Multiobjective optimization, Cellular Manufacturing System; Computational results;
Delivery-time; Dynamic cell formation; Dynamic conditions; Machine capacity; Multi
objectives; Nonlinear multi-objective model; Paper addresses; Practical problems;
Product mixes; Short product, Cellular manufacturing
REFERENCES: Burbidge, J.L., Production flow analysis [J] (1971) Production
Engineer, 50, pp. 139-152;
Implementation experiences and performance improvements [J] (1997) International
Ronald, G., Askin, Hassan M, Selim. A methodology for designing flexible cellular
manufacturing systems [J] (1997) IIE Transactions, 29, pp. 599-610;
Hammer, M., (1996) Beyond Reengineenng [M], p. 212., New York, HarperCollins;
cellular manufacturing environment [J] (1998) Annals of Operations Research, 77,
pp. 109-128;
uncertain production requirement with presence of routing flexibility [D], ,
Blacksburg State University Virginia, USA;
Balakrishnan, J., Chun, H., Dynamic cellular manufacturing under multiperiod
planning horizons [J] (2004) Journal of Manufacturing Technology Management, 16
(5), pp. 516-530;
Ddfersha, F.M., Chen, M., Machine cell formation using a mathematical model and a
Research, 44 (12), pp. 2421-2444;
DIMOPOULOS, C., Multi-objective optimization of manufacturing cell design [J]
Sofianopoulou, Manufacturing cells design with alternative process plans and/or
replicate machines [J] (1999) International Journal of Production Research, 37 (3),
pp. 707-720;
[J] (1996) International Journal of Production Research, 34 (5), pp. 1361-1380;
Molina, J., Laguna, M., Marti, R., Caballero, R., A Scatter Tabu Search Procedure
for Non-Linear Multiobjective Optimization [J] (2007) Informs Journal on Computing,
19 (1), pp. 91-100
CORRESPONDENCE ADDRESS: Xiaoqing, W.; Key Laboratory of Integrated Automation of
Process Industry of MOE, Northeastern University, Shenyang 110004, China; email:
[email protected]
ISBN: 9781424417346
ABBREVIATED SOURCE TITLE: Chinese Contr. Decis. Conf., CCDC
SOURCE: Scopus
Oliveira, S., Ribeiro, J.F.F., Seok, S.C.
7102961290;7201677805;8885215900;
A comparative study of similarity measures for manufacturing cell formation
57149131381&doi=10.1016%2fj.jmsy.2008.07.002&partnerID=40&md5=8d3b7bb590e1abd418b66
20040741c85
DOI: 10.1016/j.jmsy.2008.07.002
AFFILIATIONS: Computer Science Department, University of Iowa, Iowa City, IA,
United States;
FEARP, Universidade de São Paulo, Ribeirão Preto, Brazil
ABSTRACT: We introduced a spectral clustering algorithm based on the bipartite
graph model for the Manufacturing Cell Formation problem in [Oliveira S, Ribeiro
JFF, Seok SC. A spectral clustering algorithm for manufacturing cell formation.
Computers and Industrial Engineering. 2007 [submitted for publication]]. It
constructs two similarity matrices; one for parts and one for machines. The
algorithm executes a spectral clustering algorithm on each separately to find
families of parts and cells of machines. The similarity measure in the approach
utilized limited information between parts and between machines. This paper reviews
several well-known similarity measures which have been used for Group Technology.
Computational clustering results are compared by various performance measures. ©
2008 The Society of Manufacturing Engineers.
INDEX KEYWORDS: Cellular manufacturing; Flexible manufacturing systems; Flow of
solids; Graph theory; Group technology, Bipartite graphs; Comparative studies;
Limited informations; Manufacturing cell formations; Performance measures;
Similarity measures, Clustering algorithms
REFERENCES: Burbidge, J.L., (1975) The introduction of group technology, , John
Wiley;
Kusiak, A., Chow, W.S., Decomposition of manufaturing systems (1988) IEEE Journal
Selim, H.M., Abdel Aal, R.M.S., Formation of machine groups and part families: A
modified slc method and comparative study (2003) Integrated Manufacturing Systems,
14 (2), pp. 123-137;
Oliveira S, Ribeiro JFF, Seok SC. A spectral clustering algorithm for manufacturing
cell formation. Computers and Industrial Engineering. 2007 [submitted for
publication]; Boulif, M., Atif, K., A new branch-&-bound-enhanced genetic algorithm
for the manufacturing cell formation (2006) Computers & Operations Research, 33
(8), pp. 2219-2245;
51, p. 53;
Romesburg, C., (1984) Cluster analysis for researchers, , Lifetime Learning
Publications (Wadsworth, Inc), Belmont, CA;
Baroni-Urban, C., Buser, M.W., Similarity of binary data (1976) Zoology, 25, pp.
251-259;
Sneath, P.H., Sokal, R.R., (1973) Numerical taxonomy, , Freeman, San francisco, CA;
Seidoddini H, Djassemi M. The production data-based similarity coefficient versus

jaccard's similarity coefficient. volume 21, 1991. p. 263-6. 13th Annual conference
on computers and industrial engineering, 1991; Askin, R.G., Selim, H.M., Vakharia,
A.J., A methodology for designing flexible cellular manufacturing systems (1997)
IIE Transactions, 29;
Ding, C., He, X., Meraz, R., Holbrook, S., A unified representation for multi-
protein complex data for modeling protein interaction networks (2004) Proteins:
Structure, Function, and Bioinformatics, 57, pp. 99-108;
Ding C, He X, Zha H, Gu M, Simon H. A min-max cut algorithm for graph partitioning
data clustering. In: ICDM 2001, Proceedings IEEE international conference on data
mining, 2001. p. 107-4. IEEE, 2001; Rajagopalan, R., Batra, J., Design of cellular
production systems - a graph theoretic approach (1975) International Journal of
Kusiak, A., Chow, M., Similarity coefficient algorithm for solving the group
pp. 2233-2246;
Waghodekar, P.H., Sahu, S., Machine component cell formation in group technology
Mosier, C.T., Taube, L., Weighted similarity coefficient based methods as applied
to the group technology configuration problem (1985) International Journal of
Seifoddini, H., Wolfe, P.M., Application of similarity coefficient method in group
technology (1986) IIE transaction, 18 (2), pp. 271-277;
group technology (1989) 1989, 27 (12), pp. 2053-2062., International Journal of
Production Research;
(1989) IIE Transaction, 21, pp. 382-388;
Moiser, C.T., An experiment investigating the application of clustering procedures
and similarity coefficients to the group technology cell formation problem (1989)
Islam, K.M., Sarker, B.P., A similarity coefficient measure and machine-parts
Oliveira S, Seok SC. A multilevel approach for identifying functional modules in
protein-protein interaction networks. In: Proceedings of IWBRA 2006. Lecture notes
in computer science, vol. 3992, p. 726-73. 2006; Sarker, B.P., The resemblance
coefficients in group technology: A survey and comparative study of relational
metrics (1996) International Journal of Computers and Industrial Engineering;
Sarker, B.P., Islam, K.M., Relative performance of similarity and dissimilarity
measures (1999) International Journal of Computers and Industrial Engineering, 37,
pp. 769-807;
Research, 24, pp. 451-464;
243;
for solving the cell formulation problem in group technology (1991) Journal of
formation for gt applications (1990) International Journal of Production Research,
28 (1), pp. 185-198;
Jayakrishnan Nair, G., Narendran, T.T., A clustering algorithm for cell formation
157-179;
(1), pp. 84-97;
simulated annealing (1998) International Journal of Production Research, 36 (8);
Research, 28 (12), pp. 2243-2257
CORRESPONDENCE ADDRESS: Oliveira, S.; Computer Science Department, University of
Iowa, Iowa City, IA, United States; email: [email protected]
ISSN: 02786125
CODEN: JMSYE
SOURCE: Scopus
Eski, O., Ozkarahan, I.

14037503300;6601996431;
Design of manufacturing cells for uncertain production requirements with presence
of routing flexibility
681. Cited 7 times.
38049093904&partnerID=40&md5=09ee2198a641ea7b3a622b1f34345f4b
AFFILIATIONS: Dokuz Eylul University, Faculty of Engineering, Industrial

Engineering Dept., 35100 Bornova-Izmir, Turkey
ABSTRACT: Cellular manufacturing has been seen as an effective strategy to the
changing worldwide competition. Most of the existing cell design methods ignore the
existence of stochastic production requirements and routing flexibility. In this
study, a simulation based Fuzzy Goal Programming model is proposed for solving cell
formation problems considering stochastic production requirements and routing
flexibility. The model covers the objectives of minimizing inter-cell movements,
maximizing system utilization, minimizing mean tardiness and minimizing the
percentage of tardy jobs. The simple additive method and max-min method are used to
handle fuzzy goals. A tabu search based solution methodology is used for solution
of the proposed models and the results are presented. © Springer-Verlag Berlin
Heidelberg 2007.
AUTHOR KEYWORDS: Cellular manufacturing; Fuzzy goal programming; Routing
flexibility; Simulation; Tabu search
INDEX KEYWORDS: Competition; Computational methods; Computer programming; Computer
simulation; Product design; Stochastic models; Tabu search, Fuzzy goal programming;
Routing flexibility, Cellular manufacturing
REFERENCES: Baykasoglu, A., Solution of Goal Programming Models Using a Basic Taboo
Search Algorithm (1999) Journal of the Operational Research Society, 50, pp. 960-
973;
Baykasoglu, A., Gokcen, T., A Tabu Search Approach to Fuzzy Goal Programs and an
Application to Aggregate Production Planning (2006) Engineering Optimization, 31,
pp. 155-177;
Bellman, R.E., Zadeh, L.A., Decision-making in a Fuzzy Environment (1970)
Chen, L.H., Tsai, F.C., Fuzzy Goal Programming with Different Importance Priorities
(2001) European Jour. Of. Operational Res, 133, pp. 548-556;
Fang, H.C., Teng, C.J., Li, S.Y., A Fuzzy Goal Programming Approach to
Multiobjective Optimization Problem with Priorities (2007) European Jour. Of.
Operational Res, 176, pp. 1319-1333;
Gen, M., Ida, K., Tsujimura, Y., Kim, C. E.: Large Scale 0-1 Fuzzy Goal Programming
and Its Application to Reliability Optimization Problem. Computers Ind.
Engineering, 24 (1993) 539-549; Glover, F., Tabu Search-Part 1.ORSA (1989) Journal
on Computing, 1, pp. 190-206;
Glover, F., Tabu Search-Part 2.ORSA (1990) Journal on Computing, 2, pp. 4-32;
Saad, S.M., Baykasoglu, A., Gindy, G., An Integrated Framework for Reconfiguration
of Cellular Manufacturing Systems Using Virtual Cells (2002) Production
Planning&Control, 13, pp. 381-393;
Sabuncuoglu, I., Hommertzheim, D.L., Dynamic Dispatching Algorithm for Scheduling
Machines and Automated Guided Vehicles in a Flexible Manufacturing System (1989)
Selim, H., Askin, R. G., Vakharia, A.J.: Cell Formation in Group Technology:
Review, Evaluation and Directions for Future Research. Computers and Ind. Eng., .34
(1998) 3-20; Shanker, R., Vrat, P., Some Design Issues in Cellular Manufacturing
Using the Fuzzy Programming Approach (1997) Int. Journal of Prod. Research, 37, pp.
2545-2563;
Tiwari, R.N., Dharmar, S., Rao, J.R., A Fuzzy Goal Programming-an Additive Model
(1987) Fuzzy Sets and Systems, 24, pp. 27-34
CORRESPONDENCE ADDRESS: Eski, O.; Dokuz Eylul University, Faculty of Engineering,
Industrial Engineering Dept., 35100 Bornova-Izmir, Turkey; email:
[email protected]
ISSN: 03029743
ISBN: 9783540742012
SOURCE: Scopus
Andrés, C., Lozano, S.

23032961700;7004141022;
A particle swarm optimization algorithm for part-machine grouping
(2006) Robotics and Computer-Integrated Manufacturing, 22 (5-6), pp. 468-474. Cited
59 times.
33746787686&doi=10.1016%2fj.rcim.2005.11.013&partnerID=40&md5=25a8ed15fce2d4f0fb577
8001c28b531
DOI: 10.1016/j.rcim.2005.11.013
AFFILIATIONS: CIGIP Research Center, Industrial Management Department, Polytechnic
University of Valencia, building 7D, 3rd floor, Valencia, 46022, Spain;
Industrial Management Department, University of Sevilla, Sevilla, 41092, Spain
ABSTRACT: Although in the last years different metaheuristic methods have been used
to solve the cell formation problem in group technology, this paper presents the
first particle swarm optimization (PSO) algorithm designed to address this problem.
PSO is a population-based evolutionary computation technique based on a social
behavior metaphor. The criterion used to group the machines in cells is based on
the minimization of inter-cell movements. A maximum cell size is imposed. Some
published exact results have been used as benchmarks to assess the proposed
algorithm. The computational results show that the PSO algorithm is able to find
the optimal solutions on almost all instances. © 2006 Elsevier Ltd. All rights
reserved.
AUTHOR KEYWORDS: Cellular manufacturing; Part-machine grouping problem; Particle
swarm optimization
INDEX KEYWORDS: Benchmarking; Cellular manufacturing; Computational methods;
Optimization; Problem solving, Part-machine grouping problem; Particle swarm
optimization (PSO); Swarm optimization algorithm, Algorithms
REFERENCES: Ballakur, A., Steudel, H.J., A within cell utilization based heuristic
for designing cellular manufacturing systems (1987) Int J Prod Res, 25, pp. 639-
655;
Burbidge, J.L., Production flow analysis (1963) Prod Eng, 42, pp. 742-752;
branch- and bound and A* approaches (1993) IIE Trans, 25 (4), pp. 46-56;
manufacturing systems (1996) IIE Trans, 28, pp. 333-345;
McAuley, J., Machine grouping for efficient production (1972) Prod Eng, 51 (2), pp.
53-57;
models (1994) Int J Prod Res, 32 (9), pp. 2105-2116;
(1991) Int J Prod Res, 29 (2), pp. 343-356;
cells in group technology (1994) Eur J Oper Res, 75, pp. 100-111;
Kazerooni, M., Luong, L., Abhary, K., Cell formation using genetic algorithms
(1995) Int J Flexible Autom Integr Manuf, 3, pp. 283-299;
problem (1997) Comput Ind Eng, 32, pp. 169-185;
problems (2002) Int J Prod Res, 40 (9), pp. 2141-2158;
Eberhard, R.C., Kennedy, J., Shi, Y., (2001) Swarm intelligence, , Morgan Kaufmann,
San Mateo, CA;
Salman, A., Ahmad, I., Al-Madani, S., Particle swarm optimization for task
assignment problem (2003) Microprocess Microsyst, 26, pp. 363-371;
evolution: third European conference: selected papers. Lecture notes in computer
science, 1363, pp. 3-54., Hao J.K., Lutton E., Ronald E., Schoenauer M., and Snyers
D. (Eds), Springer, Berlin
CORRESPONDENCE ADDRESS: Andrés, C.; CIGIP Research Center, Industrial Management
Department, Polytechnic University of Valencia, building 7D, 3rd floor, Valencia,
46022, Spain; email: [email protected]
ISSN: 07365845
CODEN: RCIME
ABBREVIATED SOURCE TITLE: Rob Comput Integr Manuf
SOURCE: Scopus
Chen, M.-C., Wu, H.-P., Lin, C.-P.

7407447746;7405584867;8288397200;
A data mining based clustering approach to group technology
(2003) Proceedings - IEEE International Conference on Robotics and Automation, 3,
pp. 3554-3558. Cited 1 time.
0345327738&partnerID=40&md5=a8349a3269666e870a9c5342015b754f
AFFILIATIONS: Inst. of Commerce Automat. and Mgmt., National Taipei Univ. of

Technology, Taipei, Taiwan;
Information System Department, Chinese Petroleum Corporation, Taipei, Taiwan
ABSTRACT: Cellular manufacturing is an essential application of group technology
(GT) in which families of parts are produced in manufacturing cells. This paper
describes the development of a cell formation approach based on association rule
mining and 0-1 integer programming. It is valuable to find the important
associations among machines such that the occurrence of some machines in a machine
cell will cause the occurrence of other machines in the same cell. A clustering
model using the discovered association data is formulated to maximize the closeness
measures among machines within each cell. From the results of three medium-sized
problems, the proposed approach shows its ability to find quality solutions of cell
formation problems.
AUTHOR KEYWORDS: 0-1 integer programming; Association rule; Cellular
manufacturing
INDEX KEYWORDS: Algorithms; Data flow analysis; Data mining; Group technology;
Integer programming; Mathematical models; Matrix algebra, Association rule;
Clustering model; Production flow analysis; Rule mining, Cellular manufacturing
REFERENCES: Agrawal, R., Imielinski, T., Swami, A., Mining association rules
between sets of items in large databases Proceedings of 1993 ACM-SIGMOD
International Conference on Management of Data, 1993, pp. 207-216;
Brandon, J.A., (1996) Cellular Manufacturing: Integrating Technology and
Management, , Wiley, NY;
Burbidge, J.L., (1989) Production Flow Analysis, , Oxford, Clarendon;
Chen, M.-S., Han, J., Yu, P.S., Data mining and: An overview from a database
perspective (1996) IEEE Transactions on Knowledge and Data Engineering, 8 (6), pp.
866-883;
Research, 36, pp. 1325-1337;
Chu, C.H., Clustering analysis in manufacturing cell formation (1989) Omega:
Hyer, N.L., Wemmerlov, U., Group technology oriented coding systems: Structures,
application and implementation (1985) Production and Inventory Management, 26 (1),
pp. 125-147;
pp. 117-133;
Liu, C.-M., Clustering techniques for stock location and order-picking in a
distribution center (1999) Computers and Operations Research, 26, pp. 989-1002;
38 (5), pp. 1201-1218;
implementation-a state-of-the-art survey (1985) Omega: International Journal of
Mulvey, J.M., Crowder, H.P., Cluster analysis: An application of Lagrangian
relaxation (1979) Management Science, 25, pp. 329-340;
Ng, S.M., Worse-case analysis of an algorithm for cellular manufacturing (1993)
Seifoddini, H.K., Djassemi, M., Determination of a flexibility range for quality
index for formation of cellular manufacturing systems under product mixed
variations (1997) International Journal of Production Research, 35, pp. 3349-3366;
Srinivasan, G., Narendran, T.T., Grafics-a non-hierarchical clustering algorithm
pp. 463-478;
state-of-the-art-review (1999) International Journal of Production Research, 37
(14), pp. 3335-3357
CORRESPONDENCE ADDRESS: Chen, M.-C.; Inst. of Commerce Automat. and Mgmt., National
Taipei Univ. of Technology, Taipei, Taiwan
ISSN: 10504729
CODEN: PIIAE
ABBREVIATED SOURCE TITLE: Proc IEEE Int Conf Rob Autom
SOURCE: Scopus
Akturk, M.S., Turkcan, A.

57208893391;6505894929;
Cellular manufacturing system design using a holonistic approach
56 times.
0034631277&doi=10.1080%2f00207540050028124&partnerID=40&md5=0a6f70534204182544b0244
02358481e
DOI: 10.1080/00207540050028124
AFFILIATIONS: Department of Industrial Engineering, Bilkent University, 06533
Bilkent, Ankara, Turkey
ABSTRACT: We propose an integrated algorithm that will solve the part-family and
machine-cell formation problem by simultaneously considering the within-cell layout
problem. To the best of our knowledge, this is the first study that considers the
efficiency of both individual cells and the overall system in monetary terms. Each
cell should make at least a certain amount of profit to attain self-sufficiency,
while we maximize the total profit of the system using a holonistic approach. The
proposed algorithm provides two alternative solutions; one with independent cells
and the other one with inter-cell movement. Our computational experiments indicate
that the results are very encouraging for a set of randomly generated problems.
INDEX KEYWORDS: Algorithms; Costs; Group technology; Random processes; Systems
analysis, Holonistic approach, Cellular manufacturing
1361-1380;
Akturk, M.S., Balkose, H.O., Part machine grouping using a multi-objective cluster
Askin, R., Zhou, M., Formation of independent flow-line cells based on operation
Bazargan-Lari, M., Kaebernick, H., Intracell and intercell layout designs for
cellular manufacturing (1996) International Journal of Industrial Engineering, 3,
pp. 139-150;
Beaulieu, A., Gharbi, A., Ait-Kadi, D., An algorithm for cell formation and machine
selection problems in the design of a cellular manufacturing system (1997)
Dahel, N.E., Design of cellular manufacturing system in tandem configuration (1995)
Höpf, M., Holonic manufacturing systems (1994) CIM-Europe Annual Conference, pp.
84-93., Copenhagen;
85;
Vakharia, A.J., Chang, Y.-L., Cell formation in group technology: A combinatorial
2043;
pp. 84-97;
Verma, P., Ding, F.-Y., A Sequence-based materials flow procedure for designing
3267-3281
CORRESPONDENCE ADDRESS: Akturk, M.S.; Department of Industrial Engineering, Bilkent
University, 06533 Bilkent, Ankara, Turkey
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Onwubolu, G.C., Songore, V.

7003469218;6507822382;
Cellular manufacturing systems design using Tabu search
Engineering Manufacture, 214 (2), pp. 169-172. Cited 3 times.
0033893036&partnerID=40&md5=fa4d27929864029c209ede3506cdb3cc
AFFILIATIONS: Industrial Engineering Department, National University of Science and

Technology, Bulawayo, Zimbabwe;
Olivine Industries, Harare, Zimbabwe;
Industrial Engineering Department, National University of Science and Technology,
PO Box A C939, Ascot, Bulawayo, Zimbabwe
ABSTRACT: Several techniques have appeared in the literature for the cell formation
problem. However, most of these heuristics have the disadvantages that they cannot
solve real-life problems typical of manufacturing firms in reasonable computational
time, and deal with the part family formation and cell grouping problems
separately. The Tabu search meta-heuristic is presented for resolving these
problems. The minimization of intercellular movements as an objective function is
demonstrated, although minimization of cell load variation and the multiobjective
function option exist in the procedure developed. The results discussed for some
problems taken from the literature show that the Tabu search is a promising
technique for solving the cellular manufacturing systems design problem for both
medium and large problem instances.
INDEX KEYWORDS: Functions; Heuristic methods; Optimization, Tabu search, Cellular
manufacturing
REFERENCES: Burbridge, J., L. Production Flow Analysis for Planning Group
Technology, , 1989 (Oxford Science Publications);
Wemmerlov, U., And Hyer, N. L. Cellular Manufacturing in the US Industry: a Survey
of Users. Int. J. Prod. Res., 1989, 27, , 1511-1530;
Carrie, A., S. Numerical Taxonomy Applied to Group Technology and Plant Layout.
Int. J. Prod. Res., 1973, 11, , 399-415;
Onwubolu, G., C. Redesigning Jobshop to Cellular Manufacturing Systems. Int. J.
Integrated Mfg Systems, 1998, 9(6), , 377-382;
Kusiak, A., The Generalised Group Technology Concept. Int. J. Prod. Res., 1987,
25(4), , 561-569;
Vannelli, A., And Kumar, K. R. a Method for Finding Minimal Bottleneck Cells for
Grouping Part-machine Families. Int. J. Prod. Res., 1986, 24(2), , 387-400;
Rajamani, S., N. and Aneja, Y. P. Integrated Design of Cellular Manufacturing
Systems in the Presence of Alternative Process Plans. Int. J. Prod. Res., 1990, 28,
, 15411554;
Singh, N., And Rajamani, D. Cellular Manufacturing Systems: Design, Planning and
Control, , 1996 (Chapman and Hall, London);
Venugopal, V., And Narendran, T. T. a Genetic Algorithm Approach to the Machine
Grouping Problem with Multiple Objectives. Computers in Ind. Engng, 22(4), , 469-
480;
Glover, F., Tabu Search-Part I. ORSA J. on Computing, 1989, 1, , 1990-2006;
Glover, F., Tabu Search-Part II. ORSA J. on Computing, 1990, 2, , 4-32;
Glover, F., And Laguna, M. Tabu Search in Modern Heuristic Techniques for
Combinatorial Problems (Ed. C. Reeves), 1993, Pp., , 70-141 (Blackwell Scientific
Publications, Oxford);
De Werra, D., And Hertz, A. Tabu Search Techniques: a Tutorial and an Application
to Neural Networks. or Spectrum, 1989, 11, , 131-141;
Cban, H., M. and Milner, D. A. Direct Clustering Algorithms for Grouping Formation
in Cellular Manufacturing. J. Mfg Systems, 1982, 1(1), , 65-74;
De Witte, J., The use of similarity coefficients in production flow analysis Int.
J. Prod. Res., 1980, 18(4), , 503-514;
Chandrasekharan, M., P. and Rajagopalan, R. MODROC: an Extension of Rank order
Clustering for Group Technology. Int. J. Prod. Res., 1986, 24(5), , 1221-1233;
Chandrasekharan, M., P. and Rajagopalan, R. an Ideal Seed Non-hierarchical
Clustering Algorithm for Cellular Manufacturing. Int. J. Prod. Res., 19??, 24(2), ,
451-464;
King, J., R. Machine Component Grouping in Production Flow Analysis: an Approach
Using Rank order Clustering. Int. J. Prod. Res., 1980, 18, , 213-232;
Balakrishnan, J., And Jog, P. D. Manufacturing Cell Formation Using Similarity
Coefficients and a Parallel Genetic TSP Algorithms Formulation and Comparison.
Math. Computer Modelling, 1995, 21(12), , 61-73;
Miltenburg, J., And Zhang, W. a Comparative Evaluation of Nine Well-known
Algorithms for Solving the Cell Formation Problem in Group Technology. J. of
Operations Manage., 1991, 10(1), , 44-69;
Askin, R., G., Cresswell, J. H., Goldberg, J. B. and Vakharia, A. J. a Hammiltonian
Path Approach to Reordering the Part-machine Matrix for Cellular Manufacturing.
Int. J. Prod. Res., 1991, 29(6), , 1081-1100;
Wei, J., C. and Gaither, N. an Optimal Model for Cell Formation Decisions. Decision
Sci., 1990, 21(2), , 416-433
CORRESPONDENCE ADDRESS: Onwubolu, G.C.; Natl Univ of Science and Technology,
Bulawayo, Zimbabwe
PUBLISHER: Prof Eng Publ Ltd, London, United Kingdom
ISSN: 09544054
CODEN: PIBME
SOURCE: Scopus
Chi, Sheng-Chai, Liu, Shih-Yaug

7202334831;7409458618;
Flexible neural network approach for machine cell formation
(1995) Proceedings of the IEEE International Conference on Systems, Man and
Cybernetics, 3, pp. 2064-2069.
0029509260&partnerID=40&md5=244809161d59083bbe1dfe6d4921a5e0
AFFILIATIONS: Kaohsiung Polytechnic Inst, Kaohsiung, Taiwan

ABSTRACT: The aim of this paper is to develop an artificial neural network approach
for solving the generalized machine cell formation problem. The capability of
spontaneous generation of the schema constraint satisfaction model is applied in
our approach to find a near-optimal solution for the problem. A similarity
coefficient method is used to compute the relationship between machines and between
parts for the construction of the neural network. By modifying the relationship
between machines, the factor of sequence of operations can be involved. By
modifying the relationship between parts, the factor of multiple process plans can
be involved. The result shows our approach is flexible and efficient to satisfy
various requirements in machine cell formation.
INDEX KEYWORDS: Artificial intelligence; Codes (symbols); Computer simulation;
Machine components; Machine tools; Manufacture; Mathematical programming, Machine
cell formation; Production flow analysis; Similarity coefficient method, Neural
networks
CORRESPONDENCE ADDRESS: Chi, Sheng-Chai; Kaohsiung Polytechnic Inst, Kaohsiung,
Taiwan
EDITORS: Anon
ISSN: 08843627
CODEN: PICYE
ABBREVIATED SOURCE TITLE: Proc IEEE Int Conf Syst Man Cybern
SOURCE: Scopus
Hamedi, M., Esmaeilian, G., Bt Ismail, N.

25654954800;25654930500;55606485600;
Developing capability -based virtual Cellular Manufacturing Systems and comparison
with capability -based classical Cellular Manufacturing Systems
(2012) Applied Mechanics and Materials, 110-116, pp. 3938-3946. Cited 3 times.
116.3938&partnerID=40&md5=e036daee2e9be2518b3042ac7ec21fa4
AFFILIATIONS: Department of Mechanical and Manufacturing Engineering, Faculty of
Engineering, University Putra Malaysia, 43400, Serdang, Selangor, Malaysia
ABSTRACT: This paper is an attempt to develop capability-based Virtual Cellular
Manufacturing (VCM) systems and comparing the performance of such systems with
classical Cellular Manufacturing Systems (CMS) in the point of travelling distances
by parts. In this paper, VCM systems are formed through solving a multi-objective
mathematical model with the goal programming approach focused on the part-machine
virtual cell formation problem, which groups parts and machines simultaneously to
generate virtual cells. These cells are designed by considering machines
capabilities with the aid of Resource Element (RE) approach to define processing
requirements of parts and processing capabilities of machines and to take into
account the overlapping capabilities among machines and optional machines to
process parts. © (2012) Trans Tech Publications, Switzerland.
AUTHOR KEYWORDS: Capability based; Classical Cellular Manufacturing System (CMS);
Resource Element; Virtual Cellular Manufacturing (VCM)
INDEX KEYWORDS: Capability based; Classical Cellular Manufacturing System (CMS);
Goal programming; Multi objective; Overlapping capabilities; Processing capability;
Resource element; Virtual cells; Virtual cellular manufacturing; Virtual cellular
manufacturing system, Aerospace engineering; Cells; Mathematical models;
Mathematical programming, Cellular manufacturing
REFERENCES: Lahmar, M., Benjaafar, S., Design of distributed layouts (2005) IIE
Benajaafar, S., Design of flexible layouts for manufacturing systems (1995)
Engineering Management Conference, 95., IEEE;
Benjaafar, S., Heragu, S.S., Irani, S.A., Next generation factory layouts: Research
challenges and recent progress (2002) Interfaces, 32 (6), pp. 58-76;
Tompkins, J.A., White, J.A., (1984) Facilities Planning, , New York: Wiley;
Drolet, J., Marcoux, Y., Abdulnour, G., Simulation-based performance comparison
between dynamic cells, classical cells and job shops: A case study (2008)
in cellular manufacturing (2008) Journal of Intelligent Manufacturing, 19, pp. 71-
85;
Erhankesena, S., Analyzing the behaviors of virtual cells (VCs) and traditional
manufacturing systems: Ant colony optimization (ACO) based metamodels (2009)
Computers &operationsResearch, 36, pp. 2275-2285;
Proceedings of Fourth IFAC/IFIP Conference on Information Control Problems in
Manufacturing Technology, pp. 207-215., Gaithersburg;
pp. 516-530;
Fung, R.Y.K., A multi-stage methodology for virtual cell formation oriented agile
manufacturing (2008) International Journal of Advance Manufacturing Technology, 36,
pp. 798-810;
Babu, A.S., K, N.N., Thomas, A., Development of virtual cellular manufacturing
systems for SMEs (2000) Logistics Information Management, 13 (4), pp. 228-242;
past research and identification of future research issues (2006) Int J Flex Manuf
Syst, 17, pp. 71-92;
pp. 2597-2618;
CORRESPONDENCE ADDRESS: Hamedi, M.; Department of Mechanical and Manufacturing
Engineering, Faculty of Engineering, University Putra Malaysia, 43400, Serdang,
Selangor, Malaysia; email: [email protected]
ISSN: 16609336
ISBN: 9783037852620
SOURCE: Scopus
Lei, D., Wu, Z.

8555138900;55196417200;
Tabu search approach based on a similarity coefficient for cell formation in
generalized group technology
32 times.
27844495552&doi=10.1080%2f00207540500151283&partnerID=40&md5=a410fed6236f1f4611f568
3e2e434eef
DOI: 10.1080/00207540500151283
AFFILIATIONS: Institute of Automation, Shanghai University, 1954 Huashan Road,
Shanghai 200030, China
ABSTRACT: Both a similarity coefficient method (SCM)-based algorithm and meta-
heuristics have been widely applied to various cell formation problems; however,
few studies have explored the combination of the two methods. This paper addresses
a hybrid algorithm, in which, based on the initial solution produced by a new SCM-
based hierarchical clustering method, a fast and effective tabu search approach is
presented to solve cell formation in group technology (GT). The proposed algorithm
is applied to several problems from literature and a group of the randomly
generated instances with alternative process plans and compared with simulated
annealing (SA) and other TS; the results demonstrate that the proposed algorithm is
available and efficient for cell formation in generalized GT. © 2005 Taylor &
Francis Group Ltd.
AUTHOR KEYWORDS: Cell formation; Group technology; Similarity coefficient; Tabu
search
INDEX KEYWORDS: Algorithms; Simulated annealing, Cell formation; Similarity
coefficient method (SCM); Tabu search, Group technology
formation in generalized group technology (2001) Comput. Ind. Eng., 41, pp. 227-
240;
Balakrishnan, J., Manufacturing cell formation using similarity coefficient and
pair-wise interchange: Formulation and comparison (1996) Prod. Plan. Control, 7,
pp. 11-21;
Brown, E.C., Sumichrast, R.T., CF-GA: A grouping genetic algorithm for the cell
Caux, C., Bruniaux, H., Pierreval, H., Cell formation with alternative process
plans and machine capacity constraints: A combined approach (2000) Int. J. Prod.
Econ., 64, pp. 279-284;
Res., 39, pp. 1-19;
Glover, F., Future paths for integer programming and link with artificial
intelligence (1986) Comput. Oper. Res., 13, pp. 533-549;
Gupta, T., Seifoddini, H., Production data-based similarity coefficient for
system (1990) Int. J. Prod. Res., 28, pp. 1247-1269;
alternative part process plans (1996) Comput. Ind. Eng., 30, pp. 423-431;
Vaud. Sci. Nat., 44, pp. 223-270;
pp. 561-569;
Manuf. Syst., 6, pp. 117-124;
McAuley, J., Machine grouping for efficient production (1972) Prod. Eng., 51, pp.
53-57;
Moon, Y.B., Chi, S.C., Generalized part family formation using neural technology
(1992) J. Manuf. Syst., 11, pp. 149-159;
considerations in group technology applications (1990) Int. J. Prod. Res., 28, pp.
2243-2257;
Onwubolu, G.C., Songore, V., A tabu search approach for cellular manufacturing
systems (2000) Prod. Plan. Control, 11, pp. 153-164;
Seifoddini, H., Single linkage v/s average linkage clustering in machine cell
formation applications (1989) Comput. Ind. Eng., 16, pp. 419-426;
Seifoddini, H., Wolfe, P.M., Application of similarity coefficient method in group
technology (1986) IIE Trans., 18, pp. 271-277;
manufacturing. Part II. An extension and comparison (1993) Int. J. Prod. Res., 31,
pp. 1315-1326;
2158;
Srinivasan, G., Narendran, T.T., GRAFICS - A non-hierarchial clustering algorithm
Sun, D., Lin, L., Batta, R., Cell formation using tabu search (1995) Comput. Ind.
Eng., 28, pp. 485-494;
Won, Y., Kim, S., Multiple criterion clustering algorithm for solving the group
technology problem with multiple process routings (1997) Comput. Ind. Eng., 32, pp.
207-220;

algorithm and tabu search for solving binary and comprehensive machine-grouping
problem (2002) Int. J. Prod. Res., 40, pp. 2141-2158
CORRESPONDENCE ADDRESS: Lei, D.; Institute of Automation, Shanghai University, 1954
Huashan Road, Shanghai 200030, China; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Kandiller, L.
6506822666;
A cell formation algorithm: Hypergraph approximation - Cut tree
times.
2217%2897%2900143-4&partnerID=40&md5=6778aff501a82e44e180345ba0dac343
DOI: 10.1016/S0377-2217(97)00143-4
AFFILIATIONS: Middle East Technical University, Department of Industrial
Engineering, 06531 Ankara, Turkey;
Rutgers Ctr. for Operations Research, Rutgers University, New Brunswick, NJ 08903-
5062, United States
ABSTRACT: A new cell formation technique is presented and analyzed in this paper.
The cell formation problem is defined using the hypergraph representation of the
manufacturing systems. The proposed method approximates the hypergraph model by
graphs so that the cuts are less affected by the approximation. Consequently, a
Gomory-Hu cut tree of the graph approximation is obtained. The minimum cuts between
all pairs of vertices are calculated easily by means of this tree, and a partition
tree is produced. Our cell formation algorithm successively cuts the partition
tree. The algorithm is subjected to an experimentation of randomly generated
manufacturing situations. The algorithm is compared with other cell formation
techniques as well. © 1998 Published by Elsevier Science B.V. All rights reserved.
AUTHOR KEYWORDS: Cell formation; Graph theory; Hypergraphs; Manufacturing;
Modeling
INDEX KEYWORDS: Algorithms; Approximation theory; Mathematical models; Random
processes; Trees (mathematics), Cell formation algorithms; Gomory-Hu cut tree;
Hypergraph approximations, Flexible manufacturing systems
REFERENCES: Berge, C., (1989) Hypergraphs, , North-Holland, Amsterdam;
De Werra, D., On an optimization problem occurring in FMSs: A hypergraph
theoretical formulation (1993) Technical Report ORWP 92/07, , Ecole Polytechnique
Federale de Lausanne, Departement de mathematiques, CH-1015 Lausanne, Suisse,
March;
Kandiller, L., A generic cell formation algorithm (1993) Proceedings of
International Conference on Industrial Engineering and Production Management, 1,
pp. 77-86., FUCAM, Mons, Belgium;
Lengauer, T., (1990) Combinatorial Algorithms for Integrated Circuit Layout,
Applicable Theory in Computer Science Series, , University of Paderbon, Germany,
Wiley, New York;
Charney, H.R., Plato, D.L., Efficient partitioning of components (1968) Proceedings
of the Fifth Annual Design Automation Workshop, pp. 160-1621;
Hanan, M., Kurtzberg, J.M., A review of the placement and quadratic assignment
problems (1972) SIAM Review, 14, pp. 324-342;
Donath, W.E., Logic partitioning (1988) Physical Design Automation of VLSI Systems,
, B.T. Preas, M.J. Lorenzetti (Eds.), Benjamin/Cummings, Menlo Park, CA;
Hadley, S., A new approximation technique for hypergraph partitioning problems
(1989) Technical Report, , University of Waterloo, Department of Electrical and
Computer Engineering, Waterloo, Ontario, Canada N2L 3G1, April;
Gomory, R.E., Hu, T.C., Multi-terminal network flows (1961) J. SIAM, 9 (4), pp.
551-570;
Cherian, J., Hagerup, T., Mehlhorn, K., Can a maximum flow be computed in O(nm)
time? (1998) Proceedings of the 17th International Colloquium on Automata Languages
and Programming, pp. 235-248;
2429;
Purcheck, G.F., Machine-component group formation: An heuristic method for flexible
Research, 18 (2), pp. 213-232;
Research, 24 (5), pp. 1224-1233;
Research, 24 (2), pp. 451-464;
Studies, , A. Kusiak (Ed.), Elsevier, Amsterdam
CORRESPONDENCE ADDRESS: Kandiller, L.; Middle East Technical University, Department
of Industrial Engineering, 06531 Ankara, Turkey
PUBLISHER: Elsevier
ISSN: 03772217
CODEN: EJORD
SOURCE: Scopus
Pierreval, H., Plaquin, M.-F.

6603719844;6505815728;
An evolutionary approach of multicriteria manufacturing cell formation
(1998) International Transactions in Operational Research, 5 (1), pp. 13-25. Cited
12 times.
85040478071&doi=10.1111%2fj.1475-
3995.1998.tb00098.x&partnerID=40&md5=5eecfec37599bb3d0b96733f0f3fc68e
DOI: 10.1111/j.1475-3995.1998.tb00098.x
AFFILIATIONS: Laboratoire d’Informatique de Modélisation et d’Optimisation des
Systèmes, Clermont Ferrand, France
ABSTRACT: Several approaches to designing cellular manufacturing systems exist, but
they are generally based on the optimization of a single criterion, such as the
minimization of the inter-cell movement or the total cost. Unfortunately, in
practice, it is often necessary to take into account multiple criteria. We present
an approach based on a niched pareto evolutionary algorithm which does not rely on
weights or distances to a target solution. The suggested method allows several
solutions to be provided, so that a choice is offered to the decision maker,
according to his/her particular constraints. A new recombination operator is also
presented. This approach is illustrated on a cell formation problem using two
criteria: The cell workload and the traffic between cells. © 1998 Blackwell
Publishing Ltd.
AUTHOR KEYWORDS: Cell formation; Evolutionary algorithms; Group technology;
Multicriteria decision making
REFERENCES: Back, T., Schwefel, H.P., An overview of evolutionary algorithms for
parameter optimization (1993) Evolutionary Computation, 1 (1), pp. 1-23;
Bäck, T., (1996) Evolutionary Algorithms in Theory and Pratice, , Oxford University
Press;
Caux, C., Pierreval, H., Bruniaux, R., Algorithmes évolutionaristes pour la
technologie de groupe: Application à la formation d’ilots de fabrication (1995)
Revue Automatique et Production Appliquée, 24 (4), pp. 409-443;
Deb, K., Genetic algorithms in multimodal function optimization (1989) Master
thesis, , TCGA, University of Alabama;
Falkenauer, E., A new representation and operators for genetic algorithms applied
to grouping problems (1994) Evolutionary Computation, 2 (2), pp. 123-144;
Fonseca, C.M., Fleming, P.J., An overview of evolutionary algorithms in
multiobjective optimization (1995) Evolutionary Computation, 3 (1), pp. 1-16;
Learning, , Addison-Wesley Publishing Company;
Goldberg, D.E., Deb, K., A comparative analysis schemes used in genetic algorithms
(1991) Foundations of Genetic Algorithms, pp. 69-93;
Goldberg, D.E., Richardson, J.J., Genetic algorithms with sharing for multimodal
function optimization. Genetic algorithms and their applications (1987) Proceedings
of the second ICGA, pp. 41-49., Lawrence Erlbaum Associates Hillsdale, NJ;
Gupta, Y.P., Gupta, M.C., Kumar, A., Sundaram, C., A genetic algorithm-based
annealing: An industrial application (1990) Journal Of Intelligent Manufacturing,
pp. 185-191;
Horn, J., Nafpliotis, N., Multiobjective optimization using the niched pareto
genetic algorithm (1993) IIlliGAL Report No 93005, , University of Illinois at
Urbana-Champaign;
2429;
Krause, M., Nissen, V., On using penalty functions and multicriteria optimisation
techniques in facility layout (1995) Evolutionary Algorithms in Management
Application, pp. 153-166., J. Biethahn, V. Nissen, Springer, Berlin;
attractiveness of group technology cellular layouts (1990) Management science, 36
(12), pp. 1567-1578;
Paris, J.L., Pierreval, H., Manufacturing cell formation using distributed
evolutionary algorithms (1996) Proceedings of the 12th International Conference on
CAD/CAM Robotics and Factories of the future, pp. 369-374., London;
Paris, J.L., Pierreval, H., (1996) Optimizing manufacturing systems using a coarse
grained distributed evolutionary algorithm approach, , 4th IFIP WG 7.6 Working
Conference on Optimization based Computed Aided Modelling on Design. Noisy-le-
Grand, France;
Pomerol, J.C., Barba-Romero, S., (1993) Le choix multicritère dans l’entreprise;
Proth, J.M., (1992) Conception et gestion des systèmes de production, , Presses
Universitaires de France;
Srinivas, N., Deb, K., Multiobjective optimization using non-dominated sorting in
genetic algorithms (1994) Evolutionary Computation, 2 (3), pp. 221-248;
Spears, W.M., DeJong, K.A., Bäck, T., Fogel, D., De Garis, H., An overview of
evolutionary computation (1993) Proc. European Conf: On Machine Learning, pp. 442-
459., Springer, New York U.S.A;
Journal of Production Research
ISSN: 09696016
ABBREVIATED SOURCE TITLE: Int. Trans. Oper. Res.
SOURCE: Scopus
Sandbothe, R.A.
6602427806;
Two observations on the grouping efficacy measure for goodness of block diagonal
forms
16 times.
0032202693&doi=10.1080%2f002075498192373&partnerID=40&md5=9bab495ca62b6e9607213abe0
998c753
DOI: 10.1080/002075498192373
AFFILIATIONS: Daemen College, Division of Business, 4380 Main Street, Amherst, NY,
14226, United States
ABSTRACT: This note presents two observations on using the group efficacy measure
of Kumar and Chandrasekharan (1990). First, an example is presented where striving
to maximize grouping efficacy results in a solution to the part family-machine cell
formation problem with illogical part or machine assignments. A restriction on
admissible solutions corrects the flaw. Secondly, a reassignment of parts to
families and/or machines to cells often results in a decrease to one variable, such
as the number of voids, and increases the value of the other variable (number of
exceptional elements). Upper bounds are developed for the positively impacted
variable. When the positively impacted variable is below this upper bound, the
result is an improvement to the grouping efficacy measure. © 1998 Taylor and
Francis Group, LLC.
INDEX KEYWORDS: Mathematical models; Operations research; Problem solving, Block
diagonal form; Grouping efficacy, Group technology
REFERENCES: Chandrasekharan, M.P., Rajagopalan, R., An ideal seed non-hierarchical
clustering algorithm for cellular manufacturing (1986) International Journal of
CORRESPONDENCE ADDRESS: Sandbothe, R.A.; Daemen College, Division of Business, 4380
Main Street, Amherst, NY, 14226, United States
ISSN: 00207543
SOURCE: Scopus
Chu, C.-H.
8319645300;
An improved neural network for manufacturing cell formation
(1997) Decision Support Systems, 20 (4), pp. 279-295. Cited 15 times.
9236%2897%2900015-8&partnerID=40&md5=4fccb33fb4ade5416c2c8f20409a5530
DOI: 10.1016/S0167-9236(97)00015-8
AFFILIATIONS: Department of Management, Iowa State University, Ames, IA 50011,
United States
ABSTRACT: With structures inspired by the structure of the human brain and nervous
system, neural networks provide a unique computational architecture for addressing
problems that are difficult or impossible to solve with traditional methods. In
this paper, an unsupervised neural network model, based upon the interactive
activation and competition (IAC) learning paradigm, is proposed as a good
alternative decision-support tool to solve the cell-formation problem of cellular
manufacturing. The proposed implementation is easy to use and can simultaneously
form part families and machine cells, which is very difficult or impossible to
achieve by conventional methods. Our computational experience shows that the
procedure is fairly efficient and robust, and it can consistently produce good
clustering results. © 1997 Elsevier Science B.V.
AUTHOR KEYWORDS: Cellular manufacturing; Interactive activation and competitive
learning; Neural networks; Unsupervised learning
INDEX KEYWORDS: Computational complexity; Computer aided manufacturing; Decision
support systems; Flexible manufacturing systems; Interactive computer systems;
Learning systems; Problem solving, Interactive activation and competitive (IAC)
learning, Neural networks
REFERENCES: Dayhoff, J., (1990) Neural Network Architecture, , Van Nostrand-
Reinhold, New York;
McClelland, J.L., Rumelhart, D.E., (1988) Explorations in Parallel Distributed
Processing: A Handbook of Models, Programs and Exercises, , MIT Press, Boston, MA;
(1989) Neuralworks Professional II: Users' Guide, , Neuralware, Pittsburgh, PA;
Rumelhart, D.E., McClelland, J.L., (1989) PDP Group, Parallel Distributed
Processing: Exploration in the Microstructure of Cognition, 1., MIT Press, Boston,
MA;
Takefuji, Y., (1992) Neural Network Parallel Computing, , Kluwer Academic
Publishers, Boston, MA;
Tam, K.Y., Neural network models and the prediction of bank bankruptcy (1991) Omega
Int. J. Manage. Sci., 19, pp. 429-445;
Wasserman, P.D., (1989) Neural Computing: Theory and Practice, , Pergamar Press,
New York, NY;
Wemmerlöv, U., Hyer, N.L., Research issues in cellular manufacturing (1987) Int. J.
Prodn. Res., 25, pp. 413-431;
Planning, Design and Analysis of Cellular Manufacturing Systems, pp. 3-46., A.K.
Kamrani, H.R. Parsaei, D.H. Liles (Eds.), Elsevier, Amsterdam, Netherlands;
resonance theory paradigm (1995) Int. J. Prodn. Res., 33, pp. 893-913;
Wemmerlöv, U., Hyer, N.L., Procedures for the part-family, machine-group
identification problem in cellular manufacturing (1986) J. Oper. Manage., 6, pp.
125-147;
McAuley, J., Machine grouping for efficient production (1972) Prodn. Engr., 51, pp.
53-57;
Chandrasekham, K.P., Rajagopolan, R., An ideal-seed nonhierarchical clustering
algorithm for cellular manufacturing (1986) Int. J. Prodn. Res., 24, pp. 451-464;
Srinivasan, G., Narendran, T.Y., GRAFICS - A nonhierarchical clustering algorithm
for group technology (1991) Int. J. Prodn. Res., 29, pp. 463-478;
configuration (1987) Int. J. Prodn. Res., 25, pp. 101-113;
Chu, C.H., Lee, W., An efficient heuristic for grouping part families (1990)
Proceedings of the Midwest Decision Sciences Conference, pp. 62-64;
Waghodekar, P.H., Shau, S., Machine-component cell formation in group technology:
MACE (1984) Int. J. Prodn. Res., 22, pp. 937-948;
manufacturing (1987) Int. J. Prodn. Res., 25, pp. 1715-1728;
Kusiak, A., The generalized group technology concept (1987) Int. J. Prodn. Res.,
25, pp. 561-569;
Srinivasan, G., Narendran, T.Y., Mahadevan, B., An assignment model for the part-
families problem in group technology (1990) Int. S. Prodn. Res., 28, pp. 145-152;
manufacturing (1982) J. Manufg. Sys., 1, pp. 66-75;
using a rank-order clustering algorithm (1980) Int. J. Prodn. Res., 18, pp. 213-
232;
King, J.R., Machine-component group formation in group technology (1980) Omega Int.
J. Manage. Sci., 8, pp. 193-199;
Review and extension (1982) Int. J. Prodn. Res., 20, pp. 117-133;
Chandrasekham, K.P., Rajagopolan, R., ZODIAC - An algorithm for concurrent
formation of part-families and machine-cells (1987) Int. J. Prodn. Res., 25, pp.
835-850;
manufacturing cellular formation (1990) Int. J. Prodn. Res., 28, pp. 1417-1433;
Chu, C.H., Clustering analysis in manufacturing cellular formation (1989) Omega
Int. J. Manage. Sci., 17, pp. 289-295;
J. Oper. Res., 69, pp. 284-291;
Moon, Y.B., An interactive activation and competition model for machine-part family
formation in group technology (1990) Proceedings of the International Joint
Conference on Neural Networks, pp. 667-670., Washington DC;
network approach (1990) Int. J. Adv. Manufg. Technol., 5, pp. 278-291;
techniques (1993) J. Manufg. Sys., 11, pp. 149-159;
Yeh, Y.C., (1993) Artificial Neural Networks: Models, Applications and Practice,
2nd Edn., , Ru-Lin Publishers, Taipei, Taiwan, in Chinese;
Chakraborty, K., Roy, U., Connectionist models for part family classifications
(1993) Comput. Ind. Eng., 24, pp. 189-198;
and coding of rotational parts (1991) Int. J. Prodn. Res., 29, pp. 1771-1784;
Kao, Y., Moon, Y.B., A unified group technology implementation using the back-
propagation learning rule of neural network (1991) Comput. Ind. Eng., 20, pp. 425-
437;
Malavé, C.O., Ramachandran, S., Neural network-based design of cellular
manufacturing systems (1991) J. Intel. Manufg., 2, pp. 305-314;
Chu, C.H., Manufacturing cell formation by competitive learning (1993) Int. J.
Prodn. Res., 31, pp. 829-843;
models (1994) Int. J. Prodn. Res., 32, pp. 2105-2116;
cellular manufacturing (1995) Int. J. Prodn. Res., 33, pp. 293-318;
Manufg. Rev., 4, pp. 293-301;
Liao, T.W., Chen, L.J., An evaluation of ART 1 neural models for GT part family and
machine cell forming (1993) J. Manufg. Sys., 12, pp. 282-290;
neural network approach (1992) Int. J. Prodn. Res., 30, pp. 1353-1367;
technology cell formation (1994) Int. J. Prodn. Res., 32, pp. 1693-1713;
Rao, H.A., Gu, P., A multiconstraint neural network for the pragmatic design of
cellular manufacturing systems (1995) Int. J. Prodn. Res, 33, pp. 1049-1070;
Grossberg, S., A theory of visual coding, memory and development (1978) Formal
Theories of Visual Perception, , E.L.T. Leeuwenberg, H.F. Buffart (Eds.), Wiley,
New York;
McClelland, J.L., Retrieving general and specific information from stored knowledge
of specifics (1981) Proceedings of the Third Annual Meeting of the Cognitive
Science Society, pp. 170-172;
McClelland, J.L., Rumelhart, D.E., An interactive activation model of context
effects in letter perception. Part 1. An account of basic findings (1981) Psychol.
Rev., 88, pp. 375-407;
Rumelhart, D.E., McClelland, J.L., An interactive activation model of context
effects in letter perception. Part 2. The contextual enhancement effect and same
tests and extensions of the model (1982) Psychol. Rev., 89, pp. 60-94;
J. Prodn. Res., 28, pp. 233-243;
manufacturing systems (1981) Proceedings of the Ninth North American Manufacturing
Research Conference, pp. 503-508;
Flynn, B.B., (1984) Grouping Technology Versus Process Layout: A Comparison Using
Computerized Job Shop Simulation, , Unpublished DBA dissertation, Indiana
University, IN;
Burbidge, J., Production flow analysis (1963) Prodn. Engr., 42, pp. 742-752;
Chandrasekham, K.P., Rajagopolan, R., Groupability: An analysis of the properties
of binary data for group technology (1989) Int. J. Prodn. Res., 27, pp. 1035-1052;
technology) layout with process layout (1987) Decision Sci., 18, pp. 562-581
CORRESPONDENCE ADDRESS: Chu, C.-H.; Department of Management, Iowa State
University, Ames, IA 50011, United States; email: [email protected]
PUBLISHER: Elsevier
ISSN: 01679236
CODEN: DSSYD
ABBREVIATED SOURCE TITLE: Decis Support Syst
SOURCE: Scopus
Ossama, M., Youssef, A.M.A., Shalaby, M.A.

56278468000;36846141700;16465133900;
A multi-period cell formation model for reconfigurable manufacturing systems
(2014) Procedia CIRP, 17, pp. 130-135. Cited 5 times.
84904470558&doi=10.1016%2fi.procir.2014.01.120&partnerID=40&md5=5aba8ff98419ff94adb
914feb3c532cc
DOI: 10.1016/i.procir.2014.01.120
AFFILIATIONS: Department of Mechanical Design and Production, Faculty of
Engineering, Cairo University, Giza 12613, Egypt
ABSTRACT: The effective design of a reconfigurable manufacturing system (RMS)
exerts the need for a design approach to group the parts into families and
determine the corresponding system configurations. A mixed integer programming
model was developed to form simultaneously the part families and corresponding cell
configurations in RMS in a dynamic production environment. A novel reconfiguration
planning heuristic, responsible for determining the reconfiguration plan on both
machines and system levels between successive time periods, is introduced. The
model was tested by solving a dynamic cell formation problem and it was able to
find the optimal solution found in the literature. Also a numerical example is
included to illustrate the proposed model and the reconfiguration planning
heuristic. © 2014 Elsevier B.V. This is an open access article under the CC BY-NC-
ND license.
AUTHOR KEYWORDS: Cell formation; Reconfigurable manufacturing systems;
Reconfiguration planning
INDEX KEYWORDS: Cells; Cellular manufacturing; Computer aided manufacturing;
Cytology; Integer programming, Cell configurations; Cell formation; Dynamic cell
formation; Mixed integer programming model; Reconfigurable manufacturing system;
Reconfiguration planning; Reconfiguration plans; System configurations, Manufacture
REFERENCES: Koren, Y., Heisel, U., Jovane, F., Moriwaki, T., Pritschow, G., Ulsoy,
A.G., Reconfigurable manufacturing systems (1999) Annals of the CIRP, 48 (2), pp.
527-540;
Spicer, P., (2002) A Design Methodology for Scalable Machining Systems, , PhD diss.
Elmaraghy, H.A., Flexible and reconfigurable manufacturing systems paradigms (2006)
Int J Flex Manuf Sys, 17 (4), pp. 261-276;
Uncertain Production Requirements with Presence of Routing Flexibility, , PhD Diss.
Virginia Polytechnic Institute and State University;
cellular manufacturing systems (2006) Int J Prod Econ, 103 (2), pp. 767-783;
genetic-Algorithm-based heuristic (2006) Int J Prod Res, 44, pp. 2421-2444;
in cellular manufacturing systems (2008) Int J Prod Res., 46 (22), pp. 6389-6413;
genetic algorithm to solve dynamic cell formation problem (2010) Appl Math Model,
34 (4), pp. 1078-1092;
Saxena, L.K., Jain, P.K., Dynamic cellular manufacturing systems design-A
comprehensive model (2010) Int J Adv Manuf Tech, 53 (1-4), pp. 11-34;
Javadian, N., Aghajani, A., Rezaeian, J., Ghaneian Sebdani, M.J., A multiobjective
reconfiguration (2011) Int J Adv Manuf Tech, 56 (1-4), pp. 307-317;
based on number and average length of intra and intercellular movements (2013) Appl
Math Model, 37 (4), pp. 1884-1896;
Abdi, M.R., Labib, A.W., Grouping and selecting products: The design key of
Reconfigurable Manufacturing Systems (RMSs) (2004) Int J Prod Res, 42 (3), pp. 521-
546;
Galan, R., Racero, J., Eguia, I., Garcia, J.M., A systematic approach for product
families formation in Reconfigurable Manufacturing Systems (2007) Robot Cim-Int
Manuf, 23 (5), pp. 489-502;
Rakesh, K., Jain, P.K., Mehta, N.K., A framework for simultaneous recognition of
part families and operation groups for driving a reconfigurable manufacturing
system (2010) Advances in Production Engineering & Management, 5, pp. 45-58;
Pattanaik, L.N., Kumar, V., Production family formation for reconfigurable
manufacturing using a bi-criterion evolutionary algorithm (2011) Int J Ind Eng, 18
(9), pp. 493-505;
Spicer, P., Carlo, H.J., Integrating reconfiguration cost into the design of multi-
period scalable reconfigurable manufacturing systems (2007) J Manuf Sci e ., 129
(1), p. 202
CORRESPONDENCE ADDRESS: Youssef, A.M.A.; Department of Mechanical Design and
Production, Faculty of Engineering, Cairo University, Giza 12613, Egypt; email:
[email protected]
ISSN: 22128271
SOURCE: Scopus
Chang, J.-E., Wang, D.

56143413500;56103149800;
An accessory clustering method for group layout
1, pp. 19-25.
84888273434&partnerID=40&md5=3cd0b659a1e856eff9d170773a989a64
AFFILIATIONS: School of Mechanical and Electronic Engineering, Wuhan University of

Technology, Wuhan, China
ABSTRACT: Nowadays Group Layout (GL) becomes more popular as its flexibility and
agility, the machine-part cell formation problem consists of constructing a set of
machine cells and their corresponding processes with the objective of minimizing
the inner-cell & external-cell accessory movement. This paper puts forward some
application problems using Group Technology in GL and presents a genetic clustering
algorithm combined with local optimization search arithmetic, establishes systemic
process, realizes it based on Visual C++6.0. When tested by classical machine-part
cell problems, the improved algorithm performs better than other methods on
clustering adaptability, time, facility integrated using rate. This paper could
provide core method for computer aided grouping layout and has impressive efforts
on implying Lean Production & Manufacture Resource Planning for Medium-sized and
small enterprises. Copyright © (2008) by Computers & Industrial Engineering.
AUTHOR KEYWORDS: Genetic clustering algorithm; Group layout; Lean production;
Local optimization search arithmetic; Machine-part cell formation
INDEX KEYWORDS: Cell formation; Genetic clustering algorithms; Group layouts; Lean
production; Local optimizations, Cellular manufacturing; Group technology;
Industrial engineering; Optimization, Clustering algorithms
REFERENCES: (1975) Adaptation in Natural and Artificial Systems: An Introductory
Analysis with Applications in Biology, Control, and Artificial Intelligence, ,
Holland;
Gen, M., Cheng, R., (2004) Genetic Algorithms and Engineering Optimization, pp.
547-562., Tsinghua University Press, BeiJing;
Xu, X., Cai, J., (2005) Group Technology, pp. 36-70., China Machine Press, BeiJing;
Eklund, N.H.W., Embrechts, M.J., Efficient chromosome encoding and problem-specific

mutation methods for the flexible bay facility layout problem (2006) IEEE
Transaction on Systems, Man and Cybernetics, 36, pp. 495-503;
Tariq, A., Hussain, I., A hybird genetic algorithm for machine part grouping (2006)
IEEE-ICET 2006 2th International Conference on Emerging Technologies, pp. 624-630.,
Peshawar, Pakistan, 13-14 November;
Kumar, C., Chandrasekharan, M., A quantitative criterion for goodness of block
diagonal forms of binary matrices in group technology (1990) International Journal
2079;
Zhou, M., Shun, S., (2005) Genegic Algorithms: The Theory and Applications, pp. 32-
64., National Defence Industry Press, BeiJing;
CORRESPONDENCE ADDRESS: School of Mechanical and Electronic Engineering, Wuhan
University of Technology, Wuhan, China
ISBN: 9781627486828
SOURCE: Scopus
Wang, J., Wei, X., Li, R.

57195946558;7402117019;57212752242;
Evolutionary algorithms with preference for manufacturing cells formation
(2008) Chinese Journal of Mechanical Engineering (English Edition), 21 (1), pp.
40949147501&doi=10.3901%2fCJME.2008.01.111&partnerID=40&md5=5ed5710dda5d6b9c410f130
090b10905
DOI: 10.3901/CJME.2008.01.111
AFFILIATIONS: School of Mechanical Engineering, Dalian University of Technology,
Dalian 116023, China;
Center for Advanced Design Technology, Dalian University, Dalian 116622, China
ABSTRACT: Due to the combinatorial nature of cell formation problem and the
characteristics of multi-objective and multi-constrain, a novel method of
evolutionary algorithm with preference is proposed. The analytic hierarchy process
(AHP) is adopted to determine scientifically the weights of the sub-objective
functions. The satisfaction of constraints is considered as a new objective, the
ratio of the population which doesn't satisfy all constraints is assigned as the
weight of new objective. In addition, the self-adaptation of weights is applied in
order to converge more easily towards the feasible domain. Therefore, both features
multi-criteria and constrains are dealt with simultaneously. Finally, an example is
selected from the literature to evaluate the performance of the proposed approach.
The results validate the effectiveness of the proposed method in designing the
manufacturing cells.
Preference
INDEX KEYWORDS: Analytic hierarchy process; Evolutionary algorithms; Genetic
algorithms; Multiobjective optimization, Cell formation; Multiconstrain; Self
adaptation of weights, Cellular manufacturing
REFERENCES: Chu, C.H., Tsai, M., A comparison of three array-based clustering
techniques for manufacturing cell formation (1990) International Journal of
Adil, B., A meta-heuristic algorithm to solve quadratic assignment formulations of
cell formation problems without presetting number of cells (2004) Journal of
Li, J., Wang, Y.F., Chu, C.H., Research on manufacture cell construction method
based on fuzzy technology (2004) Computer Integrated Manufacturing Systems, 10
(12), pp. 1561-1566., in Chinese;
Menouar, B., Karim, A., A new branch- and-bound-enhanced genetic algorithm for the
pp. 2219-2245;
1189;
Wu, X.D., Chu, C.H., Wang, Y.F., A genetic algorithm for cellular manufacturing
design and layout (2007) Euro. J. Operational Research, 181, pp. 156-167;
Maghsud, S., Prem, V., Ravi, S., A multi-objective genetic algorithm approach to
the design of cellular manufacturing systems (2004) International Journal of
Research, 38 (2), pp. 385-395;
Albadawi, Z., Bashir, H.A., Chen, M.Y., A mathematical approach for the formation
of manufacturing cells (2005) Computers and Industrial Engineering, 48, pp. 3-21;
Saaty, T.L., (1980) The Analytic Hierarchy Process, , New York: McGraw-Hill Press;
Aktürk, M.S., Balkose, H.O., Part-machine grouping using a multi-objective cluster
analysis (1996) International Journal of Production Research, 34 (8), pp. 2299-2315
CORRESPONDENCE ADDRESS: Wang, J.; School of Mechanical Engineering, Dalian
University of Technology, Dalian 116023, China; email: [email protected]
ISSN: 10009345
CODEN: CJMEE
ABBREVIATED SOURCE TITLE: Chin J Mech Eng Engl Ed
SOURCE: Scopus
Vitanov, V., Tjahjono, B., Marghalany, I.

6602309022;23010826900;16304625100;
A decision support tool to facilitate the design of cellular manufacturing layouts
34248144929&doi=10.1016%2fj.cie.2007.01.003&partnerID=40&md5=68d1632d8564285782b751
e3e5f0a9ea
DOI: 10.1016/j.cie.2007.01.003
AFFILIATIONS: Department of Manufacturing, School of Applied Sciences, Cranfield
University, Cranfield, Bedford, MK43 0AL, United Kingdom
ABSTRACT: This paper presents a decision support tool that can be used by
practitioners and industrialists to solve practical cell formation problems. The
tool is based on a cell formation algorithm that employs a set of heuristic rules
to obtain a quasi-optimal solution from both component routing information and
other significant production data. The algorithm has been tested on a number of
data sets obtained from the literature. The test results have demonstrated that in
many cases the algorithm has produced an exceptional performance in terms of the
grouping efficiency, grouping efficacy and quality index measures. The algorithm,
to an extent, overcomes common problems in existing cell formation methods such as
in dealing with ill-structured matrices and achieving rational cell sizes. © 2007
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Heuristics; Production
flow analysis
INDEX KEYWORDS: Algorithms; Cellular manufacturing; Computer aided manufacturing;
Heuristic methods; Problem solving, Cell formation; Ill-structured matrices;
Production flow analysis, Decision support systems
3651-3669;
Burbidge, J.L., (1975) The introduction of group technology, , Heinemann, London,
UK;
Research, 24, pp. 451-464;
Research, 24, pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., GROUP ABILITY: an analysis of the
Cheng, C.H., Madan, M.S., Motwani, J., Designing cellular manufacturing systems by
pp. 349-361;
Research, 36, pp. 1325-1337;
De Guio, R., Barth, M., Cell formation using production flow analysis (1999)
Handbook of cellular manufacturing systems, pp. 69-109., Irani S.A. (Ed), John
Wiley and Sons Inc, New York;
machine-component grouping decisions in the design of cellular manufacturing
Hyer, N.L., Wemmerlov, U., (2002) Reorganizing the factory: competing through
cellular manufacturing, , Productivity Press, Portland, Oregon;
Research, 18, pp. 213-232;
397;
1728;
Kusiak, A., Chow, W.S., Efficient solving of group technology problem (1987)
Engineer, pp. 53-57;
implementation - a state-of-the-art survey (1985) Omega, 13, pp. 381-391;
Opitz, H., Eversheim, W., Wiendhal, H.P., Workpiece classification and its
Saifulislam, K.M., Sarker, B.R., A similarity coefficient measure and machine-parts
formation application (1989) Computer and Industrial Engineering, 16, pp. 419-426;
Seifoddini, H., Djassemi, M., A new grouping measure for evaluation of machine-
component matrices (1996) International Journal of Production Research, 34, pp.
1179-1193;
Shafer, S.M., Part-machine-labor grouping: the problem and solution methods (1998)
Group technology and cellular manufacturing: A state-of-the-art synthesis of
research and practice, pp. 132-152., Suresh N.C., and Kay J.M. (Eds), Kluwer
Academic Publishers, Boston, USA;
and control, , Chapman and Hall, London;
Srinivasan, G., Narendran, T.T., GRAFICS - a nonhierarchical clustering algorithm
463-478;
Suer, G.A., Pena, Y., Vazquez, R., Cellular design to minimize investment costs by
using evolutionary programming (2003) International Journal on Manufacturing
Technology and Management, 5 (1-2), pp. 118-132;
Suresh, N.C., Slomp, J., Kaparthi, S., The capacitated cell formation problem: a
33, pp. 1761-1784;
Venugopal, V., Soft-computing-based approaches to the group technology problem: a
pp. 3335-3357;
2755-2768
CORRESPONDENCE ADDRESS: Tjahjono, B.; Department of Manufacturing, School of
Applied Sciences, Cranfield University, Cranfield, Bedford, MK43 0AL, United
Kingdom; email: [email protected]
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Chen, D.-S., Chen, H.-C., Park, J.-M.

7405454881;10242370500;12757303300;
An improved ART neural net for machine cell formation
(1996) Journal of Materials Processing Technology, 61 (1-2), pp. 1-6. Cited 8
times.
0136%2896%2902457-0&partnerID=40&md5=914435275531ea5f0ff91f07e94e4ef3
DOI: 10.1016/0924-0136(96)02457-0
AFFILIATIONS: Industrial Engineering, University of Alabama, PO Box 870288,
Tuscaloosa, AL, United States;
Computer Science, University of Alabama, PO Box 870290, Tuscaloosa, AL, United
States
ABSTRACT: Several researchers have applied the Adaptive Resonance Theory (ART)
neural network for solving the machine cell formation problem. The standard ART1
algorithm is efficient, but its solution quality is dependent on the input order of
the machine-part matrix, especially in the presence of ill-structured data. To
alleviate this problem, pre-processing and/or post-processing heuristics have been
added to the standard algorithm. This paper presents an alternative algorithm which
modifies the standard ART1 in two ways: (1) it inputs bipolar vectors instead of
binary vectors as given in the original machine-part matrix, and (2) it
incorporates performance criteria into the algorithm. The results show that the
modified algorithm yields an equally good or better solution than do the existing
ones on a set of published examples.
AUTHOR KEYWORDS: ART; Cell formation; Cellular manufacturing; Neural network
INDEX KEYWORDS: Adaptive algorithms; Computer integrated manufacturing; Data
structures; Heuristic methods; Modification; Optimization; Performance; Problem
solving; Standards; Vectors, Adaptive resonance theory; Binary vectors; Bipolar
vectors; Cellular manufacturing; Ill structured data; Machine cell formation;
Machine part matrix, Cellular neural networks
REFERENCES: Kao, Y., Moon, Y.B., A united group technology implememtation using the
backpropagation learning rule of neural networks (1991) Computers Ind. Eng., 20, p.
425;
and coding of rotational parts (1991) Int. J. Prod. Res., 29, p. 1771;
Lee, H., Malave, C.O., Ramachandran, S., A self-organizing neural network approach
for the design of cellular manufacturing systems (1992) J. Intelligent
Manufacturing, 3, p. 325;
manufacturing systems (1991) J. Intelligent Manufacturing, 2, p. 305;
Manufacturing Review, 4, p. 293;
Dagli, C., Sen, C.-F., ART1 neural network approach to large scale group technology
problems (1992) Robotics and Manufacturing: Recent Trends in Research, Education
and Applications, 4., ASME Press;
Kaparth, S., Suresh, N.C., Machine-component cell formation in group technology: A
neural network approach (1992) Int. J. Prod. Res., 30, p. 1353;
cellular manufacturing (1995) Int. J. Prod. Res., 33, p. 293;
Fausett, L., (1994) Fundamentals of Neural Networks: Architectures, Algorithms, and
Applications, , Prentice-Hall;
algorithm for cellular manufacturing (1986) Int. J. Prod. Res., 24, p. 451;
Chan, N.M., Milner, D.A., Direct clustering algorithm for group formation in
cellular manufacturing (1982) J. Manufacturing Systems, 1, p. 65;
Kusiak, A., Chow, W.S., Ffficient solving of the group technology problem (1987) J.
Manufacturing Systems, 6, p. 117;
Seifoddini, H., A note on the similarity coefficient method in group technology
applications (1989) Int. J. Prod. Res., 27, p. 1161;
Seifoddini, H., Sinle linkage versus average linkage clustering in machine cells
formation applications (1989) Computers Ind. Eng., 16;
manufacturing systems (1991) Int. J. Prod. Res., 29, p. 2097
CORRESPONDENCE ADDRESS: Chen, D.-S.; Industrial Engineering, University of Alabama,
PO Box 870288, Tuscaloosa, AL, United States
ISSN: 09240136
CODEN: JMPTE
ABBREVIATED SOURCE TITLE: J Mater Process Technol
SOURCE: Scopus
Verma, P., Ding, F.-Y.

57029760300;7103302346;
A sequence-based materials flow procedure for designing manufacturing cells
16 times.
0001595303&doi=10.1080%2f00207549508904873&partnerID=40&md5=dc3f29a7484a0080d5f54f0
c2a6bea67
DOI: 10.1080/00207549508904873
AFFILIATIONS: Industrial Engineering and Management, North Dakota State University,
Fargo, ND, 58105, United States
ABSTRACT: One of the most important problems in designing a cellular manufacturing
system is the formation of machine cells and the grouping of parts. Most of the
existing cell design procedures operate on a binary part-machine incidence matrix
to identify block diagonality. Important factors such as part operation sequence
and demand volume have not been commonly considered in past research. In this
paper, a sequence-based materials flow procedure is developed to solve the cell
formation problem. The new cell formation procedure is designed to consider
operation sequences in accurately determining the costs of inter-cell movement, as
well as forward and backward intra-cell movements. Extensive comparisons of the new
cell formation procedure with the relevant existing procedures in the literature
demonstrate the effectiveness of the new procedure. © 1995 Taylor & Francis Group,
LLC.
Research, 28 (8), pp. 1555-1572;
Research, 25 (5), pp. 639-665;
Burbidge, J.L., (1975) The Introduction of Group Technology, , London: Wiley);
Heragu, S.S., Kakuturi, S.R., (1994) Grouping and Placement of Machine Cells, ,
Working paper. Department of Decision Sciences and Engineering Systems, Rensselaer
Polytechnic Institute;
(1970) The Bell System Journal, 49, pp. 291-307;
Logendran, R., Workload based model for minimizing total intercell and intracell
Research, 28 (5), pp. 913-925;
390;
(1), pp. 84-97;
Wemmerlov, U., Hyer, N.L., Procedures for the pan family/machine group
CORRESPONDENCE ADDRESS: Verma, P.; Industrial Engineering and Management, North
Dakota State University, Fargo, ND, 58105, United States
ISSN: 00207543
SOURCE: Scopus
Ponnambalam, S.G., Aravindan, P.

7005929538;6701834119;
Design of cellular manufacturing systems using objective functional clustering
algorithms
(1994) The International Journal of Advanced Manufacturing Technology, 9 (6), pp.
0028672118&doi=10.1007%2fBF01748484&partnerID=40&md5=a297b8c1c7a010bf8018a2d817213e
ba
DOI: 10.1007/BF01748484
AFFILIATIONS: Department of Mechanical and Production Engineering, PSG College of
Technology, Coimbatore, 641 004, India
ABSTRACT: Cellular manufacturing (CM) has emerged as an alternative to conventional
batch-type manufacturing owing to the former's capability of reducing set-up times,
in-process inventories and throughput times. It provides the basis for
implementation of just-in-time (JIT) and flexible manufacturing systems (FMS). The
machine-part group formation is an important issue in the design of CMSs. This
paper presents objective functional clustering algorithms for cell formation
problems in the design of cellular manufacturing systems. A deterministic objective
functional algorithm (hard clustering) and a fuzzy objective functional algorithm
(fuzzy clustering) are used to form the part families and machine cells
simultaneously. A collection of data sets from open literature is used to test
these algorithms. A software package has been developed to verify the
implementation. © 1994 Springer-Verlag London Limited.
AUTHOR KEYWORDS: Cellular manufacturing systems; Deterministic objective function
algorithm; Fuzzy objective functional algorithm
INDEX KEYWORDS: Algorithms; Computer software; Fuzzy sets; Just in time production;
Systems analysis; Flexible manufacturing systems, Cellular manufacturing systems;
Deterministic objective functional algorithm; Fuzzy objective functional algorithm;
Cellular manufacturing (CM); Deterministic objective function algorithm; Fuzzy
clustering; Hard clustering; Objective functional clustering algorithms, Flexible
manufacturing systems; Computer aided manufacturing
REFERENCES: Kusiak, A., Chow, W.S., Efficient solving of the group technology
problem (1987) Journal of Manufacturing Systems, 6 (2), pp. 1081-1100;
397;
Schonberger, R.J., (1982) Japanese Manufacturing Techniques: Nine Hidden Lessons in
Simplicity, , The Free Press, New York;
478;
1009;
18, pp. 213-232;
117-133;
Chandrasekaran, M.P., Rajagopalan, R., MODROC-An extension of rank order clustering
1221-1233;
Co, H.C., Arrar, A., Configuring cellular manufacturing systems (1988)
51, pp. 53-57;
Carrie, A.S., Numberical taxonomy applied to group technology and plant layout
Mosier, C., Taube, L., Weighted similarity measure heuristics for group technology
clustering problem (1985) Omega, 13, pp. 381-391;
Chandrasekaran, M.P., Rajagopalan, R., An ideal seed nonhierarchical clustering
algorithm for cellular manufacture (1986) International Journal of Production
Research, 24, pp. 451-464;
J. B. McQueen, “Some methods for classification and analysis of multivariate
observations”, Proceedings of the Fifth Symposium on Mathematical Statistics and
Probability, University of California, Berkeley, pp. 281–297, 1967; Chandrasekaran,
M.P., Rajagopalan, R., ZODIAC—an algorithm for concurrent formation of part-
families and machine-cells (1987) International Journal of Production Research, 25,
pp. 835-850;
Rajagopalan, R., Batra, J.L., Design of cellular production systems — a graph
567-579;
24, pp. 387-400;
Kumar, K.R., Vannelli, A., Strategic subcontracting for efficient disintegrated
Raja Gunasingh, K., Lashkari, R.S., Machine grouping problem in cellular
manufacturing systems — an integer programming approach (1989) International
Journal of Production Research, 27, p. 14675;
Research, 28, pp. 145-152;
Bezdeck, J.C., (1981) Pattern Recognition with Fuzzy Objective Function Algorithms,
, Plenum Press, New York;
Anderberg, M.R., (1973) Cluser Analysis for Application, , Academic Press, New
York;
Vakhria, A.J., Wemmerlov, U., A new similarity index and clustering methodology for
formation of manufacturing cells (1988) DSI Proceedings, 2, pp. 1075-1077;
Panneerselvam, R., Balasubramanian, K.N., Algorithmic grouping of operation
sequences (1985) Engineering Costs and Production Economics, 9, pp. 125-135;
Ventura, J.A., Frank Chen, F., Wu, C.-H., Grouping parts and tools in flexible
implementation — a state of the art survey (1985) Omega, 17, pp. 289-295;
Seiffidini, H., Single linkage vs average linkage clustering in machine cells
formation applications (1989) Computers and Industrial Engineering, 16, pp. 419-426
CORRESPONDENCE ADDRESS: Aravindan, P.; Department of Mechanical and Production
Engineering, PSG College of Technology, Coimbatore, 641 004, India
PUBLISHER: Springer-Verlag
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Chen, W.-H., Srivastava, B.

7409637887;7102906281;
Simulated annealing procedures for forming machine cells in group technology
times.
2217%2894%2990188-0&partnerID=40&md5=f4388ef47fdcbb5598134663e0e66bd0
DOI: 10.1016/0377-2217(94)90188-0
AFFILIATIONS: Department of Management and Systems, Washington State University,
Pullman, WA 99164-4726, United States;
Department of Management, Marguette University, Milwaukee, WI 53233, United States
ABSTRACT: The group technology (GT) problem deals with grouping parts with similar
design and/or process characteristics into part families and forming associated
machines into machine cells in order to achieve a higher level of manufacturing
efficiency. Various models and solution approaches for solving the GT problem have
been proposed in the literature. In this paper, we propose a quadratic programming
model for forming machine cells so as to maximize the sum of machine similarities
within cells while subject to cell size limitation. Our focus is on the development
of simulated annealing based algorithms for solving the cell formation problem. A
systematic computational test is conducted to test the performance of the proposed
algorithms. Our computational results show the superiority of the simulated
annealing algorithms over a graph partitioning based heuristic. © 1994.
AUTHOR KEYWORDS: Group technology; heuristics; manufacturing; simulated
annealing
INDEX KEYWORDS: Algorithms; Graph theory; Heuristic methods; Machinery;
Manufacture; Mathematical models; Mathematical programming; Optimization, Cellular
manufacturing; Graph partitioning based heuristics; Group technology; Simulated
annealing, Production control
REFERENCES: Aarts, Van Laarhoven, Statistical cooling: A general approach to
combinatorial optimization problems (1985) Philips Journal of Research, 40, pp.
193-226;
Askin, Subramanian, A cost-based heuristic for group technology configuration
(1987) International Journal of Production Research, 25/21, pp. 101-113;
Ballakur, Steudel, A within-cell utilization based heuristic for designing cellular
manufacturing (1987) International Journal of Production Research, 25-25, pp. 639-
665;
Burbidge, Production flow analysis (1971) Production Engineer, 50, pp. 139-152;
Cerny, Thermodynamical approach to the Traveling Salesman Problem: An efficient
simulation algorithm (1985) Journal of Optimization Theory and Applications, 45,
pp. 41-51;
Connolly, An improved annealing scheme for the QAP (1990) European Journal of
Eglese, Simulated annealing: A tool for Operational Research (1990) European
Gallagher, Knight, (1973) Group Technology, , Butterworths, London;
Glover, Greenberg, New approaches for heuristic search: A bilateral linkage with
Artificial Intelligence (1989) European Journal of Operational Research, 39, pp.
119-130;
Gunasingh, Lashkari, Machine grouping in cellular manufacturing systems — An
integer programming approach (1989) International Journal of Production Research,
27-29, pp. 1465-1473;
Johnson, Aragon, McGeoch, Schevon, Optimization by Simulated Annealing: An
Experimental Evaluation; Part I, Graph Partitioning (1989) Operations Research,
37/36, pp. 865-892;
King, Machine-component grouping in production flow analysis: an approach using a
Research, 18/12, pp. 213-232;
Kirkpatrick, Gelatt, Jr., Vecchi, Optimization by Simulated Annealing (1983)
Science, 220, pp. 671-680;
Kuik, Salomon, Multi-level lot-sizing problem: Evaluation of a simulated-annealing
heuristic (1990) European Journal of Operational Research, 45, pp. 25-37;
systems (1986) European Journal of Operational Research, 24/23, pp. 387-397;
Kusiak, The generalized group technology concept (1987) International Journal of
Production Research, 25/24, pp. 56-61;
Kusiak, Chow, Efficient solving of the group technology problem (1987) Journal of
Kusiak, Chow, Decomposition of manufacturing systems (1988) IEEE Journal of
Robotics and Automation, 4-5, pp. 457-471;
Van Laarhoven, Aarts, (1987) Simulated Annealing: Theory and Applications, ,
Reidel, Dordrecht;
Matsuo, Suh, Sullivan, A controlled search simulated annealing method for the
general job shop scheduling problem (1988) Working Paper #03-04-88, , Department of
Management, The University of Texas at Austin, Austin, TX;
pp. 53-57;
McCormick, Jr., Schweitzer, White, Problem decomposition and data reorganization by
a clustering technique (1972) Operations Research, 20-25, pp. 993-1009;
Mosier, An experiment investigating the application of clustering procedures and
similarity coefficients to the GT machine cell formation problem (1989)
International Journal of Production Research, 27/10, pp. 1811-1835;
Osman, Potts, Simulated annealing for permutation flow-shop scheduling (1989)
Omega, 17/16, pp. 551-557;
Rajagoplan, Batra, Design of cellular production systems: A graph theoretic
approach (1975) International Journal of Production Research, 13-16, pp. 567-579;
Rose, Klebsch, Wolf, Temperature measurement and equilibrium dynamics of simulated
annealing placements (1990) IEEE Transactions on Computer-Aided Design of
Integrated Circuits and Systems, 9/3, pp. 253-259;
Seifoddini, A note on the similarity coefficient method and the problem of improper
machine assignment in group technology applications (1989) International Journal of
Production Research, 27-27, pp. 1161-1165;
Seifoddini, Duplication process in machine cells formation in group technology
(1989) IIE Transactions, 21-24, pp. 382-388;
Srivastava, Chen, (1991) A graph partitioning heuristic for machine cell formation
in group technology, , Working Paper, Department of Management and Systems,
Washington State University;
Vakharia, Chang, A simulated annealing approach to scheduling a manufacturing cell
(1990) Naval Research Logistics, 37, pp. 559-577;
Vannelli, Kumar, A method for finding minimal bottle-neck cells for grouping part-
machine families† (1986) International Journal of Production Research, 24/22, pp.
387-400;
Wilhelm, Ward, Solving Quadratic Assignment Problems by ‘Simulated Annealing’
(1987) IIE Transactions, 19, pp. 107-119
CORRESPONDENCE ADDRESS: Chen, W.-H.; Department of Management and Systems,
Washington State University, Pullman, WA 99164-4726, United States
ISSN: 03772217
CODEN: EJORD
SOURCE: Scopus
Durga Rajesh, K.V., Krishna Akhil, G., Teja Kumar, A., Vivek, K., Radha Krishna, B.
57203667069;57201637267;57201637115;57201642040;57201638457;
An effective similarity based sheep flock heredity algorithm to anticipate number
of cells
(2018) Journal of Advanced Research in Dynamical and Control Systems, 2017, pp.
2720-2726.
85045432180&partnerID=40&md5=13f2fbd11f7f144edfbb61b986f87834

Foundation, Guntur District, Vaddeswaram, Andhra Pradesh, India
ABSTRACT: Cell Manufacturing is a basic Group Technology application that has been
utilized as a part of a few certifiable industrial applications. The issue of cell
development is considered as the principal most vital criteria in the outline Cell
Manufacturing Systems in request to limit throughput time and setup time to amplify
profitability. In this Paper, an effective SFHA (Sheep Flock Heredity Algorithm) is
recommended for critical thinking where the quantity of cells isn't settled from
the earlier. To solve Cell Formation problem using SFHA, JAVA code is developed and
to anticipate number of cells, Similarity Coefficients between machines have been
considered and code is developed in MATLAB to get Eigen esteems. From the outcomes
we can state that procedure which is proposed has performed well on the standard
issues. © 2018, Institute of Advanced Scientific Research, Inc. All rights
reserved.
AUTHOR KEYWORDS: Cell formation; Cell manufacturing; Eigen esteems; Group
technology; Similarity coefficient
REFERENCES: Vijay Chakaravarthy, G., Marimuthu, S., Ponnambalam, S.G., Kanagaraj,
G., Improved sheep flock heredity algorithm and artificial bee colony algorithm for
Bo, X., Gao, W.-J., Innovative Computational Intelligence: A Rough Guide to 134
Clever Algorithms (2014) Intelligent Systems Reference Library, Springer, p. 62;
Hamza, S.A., Adesta, E.T., Similarity Coefficient Measures Applied to Integrate
Feasibility Assessment and the Design of Cellular Manufacturing Systems (2013)
Australian Journal of Basic and Applied Sciences, 7, pp. 257-266;
Durga Rajesh, K.V., Chalapathi, P.V., Nageswara Rao, M., Eshwar Krishna, C., Anoop,
K., Neeraj, Y., An Efficient Sheep Flock Heredity Algorithm for the Cell Formation
Problem (2017) ARPN Journal of Engineering and Applied Sciences, 12, pp. 6074-6079;
M.A., Akhil Reddy, G., Varma, N.S.M., Application of Teaching-Learning Based
Optimization Technique For Cell Formation Problems (2017) International Journal of
Pure and Applied Mathematics, 116, pp. 123-128;
Durga Rajesh, K.V., Krishna, M.M., Ali, M.A., Chalapathi, P.V., A Modified Hybrid
Similarity Coefficient Based Method for Solving the Cell Formation Problem in
Cellular Manufacturing System (2017) 5Th International Conference of Materials
Processing and Characterization (ICMPC 2016), Materials Today: Proceedings, 4, pp.
1469-1477;
Measuring Parameters For Cell Formation Applications (2016) ARPN Journal of
Engineering and Applied Sciences, 11, pp. 9212-9515;
Durga Rajesh, K.V., Mukesh, D., Harshavardhan, M., Jaganadha Swamy, R., Suresh
Krishnasai, G., Gopi, K., Squared Euclidean Distance Matrix: A Heuristic Based
Approach for Cell Formation Applications (2016) International Journal of Applied
Engineering Research, 11, pp. 7044-7048;
Durga Rajesh, K.V., Sreekar, G., Sri Ram, K., Charen, B., Ravi Tejachalapathi,
P.V., Performance Analysis of Selected Cell Formation Techniques for the Design of
a Cellular Manufacturing System (2014) International Journal of Applied Engineering
Research, 9, pp. 12141-12153
PUBLISHER: Institute of Advanced Scientific Research, Inc.
ISSN: 1943023X
ABBREVIATED SOURCE TITLE: J. Adv. Res. Dyn. Control. Syst.
SOURCE: Scopus
Zhou, B., Lu, Y.

7401906826;57194188243;
Improved PSO for integrating dynamic cell formation and layout problems
(2017) Journal of Southeast University (English Edition), 33 (4), pp. 409-415.
85041433360&doi=10.3969%2fj.issn.1003-
7985.2017.04.004&partnerID=40&md5=bfc331debdca25dfce4bb3f84af5c8bf
DOI: 10.3969/j.issn.1003-7985.2017.04.004
AFFILIATIONS: School of Mechanical Engineering, Tongji University, Shanghai,
201804, China
ABSTRACT: To decrease the impact of shorter product life cycles, dynamic cell
formation problems (CFPs) and cell layout problems (CLPs) were simultaneously
optimized. First, CFPs and CLPs were formally described. Due to the changes of
product demands and the limit of machine capacity, the existing layout needed to be
rearranged to a high degree. Secondly, a mathematical model was established for the
objective function of minimizing the total costs. Thirdly, a novel dynamic multi-
swarm particle swarm optimization (DMS-PSO) algorithm based on the communication
learning strategy (CLS) was developed. To avoid falling into local optimum and slow
convergence, each swarm shared their optimal locations before regrouping. Finally,
simulation experiments were conducted under different conditions. Numerical results
indicate that the proposed algorithm has better stability and it converges faster
than other existing algorithms. © 2017, Editorial Department of Journal of
Southeast University. All right reserved.
AUTHOR KEYWORDS: Cell formation and layout; Communication learning strategy;
Dynamic cellular manufacturing system; Dynamic multi-swarm particle swarm
optimization algorithm
INDEX KEYWORDS: Cells; Cytology; Functions; Learning algorithms; Learning systems;
Life cycle; Manufacture; Optimization; Particle swarm optimization (PSO); Swarm
intelligence, Cell formation; Cell layout problem; Dynamic cell formation; Dynamic
cellular manufacturing systems; Dynamic multi swarms; Learning strategy; Objective
functions; Product life cycles, Cellular manufacturing
REFERENCES: Hearago, S.S., Group technology and cellular manufacturing (1994) IEEE
Transactions on Systems, Man and Cybernetic, 24 (2), pp. 203-215;
Tompkins, J.A., White, J.A., Bozer, Y.A., (1996) Facilities Planning, , 2nd ed. New
York: John Wiley;
71-85;
Nouri, H., Tang, S.H., Hang Tuah, B.T., BASE: A bacteria foraging algorithm for
cell formation with sequence data (2010) Journal of Manufacturing Systems, 29 (2),
pp. 102-110;
Ameli, M.S.J., Arkat, J., Cell formation with alternative process routings and
machine reliability consideration (2008) The International Journal of Advanced
incidence matrices in multi-dimensional cellular manufacturing system (2012)
Kia, R., Shirazi, H., Javadian, N., A multi-objective model for designing a group
layout of a dynamic cellular manufacturing system (2013) Journal of Industrial
Tavakkoli-Moghaddam, R., Aryanezhad, M.B., Safaei, N., Solving a dynamic cell
formation problem using metaheuristics (2005) Applied Mathematics and Computation,
170 (2), pp. 761-780;
Ossama, M., Youssef, A.M.A., Shalaby, M.A., A multi-period cell formation model for
reconfigurable manufacturing systems (2014) Procedia CIRP, 17, pp. 130-135;
approach to dynamic cellular manufacturing system (2014) Proc IMechE Part B: Jounal
of Engineering Manufacture, 228 (3), pp. 458-470;
Kia, R., Baboli, A., Javadian, N., Solving a group layout design model of a dynamic
cellular manufacturing system with alternative process routings, lot splitting and
flexible reconfiguration by simulated annealing (2012) Computers and Operations
Research, 39 (11), pp. 2642-2658;
Izadinia, N., Eshghi, K., Salmani, M.H., A robust model for multi-floor layout
problem (2014) Computers and Industrial Engineering, 78, pp. 127-134;
Mahdavi, I., Teymourian, E., Baher, N.T., An integrated model for solving cell
formation and cell layout problem simultaneously considering new situations (2013)
Wu, X., Chu, C.H., Wang, Y., Genetic algorithms for integrating cell formation with
machine layout and scheduling (2007) Computers and Industrial Engineering, 53 (2),
pp. 277-289;
pp. 117-133
PUBLISHER: Southeast University
ISSN: 10037985
CODEN: JSUOA
ABBREVIATED SOURCE TITLE: J. Southeast Univ. Engl. Ed.
SOURCE: Scopus
Durga Rajesh, K.V., Krishna Akhil, G., Teja Kumar, A., Vivek, K., Radha Krishna, B.
57203667069;57201637267;57201637115;57201642040;57201638457;
An effective similarity based sheep flock heredity algorithm to anticipate number
of cells
(2017) Journal of Advanced Research in Dynamical and Control Systems, 9 (Special
issue 14), pp. 2720-2726. Cited 2 times.
85048947337&partnerID=40&md5=f51ae8530eaa959d4304a26a1828dbc8

Foundation, Guntur District, Vaddeswaram, Andhra Pradesh, India
ABSTRACT: Cell Manufacturing is a basic Group Technology application that has been
utilized as a part of a few certifiable industrial applications. The issue of cell
development is considered as the principal most vital criteria in the outline Cell
Manufacturing Systems in request to limit throughput time and setup time to amplify
profitability. In this Paper, an effective SFHA (Sheep Flock Heredity Algorithm) is
recommended for critical thinking where the quantity of cells isn't settled from
the earlier. To solve Cell Formation problem using SFHA, JAVA code is developed and
to anticipate number of cells, Similarity Coefficients between machines have been
considered and code is developed in MATLAB to get Eigen esteems. From the outcomes
we can state that procedure which is proposed has performed well on the standard
issues. © 2017, Institute of Advanced Scientific Research, Inc. All rights
reserved.
AUTHOR KEYWORDS: Cell formation; Cell manufacturing; Eigen esteems; Group
technology; Similarity coefficient
REFERENCES: Vijay Chakaravarthy, G., Marimuthu, S., Ponnambalam, S.G., Kanagaraj,
G., Improved sheep flock heredity algorithm and artificial bee colony algorithm for
Bo, X., Gao, W.-J., Innovative Computational Intelligence: A Rough Guide to 134
Clever Algorithms (2014) Intelligent Systems Reference Library, 62;
Hamza, S.A., Adesta, E.T., Similarity Coefficient Measures Applied to Integrate
Feasibility Assessment and the Design of Cellular Manufacturing Systems (2013)
Australian Journal of Basic and Applied Sciences, 7, pp. 257-266;
Durga Rajesh, K.V., Chalapathi, P.V., Rao, M.N., Krishna, C.E., Anoop, K., Neeraj,
Y., An Efficient Sheep Flock Heredity Algorithm for the Cell Formation Problem
(2017) ARPN Journal of Engineering and Applied Sciences, 12, pp. 6074-6079;
Durga Rajesh, K.V., Chalapathi, P.V., Anurag Reddy, C., Mahesh Reddy, S., Baba, A.,
Akhil Reddy, G., Varma, N.S.M., Application of Teaching-Learning Based Optimization
Technique For Cell Formation Problems (2017) International Journal of Pure and
Applied Mathematics, 116, pp. 123-128;
Durga Rajesh, K.V., Krishna, M.M., Ali, M.A., Chalapathi, P.V., A Modified Hybrid
Similarity Coefficient Based Method for Solving the Cell Formation Problem in
Cellular Manufacturing System (2017) International Conference of Materials
Processing and Characterization (ICMPC 2016), Materials Today: Proceedings, 4, pp.
1469-1477;
Measuring Parameters For Cell Formation Applications (2016) ARPN Journal of
Engineering and Applied Sciences, 11, pp. 9212-9515;
Durga Rajesh, K.V., Mukesh, D., Harshavardhan, M., Swamy, R.J., Suresh Krishnasai,
G., Gopi, K., Squared Euclidean Distance Matrix: A Heuristic Based Approach for
Cell Formation Applications (2016) International Journal of Applied Engineering
Research, 11, pp. 7044-7048;
Durga Rajesh, K.V., Sreekar, G., Sri Ram Charen, K., Teja, B.R., Chalapathi, P.V.,
Performance Analysis of Selected Cell Formation Techniques for the Design of a
Cellular Manufacturing System (2014) International Journal of Applied Engineering
Research, 9, pp. 12141-12153
ISSN: 1943023X
SOURCE: Scopus
Tóth, T., Radeleczki, S., Veres, L., Körei, A.

36759621100;55982282100;34873930900;55838438800;
A new mathematical approach to supporting group technology
(2014) European Journal of Industrial Engineering, 8 (5), pp. 716-737.
84911467368&doi=10.1504%2fEJIE.2014.065734&partnerID=40&md5=a8f2ab8eb4ad90b3fef9b4c
8040bd311
DOI: 10.1504/EJIE.2014.065734
AFFILIATIONS: Department of Information Engineering, University of Miskolc3515,
Hungary;
Department of Analysis, University of Miskolc3515, Hungary;
Department of Applied Mathematics, University of Miskolc3515, Hungary
ABSTRACT: This paper presents a mathematical approach which can be successfully
applied in different group technology problems. The method is originated from
formal concept analysis (FCA). We produce some particular extent partitions of a
formal context which encodes the relationship between given technical objects and
their attributes. We show how to define the part type notions and also how to solve
the cell formation problem by means of these extent partitions. The main focus of
the paper is a solution method for the determination of master parts. The method is
based on notions defined by modal operators analogously to formal concepts and uses
the extent partitions of the complementary context. It follows from the nature of
the problem that several solutions can exist; a consistency measure is introduced
in order to rank them. Copyright © 2014 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation; Consistency measure; Extent partitions; FCA;
Formal concept analysis; Group technology applications; Master parts; Modal
operators
INDEX KEYWORDS: Cellular manufacturing; Group technology; Information analysis,
Cell formation; Consistency measures; FCA; Master parts; Modal operators;
Technology application, Formal concept analysis
formation of manufacturing cells (2005) Computers & Industrial Engineering, 48 (1),
pp. 3-21;
Alting, L., Zhang, H., Computer-aided process planning: The state-of-the-art survey
Belohlavek, R., Kulkarni, N., Vychodil, V., A novel approach to cell formation
(2009) LNAI, 5548, pp. 210-223., S. Ferr and S. Rudolph (Eds.): ICFCA 2009;
Burbidge, J.I., (1975) The Introduction to Group Technology, , Halsted Press and
John Wiley, New York;
Busi, M., (2005) An Integrated Framework for Collaborative Enterprise Performance
Management, , PhD thesis, Norwegian University of Science and Technology,
Trondheim, Norway;
Car, Z., Mikac, T., Evolutionary approach for solving cell-formation problem in
cell manufacturing (2006) Advanced Engineering Informatics, 20 (3), pp. 227-232;
manufacturing (1982) Journal of Manufacturing System, 1 (1), pp. 65-67;
Chattopadhyay, M., Dan, P.K., Majumdar, S., Application of visual clustering
properties of self organizing map in machine-part cell formation (2012) Applied
Soft Computing, 12 (2), pp. 600-610;
Folan, P., Browne, J., A review of performance measurement: Towards performance
management (2005) Computers in Industry, 56 (7), pp. 663-680;
Ganter, B., Wille, R., (1999) Formal Concept Analysis: Mathematical Foundations, ,
Springer Verlag, Berlin-Heidelberg, New York;
Ganter, B., Stumme, G., Wille, R., (2005) Formal Concept Analysis: Foundations and
Applications, , Springer Verlag, Berlin-Heidelberg;
Ganter, B., Körei, A., Radeleczki, S., Extent partitions and context extensions
(2013) Mathematica Slovaca, 63 (4), pp. 693-706;
Ham, I., Hitomi, K., Yoshida, I., (1985) Group Technology: Applications to
Production Management, , Kluwer-Nijhoff Publishing, Boston, Massachusetts;
Houtzeel, A., Group technology (2001) Maynard's Industrial Engineering Handbook,
5th Ed., pp. 17.105-17.119., Zandin, K.B. (Ed.) McGraw-Hill, New York;
Jahanzaib, M., Masood, S.A., Nadeem, S., Akhtar, K., Shahbaz, M., Application of
genetic algorithm (GA) approach in formation of manufacturing cells for group
technology (2013) Life Science Journal, 9 (4), pp. 799-809;
Kaplan, R.S., Norton, D.P., Mastering the management system (2008) Harvard Business
Review, 86 (1), pp. 63-77., January;
Koren, Y., Shpitalni, M., Design of reconfigurable manufacturing systems (2010)
Körei, A., Radeleczki, S., Box elements in a concept lattice (2006) Contributions
to ICFCA 2006, pp. 41-56., Verlag Allgemeine Wissenschaft;
Kumar, C., Chandrasekharan, M.P., Grouping efficacy: A quantitive criterion for
Marri, H.B., Gunasekaran, A., Grieve, R.J., Computer-aided process planning: A
state of the art (1998) International Journal of Advanced Manufacturing Technology,
14 (4), pp. 261-268;
Megala, N., Rajendran, C., Gopalan, R., An ant colony algorithm for cell formation
in cellular manufacturing systems (2008) European Journal of Industrial
Mitrofanov, S.P., (1966) Scientific Principles of Group Technology, , National
Lending Library for Science and Technology, Boston;
Mleczko, J., High-variety products manufacturing based on dynamic classification
(2011) Advances in Manufacturing Science and Technology, 35 (3), pp. 71-86;
Nanda, J., Simpson, T.W., Kumara, S.R.T., Shooter, S.B., A methodology for product
family ontology development using formal concept analysis and web ontology language
(2006) Journal of Computing and Information Science in Engineering, 6, pp. 103-113;
Nanda, J., Thevenot, H.J., Simpson, T.W., Stone, R.B., Bohm, M., Shooter, S.B.,
Product family design knowledge representation, aggregation, reuse, and analysis
(2007) Artificial Intelligence for Engineering Design, Analysis and Manufacturing,
21 (2), pp. 173-192;
Niebel, B.W., Mechanized process selection for planning new designs (1965) ASME
33rd Annual Meeting Collected Papers, , V6.5 Book 4, Paper No. 737;
considering operation time (2012) Journal of Manufacturing Systems, 31 (3), pp.
326-336;
Powell, D., Netland, T., Towards an integrated performance measurement system for
cellular manufacturing: Insights from the case of Volvo Aero Norway (2010) POMS
21st Annual Conference, Vancouver, 7-10 May, pp. 66-80;
Scholten, B., (2007) The Road to Integration. A Guide to Applying the ISA 95
Standard in Manufacturing, , ISA;
Shang, J.S., Tadikamalla, P.R., Multicriteria design and control of a cellular
Srinivasan, G., Narendran, T., Mahadevan, B., An assigment model for the part
Research, 28 (1), pp. 145-152;
Studel, H.J., Computer-aided process planning: Past, present and future (1984)
Tóth, T., Kórei, A., New approaches in solving machine-part grouping problems
(2006) Production Systems and Information Engineering, 3, pp. 37-46;
Veres, L., (2010) Classification Trees, Rough Sets and Their Applications, , PhD
thesis, University of Miskolc, Hungary;
Xu, X., Wang, L., Newman, S.T., Computer-aided process planning - A critical review
of recent developments and future trends (2011) International Journal of Computer
Yao, Y.Y., Chen, Y.H., Rough set approximation in formal concept analysis (2006)
LNCS, 4100, pp. 285-305., Transactions on Rough Sets;
Yina, Y., Yasuda, K., Similarity coefficient methods applied to the cell formation
problem: A comparative investigation (2005) Computers & Industrial Engineering, 48
(3), pp. 471-489;
CORRESPONDENCE ADDRESS: Körei, A.; Department of Applied Mathematics, University of
MiskolcHungary
ISSN: 17515254
SOURCE: Scopus
Mahapatra, S.S., Narkhede, B.E., Tambuskar, D.P.

34881914000;55642871600;56149210500;
A discrete particle swarm optimisation approach for manufacturing cell formation
(2014) International Journal of Procurement Management, 7 (3), pp. 343-358.
84899886753&doi=10.1504%2fIJPM.2014.060791&partnerID=40&md5=2ddedfcf34a7116bacc4f60
9e462caab
DOI: 10.1504/IJPM.2014.060791
AFFILIATIONS: Department of Mechanical Engineering, National Institute of
Technology, Rourkela 769 008, India;
Department of Production and Industrial Engineering, VJTI, Mumbai 400019, India
ABSTRACT: Manufacturers need to improve the efficiency and productivity of their
production activities to meet fluctuating demand for customised products with
shorter life-cycles. Cellular manufacturing is one of the important manufacturing
philosophies to achieve manufacturing flexibility. In the past, many methods have
been developed for cell formation problem using zero-one machine part incidence
matrix but such an approach can hardly incorporate real life production factors
resulting in inefficient cell design. In the proposed approach, similarity
coefficient is determined using various real life production factors. A discrete
particle swarm optimisation approach is adopted to form the cluster of machines
through maximising similarity coefficient within the cell and minimising similarity
coefficient between the different cells. The proposed approach is tested on
benchmark problems of different size from open literature for its performance using
group technology efficiency and system utilisation. © 2014 Inderscience Enterprises
Ltd.
AUTHOR KEYWORDS: Cellular manufacturing; Discrete particle swarm optimisation;
DPSO; Group technology efficiency; GTE; Similarity coefficient; System
utilisation
REFERENCES: Arkat, J., Naseri, F., Ahmadizar, F., A stochastic model for the
generalized cell formation problem considering machine reliability (2011)
Research, 25 (5), pp. 639-655;
Burbidge, J.L., Production flow analysis (1971) The Production Engineer, 50 (4-5),
pp. 139-152;
Burbidge, J.L., Production flow analysis in planning group technology (1991)
Correa, E.S., Freitas, A.A., Johnson, C.G., A new discrete particle swarm algorithm
applied to attribute selection in a bioinformatics data set (2006) GECCO 2006 -
Genetic and Evolutionary Computation Conference, 1, pp. 35-42., GECCO 2006 -
Genetic and Evolutionary Computation Conference;
David, S., Abekasis, M., Process selection and tool assignment in automated
cellular manufacturing using genetic algorithms (1998) Annals of Operations
Research, 77 (5), pp. 51-78;
Duran, O., Rodriquez, N., Consalter, L.A., A PSO-based clustering algorithm for
manufacturing cell design (2008) IEEE First International Workshop on Knowledge
Discovery and Data Mining, pp. 72-75., 23-24 January 2008, Adelaide, Australia;
pp. 318-344;
Janson, S., Middendorf, M., A hierarchical particle swarm optimizer for dynamic
optimization problems (2004) First European Workshop on Evolutionary Algorithms in
Stochastic and Dynamic Environments, pp. 513-524., Coimbra, Portugal;
Kao, Y., Lin, C., A PSO-based approach to cell formation problems with alternative
process routings (2012) International Journal of Production Research, 50 (15), pp.
4075-4089;
IEEE International Conference on Neural Networks, pp. 12-13., Perth, Australia;
pp. 117-133;
Klastorin, T.D., P-Median problem for cluster analysis: A comparative test using
the mixture model approach (1985) Management Science, 31 (1), pp. 84-95;
Lovbjerg, M., Krink, T., Extending particle swarm optimizers with self-organized
criticality (2002) Proceedings of the 2002 Congress on Evolutionary Computation -
CEC2002, pp. 1588-1593., Honolulu, Hawaii, 12-17 May 2002;
Mahapatra, S.S., Ponnambalam, S.G., Pandian, S.R., Saravanasankar, S., Modified
ART1 neural networks for cell formation using production data (2008) Fourth IEEE
Conference on Automation Science and Engineering, pp. 23-26., Key Bridge Marriott,
Washington DC, USA;
Mahdavi, I., Teymourian, E., Tahami Baher, N., Kayvanfar, V., An integrated model
for solving cell formation and cell layout problem simultaneously considering new
situations (2013) Journal Manufacturing Systems, ,
http://dx.doi.org/10.1016/j.jmsy.2013.02.003, In press, doi;
Megala, N., Chandrasekharan, R., Ram, G., An ant colony algorithm for cell-
formation in cellular manufacturing systems (2008) European Journal of Industrial
Engineering, 2 (3), pp. 298-336., DOI 10.1504/EJIE.2008.017688;
Mulvey, J., Crowder, H., Cluster analysis: An application of Lagrangian relaxation
(1979) Management Science, 25 (4), pp. 329-340;
36 (1), pp. 157-179;
Nair, G.J., Narendran, T.T., Accord: A bicriterion algorithm for cell formation
using ordinal and ratio level data (1999) International Journal of Production
Research, 37 (3), pp. 539-556;
77, pp. 79-95;
707-720;
considerations in cellular manufacturing (1998) Annals of Operations Research, 77,
pp. 97-107;
(13), pp. 2755-2768., DOI 10.1080/00207540010005060;
Yanga, M.S., Hungb, W., Chenga, F., Mixed-variable fuzzy clustering approach to
Zolfaghari, S., Liang, M., Machine cell/part family formation considering
processing time and machine capacities: A simulated annealing approach (1998)
pp. 433-444
CORRESPONDENCE ADDRESS: Mahapatra, S.S.; Department of Mechanical Engineering,
National Institute of Technology, Rourkela 769 008, India; email:
[email protected]
ISSN: 17538432
ABBREVIATED SOURCE TITLE: Int. J. Procure. Manage.
SOURCE: Scopus
León, J.R., Méndez, J.E.Q., Pimiento, N.R.O.

55652500500;49861711000;55427992500;
Performance comparison between a classic particle swarm optimization and a genetic
algorithm in manufacturing cell design [Comparación del desempeño entre un
algoritmo clásico de optimización por enjambre de partículas y un algoritmo
genético en el diseño de celdas de manufactura]
(2013) DYNA (Colombia), 80 (178), pp. 29-36. Cited 3 times.
84876270540&partnerID=40&md5=3ae41056b7c50fa26072e488580b93e6
AFFILIATIONS: Ingeniera Industrial Escuela de Estudios Industriales, Empresariales

Universidad Industrial de Santander, Colombia;
Escuela de Ingeniería Mecánica, Universidad Industrial de Santander, Colombia;
Escuela de Estudios Industriales, Empresariales Universidad Industrial de
Santander, Colombia
ABSTRACT: This article studies the performance of two metaheuristics, the Particle
Swarm Optimization (PSO) and the Genetic Algorithm (GA), in the manufacturing cell
formation problem of a factory that needs to organize three production cases in an
efficient way for four, five and six manufacturing cells to produce 30, 40 and 50
different products to be processed in 10, 10 and 20 type machines, respectively.
The procedure for adjusting the particular parameters of each algorithm is
implemented through a Design of Experiments which includes their own analysis of
variance. Both algorithms are implemented in Matlab®. The results obtained by each
meta heuristic are compared in terms of the cost of the best solution found and the
execution time used to find that solution, so that it is possible to establish
which methodology is the most appropriate when solving this optimization problem.
AUTHOR KEYWORDS: Cellular Manufacturing; Genetic Algorithm; Group Technology;
Intercellular Transfers; Manufacturing cells; Meta-heuristic Models; Particle
Swarm Optimization
REFERENCES: Papaioannou, G., Wilson, J.M., The evolution of cell formation problem
Andres, C., Lozano, S., A particle swarm optimization algorithm for part machine
Ming, L.C., Ponnambalama, S.G., A hybrid GA/PSO for the concurrent design of
cellular manufacturing system (2008) IEEE International Conference on Systems, Man
and Cybernetics, 1855-1860, pp. 12-15., Singapore, October;
Duran, O., Rodriguez, N., Consalter, L.A., A PSO-Based Clustering Algorithm for
Manufacturing Cell Design (2008) First International Workshop on Knowledge
Discovery and Data Mining, 72-75, pp. 23-24., Adelaide, January;
Mehdizadeh, E., Tavakkoli-Moghaddam, R., A fuzzy particle swarm optimization
algorithm for a cell formation problem Proceedings of IFSA-EUSFLAT, ,
http://www.eusflat.org/proceedings/IFSA-EUSFLAT_2009/pdf/tema_1768.pdf, Available:
[cited 02-12-2011];
Anvari, M., Mehrabad, M.S., Banzinpour, F., Machine-part cell formation using a
machinecomponent grouping problem with multiple objectives (1992) Computers and
Gupta, Y., Gupta, M., Kumar, A., Sundram, C.H., Minimizing total intercell and
Falkenauer, E., A New Representation and Operators for Genetic Algorithms Applied
to Grouping Problems (1994) Evolutionary computation, 2 (2), pp. 123-144;
Joines, J., Culbreth, T., King, R., Manufacturing Cell Design: An Integer
Programming Model Employing Genetic Algorithms (1996) IIE Transactions, 28 (1), pp.
69-85;
Morad, N., Zalzala, A., Formulations for cellular manufacturing and batch
scheduling using genetic algorithms (1996) UKACC International Conference on
Control, pp. 473-478., 2-5 September;
Dimopoulos, C., Zalzala, A., Optimization of Cell Configuration and Comparisons
using Evolutionary Computation Approaches (1998) IEEE World Congress on
Computational Intelligence, 148-153, pp. 4-9., Anchorage, May;
Wu, X., Chu, C., Wang, Y., Yang, W., A Genetic Algorithm for Integrated Cell
Formation and Layout Decisions (2002) Congress on Evolutionary Computation, pp.
1866-1872., Honolulu, 12-17 May;
Pervaiz, A., Tavakkoli-Moghaddam, R., Safaei, N., A Comparison of Heuristic Methods
for Solving a Cellular Manufacturing Model in a Dynamic Environment, ,
http://www.wlv.ac.uk/pdf/uwbs_04%20wp007-04%20ahmed%20et%20al.pdf, Available:,
[cited 02-12-2011];
Mahapatra, S., Sudhakara, P., Genetic cell formation using ratio level data in
Tunnukij, T., Hicks, C., Cell formation in group technology: A combinatorial search
Neto, A., Filho, E., A simulation-based evolutionary multiobjective approach to
manufacturing cell formation (2010) Computers & Industrial Engineering, 59, pp. 64-
74;
Deljoo, V., Al-E-Hashem, S.J., Deljoo, F., Aryanezhad, M.B., Using genetic
Modelling, 34, pp. 1078-1092;
Caprihan, R., Slomp, J., Gusaran, Agarwal, K., A quantum particle swarm
optimization approach for the design of virtual manufacturing cells IEEE
International Conference on Industrial Engineering and Engineering Management, 125-
129, pp. 8-11., Hong Kong, December 2009;
Fatemeh, S., Tavakkoli-Moghaddam, R., Imperialistic Competitive Algorithm for
Solving a Dynamic Cell Formation Problem with Production Planning. Advanced
Intelligent Computing Theories and Applications (2010) Lecture Notes in Computer
Science, 6215, pp. 266-276;
Hassan, R., Cohanin, B., De Weck, O., A Comparison of Particle Swarm Optimization
and The Genetic Algorithm, , http://web.mit.edu/deweck/www/PDF_archive/3%20Refereed
%20Conference/3_50_AIAA-2005-1897.pdf, Available: [cited 02-12-2011];
Panda, S., Padhy, N., Comparison of Particle Swarm Optimization and Genetic
Algorithm for TCSC-based Controller Design (2007) International Journal of
Electrical and Electronics Engineering, 1 (1), pp. 41-49;
Correa, R., Begambre, O., Carrillo, J., Validación de un Algoritmo Híbrido del PSO
con el Método Simplex y de Topología de Evolución Paramétrica (2011) Dyna, 165, pp.
255-265;
García, J., (2006) NEO: Networking and Emerging Optimization, ,
http://neo.lcc.uma.es/staff/jmgn/doc/Memoria_PFC_JMGN.pdf, Available: 09 14,.
[cited 02-12-2011];
Cadavid, J., Rivera, J., Ceballos, Y., Agrupamiento Homogéneo de Elementos don
Múltiples Atributos mediante Algoritmos Genéticos (2011) Dyna, 165, pp. 246-254;
Ortiz, N.R., Gómez, S., Desarrollo de un Algoritmo Genético para el Diseño de
Sistemas de Manufactura Celular a partir de una nueva Función de Aptitud (2007) UIS
Ingenierías, 6 (2), pp. 71-82
CORRESPONDENCE ADDRESS: Ingeniera Industrial Escuela de Estudios Industriales,
Empresariales Universidad Industrial de SantanderColombia
ISSN: 00127353
LANGUAGE OF ORIGINAL DOCUMENT: English; Spanish
ABBREVIATED SOURCE TITLE: DYNA
SOURCE: Scopus
Sayadi, M.K., Hafezalkotob, A., Naini, S.G.J.

36992873400;54880543400;36502327100;
Firefly-inspired algorithm for discrete optimization problems: An application to
manufacturing cell formation
(2013) Journal of Manufacturing Systems, 32 (1), p. 78. Cited 81 times.
84895065528&doi=10.1016%2fj.jmsy.2012.06.004&partnerID=40&md5=210230a3830caf5d08ac3
b4c1787b213
DOI: 10.1016/j.jmsy.2012.06.004
Department of Industrial Engineering, Islamic Azad University, South Tehran Branch,
Tehran, Iran
ABSTRACT: The canonical firefly algorithm is basically developed for continuous
optimization problems. However, lots of practical problems are formulated as
discrete optimization problems. The main purpose of this paper is to present the
discrete firefly algorithm (DFA) to solve discrete optimization problems. In the
DFA, we define a firefly's position in terms of changes of probabilities that will
be in one state or the other. Then by using this metaheuristic algorithm, the
manufacturing cell formation problem is solved. To illustrate the behavior of the
proposed model and verify the performance of the algorithm, we introduce a number
of numerical examples to illustrate the use of the foregoing algorithm. The
performance evaluation shows the effectiveness of the DFA. The proposed
metaheuristic algorithm should thus be useful to both researchers and
practitioners. © 2012 The Society of Manufacturing Engineers. Published by Elsevier
Ltd. All rights reserved.
AUTHOR KEYWORDS: Cellular manufacturing; Discrete optimization; Firefly
algorithm; Metaheuristic
INDEX KEYWORDS: Bioluminescence; Cellular manufacturing; Flexible manufacturing
systems; Problem solving, Continuous optimization problems; Discrete firefly
algorithms; Discrete optimization; Discrete optimization problems; Firefly
algorithms; Manufacturing cell formation; Meta heuristic algorithm; Metaheuristic,
Optimization
REFERENCES: Wu, C., Hsu, P., Lai, K., Simulated-annealing heuristics for the
single-machine scheduling problem with learning and unequal job release times
(1983) Science, New Series, 220, pp. 671-680;
Tavakkoli-Moghaddam, R., Gazanfari, M., Alinaghian, M., Salamatbakhsh, A., Norouzi,
N., A new mathematical model for a competitive vehicle routing problem with time
windows solved by simulated annealing (2011) Journal of Manufacturing Systems, 30,
pp. 83-92;
Elmaraghy, H., Patel, V., Ben Abdallah, I., Scheduling of manufacturing systems
under dual-resource constraints using genetic algorithms (2000) Journal of
Dorigo, M., (1992) Optimization, Learning and Natural Algorithms, , Ph.D. Thesis,
Politecnico di Milano, Italy;
Dorigo, M., Di Caro, G., Gambardella, L.M., Ant algorithms for discrete
optimization (1999) Artificial Life, 5 (2), pp. 137-172., 10.1162/106454699568728;
Laguna, M., Marti, R., (2003) Scatter Search: Methodology and Implementations in C,
, Kluwer Academic Boston;
Tavakkoli-Moghaddam, R., Makui, A., Mazloomi, Z., A new integrated mathematical
model for a bi-objective multi-depot location-routing problem solved by a multi-
objective scatter search algorithm (2010) Journal of Manufacturing Systems, 29, pp.
111-119;
Glover, F., Tabu search. Part i (1989) INFORMS Journal on Computing, 1 (3), pp.
190-206;
Glover, F., Tabu search. Part II (1990) INFORMS Journal on Computing, 2 (1), pp. 4-
32;
Glover, F., Tabu search: A tutorial (1990) Interfaces, 2 (4), pp. 74-94;
International Conference on Neural Networks, pp. 1942-1948., Piscataway, NJ, vol. 4
doi:10.1109/ICNN.1995.488968;
Eberhart, R.C., Kennedy, J., A new optimizer using particle swarm theory (1995)
Proceedings of the International Symposium on Micromachine and Human Science, pp.
39-43., Nagoya, Japan, vol. 6;
Ghodratnama, A., Rabbani, M., Tavakkoli-Moghaddam, R., Baboli, A., Solving a
single-machine scheduling problem with maintenance, job deterioration and learning
effect by simulated annealing (2010) Journal of Manufacturing Systems, 29, pp. 1-9;
Taleizadeh, A.A., Akhavan Niaki, S.T., Haji Seyedjavadi, S.M., Multi-product multi-
chance-constraint stochastic inventory control problem with dynamic demand and
partial back-ordering: A harmony search algorithm (2011) Journal of Manufacturing
Systems, , 10.1016/j.jmsy.2011.05.006;
Nouri, H., Tang, S.H., Hang Tuah, B.T., Anuar, M.K., BASE: A bacteria foraging
algorithm for cell formation with sequence data (2010) Journal of Manufacturing
Systems, 29, pp. 102-110;
Cheng, B., Li, K., Chen, B., Scheduling a single batch-processing machine with non-
identical job sizes in fuzzy environment using an improved ant colony optimization
Bagheri, A., Zandieh, M., Bi-criteria flexible job-shop scheduling with sequence-
dependent setup times-Variable neighborhood search approach (2011) Journal of
Ruiz-Vanoye, J.A., Diaz-Parra, O., Similarities between meta-heuristics algorithms
and the science of life (2011) Central European Journal of Operations Research, 19,
pp. 445-466;
Yang, X., (2008) Nature-inspired Metaheuristic Algorithm, , Luniver Press;
Abbass, H.A., MBO. Marriage in honey bees optimization a Haplometrosis Polygynous
Swarming Approach (2001) The Congress on Evolutionary Computation (CEC 2001), pp.
207-214., Seoul, Korea, vol. 1, May doi:10.1109/CEC.2001.934391;
Nakrani, S., Tovey, C., On honey bees and dynamic server allocation in internet
hosting centers (2004) Adaptive Behavior-Animals, Animats, Software Agents, Robots,
Adaptive Systems, 12 (13), pp. 223-240., 10.1177/105971230401200308;
Karaboga, D., An idea based on honey bee swarm for numerical optimization (2005)
Technical report-TR06, Erciyes University, , Engineering Faculty, Computer
Engineering Department;
Farmer, J.D., Packard, N., Perelson, A., The immune system, adaptation and machine
learning (1986) Proceedings of International Symposium on Physical Design, 22 (13),
pp. 187-204., 10.1016/0167-2789(81)90072-5;
Lloyd, J.E., Flashes of Photuris fireflies: Their value and use in recognizing
species (1969) Florida Entomologist, 52, pp. 29-35;
Vencl, F.V., Blasko, B.J., Carlson, A.D., Flash behavior of Female Photuris
versicolor fireflies in simulated courtship and predatory dialogues (1994) Journal
of Insect Behavior, 7 (6), pp. 843-858;
Yang, X., Firefly algorithms for multimodal optimization, Stochastic Algorithms:
Foundations and Applications (SAGA) 2009 (2009) Lecture Notes in Computer Sciences,
5792, pp. 169-178;
Lukasik, S., Zak, S., Firefly algorithm for continuous constrained optimization
task (2009) ICCCI, Lecture Notes in Artificial Intelligence, 5796, pp. 97-100;
Sayadi, M.K., Ramezanian, R., Ghaffari-Nasab, N., A discrete firefly meta-heuristic
with local search for makespan minimization in permutation flow shop scheduling
problems (2010) International Journal of Industrial Engineering Computations, 1,
pp. 1-10;
Shunk, D.L., Group technology provides organized approach to realizing benefits of
CIMS (1985) Industrial Engineering, 17, pp. 74-81;
673;
1613;
752;
Jayakrishnan Nair, G., Narendran, T.T., CASE a clustering algorithm for cell
36, pp. 157-179;
manufacturing cell formation (2006) Computers and Operations Research, 33 (8), pp.
2219-2245;
manufacturing cell formation (2009) Computers & Industrial Engineering, 57 (3), pp.
1008-1014;
Yang, M.S., Yang, J., Machine-Part cell formation in group technology using a
152;
Onwubolu, G.C., Redesigning job shops to cellular manufacturing systems (1998)
Research, 24, pp. 1221-1233
CORRESPONDENCE ADDRESS: Sayadi, M.K.; Department of Industrial Engineering, Iran
ISSN: 02786125
CODEN: JMSYE
SOURCE: Scopus
Haleh, H., Iranmanesh, H., Kor, H.
26421183600;26633066100;26633022400;
A new hybrid evolutionary algorithm for solving multi objective cellformation
problem
(2009) 2009 International Conference on Computers and Industrial Engineering, CIE
2009, art. no. 5223729, pp. 612-616. Cited 8 times.
77956120442&partnerID=40&md5=35c2b4be0b25565424976f05918a84e5
AFFILIATIONS: Department of Industrial and system Engineering, Isfahan University

of Technology, Isfahan, 84156-83111, Iran;
Tehran, Iran
ABSTRACT: In this research Hybrid Memetic Algorithm and Revised TOPSIS (HMA-
RTM)method is introduced as a new hybrid evolutionary algorithm for solving
multiobjective cell formation problem (CFP). The objectives are the minimization
ofboth total moves (intercellular as well as intracellular moves) and the cellload
Variation. Many researches have been made for Cell formation taking
intoconsideration multi objective. But there is limited works that
consideredPareto-optimum as a solution set. The HMA-RTM composed of Memetic
Algorithm andrevised TOPSIS method (RTM). RTM is used for Pareto based fitness
assignment.The propose model capable to providing decision maker with a wide range
of nondominated solutions. The efficiency of multi-objective HMA-RTM is illustrated
ona large a large-sized test problem taken from the literature. In last section,the
results are compared with a closely related result that is taken fromliterature. ©
2009 IEEE.
AUTHOR KEYWORDS: Cellular manufacturing system; Memetic algorithm; Multi-
objective; Pareto set; Revised TOPSIS
INDEX KEYWORDS: Cellular manufacturing systems; Memetic algorithms; Multi-
objective; Pareto set; Revised TOPSIS, Evolutionary algorithms; Industrial
engineering; Multiobjective optimization; Pareto principle, Cellular manufacturing
Implementation experiences andperformance improvements (1997) Int. J. Prod. Res.,
35, pp. 29-49;
(2000) Int. J. Prod. Res., 38, pp. 481-507;
approaches to multi-criteria cell design (2000) Int. J. Prod. Res., 38, pp. 1201-
1218;
problems in cellularmanufacturing (2004) Int. J. Prod. Res., 42, pp. 4119-4133;
Zitzler, E., Thiele, L., Multi-objective evolutionary algorithms: A comparative
case study and theStrength Pareto approach (1999) IEEE Trans. Evol. Comput., 3, pp.
257-271;
binary data matrices forgroup technology (1989) Int. J. Prod. Res., 27, pp. 1035-
1052;
goodness of blockdiagonal forms of binary matrices in group technology (1990) Int.
J. Prod. Res., 28, pp. 233-243;
for solving thecell formation problem in group technology (1991) J. Oper. Manage.,
10, pp. 44-72;
Gupta, Y.P., Gupta, M.C., Kumar, A., Sundaram C, A genetic algorithm-based approach
to cell composition and layout designproblems (1996) Int. J. Prod. Res., 34, pp.
447-482;
Dimopoulos C, Multi-objective optimization of manufacturing cell design (2006) Int.
J. Prod. Res., 44 (22), pp. 4855-4875;
Haupt, S.E., Haupt, R.L., (1998) Practical Genetic Algorithm, , second edition,
John Wiley;
Fonseca, C.M., Fleming, P.J., Genetic algorithms for multi-objective optimization:
Formulation, discussion and generalization (1993) Proceedings of the Fifth
International Conference on Genetic Algorithms, pp. 416-423., S. Forrest, editor,
San Mateo, California. University of Illinois atUrbana-Champaign, Morgan Kaufmann
Publishers;
Morse, J., Reducing the size of the nondominated set: Pruning by clustering (1980)
Computers and Operations Research, 7 (1-2), pp. 55-66
CORRESPONDENCE ADDRESS: Haleh, H.; Department of Industrial and system Engineering,
Isfahan University of Technology, Isfahan, 84156-83111, Iran; email:
[email protected]
ISBN: 9781424441365
ABBREVIATED SOURCE TITLE: Int. Conf. Comput. Ind. Eng CIE
SOURCE: Scopus
Sudhakara Pandian, R., Mahapatra, S.S.

24173456100;34881914000;
Cell formation with ordinal-level data using ART1-based neural networks
(2008) International Journal of Services and Operations Management, 4 (5), pp. 618-
43149089857&doi=10.1504%2fIJSOM.2008.018005&partnerID=40&md5=fa6a3276bc1df17f257fdf
aa3cad1d59
DOI: 10.1504/IJSOM.2008.018005
Technology Rourkela, Orissa, Pin-769 008, India
ABSTRACT: In Cell Formation Problem (CFP), the zero-one Part Machine Incidence
Matrix (PMIM) is the common input to any clustering algorithm. The output is
generated with two or more machine cells and corresponding part families. The major
demerit with such models is that real-life production factors such as operation
time, sequence of operations and lot size of the product are not accounted for. In
this paper, the operation sequence of the parts is considered to enhance the
quality of the solution. A neural network-based algorithm is proposed to solve the
CFP. The performance of the proposed algorithm is tested with example problems and
the results are compared with the existing methods found in the literature. The
results presented clearly shows that the performance of the proposed ART1-based
algorithm is comparable with the other methods. © 2008, Inderscience Publishers.
AUTHOR KEYWORDS: ART1; Cell Formation; CF; Grouping efficiency
organizing neural pattern recognition machine (1987) Comput Vision, Graph Image
Process, 37, pp. 54-115;
Research, 24 (5), pp. 1221-1233;
Chen, C.L., Cotruvo, N.A., Beak, W., A simulated annealing solution to the cell
formation process (1995) International Journal of Production Research, 33 (9), pp.
2601-2614;
Chu, C.H., Tsai, M., The array based clustering techniques (1999) International
resonance theory paradigm (1995) International Journal on Production Research, 33
(4), pp. 893-913;
Ganesh, K., Narendran, T.T., CLOSE: A heuristic to solve precedence-constrained
traveling salesman problem with delivery and pickup (2005) International Journal of
Ganesh, K., Narendran, T.T., CLOSE: A heuristic to solve vehicle routing problems
with delivery, pick-up and time windows (2007) International Journal of Services
and Operations Management, 3 (4), pp. 460-477;
Kao, Y., Moon, B., A unified group technology implementation using the back
Engineering, 20 (4), pp. 425-437;
Kaparthi, N., Suresh, C., Machine component cell formation in GT: A NN approach
King, J.R., Nakornchai, V., Machine-component group formation in group technology.
pp. 117-133;
Kumar, C.S., Chandrasekaran, M.P., Grouping efficacy: A quantitative criterion for
Mahapatra, S.S., SudhakaraPandian, R., Genetic cell formation using ratio level
Manufacturing Technology, , DOI 10.1007/s00170-007-1029-5;
multicellular flexible manufacturing system (2006) International Journal of
51 (2), pp. 53-57;
Moon, Y., Interactive activation and competition model for machine-part family
formation (1990) Proceedings of the International Conference on Neural Networks, 2,
pp. 667-670., Washington, DC;
Nair, J.G., Narendran, T.T., CASE: A clustering algorithm for cell formation with
sequence data (1998) International Journal on Production Research, 36 (1), pp. 157-
179;
Nair, J.G., Narendran, T.T., ACCORD: A bicriterion algorithm for cell formation
Research, 37, pp. 539-556;
Engineering, 18 (3), pp. 333-339;
Srinivasan, G., Narendran, T.T., A non hierarchical clustering algorithm for group
technology GRAFICS (1991) International Journal of Production Research, 29 (3), pp.
463-478;
Research, 28 (1), pp. 145-152;
machines, a fuzzy ART neural network approach (1999) International Journal on

(2004) International Journal of Advanced Manufacturing Technology, 23, pp. 916-924
CORRESPONDENCE ADDRESS: Mahapatra, S.S.; Department of Mechanical Engineering,
National Institute of Technology Rourkela, Orissa, Pin-769 008, India; email:
[email protected]
ISSN: 17442370
SOURCE: Scopus
Venkumar, P., Haq, A.N.

8931792000;8334109400;
Manufacturing cell formation using modified ART1 networks
26644432532&doi=10.1007%2fs00170-003-2048-
5&partnerID=40&md5=41f49e1f637683a5e621b061bcd6b960
DOI: 10.1007/s00170-003-2048-5
AFFILIATIONS: Department of Mechanical Engineering, Arulmigu Kalasalingam College
of Engineering, Krishnankoil - 626 190, Tamil Nadu, India;
Department of Production Engineering, National Institute of Technology, Tamil Nadu,
India
ABSTRACT: The primary objective of group technology (GT) is to enhance the
productivity in the batch manufacturing environment. The GT cell formation problem
is solved using modified binary adaptive resonance theory networks known as ART1.
The input to the modified ART1 is a machine-part incidence matrix comprised of the
binary digits "0" and "1". And the outputs are the list of part families and the
corresponding part list, machine cells and their corresponding list of machines,
and the number of exceptional elements. This method is applied to the known
benchmarked problems found in the literature and it is found to outperform other
algorithms in terms of minimizing the number of the exceptional elements. The
relative merits of using this method with respect to other known
algorithms/heuristics in terms of computational speed and consistency are presented
. © Springer-Verlag London Limited 2005.
AUTHOR KEYWORDS: Adaptive resonance theory networks; Cell formation; Group
technology
INDEX KEYWORDS: Adaptive systems; Algorithms; Flexible manufacturing systems; Group
technology; Heuristic methods; Productivity; Resonance, Adaptive resonance theory
networks; Batch manufacturing; Cell formation; Computational speed, Cellular
manufacturing
REFERENCES: Moon, Y., Interactive activation and competition model for machine-part
family formation (1990) Proc International Conference on Neural Networks, 2, pp.
667-670., Washington DC;
Kaparthi, S., Suresh, N.C., Machine-component cells formation in-group technology:
A neural network approach (1992) Int J Prod Res, 30 (6), pp. 1353-1367;
manufacturing systems (1991) J Intell Manuf, 2 (5), pp. 305-314;
organizing neural pattern recognition machine (1987) Comput Vision, Graph Image
Process, 37, pp. 54-115;
(1991) Int J Prod Res, 29 (2), pp. 343-356;
multiple routes and multiple objectives (2000) Int J Prod Res, 38 (2), pp. 385-395;

Carrie, A.S., Numerical taxonomy applied to group technology and plant Layout
(1973) Int J Prod Res, 24, pp. 399-416;
Gongaware, T.A., Ham, I., Cluster analysis applications for group technology-
manufacturing system (1981) Proc 9th North American Manufacturing Research
Conference (NAMRC) on Society of Manufacturing Engineers, pp. 503-508;
Chandrasekaran, M.P., Rajagopalan, R., MODROC-an extension of rank orders
Chandrasekaran, M.P., Rajagopalan, R., Zodiac-an algorithm for concurrent formation
of part-families and machine cells (1987) Int J Prod Res, 25, pp. 835-850;
Leskowsky, Z., Logan, L., Vannelli, A., Group technology decision aids in an expert
system for plant layout, in modern production management system (1987) Proc, IFIP
TC 5/WG 5-7 Working Conferences on Advances in Production Management System, pp.
561-585;
Kusiak, L.H., Neural computing-based design of components for cellular
Chandrasekaran, M.P., Rajagopalan, R., Group ability: An analysis of the properties
1052;
Srinivasan, G., Narendran, I.T., Mahadevan, B., An assignment model for the part-
families problem in Group Technology (1990) Int J Prod Res, 28 (2), pp. 145-152;
Kiang, M.Y., Extending the Kohonen self organizing map networks for clustering
analysis (2001) Comput Stat Data Anal, 38, pp. 161-180;
formation in cellular manufacturing system (2001) Int J Adv Manuf Technol, 18, pp.
591-597;
Hsien, C., Hayya, J.C., A fuzzy clustering approach to manufacturing cell formation
(1991) Int J Prod Res, 29 (7), pp. 1475-1487;
Crama, C., Oostem, M., Models for machine part grouping in cellular Manufacturing
(1996) Int J Prod Res, 34 (6), pp. 1693-1713;
665;
561-569;
Schrage, L., (1984) Linear, Integer and Quadratic Programming with UNDO, ,
Scientific Press, Palo Alto, CA;
Mak, K.L., Wong, Y.S., Wang, X.X., An adoptive genetic algorithm for manufacturing
Lozana, S., Onieva, L., Larraneta, J., Teba, J., A neural network approach to part-
machine grouping in GT manufacturing (1993) Proc Robotics, Mectronics and
Manufacturing Systems, pp. 619-624., Takamori T. Tsuchiya K (eds) North-Holland,
Amsterdam
CORRESPONDENCE ADDRESS: Haq, A.N.; Department of Production Engineering, National
Institute of Technology, Tamil Nadu, India; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Mahdavi, I., Kaushal, O.P., Chandra, M.
16417373200;57213055697;7102969007;
Graph-neural network approach in cellular manufacturing on the basis of a binary
system
27 times.
0035840759&doi=10.1080%2f0020754011005914&partnerID=40&md5=9b9a60dfe58a7da9ecc88b3b
bfbba1ce
DOI: 10.1080/0020754011005914
AFFILIATIONS: Department of Industrial Engineering, College of Technology,
Mazandaran University of Science and Technology, PO Box 734, Babol, Iran;
Department of Production Engineering, College of Technology, G.B. Pant University
of Agriculture and Technology, Pantnagar - 263145, India;
Department of Mathematics, Statistics and Computer Science, College of Basic
Sciences and Humanities, G.B. Pant University of Agriculture and Technology,
Pantnagar - 263145, India
ABSTRACT: In the past several years, many studies have been carried out on cellular
manufacturing. Group technology is a manufacturing philosophy in which similar
parts are identified and grouped together to take advantage of their similarities
in manufacturing and design. The main problem in the development of cellular
manufacturing is that of cell formation. In this paper, a graph-neural network
approach is given for cell formation problems in group technology. Effort has been
made to develop an algorithm that is more reliable than conventional methods. A
graph-neural network has the advantages of fast computation and the ability to
handle large scale industrial problems without the assumption of any parameter and
the least exceptional elements in the presence of bottleneck machines and/or
bottleneck parts. Two examples from the literature have been solved to demonstrate
the advantages of the algorithm.
INDEX KEYWORDS: Algorithms; Binary sequences; Computational methods; Graph theory;
Machine design; Matrix algebra; Neural networks, Binary system; Bottleneck machine;
Bottleneck parts; Graph-neural network, Cellular manufacturing
REFERENCES: Arvindh, B., Irani, S.A., Principal component analysis for evaluating
the feasibility of cellular manufacturing without initial machine-part clustering
Burbidge, J.L., Production flow analysis (1963) Production Engineer, 42, p. 472;
152;
Burke, L.I., Kamal, S., Fuzzy ART for cellular manufacturing (1992) Intelligent
Engineering Systems Through Artificial Neural Networks, 2, pp. 779-784., edited by
Dagli et al. (New York: ASME Press);
recognition: Attentions, memory consolidation, and amnesia (1986) Brain Structure,
Learning, and Memory, , edited by R. N. Davis and E. Wegman (AAAS Symposium
Series);
Carpenter, G.A., Grossberg, S., ART2: Self-organization of stable category
recognition codes for analog input patterns (1987) Applied Optics, 26, pp. 4919-
4930;
Carpenter, G.A., Grossberg, S., The ART of adaptive pattern recognition by a self-
organizing neural network (1988) Computer, 21 (3), pp. 77-88;
pp. 293-318;
Knowledge Based Systems and Neural Networks: Techniques and Applications, , edited
by R. Sharda, J. Y. Cheung and W. J. Cochran (New York: Elsevier);
Dagli, C., Sen, C.F., ART1 neural network approach to large scale group technology
problems (1992) Robotics and Manufacturing: Recent Trends in Research, Education
and Applications, 4, pp. 787-792., (New York: ASME Press);
machine-component grouping decisions in the design of cellular manufacturing system
Harary, F., (1972) Graph Theory, p. 10., (India: Addison-Wesley);
Kaparthi, S., Suresh, N.C., A neural system for shape-based classification and
coding of rotational parts (1991) International Journal of Production Research, 29,
pp. 1771-1784;
pp. 1353-1367;
117-133;
Lee, S., Wang, H.P., Manufacturing cell formation: A dual-objective simulated
annealing approach (1992) International Journal of Advanced Manufacturing
Liao, T.W., Chen, L.J., An evaluation of ART1 network models for GT part family and
1757-1766;
51, pp. 53-57;
Mitrofanov, S.P., (1966) The Scientific Principles of Group Technology, , (Boston
Spa, Yorkshire, UK: National Lending Library Translation);
Moon, Y.B., Forming part-families for cellular manufacturing: A neural network
278-291;
and similarity coefficient to the GT machine cell formation problem (1989)
Purcheck, G.F.K., A mathematical classification as a basis for design of group
567-579;
Research, 32, pp. 2149-2158;
Srinivasan, G., Narendran, T.T., Grafics-A non hierarchical clustering algorithm
463-478;
Research, 29, pp. 463-478;
Steudel, H.J., Ballukur, A., A dynamic programming based heuristic for machine
Research, 67, pp. 405-417;
Viswanathan, S., Configuring cellular manufacturing systems. A quadratic integer
ISSN: 00207543
SOURCE: Scopus
Srinivasan, G., Zimmers, E.W.

36136249100;6701346926;
Fractional cell formation - issues and approaches
0032297618&partnerID=40&md5=8cf917591e99e550c7dd7e74600e63d1
AFFILIATIONS: Indust. Eng. and Management Division, Department of Humanities,

Indian Institute of Technology, Madras, India;
Department of Industrial Engineering, Lehigh University, Bethlehem, PA, United
States
ABSTRACT: This paper addresses fractional cell formation in Group Technology
implementation, where part of the production facility is redesigned into
manufacturing cells. The fractional cell formation issue is important in
manufacturing cell design, because it may not be possible to economically convert
the entire facility to manufacturing cells. The authors discuss the issues in
modeling fractional cell formation problems and they develop efficient algorithms
to group the facilities into manufacturing cells and a remainder cell. Algorithms
are tested using a variety of matrices including those from real-life situations to
demonstrate the potential applicability of the proposed approach. Significance:
Fractional cell formation is an emerging concept that is useful to minimize inter-
cell moves in Cellular manufacturing applications. The algorithms and methods
proposed in this paper have the potential to reduce the cost of implementation
while substantially increasing the product throughput times.
AUTHOR KEYWORDS: Cellular manufacturing; Fractional cell formation; Heuristics;
Remainder cells
INDEX KEYWORDS: Algorithms; Cost effectiveness; Group technology; Heuristic
methods; Mathematical models; Matrix algebra; Plant layout; Production engineering;
Reengineering; Throughput, Fractional cell formation, Cellular manufacturing
REFERENCES: Boctor, F.F., A Linear Formulation of the Machine-part Cell Formation
Burbidge, J.L., Production Flow Analysis (1971) Production Engineer, 50, pp. 139-
152;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC - An Algorithm for Concurrent
Formation of Part Families and Machine Cells (1987) International Journal of
Groover, M.P., Zimmers Jr., E.W., (1984) CAD/CAM : Computer-Aided Design and
Manufacturing, , Prentice Hall, Inc, Englewood Cliffs, New Jersey;
Greene, T.J., Sadowski, R.P., Cellular Production Control (1983) Journal of
Murthy, Ch.V.R., Srinivasan, G., Fractional Cell Formation in Group Technology
Srinivasan, G., Narendran, T.T., GRAFICS - A Nonhierarchical Clustering Method for
the Group Technology Problem (1991) International Journal of Production Research,
29, pp. 463-478;
Venugopal, V., Narendran, T.T., Cell Formation in Manufacturing Systems Through
Simulated Annealing: An Experimental Evaluation (1992) European Journal of
Wemmerlov, U., Hyer, N.L., Cellular Manufacturing in the US Industry - A Survey of
Users (1989) International Journal of Production Research, 27, pp. 1530-1551;
Wemmerlov, U., Johnson, D.J., Cellular Manufacturing at 46 User Plants:
Implementation Experiences and Performance Improvements (1997) International
CORRESPONDENCE ADDRESS: Srinivasan, G.; Indust. Eng. and Management Division,
Department of Humanities, Indian Institute of Technology, Madras, India
ISSN: 10724761
CODEN: IJIEF
SOURCE: Scopus
Onwubolu, G.C.
7003469218;
Redesigning jobshops to cellular manufacturing systems
(1998) Integrated Manufacturing Systems, 9 (6), pp. 377-382. Cited 8 times.
0032291721&doi=10.1108%2f09576069810238763&partnerID=40&md5=91f03ec04bcf7ad3de61029
346e29124
DOI: 10.1108/09576069810238763
AFFILIATIONS: Natl. Univ. of Sci. and Technology, Bulawayo, Zimbabwe
ABSTRACT: Grouping parts into families which can be produced by a cluster of
machine cells is the cornerstone of cellular manufacturing, which in turn is the
building block for flexible manufacturing systems. Cellular manufacturing is a
group technology (GT) concept that has recently attracted the attention of
manufacturing firms operating in a jobshop environment to consider redesigning
their manufacturing systems so as to take advantage of increased throughput, and
reductions in work-in-progress, set-up time, and lead times; leading to product
quality and customer satisfaction. Presents a similarity order clustering technique
for the machine cell formation problem. The procedure is compared with many
existing procedures using eight well-known problems from the literature. The
results show that the proposed procedure, which is attractive due to its
simplicity, compares well with existing procedures and should be useful to
practitioners and researchers.
INDEX KEYWORDS: Flexible manufacturing systems; Group technology; Just in time
production; Problem solving; Quality assurance; Scheduling; Systems analysis; Value
engineering, Order clustering methods; Redesigning jobshops, Cellular manufacturing
(1), pp. 101-113;
Askin, R.G., Cresswell, J.H., Goldberg, J.B., Vakharia, A.J., A Hamiltonian path
Ballakur, A., Steudel, H.J., A within-cell utilisation based heuristic for
Research, 25 (5), pp. 639-665;
Bitran, G.R., Hax, A.C., On the design of hierarchical production planning systems
(1981) Decision Sciences, 8, pp. 717-743;
Burbridge, J.L., (1975) The Introduction of Group Technology, , John Wiley, New
York, NY;
Chan, H.M., Milner, Direct clustering algorithm for group formation in cellular
Research, 24 (5), pp. 1221-1233;
Research, 24 (2), pp. 451-464;
Hindi, K.S., Hamam, Y.M., Solving the part families problem in discrete parts
manufacture by simulated annealing (1994) Production Planning and Control, 5, pp.
160-164;
18, pp. 213-232;
117-133;
1715-1728;
387-397;
Kusiak, A., A generalised group technology concept (1987) International Journal of
Lenstra, Clustering a data array and the travelling salesman problem (1974)
51, p. 53;
reorganisation by a clustering technique (1972) Operation Research, 20, pp. 993-
1009;
MacQueen, J.B., Some methods for classification and analysis of multivariate
observations (1967) Proceedings of the Fifth Symposium on Mathematical Statistics
and Probability, 1, p. 281., University of California, Berkeley;
Mulvey, J.M., Crowder, H.P., Clustering analysis: An application of Lagrangian
Ravikumar, K., Kusiak, A., Vannelli, A., Grouping of parts and components in
flexible manufacturing systems (1986) European Journal of Operational Research, 24,
pp. 387-397;
Control, , Chapman & Hall, London;
Research, 28 (1), pp. 145-152;
pp. 1693-1713;
Tabucanon, M.T., Ojha, R., ICRMa - A heuristic approach for intercell flow
models (1994) International Journal of Production Research, 32, pp. 2105-2116;
user (1989) International Journal of Production Research, 27, pp. 1511-1530;
Journal of Production Research, 35 (1), pp. 29-49
CORRESPONDENCE ADDRESS: Onwubolu, G.C.; Natl. Univ. of Sci. and Technology,
Bulawayo, Zimbabwe
PUBLISHER: Emerald Group Publishing Ltd.
ISSN: 09576061
CODEN: IMSYE
ABBREVIATED SOURCE TITLE: Integr Manuf Syst
SOURCE: Scopus
Chen, S.-J., Cheng, C.-S.

57029518000;7404796667;
A neural network-based cell formation algorithm in cellular manufacturing
times.
0001703798&doi=10.1080%2f00207549508930150&partnerID=40&md5=ea997bd52c035e851d70068
2d1eca4d4
DOI: 10.1080/00207549508930150
AFFILIATIONS: Department of Industrial Engineering, YUAN-ZE Institute of
Technology, 135 Yuan-Tung Rd, Nei-Li, China
ABSTRACT: The Adaptive Resonance Theory (ART) neural network is a novel method for
the cell formation problem in group technology (GT). The advantages of using an ART
network over other conventional methods are its fast computation and the
outstanding ability to handle large scale industrial problems. One weakness of this
approach is that the quality of a grouping solution is highly dependent on the
initial disposition of the machine-part incidence matrix especially in the presence
of bottleneck machines and/or bottleneck parts. The effort of this paper has been
aimed at alleviating the above mentioned problem by the introduction of a set of
supplementary procedures. The advantages of the supplementary procedures are
demonstrated by 40 examples from the literature. The results clearly demonstrate
that our algorithm is more reliable and efficient in cases of ill-structured data.
© 1995 Taylor and Francis Group, LLC.
1100;
2097-2116;
Burbidge, J.L., (1975) The Introduction of Group Technology, , London: Heinemann);
Engineering Systems through Artificial Neural Networks, pp. 779-784., 2, Dagli et
al. (eds) (New York: ASME Press;
recognition: Attention, memory consolidation, and amnesia (1986) Brain Structure
Learning and Memory, , R. N. Davis and E. WegmanAAAS Symposium Series;
4930;
Carpenter, G.A., Grossberg, S., Rosen, D.S., Fuzzy ART: Fast stable learning and
Research, 24, pp. 451-464;
OMEGA International Journal of Management Science, 20, pp. 493-501;
pp. 95-100;
28, pp. 1417-1433;
Knowledge Based Systems and Neural Networks, , Techniques and Applications, R.
Sharda et al. (eds) (New York: Elsevier;
Dagli, C., Sen, C.-F., ARTI neural network approach to large scale group technology
and Applications, 4, pp. 787-792., New York: ASME Press;
Gongaware, T., Ham, I., Cluster analysis applications for group technology
manufacturing systems (1981) Proceedings of the 9Th National North American
Metalworking Research Conference, , (Dearborn, Minnesota: SME);
Hush, D.R., Horne, B.G., Progress in supervised neural network (1993) IEEE Signal
Processing Magazine, pp. 8-39., January;
29, pp. 1771-1784;
pp. 1353-1367;
Research, 18, pp. 213-232;
King, J.R., Nakornchai, V., Machine-component group formation in group technology-
117-133;
1728;
2633-2646;
Kusiak, A., (1992) Intelligent Design and Manufacturing, , (ed.), New York: Wiley;
Ljao, T.W., Chen, L.J., An evaluation of ARTI network models for GT part family and
Lippmann, R.P., An introduction to computing with neural nets (1987) IEEE ASSP
Magazine, pp. 36-54;
McCormick, W., Schweitzer, P.J., White, T.W., Problem decomposition and data
Moon, Y.B., Forming part-machine families for cellular manufacturing: A
neuralnetwork approach (1990) International Journal of Advanced Manufacturing
Seifoddini, H., Improper machine assignment in machine-component grouping in group
technology (1986) Proceedings of the Fall Industrial Engineering Conference, pp.
406-409., (Boston, Massachusetts: AIIE;
Seifoddini, H., Wolfe, P.M., (1986) Application of the Similarity Coefficient
Method in Group Technology. IIE Transactions, 18, pp. 271-277;
Journal of Production Research, 27, pp. 1161-1165., a;
Seifoddint, H., A probabilistic approach to machine cell formation in group
technology (1989) Proceedings of the International Industrial Engineering
Conference and Societies’ Manufacturing and Productivity Symposium Proceedings, pp.
625-629., Toronto, Canada;
426;
Research, 28, pp. 145-152;
Waghodekar, P.H., Shau, S., Machine component cell formation in group technology:
MACE (1984) International Journal of Production Research, 22, pp. 937-948
CORRESPONDENCE ADDRESS: Chen, S.-J.; Department of Industrial Engineering, YUAN-ZE
Institute of Technology, 135 Yuan-Tung Rd, Nei-Li, China
ISSN: 00207543
SOURCE: Scopus
Chen, S.-J., Cheng, C.-S.

57029518000;7404796667;
A neural network-based cell formation algorithm in cellular manufacturing
times.
84952536237&doi=10.1080%2f00207549508930150&partnerID=40&md5=92b093589083364d8f969a
74084cf74e
DOI: 10.1080/00207549508930150
AFFILIATIONS: Department of Industrial Engineering, YUAN-ZE Institute of
Technology, 135 Yuan-Tung Rd, Nei-Li, China
ABSTRACT: The Adaptive Resonance Theory (ART) neural network is a novel method for
the cell formation problem in group technology (GT). The advantages of using an ART
network over other conventional methods are its fast computation and the
outstanding ability to handle large scale industrial problems. One weakness of this
approach is that the quality of a grouping solution is highly dependent on the
initial disposition of the machine-part incidence matrix especially in the presence
of bottleneck machines and/or bottleneck parts. The effort of this paper has been
aimed at alleviating the above mentioned problem by the introduction of a set of
supplementary procedures. The advantages of the supplementary procedures are
demonstrated by 40 examples from the literature. The results clearly demonstrate
that our algorithm is more reliable and efficient in cases of ill-structured data.
© 1994 Taylor & Francis Group, LLC.
1100;
2097-2116;
Burbidge, J.L., (1975) The Introduction of Group Technology, , London: Heinemann);
Engineering Systems through Artificial Neural Networks, pp. 779-784., 2, Dagli et
al. (eds) (New York: ASME Press;
recognition: Attention, memory consolidation, and amnesia (1986) Brain Structure
Learning and Memory, , R. N. Davis and E. WegmanAAAS Symposium Series;
4930;
Carpenter, G.A., Grossberg, S., Rosen, D.S., Fuzzy ART: Fast stable learning and
Research, 24, pp. 451-464;
OMEGA International Journal of Management Science, 20, pp. 493-501;
pp. 95-100;
28, pp. 1417-1433;
Knowledge Based Systems and Neural Networks, , Techniques and Applications, R.
Sharda et al. (eds) (New York: Elsevier;
Dagli, C., Sen, C.-F., ARTI neural network approach to large scale group technology
and Applications, 4, pp. 787-792., New York: ASME Press;
Gongaware, T., Ham, I., Cluster analysis applications for group technology
manufacturing systems (1981) Proceedings of the 9Th National North American
Metalworking Research Conference, , (Dearborn, Minnesota: SME);
Hush, D.R., Horne, B.G., Progress in supervised neural network (1993) IEEE Signal
Processing Magazine, pp. 8-39., January;
29, pp. 1771-1784;
pp. 1353-1367;
Research, 18, pp. 213-232;
King, J.R., Nakornchai, V., Machine-component group formation in group technology-
117-133;
1728;
2633-2646;
Kusiak, A., (1992) Intelligent Design and Manufacturing, , (ed.), New York: Wiley;
Ljao, T.W., Chen, L.J., An evaluation of ARTI network models for GT part family and
Lippmann, R.P., An introduction to computing with neural nets (1987) IEEE ASSP
Magazine, pp. 36-54;
McCormick, W., Schweitzer, P.J., White, T.W., Problem decomposition and data
Moon, Y.B., Forming part-machine families for cellular manufacturing: A

neuralnetwork approach (1990) International Journal of Advanced Manufacturing
Seifoddini, H., Improper machine assignment in machine-component grouping in group
technology (1986) Proceedings of the Fall Industrial Engineering Conference, pp.
406-409., (Boston, Massachusetts: AIIE;
Seifoddini, H., Wolfe, P.M., (1986) Application of the Similarity Coefficient
Method in Group Technology. IIE Transactions, 18, pp. 271-277;
Journal of Production Research, 27, pp. 1161-1165., a;
Seifoddint, H., A probabilistic approach to machine cell formation in group
technology (1989) Proceedings of the International Industrial Engineering
Conference and Societies’ Manufacturing and Productivity Symposium Proceedings, pp.
625-629., Toronto, Canada;
426;
Research, 28, pp. 145-152;
Waghodekar, P.H., Shau, S., Machine component cell formation in group technology:
MACE (1984) International Journal of Production Research, 22, pp. 937-948
CORRESPONDENCE ADDRESS: Chen, S.-J.; Department of Industrial Engineering, YUAN-ZE
Institute of Technology, 135 Yuan-Tung Rd, Nei-Li, China
ISSN: 00207543
SOURCE: Scopus
Uthayakumar, M., Adinarayanan, A., Prabhakaran, G., Slota, A., Zajac, J.

55220479900;57193775428;6602999346;21733252600;7101809949;
Arrangement of machine cell in cellular manufacturing system: A PSO approach
(2018) Journal of Advanced Research in Dynamical and Control Systems, 10 (5), pp.
247-257.
85047991137&partnerID=40&md5=676ec624767813d86b364dca8838ea6d
AFFILIATIONS: Kalasalingam University, Krishnankoil, India;

KCG College of Technology, Chennai, India;
Cracow University of Technology, Krakow, Poland
ABSTRACT: While designing the cellular manufacturing system (CMS), cell formation
(CF) plays the major role since it was the first step. The cell formation problem
attempted in this paper is about the formation of machine cell with the goal of
minimizing the grass intercellular move and grass cell load variations. In this
problem, number of components, sequence of operations, operation time, equipments
capacity, and machine workload are considered as parameters. For the grouping of
machineries in a considered problem, one of the meta heuristic search approaches
Particle Swarm Optimization (PSO) algorithm is proposed. In order to illustrate the
behaviour of the proposed PSO approach, 40 equipments and 100 part types are
considered. The outcome acquired from particle swarm optimization is compared with
the result obtained from the Genetic Algorithm (GA) and ant colony system (ACS) in
the literature. © 2018, Institute of Advanced Scientific Research, Inc. All rights
reserved.
AUTHOR KEYWORDS: Cell formation; Cell load variations; Cellular manufacturing
system; Intercellular moves; Particle swarm optimization
REFERENCES: Anvari, M., Mehrabad, M.S., Barzinpour, F., Machine-part cell formation
using a hybrid particle swarm optimization (2010) Int J Advmanuf Technol, 47 (5-8),
pp. 745-754;
multiobjective parametric programming (2009) Math.Comput.Modelling, 50 (3-4), pp.
407-420;
Basu, A., Hyer, N., Shtub, A., An expert system base on approach to manufacturing
cell design (1987) Int. J. Prod. Res, 25 (5), pp. 639-665;
Black, J., Cellular Manufacturing Systems Reduce Setup Time, Make Small Lot
Production Economical (1983) Industrial Engineering, 15 (11), pp. 36-48;
Burbidge, L., Production flow analysis (1963) Prod. Eng, 42 (12), pp. 742-752;
Carlo, A., Sebastian, L., A particle swarm optimization algorithm for part-machine
474;
part grouping and cell layout problems (2006) Int. J. Comput. Integrated Manufact.
Syst, 22, pp. 217-238;
Chen, Y.M., Lin, C.T., A particle swarm optimization approach to optimize component
placement in printed circuit board assembly (2007) Int.J. Adv. Manuf. Technology,
35 (5-6), pp. 610-620;
Chow, W., Hawaleshka, O., A novel machine grouping and knowledge based approach for
cellular manufacturing (1993) Eur. J. Op. Res, 69 (3), pp. 357-372;
(2011) Comp. Ind. Eng, 60 (1), pp. 7-15;
Ghosh, S., Sarkar, B., Sanyal, S., Saha, J., Automated Maintenance Approach for
Industrial Machineries by Soft Computing Techniques at Offline Monitoring Process
(2009) Journal of Mechanical and Industrial Engineering, 3 (1), pp. 59-68;
Hassan, R., Reza, M., Mahdi, Z., Solving a dynamic virtual cell formation problem
by linear programming embedded particle swarm optimization algorithm (2011) Applied
Soft Computing, 11, pp. 3160-3169;
Heragu, S., (1997) Facilities Design, , PWS publishing company, Boston;
Karaboga, D., Basturk, B.A., Powerful and efficient algorithm for numerical
function optimization, artificial bee colony (ABC) algorithm (2007) J. Glob.Optim,
39 (3), pp. 171-459;
Karaboga, D., (2005) An Idea Based on Honey Bee Swarm for Numerical Optimization, ,
Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey;
IEEE International Conference on Neural Networks, pp. 1942-1948;
King, J.R., Machine-component grouping in production flow analysis, an approach
using a rank order-clustering algorithm (1980) Int. J. Prod. Res, 18 (2), pp. 213-
232;
splitting and multiple units of the same machine (1995) Int. J. Prod. Res, 33 (3),
pp. 675-693;
Logendran, R., A workload based model for minimizing total inter cell and intra
cell moves in cellular manufacturing (1990) Int. J. Prod. Res, 28 (5), pp. 913-925;
Mahdavi, I., Aalae, A., Paydar, M.M., Solimanpur, M., Designing a mathematical
pp. 1014-1025;
Murugan, M., Selladurai, V., Formation of Machine Cells/Part Families in Cellular
Manufacturing Systems Using an ART-Modified Single Linkage Clustering Approach-A
Comparative Study (2011) Jordan Journal of Mechanical and Industrial Engineering, 5
(3), pp. 199-212;
Naadimuthu, G., Gultom, P., Lee, E.S., Fuzzy clustering in cell formation with
3137-3147;
Prabhakaran, G., Muruganandam, A., Asokan, P., Girish, B.S., Machine cell formation
J. Adv.Manufact. Technol, 25 (9), pp. 1013-1019;
Prabhakaran, G., (2001) Clustering and Machine Cell Formation for Cellular
Manufacturing Systems, , Ph.D. thesis, Bharathidasan University, Tiruchirappalli,
Tamil Nadu, India;
Shi, Y., Liu, H., Gao, L., Zhang, G., Cellular particle swarm optimization (2011)
Information Sciences, 181 (20), pp. 4460-4493;
Shi, Y.H., Eberhart, R.C., A modified particle swarm optimizer (1998) IEEE
International Conference on Evolutionary Computation;
Shi, Y.H., Eberhart, R.C., Parameter selection in particle swarm optimization
(1998) Annual Conference on Evolutionary Programming;
manufacturing using ant-colony-based optimization (2010) Int J Adv Manuf. Technol,
50 (9), pp. 1135-1144;
Sudhakarapandian, R., Mahapatra, S.S., Manufacturing cell formation with production
data using neural networks (2009) Computers & Industrial Engineering, 56 (4), pp.
1340-1347;
Solving a dynamic cell formation problem using metaheuristics (2005) Appl.Mathemat.
Comp, 170 (2), pp. 761-780;
Tavakkoli-Moghaddam, R., Javadian, N., Khorrami, A., Gholipour-Kanani, Y., Design
cellular manufacturing system (2010) Expert Systems with Applications, 37 (3), pp.
2661-2669;
Appl. Math. Comput, 184 (2), pp. 721-728;
organizing map networks in cellular manufacturing system (2006) Int. J. Prod. Res,
20 (15), pp. 4257-4271;
component grouping problems with multiple objectives (1992) Comp. Ind. Eng, 22, pp.
469-480;
simulated annealing, an experimental evaluation (1992) Eur. J. Op. Research, 63
(3), pp. 409-422;
Victor Raj, M., Saravana Sankar, S., Ponnambalam, G., Particle swarm optimization
algorithm to maximize assembly efficiency (2012) Int. J. Adv.Manuf. Technol, 59
(5), pp. 719-736;
Wu, X., Chao-Hsien, C., Wang, Y., Yan, W.A., Genetic algorithm for cellular
manufacturing design and layout (2007) Eur. J. Op. Res, 181 (1), pp. 156-167
ISSN: 1943023X
SOURCE: Scopus
Aghajani, A., Didehbani, S.A., Zadahmad, M., Seyedrezaei, M.H., Mohsenian, O.

36871600200;56304888600;54788565900;56305180600;56304850200;
A multi-objective mathematical model for cellular manufacturing systems design with
probabilistic demand and machine reliability analysis
84911002290&doi=10.1007%2fs00170-014-6084-
0&partnerID=40&md5=79e16c72841c63ad1de0bcb76467521f
DOI: 10.1007/s00170-014-6084-0
AFFILIATIONS: Department of Computer Engineering, Ilkhchi Branch, Islamic Azad
University, PO BOX 53558114418, Ilkhchi, Iran;
Department of Industrial Engineering, Payame Noor University, PO BOX 19395-3697,
Tehran, Iran;
Department of Mechanical and Industrial Engineering, University of Illinois at
Chicago, Chicago, IL 60607-7022, United States
ABSTRACT: This paper presents a dynamic multi-objective mixed integer mathematical
model for cell formation problem with probabilistic demand and machine reliability
analysis, where the total system costs, machine underutilization cost, and maximum
system failure rate over the planning time periods are to be minimized
simultaneously. The total system cost objective function calculates machine
operating, internal part production, intercellular material handling, and
subcontracting costs. Since in this type of problems, objectives are in conflict
with each other, so finding an ideal solution (a solution that satisfies all
objectives simultaneously) is not possible. Therefore, this study uses the
augmented ε-constraint method (to solve small size problems) and a nondominated
sorting genetic algorithm (NSGAII) (to solve large size problems) to find the
Pareto optimal frontier that decision makers can select her/his preferred solution.
Numerical examples will be solved to demonstrate the efficiency of the proposed
algorithm. © 2014, Springer-Verlag London.
AUTHOR KEYWORDS: Dynamic probabilistic demand; Exponential distribution; Group
technology; Machine availability; Machine reliability; Multi-objective genetic
algorithm; Multi-objective mathematical model; Pareto optimal; Poisson
distribution
INDEX KEYWORDS: Cellular manufacturing; Cost benefit analysis; Costs; Genetic
algorithms; Group technology; Manufacture; Materials handling; Pareto principle;
Poisson distribution; Probability distributions; Problem solving; Reliability;
Reliability analysis, Exponential distributions; Machine availability; Machine
reliability; Multi objective; Multi-objective genetic algorithm; Pareto-optimal,
Mathematical models
REFERENCES: Wemmerlov, U., Hyer, N., Cellular manufacturing in the US industry: a
Song, S.-J., Choi, J.-H., Integrated autonomous cellular manufacturing: a new
concept for the 21st century (2001) Int J Manuf Technol Manag, 3, pp. 293-307;
Lockwood, W., Mahmoodi, F., Mosier, C., Scheduling unbalanced cellular
manufacturing systems with lot splitting (2000) Int J Prod Res, 38, pp. 951-966;
integrating the cell design and production planning decision (2000) Int J Prod Res,
38, pp. 3953-3971;
systems (2001) Integr Manuf Syst, 12, pp. 275-284;
Res, 171, pp. 1051-1070;
Chen, M., Cao, D., A robust cell formation approach for varying product demands
(2005) Int J Prod Res, 49 (8), pp. 1587-1605;
environment using Tabu search (2004) Comput Ind Eng, 46, pp. 571-588;
genetic- algorithm-based heuristic (2006) Int J Prod Res, 44 (12), pp. 2421-2444;
Oper Res, 192, pp. 414-428;
and worker assignment (2010) Comput Math with Appl;
Khaksar-Haghani, F., Kia, K., Mahdavi, I., Kazemi, M., A genetic algorithm for
solving a multi-floor layout design model of a cellular manufacturing system with
alternative process routings and flexible configuration (2013) Int J Adv Manuf
Technol, 66 (5-8), pp. 845-865;
manufacturing systems (2014) Int J Adv Manuf Technol;
manufacturing using ant-colony-based optimization (2010) Int J of Adv Manuf
Technol, 50 (9-12), pp. 1135-1144;
Moslemipour, G., Lee, T.S., Rilling, D., A review of intelligent approaches for
designing dynamic and robust layouts in flexible manufacturing systems (2012) Int J
Chang, C., C., Wu, T., H., Wu, C.,W (2013) An efficient approach to determine cell
systems. Computers & Industrial Engineering, 66 (2), pp. 438-450;
Jeon, G., Leep, H.R., Parsei, H.R., Cellular manufacturing system based on new
(1998) Comput Ind Eng, 34 (1), pp. 21-36;
Yazhau, J., Molin, W., Zhixin, J., Probability failures of machining center
failures (1995) Reliab Eng Syst Saf, 50 (1), pp. 121-125;
Dai, Y., Zhou, Y.-F., Jia, Y.Z., Distribution of time between failures of machining
center based on type I censored data (2003) Reliab Eng Syst Saf, 79 (3), pp. 377-
379;
Seifoddini, S., Djassemi, M., The effect of reliability consideration on the
application of quality index (2001) Comput Ind Eng, 40 (1-2), pp. 65-77;
Diallo, M., Perreval, H., Quillot, A., A Manufacturing cell design with flexible
routing capability in presence of unreliable machines (2001) Int J Prod Econ, 74
(1-3), pp. 175-182;
Das, K., Lashkari, R.S., Sengupta, S., Machine reliability and preventive
maintenance planning for cellular manufacturing systems (2007) Eur J Oper Res, 183,
pp. 162-180;
machine reliability analysis in a CMS design (2008) Comput Ind Eng, 54, pp. 12-33;
Saxena, L.K., Jain, P.K., Dynamic cellular manufacturing systems design a
comprehensive model (2011) Int J Adv Manuf Technol, 53 (1), pp. 11-34;
multiple routes and multiple objectives (2000) Int J Prod Res, 38 (2), pp. 385-395;
Suresh, N.C., Slomp, J., A multi-objective procedure for labor assignments and
groping in capacitated cell formation problem (2001) Int J Prod Res, 39, pp. 4103-
4131;
Arzi, Y., Bukchin, J., Masin, M., An efficient frontier approach for the design of
cellular manufacturing systems in a lumpy demand environment (2001) Eur J Oper Res,
134, pp. 346-364;
Khoo, L.P., Lee, S.G., Yen, X.F., Multi-objective optimization of machine cell
layout using genetic algorithm (2003) Int J Comput Int Manuf, 16, pp. 140-155;
(2003) Prod Plann & Control, 14 (5), pp. 437-446;
Lei, D., Wu, Z.H., Tabu search for multiple-criteria manufacturing cell design
AramoonBajestani, M., Rabbani, M., Rahimi-Vahed, A.R., BaharianKhoshkhou, G., A
Oper Res;
cell formation problem with capital constraints (2008) Adv Eng Softw, 40 (4), pp.
268-273;
Javadian, N., Aghajani, A., (2011) A multi-objective integrated cellular
manufacturing systems design with dynamic system reconfiguration,International
Journal of Advanced Manufacturing Technology: Volume 56, Issue 1 Page, 307-317
(34), p. 35;
Shiyas, C.R., Madhusudanan Pillai, V., (2014) A mathematical programming model for
manufacturing cell formation to develop multiple configurations (2014) Journal of
Barzinpour, F., Arkat, J., Jabal Ameli, M.S., Modeling the effects of machine
Technol, 39 (7-8), pp. 838-850;
Collette, Y., Siarry, P., (2003) Multi-objective optimization: principles and case
studies, , Springer, New York:;
Ebeling, C.E., An introduction to reliability and maintainability engineering. New
York: McGraw-Hill (1986) A simulation comparison of group technology with
traditional job shop manufacturing. International Journal of Production Research,
24 (5), pp. 1171-1192., Flynn, B. B., & JacobsF.R.A;
Ross, S., (1989) A first course in probability, , Macmillan publishing company, New
Yourk: 36,37;
Cohon, J.L., (1978) Multi objective programming and planning, , Academic, New
York:;
Mavrotas, G., Effective implementation of the ε-constraint method in multi-
objective mathematical programming problems (2009) Appl Math Comput, 213, pp. 455-
465;
genetic algorithm: NSGA-II (2002) IEEE Trans Evol Comput, 6 (2), pp. 182-197;
Zitzler, E., Evolutionary algorithms for multi-objective optimization: methods and
applications, Doctoral dissertation ETH 13398, Swiss Federal Institute of
Technology (ETH), Zurich (1999) Switzerland, 33, p. 66
CORRESPONDENCE ADDRESS: Aghajani, A.; Department of Computer Engineering, Ilkhchi
Branch, Islamic Azad University, PO BOX 53558114418, Iran
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Lv, J., Yuan, J., Han, W.

57202067129;55574829400;36986747200;
Multi-period virtual cell formation: A new methodology based on nonlinear mixed-
integer programming model
(2013) Applied Mechanics and Materials, 278-280, pp. 2210-2217.
280.2210&partnerID=40&md5=bcfa28b021142473d12221374b423b4e
AFFILIATIONS: School of Economics and Management, Jiangsu University of science and
Technology, Mengxi Road, Zhenjiang, Jiangsu, 212003, China
ABSTRACT: This paper researched on multi-period dynamic virtual cell formation
problem, and filled the gap on objectives of previous literatures. A developed 0-1
non-linear mixed-integer mathematical model was proposed, it incorporates real-life
parameters like alternative routings, operation sequence, duplicate machine,
processing time and machine capacity. The advantage of the model is to embed the
function relationship between cell size and internal production cost in the model,
thus the effects of set-up cost, work-in-process inventory cost, coordination cost
and inventory handling cost on VCMS are acted on the model. Finally a numerical
example solved by Lingo11.0 software package was presented to verify the model and
related discussion was made. The results show that the cell size changes as time in
dynamic condition and different scenarios of internal production cost can obtain
different cell configurations. © (2013) Trans Tech Publications, Switzerland.
AUTHOR KEYWORDS: Cell size; Internal production cost; Multi-period dynamic cell
formation; Virtual cellular manufacturing systems
INDEX KEYWORDS: Alternative routings; Cell configurations; Cell size; Coordination
costs; Dynamic cell formation; Dynamic condition; Function relationships; Handling
costs; Mixed-integer; Mixed-Integer Programming; Multi-period; Numerical example;
Operation sequences; Processing time; Production cost; Setup costs; Virtual cells;
Virtual cellular manufacturing system; Work-in-process inventory, Cells; Costs;
Cytology; Integer programming; Mathematical models, Cellular manufacturing
REFERENCES: Balakrishnan, J., Cheng, C.H., (2005) Journal of Manufacturing
Technology Management, 16, 5, pp. 516-530;
Nomden, G., Slomp, J., Suresh, N.C., (2006) Int J Flex Manuf Syst, 17, pp. 7-92;
Slomp, J., Boppana, V., Nallan, C., Suresh, C., (2005) Robotics and Computer-
Wang, X., Tang, J., Gong, J., Chen, M., (2008) Chinese Journal of Management, 5
(4), pp. 516-521., in Chinese;
Alharbi, K., (2009) Computers & Industrial Engineering, (25), pp. 678-683., Al-
Ahmari, and;
Murali, R.V., Puri, A.B., Prabhakaran, G., (2010) International Journal of
Engineering, Science and Technology, (2), pp. 163-174;
Jayachitra, R., (2010) International Journal of Engineering Science and Technology,
2 (6), pp. 1708-1724;
Rezazadeh, H., Mahini, R., Zarei, M., (2011) Applied Soft Computing, (11), pp.
3160-3169;
Schaller, J., (2007) Computers & Industrial Engineering, 53, pp. 49-478;
Yu-Bo, H.U., Chen, T.-J., (2009) Computer Engineering and Design, 30 (13), pp.
3151-3153., in Chinese;
Han, Y., Cai, J.-H., Zhou, G.-G., Yan-Lai, L.I., Tang, J.-F., (2010) Control Theory
& Applications, (27), pp. 1300-1306., in Chinese
CORRESPONDENCE ADDRESS: Lv, J.; School of Economics and Management, Jiangsu
University of science and Technology, Mengxi Road, Zhenjiang, Jiangsu, 212003,
China; email: [email protected]
ISSN: 16609336
ISBN: 9783037855959
SOURCE: Scopus
Mosbah, A.B., Dao, T.-M.

55611714600;23011197400;
Optimisation of manufacturing cell formation with extended great deluge meta-
heuristic approach
(2012) International Journal of Services Operations and Informatics, 7 (4), pp.
84874505740&doi=10.1504%2fIJSOI.2012.052180&partnerID=40&md5=3b69f22968d43c9ffdf734
ea424a076d
DOI: 10.1504/IJSOI.2012.052180
AFFILIATIONS: Mechanical Engineering Department, École de technologie supérieure
(ÉTS), 1100 Notre-Dame Street West, Montreal QC H3C 1K3, Canada
ABSTRACT: The concepts of cellular manufacturing system (CMS) and cell scheduling
(CS) have been widely used to meet various production needs. The CMS is a
particular case of group technology (GT) applied to improve the production
efficiency and reduce operational costs. This work addresses the machine/part
grouping and group scheduling problems. The cell formation problem has long been
recognised as the most challenging problem in realising the concept of cellular
manufacturing. It belongs to the class of NP-hard problems. One of the most
important problems in the area of production management is the scheduling problem
which has also been proven to be NPhard. To solve this scheduling problem an
Extended Great Deluge (EGD) metaheuristic approach is employed. The results of the
proposed approach show a major improvement when compared with the results of one of
the best algorithms developed so far by other researchers. © 2012 Inderscience
Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation; cell scheduling; Cellular manufacturing system;
CMS; EGD; Extended great deluge; Meta-heuristic approach
INDEX KEYWORDS: Cell scheduling; CMS; EGD; Extended great deluge; Meta-heuristic
approach, Cellular manufacturing; Computational complexity; Group technology;
Heuristic algorithms; Heuristic methods; Industrial management; Scheduling, Problem
solving
formation of manufacturing cells (2005) Computers and Industrial Engineering, 48 (1
SPEC. ISS.), pp. 3-21., DOI 10.1016/j.cie.2004.06.008, PII S0360835204001330;
Burke, E., Bykov, Y., Newell, J., Petrovic, S., A time-predefined local search
approach to exam timetabling problems (2004) IIE Transactions, 36 (6), pp. 509-528;

Gunasingh K.Raja, Lashkari, R.S., Cell formation problem in cellular manufacturing
system. A sequential modelling approach (1989) Computers and Industrial
for designing line type cellular manufacturing systems (1996) Integrated
cell formation (2000) The International Journal of Advanced, Manufacturing
S0736584504001036;
Solimanpur, M., Vrat, P., Shankar, S., A heuristic to minimize makespan of cell
231-241;
Research, 28 (1), pp. 145-152;
cellular manufacturing design and layout (2007) European Journal of Operational
Research, 181, pp. 156-167;
Zlatan, C., Tonci, M., Evolutionary approach for solving cell-formation problem in
cell manufacturing (2006) Advanced Engineering Informatics, 20, pp. 227-232
CORRESPONDENCE ADDRESS: Dao, T.-M.; Mechanical Engineering Department, École de
technologie supérieure (ÉTS), 1100 Notre-Dame Street West, Montreal QC H3C 1K3,
ISSN: 1741539X
ABBREVIATED SOURCE TITLE: Int. J. Serv. Oper. Inf.
SOURCE: Scopus
Nikoofarid, E., Aalaei, A.

54395924700;26430357400;
Production planning and worker assignment in a dynamic virtual cellular
(2012) International Journal of Management Science and Engineering Management, 7
(2), pp. 89-95. Cited 7 times.
84899061463&doi=10.1080%2f17509653.2012.10671211&partnerID=40&md5=bc223c6cd9208bddf
d80bbd37f2dcd7e
DOI: 10.1080/17509653.2012.10671211
Department of Industrial Engineering & Management Systems, Amirkabir University of
Technology, Hafez Ave, Tehran, Iran
ABSTRACT: Most traditional cell formation problem (CFP) procedures disregard any
changes in demand and part mix variation. However, in today’s business environment,
the life cycle of goods is short, and demand volumes and product mix can frequently
vary. In this article, a mathematical model for production planning in a dynamic
virtual environment is proposed which includes an extensive coverage of the
important manufacturing features, including a consideration of multi-period
planning horizons with demand and part mix variation, machine capacity, the main
constraints are demand satisfaction in all over period, machine availability,
machine time-capacity, and availability of workers. VCMS combines the robustness
and flexibility of process orientation with the advantages of product orientation,
which is expected to appreciate throughput time performance. To validate and verify
the proposed model, computational results are presented by solving a number of
numerical examples, with a linearized formulation. © 2012 Taylor & Francis Group,
LLC.
AUTHOR KEYWORDS: Dynamic virtual cellular manufacturing system (DVCMS); Multi-
period cell formation; Production planning; Worker flexibility
REFERENCES: Ahkioon, S., Bulgak, A., Bektas, T., Integrated cellular manufacturing
systems design with production planning and dynamic system reconfiguration (2009)
pp. 2597-2618;
Economics, 103, pp. 767-783;
Drolet, J., (1989) Scheduling virtual cellular manufacturing systems, , West
Lafayette, IN: Purdue University, PhD thesis;
Ghosh, T., Modak, M., Dan, P., SAPFOCS: A metaheuristic based approach to part
family formation problems in group technology (2011) International Journal of
Management Science and Engineering Management, 6 (3), pp. 231-240;
Ghotboddini, M., Rabbani, M., Rahimian, H., A comprehensive dynamic cell formation
design: Benders’ decomposition approach (2011) Expert Systems with Applications,
38, pp. 2478-2488;
Kannan, V., Ghosh, S., Cellular manufacturing using virtual cells (1996)
International Journal Operations & Production Management, 16 (5), pp. 99-112;
Kesen, S., Analyzing the behaviors of virtual cells (VCs) and traditional
manufacturing systems: Ant colony optimization (ACO)-based metamodels (2009)
Kia, R., A fuzzy linear programming approach to layout design of dynamic cellular
manufacturing systems with route selection and cell reconfiguration (2011)
International Journal of Management Science and Engineering Management, 6 (3), pp.
219-230;
Kochikar, V., Narendran, T., Logical cell formation in FMS, using flexibility based
criteria (1998) International Journal of Flexible Manufacturing Systems, 10, pp.
161-181;
Mansouri, S., Husseini, S., Newman, S., A review of the modern approaches to multi-
criteria cell design (2000) International Journal of Production Research, 38, pp.
1201-1218;
McLean, C., Bloom, H., Hopp, T., The virtual manufacturing cell (1982) Proceedings
of the fourth IFAC/IFIP conference on in formation control problems in
manufacturing technology, pp. 1-9., Gaithersburg, MD: In;
uncertain production requirements with presence of routing flexibility, ,
Blackburg, VA: Virginia Polytechnic Institute and State University, PhD thesis;
Ratchev, S., Concurrent process and facility prototyping for formation of virtual
manufacturing cells (2001) Integrated Manufacturing Systems, 12 (4), pp. 306-315;
Engineering, 29 (1-4), pp. 221-225;
Saad, S., Baykasoglu, A., Gindy, N., An integrated framework for reconfiguration of
cellular manufacturing systems using virtual cells (2002) Production Planning &
Control, 13 (4), pp. 381-393;
Safaei, N., Saidi-Mehrabad, M., Jabal-Ameli, M., A hybrid simulated annealing for
Sarker, B., Li, Z., Job routing and operations scheduling: A network-based virtual
cell formation approach (2001) Journal of the Operational Research Society, 52 (6),
pp. 673-681;
Saxena, L., Jain, P., Dynamic cellular manufacturing systems design-a comprehensive
model International Journal of Advanced Manufacturing Technology, , Doi:
10.1007/s00170-010-2842-9;
Selim, H., Askin, R., Vakharia, A., Cell formation in group technology: Review,
evaluation and direction for future research (1998) Computers & Industrial
Slomp, J., Chowdary, B., Suresh, N., Design of virtual manufacturing cells: A
mathematical programming approach (2005) Robotics and Computer Integrated
Tavakkoli-Moghaddam, R., Solving a dynamic cell formation problem using
metaheuristics (2005) Applied Mathematics and Computation, 170, pp. 761-780;
Tavakkoli-Moghaddam, R., Gholipour-Kanani, Y., Cheraghalizadeh, R., A genetic
algorithm and memetic algorithm to sequencing and scheduling of cellular
manufacturing systems (2008) International Journal of Management Science and
Engineering Management, 3 (2), pp. 119-130;
algorithms (2005) Lecture Notes in Computer Science, 3777, pp. 213-227;
Vakharia, A., Moily, J., Huang, Y., Evaluating virtual cells and multistage flow
shops: An analytical approach (1999) International Journal of Flexible
Wemmerlov, U., Hyer, N., Cellular manufacturing in the u.s. industry: A survey of
Wicks, E., Reasor, R., Designing cellular manufacturing systems with dynamic part
populations (1999) IIE Transactions, 31, pp. 11-20
CORRESPONDENCE ADDRESS: Aalaei, A.; Department of Industrial Engineering &
Management Systems, Amirkabir University of Technology, Hafez Ave, Tehran, Iran;
ISSN: 17509653
ABBREVIATED SOURCE TITLE: Int. J. Manage. Sci. Eng. Manage.
SOURCE: Scopus
Venkumar, P., Haq, A.N.

8931792000;8334109400;
Fractional cell formation in group technology using modified ART1 neural networks
33645567074&doi=10.1007%2fs00170-004-2421-
z&partnerID=40&md5=cb068c2c49789de4bc999f9b1bb353e4
DOI: 10.1007/s00170-004-2421-z
AFFILIATIONS: Department of Mechanical Engineering, Arulmigu Kalasalingam College
of Engineering, Krishnankoil - 626 190, Tamil Nadu, India;
Department of Production Engineering, National Institute of Technology, 620 015,
Tamil Nadu, India
ABSTRACT: Group technology (GT) is a manufacturing philosophy that attempts to
reduce production cost by reducing the material handling and transportation cost.
The GT cell formation by any known algorithm/heuristics results in much intercell
movement known as exceptional elements. In such cases, fractional cell formation
using reminder cells can be adopted successfully to minimize the number of
exceptional elements. The fractional cell formation problem is solved using
modified adaptive resonance theory1 network (ART1). The input to the modified ART1
is machine-part incidence matrix comprising of the binary digits 0 and 1. This
method is applied to the known benchmarked problems found in the literature and it
is found to be equal or superior to other algorithms in terms of minimizing the
number of the exceptional elements. The relative merits of using this method with
respect to other known algorithms/heuristics in terms of computational speed and
consistency are presented.
AUTHOR KEYWORDS: Adaptive resonance theory networks; Fractional cell formation;
Group technology
INDEX KEYWORDS: Algorithms; Costs; Group technology; Heuristic methods; Materials
balance; Matrix algebra; Neural networks; Problem solving; Production;
Transportation charges, Adaptive resonance theory networks; Fractional cell
formation; Incidence matrix, Cell culture
REFERENCES: Murthy, C.V.R., Srinivasan, G., Fractional Cell formation in group
Srinivasan, G., Zimmers Jr., E.W., Fractional cell formation - Issues and
approaches (1998) Int J Ind Eng - Theory Appl Practice, 5, pp. 257-264;
Grossberg, S., Adaptive pattern classification an universal recording: Parallel
development and coding of neural feature detectors (1976) Biol Cybern, 23, pp. 187-
202;
Gcarpenter, G.A., Grossberg, S., A massively parallel architecture for a self-
organizing neural pattern recognition machine (1987) Comput Vision Graph Image
Process, 37, pp. 54-115;
Chen, D.S., Chen, H.C., Park, J.M., An improved ART neural net for machine cell
formation (1996) J Mater Process Technol, 61, pp. 1-6;
Chandrasekaran, M.P., Rajagopalan, R., MODROC-an extension of rank orders
Fayez Boctor, F., A linear formulation of the machine-part cell formation problem
(1991) Int J Prod Res, 29 (2), pp. 343-356;
(1973) Int J Prod Res, 24, pp. 399-416;
Kumar, K.R., Kusiak, A., Vannelli, A., Grouping of parts and components in FMS
(1986) Int J Oper Res, 24, pp. 387-397;
reorganization using a clustering technique (1972) Oper Res, 20, pp. 993-1009;
Chandrasekaran, M.P., Rajagopalan, R., Group ability: An analysis of the properties
1052;
Chandrasekaran, M.P., Rajagopalan, R., Zodiac-an algorithm for concurrent formation
of part-families and machine cells (1987) Int J Prod Res, 25, pp. 835-850
CORRESPONDENCE ADDRESS: Haq, A.N.; Department of Production Engineering, National
Institute of Technology, 620 015, Tamil Nadu, India; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Lozano, S., Canca, D., Guerrero, F., García, J.M.

7004141022;6507409680;7005991206;55684865600;
Machine grouping using sequence-based similarity coefficients and neural networks
(2001) Robotics and Computer-Integrated Manufacturing, 17 (5), pp. 399-404. Cited
22 times.
5845%2801%2900015-1&partnerID=40&md5=cec99db4fe1e4e4ffc15be324027bf55
DOI: 10.1016/S0736-5845(01)00015-1
AFFILIATIONS: Department of Industrial Management, University of Seville, Camino De
Los Descubrimientos, s/n 41092 Seville, Spain
ABSTRACT: Most neural network approaches to the cell formation problem do not use
information on the sequence of operations on part types. They only use as input the
binary part-machine incidence matrix. In this paper we investigate two sequence-
based neural network approaches for cell formation. The objective function
considered is the minimization of transportation costs (including both
intracellular and intercellular movements). Constraints on the minimum and maximum
number of machines per cell can be imposed. The problem is formulated
mathematically and shown to be equivalent to a quadratic programming integer
program that uses symmetric, sequence-based similarity coefficients between each
pair of machines. Of the two energy-based neural network approaches investigated,
namely Hopfield model and Potts Mean Field Annealing, the latter seems to give
better and faster solutions, although not as good as a Tabu Search algorithm used
for benchmarking. © 2001 Elsevier Science Ltd. All rights reserved.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Neural networks;
Similarity coefficients
INDEX KEYWORDS: Algorithms; Constraint theory; Fuzzy control; Heuristic methods;
Integer programming; Neural networks, Cell formations, Cellular manufacturing
REFERENCES: Wemmerlöv, U., Johnson, D.J., Cellular manufacturing at 46 user plants:
pp. 29-49;
median model and a comparative study (1997) Int J Prod Res, 35 (5), pp. 1259-1286;
McAuley, J., Machine grouping for efficient production (1972) Prod Engineer, 51
(2), pp. 53-57;
Dobado, D., Lozano, S., Eguia, I., Larrañeta, J., Parallel fuzzy clustering of
parts and machines for cellular manufacturing (1999) Flexible Automation and
Intelligent Manufacturing, pp. 473-487., Ashayeri J., Sullivan W.G., Ahmad M.M.,
editors. New York: Begell House;
manufacturing systems (1991) J Intell Manuf, 2, pp. 305-314;
Chu, C., Manufacturing cell formation by competitive learning (1993) Int J Prod
Res, 31, pp. 829-843;
Knowledge-Based Systems and Neural Networks: Techniques and Applications, pp. 213-
218., Sharda R., Cheung J.Y., Cochran W.J., editors. Amsterdam: Elsevier;
Kaparthi, S., Suresh, N.C., Machine component cell formation in group technology: A
neural network approach (1992) Int J Prod Res, 30 (6), pp. 1353-1367;
Prasad, R., Rajan, V.N., Group technology cell formation using the ART neural
network paradigm (1994) Intelligent Engineering Systems Through Artificial Neural
Networks, 4, pp. 1085-1090., Dagli C.H., Fernández B.R., Ghosh J., Kumara R.T.S.,
editors. New York: ASME Press;
Suresh, N.C., Kaparthi, S., Performance of Fuzzy ART neural network for group
technology formation (1994) Int J Prod Res, 32, pp. 1693-1714;
Lozano, S., Dobado, D., Eguia, I., Guerrero, F., Canca, D., Fuzzy neural network
for part family formation (1999) Intelligent Engineering Systems Through Artificial
Neural Networks, 9, pp. 1141-1146., Dagli C.H., Buczak A.L., Ghosh J., Embrechts
M.J., Ersoy O., editors. New York: ASME Press;
Lozano, S., Onieva, L., Larrañeta, J., Teba, J., A neural network approach to part-
machine grouping in GT manufacturing (1993) Robotics, Mechatronics and
Manufacturing Systems, pp. 619-624., Takamori T., Tsuchiya K., editors. Amsterdam:
North-Holland;
Canca, D., Onieva, L., Guerrero, F., Racero, J., Application of the hopfield-tank
model to part-machine grouping (1999) Flexible Automation and Intelligent
Manufacturing, pp. 489-499., Ashayeri J., Sullivan W.G., Ahmad M.M., editors. New
York: Begell House;
Hopfield, J.J., Tank, D.W., Neural computation of decisions in optimization
problems (1985) Biol Cybern, 52, pp. 141-152;
Hopfield, J.J., Neural networks with graded response have collective computational
properties like those of two-state neurons (1984) Proceedings of the National
Academy of Science USA, pp. 3088-3092;
Peterson, C., Söderberg, B., A new method for mapping optimization problems onto
neural networks (1989) Int J Neural Syst, 1, pp. 3-22;
Van den Bout, D.E., Miller, T.K., Improving the performance of the hopfield-tank
neural network through normalization and annealing (1989) Biol Cybern, 62, pp. 129-
139;
Van den Bout, D.E., Miller, T.K., Graph partitioning using annealed neural networks
(1990) IEEE Trans Neural Networks, 1, pp. 192-203;
Gislén, L., Peterson, C., Söderberg, B., Complex scheduling with Potts neural
networks (1992) Neural Computation, 4, pp. 805-831
CORRESPONDENCE ADDRESS: Lozano, S.; Department of Industrial Management, University
of Seville, Camino de los Descubrimientos, s/n, 41092 Seville, Spain; email:
[email protected]
ISSN: 07365845
CODEN: RCIME
SOURCE: Scopus
Askin, Ronald G., Huang, Yuanshu

7004386108;7501571736;
Employee training and assignment for facility reconfiguration
(1997) Industrial Engineering Research - Conference Proceedings, pp. 426-431. Cited
22 times.
0031343180&partnerID=40&md5=c2d60239413313ceaca9b3910d6b42fb
AFFILIATIONS: Univ of Arizona, Tucson, United States

ABSTRACT: The traditional cell formation problem has concentrated on the
specification of part families and machine groups. However, the conversion of
manufacturing facilities from process orientation to a cellular configuration also
requires the assignment of workers to cells and the education of these workers to
operate as a self-directed cellular team. In addition to training in scheduling,
quality and other support tasks, cross-training of workers on heterogeneous
processing equipment may be required. In this paper, we provide and compare two
integer programming models for guiding the assignment of workers to cells and the
selection of a training program for each employee. Solution procedures are tested
on sample problems of varying size to demonstrate the computational time required
and the usefulness of the output solution. The structure of the models and test
results are used to develop rules to support the decision making for worker
assignment and training program selection.
INDEX KEYWORDS: Decision making; Decision support systems; Flexible manufacturing
systems; Integer programming; Scheduling, Facility reconfiguration, Personnel
training
CORRESPONDENCE ADDRESS: Askin, Ronald G.; Univ of Arizona, Tucson, United States
EDITORS: Curry Guy L.
CODEN: IERCE
SOURCE: Scopus
Yang, Ziyong, Malakooti, Behnam

7405434815;7004104039;
Machine-part cell formation and operation allocation
0030352446&partnerID=40&md5=e9eced2ba578eac0b8dcea127b63e0d5
AFFILIATIONS: Case Western Reserve Univ, Cleveland, United States

ABSTRACT: Group technology is a modern manufacturing approach which has been widely
used in many industries, including job-shop or batch-type production. It is also
very important for designing cellular manufacturing systems. This paper addresses
the machine-part cell formation problem with consideration of part processing
sequence, part production volume, part alternative processing plans, and part
processing times. This paper develops an approach to determine the machine-part
cells and to choose the part processing plans minimizing the intercell part flow.
The proposed approach solves the problem iteratively until a set of plans and the
machine-part cells are obtained with minimal intercell part flow. The approach
first solves an integer programming problem to find processing plans and then uses
a heuristic procedure to form the machine-part cells. The convergence of the
algorithm is investigated. An example is presented to explain the developed
approach. Experimental results are also given.
INDEX KEYWORDS: Algorithms; Assembly machines; Computational complexity;
Convergence of numerical methods; Integer programming; Process engineering;
Production engineering; Systems analysis, Group technology; Machine part cell
formation; Operation allocation, Manufacture
CORRESPONDENCE ADDRESS: Yang, Ziyong; Case Western Reserve Univ, Cleveland, United
States
EDITORS: Askin R.G., Bidanda B., Jagdale S.
CODEN: IERCE
SOURCE: Scopus
Sarker, B.R., Balan, C.V.

7004982967;7003645608;
Cell formation with operation times of jobs for even distribution of workloads
19 times.
0030146886&doi=10.1080%2f00207549608904975&partnerID=40&md5=4e0056a74990d125fdf2a90
bd067adbf
DOI: 10.1080/00207549608904975
Louisiana State University, Baton Rouge, LA, 70803-6409, United States
ABSTRACT: Unlike the traditional cell formation problem with machine-part incidence
matrix, this paper deals with the formation of cells for jobs with operation times
on different machines. The cell formation procedure in this paper consists of two
distinct phases. The first phase analyses the relationship between the number of
cells and the maximum number of operations that can be performed without
duplicating the machines and develops a closed form expression for the optimal
number of cells that minimizes the total associated cost. The second phase proposes
a methodology for clustering the machines and the parts into a prespecified optimal
number of cells given an upper limit on the total processing time of the jobs in a
cell. Finally an attempt has been made to balance the system with an objective of
reducing the degree of workload deviation in the cells. © 1996 Taylor & Francis
Group, LLC.
INDEX KEYWORDS: Job analysis; Machine shops; Machinery; Operations research;
Scheduling, Cell formation; Operation times; Workload distribution; Workloads,
Manufacture
REFERENCES: Askin, R.G., Chiu, K.S., A graph partitioning procedure for the machine
Boctor, F.F., A Linear formulation of the Machine-Part Cell Formulation Problem
pp. 2097-2102;
Chandrasekaran, M.P., Rajagopalan, R., MOD ROC: An extension of rank order
Research, 24 (5), pp. 1221-1233;
Research, 24 (2), pp. 451-464;
Gallagher, C.C., (1986) Group Technology Production Methods in Manufacturing, , New
York: Halsted Press);
on Systems, Man, and Cybernetics, 24 (2), pp. 203-215;
Kandîller, L., A comparative study of cell formation in cellular manufacturing
King, J.R., Machine component group formation in production flow analysis: An

King, J.R., Nakornchai, V., Machine part group formation in group technologyreview
133;
Klastorin, T.D., The P-median problem for cluster analysis: A comparison test using
the mixture model approach (1982) Management Science, 31 (1), pp. 1134-1146;
Kusiak, A., Boe, W.J., Cheng, C., Designing cellular manufacturing systems: Branch-
and-bound and A* approaches (1993) HE Transactions, 25 (4), pp. 46-56;
pp. 2633-2646;
Kusiak, A., Chow, W.S., An algorithm for cluster identification (1987) IEEE
Transactions on Systems Man Dc Cybernetics, SMC-17(4), pp. 696-699;
Logendran, R., A model for duplicating machines in the presence of budgetary
limitations in cellular manufacturing (1992) International Journal of Production
Research, 30 (3), pp. 683-694;
Malakooti, B.B., Yang, Z., Group formation by multiple criteria neural network
clustering (1993) Proceedings of the HE 2Nd Industrial Engineering Research
data reorganization by a clustering technique (1972) Operations Research, 20 (5),
pp. 993-1009;
Miltenburg, J., Zhang, W., A Comparative evaluation of nine well-known algorithms
Moodie, C.L., Young, H.H., A heuristic method of assembly line balancing for
assumptions of constant or variable work element times (1965) The Journal of
Rath, S.K., Das, C., Sahu, S., Machine component cell formation using Boolean
method (1994) Asia-Pacific Journal of Operational Research, 11 (1), pp. 1-17;
Ravikumar, K., Kusiak, A., Vannelli, A., Grouping of parts and components in
(3), pp. 387-397;
Sarker, B.R., Shanthikumar, J.G., A generalized approach for serial or parallel
line balancing (1983) International Journal of Production Research, 21 (1), pp.
109-133;
a linear layout, cellular manufacturing system (1994) International Journal of
Shargal, M., Shekar, S., Irani, S.A., Evaluation of search algorithms and
clustering efficiency measures for machine-part matrix clustering (1995) HE
simulated annealing approach (1993) International Journal of Production Research,
31 (12), pp. 2927-2945;
Vakharia, A.J., Wemmerlôv, U., Designing a cellular manufacturing system: A
material flow approach based on operations sequences (1990) HE Transactions, 22
(1), pp. 84-97;
Vannelli, A., Ravikumar, K.R., A method for finding minimal bottle-neck cells for
24 (2), pp. 387-400;
Research, 67 (3), pp. 405-417;
2053-2062
CORRESPONDENCE ADDRESS: Sarker, B.R.; Department of Industrial and Manufacturing
Systems Engineering, Louisiana State University, Baton Rouge, LA, 70803-6409,
United States
ISSN: 00207543
SOURCE: Scopus
Sarker, B.R.
7004982967;
The resemblance coefficients in group technology: A survey and comparative study of
relational metrics
8352%2895%2900024-0&partnerID=40&md5=817b5ab3f588c3e050347512ffbe5b50
DOI: 10.1016/0360-8352(95)00024-0
AFFILIATIONS: Dept. of Indust. and Mfg. Syst. Eng., Louisiana State University,
Baton Rouge, LA 70803, United States
ABSTRACT: Group formation of machines and parts in cellular manufacturing systems
are, in most cases, achieved by using the information on the similarity of
operational requirements of parts. To assess the quality of solutions to the cell
formation problems, a comprehensive overview of several similarity and
dissimilarity coefficients based on different performance measures are covered in
this paper. Analysis of the experimental data available shows that there is no
similarity coefficient that performs well on all performance measures for problems
from either the literature or randomly generated sets. There are very few studies
reported in the literature which compare and evaluate different similarity
coefficients. In this paper, a number of commonly used similarity and dissimilarity
coefficients are reviewed and compared characteristically among themselves to
assess their compatibility in different problems. Similarity coefficients other
than those mentioned herein could not be analyzed due to the lack of theoretical
and experimental results.
INDEX KEYWORDS: Costs; Just in time production; Manufacture; Operations research;
Performance; Quality control; Systems analysis; Technology, Cell formation;
Cellular manufacturing systems; Group technology; Quality improvement; Similarity
dissimilarity coefficients, Production engineering
REFERENCES: Mittenburg, J., Zhang, W., A comparative evaluation of nine well known
algorithms for solving the cell formation problem in group technology (1991) J.
Opers Mgmt, 10, pp. 44-72;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC: An algorithm for, concurrent
formation of part families and machine cells (1987) Int. J. Product. Res., 25, pp.
451-464;
Vanneli, A., Kumar, K.R., A method for finding minimal bottleneck cells for
grouping part machine families (1986) Int. J. Product. Res., 24, pp. 387-400;
King, J.R., Machine component grouping in production flow analysis. an approach
using a rank order clustering algorithm (1980) Int. J. Product Res, 18, pp. 213-
237;
Review and extension (1982) Int. J. Product. Res., 20, pp. 117-133;
improper machine assignment in group technology applications (1988) Int. J.
Product. Res., 27, pp. 1161-1165;
cellular manufacturing systems (1987) Int. J. Product. Res., 25, pp. 639-655;
Sarker, B.R., Yu, J., Duplicating procedure for bottleneck machines in linear,
cellular manufacturing system (1993) Proc. Decision Science Institute - Southwest
Region 24th Annular Conf. (SWFAD), pp. 130-132., New Orleans, LA;
linear layout, cellular manufacturing systems (1994) Int. J. Product. Res., 32, pp.
2049-2066;
Burbridge, J.L., Production flow analysis (1971) The Product. Engr, 50, pp. 139-
152;
Burbridge, J.L., (1975) The Introduction to Group Technology, , Wiley, New York;
Wemmerlöv, U., Hyer, N.L., Procedures for part family/machine group identification
in cellular manufacturing (1986) J. Opers Mgmt, 6, pp. 125-147;
techniques (1990) Int. J. Product. Res., 28, pp. 661-673;
McAuley, J., Maching grouping for efficiency production (1972) Product. Engng, 51,
pp. 53-57;
Int. J. Product. Res., 26, pp. 1161-1172;
Vakharia, A.J., Wemmerlöv, U., A new design method for cellular manufacturing
system (1987) Proc. of IXth Int. Conf. on Production Research, pp. 2357-2363;
material flow approach based on operation sequences (1990) IEEE Trans., 22, pp. 84-
97;
Jaccard, P., Nouvelles Recherches sur la distribution florale (1908) Bull. Soc.
Vaud. Sci. Nat., 44, pp. 223-270;
(1987) IIE Trans., 21, pp. 382-391;
Seifoddini, H., Incorporation of the production volume in machine cells formation
in group technology applications (1987) Proc. IXth Int. Conf. Production Research,
pp. 2348-2356;
group technology (1986) IEE Trans., 18, pp. 271-277;
Sokal, R.R., Michener, C.D., A quantitative approach to a problem in classification
(1957) Evolution, 11, pp. 130-162;
relationships (1958) Univ. Kansas Sci. Bull., 38, pp. 1409-1438;
Yule, G.U., Kendall, M.G., An Introduction to the Theory of Statistics, 14th Edn,
p. 701., Hafner, New York;
Brisbane, P.G., Rovira, A.D., A comparison of methods for classifying rhizosphere
bacteria (1961) J. Gen. Microbiol., 26, pp. 379-392;
Bishop, Y.M.M., Fienberg, S.E., Holland, P.W., (1975) Discrete Multivariate
Analysis: Theory and Practice, , MIT Press Cambridge, MA;
Hamann, U., Merkmalsbestand und Verwandtschaftsbeziechungen der Farinosae. Ein
Beitrag zum System der Monokttyledonen (1961) Willddenowia, 2, pp. 639-768;
Holley, J.W., Guilford, J.P., A note on the G index of agreement (1964) Educ.
Psychol. Measmt., 24, pp. 749-753;
Baroni-Urbani, C., Buser, M.W., Similarity of binary data (1976) System. Zool., 25,
pp. 251-259;
Taboun, S.M., Sankaran, S., Bhole, S., Comparison and evaluation of similarity
measures in group technology (1991) Computers Ind. Engng, 20, pp. 343-353;
Wu, H.L., Venugopal, R., Barash, M.M., Design of a cellular manufacturing system: A
syntactical pattern recognition approach (1986) J. Manufact. Syst., 5, pp. 81-88;
formations (1991) J. Manufact. Syst., 9, pp. 55-68;
Rogers, D.J., Tanimoto, T.T., A computer program for classifying plants (1960)
Science, 132, pp. 1115-1118;
Romesburg, H.C., (1984) Cluster Analysis for Researchers, , Lifetime Learning
Publications (Wadsworth, Inc.), Belmont, CA;
Mosier, C.T., Taube, L., Weighted similarity mesaure heuristics for the group
and similarity coefficients to the GT machine cell formation problem (1989) Int. J.
Product. Res., 27, pp. 1811-1835;
Arthanari, T.S., Dodge, Y., (1981) Mathematical Programming in Statistics, , Wiley,
NY;
determining manufacturing families from design-based groupings for flexible
manufacturing systems (1986) Computers Ind. Engng, 10, pp. 193-201;
Chu, C.H., Pan, P., A comparison of hierarchical clustering techniques for
manufacturing cellular formation Proc. Third Int. Conf. CAD/CAM, Robotics, and
Factory of the Future, , (Edited by B. Prasad). Springer-Verlag, New York;
Chu, C.H., Tsai, M., Clustering analysis in manufacturing cellular formation (1989)
OMEGA, 17, pp. 289-295;
Leskowsky, L., Logan, L., Vannelli, A., Group technology decision aids in an expert
system for plant layout Modern Production Management Systems, pp. 561-585., (Edited
by A. Kusiak), North-Holland, Amsterdam;
Kusiak, A., Cho, M., Similarity coefficient algorithms solving the group technology
problem (1992) Int. J. Product. Res., 30, pp. 2633-2646;
Seifoddini, H., Machine component group analysis versus the similarity coefficient
method in cellular manufacturing applications (1990) Computers Ind. Engng, 18, pp.
333-339;
Klastorin, T.D., The p-median problem for cluster analysis: A comparative test
using the mixture model approach (1985) Mgmt Sci., 31, pp. 84-95;
Cohen, J., A coefficient of agreement for nominal scales (1960) Educ. Psychol.
Measmt, 20, pp. 37-46;
Chandrasekharan, M.P., Rajagopalan, R., MODROC: An extension to rank order
clustering for group technology (1986) Int. J. Product. Res., 24, pp. 1221-1231;
goodness of block diagonal forms of binary matrices in group technology Int. J.
Product. Res., 28, pp. 233-243;
of binary data matrices for group technology (1989) Int. J. Product. Res., 27, pp.
1035-1052;
versus Jaccard's similarity coefficient (1991) Computers Ind. Engng, 21, pp. 263-
266;
Sarker, B.R., Balan, C.V., Cell formation with operations times of jobs for even
distribution of workloads (1995) Intl. J. Product. Res., , In press
CORRESPONDENCE ADDRESS: Sarker, B.R.; Dept. of Indust. and Mfg. Syst. Eng.,
Louisiana State University, Baton Rouge, LA 70803, United States
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Ajagekar, A., Humble, T., You, F.

57208801722;6602287338;56750277000;
Quantum computing based hybrid solution strategies for large-scale discrete-
continuous optimization problems
(2020) Computers and Chemical Engineering, 132, art. no. 106630, .
85074613357&doi=10.1016%2fj.compchemeng.2019.106630&partnerID=40&md5=1d40bc0217f34b
15d03d47efb7d7b371
DOI: 10.1016/j.compchemeng.2019.106630
AFFILIATIONS: Robert Frederick Smith School of Chemical and Biomolecular
Engineering, Cornell University, Ithaca, NY 14853, United States;
Oak Ridge National Laboratory, Quantum Computing Institute, Oak Ridge, TN 37831,
United States
ABSTRACT: Quantum computing (QC) has gained popularity due to its unique
capabilities that are quite different from that of classical computers in terms of
speed and methods of operations. This paper proposes hybrid models and methods that
effectively leverage the complementary strengths of deterministic algorithms and QC
techniques to overcome combinatorial complexity for solving large-scale mixed-
integer programming problems. Four applications, namely the molecular conformation
problem, job-shop scheduling problem, manufacturing cell formation problem, and the
vehicle routing problem, are specifically addressed. Large-scale instances of these
application problems across multiple scales ranging from molecular design to
logistics optimization are computationally challenging for deterministic
optimization algorithms on classical computers. To address the computational
challenges, hybrid QC-based algorithms are proposed and extensive computational
experimental results are presented to demonstrate their applicability and
efficiency. The proposed QC-based solution strategies enjoy high computational
efficiency in terms of solution quality and computation time, by utilizing the
unique features of both classical and quantum computers. © 2019 Elsevier Ltd
AUTHOR KEYWORDS: Hybrid techniques; Molecular design; Optimization; Quantum
computing; Scheduling and planning; Supply chain and logistics optimization
INDEX KEYWORDS: Cellular manufacturing; Efficiency; Integer programming; Job shop
scheduling; Optimization; Quantum computers; Scheduling; Supply chains; Vehicle
routing, Hybrid techniques; Logistics optimization; Molecular design; Quantum
Computing; Scheduling and planning, Computational efficiency
REFERENCES: Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.,
Adiabatic quantum computation is equivalent to standard quantum computation (2007)
SIAM J. Comput., 37, pp. 166-194;
Ajagekar, A., You, F., Quantum computing for energy systems optimization:
challenges and opportunities (2019) Energy, 179, pp. 76-89;
Applegate, D., Cook, W., A computational study of the job-shop scheduling problem
(1991) ORSA J. Comput., 3, pp. 149-156;
Błażewicz, J., Domschke, W., Pesch, E., The job shop scheduling problem:
conventional and new solution techniques (1996) Eur. J. Oper. Res., 93, pp. 1-33;
Babej, T., Ing, C., Fingerhuth, M., (2018), Coarse-grained lattice protein folding
on a quantum annealer. Available:; Benders, J.F., Partitioning procedures for
solving mixed-variables programming problems (1962) Numer. Math., 4, pp. 238-252;
Benoist, T., Gardi, F., Jeanjean, A., Estellon, B., Randomized local search for
real-life inventory routing (2011) Transp. Sci., 45, pp. 381-398;
Biegler, L.T., Grossmann, I.E., Retrospective on optimization (2004) Comput. Chem.
Eng., 28, pp. 1169-1192;
Bienstock, D., Computational study of a family of mixed-integer quadratic
programming problems (1996) Math. Program., 74, pp. 121-140;
Booth, M., Reinhardt, S.P., Roy, A., Partitioning optimization problems for hybrid
classical/quantum execution, Technical Report (2017),
https://www.dwavesys.com/sites/default/files/partitioning_QUBOs_for_quantum_acceler
ation-2.pdf, D-Wave Systems; Cai, J., Macready, W.G., Roy, A., (2014), A practical
heuristic for finding graph minors. Available:; Chen, J.S., Heragu, S.S., Stepwise
decomposition approaches for large scale cell formation problems (1999) Eur. J.
Oper. Res., 113, pp. 64-79;
Chu, Y., You, F., Integration of scheduling and dynamic optimization of batch
processes under uncertainty: two-Stage stochastic programming approach and enhanced
generalized benders decomposition algorithm (2013) Ind. Eng. Chem. Res., 52, pp.
16851-16869;
Chu, Y., You, F., Integrated scheduling and dynamic optimization of complex batch
processes with general network structure using a generalized benders decomposition
approach (2013) Ind. Eng. Chem. Res., 52, pp. 7867-7885;
Chu, Y., You, F., Integration of production scheduling and dynamic optimization for
multi-product CSTRs: generalized benders decomposition coupled with global mixed-
integer fractional programming (2013) Comput. Chem. Eng., 58, pp. 315-333;
Coffrin, C., Nagarajan, H., Bent, R., (2017), Evaluating ising processing units
with integer programming. Available:; Denchev, V.S., Boixo, S., Isakov, S.V., Ding,
N., Babbush, R., Smelyanskiy, V., What is the computational value of finite-range
tunneling? (2016) Phys. Rev. X, 6;
(2018), https://docs.dwavesys.com/docs/latest/index.html, D-Wave System
Documentation. Available:; Edgar, T.F., Himmelblau, D.M., Lasdon, L.S.,
Optimization of Chemical Processes (2001), McGraw-Hill New York; Feld, S., Roch,
C., Gabor, T., Seidel, C., Neukart, F., Galter, I., A hybrid solution method for
the capacitated vehicle routing problem using a quantum annealer (2019) Front. ICT,
6;
Floudas, C.A., Gounaris, C.E., A review of recent advances in global optimization
(2009) J. Global Optim., 45, pp. 3-38;
Gendreau, M., Potvin, J.-Y., Tabu search (2010) Handbook of Metaheuristics, pp. 41-
59., ed;
Gibney, E., D-Wave upgrade: how scientists are using the world's most controversial
quantum computer (2017) Nature, 541, pp. 447-448;
Golden, B.L., Raghavan, S., Wasil, E.A., (2008) The Vehicle Routing problem: Latest
Advances and New Challenges, 43., Springer Science & Business Media Boston;
Goodrich, T.D., Sullivan, B.D., Humble, T.S., Optimizing adiabatic quantum program
compilation using a graph-theoretic framework (2018) Quant. Inf. Process., 17, p.
118;
Grossmann, I.E., Biegler, L.T., Part II. future perspective on optimization (2004)
Comput. Chem. Eng., 28, pp. 1193-1218;
Grover, L.K., Quantum mechanics helps in searching for a needle in a haystack
(1997) Phys. Rev. Lett., 79, pp. 325-328;
Gyongyosi, L., (2018), Quantum circuit designs for gate-model quantum computer
architectures. Available:; Hamilton, K.E., Humble, T.S., Identifying the minor set
cover of dense connected bipartite graphs via random matching edge sets (2017)
Quant. Inf. Process., 16, p. 94;
Harjunkoski, I., Grossmann, I.E., Decomposition techniques for multistage
scheduling problems using mixed-integer and constraint programming methods (2002)
Comput. Chem. Eng., 26, pp. 1533-1552;
Harrow, A.W., Hassidim, A., Lloyd, S., Quantum algorithm for linear systems of
equations (2009) Phys. Rev. Lett., 103;
Hart, W.E., Watson, J.-P., Woodruff, D.L., Pyomo: modeling and solving mathematical
programs in Python (2011) Math. Program. Comput., 3, p. 219;
Havel, T.F., Kuntz, I.D., Crippen, G.M., The combinatorial distance geometry method
for the calculation of molecular conformation. I. a new approach to an old problem
(1983) J. Theor. Biol., 104, pp. 359-381;
Humble, T.S., DeBenedictis, E.P., Quantum realism (2019) Computer (Long Beach
Calif), 52, pp. 13-17;
ʼ
Humble, T.S., McCaskey, A.J., Bennink, R.S., Billings, J.J., DAzevedo, E.F.,
Sullivan, B.D., An integrated programming and development environment for adiabatic
quantum optimization (2014) Comput. Sci. Discov., 7;
Jain, V., Grossmann, I.E., Algorithms for hybrid milp/cp models for a class of
optimization problems (2001) INFORMS J. Comput., 13, pp. 258-276;
Ji, P., Wu, H., Wu, Y., (2016), Quadratic programming for the vehicle routing
problem, Proceedings of the International Symposium on Operations Research and Its
Applications; Johnston, H., (2011), physicsworld.com, Quantum-computing firm opens
the box. Available:; Judson, R.S., Colvin, M.E., Meza, J.C., Huffer, A., Gutierrez,
D., Do intelligent configuration search techniques outperform random search for
large molecules? (1992) Int. J. Quant. Chem., 44, pp. 277-290;
Kadowaki, T., Nishimori, H., Quantum annealing in the transverse ising model (1998)
Phys. Rev. E - Stat. Phys. Plasmas, Fluids, Related Interdiscip. Top., 58, pp.
5355-5363;
Kirkpatrick, S., Gelatt, C.D., (1983), pp. 671-680., Vecchi, M.P. Optimization by
simulated annealing, in New Series; Klymko, C., Sullivan, B.D., Humble, T.S.,
Adiabatic quantum programming: minor embedding with hard faults (2014) Quant. Inf.
Process., 13, pp. 709-729;
Koziel, S., Yang, X.-S., (2011) Computational optimization, Methods and Algorithms,
356., Springer Berlin;
Laporte, G., Gendreau, M., Potvin, J.Y., Semet, F., Classical and modern heuristics
for the vehicle routing problem (2000) Int. Trans. Oper. Res., 7, pp. 285-300;
Laporte, G., The vehicle routing problem: an overview of exact and approximate
algorithms (1992) Eur. J. Oper. Res., 59, pp. 345-358;
Lazimy, R., Mixed-integer quadratic programming (1982) Math. Program., 22, pp. 332-
349;
Lenstra, J.K., Kan, A.H.G.R., Complexity of vehicle routing and scheduling problems
(1981) Networks, 11, pp. 221-227;
Lucas, A., Ising formulations of many np problems (2014) Front. Phys., 2;
Mack, C.A., Fifty years of Moore's law (2011) IEEE Trans. Semicond. Manuf., 24, pp.
202-207;
Maier, R.S., Rosen, J.B., Xue, G.L., A discrete-continuous algorithm for molecular
energy minimization (1992) Proceedings of the ACM/IEEE Conference on
Supercomputing, pp. 778-786;
Maranas, C.D., Floudas, C.A., Global minimum potential energy conformations of
small molecules (1994) J. Global Optim., 4, pp. 135-170;
Maranas, C.D., Floudas, C.A., A deterministic global optimization approach for
molecular structure determination (1994) J. Chem. Phys., 100, pp. 1247-1261;
Meza, J.C., Martinez, M.L., Direct search methods for the molecular conformation
problem (1994) J. Comput. Chem., 15, pp. 627-632;
Montanaro, A., Quantum algorithms: an overview (2016) Npj Quant. Inf., 2, p. 15023;
Munari, P., Dollevoet, T., Spliet, R., (2016), A generalized formulation for
vehicle routing problems. Available:; Neukart, F., Compostella, G., Seidel, C., von
Dollen, D., Yarkoni, S., Parney, B., Traffic flow optimization using a quantum
annealer (2017) Front. ICT, 4;
Nielsen, M.A., Chuang, I.L., Quantum Computation and Quantum Information (2010),
Cambridge University Press; Okada, S., Ohzeki, M., Terabe, M., Taguchi, S.,
Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
(2019) Sci. Rep., 9, p. 2098;
Oliveira, N.M.D., Silva, R.M.D.A., Oliveira, W.R.D., QUBO formulation for the
contact map overlap problem (2018) Int. J. Quant. Inf., 16;
research (2010) Eur. J. Oper. Res., 206, pp. 509-521;
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., Aspuru-Guzik, A., Finding
low-energy conformations of lattice protein models by quantum annealing (2012) Sci.
Rep., 2, p. 571;
Phillips, A.T., Rosen, J.B., A quadratic assignment formulation of the molecular-
conformation problem (1994) J. Global Optim., 4, pp. 229-241;
Preskill, J., (2018), Quantum computing in the nisq era and beyond. Available:;
Reeves, C.R., Genetic algorithms (2010) Handbook of Metaheuristics, pp. 109-139.,
ed;
Rieffel, E.G., Venturelli, D., O'Gorman, B., Do, M.B., Prystay, E.M., Smelyanskiy,
V.N., A case study in programming a quantum annealer for hard operational planning
problems (2015) Quant. Inf. Process., 14, pp. 1-36;
Santoro, G.E., Tosatti, E., Optimization using quantum mechanics: quantum annealing
through adiabatic evolution (2006) J. Phys. A Math. Gen., 39;
Shor, P.W., Algorithms for quantum computation: discrete logarithms and factoring
(1994) Proceedings 35th Annual Symposium on Foundations of Computer Science;
Suresh, N.C., Kay, J.M., Group Technology and Cellular manufacturing: a State-Of-
The-Art Synthesis of Research and Practice (2012), Springer Science & Business
Media Boston; Toth, P., Vigo, D., Exact solution of the vehicle routing problem
(1998) Fleet Management and Logistics, pp. 1-31., T.G. Crainic G. Laporte Springer
US Boston, MA ed;
Toth, P., Vigo, D., An overview of vehicle routing problems (2002) The Vehicle
Routing Problem, pp. 1-26., Society for Industrial and Applied Mathematics ed:;
Tran, T.T., Do, M., Rieffel, E.G., Frank, J., Wang, Z., O'Gorman, B., (2016), A
hybrid quantum-classical approach to solving scheduling problems, in Proceedings of
the Symposium on Combinatorial Search; Venturelli, D., Mandrà, S., Knysh, S.,
O'Gorman, B., Biswas, R., Smelyanskiy, V., Quantum optimization of fully connected
spin glasses (2015) Phys. Rev. X, 5;
Venturelli, D., Marchand, D., Rojo, G., Job shop scheduling solver based on quantum
annealing (2016) Proceedings of the ICAPS-16 Workshop on Constraint Satisfaction
Techniques for Planning and Scheduling (COPLAS), pp. 25-34;
Wang, Y., Li, Y., Yin, Z.-Q., Zeng, B., 16-qubit IBM universal quantum computer can
be fully entangled (2018) npj Quant. Inf., 4, p. 46;
identification problem in cellular manufacturing (1986) J. Oper. Manag., 6, pp.
125-147;
Xue, G., Molecular conformation on the CM-5 by parallel two-level simulated
annealing (1994) J. Global Optim., 4, pp. 187-208;
Yu, H., Liang, W., Neural network and genetic algorithm-based hybrid approach to
expanded job-shop scheduling (2001) Comput. Ind. Eng., 39, pp. 337-356;
Yue, D., Guillen-Gosalbez, G., You, F., Global optimization of large-scale mixed-
integer linear fractional programming problems: a reformulation-linearization
method and process scheduling applications (2013) AIChE J., 59, pp. 4255-4272;
Zahedinejad, E., Zaribafiyan, A., (2017), Combinatorial optimization on gate model
quantum computers: a survey. Available:; Zhong, Z., You, F., Globally convergent
exact and inexact parametric algorithms for solving large-scale mixed-integer
fractional programs and applications in process systems engineering (2014) Comput.
Chem. Eng., 61, pp. 90-101
CORRESPONDENCE ADDRESS: You, F.; Robert Frederick Smith School of Chemical and
Biomolecular Engineering, Cornell UniversityUnited States; email:
[email protected]
ISSN: 00981354
CODEN: CCEND
ABBREVIATED SOURCE TITLE: Comput. Chem. Eng.
SOURCE: Scopus
Ghosh, T., Doloi, B., Dan, P.K.

52163539500;6508202513;26325403400;
Utilization-based grouping efficiency and multi-criteria decision approach in
designing of manufacturing cells
85013249575&doi=10.1177%2f0954405416629583&partnerID=40&md5=bf45ebd8147695ad918dadc
f08099cbf
DOI: 10.1177/0954405416629583
AFFILIATIONS: Production Engineering Department, Jadavpur University, Kolkata,
700032, India;
Rajendra Mishra School of Engineering Entrepreneurship, IIT Kharagpur, Kharagpur,
India
ABSTRACT: The essence of the "ratio data" in cellular manufacturing system has
rarely been correctly emphasized since past few decades of research and study. This
article is an attempt to deal with cell formation problem which exploits machine
utilization percentage and eliminates the "fuzziness" on the subject of ratio data.
In the course of this study, a distinctive technique is adopted based on multi-
criteria decision technique with significant modifications which is experimented on
test data and compared with published methodology. To verify the grouping result, a
novel performance measure is proposed and elaborated analytically to establish its
superiority and robustness over the earlier efficiency measures published in the
past literature of cellular manufacturing system. The novelty of this research
remains in eradicating ambiguities on the subject of "ratio data," imposing
appropriate rules while generating the test problems, catering a unique multi-
criteria decision technique-based approach and a novel performance measure for the
aforesaid problem. © Institution of Mechanical Engineers.
AUTHOR KEYWORDS: analytical hierarchy process; cellular manufacturing system;
Machine utilization percentage; multi-criteria decision technique; performance
measure; ratio data
INDEX KEYWORDS: Efficiency; Industrial research; Manufacture, Analytical Hierarchy
Process; Machine utilization; Multicriteria decision; Performance measure; Ratio
data, Cellular manufacturing
REFERENCES: Won, Y., Currie, K.R., Fuzzy ART/RRR-RSS: A two-phase neural network
algorithm for part-machine grouping in cellular manufacturing (2007) Int J Prod
Res, 45 (9), pp. 2073-2104;
Review evaluation and directions for future research (1998) Comput Ind Eng, 34 (1),
pp. 3-20;
simulated annealing: An experimental evaluation (1992) Eur J Oper Res, 63, pp. 409-
422;
Rajagopalan, R., Batra, J.L., Design of cellular production system - A graph
theoretic approach (1975) Int J Prod Res, 13 (6), pp. 567-579;
using a rank order-clustering algorithm (1980) Int J Prod Res, 18, pp. 213-232;
technology using minimum spanning trees (1994) Int J Prod Res, 32 (9), pp. 2149-
2158;
Res, 39 (1), pp. 1-19;
434-446;
manufacturing cell design Workshop on Knowledge Discovery and Data Mining, pp. 72-
75., Adelaide, SA, Australia, 23-24 January 2008, New York: IEEE;
(2013) J Manuf Syst, 32 (1), pp. 78-84;
Sengupta, S., Ghosh, T., Dan, P.K., Fuzzy ART K-Means Clustering Technique (FAKMCT)
- A hybrid neural network approach to cellular manufacturing systems (2011) Int J
Comput Integ M, 24 (10), pp. 927-938;
Satheeshkumar, V., Karthikeyan, K., Renald, C.J.T., Evaluation of cell formation
algorithms and implementation of MOD-SLC algorithm as an effective cellular
manufacturing system in a manufacturing industry Int J Curr Eng Technol, , Epub
ahead of print 2014. DOI: 10.14741/ijcet/spl.2.2014.33;
using ordinal and ratio level data (1999) Int J Prod Res, 37 (3), pp. 539-556;
Kumar, L., Jain, P.K., Part-machine group formation with ordinal-ratio level data
and production volume (2009) Int J Simulat Model, 8 (2), pp. 90-101;
properties of self-organizing map in machine-part cell formation (2012) Appl Soft
Comput, 12 (2), pp. 600-610;
Lee, K., Ahn, K.I., GT efficacy: A performance measure for cell formation with
and ratio-level data (2003) Int J Adv Manuf Tech, 2, pp. 125-133;
cellular manufacturing systems (2008) Int J Adv Manuf Tech, 38, pp. 630-640;
Pandian, R.S., (2008) Application of Soft Computing Techniques for Cell Formation
Considering Operational for Cell Formation Considering Operational Time and
Sequence, , PhD Thesis, NIT Rourkela, Rourkela, India;
Review and extension (1982) Int J Prod Res, 20, pp. 117-133;
cellular manufacturing (1982) J Manuf Syst, 1, pp. 65-75;
Kusiak, A., The generalized group technology concept (1987) Int J Prod Res, 25 (4),
pp. 561-569;
Srinivasan, G., Narendran, T.T., GRAFICS: A non-hierarchical clustering algorithm
(1989) IIE Trans, 21 (4), pp. 382-388;
McAuley, J., Machine grouping for efficient production (1972) Prod Engineer, 51
(2), pp. 53-57;
Prabhakaran, G., Janakiraman, T.N., Sachithanandam, M., Manufacturing data based
combined dissimilarity coefficient for machine cell formation (2002) Int J Adv
Manuf Tech, 19, pp. 889-897;
655;
Veeramani, D., Mani, K., A polynomial-time algorithm for optimal clustering in a
special class of {0, 1}-matrices (1996) Int J Prod Res, 34 (9), pp. 2587-2611;
Rabbani, M., Samavati, M., Ziaee, M.S., Reconfigurable dynamic cellular
manufacturing system: A new bi-objective mathematical model (2014) RAIRO: Oper Res,
48, pp. 75-102;
(1991) Int J Prod Res, 29 (2), pp. 343-356;
Ramabhatta, V., Nagi, R., Integrated formulation of manufacturing cell formation
with capacity planning and multiple routings (1998) Ann Oper Res, 77, pp. 79-95;
splitting and multiple units of same machine (1995) Int J Prod Res, 33, pp. 675-
693;
Adenso-Diaz, B., Lozano, S., Racero, J., Machine cell formation in generalized
group technology (2001) Comput Ind Eng, 41, pp. 227-240;
Dagli, C., Huggahalli, R., Wang, J., Takefuji, Y., Neural network approach to group
technology (1993) Neural Networks in Design and Manufacturing, pp. 1-55., (eds).
Singapore: World Scientific Publishing Company;
backpropagation learning rule of neural networks (1991) Comput Ind Eng, 20 (4), pp.
425-437;
Kamal, S., Burke, L.I., FACT: A new neural network based clustering algorithm for
Gupta, Y., Gupta, M., Kumar, A., A genetic algorithm-based approach to cell
composition and layout design problems (1996) Int J Prod Res, 34 (2), pp. 447-482;
problem involving processing times and lot sizes (2003) Comput Ind Eng, 45, pp.
713-731;
Pillai, M.V., Subbarao, K., A robust cellular manufacturing system design for
dynamic part population using a genetic algorithm (2008) Int J Prod Res, 46 (18),
pp. 5191-5210;
Khaksar-Haghani, F., Kia, R., Mahdavi, I., A genetic algorithm for solving a multi-
floor layout design model of a cellular manufacturing system with alternative
process routings and flexible configuration (2013) Int J Adv Manuf Tech, 66, pp.
845-865;
Fan, J., Feng, D., Design of cellular manufacturing system with quasi-dynamic dual
resource using multi-objective GA (2013) Int J Prod Res, 51 (14), pp. 4134-4154;
approach to dynamic cellular manufacturing system (2014) Proc IMechE, Part B: J
Spiliopoulos, K., Sofianopoulou, S., An efficient ant colony optimisation system
for the manufacturing cells formation system (2008) Int J Adv Manuf Tech, 36, pp.
589-597;
(2013) J Manuf Syst, 32 (1), pp. 20-31;
McQueen, J.B., Some methods for classification and analysis of multivariate
observations (1967) Proceedings of Fifth Symposium on Mathematical Statistics and
Probability, 1, pp. 281-297., Berkeley, CA, (Univ. of Calif. Press);
Saaty, T.L., (1980) The Analytic Hierarchy Process: Planning, Priority Setting,
Resource Allocation, , New York: McGraw-Hill;
Ghosh, T., Chakraborty, T., Dan, P.K., An effective AHP-based metaheuristic
approach to solve supplier selection problem (2012) Int J Procure Manag, 5 (2), pp.
140-159;
J Prod Res, 28, pp. 2233-2243;
Ponnambalam, S.G., Pandian, R.S., Mahapatra, S.S., Cell formation with workload
data in cellular manufacturing system using genetic algorithm IEEE International
Conference on Industrial Engineering and Engineering Management, pp. 674-678.,
Singapore, 2-4 December 2007, New York: IEEE;
Sarkar, B.R., Khan, M., A comparison of existing grouping efficiency measures and a
new weighted grouping efficiency measure (2001) IIE Trans, 33, pp. 11-27
CORRESPONDENCE ADDRESS: Ghosh, T.; Production Engineering Department, Jadavpur
UniversityIndia; email: [email protected]
PUBLISHER: SAGE Publications Ltd
ISSN: 09544054
CODEN: PIBME
SOURCE: Scopus
Egilmez, G., Singh, S., Ozguner, O.

55248346200;57193063397;57193060816;
Cell formation in a cellular manufacturing system under uncertain demand and
processing times: A stochastic genetic algorithm approach
(2017) International Journal of Services and Operations Management, 26 (2), pp.
85010338477&doi=10.1504%2fIJSOM.2017.081489&partnerID=40&md5=123426066ea6fa25d8b5f9
a18ae4627b
DOI: 10.1504/IJSOM.2017.081489
New Haven, Buckman Hall, 218, 300 Boston Post Road, West Haven, CT 06516, United
States;
Department of Industrial and Manufacturing Engineering, North Dakota State
University, United States;
Electrical Engineering and Computer Science Department, Case Western Reserve
University, Cleveland, OH, United States
ABSTRACT: This paper addresses the stochastic cell formation problem with a newly
proposed stochastic genetic algorithm (SGA) approach considering stochastic demand
and processing times, thus capacity requirements. A stochastic nonlinear
mathematical model [SNMM, proposed by Egilmez et al. (2012)] and the newly proposed
SGA approaches are compared based on the solution quality and execution times on
10, 20 and 30-product problems. SGA approach is used to experiment with various GA
parameters including number of generation, population size, probability and type of
crossover and mutation, which resulted in 456 combinations with 10-replications
each. The results of the proposed SGA model indicated that the optimal solution is
guaranteed with the 10 product problem and average gaps of 1.75% and 3.70% were
obtained from 20 and 30-product problems, respectively. The execution times were
significantly reduced by the proposed SGA model, where reductions of 87.2%, 98.3%
and 99.5% were achieved in computation times. © Copyright 2017 Inderscience
Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Demand uncertainty;
Group technology; Kruskal-Wallis test; Nonlinear mathematical model; SGAs;
Statistical analysis; Stochastic genetic algorithms; Unit piece flow
pp. 53-67;
Aghajani, A., Didehbani, S.A., Zadahmad, M., Seyedrezaei, M.H., Mohsenian, O., A
multi-objective mathematical model for cellular manufacturing systems design with
probabilistic demand and machine reliability analysis (2014) The International
problem (1997) Computers & Industrial Engineering, 32 (1), pp. 169-185;
Ang, C.L., Willey, P.C.T., A comparative study of the performance of pure and
hybrid group technology manufacturing systems using computer simulation techniques
3651-3669;
Canto dos Santos, J.V., Costa, I.F., Nogueira, T., New genetic algorithms for
contingencies selection in the static security analysis of electric power systems
Chattopadhyay, M., Sengupta, S., Dan, P.K., Mazumdar, S., Neuro-genetic impact on
cell formation methods of cellular manufacturing system design: A quantitative
review and analysis (2013) Computers & Industrial Engineering, 64 (1), pp. 256-272;
Eǧilmez, G., Süer, G.A., Stochastic cell loading to minimize nT subject to maximum
acceptable probability of tardiness (2014) Journal of Manufacturing Systems, 35
(1), pp. 136-143., April;
pp. 578-588;
63 (4), pp. 842-854;
Egilmez, G., Suer, G.A., Ozguner, O., Stochastic capacitated cellular manufacturing
system design with hybrid similarity coefficient (2011) Manufacturing System, ,
http://www.intechopen.com/books/manufacturing-system/stochastic-capacitated-
cellular-manufacturing-system-design-with-hybrid-similarity-coefficient, Faieza
Abdul Aziz (Ed.);
Gen, M., Cheng, R., (1999) Genetic Algorithms and Engineering Optimization, p.
512., Parsaei, H.R. (Ed.) Wiley-Interscience, New York;
Ghosh, T., Sengupta, S., Chattopadhyay, M., Dan, P., Meta-heuristics in cellular
Engineering Computations, 2 (1), pp. 87-122;
Learning, , Addison-Wesley Pub. Co., Mass;
Gu, P., Process-based machine grouping for cellular manufacturing systems (1991)
Computers in Industry, 17 (1), pp. 9-17;
Gupta, Y.P., Gupta, M.G., Kumar, A., Sundram, G., Minimizing total intercell and
Hao, J.-X., Yu, Y., Law, R., Fong, D.K.C., A genetic algorithm-based learning
approach to understand customer satisfaction with OTA websites (2015) Tourism
Management, 48 (1), pp. 231-241;
Harhalakis, G., Minis, I., Nagi, R., (1993) Manufacturing Cell Formation Under
Random Product Demand, , Technical Research Report, Institute for Systems Research;
Herring, R.H., Eden, M.R., De novo molecular design using a graph-based genetic
algorithm approach (2014) 24th European Symposium on Computer Aided Process
Engineering. Computer Aided Chemical Engineering, 33, pp. 7-12., Elsevier;
Holland, J.H., (1975) Adaptation in Natural and Artificial Systems, , 2nd ed., MIT
Press, Cambridge, MA;
Jia, G., Kong, W., An multi-objective optimal model to solve the dynamic cell
formation problem considering machine sharing (2014) Journal of Computational
Information Systems, 2 (2), pp. 513-522;
Joines, J., Culbret, C.T., King, R.E., Manufacturing cell design: An integer
69-85;
Kusiak, A., Heragu, S.S., Group technology (1987) Computers in Industry, 9 (2), pp.
83-91;
Lian, J., Liu, C., Li, W., Evans, S., Yin, Y., Formation of independent
1014-1025;
selection (2013) International Journal of Computer Integrated Manufacturing, 27
(8), pp. 772-786;
(4), pp. 2308-2316;
Saad, S., The reconfiguration issues in manufacturing systems (2003) Journal of
Materials Processing Technology, 138 (1-3), pp. 277-283;
(9-12), pp. 1635-1652;
Saidi-Mehrabad, M., Ghezavati, V., Designing cellular manufacturing systems under
uncertainty (2009) Journal of Uncertain Systems, 3 (4), pp. 315-320;
Satoglu, S.I., Suresh, N.C., A goal-programming approach for design of hybrid
cellular manufacturing systems in dual resource constrained environments (2009)
grouping efficacy-based genetic algorithm (2014) International Journal of
Shtubt, A., Modelling group technology cell formation as a generalized assignment
Research, 28 (1), pp. 145-152;
Suer, G.A., Huang, J., Sripathi, M., Design of dedicated, shared and remainder
cells in a probabilistic demand environment (2010) International Journal of
Production Research, 48 (19-20), pp. 5613-5646;
Süer, G.A., Mese, E.M., Egilmez, G., Cell loading, family and job scheduling to
minimize TT (2011) International Conference on IML;
Tatikondat, M.V., Wemmerlov, U., Adoption and implementation of group technology
classification and coding systems: Insights from seven case studies (1992)
Vin, E., Delchambre, A., Generalized cell formation: Iterative versus simultaneous
resolution with grouping genetic algorithm (2014) Journal of Intelligent
layout problems under variable demand in cellular manufacturing systems (2001)
Computers in Industry, 46 (2), pp. 181-188;
part populations (1999) 31 IIE Transactions, , 11-20-20, Springer, Netherlands;
Won, Y., Currie, K.R., An effective p-median model considering production factors
in machine cell/part family formation (2006) Journal of Manufacturing Systems, 25
(1), pp. 58-64;
181 (1), pp. 156-167;
Economics, 101 (2), pp. 329-352;
Zeidi, J.R., Javadian, N., Tavakkoli-Moghaddam, R., Jolai, F., A hybrid multi-
objective approach based on the genetic algorithm and neural network to design an
incremental cellular manufacturing system (2013) Computers & Industrial
Engineering, 66 (4), pp. 1004-1014
CORRESPONDENCE ADDRESS: Egilmez, G.; Department of Mechanical and Industrial
Engineering, University of New Haven, Buckman Hall, 218, 300 Boston Post Road,
ISSN: 17442370
SOURCE: Scopus
Sengupta, S., Ghosh, T., Dan, P.K.

53664408800;52163539500;26325403400;
A hybrid neural network approach to cell formation in cellular manufacturing
(2011) International Journal of Intelligent Systems Technologies and Applications,
10 (4), pp. 360-376. Cited 4 times.
84861387519&doi=10.1504%2fIJISTA.2011.045484&partnerID=40&md5=b8a730aeea6a301f684a3
f532aa8286a
DOI: 10.1504/IJISTA.2011.045484
AFFILIATIONS: Department of Industrial Engineering and Management, West Bengal
University of Technology, BF 142, Salt Lake City, Kolkata 700064, India
ABSTRACT: The design of Cellular Manufacturing Systems (CMS) has attained the
significant interest of academicians, researchers and practitioners over the last
three decades. CMS is regarded as an efficient production strategy for batch type
of production. Literature suggests that since the last two decades neural network
based methods have been intensively used in cell formation problems while
production factor such as operation time is merely considered. This paper presents
a new hybrid neural network approach, Fuzzy ARTCentroid Linkage Clustering
Technique (FACLCT), to solve the part machine grouping problems in cellular
manufacturing systems considering operation time. The performance of the proposed
technique is tested with problems from open literature and the results are compared
with the existing clustering models such as simple C-Linkage, K-Means, modified
ART1 and genetic algorithm and achieved better performance. The novelty of this
study lies in the simple and efficient methodology to produce quick solutions with
least computational efforts. Copyright © 2011 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Agglomerative clustering; Artificial neural network; Cell
formation; Cellular manufacturing; Centroid linkage; Fuzzy adaptive resonance
theory; Group technology
REFERENCES: Anderberg, M.R., Cluster analysis for applications (1973) Probability
and Mathematical Statistics, 19., Academic Press, New York;
Askin, R.G., Subramanian, S.P., A cost based heuristic for grouping technology
113;
pp. 2097-2116;
problem in cellular manufacturing: A framework using fuzzy ART (1995) Journal of
Carpenter, G.A., Grossberg, S., Rosen, D.B., Fuzzy art: Fast stable learning and
Chang, C.-H., Ye, Z., Zhang, M., Fuzzy-ART based adaptive digital watermarking
scheme (2005) IEEE Transactions on Circuits and Systems for Video Technology, 15
(1), pp. 65-81., DOI 10.1109/TCSVT.2004.839992;
Research, 24 (5), pp. 1221-1233;
Research, 24 (2), pp. 451-464;
binary data matrices for grouptechnology (1989) International Journal of Production
Research, 27 (6), pp. 1035-1052;
Dagli, C., Huggahalli, R., (1991) Neural Network Approach to Group Technology,
Knowledge- Based Systems and Neural Networks: Techniques and Applications, pp. 213-
228., Elsevier, New York;
Enke, D., Ratanapan, K., Dagli, C., Large machine-part family formation utilizing a
parallel ART1 neural network (2000) Journal of Intelligent Manufacturing, 11 (6),
pp. 591-604., DOI 10.1023/A:1026508623947;
Kao, Y., Moon, Y.B., Unified Group Technology implementation using the
Engineering, 20 (4), pp. 425-437., DOI 10.1016/0360-8352(91)90015-X;
919-946;
Research, 18 (2), pp. 213-232;
117-133;
(3), pp. 387-397., DOI 10.1016/0377-2217(86)90032-9;
Ravi Kumar, K., Vannelli, A., Strategic subcontracting for efficient disaggregated
1715-1728;
pp. 2633-2646;
Mahapatra, S.S., Sudhakarapandian, R., Generalized machine cell formation using
modified ART1 (2005) International Conference on Productivity and Quality Research,
ICPQR, , December, Indian Institute of Technology, New Delhi, India;
Mahapatra, S.S., Sudhakarapandian, R., Adaptive resonance theory applied to
generalized machine cell formation (2006) International Journal for Manufacturing
Science and Technology, 8 (1), pp. 13-21;
Mahapatra, S.S., Sudhakarapandian, R., Genetic cell formation using ratio level
993-1009;
of Uncertainty;
Peker, A., Kara, Y., Parameter setting of the fuzzy ART neural network to part-
42 (6), pp. 1257-1278;
Ponnambalam, S.G., Sudhakarapandian, R., Mohapatra, S.S., Saravanasankar, S., Cell
formation with workload data in cellular manufacturing system using genetic
algorithm (2007) IEEM 2007: 2007 IEEE International Conference on Industrial
Engineering and Engineering Management, pp. 674-678., DOI
10.1109/IEEM.2007.4419275, 4419275, IEEM 2007: 2007 IEEE International Conference
on Industrial Engineering and Engineering Management;
Rajagopalan, R., Batra, J.L., Design of cellular manufacturing systems: A graph
567-579;
382-388;
Systems, 13 (2), pp. 119-127;
Research, 29, pp. 463-478;
and Production Economic, 9, pp. 73-81;
(7), pp. 1693-1713;
Sudhakarapandian, R., (2007) Application of Soft Computing Techniques for Cell
Formation Considering Operational Time and Sequence, , PhD Thesis, NIT Rourkela,
India;
(4), pp. 3335-3357;
Wasserman, P.D., (1989) Neural Computing: Theory and Practice, , Van Nostrand
Reinhold Co., New York;
Waghodekar, P.H., Sahu, S., Machine component cell formation in group technology:
Wemmerlöv, U., Hyer, N.L., Cellular manufacturing in the US: A survey of users
part-machine grouping in cellular manufacturing (2007) International Journal of
Production Research, 45 (9), pp. 2073-2104., DOI 10.1080/00207540600635227, PII
773232622
CORRESPONDENCE ADDRESS: Ghosh, T.; Department of Industrial Engineering and
Management, West Bengal University of Technology, BF 142, Salt Lake City, Kolkata
700064, India; email: [email protected]
ISSN: 17408865
ABBREVIATED SOURCE TITLE: Int. J. Intell. Syst. Technol. Appl.
SOURCE: Scopus

35789896200;7203045062;
Ex-CLASS: Extended Cell formation and LAyout Selection considering production
parameters with sequence data
(2010) International Journal of Product Development, 10 (1-3), pp. 180-200. Cited 7
times.
77950639447&doi=10.1504%2fIJPD.2010.029992&partnerID=40&md5=18511aecc5fc5649a5924e2
c17ee8197
DOI: 10.1504/IJPD.2010.029992
Engineering, Indian School of Mines University, India;
Department of Mechanical Engineering, MNNIT, India
ABSTRACT: The design of a Cellular Manufacturing System (CMS) often involves three
major decisions: cell formation, facility layout within the cells and cell layout
within the system. Ideally, these decisions should be addressed in order to obtain
the complete result. A large number of papers on cell formation and layout design
have been published so far, but very few of them have considered these objectives
simultaneously. Consideration of important production parameters like operation
sequence, production volume and batch size make the cell formation problem complex
but more realistic. In this paper, a solution methodology has been developed that
identifies part families/machine grouping and also provides amicable
intercell/intracell facility layout design. The computational procedure of the
algorithm has been illustrated by an example. Numerical results indicate that the
proposed methodology is flexible and efficient. Further, it also points to the
untapped potential of such an approach to solve CMS design and layout problems
using sequence data. © 2010 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation; Facility layout; Operation sequence
weighted similarity coefficients (2005) Computers and Industrial Engineering, 48
(3), pp. 553-570., DOI 10.1016/j.cie.2003.03.008, PII S0360835204002025,
2315;
feasibility of cellular manufacturing without initial machine-part clustering
Ballakur Arvind, Steudel Harold, J., WITHIN-CELL UTILIZATION BASED HEURISTIC FOR
DESIGNING CELLULAR MANUFACTURING SYSTEMS. (1987) International Journal of
139;
Chandrasekharan, M.P., Rajagopalan, R., Multidimensional scaling algorithm for
Economics, 32 (1), pp. 65-76., DOI 10.1016/0925-5273(93)90008-9;
Choobineh, F., FRAMEWORK FOR THE DESIGN OF CELLULAR MANUFACTURING SYSTEMS. (1988)
S0925527306000995;
Dixit, A.R., Mishra, P.K., Heuristic based approach of cell formation considering
and Engineering Management, ICMEEM-44 The World Congress on Engineering 2007
Proceedings, 2, pp. 1101-1107., London 978-988-98671-2-6;
Hassan, M.M.D., Machine layout problem in modern manufacturing facilities (1994)
Heragu, S.S., Recent models and techniques for solving the layout problem (1992)
Mintercell movements and balancing workload among duplicated machines (1997)
in the bidirectional linear flow layout (2001) International Journal of Production
Research, 39, pp. 3491-3512;
Lu, T.C., (1993) Integrated approach for hybrid shop layout, , MS thesis, The
University of Maryland, College Park;
and layout design using sequence data (2007) Robot Compt Integr Manuf, ,
doi:10.1016/ i.reim.2007.07.011;
Decision Sci, 21, pp. 416-433;
1409-1421;
885-906., DOI 10.1080/00207540110101639
CORRESPONDENCE ADDRESS: Dixit, A. R.; Department of Mechanical Engineering and
Mining Machinery Engineering, Indian School of Mines UniversityIndia; email:
[email protected]
ISSN: 14779056
ABBREVIATED SOURCE TITLE: Int. J. Prod. Dev.
SOURCE: Scopus

24176685700;13007835700;13806002000;
Combining axiomatic design and designed experiments for cellular manufacturing
systems design framework
(2008) International Journal of Agile Systems and Management, 3 (3-4), pp. 306-319.
Cited 7 times.
78651553357&doi=10.1504%2fIJASM.2008.021215&partnerID=40&md5=905405ca6a1112562c5aab
a3764f5336
DOI: 10.1504/IJASM.2008.021215
AFFILIATIONS: Unit of Mechanic, Modelling and Production (U2MP), B.P. 1173, Sfax,
3038, Tunisia;
Department of Industrial Management, Higher Institute of Industrial Management of
Sfax, B.P. 954, Sfax, 3018, Tunisia
ABSTRACT: Cellular Manufacturing (CM) system has been recognised as an efficient
and effective way to improve productivity in a factory. In recent years, there have
been continuous research efforts to study different facet of CM system. They are
developed to satisfy only one or limited Functional Requirements (FRs) of the CM
system design. The literature does not contain much published research on CM design
which includes all design aspects. In this paper we provide a framework for the
complete CM system design. It combines Axiomatic Design (AD) and Experimental
Design (ED) to generate several feasible and potentially profitable designs. The AD
approach is used as the basis for establishing a systematic CM systems design
structure. ED has been a very useful tool to design and analyse complicated
industrial design problems. AD helps secure valid input-factors to the ED. An
element of the proposed framework is demonstrated through a numerical example for a
cell formation problem with alternative process. Copyright © 2008 Inderscience
Enterprises Ltd.
AUTHOR KEYWORDS: AD; Agile systems; Alternatives process; Axiomatic design;
Cell formation; Cellular manufacturing; CM; Design methodology; ED;
Experimental design
REFERENCES: Albano, L.D., Suh, N.P., Axiomatic approach to structural design (1992)
Research in Engineering Design, 4, pp. 171-183;
Babic, B., Axiomatic design of flexible manufacturing systems (1999) International
Box, G.E.P., Hunter, W.E., Hunter, J.S., (1978) Statistics for Experiments, , New
York: John Wiley;
Cabrera-Rios, M., Mount-Campbell, C.A., Irani, S.A., An approach to the design of a
manufacturing cell under economic consideration (2002) International Journal of
Chen, S.J., Chen, L.C., Lin, L., Knowledge-based support for simulation analysis of
manufacturing cells (2001) Computers in Industry, 44, pp. 33-49;
Engelhard, F., Improving products and systems by combining axiomatic design,
quality control-tools and designed experiments (2000) First International
Conference on Axiomatic Design, Proceedings of ICAD, , Cambridge, MA;
Gebala, D.A., Suh, N.P., An application of axiomatic design (1992) Research in
Engineering Design, 3, pp. 149-162;
Gupta, T., Saifoddini, H., Production data based similarity coefficient for
Hachicha, W., Masmoudi, F., Haddar, M., A correlation analysis approach of cell
formation in cellular manufacturing system with incorporated production data (2006)
International Journal of Manufacturing Research, 1, pp. 332-353;
1169;
Hamada, M., Wu, C.F.G., Analysis of designed experiments with complex aliasing
(1992) Journal of Quality Technology, 23, pp. 130-137;
Houshmand, M., Jamshidnezhad, B., Conceptual design of lean production systems
through an axiomatic design (2002) Second International Conference on Axiomatic
Design, Proceedings of ICAD, , Cambridge, MA;
Kamrani, A.K., Hubbard, K., Parsaep, H., Leew, H.R., Simulation-based methodology
for machine cell design (1998) Computers and Industrial Engineering, 34, pp. 173-
188;
Kim, S.J., Suh, N.P., Kim, S.G., Design of software systems based on axiomatic
design (1991) Robotics and Computer-Integrated Manufacturing, 8, pp. 243-255;
Research, 18, pp. 213-232;
Kulak, O., Durmusoglu, M.B., Tufekci, S., A complete cellular manufacturing system
design methodology based on axiomatic design principles (2005) Computers and
Masmoudi, F., Sizing manufacturing cell machines based on the simulation and an
expert system (2006) International Journal of Simulation Modelling, 5, pp. 45-55;
Silveira, G., A methodology of implementation of cellular manufacturing (1999)
Suh, N.P., (1990) The Principles of Design, , New York: Oxford University Press;
Suh, N.P., (2001) Axiomatic Design: Advances and Applications, , New York: Oxford
University Press;
Taguchi, G., (1987) System of Experimental Design, , Unipub/Kraus: International
Publication
CORRESPONDENCE ADDRESS: Hachicha, W.; Unit of Mechanic, Modelling and Production
(U2MP), B.P. 1173, Tunisia; email: [email protected]
ISSN: 17419174
ABBREVIATED SOURCE TITLE: Int. J. Agil. Syst. Manag.
SOURCE: Scopus
Ponnambalam, S.G., Sudhakarapandian, R., Mohapatra, S.S., Saravanasankar, S.

7005929538;24173456100;56370976300;23975020200;
Cell formation with workload data in cellular manufacturing system using genetic
algorithm
Engineering Management, art. no. 4419275, pp. 674-678. Cited 9 times.
40649127480&doi=10.1109%2fIEEM.2007.4419275&partnerID=40&md5=4a0b3fea7a14aff89772cd
c88d350c78
DOI: 10.1109/IEEM.2007.4419275
AFFILIATIONS: School of Engineering, Monash University, 46150 Petaling Jaya,
Malaysia;
Kalasalingam University, Virudhunagar, India;
National Institute of Technology, Rourkela, India
ABSTRACT: Cellular Manufacturing System (CMS) is regarded as an efficient
production strategy for batch type of production. CMS rests on the principle of
grouping the machines into machine cells and parts into part families based on
suitable similarity criteria. Usually zero-one machine-part incidence matrix (MPIM)
obtained from the route sheet information is used to form machine cells. In this
paper, an attempt has been made to solve the cell formation problem considering
work load data and a genetic algorithm (GA) is suggested to form machine cells and
part families. The performance of the proposed algorithm is compared with existing
algorithms such as K-means algorithm and modified ART1 algorithm found in the
literature using a newly defined performance measure known as modified grouping
efficiency (MGE). The proposed algorithm is tested with problems from open
literature and the results are compared with the existing algorithms found in the
literature. The results support the better performance of the proposed algorithm. ©
2007 IEEE.
AUTHOR KEYWORDS: Cell formation; Genetic algorithm; Grouping efficiency
INDEX KEYWORDS: Cellular automata; Genetic algorithms; Problem solving; Production
engineering, Cell formation; Grouping efficiency; K-means algorithms; Machine-part
incidence matrix (MPIM); Modified grouping efficiency (MGE), Systems engineering
REFERENCES: Burbidge, J.L., A Manual Method of Production Flow Analysis (1977) The
(1986) HE Transactions, 21, pp. 382-388;
King, (1980) Machine Component grouping in production flow analysis: An approach
using a rank order clustering algorithm, International Journal of Production
Research, 18 (2), pp. 213-232;
Rajagopalan, Batra, Design of cellular manufacturing systems: A graph theoretic
Research, 24 (5), pp. 1221-1233;
Chandrasekaran, M.P., Rajagopalan, R., ZODIAC: An algorithm for concurrent
formation of part families and machine cells (1987) International Joumalof
Venugopal, V., Narendran, T.T., (1992) A genetic algorithm approach to the machine
component grouping problem with multiple objectives, Computers and Industrial
Engineering22, pp. 469-480;
Jose Fernando, Maurico, (2002) A Hybrid Genetic Algorithm in cell formation
problems, AT&T Labs Research Technical Report TD-5FE6RN, AT&T Labs Research,
Florham Park, NJ 07932 USA; Carpenter, G.A., Grossberg, S., Adaptive
ResonanceTheory, A Handbook of Brain Theory and Neural Networks (2002) MIT Press, ,
Second Edition ,Massachusetts, USA;
Zolfaghari, Liang, M., (2003) A new genetic algorithm for the machine/part grouping
problem involving processing times and lot sizes, Computers and Industrial
engineering, 45, pp. 713-731;
K.R.Kumar and Chandrasekaran.M.P, (1990) Grouping efficacy: A quantitative
criterion forgoodness of block diagonal forms of binary matrices in group
technology, International Journal of Production Research, 28, 2233-243; Cheung, Y.-
M., K-means: A new generalized K- means clustering algorithm (2003) Pattern
Recognition Letters, 24, pp. 2883-2893;
Mahapatra, S.S., Sudhakarapandian, R., Adaptive Resonance Theory Applied To
Generalized Machine Cell Formation (2006) International Journal for Manufacturing
Science & Technology, 8 (1), pp. 13-21
CORRESPONDENCE ADDRESS: Ponnambalam, S.G.; School of Engineering, Monash
University, 46150 Petaling Jaya, Malaysia; email: [email protected]
ISBN: 1424415292; 9781424415298
SOURCE: Scopus
Subramaniam, V., Siong, W.Y., Reddy, K.R.B.

7102946560;15756336700;6508002909;
Cell formation with multiple process plans and manufacturing attributes
(2006) International Journal of Computer Applications in Technology, 27 (1), pp.
38-50. Cited 1 time.
33845918813&doi=10.1504%2fIJCAT.2006.010988&partnerID=40&md5=54e032a32bc11295c1fc9d
3e002a6fe8
DOI: 10.1504/IJCAT.2006.010988
AFFILIATIONS: Department of Mechanical Engineering, National University of
Singapore, 10 Kent Ridge Crescent, Singapore 119260, Singapore;
Innovation in Manufacturing Systems and Technology, Singapore-MIT Alliance, 50
Nanyang Avenue, Singapore 639798, Singapore
ABSTRACT: In the past decade, substantial research was focused on the development
of new cell formation procedures. Group formation of machines and parts in cellular
manufacturing systems is often achieved by using the similarity of part operations.
However during cell formation, factors that relate to manufacturing attributes are
often ignored. This paper presents an approach to the cell formation problem that
simultaneously uses multiple process plans, cost requirements and manufacturing
attributes. In addition, it addresses the objective of minimising total costs, by
considering parameters such as operation sequence, machine capacity, demand,
various costs, etc. The effectiveness of the proposed approach is demonstrated with
two problems derived from the literature. The results are compared and discussed
with respect to the solutions reported in the literature. The results indicate that
the proposed method provides a solution that has the least total cost compared to
the other solutions reported in the literature. Copyright © 2006 Inderscience
Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Clustering;
Mathematical programming
INDEX KEYWORDS: Cellular manufacturing; Costs; Mathematical programming;
Optimization; Problem solving; Research and development management, Cell formation;
Clustering; Manufacturing attributes, Process control
1361-1380;
2347;
Baykasoglu, A., Gindy, N.N.Z., MOCACEF 1.0: Multiple objective capability approach
to form part-machine groups for cellular manufacturing applications (2000)
2601-2614;
Planning, Design and Analysis of Cellular Manufacturing Systems, pp. 3-46.,
Kamrani. A, Parsaei, H.R. and Liles, D.H, Eds, Elsevier Science Publishers, pp;
pp. 1259-1273;
Ham, I., Hitomi, K., Yoshida, T., (1985) Group Technology Applications to
Production Management, , Kluwer-Nijhoff Publishing;
Lozano, S., Guerrero, F., Eguia, I., Onieva, L., Cell design and loading in
presence of alternative loading (1999) International Journal of Production
Research, 37 (14), pp. 3289-3304;
16, pp. 235-245;
Control, , Chapman & Hall;
707-720;
Research, 105 (3), pp. 537-551;
Van Hentenryck, P., (1999) The OPL Optimization Programming Language, , The MIT
Press;
1613;
Won, Y., Kim, S., Multiple criteria clustering algorithm for solving the Group
Technology problem with multiple process routings (1997) Computers and Industrial
Engineering, 32 (1), pp. 207-220;
Research, 38 (2), pp. 385-395
CORRESPONDENCE ADDRESS: Subramaniam, V.; Department of Mechanical Engineering,
National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260,
Singapore; email: [email protected]
ISSN: 09528091
CODEN: IJCTE
ABBREVIATED SOURCE TITLE: Int J Comput Appl Technol
SOURCE: Scopus
Wang, X., Tang, J.

57211223157;55804452600;
A review of cell formation from perspective of objective function
(2006) Wuhan Ligong Daxue Xuebao/Journal of Wuhan University of Technology, 28
(SUPPL. 1), pp. 686-689. Cited 1 time.
33845893045&partnerID=40&md5=688fa2599b239743cad8abf2901b1308
AFFILIATIONS: Dept. of Systems Engineering, College of Information Science and

Engineering, Northeastern University, shenyang 110004, China
ABSTRACT: The initial and significant step in the design of a cellular
manufacturing system is cell formation (CF). CF problem is proposed in this paper
as a decision problem that determines to manufacture specified types of part in a
manufacturing plant which machines and their associated parts are grouped together
to form cell in a way that a concerned objective is optimized. For describing CF
problem clearly, this paper firstly presents a review of cell formation problem
from the view points of objective function. The CF problems are classified into
three categories, which are cost oriented, flexibility oriented and grouping
efficiency oriented CF problems. Then, the paper presents a comprehensive
conceptual mathematical formulation describing the general cost problem and a
decision variable for comprehensive describing routing flexibility and two trade-
off questions in grouping efficiency issues. Finally, based on the review and
discussion, the paper proposes five directions for future research in the CF field.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Flexibility; Grouping
efficiency; Survey
CORRESPONDENCE ADDRESS: Wang, X.; Dept. of Systems Engineering, College of
Information Science and Engineering, Northeastern University, shenyang 110004,
China; email: [email protected]
ISSN: 16714431
ABBREVIATED SOURCE TITLE: Wuhan Ligong Daxue Xuebao
SOURCE: Scopus
Hu, L., Yasuda, K.

55470175000;13405856800;
Minimising material handing cost in cell formation with alternative processing
routes by grouping genetic algorithm
times.
33646402346&doi=10.1016%2fj.chemolab.2005.07.008&partnerID=40&md5=baf88b69aeaee328c
163a74efd704c3f
DOI: 10.1016/j.chemolab.2005.07.008
Management, Tohoku University, Kawauchi, Aoha-ku, Sendai, 980-8576, Japan
ABSTRACT: The alternative processing route is one of the important design factors
for the cell formation problem (CFP) in cellular manufacturing systems (CMSs).
Genetic algorithm (GA) is a popular method for solving the CFPs, because GA is
capable of searching large regions of the solution's space while being less
susceptible to getting trapped in local optima. However, the disadvantage of
classical GAs is that the number of manufacturing cells should be known in advance.
Knowing the actual number of manufacturing cells is relatively difficult before the
CMS design is determined. Grouping genetic algorithm (GGA) is capable of solving
CFP without predetermination of the number of cells, which is introduced by
Falkenauer's GGA (1998). In order to adopt the GGA on CFP with alternative
processing routes, we develop a new chromosome representation, a local optimisation
algorithm for crossover operator and special mutation operators. These efforts
ensure the efficiency of our method and are indicated in the numerical examples,
and improved solutions are also obtained in the numerical examples.
AUTHOR KEYWORDS: Alternative processing routes; Cell formation; Cellular
manufacturing; Grouping genetic algorithm
INDEX KEYWORDS: Genetic algorithms; Materials handling; Numerical methods;
Optimization; Problem solving, Alternative processing routes; Cell formation;
Grouping genetic algorithm, Cellular manufacturing
moves in group technology cell formation (2000) J. Manuf. Syst., 19, pp. 305-317;
Aytug, H., Khouja, M., Vergara, F.E., Use of genetic algorithms to solve production
and operations management problems: A review (2003) Int. J. Prod. Res., 41, pp.
3955-4009;
Brown, B.C., Sumichrast, R.T., CF-GGA: A grouping genetic algorithm for the cell
plans and machine capacity constraints: A new combined approach (2000) Int. J.
Prod. Econ., 64, pp. 279-284;
pp. 257-271;
Falkenauer, E., (1998) Genetic Algorithms for Grouping Problem, , Wiley: New York;
Learning, , Addison-Wesley: Reading, MA;
Op. Res., 109, pp. 286-298;
Michigan Press: Ann Arbor;
constrained optimisation problems with genetic algorithms (1994) Proceedings of the
1994 IEEE International Symposium EC., pp. 579-584., Orlando, FL;
Kusiak, A., The generalised group technology concept (1987) Int. J. Prod. Res., 25,
pp. 561-569;
(1994) Int. J. Prod. Res., 32, pp. 273-297;
presence of alternative routing (1999) Int. J. Prod. Res., 37, pp. 3289-3304;
Meents, I., A genetic algorithm for the group-technology problem (2001)
Applications of Evolutionary Computing. Proceedings of EvoWorkshops 2001: EvoCOP,
EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, pp. 90-99., Como, Italy, 18-20 April;
Programs, , Springer-Verlag: New York;
Nagi, N., Harhalakis, G., Proth, J.M., Multiple routings and capacity
2243-2257;
design and organisation of manufacturing systems (2003) Comp. & Ind. Eng., 44, pp.
339-364;
grouping technology systems (1993) Euro. J. Op. Res., 69, pp. 373-383;
Shanker, K., Agrawal, A.K., Models and solution methodologies for the generalised
grouping problem in cellular manufacturing (1997) Int. J. Prod. Res., 35, pp. 513-
538;
formulation of machine cells in group technology (1997) Int. J. Prod. Res., 35, pp.
501-511;
(1996) Int. J. Ind. Eng., 3, pp. 114-125;
component grouping problem with multiple objectives (1992) Comp. & Ind. Eng., 22,
pp. 469-480;
problem involving processing times and lot sises (2003) Comp. & Ind. Eng., 45, pp.
713-731
CORRESPONDENCE ADDRESS: Hu, L.; Industrial and Management Science, Graduate School
of Economics and Management, Tohoku University, Kawauchi, Aoha-ku, Sendai, 980-
8576, Japan; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Slomp, J., Suresh, N.C.

6603677460;7004424841;
The shift team formation problem in multi-shift manufacturing operations
times.
13444291286&doi=10.1016%2fj.ejor.2004.01.034&partnerID=40&md5=c6c584fda014a6588eb2a
704f11935e8
DOI: 10.1016/j.ejor.2004.01.034
AFFILIATIONS: Fac. of Management and Organization, University of Groningen,
Landleven 5, 9700 AV Groningen, Netherlands;
School of Management, State University of New York, Buffalo, NY 14260-4000, United
States
ABSTRACT: This paper addresses the problem of assigning operators to teams that
work in 1-, 2-, or 3-daily-shift systems. The problem was motivated by, and
illustrated with a case situation encountered in Dutch manufacturing industry. The
problem addressed forms an extension of cell formation problems which are currently
in the phase of addressing labor-related issues in cell design. A generalized goal
problem formulation is presented to address multiple, conflicting objectives
covering cross-training of workers, ensuring adequate levels of labor flexibility
and minimizing labor-related costs. The proposed solution procedure consists of two
phases. In the first phase, shift systems, in which applicable machines and the
sizes of each shift team are identified. The next phase deals with assignment of
operators to various teams and identification of specific cross-training needs for
various workers. This phase involves the use of interactive goal programming. The
methodology is illustrated by a numerical example derived from the case situation.
© 2004 Elsevier B.V. All rights reserved.
AUTHOR KEYWORDS: Goal programming; Manufacturing; Shift systems
INDEX KEYWORDS: Cellular manufacturing; Industrial management; Integer programming;
Optimization; Personnel; Personnel training; Problem solving; Resource allocation,
Cross-training; Goal programming (GP); Load imbalances; Shift systems, Operations
research
REFERENCES: Askin, R.G., Huang, Y., Forming effective worker teams for cellular
2431-2451;
Barton, J., Folkard, S., Advancing versus delaying shift systems (1993) Ergonomics,
36 (1-3), pp. 59-64;
Benders, J., (1993) Optional Options: Work Design and Manufacturing Automation, ,
Aldershot: Avebury;
Brusco, M.J., Johns, T.R., Staffing a multi-skilled workforce with varying levels
of productivity: An analysis of cross-training policies (1998) Decision Sciences,
29 (2), pp. 499-516;
Clark, J., Full flexibility and self-supervision in an automated factory (1993)
Human Resource Management and Technical Change, pp. 116-136., J. Clark. Broughton
Gifford: Cornwell Press Ltd;
Daus, C.S., Sanders, D.N., Campbell, D.P., Consequences of alternative
workschedules (1998) International Review of Industrial and Organizational
Psychology, 13, pp. 185-223;
Ebeling, A.C., Lee, C.-Y., Cross-training effectiveness and profitability (1994)
Edie, L.C., Traffic delays at toll booths (1954) Operations Research, 2 (2), pp.
107-138;
Hung, R., Shift work scheduling algorithms with phase-delay feature (1997)
(1999) LINGO Optimization Modeling Language (User Manual), , Chicago, IL;
Malhotra, M.K., Fry, T.D., Kher, H.V., Donohue, J.M., The impact of learning and
labour attrition on worker flexibility and dual resource constrained job shops
(1993) Decision Sciences, 24 (3), pp. 641-662;
Molleman, E., Variety and the requisite of self-organization (1998) The
International Journal of Organizational Analysis, 6, pp. 109-131;
Molleman, E., Slomp, J., The impact of technological innovations on work design in
a cellular manufacturing environment (2001) New Technology Work and Employment, 16
(3), pp. 152-163;
Molleman, E., Slomp, J., Rolefes, S., The evolution of a cellular manufacturing
system - A longitudinal case study (2002) International Journal of Production
Moore-Ede, M., (1993) The Twenty-four Hour Society, , Reading, MA: Addison-Wesley;
Mueller, F., Designing flexible teamwork: Comparing German and Japanese approaches
(1992) Employee Relations, 14, pp. 5-16;
Spronk, J., (1981) Interactive Multiple Goal Programming: Applications to Financial
Planning, , Boston, MA: Martinus Nijhoff;
Süer, G.A., Optimal operator assignment and cell loading in labor-intensive
manufacturing cells (1996) Computers and Industrial Engineering, 26 (4), pp. 155-
159;
Suresh, N.C., Slomp, J., Labor assignment and grouping in cellular manufacturing -
A multi-objective methodology (2001) International Journal of Production Research,
39 (18), pp. 4103-4131;
Treleven, M., A review of the dual resource constrained system research (1989) IIE
Transactions, 21 (3), pp. 279-287
CORRESPONDENCE ADDRESS: Slomp, J.; Fac. of Management and Organization, University
of Groningen, Landleven 5, 9700 AV Groningen, Netherlands; email:
[email protected]
ISSN: 03772217
CODEN: EJORD
SOURCE: Scopus
Jayaswal, S., Adil, G.K.

36666646500;24392168900;
Efficient algorithm for cell formation with sequence data, machine replications and
alternative process routings
52 times.
2942622130&doi=10.1080%2f00207540310001652914&partnerID=40&md5=f69756dbe0107b618f87
4f6cf997ab56
DOI: 10.1080/00207540310001652914
AFFILIATIONS: Indust. Eng. and Operations Research, Indian Institute of Technology,
Bombay, India;
Shailesh J. Mehta Sch. of Management, Indian Institute of Technology, Mumbai
400076, India
ABSTRACT: Cell formation is an important problem in the design of a cellular
manufacturing system. Despite a large number of papers on cell formation being
published, only a handful incorporate operation sequence in intercell move
calculations and consider alternative process routings, cell size, production
volume and allocating units of identical machines into different cells. Modelling
the above factors makes the cell formation problem complex but more realistic. The
paper develops a model and solution methodology for a problem of cell formation to
minimize the sum of costs of intercell moves, machine investment and machine
operating costs considering all the factors mentioned above. An algorithm comprised
of simulated annealing and local search heuristics has been developed to solve the
model. A limited comparison of the proposed algorithm with an optimal solution
generated by complete enumeration of small problems indicates that the algorithm
produces a solution of excellent quality. Large problems with 100 parts and 50
machine types are efficiently solved using the algorithm.
INDEX KEYWORDS: Algorithms; Computer simulation; Machining; Materials handling;
Problem solving; Production engineering, Cell formation; Machine replications;
Operation sequence; Process routings, Cellular manufacturing
REFERENCES: Beaulieu, A., Gharbi, A., Ait-Kadi, D., An algorithm for the cell
formation and the machine selection problems in the design of a cellular
1857-1874;
Burbidge, J.L., Production flow analysis in planning group technology (1991)
Lozano, S., Guerrero, F., Eguia, L., Onieva, L., Cell design and loading in the
Research, 37, pp. 3289-3304;
Seifoddini, H., Duplication process in machine cells formation in Group Technology
Shanker, K., Agarwal, A.K., Models and solution methodologies for the generalized
grouping problem in cellular manufacturing (1997) International Journal of
707-720;
2185-2207;
2043;
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the U.S. industry - A survey
of users (1989) International Journal of Production Research, 27, pp. 1511-1530;
2755-2768;
36, pp. 2099-2114;
Wu, N., Salvendy, G., An efficient heuristic for the design of cellular
manufacturing systems with multiple identical machines (1999) International Journal
885-906;
CORRESPONDENCE ADDRESS: Adil, G.K.; Shailesh J. Mehta Sch. of Management, Indian
Institute of Technology, Mumbai 400076, India; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Arzi, Y., Bukchin, J., Masin, M.

6701707901;6603512228;7003325971;
An efficiency frontier approach for the design of cellular manufacturing systems in
a lumpy demand environment
times.
2217%2800%2900253-8&partnerID=40&md5=4e644cdcf81ae26490d1e6f07b48c37c
DOI: 10.1016/S0377-2217(00)00253-8
AFFILIATIONS: Department of Industrial Engineering and Management, ORT Braude
College, P.O.B. 78, Karmiel 20101, Israel;
Department of Industrial Engineering, Faculty of Engineering, Tel Aviv University,
Tel Aviv 69978, Israel;
Department of Industrial and Systems Engineering (0118), 123 New Engineering
Building, Virgina Tech, Blacksburg, VA 24061, United States
ABSTRACT: A new multi-objective approach for the cell formation problem in a lumpy
demand environment is presented. The objectives addressed in this paper are
grouping efficiency and capacity requirements. In lumpy demand the required
capacity is affected by demand variability and the correlation between the part
types assigned to the cells. We claim that since the required capacity is
determined by part types grouping, part type demands variability and their
correlation should be taken into consideration as part of the cell formation. This
new approach is discussed and formulated as a mixed integer programming model and
illustrated by a wide range of typical examples. These examples demonstrate that
when using traditional approaches designers do not obtain optimal solutions and may
make decisions on the basis of wrong results. The proposed approach helps designers
eliminate these problems and produce a reasonable cell design. A genetic algorithm
is proposed and examined for designing large-scale systems. © 2001 Elsevier Science
AUTHOR KEYWORDS: Cell formation; Genetic algorithm; Lumpy demand; Manufacturing
INDEX KEYWORDS: Cellular manufacturing; Computational methods; Correlation methods;
Genetic algorithms; Integer programming; Inventory control; Mathematical models;
Problem solving; Process engineering; Production control; Resource allocation;
Scheduling; Strategic planning, Lumpy demand; Mixed integer programming models,
Operations research
simulating annealing algorithms for cell formation (1997) IIE Transactions, 29, pp.
53-67;
Ben-Arieh, D., Traintaphyllou, E., Quantifying data for group technology with
weighted fuzzy features (1992) International Journal of Production Research, 30
(6), pp. 1285-1299;
Seminar on GT, , Turin;
109-128;
Cheng, C.H., Lee, W.H., Miltenburg, J., A bi-chromosome GA for minimizing intercell
and intracell moves (1998) Group Technology and Cellular Manufacturing: A State of
the Art Synthesis of Research and Practice, , Suresh, N.C., Kay, J.M. (Eds.),
Kluwer Academic Publishers, Dordrecht, MA;
Knowledge Based Systems and Neural Networks: Techniques and Applications, ,
Elsevier, New York;
Gupta, Y., Gupta, M., Kumar, A., Sundaram, C., A genetic algorithm approach to cell
composition and layout design problems (1996) International Journal of Production
Research, 34 (2), pp. 447-482;
Joines, J.A., Culberth, C.T., King, R.E., Manufacturing cell design: An integer
85;
pp. 1353-1367;
King, J.R., Machine-component group formation in production flow analysis (1980)
King, J.R., Nakornchai, V., Machine-component group formation in group technology -
pp. 117-133;
Branch and bound and A* approaches (1993) IIE transactions, 25 (4), pp. 46-56;
reorganization by clustering technique (1972) Operations Research, 20, pp. 993-
1009;
Mitchell, M., (1996) An Introduction to Genetic Algorithms, , MIT Press, Cambridge,
MA;
Peterson, R., Silver, E.A., (1979) Decision Systems for Inventory Management and
Production Planning, , Wiley, New York;
Rajagopalan, R., Batra, J.L., Design of cellular production systems, a graph
567-579;
Reismam, A., Kumar, A., Motwani, J., Cheng, C.H., Cellular manufacturing: A
statistical review of the literature 1965-1995 (1997) Operations Research, 45 (4),
pp. 508-520;
Shafer, S.M., Part-machine labour grouping: The problem and solution methods (1998)
Group Technology and Cellular Manufacturing: A State of the Art Synthesis of
Research and Practice, pp. 131-152., Suresh, N.C., Kay, J.M. (Eds.), Kluwer
Academic Publishers, Dordrecht;
clustering efficiency measures for machine part matrix clustering (1995) IIE
Snead, C.S., (1989) Group Technology Foundation for Competitive Manufacturing, ,
Van Nostrand Reinhold, New York;
Wemmerlov, U., Hyer, N.L., Cellular Manufacturing in the US industry: A survey of
Wu, H., Venugopal, V., Barash, M., Design of cellular manufacturing system: A
systematic pattern recognition approach (1986) Journal of Manufacturing Systems, 5
(2), pp. 81-88
CORRESPONDENCE ADDRESS: Bukchin, J.; Department of Industrial, 123 New Engineering
Building, Virgina Tech., Blacksburg, VA 24061, United States; email:
[email protected]
ISSN: 03772217
CODEN: EJORD
SOURCE: Scopus
Boucher, T.O., Yalcin, A., Tai, T.
7005602474;7006550086;7102769126;
Dynamic routing and the performance of automated manufacturing cells
Cited 18 times.
0034288618&doi=10.1080%2f07408170008967455&partnerID=40&md5=89ab343a8c33a6eb23786ee
4d339cd56
DOI: 10.1080/07408170008967455
AFFILIATIONS: Industrial and Systems Engineering, Rutgers University, 96
Frelinghuysen Road, Piscataway, NJ, 08854, United States
ABSTRACT: There has been a considerable amount of research done on the "cell
formation" problem, in which machining cells are designed to process a family of
components. More recently, it has been suggested that machining cells should be
designed so that they take advantage of the flexibility for processing parts that
have alternate, or multiple machine routing possibilities. It is argued that such
flexibility will improve machine utilization as well as other measures of cell
performance and may reduce the need for centralized cell loading and scheduling
algorithms. Unfortunately, if the cell is automated, routing flexibility
requirements can create a complex control problem for the cell controller. In this
paper we implement a cell controller designed to handle the requirements of the
flexible routing of parts and compare the performance of the cell to the case in
which each part has only one routing. We find that significant improvements occur
when the cell design is capable of processing parts with flexible routings. © 2000
"IIE".
INDEX KEYWORDS: Algorithms; Cellular manufacturing; Control system analysis;
Control system synthesis; Factory automation; Flexible manufacturing systems;
Scheduling, Automated manufacturing cells; Dynamic routing method, Production
control
REFERENCES: Abdin, M.F., Solution of scheduling problems of job shop type FMS with
alternative machine tools (1986) Computers and Industrial Engineering, 11, pp. 214-
245;
Al-Quattan, I., Designing flexible manufacturing cells using branch and bound
method (1990) International Journal of Production Research, 28 (2), pp. 325-336;
cellular manufacturing systems (1997) HE Trans-actions, 29 (7), pp. 599-610;
Benjaafar, S., Morin, T.L., Talavage, J.J., Strategic value of flexibility in
sequential decision making (1995) European Journal of Operations Research, 82 (3),
pp. 438-457;
Benjaafar, S., Ramakrishnan, R., Modelling, measurement and evaluation of
sequencing flexibility in manufacturing systems (1996) International Journal of
Boucher, T.O., Muckstadt, J.A., Cost estimating methods for evaluating the
conversion from a functional layout to group technology (1985) HE Transactions, 17
(3), pp. 268-276;
Brandin, B.A., The real-time supervisory control of an experimental manufacturing
cell (1996) IEEE Transactions on Robotics and Automation, 12 (1), pp. 1-14;
Byrne, M.D., Chutima, P., Real time operational control of an FMS with full routing
flexibility (1997) International Journal of Production Economics, 51, pp. 109-113;
Dahel, N.E., Smith, S.D., Designing flexibility into cellular manufacturing systems
Dutta, A., Reacting to scheduling exceptions in FMS environments (1990) HE
Ezpeleta, E., Colom, J.M., Martinez, J., Petri net based deadlock prevention policy
for flexible manufacturing systems (1997) IEEE Transactions on Robotics and
Automation, 11 (2), pp. 173-184;
Fanti, M.P., Maione, B., Mascolo, B., Turchiano, B., Eventbased feedback control
for deadlock avoidance in flexible production systems (1997) IEEE Transactions on
Ghosh, S., Gaimon, C., Routing flexibility and production scheduling in a flexible
manufacturing system (1992) European Journal of Operational Research, 60, pp. 344-
364;
Jain, A.K., Elmaraghy, H.A., Production scheduling and rescheduling in flexible
309;
Lawley, M., Reveliotis, S., Ferreira, P., Flexible manufacturing system structural
control and the neighborhood policy: Part 1, correctness and scalability (1997) HE
Lawley, M., Reveliotis, S., Ferreira, P., Flexible manufacturing system structural
control and the neighborhood policy: Part 2, generalization, optimization, and
efficiency (1997) HE Transactions, 29, pp. 889-899;
Lawley, M.A., Reveliotis, S., Ferreira, P.M., A correct and scaleable deadlock
avoidance policy for flexible manufacturing systems (1998) IEEE Transactions on
Lee, D.Y., Di Cesare, F., Scheduling flexible manufacturing systems using Petri
nets and heuristic search (1994) IEEE Transactions on Robotics and Automation, 10
(2), pp. 123-132;
Lin, G.Y.-J., Solberg, J.J., Effectiveness of flexible routing control (1991)
International Journal of Flexible Manufacturing Systems, 3, pp. 189-211;
Nasr, N., Elsayed, E.A., Job shop scheduling with alternative machines (1990)
Nof, S.Y., Barash, M.M., Solberg, J.J., Operational control of item flow in
versatile manufacturing systems (1979) International Journal of Production
Research, 17, pp. 479-489;
Rachamadugu, R., Nandkeolyar, U., Schreiber, T., Scheduling with sequencing
flexibility (1993) Decision Sciences, 24 (2), pp. 315-342;
Rachamadugu, R., Stecke, K.E., Classification and review of FMS scheduling
procedures (1994) Production Planning and Control, 5 (1), pp. 2-10;
Ramadge, P.J., Chase, C., On real-time scheduling policies for flexible
manufacturing systems (1992) IEEE Transactions on Automalic Control, 37, pp. 491-
496;
Ramadge, P.J., Wonham, W.M., Supervisory control of a class of discrete event
processes (1987) SI AM Journal of Control and Optimization, 25 (1), pp. 206-230;
Raman, N., Rachamadugu, R.V., Talbot, F.B., Real-time scheduling of an automated
machining center (1989) European Journal of Operational Research, 40, pp. 222-242;
Ramaswamy, S.E., Joshi, S.B., Deadlock-free schedules for automated manufacturing
workstations (1996) IEEE Transactions on Robotics and Automation, 12 (3), pp. 391-
400;
Reveliotis, S.A., Lawley, M.A., Ferrcira, P.M., Polynomialcomplexity deadlock
avoidance policies for sequential resource allocation systems (1997) IEEE
Transactions on Automatic Control, 42 (10), pp. 1344-1357;
373-383;
Sawik, T., Modeling and scheduling of a flexible manufacturing system (1990)
Stecke, E.K., Procedures to determine part mix ratios for independent demands in
flexible manufacturing systems (1992) IEEE Transactions on Engineering Management,
39 (4), pp. 359-369;
Stecke, E.K., Raman, N., Production planning decisions in flexible manufacturing
systems with random material flows (1994) HE Transactions, 26 (5), pp. 2-17;
Stecke, E.K., Raman, N., FMS planning decisions, operating flexibilities, and
system performance (1995) IEEE Transactions on Engineering Management, 42 (1), pp.
82-89;
Stecke, K.E., Solberg, J.J., Loading and control policies for a flexible
481-490;
Sun, T.-H., Cheng, C.-W., Fu, L.-C., A Pctri net based approach to modeling and
scheduling for an FMS and a case study (1994) IEEE Transactions on Industrial
Electronics, 41 (6), pp. 593-600;
Tarjan, R.E., Depth first search and linear graph algorithm (1972) SIAM Journal of
Computing, 1 (2), pp. 146-160;
Tilsley, R., Lewis, F.A., Flexible cell production systems - A realistic approach
(1977) Annals OfCIRP, 25, pp. 269-271;
Viswanadham, N., Narahari, Y., Johnson, T.L., Deadlock prevention and deadlock
avoidance in flexible manufacturing systems using Petri net models (1990) IEEE
Transactions on Robotics and Automation, 6 (6), pp. 713-723;
Wilhelm, W.E., Shin, H.-M., Effectiveness of alternative operations in a flexible
pp. 65-79;
Wysk, R.A., Yang, N.S., Joshi, S., Detection of deadlocks in flexible manufacturing
cells (1991) IEEE Transactions on Robotics and Automation, 7 (6), pp. 853-858;
Yalcin, A., Boucher, T.O., Deadlock avoidance in flexible manufacturing systems
using finite automata (2000) IEEE Transactions on Robotics and Automation,
Forthcoming.;
Yamagata, K., Tamura, H., Hatono, I., Modeling and online scheduling of flexible
manufacturing systems using stochastic Petri nets (1991) IEEE Transactions on
Software Engineering, 17, p. 126132
ISSN: 0740817X
SOURCE: Scopus
Joines, J.A., Culbreth, C.T., King, R.E.

7004005919;6602467121;7404499815;
Manufacturing cell design: An integer programming model employing genetic
algorithms
Cited 111 times.
0029755056&doi=10.1080%2f07408179608966253&partnerID=40&md5=2f8a417896a3e6c71028172
2c27249d1
DOI: 10.1080/07408179608966253
AFFILIATIONS: Department of Industrial Engineering, North Carolina State
University, Box 7906, Raleigh, NC, 27695-7906, United States
ABSTRACT: The design of a cellular manufacturing system requires that a part
population, at least minimally described by its use of process technology
(part/machine incidence matrix), be partitioned into part families and that the
associated plant equipment be partitioned into machine cells. At the highest level,
the objective is to form a set of completely autonomous units such that inter-cell
movement of parts is minimized. We present an integer program that is solved using
a genetic algorithm (GA) to assist in the design of cellular manufacturing systems.
The formulation uses a unique representation scheme for individuals (part/machine
partitions) that reduces the size of the cell formation problem and increases the
scale of problems that can be solved. This approach offers improved design
flexibility by allowing a variety of evaluation functions to be employed and by
incorporating design constraints during cell formation. The effectiveness of the GA
approach is demonstrated on several problems from the literature. © 1996 Taylor &
Francis Group, LLC.
INDEX KEYWORDS: Automation; Genetic algorithms; Integer programming; Machine tools;
Mathematical models; Process control, Cellular manufacturing system; Manufacturing
cell design; Part machine incidence matrix, Manufacture
Press, New York;
Askin, R., Chiu, K., A graph partitioning procedure for machine assignment and cell
1572;
Askin, R., Subramanian, S., A cost-based heuristic for group technology
113;
Research, 25 (5), pp. 639-665;
Bertsekas, D., Tseng, P., Relaxation methods for minimum cost ordinary and
generalized network flow problems (1988) Operations Research, 36 (1), pp. 93-114;
pp. 2097-2116;
Seminar on GT, Turin;
Chandrasekharan, M.P., Rajagopalan, R., MODROC an extension of rank order
Research, 24 (5), pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., GROUPABIL-ITY analysis of the properties of
Chu, C.-H., Cluster analysis in manufacturing cellular formation (1989) OMEGA, 17
(3), pp. 289-295;
1487;
Chu, C.-H., Tsai, M., A comparison of three array-based clustering techniques for
28 (8), pp. 1417-1433;
Davis, L., (1991) The handbook of genetic algorithms, , Van Nostrand Reingold, New
York;
Gunasingh, K., Lashkari, R., Simultaneous grouping of parts and machines in
cellular manufacturing systems - an integer programming approach (1990) Computers
in Industrial Engineering, 20 (1), pp. 111-117;
Holland, J.H., (1975) Adaptation in natural and artificial systems, , The
Hyer, N.L., Wemmerlov, U., Group technology in the US manufacturing industry a
(8), pp. 1287-1304;
Joines, J.A., (1993) Manufacturing Cell Design Using Genetic Algorithms, , M.S.
Thesis, North Carolina State University;
constrained optimization problems with genetic algorithms (1994) Proceedings of the
1994 IEEE International Symposium EC, pp. 579-584., Orlando, FL;
Joines, J.A., King, R.E., Culbreth, C.T., (1994) A comprehensive review of
manufacturing cell design, , Working Paper, North Carolina State University;
Kaparthi, S., Suresh, N.C., Machine-component cell formation in group technology a
(6), pp. 1353-1367;
Khator, S.K., Irani, S.K., Cell formation in group technology a new approach (1987)
Computers in Industrial Engineering, 12 (2), pp. 131-142;
King, J.R., Machine-component grouping in production flow analysis an approach
Research, 18 (2), pp. 213-232;
King, J.R., Nakomchai, V., Machine-component group formation in group technology
pp. 117-133;
Kumar, K.R., Chandrasekharan, M.P., Grouping efficacy a quantitative criterion for
Kusiak, A., EXGT-S a knowledge based system for group technology (1988)
Kusiak, A., Group technology models and solution approaches (1992) Proceedings of
the IEEE Research Conference, pp. 349-352;
Kusiak, A., (1992) Intelligent Design and Manufacturing, , John Wiley and Sons, New
York;
Kusiak, A., Chow, W., Decomposition of manufacturing systems (1988) IEEE Journal of
603-612;
51 (2), pp. 53-57;
reorganization by a cluster technique (1972) Operations Research, 20 (5), pp. 993-
1009;
Programs, , Springer-Verlag, New York;
for solving the cell formation in group technology (1991) Journal of Operations
Minis, I., Harhalkis, G., Jajodia, S., Manufacturing cell formation with multiple,
functionally identical machines (1990) Manufacturing Review, 3 (1), pp. 252-261;
Ng, S., Worst-case analysis of an algorithm for cellular manufacturing (1993)
Rajagopalan, R., Batra, J.L., Design of cellular production systems a graph-
567-579;
Seifoddini, H., Single linkage versus average linkage clustering in machine cell
formation applications (1989) Computers in Industrial Engineering, 16, pp. 419-426;
Selim, H.M., Askin, R.G., Vakhana, A.J., (1994) Cell formation in group technology
review, evaluation and directions of future research, , Working Paper, University
of Arizona, Tucson;
Srinivasan, G., Narendran, T.T., GRAFICS - a non hierarchical clustering algorithm
pp. 463-478;
Research, 28 (1), pp. 145-152;
cellular manufacturing (1990) International Journal of Production Research, 28
(11), pp. 2075-2084;
Wu, H., Venugopal, M., Barash, M., Design of a cellular manufacturing system a
syntactic pattern recognition approach (1986) Journal of Manufacturing Systems, 5
(2), pp. 81-88
ISSN: 0740817X
SOURCE: Scopus
Park, Y.‐T., Wemmerlöv, U.

55547105195;6601920402;
A Comparative Study of Cell Formation Techniques: Experimental Findings on Data‐
Dependency and Solution Quality
(1995) Decision Sciences, 26 (4), pp. 475-502. Cited 5 times.
84990592122&doi=10.1111%2fj.1540-
5915.1995.tb01437.x&partnerID=40&md5=134d7aa63f560e3017afcd0753d9613f
DOI: 10.1111/j.1540-5915.1995.tb01437.x
AFFILIATIONS: Graduate School of Business, University of Wisconsin-Madison,
Madison, Wisconsin, 53706, United States
ABSTRACT: A large number of techniques for solving the cell formation problem has
emerged in recent years. However, little effort has been spent on determining the
procedures' relative performance. This paper identifies four problem areas for
which important decisions must be made in connection with a comparative study:
asymmetry among procedures with respect to input data, sensitivity to input data,
ability of cell formation techniques to generate different solutions, and criteria
for acceptable cell performance. Relying on a new taxonomy that categorizes cell
formation techniques based on required input data, and a new approach to describing
and manipulating shop data, this paper illustrates how choices within the four
areas above can be resolved within the context of a comparative study. The
experiments uncover fundamental relations between cell formation techniques, the
types of input data they use, the characteristics of the data that drive the
models, and the resulting performance. Copyright © 1995, Wiley Blackwell. All
rights reserved
AUTHOR KEYWORDS: Cellular Technology Manufacturing and Process Design
REFERENCES: Anderberg, M.R., (1973) Cluster analysis for applications, , New York:,
Academic Press;
Askin, R., Subramanian, S., A cost‐based heuristic for group technology
113;
Ballakur, A., Steudel, H., A within‐cell utilization based heuristic for designing
25 (2), pp. 639-665;
Burbidge, J., Production flow analysis (1971) Production Engineer, 50 (4-5), pp.
139-152;
Burbidge, J., A manual method of production flow analysis (1977) Production
Engineer, 56 (10), pp. 34-38;
Burbidge, J., (1989) Production flow analysis for planning group technology, ,
Oxford:, Clarendon Press;
Chandrasekharan, M.P., Rajagopalan, R., An ideal seed non‐hierarchial clustering
Research, 24 (4), pp. 451-464;
Chu, C., Cluster analysis in manufacturing cellular formation (1989) OMEGA, 17 (3),
pp. 289-295;
Chu, C., Lee, W., A comparison of 0–1 integer programming models for manufacturing
cellular formation (1989) Proceedings of the Decision Sciences Institute, ,
Atlanta, GA:, Decision Sciences Institute;
Chu, C., Tsai, M., A comparison of three array‐based clustering techniques for
manufacturing cellular formation (1990) International Journal of Production
Research, 28 (8), pp. 1417-1433;
Co, H., Araar, A., Configuring cellular manufacturing systems (1988) International
de Beer, C., van Gerwen, R., de Witte, J., Analysis of engineering production
systems as a base for product‐oriented reconstruction (1976) Annals of CIRP, 25,
pp. 439-441;
Gass, S.I., Decision‐aiding models: Validation, assessment, and related issues for
policy analysis (1983) Operations Research, 31 (4), pp. 603-631;
cellular manufacturing systems—An integer programming approach (1991) Computers and
Harhalakis, G., Nagi, R., Proth, J., An efficient heuristic in manufacturing cell
2429;
King, J., Nakornchai, V., Machine‐component group formation for group technology:
Review and extensions (1982) International Journal of Production Research, 20 (2),
pp. 117-133;
51 (2), pp. 53-57;
Miltenburg, J., Zhang, W., A comparative evaluation of nine well‐known algorithms
Mosier, C., Taube, L., Weighted similarity measure heuristic for the group
Park, Y., Wemmerlöv, U., A shop structure generator for cell formation research
Rajagopalan, R., Batra, J., Design of cellular production systems: A graph‐
567-579;
Tarsuslugil, M., Bloor, J., (1979), pp. 525-532., The use of similarity coefficient
and cluster analysis in production flow analysis. Proceedings of 20th International
MTD&R, Birmingham, Great Britain; Vakharia, A., Wemmerlöv, U., Designing a cellular
manufacturing system: A material flow approach based on operation sequences (1990)
IIE Transactions, 22 (1), pp. 84-97;
Vakharia, A., Wemmerlöv, U., A comparative investigation of hierarchical clustering
techniques and dissimilarity measures applied to the cell formation problem (1995)
Waghodekar, P., Sahu, S., Machine‐component cell formation in group technology:
Sciences, 21 (2), pp. 416-433;
Wemmerlöv, U., (1995), A taxonomy of cell formation techniques based on input data
requirements. Working Paper, Graduate School of Business, University of Wisconsin‐
Madison; Wemmerlöv, U., Hyer, N., Procedures for the part family/machine group
Management, 6 (2), pp. 125-147;
Wemmerlöv, U., Hyer, N., Research issues in cellular manufacturing (1987)
Wu, H.L., Venugopal, R., Barash, M.M., Design of a cellular manufacturing system: A
syntactic pattern recognition approach (1986) Journal of Manufacturing Systems, 5
(2), pp. 81-88
CORRESPONDENCE ADDRESS: Park, Y.‐T.; Graduate School of Business, University of
Wisconsin-Madison, Madison, Wisconsin, 53706, United States
ISSN: 00117315
ABBREVIATED SOURCE TITLE: Decis. Sci.
SOURCE: Scopus
Chan, F.T.S., Lau, K.W., Chan, P.L.Y., Choy, K.L.

7202586517;36722692600;7403540482;7005477047;
Two-stage approach for machine-part grouping and cell layout problems
95 times.
32544437401&doi=10.1016%2fj.rcim.2005.04.002&partnerID=40&md5=245c8c60a5111687d0f78
81ecc4ea05b
DOI: 10.1016/j.rcim.2005.04.002
University of Hong Kong, Pokfulam Road, Hong Kong, Hong Kong;
Department of Industrial and Systems Engineering, Hong Kong Polytechnic University,
Hung Hom, Kowloon, Hong Kong
ABSTRACT: Cellular manufacturing system (CMS) which is based on the concept of
group technology (GT) has been recognized as an efficient and effective way to
improve the productivity in a factory. In recent years, there have been continuous
research efforts to study different facet of CMS. Most of them concentrated on
distinguishing the part families and machine cells either simultaneously or
individually with the objective of minimizing intercellular and intracellular part
movements. This is known as machine-part grouping problem (MPGP) which is a crucial
process while designing CMS. Nevertheless, in reality some components may not be
finished within only one cell, they have to travel to another cell(s) for further
operation(s). Under this circumstance, intercellular part movement will occur.
Different order/sequence of machine cells allocation may result in different total
intercellular movement distance unit. It should be noted that if the production
volume of each part is very large, then the total number of intercellular movement
will be further larger. Therefore, the sequence of machine cells is particularly
important in this aspect. With this consideration, the main aim of this work is to
propose two-stage approach for solving cell formation problem as well as cell
layout problem. The first stage is to identify machine cells and part families,
which is the essential part of MPGP. The work in second stage is to carry out a
macro-approach to study the cell formation problem with consideration of machining
sequence. The impact of the sequencing for allocating the machine cells on
minimizing intercellular movement distance unit will be investigated in this stage.
The problem scope, which is a MPGP together with the background of cell layout
problem (CLP), has been identified. Two mathematical models are formulated for MPGP
and CLP respectively. The primary assumption of CLP is that it is a linear layout.
The CLP is considered as a quadratic assignment problem (QAP). As MPGP and QAP are
NP-hard, genetic algorithm (GA) is employed as solving algorithm. GA is a popular
heuristic search technique and has proved superior performance on complex
optimization problem. In addition, an industrial case study of a steel member
production company has been employed to evaluate the proposed MPGP and CLP models,
and the computational results are presented. © 2005 Elsevier Ltd. All rights
reserved.
AUTHOR KEYWORDS: Cell layout problem; Genetic algorithms; Machine-part grouping
problem; Operational sequence; Sequencing
INDEX KEYWORDS: Cellular manufacturing; Genetic algorithms; Group technology;
Mathematical models; Optimization; Productivity, Cell layout problem; Machine-part
grouping problem; Operational sequence; Sequencing, Problem solving
REFERENCES: Kazerooni, M.L., Luong, H.S., Abhary, K., A genetic algorithm based
cell design considering alternative routing (1997) Int J Comput Integrated Manufact
Syst, 10 (2), pp. 93-107;
multi-period planning horizons of cellular manufacturing systems (1998) Prod Plan
Cont, 9 (6), pp. 561-571;
McAuley, J., Machine grouping for efficient production (1972) The Prod Eng, 51, pp.
53-57;
King, J.R., Machine - Component grouping in production flow analysis: An approach
Production Management, , Kluwer-Nijho Boston, MA;
Chan, F.T.S., Mak, K.L., Luong, L.H.S., Ming, X.G., Machine-Component Grouping
using Genetic Algorithms (1998) Int J Robot Comput Integrated Manufact, 14 (5-6),
pp. 339-346;
Won, Y.Y., Lee, K.C., Group technology cell formation considering operation
sequences and production volumes (2001) Int J Prod Res, 39 (12), pp. 2755-2768;
production factors (2002) Int J Prod Res, 40 (4), pp. 885-906;
multiple routes and multiple objectives (2000) Int J Prod Res, 38, pp. 385-395;
certain constraints (2000) Int J Prod Econ, 64, pp. 267-278;
Holland, J.H., (1992) Adaptation in Natural and Artificial Systems, , 2nd ed The
University of Michigan Press Ann Arbor;
(2002) Int J Prod Res, 40 (3), pp. 641-665;
manufacturing system using a genetic algorithm based heuristic approach (2000) Int
J Prod Res, 38 (14), pp. 3357-3384;
Alendar, J.T., (1994) An Indexed Bibliography of Genetic Algorithms: Years 1957-
1993, , Compiled by J.T. Alendar. Printed in Finland;
systems (2001) Comput Ind Eng, 39 (1-2), pp. 125-144;
and mutation operators in a genetic process (2002) Appl Int, 16 (1), pp. 7-17;
cell formation (2000) Int J Adv Manufact Technol, 16, pp. 491-497;
genetic algorithm (2003) Int J Comput Oper Res, 30, pp. 1575-1593;
Falkenauer, E., New presentation and operators for GAs applied to grouping problems
(1994) Evol Comput, 2 (2), pp. 123-144;
Gupta, Y., Gupta, M., Kumar, A., Sundram, C., Minimizing total intercell and
intracell moves in cellular manufacturing: A genetic algorithm approach (1995) Int
J Comput Int Manufact, 8 (2), pp. 92-101;
manufacturing cell formation allowing reallocation of operations (1993) Eur J Oper
Res, 69 (3), pp. 292-311;
production and transport systems (2003) J Eng Manufacture (JEM), 217 (7), pp. 883-
897;
Int J Prod Res, 38 (11), pp. 2573-2582;
Wong, T.N., Chan, L.C.F., Lau, H.C.W., Machining process sequencing with fuzzy
expert system and genetic algorithms (2003) Engineering with Computers, 19, pp.
191-202;
Goldberg, D.E., Lingle, R., Alleles loci and the TSP (1985) Proceedings of the
California CA: Morgan Kaufmann;
Davis, L., Job Shop scheduling with genetic algorithms (1985) Proceedings of the
California CA: Morgan Kaufmann;
Review and extensions (1982) Int J Prod Res, 20 (2), pp. 117-133;
Joines, J.A., (1993) Manufacturing Cell Design Using Genetic Algorithms, , Ms
thesis, North Carolina State University, Raeigh, NC;
considerations in group technology applications (1990) Int J Produ Res, 28 (12),
pp. 2243-2257;
Joines, J.A., Culbreth, C.T., King, R.E., A genetic algorithms based integer
program for manufacturing cell design (1995) Int Conf Flexible Automat Integ
Manufact, , Stuttgart, Germany
CORRESPONDENCE ADDRESS: Chan, F.T.S.; Department of Industrial and Manufacturing
Systems Engineering, University of Hong Kong, Pokfulam Road, Hong Kong, Hong Kong;
ISSN: 07365845
CODEN: RCIME
SOURCE: Scopus
Adinarayanan, A., Uthayakumar, M., Prabhakaran, G.

57193775428;55220479900;6602999346;
Machine cell formation using simulated annealing algorithm in cellular
(2018) International Journal of Computer Aided Engineering and Technology, 10 (1-
2), pp. 111-125.
85039768312&doi=10.1504%2fIJCAET.2018.088833&partnerID=40&md5=3501cb1d34cbd58f2d12c
c88e83066c0
DOI: 10.1504/IJCAET.2018.088833
AFFILIATIONS: Department of Mechanical Engineering, Anand Institute of Higher
Technology, Chennai, 603103, India
ABSTRACT: Group technology is a production strategy and it has the ability to get
solution for certain problems of complexity and long manufacturing lead times in
batch manufacturing. This can be achieved by using a systematic method of
equipments into machine cells and components into part families, based on the
suitable similarity criteria. The present work deals with the machine cell
formation problem with the aim of minimising the aggregate cell load variation and
aggregate inter cellular move. The quantity of parts, operation sequences,
processing time, capacity of machines, and workload of machineries were considered
as parameters. In order to group the machineries, one of the metaheuristic search
methodologies the simulated annealing (SA) algorithm is considered. For
computational processing 40 machines and 100 part types are being used. From the
findings it is observed that, in most of the literature problems SA provides better
result than that of other methods in the literature and in few cases it yields
equal result to the best one of the other methods. © 2018 Inderscience Enterprises
Ltd.
AUTHOR KEYWORDS: Cell formation; Cell load variation; Intercellular moves;
Simulated annealing algorithm
REFERENCES: Andres, C., Lozano, S., A particle swarm optimization algorithm for
part machine grouping (2006) Robot. Comp. Integr. Manufact., 22 (5-6), pp. 468-474;
formation problem (2012) Appl. Mathemat. Model., 36 (10), pp. 5091-5100;
Bajestani, A.M., Rabbani, M., Rahimi-Vahed, A.R., Khoshkhou, G.B., A multiobjective
scatter search for a dynamic cell formation problem (2009) Comp. Op. Res., 36 (3),
pp. 777-794;
Black, J., Cellular manufacturing systems reduce setup time, make small lot
production economical (1983) Industrial Engineering, 15 (11), pp. 39-48;
Burbidge, L., Production flow analysis (1963) Prod. Eng., 42 (12), p. 742;
Chen, W.H., Srivastava, B., Simulated annealing procedures for forming machine cell
in-group technology (1994) Eur. J. Op. Res., 75 (1), pp. 100-111;
(2011) Comp. Ind. Eng., 60 (1), pp. 7-15;
manufacturing cell design (2008) Proceedings of the 2008 Workshop on Knowledge
Discovery and Data Mining, IEEE Computer Society;
and ratio-level data (2003) Int. J. Adv. Manuf. Technol., 22 (1), pp. 125-133;
Heragu, S., (1997) Facilities Design, p. 316., PWS Publishing Company, Boston;
Javadi, B., Jolai, F., Slomp, J., Rabbani, M., Tavakkoli-Moghaddam, R., An
integrated approach for the cell formation and layout design in cellular
pp. 6017-6044;
Kalayci, C.B., Gupta, S.M., Artificial bee colony algorithm for solving
sequencedependent disassembly line balancing problem (2013) Expert Systems with
Applications, 40 (18), pp. 7231-7241;
J.C., Solving a group layout design model of a dynamic cellular manufacturing
system with alternative process routings, lot splitting and flexible
reconfiguration by simulated annealing (2012) Computers & Operations Research, 39
(11), pp. 2642-2658;
Int. J. Prod. Res., 42 (18), pp. 3911-3927;
using a rank order-clustering algorithm (1980) Int. J. Prod. Res., 18 (2), pp. 213-
232;
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., Jr., Optimization by simulated
cell formation in cellular manufacturing (2004) Int. J. Adv. Manuf. Technol., 23
(7), pp. 501-506;
Lee, K., Ahn Kll, GT efficacy: A performance measure for cell formation with
sequence data (2013) International Journal of Production Research, 51 (20), pp.
6070-6081;
moves in cellular manufacturing (1990) Int. J. Prod. Res., 29 (5), pp. 375-390;
splitting and multiple units of the same machine (1993) Int. J. Prod. Res., 33 (3),
pp. 675-693;
(2016) Applied Soft Computing, 42, pp. 325-341., Null;
assignment in cell formation (2002) Comp. Ind. Eng., 42 (2-4), pp. 329-341;
Opitz, H., (1970) A Classification System to Describe Work Pieces, , Pergamon, New
York;
Panchalavarapu, P.R., Chankong, V., Design of cellular manufacturing systems with
assembly considerations (2005) Computers & Industrial Engineering, 48 (3), pp. 449-
469;
Prabhakaran, G., (2001) Clustering and Machine Cell Formation for Cellular
Manufacturing Systems, , PhD Thesis, Bharathidasan University, Tiruchirappalli,
Tamil Nadu, India;
Prabhakaran, G., Muruganandam, A., Asokan, P., Girish, B.S., Machine cell formation
J. Adv. Manufact. Technol., 25 (9), pp. 1013-1019;
(2013) J. Manufact. Syst., 32 (1), pp. 78-84;
for the manufacturing cells formation system (2008) Int. J. Adv. Manufact.
Technol., 36 (5), pp. 589-597;
Solving a dynamic cell formation problem using metaheuristics (2005) Appl.
Mathemat. Comp., 170 (2), pp. 761-780;
search approach (1997) Int. J. Prod. Res., 35 (7), pp. 2025-2044;
organizing map networks in cellular manufacturing system (2006) Int. J. Prod. Res.,
20 (15), pp. 4257-4271;
simulated annealing: An experimental evaluation (1992) Eur. J. Op. Res., 63 (3),
pp. 409-422;
machinecomponent grouping problems with multiple objectives (1992) Comp. Ind. Eng.,
22 (4), pp. 469-480;
formation in the design of cellular manufacturing system (2015) International
manufacturing design and layout (2007) Eur. J. Op. Res., 181 (1), pp. 156-167
CORRESPONDENCE ADDRESS: Adinarayanan, A.; Department of Mechanical Engineering,
Anand Institute of Higher TechnologyIndia; email: [email protected]
ISSN: 17572657
SOURCE: Scopus
Firouzian, S., Saadat, M., Mahdavi, I., Paydar, M.M.

57194158937;57194154659;16417373200;23025569300;
A new cell formation with part family clustering in cellular manufacturing system
(2016) Proceedings of the International Conference on Industrial Engineering and
Operations Management, p. 187.
85018967676&partnerID=40&md5=da7c3db572995a600c5f5240e29f7c41
AFFILIATIONS: Mazandaran University of Science and Technology, Babol, Iran;

Noshirvani University of Technology, Babol, Iran
ABSTRACT: Cellular manufacturing (CM) is an industrial application of group
technology concept. One of the problems encountered in the implementation of CM is
the cell formation problem (CFP). Minimizing of the number of Exceptional Elements
(EEs) and voids are common goals in cellular manufacturing systems. The aim of this
paper is a new model for CM that simultaneously in higher level, a CFP is designed
which group machines and parts in dedicated cell with machine-part matrix; so that
the number of voids is minimized in these cells. After identifying EEs, in lower
level, the machines needed for remaining operations of parts that are not processed
in dedicated cells, are determined to duplicate. So it produces new Machine- Part
family matrix. Unlike previous models which focused just on similarity level in
dedicated cell, by clustering this new matrix, two and more part families will be
located in Shared cells. The proposed model, with nonlinear terms and integer
variables, cannot be solved for real sized problems due to its NP-hardness. To
solve the model for such applications, metaheuristic algorithms are proposed. ©
IEOM Society International.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing system; Dedicated cell;
Part family clustering; Shared cell
CORRESPONDENCE ADDRESS: Mahdavi, I.; Mazandaran University of Science and
TechnologyIran; email: [email protected]
PUBLISHER: IEOM Society
ISSN: 21698767
ISBN: 9780985549749; 9780985549756
ABBREVIATED SOURCE TITLE: Proc. Int. Conf. Ind. Eng. Oper. Manage.
SOURCE: Scopus
Shiyas, C.R., Madhusudanan Pillai, V.

55911167900;57194773139;
A mathematical programming model for manufacturing cell formation to develop
multiple configurations
84895061224&doi=10.1016%2fj.jmsy.2013.10.002&partnerID=40&md5=00fbff1e60f1ef8d0545a
1d14759adbc
DOI: 10.1016/j.jmsy.2013.10.002
Technology Calicut, NIT Campus (P.O), Calicut 673601, Kerala, India
ABSTRACT: This paper presents and analyses a mathematical model for the design of
manufacturing cells which considers two conflicting objectives such as the
heterogeneity of cells and the intercell moves. A genetic algorithm (GA) based
solution methodology is developed for the model which is also solved using an
optimization package. The model is suitable for getting multiple potential
solutions in a structured way for the cell formation problem by making a trade-off
between the two objectives, instead of reaching at a single negotiating solution.
This model provides the decision maker the flexibility of choosing a suitable cell
design from different alternatives by considering the practical constraints. A part
assignment heuristic is also developed by which part-families can be identified and
is integrated with the GA based solution procedure. A comparison of the proposed
method is made with other seven methods using 36 problems from the literature.
Grouping efficacy is the basis for comparison and it is found to give reasonably
good results. © 2013 The Society of Manufacturing Engineers.
AUTHOR KEYWORDS: Genetic algorithm; Grouping efficacy; Heterogeneity of cells;
Manufacturing cells; Mathematical model
REFERENCES: Wu, X., Chu, C.H., Wang, Y., Yan, W., A genetic algorithm for cellular
using rank order clustering algorithm (1980) Int J Prod Res, 18 (2), pp. 213-232;
manufacturing (1982) J Manuf Syst, 1 (1), pp. 65-67;
formation of part families and machine cells (1987) Int J Prod Res, 25 (6), pp.
835-850;
Nair, J., Narendran, T.T., CASE: A clustering algorithm for cell formation with
Kusiak, Chow, W., Efficient solving of the group technology problem (1987) J Manuf
Syst, 6 (2), pp. 117-124;
Youkyung, W., Currie, K.R., An effective p-median model considering production
factors in machine cell/part family formation (2006) J Manuf Syst, 25 (1), pp. 58-
64;
Int J Prod Res, 26 (7), pp. 1161-1172;
algorithms for cell formation (1997) IIE Trans, 29 (1), pp. 53-67;
Mahdavi, Aalaei, A., Paydar, M.M., Solimanpur, M., A new mathematical model for
system (2012) J Manuf Syst, 32 (2), pp. 214-223;
Yin, Y., Xu, C., Hu, L., Some insight into Yasuda et al's. "a grouping genetic
algorithm for the multi-objective cell formation problem" (2009) Int J Prod Res, 47
(7), pp. 2009-2010;
Pitombeira Neto, A.R., Goncalves Filho, E.V., A simulation-based evolutionary
multiobjective approach to manufacturing cell formation (2010) Comput Ind Eng, 59
(1), pp. 64-74;
(2011) Exp Syst Appl, 38 (8), pp. 9597-9602;
Rabbani, M., Jolai, F., Manavizadeh, N., Radmehr, N., Javadi, B., Solving a bi-
objective cell formation problem with stochastic production quantities by a two-
phase fuzzy linear programming approach (2012) Int J Adv Manuf Technol, 58 (58),
pp. 709-722;
Raflei, H., Ghodsi, R., A bi-objective mathematical model toward dynamic cell
formation considering labor utilization (2013) Appl Math Modell, 37 (4), pp. 2308-
2316;
Res, 46 (10), pp. 2589-2620;
Rogers, D.S., Kulkarni, S.S., Optimal bivariate clustering and a genetic algorithm
with an application in cellular manufacturing (2005) Eur J Oper Res, 160, pp. 423-
444;
Lee-Post, Part family identification using a simple genetic algorithm (2000) Int J
Prod Res, 38 (4), pp. 793-810;
systems: A genetic algorithm approach (2006) Int J Prod Res, 44 (6), pp. 1217-1241;

Tariq, Hussain, I., Ghafoor, A., A hybrid genetic algorithm for machine-part
grouping (2009) Comput Ind Eng, 56, pp. 347-356;
programming model employing genetic algorithms (1996) IIE Trans, 28, pp. 69-85;
genetic algorithm to solve dynamic cell formation problem (2010) Appl Math Modell,
34, pp. 1078-1092;
manufacturing system design (2007) Int J Adv Manuf Technol, 32, pp. 531-536;
Zolfaghari, S., Liang, M., Machine cell/part family formation considering
processing times and machine capacities: A simulated annealing approach (1998)
Comput Ind Eng, 34, pp. 813-823;
manufacturing systems (2009) J Manuf Syst, 28 (4), pp. 132-139;
Islier, A.A., Group technology by an ant system algorithm (2005) Int J Prod Res, 43
(5), pp. 913-932;
programming approach (1999) Int J Prod Res, 37 (11), pp. 2545-2563;
using neural networks (2008) Comput Ind Eng, 56, pp. 1340-1347;
part-machine grouping in cellular manufacturing (2007) Int J Prod Res, 45 (9), pp.
2073-2104;
Rao, H.A., Gu, P., Expert self-organizing neural network for the design of cellular
manufacturing systems (1994) J Manuf Syst, 13 (5), pp. 346-358;
Nouri, H., Tang, S.H., Hang Tuah, B.T., Anuar, M.K., BASE: A bacteria foraging
algorithm for cell formation with sequence data (2010) J Manuf Syst, 29 (2-3), pp.
102-110;
considering operation time (2012) J Manuf Syst, 31 (3), pp. 326-336;
(2013) J Manuf Syst, 32 (1), pp. 20-31;
formation problem (2012) Appl Math Modell, 36 (10), pp. 5091-5100;
(2013) J Manuf Syst, 32 (1), pp. 78-84;
Int J Prod Res, 44 (22), pp. 4855-4875;
Irani, S.A., (1999) Handbook of Cellular Manufacturing Systems, , John Wiley &
Sons, Inc. New York;
Adenzo-Diaz, B., Lozano, S., A model for the design of dedicated manufacturing
cells (2008) Int J Prod Res, 46 (2), pp. 301-319;
J Prod Res, 28 (2), pp. 233-243;
447-482;
Madhusudanan Pillai, V., Subbarao, K., A robust cellular manufacturing system
design for dynamic part population using a genetic algorithm (2008) Int J Prod Res,
46 (18), pp. 5191-5210;
(2001) Eur J Oper Res, 130 (3), pp. 588-611;
Nicholas, J.M., (2001) Competitive Manufacturing Management, , Tata McGraw-Hill
Publishing Company Ltd. New Delhi;
technology using minimum spanning trees (1994) Int J Prod Res, 32, pp. 2149-2158;
Res, 39 (1), pp. 1-19;
binary data matrices for group technology (1989) Int J Prod Res, 27 (6), pp. 1035-
1052
CORRESPONDENCE ADDRESS: Madhusudanan Pillai, V.; Department of Mechanical
Engineering, National Institute of Technology Calicut, NIT Campus (P.O), Calicut
673601, Kerala, India; email: [email protected]
ISSN: 02786125
CODEN: JMSYE
SOURCE: Scopus
Fan, J., Feng, D.

36185126800;7401981221;
Design of cellular manufacturing system with quasi-dynamic dual resource using
multi-objective GA
12 times.
84880570789&doi=10.1080%2f00207543.2012.748228&partnerID=40&md5=5e49d6bb1bb6d0e1f90
1fc0892006e06
DOI: 10.1080/00207543.2012.748228
AFFILIATIONS: Key Laboratory of Special Purpose Equipment and Advanced
Manufacturing Technology, Ministry of Education, Zhejiang University of Technology,
Hangzhou, China;
School of Economics and Management, Zhejiang University of Science and Technology,
Hangzhou, China
ABSTRACT: A new concept is presented in this paper of quasi-dynamic cell formation
for the design of a cellular manufacturing system, based on analysing the fact that
static and dynamic cell formation could not reflect the real situation of a modern
cellular manufacturing system. Further, workforce resources are integrated into
quasi-dynamic cell formation and thus a quasi-dynamic dual-resource cell-formation
problem is proposed. For solving this problem, this paper first establishes a non-
linear mixed integer programming model, where inter-cell and intra-cell material
cost, machine relocation cost, worker operation time, loss in batch quality and
worker salary are to be minimised. Then, a multi-objective GA is developed to solve
this model. Finally, a real life case study is conducted to validate the proposed
model and algorithm. The actual operation results show that the case enterprise
significantly decreases its material handling cost and workforce number and
obviously increases its product quality after carrying out the obtained scheme. ©
2013 Copyright Taylor and Francis Group, LLC.
AUTHOR KEYWORDS: cell formation; cellular manufacturing; dual resource; quasi-
dynamic
INDEX KEYWORDS: Cell formation; Dual resource; Dynamic cell formation; Material
handling costs; Model and algorithms; Multi-objective GA; Non-linear mixed integer
programming; quasi-dynamic, Compensation (personnel); Costs; Genetic algorithms,
REFERENCES: Andrés, C., Lozano, S., A particle swarm optimisation algorithm for
part machine grouping (2006) Robotics and Computer-Integrated Manufacturing, 22,
pp. 468-474;
Aryanezhad, M.B., Deljoov, M., Alehashem, S.M.J., Dynamic cell formation and the
worker assignment problem: A new model (2009) International Journal of Advanced
Bai, J.J., Gong, Y.G., Wang, N.S., The virtual manufacturing cellular formation
technology for reconfigurable manufacturing system based on the order (2009)
Computer Integrated Manufacturing System, 15 (2), pp. 313-321;
(2005) International of Production Research, 43 (8), pp. 1587-1605;
Chan, F.T.S., Lau, K.W., Chan, L.Y., Lou, H.Y., Cell formation problem with
Defersha, F.M., Chen, M.Y., A comprehensive mathematical model for the design of
Economics, 103, pp. 767-778;
manufacturing cell design (2008) 2008 Workshop on Knowledge Discovery and Data
Mining, pp. 72-75., 23-24 January, Australia, IEEE Computer Society;
Fan, J.J., Feng, D.Z., Cao, M., Modeling and application for cellular formation
under dynamic environment (2010) Proceedings 2010 IEEE 17th International
Conference on Industrial Engineering And, Engineering Management, 10, pp. 542-546;
Feyzan, A., Zülal, G., Modeling of a manufacturing cell design problem with fuzzy
multi-objective parametric programming (2009) Mathematical and Computer Modeling,
50, pp. 407-420;
Huang, B., Chen, D.L., Effective Pareto optimal set of multi-objective optimisation
problem (2009) Computer and Digital Engineering, 37 (2), pp. 28-30;
Jannes, S., Boppana, V.C., Nallan, C., Design of virtual manufacturing cells: A
Ma, Y.M., Chen, B.S., Zhang, W.M., The Genetic Algorithm with multiple routes for
manufacturing cellular formation (2001) Modern Design Technology, 1, pp. 18-22;
Ma, Y.M., (2002) The Construction and Evaluation for the Cellular Manufacturing, ,
Thesis (PhD). Tongji University;
pp. 1014-1025;
16, pp. 491-497;
Uncertain Production Requirement with Presence of Routing Flexibility, , Thesis
(PhD). Blacksburg State University, Virginia;
subcontracting production planning in dynamic cellular manufacturing (2009)
Solimanpur, M., Vrat, P., Shankar, R., Feasibility and robustness of transiently
chaotic neural networks applied to the cell formation problem (2004) International
Solimanpur, M., Mahdavi, I., Aalaei, A., Paydar, M.M., Multi-objective cell
(2009) International Conference on Business and Information, , 6-8 July, Kuala
Lumpur, Malaysia, BAI;
Spiliopoulos, K., Sofianopoulou, S., An efficient ant colony optimisation system
Wang, X.Q., (2009) Study on the Cellular Formation and Scheduling Method for
Cellular Manufacturing Enterprises, , Thesis (PhD). Dongbei University;
Xuan, G.N., (2011) GA and Engineering Optimal, , China: Tsinghua University Press
CORRESPONDENCE ADDRESS: Feng, D.; Key Laboratory of Special Purpose Equipment and
Advanced Manufacturing Technology, Ministry of Education, Zhejiang University of
Technology, Hangzhou, China; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Rafiei, H., Ghodsi, R.

27967949000;26430782700;
A bi-objective mathematical model toward dynamic cell formation considering labor
utilization
84870255062&doi=10.1016%2fj.apm.2012.05.015&partnerID=40&md5=28e491178f557cb3d0c261
b7f9f06980
DOI: 10.1016/j.apm.2012.05.015
University of Tehran, P.O. Box 11155-4563, Tehran, Iran
ABSTRACT: This paper addresses dynamic cell formation problem (DCFP) via a new bi-
objective mathematical formulation. Although literature body of DCFP includes a
vast number of research instances, human-related issues are mostly neglected as an
important aspect of DCFP in the corresponding literature. In this paper, the first
objective function seeks to minimize relevant costs of the problem including
machine procurement and relocation costs, machine variable cost, inter-cell
movement and intra-cell movement costs, overtime cost and labor shifting cost
between cells, while labor utilization of the modeled DCFP is maximized through the
second objective function. Due to NP-hardness of DCFP, an ant colony optimization
(ACO) meta-heuristic is developed for the first time in the literature to tackle
the problem. Also, authors enhance diversification of the developed algorithm is
enhanced by hybridization of the proposed ACO algorithm with a genetic one.
Finally, some numerical samples are generated randomly to validate the proposed
model by which strengths of the developed algorithm is shown. © 2012 Elsevier Inc.
AUTHOR KEYWORDS: Ant colony optimization; Bi-objective optimization; Dynamic cell
formation; Genetic algorithm; Human-related issues; Labor utilization
INDEX KEYWORDS: Ant Colony Optimization (ACO); Bi-objective optimization; Dynamic
cell formation; Human-related issues; Labor utilization, Artificial intelligence;
Cellular manufacturing; Cost accounting; Genetic algorithms; Mathematical models,
Costs
REFERENCES: Bidanda, B., Ariyawongrat, P., LaScola Needy, K., Norman, B.A.,
Tharmmaphornphilas, W., Human related issues in manufacturing cell design,
implementation, and operation: a review and survey (2005) Comput. Ind. Eng., 48,
pp. 507-523;
Burbidge, J.L., Production flow analysis (1963) Prod. Eng., 42, pp. 742-752;
manufacturing using ant-colony-based optimization (2010) Int. J. Adv. Manuf.
Technol., 50, pp. 1135-1144;
(2006) Int. J. Adv. Manuf. Technol., 28, pp. 1182-1189;
J. Adv. Manuf. Technol., 25, pp. 1013-1019;
41, pp. 329-342;
planning horizons (2005) J. Manuf. Technol. Manag., 16 (5), pp. 516-530;
Saxena, L.K., Jain, P.K., Dynamic cellular manufacturing systems design- a
comprehensive model (2010) Int. J. Adv. Manuf. Technol.;
Wang, X., Tang, J., Yung, K.-L., Optimization of the multi-objective dynamic cell
Technol., 44, pp. 318-329;
Int. J. Prod. Econ., 120, pp. 301-314;
Model., 34, pp. 1078-1092;
multi-objective scatter search for a dynamic cell formation problem (2009) Comput.
Oper. Res., 36, pp. 777-794;
170, pp. 761-780;
Oper. Res., 185, pp. 563-592;
Theory of NP-completeness, , Freeman, New York;
Dorigo, M., Colorni, A., Maniezzo, V., An investigation of some properties of an
ant algorithm (1992) Proceedings of the Conference on Parallel Problem Solving from
Nature, pp. 509-520., Elsevier, Amsterdam, R. Manner, B. Manderick (Eds.);
for the manufacturing cells formation problem (2008) Int. J. Adv. Manuf. Technol.,
36, pp. 589-597;
Stützle, T., Dorigo, M., (1999) Ant Colony Algorithms for Quadratic Assignment
Problem: New Ideas in Optimization, , McGraw Hill, New York;
Dorigo, M., Stützle, T., (2004) Ant Colony Optimization, , MIT Press;
Maniezzo, V., Gambardella, L.M., De Luigi, F., (2004) Ant Colony Optimization: New
Optimization Techniques in Engineering, , Springer-Verlag;
Holland, J.H., (1975) Adaptation in Natural and Artificial System, , University of
conditions (2008) Fuzzy Sets Syst., 159, pp. 215-236
CORRESPONDENCE ADDRESS: Rafiei, H.; Department of Industrial Engineering, College
of Engineering, University of Tehran, P.O. Box 11155-4563, Tehran, Iran; email:
[email protected]
ISSN: 0307904X
CODEN: AMMOD
SOURCE: Scopus
Murali, R.V.
56742275300;
Workforce assignment into large-sized virtual cells using Learning Vector
Quantization (LVQ) approach
(2012) Advanced Materials Research, 576, pp. 705-709.
84869418519&doi=10.4028%2fwww.scientific.net
%2fAMR.576.705&partnerID=40&md5=9dfeeaee844ad3038bdc16033b15d6ca
DOI: 10.4028/www.scientific.net/AMR.576.705
AFFILIATIONS: Department of Mechanical and Industrial Engineering, Caledonian
College of Engineering, PB 2322, PC 111, CPO Seeb, Oman
ABSTRACT: Much has been reported in literature on virtual cell formation problems
while a limited work is reported on worker assignments. Virtual Cellular
Manufacturing Systems (VCMS) have come into existence, replacing traditional
Cellular Manufacturing Systems (CMS), to meet highly dynamic production conditions
in terms of demand, production lots, processing times, product mix and production
sequences. Although the problem of worker assignment and flexibility in cell based
manufacturing environments has been studied and analyzed in plenty using various
heuristics/mathematical models, application of Artificial Neural Networks (ANN),
adapted from the biological neural networks, is the recent development in this
field exploiting the ability of ANN to work out mathematically-difficult-to-solve
problems. In this attempt, the previous work of the author has been further
developed and an attempt has been made to apply Learning Vector Quantization (LVQ)
approach into worker assignment problems for higher order virtual cells i.e., three
cells configurations and analyze the suitability of LVQ approach in terms of
successful classification rate and simulation parameters for a number of VCMS
periods. © (2012) Trans Tech Publications, Switzerland.
AUTHOR KEYWORDS: Artificial neural networks; Learning vector quantization (LVQ);
Virtual cellular manufacturing; Worker assignment
INDEX KEYWORDS: Assignment problems; Biological neural networks; Cell-based
manufacturing; Classification rates; Dynamic production; Learning Vector
Quantization; Processing time; Product mix; Production sequences; Simulation
parameters; Virtual cells; Virtual cellular manufacturing; Virtual cellular
manufacturing system; Worker assignment, Cells; Cellular manufacturing; Cytology;
Neural networks, Vector quantization
REFERENCES: Slomp, J., Chowdary, B.V., Suresh, N.C., Design of virtual
manufacturing cells: A mathematical programming approach (2005) Robotics and
Computer-Integrated Manufacturing, 21, pp. 273-288;
past research and identification of future research (2006) International Journal of
Flexible Manufacturing Systems, 17, pp. 71-92;
review and survey (2005) Computers & Industrial Engineering, 48, pp. 507-523;
(6), pp. 1353-1368;
Dagli, C., Huggahalli, R., A neural network approach to Group Technology (1993)
Neural Networks in Design and Manufacturing, pp. 1-55., J. Wang & Y. Takefugi Ed.,
(River Edge, NJ: World Scientific);
Murali, R.V., Puri, A.B., Prabhakaran, G., Artificial neural networks based
predictive model for worker assignment into virtual cells (2010) International
Journal of Engineering, Science and Technology, 2 (1), pp. 163-174;
Murali, R.V., Puri, A.B., Prabhakaran, G., GA-Driven ANN Model for Worker
Assignment into Virtual Manufacturing Cells (2010) Proceedings of the World
Congress on Engineering 2010, 3., WCE, June 30-July 2, 2010, London, U. K;
Freeman, J.A., Skapura, D.M., Neural Networks-Algorithms, Applications and
Programming Techniques (1991) International Student Edition, , Addison Wesley,
ISBN: 0-201-524449;
Haykin, S., (1999) Neural Networks: A Comprehensive Foundation, , Prentice-Hall,
Englewood Cliffs, NJ, USA, 2nd edition;
(2007) The Language of Technical Computing, , MATLAB, Neural Network Toolbox, The
Mathworks Inc
CORRESPONDENCE ADDRESS: Murali, R. V.; Department of Mechanical and Industrial
Engineering, Caledonian College of Engineering, PB 2322, PC 111, CPO Seeb, Oman;
ISSN: 10226680
ISBN: 9783037854983
ABBREVIATED SOURCE TITLE: Adv. Mater. Res.
SOURCE: Scopus
Javadian, N., Aghajani, A., Rezaeian, J., Ghaneian Sebdani, M.J.

23485559000;36871600200;15078048200;36871640900;
A multi-objective integrated cellular manufacturing systems design with dynamic
system reconfiguration
79961004051&doi=10.1007%2fs00170-011-3164-
2&partnerID=40&md5=d52c0701434563b2e5053a811424f08c
DOI: 10.1007/s00170-011-3164-2
Science and Technology, P.O. Box 734, Babol, Iran
ABSTRACT: Cellular manufacturing system (CMS)-an important application of group
technology-has been recognized as an effective way to enhance the productivity in a
factory. As a result of dynamic deterministic demands within the planning horizon,
a CMS configuration for a period might not be optimal or even feasible for other
planning periods. Consequently, a multi-objective dynamic cell formation problem is
presented, where the total cells load variation and sum of the miscellaneous costs
are to be minimized simultaneously. The second objective function calculates
machine costs, internal part production, intercellular and intracellular material
handling, back order, inventory holding and subcontracting. Since in this type of
problem, objectives are in conflict with each other, finding an ideal solution (a
solution which satisfies all objectives simultaneously) is not possible. Therefore
a non-dominated sorting genetic algorithm (NSGAII) is designed for finding Pareto-
optimal frontier that decision maker can select her/his slightly solution.
Numerical examples have been solved for demonstrate the efficiency of the proposed
algorithm. © 2011 Springer-Verlag London Limited.
AUTHOR KEYWORDS: Back order; Dynamic cell configuration; Multi-objective
optimization; Pareto optimal; Production planning; Subcontracting
INDEX KEYWORDS: Back order; Dynamic cell configuration; Multi objective; Pareto-
optimal; Production planning; Subcontracting, Algorithms; Group technology;
Materials handling; Multiobjective optimization; Production control; Systems
analysis, Cellular manufacturing
REFERENCES: Chen, M., A mathematical programming model for system reconfiguration
in a dynamic cellular manufacturing environment (1998) Ann Operation Research, 74,
pp. 179-284;
users (1989) Int J Prod Res, 27 (9), pp. 1511-1530., 10.1080/00207548908942637;
S0377221705009045;
S0096300305000238;
10), pp. 1001-1009., DOI 10.1007/s00170-006-0518-2;
S0925527306000995;
genetic- algorithm-based heuristic (2006) Int J Prod Res, 44 (12), pp. 2421-2444.,
1095.90026 10.1080/00207540500337833;
Oper Res, 192, pp. 414-428., 1157.90391 10.1016/j.ejor.2007.09.023;
method (1990) J Manuf Syst, 9, pp. 222-232., 10.1016/0278-6125(90)90053-K;
2315;
pp. 2185-2207;
Research, 38 (2), pp. 385-395., DOI 10.1080/002075400189473;
Research, 38 (5), pp. 1201-1218., DOI 10.1080/002075400189095;
Transactions (Institute of Industrial Engineers), 34 (9), pp. 837-846., DOI
10.1023/A:1015557007084, Operations Engineering on Large-scale Optimization;
Khoo, L.P., Lee, S.G., Yen, X.F., Multi-objective optimization of machine cell
layout using genetic algorithm (2003) Int J Comput Int Manuf, 16, pp. 140-155.,
10.1080/713804985;
(2003) Prod Plann Control, 14 (5), pp. 437-446., 10.1080/09537280310001597334;
pp. 829-853., DOI 10.1080/00207540512331311859;
Lei, D., Wu, Z.H., Tabu search for multiple-criteria manufecturing cell design
(2005) Int J Adv Manuf Technol, 28, pp. 950-956., 2187185 10.1007/s00170-004-2441-
8;
cell formation problem with capital constraints (2008) Advances in Engineering
Software, 40 (4), pp. 268-273., 10.1016/j.advengsoft.2008.04.008;
Oper Res, , 10.1016/j.cor.2007.10.026;
Collette, Y., Siarry, P., (2003) Multi-objective Optimization: Principles and Case
Studies, , Springer New York;
Kim, Y.-D., Study on surrogate objectives for loading a certain type of flexible
pp. 381-392;
10.1108/09576060110392560;
(2), pp. 182-197., DOI 10.1109/4235.996017, PII S1089778X02041012
CORRESPONDENCE ADDRESS: Aghajani, A.; Department of Industrial Engineering,
Mazandaran University of Science and Technology, P.O. Box 734, Babol, Iran; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Mahdavi, I., Mahadevan, B.

16417373200;6603710534;
CLASS: An algorithm for cellular manufacturing system and layout design using
sequence data
62 times.
39749085262&doi=10.1016%2fj.rcim.2007.07.011&partnerID=40&md5=7f41e9e6a0565f8dd07ac
7785e331f79
DOI: 10.1016/j.rcim.2007.07.011
AFFILIATIONS: Mazandaran University of Science and Technology, P.O. Box 734, Babol,
Iran;
Indian Institute of Management Bangalore, Bannerghatta Road, Bangalore, 560 076,
India
ABSTRACT: Cell formation problem in CMS design has received the attention of
researchers for more than three decades. However, use of sequence data for cell
formation has been a least researched area. Sequence data provides valuable
information about the flow patterns of various jobs in a manufacturing system.
Therefore, it is only natural to expect that use of sequence data must result in
not only identifying the part families and machine groups but also the layout
(sequence) of the machines within each cell. Unfortunately, such an approach has
not been taken in the past while solving CMS design problem using sequence data. In
this paper, we fill this gap in the literature by developing an algorithm that not
only identifies the cells but also the sequence of machines in the cells in a
simultaneous fashion. The numerical computations of the algorithm with the
available problems in the literature indicate the usefulness of the algorithm.
Further, it also points to the untapped potential of such an approach to solve CMS
design and layout problem using sequence data. © 2007 Elsevier Ltd. All rights
reserved.
AUTHOR KEYWORDS: CMS design; Layout design; Sequence data
INDEX KEYWORDS: Computation theory; Computer integrated manufacturing; Data
acquisition; Information retrieval; Problem solving, CMS design; Layout design;
Sequence data, Cellular manufacturing
REFERENCES: Sarker, B.R., Xu, Y., Operation sequences-based cell formation methods:
a critical survey (1998) Prod Plan Control, 9, pp. 771-783;
Oper Res, 69, pp. 284-291;
identification problem in cellular manufacturing (1986) J Oper Manage, 6 (2), pp.
125-147;

materials flow approach based on operations sequences (1990) IIE Trans, 22, pp. 84-
97;
designing cellular manufacturing systems (1987) Int J Prod Res, 25, pp. 639-665;
Decision Sci, 21, pp. 416-433;
minimising inter-cell movement and balancing workload among duplicate machines
(1997) Int J Prod Res, 35, pp. 1125-1146;
Kiang, M.Y., Kulkarni, U.R., Tam, K.Y., Self-organizing map network as an
interactive clustering tool-an application to group technology (1995) Decision
Support Syst, 15, pp. 351-374;
and production volumes (2001) Int J Prod Res, 39, pp. 2755-2768;
42, pp. 2419-2433;
(1985) Eng Costs Prod Econ, 9, pp. 125-134;
Int J Prod Res, 26, pp. 1161-1172;
formations (1988) J Manuf Syst, 9, pp. 55-68;
machines: a Fuzzy ART neural network approach (1999) Int J Prod Res, 37, pp. 2793-
2816;
manufacturing cell formation allowing reallocation of operations (1993) Eur J Oper
Res, 69, pp. 292-311;
clustering for part-machine grouping based on operation sequences (2003) Int J Prod
Res, 41, pp. 3185-3216;
Irani, S.A., Cavalier, T.M., Cohen, P.H., Virtual manufacturing cells: exploiting
layout design and intercell flows for the machine sharing problem (1993) Int J Prod
Res, 31, pp. 791-810;
Liao, T.W., Design of line-type cellular manufacturing systems for minimum
operating and material-handling costs (1994) Int J Prod Res, 32, pp. 387-397;
feasibility of cellular manufacturing without initial machine-part clustering
(1994) Int J Prod Res, 32, pp. 1909-1938;
analysis (1996) Int J Prod Res, 34, pp. 2299-2315;
Trans, 29, pp. 561-571;
in the bidirectional linear flow layout (2001) Int J Prod Res, 39, pp. 3491-3512;
approach for the cell formation in bi-directional linear flow layout (2004) Comput
Integr Manuf, 17, pp. 346-375;
Kusiak, A., Heragu, S.S., The facility layout problem (1987) Eur J Oper Res, 29,
pp. 229-251;
Eur J Oper Res, 57, pp. 136-144;
Houshyar, A., McGinnis, L.F., A heuristic for assigning facilities to locations to
minimize WIP travel distance in a linear facility (1990) Int J Prod Res, 28, pp.
1485-1498;
Afentakis, P., A loop layout design problem for flexible manufacturing systems
(1989) Int J Flexible Manuf Syst, 1, pp. 175-196;
Int J Prod Res, 42, pp. 3911-3927;
Yin, Y., Yasuda, K., Reconsidering generalized similarity coefficient via a
sequence ratio (2004) Int J Ind Eng-Theory Appl Practice, 11, pp. 140-150;
434-446
CORRESPONDENCE ADDRESS: Mahdavi, I.; Mazandaran University of Science and
Technology, P.O. Box 734, Babol, Iran; email: [email protected]
ISSN: 07365845
CODEN: RCIME
SOURCE: Scopus
Hu, L., Yasuda, K.

55470175000;57194905767;
Minimising material handling cost in cell formation with alternative processing
routes by grouping genetic algorithm
5 times.
84991483981&doi=10.1080%2f00207540500336108&partnerID=40&md5=9ee8ed36d1f6a12f56f1fb
8e26a06140
DOI: 10.1080/00207540500336108
Management, Tohoku University, Kawauchi, Aoba-ku, Sendai, 980-8576, Japan
ABSTRACT: The alternative processing route is one of the important design factors
for the cell formation problem (CFP) in cellular manufacturing systems (CMSs).
Genetic algorithm (GA) is a popular method for solving the CFPs, because GA is
capable of searching large regions of the solution's space while being less
susceptible to getting trapped in local optima. However, the disadvantage of
classical GAs is that the number of manufacturing cells should be known in advance.
Knowing the actual number of manufacturing cells is relatively difficult before the
CMS design is determined. Grouping genetic algorithm (GGA) is capable of solving
CFP without predetermination of the number of cells, which is introduced by
Falkenauer's GGA (1998). In order to adopt the GGA on CFP with alternative
processing routes, we develop a new chromosome representation, a local optimisation
algorithm for crossover operator and special mutation operators. These efforts
ensure the efficiency of our method and are indicated in the numerical examples,
and improved solutions are also obtained in the numerical examples. © 2006 Taylor &
Francis Group, LLC.
AUTHOR KEYWORDS: Alternative processing routes; Cell formation; Cellular
manufacturing; Grouping genetic algorithm
moves in group technology cell formation (2000) J. Manuf. Syst., 19, pp. 305-317;
Aytug, H., Khouja, M., Vergara, F.E., Use of genetic algorithms to solve production
and operations management problems: A review (2003) Int. J. Prod. Res., 41, pp.
3955-4009;
plans and machine capacity constraints: A new combined approach (2000) Int. J.
Prod. Econ., 64, pp. 279-284;
pp. 257-271;
Falkenauer, E., (1998) Genetic Algorithms for Grouping Problem, , Wiley: New York);

Learning, , Addison-Wesley: Reading, MA);
Op. Res., 109, pp. 286-298;
Michigan Press: Ann Arbor);
constrained optimisation problems with genetic algorithms (1994) Proceedings of the
1994 IEEE International Symposium EC, pp. 579-584., Orlando, FL;
Kusiak, A., The generalised group technology concept (1987) Int. J. Prod. Res., 25,
pp. 561-569;
(1994) Int. J. Prod. Res, 32, pp. 273-297;
presence of alternative routing (1999) Int. J. Prod. Res., 37, pp. 3289-3304;
Meents, I., A genetic algorithm for the group-technology problem (2001)
Applications of Evolutionary Computing. Proceedings of Evoworkshops 2001: Evocop,
Evoflight, Evoiasp, Evolearn, and Evostim, pp. 90-99., Como, Italy, 18-20 April;
Programs, , Springer-Verlag: New York);
Nagi, N., Harhalakis, G., Proth, J.M., Multiple routings and capacity
2243-2257;
design and organisation of manufacturing systems (2003) Comp. & Ind. Eng., 44, pp.
339-364;
grouping technology systems (1993) Euro. J. Op. Res., 69, pp. 373-383;
Shanker, K., Agrawal, A.K., Models and solution methodologies for the generalised
grouping problem in cellular manufacturing (1997) Int. J. Prod. Res., 35, pp. 513-
538;
formulation of machine cells in group technology (1997) Int. J. Prod. Res., 35, pp.
501-511;
(1996) Int. J. Ind. Eng., 3, pp. 114-125;
component grouping problem with multiple objectives (1992) Comp. & Ind. Eng., 22,
pp. 469-480;
problem involving processing times and lot sises (2003) Comp. &Ind. Eng., 45, pp.
713-731
CORRESPONDENCE ADDRESS: Hu, L.; Industrial and Management Science, Graduate School
of Economics and Management, Tohoku University, Kawauchi, Aoba-ku, Sendai, 980-
8576, Japan; email: [email protected]
ISSN: 00207543
SOURCE: Scopus
Soleymanpour, M., Vrat, P., Shankar, R.

6504600348;7004178886;57205452089;
A transiently chaotic neural network approach to the design of cellular
manufacturing
49 times.
0037054899&doi=10.1080%2f00207540210122284&partnerID=40&md5=fc08859de478c7d81152c2f
eaefe5bfc
DOI: 10.1080/00207540210122284
AFFILIATIONS: Mechanical Engineering Department, Indian Institute of Technol.
Delhi, New Delhi, India
ABSTRACT: The design of Cellular Manufacturing Systems (CMS) has attained the
significant attention of academicians and practitioners over the last three
decades. Minimizing intercellular movements while maximizing utilization of
machines are the main objectives of interest in designing CMS and are considered in
present research. In this paper, the drawbacks of former neural networks-based
approaches to cell formation are discussed. The standard version of cell formation
problem is formulated and a 'Transiently Chaotic Neural Network' (TCNN) with
supplementary procedures is introduced as a powerful rival. A simplified network is
constructed. After developing the related equations the approach is tested using
the proposed algorithm with 18 problems selected from literature. The results are
compared with various other approaches including ART1, Extended-ART1, Ortho-Synapse
Hopfield Neural Network (OSHN), etc. The main advantages of our proposed method
are: (1) the ability to avoid the local optima trap, (2) the ability to solve
problems of different sizes with the same set of values for parameters, and (3) the
less computation time. The results also indicate considerable improvement in
grouping efficiency through the proposed approach.
INDEX KEYWORDS: Algorithms; C (programming language); Machinery; Mathematical
models; Neural networks; Optimization; Resource allocation, Transiently chaotic
neural network, Cellular manufacturing
hamiltonian path approach to reordering the part-machine matrix for cellular
1081-1100;
Aihara, K., Takabe, T., Toyoda, M., Chaotic neural networks (1990) Physics Letters
A, 144 (6-7), pp. 333-340;
Burke, L., Kamal, S., Fuzzy ART for cellular manufacturing (1992) Intelligent
Engineering Systems Through Artificial Neural Networks, pp. 779-784., In C. Dagli
et al. (eds); (New York: ASME Press), chapter 2;
problem in cellular manufacturing: A framework using Fuzzy (1995) ART. Journal of
Research, 24, pp. 451-464;
Chen, L., Aihara, K., Chaotic simulated annealing by a neural network model with
transient chaos (1995) Neural Networks, 8 (6), pp. 915-930;
Chen, L., Aihara, K., Global searching ability of chaotic neural networks (1999)
IEEE Transactions on Circuits and Systems-I, 46 (8), pp. 974-993;
Chen, L., Aihara, K., Strange attractors in chaotic neural networks (2000) IEEE
Transactions on Circuits and Systems-I, 47 (10), pp. 1455-1468;
293-318;
Chung, Y., Kusiak, A., Grouping parts with a neural network (1994) Journal of
pp. 893-913;
Hwang, H., Sun, J.-U., A genetic-algorithm-based heuristic for the cell formation
problem (1996) Computers in Industrial Engineering, 30 (4), pp. 941-955;
Kao, Y., Moon, Y.B., A unified group technology implementation using the back-
propagation learning rule of neural networks (1991) Computers in Industrial
Engineering, 20 (4), pp. 425-437;
Kaparthi, S., Suresh, N.C., A neural system for shape-based classification and
coding of rotational parts (1991) International Journal of Production Research, 29
(9), pp. 1771-1784;
pp. 1353-1367;
117-133;
Liao, T.W., Chen, L.J., An evaluation of ART1 network models for GT part family and
machine cell formation (1993) Journal of Manufacturing Systems, 12, pp. 282-290;
Global Economy Challenges and Prospects, Indian Institute of Technology, New Delhi,
India, pp. 565-571;
Nozawa, H., A neural network model as a globally coupled map and applications based
on chaos (1992) Chaos, 2, pp. 377-386;
formation applications (1989) Computers in Industrial Engineering, 16 (3), pp. 419-
426;
Shankar, R., Vrat, P., Some design issues in cellular manufacturing using the fuzzy
pp. 2545-2563;
Srinivasan, G., Narendran, T.T., Mahdevan, B., An assignment model for part-
Research, 28 (1), pp. 145-152;
Vrat, P., Majeed Ali, A.A., Design of cellular manufacturing: Hopfield neural
network approach (1995) Proceedings of the National System Conference, India, pp.
467-473;
Wang, L., Smith, K., On chaotic simulated annealing (1998) IEEE Transactions on
Neural Networks, 9 (4), pp. 716-718;
Zolfaghari, S., Liang, M., A Hopfield neural network approach to machine grouping
problem (1995) Proceedings of the 14th Industrial Engineering Research Conference,
Nashville, TN, USA, pp. 542-549;
Research, 35 (10), pp. 2773-2792
CORRESPONDENCE ADDRESS: Vrat, P.; Mechanical Engineering Department, Indian
Institute of Technol. Delhi, New Delhi, India
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Crama, Y., Oosten, M.

7003921347;6602516011;
Models for machine-part grouping in cellular manufacturing
27 times.
0030170588&doi=10.1080%2f00207549608904991&partnerID=40&md5=1e48948c47c616c85690827
3c979f5fc
DOI: 10.1080/00207549608904991
AFFILIATIONS: Départment de Gestion, Université de Liège, Liège, 400, Belgium;
Department of Mathematics, University of Limburg, P.O. Box 616, Maastricht, MD, NL-
6200, Netherlands
ABSTRACT: For cellular manufacturing strategies to succeed, the productive system
first has to be divided into highly independent cells. This means that a partition
of the machines into machine groups, a partition of the parts into part families,
and a matching between the machine groups and the part families have to be
simultaneously determined. Mathematically, this question can be expressed as the
problem of finding a near block diagonal permutation of the machine-part incidence
matrix. Research on such grouping problems has primarily concentrated on the design
of heuristics. Different grouping efficiency criteria have been proposed to express
the quality of the groupings proposed by these heuristics. This paper is concerned
with mathematical programming approaches to the formation of production cells.
Existing models are reviewed and their features are briefly discussed. An
alternative model is proposed, which allows for the formulation of various
constraints and grouping efficiency criteria. Finally, some test problems are used
to support the claim that this model may be adequate for the solution to optimality
of the cell formation problem. © 1996 Taylor and Francis Group, LLC.
INDEX KEYWORDS: Decision making; Heuristic methods; Loading; Machinery;
Mathematical models; Mathematical programming; Production control; Scheduling,
Cellular manufacturing; Machine part grouping, Manufacture
REFERENCES: Arabie, P., Hubert, L.J., The bond energy algorithm revisited (1990)
IEEE Transactions on Systems, Man, and Cybernetics, 20, pp. 268-274;
Boctor, F.F., Alternative formulations of the machine-part cell formation problem
(1989) Proceedings of the Third ORSA/TIMS Conference on Flexible Manufacturing
Systems: Operations Research Models and Applications, pp. 133-139., F. E. Stecke
and R. Suri (eds) (Amsterdam: Elsevier Science Publishers;
2097-2116;
Bondy, J.A., Murty, U.S.R., (1976) Graph Theory with Applications, , New York:
North Holland);
Research, 24, pp. 1221-1233;
Chandrasekharan, M.P., Rajogopalan, R., ZODIAC: An algorithm for concurrent
formation of part-families and machine-groups (1987) International Journal of
Crama, Y., Oosten, M., (1993) The Polytope of Block Diagonal Matrices., , Research
Report M93-I2, University of Limburg, Dept, of Mathematics, Maastricht,
Netherlands;
Dinkelbach, W., On non-linear fractional programming (1967) Management Science, 13,
pp. 492-498;
Studies, pp. 301-315., A. Kusiak (ed.) (Amsterdam: Elsevier Science Publishers;
Faigle, U., Schrader, R., Suletzki, R., A cutting-plane algorithm for optimal graph
partitioning (1986) Methods of Operations Research: XI Symposium on Operations
Research, pp. 109-116., W. Domschke, W. Krabs, J. Lehn, P. Spellucci (eds)
(Darmstadt: Athenäum;
Gondran, M., Minoux, M., (1984) Graphs and Algorithms, , New York: Wiley);
Grotschel, M., Wakabayashi, Y., A cutting plane algorithm for a clustering problem
Grotschel, M., Wakabayashi, Y., Facets of the clique partitioning polytope (1990)
Mathematical Programming, 47, pp. 367-387;
Hansen, P., Methods of nonlinear 0-1 programming (1979) Annals of Discrete
Hertz, A., Jaumard, B., Ribeiro, C.C., (1991) A Graph Theory Approach to
Subcontracting, Machine Duplication and Intercell Moves in Cellular Manufacturing.,
, Research Report G-91-07, GERAD, Montreal;
Hilger, J., Harhalakis, G., Proth, J.M., Manufacturing cells and part families:
Generalization of the GP method (1991) Information and Decision Technologies, 17,
pp. 51-61;
27, pp. 1287-1304;
pp. 1535-1547;
Research, 18, pp. 213-232;
117-133;
397;
Kumar, K.R., Vanelli, A., Strategic subcontracting for efficient disaggregated
1728;
91;
Leskowsky, Z., Logan, L., Vanelli, A., Group technology decision aids in an expert
system for plant layout (1987) Modern Production Management Systems: Proceedings of
the IF1P TC 5Jwg 5-7 Working Conference on Advances in Production Management
Systems, pp. 561-571., A. Kusiak (ed.) (Amsterdam: Elsevier Science Publishers;
data reorganization by a clustering technique (1972) Operations Research, 20, pp.
993-1009;
York: Wiley);
Ng, S.M., Bond energy, rectilinear distance and a worst-case bound for the group
technology problem (1991) Journal of the Operational Research Society, 42, pp. 571-
578;
Page, R., Tarjan, R.E., Three partition refinement algorithms (1987) SIAM Journal
of Computing, 16, pp. 973-989;
Schonberger, R.J., (1982) Japanese Manufacturing Techniques, , New York: Free
Press);
478;
Stern, J.M., (1991) Simulated Annealing with a Temperature Dependent Penalty
Function. Extended Abstract in Program of COST Conference, , RUTCOR Report 3-91,
Rutgers University, New Brunswick, New Jersey;
Sule, D.R., Machine capacity planning in group technology (1991) Internationa!
Vanelli, A., Kumar, K.R., A method for finding minimal bottleneck cells for
24, pp. 387-400;
Ventura, J.A., Chen, F.F., Wu, C.H., Grouping parts and tools in flexible
Research, 28, pp. 2075-2084
CORRESPONDENCE ADDRESS: Oosten, M.; Department of Mathematics, University of
Limburg, P.O. Box 616, Maastricht, MD, NL-6200, Netherlands
ISSN: 00207543
SOURCE: Scopus
Rezazadeh, H., Khiali-Miab, A.

56462607000;57192996380;
A two-layer genetic algorithm for the design of reliable cellular manufacturing
systems
(2017) International Journal of Industrial Engineering Computations, 8 (3), pp.
85009877539&doi=10.5267%2fj.ijiec.2017.1.001&partnerID=40&md5=51147d28a70f93c743423
1df5854fe5c
DOI: 10.5267/j.ijiec.2017.1.001
AFFILIATIONS: Department of Industrial Engineering, Faculty of Mechanical
Engineering, University of Tabriz, Iran
ABSTRACT: This study presents a new mathematical model for the design of reliable
cellular manufacturing systems, which leads to reduced manufacturing costs,
improved product quality and improved total reliability of the manufacturing
system. This model is expected to provide a more noticeable improvement in time and
solution quality in comparison with other existing models. Each part to be
manufactured may select each of the predefined manufacturing routes, such that the
total reliability of the system is increased. On the other hand, the model adopts
to categorize the machines to determine the manufacturing cells (cell formation)
and reduce the transportation costs. Thereby, both criteria of system reliability
and manufacturing costs will be simultaneously improved. Due to the complexity of
cell formation problems, a two-layer genetic algorithm is applied on the problem in
order to achieve near optimal solutions. Furthermore, the performance of the
proposed algorithm is shown for solving some computational experiments. Finally,
the results of a practical study for designing a cellular manufacturing system as a
case study in Iranian Diesel Engine Manufacturing Co., Tabriz, Iran are present. ©
2017 Growing Science Ltd. All rights reserved and 2016 by the authors; licensee
Growing Science, Canada.
AUTHOR KEYWORDS: Cell Formation; Mathematical Model; Reliability; Two-Layer
Genetic Algorithm
REFERENCES: Agarwal, A., Sarkis, J.A., Review and analysis of comparative
performance studies of functional and cellular manufacturing layouts (1998)
reconfiguration (2009) International Journal of Production Research, 47 (6), pp.
1573-1600;
2347;
Ameli, M.S.J., Arkat, J., Cell formation with alternative process routings and
machine reliability consideration (2008) The International Journal of Advanced
Handbook of Cellular Manufacturing Systems, pp. 25-34., (Chapter1) John Wiley, New
York;
Boughton, N.J., Arokiam, I.C., The application of the cellular manufacturing: A
regional small to medium enterprise perspective (2000) Proceedings of the
Institution of the Mechanical Engineers, 214, pp. 751-754;
Das, K., Lashkari, R.S., Sengupta, S., Machine reliability and preventive
maintenance planning for cellular manufacturing systems (2007) European Journal of
Economics, 103 (2), pp. 767-783;
geneticalgorithm-based heuristic (2006) International Journal of Production
Research, 44 (12), pp. 2421-2444;
Research, 46 (22), pp. 6389-6413;
multiperiod manufacturing cell formation problems (2008) The International Journal
Flynn, B.B., Robert Jacobs, F., A simulation comparison of group technology with
Research, 24 (5), pp. 1171-1192;
Gen, M., Cheng, R., (1997) Genetic Algorithms and Engineering Design, , Wiley, MA;
Goldberg, D.E., (1989) Genetic Algorithms in Search Optimization & Machine
Learning, , Addison Wesley;
The University of Michigan Press;
Lokesh, K., Jain, P.K., Part-machine group formation with operation sequence, time
pp. 198-209;
Lokesh, K., Jain, P.K., Part-Machine group formation with ordinal-ratio level data
pp. 90-101;
Lokesh, K., Jain, P.K., Concurrently part-machine group formation with important
production data (2010) International Journal of Simulation Modelling, 9 (1), pp. 5-
16;
Lokesh, K., Jain, P.K., Dynamic cellular manufacturing systems design-a
comprehensive model & HHGA (2010) Advances in Production Engineering & Management
Journal, 5 (3), pp. 151-162;
Man, K.F., Tang, K.S., Kwong, S., (1999) Genetic Algorithms: Concepts and Design, ,
Springer, London;
Morris, S.J., Tersine, R.J., A simulation analysis of factors influencing the
attractiveness of group technology cellular layouts (1990) Management Science, 36
(12), pp. 1567-1578;
systems (2001) Computers & Industrial Engineering, 39 (1), pp. 125-144;
Saxena, L.K., Jain, P.K., Dynamic cellular manufacturing systems design—a
Technology, 53 (1-4), pp. 11-34;
application of quality index (2001) Computers & Industrial Engineering, 40 (1), pp.
65-77;
707-720;
Tompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A., (2003) Facility
Planning, , Wiley, New York;
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the U S industry: A survey of
Research, 38 (2), pp. 385-395
CORRESPONDENCE ADDRESS: Rezazadeh, H.; Department of Industrial Engineering,
Faculty of Mechanical Engineering, University of TabrizIran; email:
[email protected]
PUBLISHER: Growing Science
ISSN: 19232926
ABBREVIATED SOURCE TITLE: Int. J. Ind. Eng. Comput.
SOURCE: Scopus
Fouad, R.H., Mukattash, A.M.

25636859600;14321787700;
Specifying optimal number of cells using a modified dissimilarity measure based on
AVV approach
(2012) International Journal of Applied Mathematics and Statistics, 28 (4), pp. 96-
100.
84866760001&partnerID=40&md5=f6b9e255e263899d8e5a54fa86b200f6
AFFILIATIONS: Industrial Engineering Department, Hashemite University, Jordan

ABSTRACT: The first step in Cellular Manufacturing (CM) is manufacturing cell
formation (CF), i.e., grouping parts with similar design features or processing
requirements into families and allocating associated machines. Many similarity and
dissimilarity measures have been published in the literature to solve CF problem.
The main step of theses measures is to find the similarity and/or dissimilarity
between the machines and/or the parts. Some of theses measures have poor
performance. In this paper one of the wellknown dissimilarity measures is analyzed
and tested against a case study taken from the literature and the test results show
that this measures has some deficiencies in finding the optimal number of cells(the
cell which has minimum sum of voids and/or exceptions). To avoid these deficiencies
a modified dissimilarity measure has been developed in this paper for solving cell
formation problem in cellular manufacturing systems. The modified measure is based
on AVV approach. The same case study has been tested using our modified measure,
and the result showed that our modified measure is superior in finding the optimal
number of cells. © 2011-12 by IJAMAS, CESER Publications.
AUTHOR KEYWORDS: Average voids value (AVV); Cell formation; Cellular
manufacturing systems; Dissimilarity coefficients; Optimal number of Cells;
Optimal solution
INDEX KEYWORDS: Average voids value (AVV); Cell formation; Dissimilarity
coefficients; Optimal number; Optimal solutions, Cells; Cytology; Optimization,
REFERENCES: Lee-Post, A., Part family identification using a simple genetic
algorithm (2000) International Journal of Production Research, 38 (4), pp. 793-810;
Mitrofanov, S.P., (1996) The scientific principles of group technology, , (Boston

Spa, Yorkshire, UK: National Lending Library Translation);
Wafik, H., Faouzi, M., Mohamed, H., Formation of machine groups and part families
in cellular manufacturing systems using a correlation analysis approach (2008)
Nair, G.J., Narendran, T.T., ACCORD: a bicriterion algorithm for cell formation
Research, 37 (3), pp. 539-556;
Adil, G.K., Ajamani, D., Strong, D., Cell formation considering alternate routings
Chandrasekharan, M.P., Pajagopalan, R., An ideal seed non-hierarchical clustering
Viswanathan, S., Configuring cellular manufacturing systems: a quadratic integer
in cellular manufacturing (2001) Computers & Industrial Engineering, 39, pp. 1-17
CORRESPONDENCE ADDRESS: Fouad, R.H.; Industrial Engineering Department, Hashemite
UniversityJordan
ISSN: 09731377
ABBREVIATED SOURCE TITLE: Int. J. Appl. Math. Stat.
SOURCE: Scopus
Pitombeira Neto, A.R., Gonalves Filho, E.V.

36610588600;36238140400;
A simulation-based evolutionary multiobjective approach to manufacturing cell
formation
77955266831&doi=10.1016%2fj.cie.2010.02.017&partnerID=40&md5=6d5488feaf3af59a569ef4
05d94fd245
DOI: 10.1016/j.cie.2010.02.017
AFFILIATIONS: Department of Mechanical and Industrial Engineering, Federal
University of Ceará, Campus Do Pici, CEP 60455-760 Fortaleza, Brazil;
Mechanical Engineering Department, São Carlos Engineering School, University of São
Paulo, Av. Trabalhador Sancarlense, 400, Centro, CEP: 13566-590 São Carlos, SP,
Brazil
ABSTRACT: The purpose of this paper is to propose a multiobjective optimization
approach for solving the manufacturing cell formation problem, explicitly
considering the performance of this said manufacturing system. Cells are formed so
as to simultaneously minimize three conflicting objectives, namely, the level of
the work-in-process, the intercell moves and the total machinery investment. A
genetic algorithm performs a search in the design space, in order to approximate to
the Pareto optimal set. The values of the objectives for each candidate solution in
a population are assigned by running a discrete-event simulation, in which the
model is automatically generated according to the number of machines and their
distribution among cells implied by a particular solution. The potential of this
approach is evaluated via its application to an illustrative example, and a case
from the relevant literature. The obtained results are analyzed and reviewed.
Therefore, it is concluded that this approach is capable of generating a set of
alternative manufacturing cell configurations considering the optimization of
multiple performance measures, greatly improving the decision making process
involved in planning and designing cellular systems. © 2010 Elsevier Ltd. All
rights reserved.
AUTHOR KEYWORDS: Discrete-event simulation; Genetic algorithms; Manufacturing
cell formation; Multiobjective optimization
INDEX KEYWORDS: Automatically generated; Candidate solution; Cellular system;
Decision making process; Design spaces; Illustrative examples; Inter-cell moves;
Manufacturing cell formation; Manufacturing cells; Manufacturing system;
Multiobjective approach; Pareto-optimal sets; Particular solution; Performance
measure; Simulation-based; Work-in-process, Cellular manufacturing; Computer
simulation; Decision making; Flexible manufacturing systems; Genetic algorithms;
Industrial applications; Machinery; Population statistics, Multiobjective
optimization
REFERENCES: Adil, G., Rajamani, D., Strong, D., Cell formation considering
361-1380;
Research, 24 (5), pp. 1221-1233;
Chu, C.H., Tsai, M., Comparison of three array-based clustering techniques for
28 (8), pp. 1417-1433;
Coello, C.A.C., Lamont, G.B., Van Veldhuizen, D.A., (2007) Evolutionary Algorithms
for Solving Multi-objective Problems, , 2nd ed. Springer Science + Business Media
New York;
Chichester;
(2), pp. 182-197;
manufacturing (2007) Engineering Optimization, 39 (5), pp. 551-565;
Ding, H., Benyoucef, L., Xie, X., A simulation-based multi-objective genetic
algorithm approach for networked enterprises optimization (2006) Engineering
Applications of Artificial Intelligence, 19 (6), pp. 609-623;
Ehrgott, M., (1999) Multicriteria Optimization, , 2nd ed. Springer Berlin;
Eskandari, H., Rabelo, L., Mollaghasemi, M., Multiobjective simulation optimization
using an enhanced genetic algorithm (2005) Proceedings of the 2005 Winter
Simulation Conference, pp. 833-841;
Gan, G., Ma, C., Wu, J., (2007) Data Clustering: Theory, Algorithms and
Applications, , SIAM Philadelphia, ASA, Alexandria;
Gonalves Filho, E.V., Tiberti, A.J., A group genetic algorithm for the machine cell
formation problem (2006) International Journal of Production Economics, 102 (1),
pp. 1-21;
formation using a new self-organizing neural network (2002) Computers & Industrial
Engineering, 42 (2), pp. 377-382;
grouping (2000) International Journal of Production Economics, 63 (2), pp. 181-193;
Hallam, N., Blanchfield, P., Kendall, G., Handling diversity in evolutionary

multiobjective optimisation (2005) Proceedings of the 2005 IEEE Congress on
Evolutionary Computation, pp. 2233-2240;
Hani, Y., Amodeo, L., Yalaoui, F., Chen, H., Simulation based optimization of a
train maintenance facility (2008) Journal of Intelligent Manufacturing, 19 (3), pp.
293-300;
Hopp, W., Spearman, M., (2000) Factory Physics, , McGraw-Hill/Irwin New York;
69-85;
Research, 18 (2), pp. 213-232;
Lacksonen, T., Empirical comparison of search algorithms for discrete event
simulation (2001) Computers & Industrial Engineering, 40 (12), pp. 133-148;
Lee, L.H., Chew, E.P., Teng, S., Chen, Y., Multi-objective simulation-based
evolutionary algorithm for an aircraft spare parts allocation problem (2008)
Mansouri, S.A., Moattar, S.M., Newman, S.T., A review of the modern approaches to
multi-criteria cell design (2000) International Journal of Production Research, 38
(5), pp. 1201-1218;
Mollaghasemi, M., Evans, G.W., Multicriteria design of manufacturing systems
through simulation optimization (1994) IEEE Transactions on Systems, Man and
Cybernetics, 24 (9), pp. 1407-1411;
Rosen, S.L., Harmonosky, C.M., Traband, M.T., Optimization of systems with multiple
performance measures via simulation: Survey and recommendations (2008) Computers &
426;
707-720;
Suresh, N.C., Partitioning work centers for group technology: Insights from an
analytical model (1991) Decision Sciences, 22 (4), pp. 772-791;
Teleb, R., Azadivar, F., A methodology for solving multi-objective simulation-
optimization problems (1994) European Journal of Operational Research, 72 (1), pp.
135-145;
Tsai, C.-C., Chu, C.-H., Wu, X., An evolutionary fuzzy multi-objective approach to
cell formation (2006) Proceedings of the 6th International Conference on Simulated
Evolution and Learning, pp. 377-383., Springer Berlin;
component grouping problem with multiple objectives (1992) Computers & Industrial
Engineering, 22 (4), pp. 469-480;
Wall, M., (1996) GAlib: A C++ Library of Genetic Algorithm Components, ,
http://lancet.mit.edu/ga/dist/galibdoc.pdf;
36 (8), pp. 2099-2114;
Research, 38 (2), pp. 385-395;
study and the strength Pareto approach (1999) IEEE Transactions on Evolutionary
Computation, 3 (4), pp. 257-271
CORRESPONDENCE ADDRESS: Pitombeira Neto, A. R.; Department of Mechanical and
Industrial Engineering, Federal University of Ceará, Campus Do Pici, CEP 60455-760
Fortaleza, Brazil; email: [email protected]
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Chen, M.-C.
7407447746;
Configuration of cellular manufacturing systems using association rule induction
times.
0242301526&doi=10.1080%2f0020754021000024184&partnerID=40&md5=b092cbd8f4cb2fb2d4a5e
3b6ca635ae3
DOI: 10.1080/0020754021000024184
AFFILIATIONS: Department of Business Management, Inst. of Comm.
Automat./Management, Natl Taipei Univ. of Technology, #1, Section 3, Chung-Hsiao E.
Road, Taipei, Taiwan
ABSTRACT: A cell-formation approach based on association rule induction is
developed to find the effective configurations for cellular manufacturing systems.
To gain the benefits of flexibility and efficiency, the manufacturing system is
decomposed into several manageable subsystems by categorizing similar parts into
part families and disparate machines into cells. It is advantageous to find the
important associations among machines such that the occurrence of some machines in
a machine cell will cause the occurrence of other machines in the same cell.
Relationships among machines can be found from the process database by inducting
association rules. By applying association rules to cell-formation problems,
certain sets of machines (machine groups) that frequently process some parts
together can be inducted. A data-mining technique referred to as association rule
induction is used herein to find the association rules among machines from the
process database. Seventeen data sets of various size and complexity were used to
evaluate the effectiveness of the proposed cell-formation algorithm based on
association rule induction. The performance of the proposed approach is compared
with several existing techniques. From the computational results, the proposed
approach shows its ability to find quality solutions.
INDEX KEYWORDS: Algorithms; Associative processing; Cellular manufacturing;
Computational complexity; Data mining; Database systems; Process control,
Association rules, Group technology
REFERENCES: Agrawal, R., Imieliaski, T., Swami, A., Mining association rules
between sets of items in large databases (1993) Proceedings of the 1993 ACM-SIGMOD
International Conference on Management of Data, pp. 207-216;
2097-2116;
Burbidge, J.L., (1989) Production Flow Analysis, , Oxford, UK: Clarendon Press;
Research, 24, pp. 451-464;
Chen, M.-S., Han, J., Yu, P.S., Data Mining: An overview from a database
perspective (1996) IEEE Transactions on Knowledge and Data Engineering, 8, pp. 866-
883;
Cheng, C.H., Gypta, Y.P., Lee, W.H., Wong, K.F., A TSP-based heuristic for forming
Research, 36, pp. 1325-1337;
Chu, C.H., Clustering analysis in manufacturing cell formation (1989) Omega:
Dimopoulos, C., Mort, A., A hierarchical clustering methodology based on genetic
pp. 461-468;
Hyer, A.L., Wemmerlov, U., Group technology oriented coding systems: Structures,
application and implementation (1985) Production and Inventory Management, 26, pp.
125-147;
117-133;
38, pp. 1201-1218;
51, pp. 53-57;
Milteanurg, J., Zhang, W., A comparative evaluation of nine well-known algorithms
implementation - A state-of-the-art survey (1985) Omega: International Journal of
Ng, S.M., Worse-case analysis of an algorithm for cellular manufacturing (1993)

270;
Srinivasan, G., Narendran, T.T., Grafics - A non-hierarchical clustering algorithm
463-478;
Verugopal, V., Soft-computing-based approaches to the group technology problem: A
state-of-the-art-review (1999) International Journal of Production Research, 37,
pp. 3335-3357
CORRESPONDENCE ADDRESS: Chen, M.-C.; Department of Business Management, Inst. of
Comm. Automat./Management, Natl Taipei Univ. of Technology, #1, Section 3, Chung-
Hsiao E. Road, Taipei, Taiwan; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Susanto, S., Kennedy, R.D., Price, J.W.H.

16032542500;57199847526;56308933800;
A new fuzzy-C-means and assignment technique- based cell formation algorithm to
perform part-type clusters and machine-type clusters separately
0032629654&doi=10.1080%2f095372899233127&partnerID=40&md5=6350402537d726bd4f7daa8df
fc77dfa
DOI: 10.1080/095372899233127
Technology, Parahyangan Catholic University, Jl. Ciumbuleuit 94, Bandung, West
Java, 40141, Indonesia;
Mechanical Engineering Department, Monash University-Caulfield Campus, PO Box 197,
Caulfield East, VIC, 3145, Australia
ABSTRACT: The incorporation of fuzziness in the cell formation problem by Chu and
Hayya (1991 International Journal of Production Research, 29, 1475-1487) is a
notable contribution, in which non-binary classification logic is used. However,
despite this development, numerical illustrations performed in this research
demonstrate that the Chu and Hayya approach can result in solutions with empty
party-type cluster(s) and/or empty machine-type cluster(s). Further, it is noted
that solutions based on the Chu and Hayya approach can contain non-empty part-type
cluster(s) being assigned to empty machine-type clusters) and vice versa. Three
strategies are offered in this research to overcome these inadequacies: the
separate formation of part-type and machine-type clusters; modification of the
stopping criterion; and the adoption of the assignment technique in the formation
of the final manufacturing cell solutions. A new algorithm has resulted from these
modifications and has been rigorously compared to the performance of the Chu and
Hayya approach. In general, the new algorithm demonstrates superiorities in global
efficiency and in generating feasible party-type clusters, machine-type clusters
and manufacturing cells. © 1999, Taylor & Francis Group, LLC. All rights reserved.
AUTHOR KEYWORDS: Cell formation; Fuzzy-c-means; Fuzzy-c-partition; Machine-type
cluster; Part-type cluster
INDEX KEYWORDS: Algorithms; Cellular manufacturing; Fuzzy sets; Process
engineering; Strategic planning, Chu/Hayya method; Machine-type clusters; Part-type
clusters, Production control
REFERENCES: Bezdek, J.C., (1981) Pattern Recognition with Fuzzy Objective Function
Algorithms, , New York: Plenum Press;
Bunday, B.D., (1984) Basic Linear Programming, , London: Edward Arnold;
Planning, Design and Analysis of Cellular Manufacturing Systems (Amsterdam, pp. 3-
46., A. Kamrani, H. R. Parsaei and D. H. Liles, The Netherlands: Elsevier Science
B.B;
Gindy, N.N.A., Ratchev, T.M., Case, K., Component grouping for group technology
applications— afuzzy clustering approach with validity measure (1995) International
Kumar, K.R., vannelli, A., Strategic subcontracting for efficient disaggregated
1728;
1094;
Moodie, C., Uzsoy, R., Yih, Y., Manufacturing Cells (1995) A Systems Engineering
View, , (Bristol, PA, USA: Taylor & Francis);
Ng, S.M., In the characterization and measure of machine cells in group technology
(1996) Operations Research, pp. 44735-44744;
objective functional clustering algorithms (1994) International Journal of Advanced
Susanto, S., Kennedy, R.D., Price, J.W.H., A preliminary study of a clustering and
assignment problem- based formation problem (1997) Proceedings of the International
Conference on Manufacturing Automation (ICMA ’97), 1, pp. 95-104;
Taha, H., (1992) Operations Research: An Introduction, p. 214., 5th edn. Ontario:
Macmillan;
Wemmerlov, U., Production Planning and Control Procedures for Cellular
Manufacturing Systems (1988) Concepts and Practices, , (Falls Church, Virginia,
USA: The Library of American Production);
Wemmerlov, V., Hyer, N.L., Group Technology (1992) Handbook of Industrial
Engineering, , G. Salvendy (ed.), (New York, USA: Wiley);
Xu, H., Wang, H.-P., Part family formation for group technology applications based
on fuzzy mathematics (1989) International Journal of Production Research, 27, pp.
1637-1651
ISSN: 09537287
SOURCE: Scopus
Sarker, B.R., Li, Z.

7004982967;56075265700;
Measuring matrix-based cell formation with alternative routings
times.
0032163785&doi=10.1057%2fpalgrave.jors.2600606&partnerID=40&md5=f6657e6cfc6334e0e14
0d282e7d8289f
AFFILIATIONS: Louisiana State University, United States
ABSTRACT: A good measure is necessary to evaluate the goodness of grouping in
cellular manufacturing. For simple group technology (GT) problems, there are some
grouping measures available, the most cited ones are grouping efficiency and
grouping efficacy. A grouping measure, which considers alternative routings, is not
available for the generalised GT problems. In this paper a new measure called
alternative routing grouping (ARG) efficiency is proposed and its desirable
properties are derived. Not only can this alternative routing grouping efficiency
be used in the generalised GT problems, but it can also be used in the simple GT
problems. The computation of the alternative routing grouping efficiency is
illustrated with examples, and results of empirical tests on a set of known
problems are also reported in this paper. The alternative routing grouping
efficiency is extended to the simple GT measures. Grouping efficiency suffers from
a weak discriminating capability and grouping efficacy has relatively a better
discriminating capability. It is proved that the ARG efficiency has better
discriminating capability than the existing measures, and this measure can evaluate
the effectiveness of grouping in both simple and generalised cell formation
problems with alternative process plans. © 1998 Operational Research Society Ltd.
All Rights reserved.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing: alternating routing;
Group efficiency; Group technology
INDEX KEYWORDS: Group technology; Matrix algebra; Problem solving; Process control;
Production control; Scheduling, Alternative routing grouping (ARG); Matrix-based
cell formations, Cellular manufacturing
REFERENCES: Mc Auley, J., Machine grouping for efficient production (1972)
Production Engineer, pp. 53-57., February;
MACE (1984) Intjprod Res, 22, pp. 937-948;
and similarity coefficients to the GT machine cell formation (1989) Int J Prod Res,
27, pp. 1811-1820;
reorganization by clustering technique (1972) Opns Res, 20, pp. 993-1009;
Review and extension (1982) Int Jprod Res, 20, pp. 117-133;
Chan, H.M., Milliner, D.A., Direct clustering algorithm for group formation in
cellular manufacturing (1982) J Manufact Sys, 1, pp. 65-74;
Chandrsekharan, M.P., Rajagopolan, R., ZODIAC: An algorithm for concurrent
formation of part-families and machine cells (1987) Int J Prod Res, 25, pp. 835-
850;
Kaparthi, S., Suresh, N.C., Performance of selected part- machine grouping
technique for data sets of wide ranging sizes and imperfection (1994) Decis Sci,
25, pp. 515-539;
Shambu, G., Suresh, N.C., Pegels, C.C., Performance of evaluation of cellular
manufacturing systems: Taxonomy and review of research (1996) Int J Opns and Prod
Mgmt, 16, pp. 81-103;
Nair, G., Narendran, T.T., Grouping index: A new quantitative criterion for
goodness of block-diagonal forms in group technology (1996) Int J Prod Res, 34, pp.
2767-2782;
27, pp. 43-59;
Sundaram, R.M., Doshi, K., Formation of part-families to design cells with
alternative routing consideration (1992) Comput and Indust Engng, 23, pp. 59-62;
routing consideration (1993) Comput and Indust Engng, 25, pp. 477-480;
Sarker, B.R., Balan, C.V., Cell formation with operation times of jobs for even
distribution of workloads (1996) Int J Prod Res, 34, pp. 1447-1468;
Lotfi, V., Suresh, N.C., Flexible automation investment, problem formulation and
solution procedure (1994) Eur J Opl Res, 79, pp. 383-404;
561-569;
Won, Y., Kim, S., An assignment method for the part- machine cell formation problem
in the presence of multiple processing routes (1994) Eng Optim, 22, pp. 231-240;
Won Yand Kim, S., Multiple criteria clustering algorithm for solving the group
technology problem with multiple process routings (1997) Comp and Indust Engng, 32,
pp. 207-220;
J Prod Res, 28, pp. 233-243;
(1996) Int J Prod Res, 34, pp. 1361-1380;
Sarker, B.R., Li, K., Simultaneous route selection and cell formation: A mixed-
integer programming time-cost model (1997) Integ Manufact Sys, 8, pp. 374-377;
systems in the presence of alternate process plans (1990) Int J Prod Res, 28, pp.
1541-1554;
(1994) Int J Prod Res, 32, pp. 273-297;
process plans in flexible manufacturing systems (1991) Prod Plann and Cont, 2, pp.
135-141;
Nagi, R., Harkalakis, G., Proth, J., Multiple routings and capacity consideration
alternative part process plans (1996) Comp and Indust Engng, 30, pp. 423-431;
Ho, H.-C., Moodie, C.L., Solving cell formation problem in a manufacturing
environment with flexible processing and routing capabilities (1996) Int J Prod
Res, 34, pp. 2901-2923;
comparative study of relational metrics (1986) Comp and Indust Engng, 30, pp. 103-
116;
Moon, Y.B., Chi, S.C., Generalized part-family formation using neural network
techniques (1992) J Manufact Sys, 11, pp. 149-160;
routing in group technology manufacturing system (1990) Engng Optim, 16, pp. 235-
245;
(1991) Int Jprod Res, 29, pp. 1475-1487;
under random product demand (1994) Int J Prod Res, 32, pp. 47-64;
Arizono, I., Kato, M., Yamamoto, A., Ohta, H., A new stochastic neural network
model and its application to grouping parts and tools in flexible manufacturing
systems (1995) Int J Prod Res, 33, pp. 1535-1548;
Malakooti, B., Yang, Z., A variable-parameter unsupervised learning clustering
neural network approach with application to machine-part group formation (1995) Int
J Prod Res, 33, pp. 2395-2413;
manufacturing. Part II. An extension and comparison (1993) Int J Prod Res, 31, pp.
1315-1326;
Srinivasan, G., Narendran, T.T., GRAFICS—a nonhierarchical clustering algorithm
Ventura, J.A., Chen, F.F., Wu, C., Grouping parts and tools in flexible
manufacturing systems production planning (1990) Int J Prod Res, 28, pp. 1039-1056;
Sarker, B.R., Modal, S., Grouping efficiency measures in cellular manufacturing: A

survey and critical review (1998) Int J Prod Res, , to appear;
Sarker, B.R., Khan, M., Grouping efficency measures in cellular manufacturing
systems (1997) Working Paper, pp. 70803-76409., Department of Industrial &
Manufacturing Systems Engineering, Louisiana State University, Baton Rouge, LA
CORRESPONDENCE ADDRESS: Sarker, B.R.; Department of Industrial and Manufacturing
Systems Engineering, Louisiana State University, Baton Rouge, LA, 70803-6409,
United States; email: [email protected], lsu.edu
ISSN: 01605682
SOURCE: Scopus
Frazier, G.V., Gaither, N., Olson, D.

7006712704;6701536929;35561732100;
A procedure for dealing with multiple objectives in cell formation decisions
6963%2890%2990005-X&partnerID=40&md5=2ada4edcbae6346e40a28f00e4600b35
DOI: 10.1016/0272-6963(90)90005-X
AFFILIATIONS: University of Oregon, Eugene, OR 97403, United States;
Texas A and M University, College Station, TX 77843, United States
ABSTRACT: A procedure for dealing with multiple objectives in cell formation
decisions is proposed. Theoretical foundations from multiobjective decision making
have been utilized to provide a framework for the study. The purpose of the study
is to develop a procedure that provides managers with a means of developing
multiple objective cell formation decisions as an alternative to intractable
integer programming models. We use a best of random seeds heuristic to generate a
large number of alternatives. Nondominated solution theory is used to develop a
list of potentially useful alternatives. Finally, preference cone theory is used to
aid decision maker selection from these nondominated alternatives. Each of these
three technologies have been developed elsewhere. This study considers aspects of
applying these technologies to cell formation decisions. The procedure and its
theoretical underpinnings are explained step-by-step and illustrated in a four-
objective, four-cell, 24-machine, and 50-part cell formation problem. The example
contains 12 nondominated solutions and requires only four pairwise comparisons of
nondominated solutions by a decision maker before convergence to the preferred
solution. Computer processing requirements are not burdensome, and decision maker
participation is expected to be efficient. © 1990.
REFERENCES: Benayoun, de Montgolfier, Tergny, Larichev, Linear Programming with
Multiple Objective Functions: Step Method (STEM) (1971) Mathematical Programming, 1
(3), pp. 366-375;
Benayoun, Roy, Sussman, ELECTRE: Une methode pour guider le choixe en presence de
points de vue multiples (1966) SEMA, , note 49;
Burbidge, Production Flow Analysis (1963) Production Engineer, 42, pp. 742-752;
Burbidge, Production Flow Analysis (1971) Production Engineer, 50, pp. 139-152;
Debreu, (1959) Theory of Value: An Axiomatic Analysis of Economic Equilibrium, ,
Yale University Press, New Haven;
El-Essawy, Torrance, Component Flow Analysis (1972) Production Engineer, 51, pp.
165-170;
Frazier, (1989) Impact of Seed Machines on the Cell Formation Decision in Cellular
Manufacturing, , Department of Business Analysis and Research, Texas A&M
University, College Station, TX, Unpublished dissertation;
Frazier, Gaither, Seed Selection Procedures for Cell Formation Heuristics (1990)
review at International Journal of Production Research;
Keeney, Raiffa, (1976) Decisions with Multiple Objectives: Preferences and Value
Trade-offs, , John Wiley and Sons, New York;
King, Nakornchai, Machine-Component Group Formulation in Group Technology Review
and Extension (1982) International Journal of Production Research, 20, pp. 1715-
1728;
Korhonen, Wallenius, Zionts, Solving the Discrete Multiple Criteria Problem Using
Convex Cones (1984) Management Science, 30 (11), pp. 1336-1345;
Kumar, Kusiak, Vannelli, Grouping of Parts and Components in Flexible Manufacturing
Systems (1986) European Journal of Operational Research, 24, pp. 387-397;
Lee, (1972) Goal Programming for Decision Analysis, , Auerbach Publishers,
Philadelphia;
Malakooti, A Decision Support System and a Heuristic Interactive Approach for
Solving Discrete Multiple Criteria Problems (1988) IEEE Transactions on Systems,
Man, and Cybernetics, 18 (2), pp. 273-284;
Clustering Technique (1972) Operations Research, (2), pp. 993-1008;
Ramesh, Karwan, Zionts, Theory of Convex Cones in Multicriteria Decision Making
(1988) Annals of Operations Research, 16, pp. 131-148;
Saaty, A Scaling Method for Priorities in Hierarchical Structures (1977) Journal of
Mathematical Psychology, 15, pp. 234-281;
Steuer, An Interactive Multiple Objective Linear Programming Procedure (1977) TIMS
Studies in the Management Sciences, 6, pp. 225-239;
Steuer, (1986) Multiple Criteria Optimization: Theory, Computation, and
Application, , John Wiley and Sons, New York;
Vannelli, Kumar, A Method for Finding Minimal Bottle-Neck Cells for Grouping Part-
Machine Families (1986) International Journal of Production Research, 24 (2), pp.
387-400;
Wei, Gaither, A Capacity Constrained Multiobjective Cell Formation Model (1990)
Journal of Manufacturing Systems, 9 (3);
Wei, Gaither, An Optimal Capacitated Model for Cell Formation (1990) Decision
Sciences, 21 (2), pp. 416-433;
pp. 125-147;
Wemmerlöv, Hyer, Cellular Manufacturing in the U.S. Industry: A Survey of Users
Zionts, Wallenius, An Interactive Programming Method for Solving the Multiple
Criteria Problem (1976) Management Science, 22 (6), pp. 652-663
CORRESPONDENCE ADDRESS: Frazier, G.V.; University of Oregon, Eugene, OR 97403,
United States
ISSN: 02726963
CODEN: JOTME
SOURCE: Scopus
Azadeh, A., Pashapour, S., Abdolhossein Zadeh, S.

56268189600;55873140700;56507274400;
Designing a cellular manufacturing system considering decision style, skill and job
security by NSGA-II and response surface methodology
1 time.
84965013485&doi=10.1080%2f00207543.2016.1178407&partnerID=40&md5=e7232a037ecbf1edb5
fcc36539bf7715
DOI: 10.1080/00207543.2016.1178407
AFFILIATIONS: School of Industrial and Systems Engineering, College of Engineering
and Center of Excellence for Intelligent Based Experimental Mechanic, University of
Tehran, Tehran, Iran
ABSTRACT: Cell formation is a traditional problem in cellular manufacturing systems
that concerns the allocation of parts, operators and machines to the cells. This
paper presents a new mathematical programming model for cell formation in which
operators’ personality and decision-making styles, skill in working with machines,
and also job security are incorporated simultaneously. The model involves the
following five objectives: (1) minimising costs of adding new machines to and
removing machines from the cells at the beginning of each period, (2) minimising
total cost of material handling, (3) maximising job security, (4) minimising
inconsistency of operators’ decision styles in cells and (5) minimising cost of
suitable skill. On account of the NP-hard nature of the proposed model, NSGA-II as
a powerful meta-heuristic approach is used for solving large-sized problems.
Furthermore, response surface methodology (RSM) is used for tuning the parameters.
Lastly, MOPSO and two scalarization methods are employed for validation of the
results obtained. To the best of our knowledge, this is the first study that
presents a multi-objective mathematical model for cell formation problem
considering operators’ personality and skill, addition and removal of machines and
job security. © 2016 Informa UK Limited, trading as Taylor & Francis Group.
AUTHOR KEYWORDS: cell formation; decision style; job security; MOPSO; NSGA-II;
response surface methodology; skill
INDEX KEYWORDS: Cells; Costs; Cytology; Decision making; Heuristic methods; Job
satisfaction; Manufacture; Materials handling; Mathematical operators; Mathematical
programming; Multiobjective optimization; Problem solving; Surface properties, Cell
formation; Decision styles; Job security; MOPSO; NSGA-II; Response surface
methodology; skill, Cellular manufacturing
REFERENCES: Ah kioon, S.A., Bulgak, A.A., Bektas, T., Integrated Cellular
Manufacturing Systems Design with Production Planning and Dynamic System
Reconfiguration (2009) European Journal of Operational Research, 192, pp. 414-428;
Arkat, J., Naseri, F., Ahmadizar, F., A Stochastic Model for the Generalised Cell
Formation Problem Considering Machine Reliability (2011) International Journal of
Arkat, J., Farahani, M.H., Ahmadizar, F., Multi-objective Genetic Algorithm for
Cell Formation Problem Considering Cellular Layout and Operations Scheduling (2012)
Azadeh, A., Farahani, M.H., Kalantari, S.S., Zarrin, M., Solving a Multi-objective
Open Shop Problem for Multi-processors under Preventive Maintenance (2015) The
Azadeh, A., Mokhtari, Z., Sharahi, Z.J., Zarrin, M., An Integrated Experiment for
Identification of Best Decision Styles and Teamworks with Respect to HSE and
Ergonomics Program: The Case of a Large Oil Refinery (2015) Accident Analysis &
Prevention, 85, pp. 30-44;
Azadeh, A., Zarrin, M., Hamid, M., A Novel Framework for Improvement of Road
Accidents Considering Decision-making Styles of Drivers in a Large Metropolitan
Area (2016) Accident Analysis & Prevention, 87, pp. 17-33;
Black, J.T., Schroer, B.J., Simulation of an Apparel Assembly Cell with Walking
Workers and Decouplers (1993) Journal of Manufacturing Systems, 12 (2), pp. 170-
180;
Bootaki, B., Mahdavi, I., Paydar, M.M., New Bi-objective Robust Design-based
Utilisation towards Dynamic Cell Formation Problem with Fuzzy Random Demands
International Journal of Computer Integrated Manufacturing, 28 (6), pp. 577-592.,
Forthcoming;
Cesaní, V.I., Steudel, H.J., A Study of Labor Assignment Flexibility in Cellular
Manufacturing Systems (2005) Computers and Industrial Engineering, 48 (3), pp. 571-
591;
Chan, F.T.S., Lau, K.W., Chan, L.Y., Lo, V.H.Y., Cell Formation Problem with
Consideration of Both Intracellular and Intercellular Movements (2008)
Coello, C.A.C., Pulido, G.T., Lechuga, M.S., Handling Multiple Objectives with
Particle Swarm Optimization (2004) IEEE Transactions on Evolutionary Computation, 8
(3), pp. 256-279;
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.A.M.T., A Fast and Elitist Multi-
objective Genetic Algorithm: NSGA-II (2002) IEEE Transactions on Evolutionary
Deep, K., Singh, P.K., Design of Robust Cellular Manufacturing System for Dynamic
Part Population Considering Multiple Processing Routes Using Genetic Algorithm
Defersha, F.M., Chen, M., Machine Cell Formation Using a Mathematical Model and a
Genetic-algorithm-based Heuristic (2006) International Journal of Production
Research, 44 (12), pp. 2421-2444;
Driver, M.J., Brousseau, K.R., Hunsaker, P.L., (1998) The Dynamic Decision Maker:
Five Decision Styles for Executive and Business Success, , Bloomington: iUniverse;
Egilmez, G., Erenay, B., Süer, G.A., Stochastic Skill-based Manpower Allocation in
a Cellular Manufacturing System (2014) Journal of Manufacturing Systems, 33 (4),
pp. 578-588;
4038-4045;
Ertay, T., Ruan, D., Data Envelopment Analysis Based Decision Model for Optimal
Operator Allocation in CMS (2005) European Journal of Operational Research, 164
(3), pp. 800-810;
Gunasingh, K.R., Lashkari, R.S., The Cell Formation Problem in Cellular
Manufacturing Systems – A Sequential Modelling Approach (1989) Computers &
Heimerl, C., Kolisch, R., Work Assignment to and Qualification of Multi-Skilled
Human Resources under Knowledge Depreciation and Company Skill Level Targets (2010)
Kennedy, J., Eberhart, R.C., Particle Swarm Optimization (1995) Proceedings of IEEE
Multi-floor Layout Design Model of a Dynamic Cellular Manufacturing System by an
Efficient Genetic Algorithm (2014) Journal of Manufacturing Systems, 33 (1), pp.
218-232;
Laumanns, M., Thiele, L., Zitzler, E., An Efficient, Adaptive Parameter Variation
Scheme for Metaheuristics Based on the Epsilon-constraint Method (2006) European
Mahdavi, I., Aalaei, A., Paydar, M., Solimanpur, M., Designing a Mathematical Model
for Dynamic Cellular Manufacturing Systems Considering Production Planning and
Worker Assignment (2010) Computers and Mathematics with Applications, 60 (4), pp.
1014-1025;
Mahdavi, I., Teymourian, E., Baher, N.T., Kayvanfar, V., An Integrated Model for
Solving Cell Formation and Cell Layout Problem Simultaneously Considering New
Situations (2013) Journal of Manufacturing Systems, 32 (4), pp. 655-663;
Mitrofanov, S.P., (1966) The Scientific Principles of Group Technology, , Yorks:
National Landing Library Translation;
Myers, R.H., Montgomery, D.C., Anderson-Cook, C.M., (2009) Response Surface
Methodology: Process and Product Optimization Using Designed Experiments, 705., New
Jersey: John Wiley;
Worker Assignment in Cellular Manufacturing Considering Technical and Human Skills
Nouri, H., Hong, T.S., Development of Bacteria Foraging Optimization Algorithm for
Cell Formation in Cellular Manufacturing System Considering Cell Load Variations
Paydar, M.M., Saidi-Mehrabad, M., Revised Multi-choice Goal Programming for
Integrated Supply Chain Design and Dynamic Virtual Cell Formation with Fuzzy
Parameters International Journal of Computer Integrated Manufacturing, 28 (3), pp.
251-265., forthcoming;
Paydar, M.M., Saidi-Mehrabad, M., Teimoury, E., A Robust Optimisation Model for
Generalised Cell Formation Problem Considering Machine Layout and Supplier
Selection (2014) International Journal of Computer Integrated Manufacturing, 27
(8), pp. 772-786;
Russell, R.S., Huang, P.Y., Leu, Y., A Study of Labour Allocation Strategies in
Cellular Manufacturing (1991) Decision Sciences, 22 (3), pp. 594-611;
Safaei, N., Saidi-Mehrabad, M., Jabal-Ameli, M.S., A Hybrid Simulated Annealing for
Solving an Extended Model of Dynamic Cellular Manufacturing System (2008) European
Safaei, N., Tavakkoli-Moghaddam, R., Rana, S.P., Integrated Multi-period Cell
Formation and Subcontracting Production Planning in Dynamic Cellular Manufacturing
Systems (2009) International Journal of Production Economics, 120 (2), pp. 301-314;
Saraç, T., Ozcelik, F., A Genetic Algorithm with Proper Parameters for
Manufacturing Cell Formation Problems (2012) Journal of Intelligent Manufacturing,
23 (4), pp. 1047-1061;
Satoglu, S., Suresh, N.C., A Goal-programming Approach for Design of Hybrid
Cellular Manufacturing Systems in Dual Resource Constrained Environments (2009)
Schaller, J., Designing and Redesigning Cellular Manufacturing Systems to Handle
Demand Changes (2007) Computers and Industrial Engineering, 53 (3), pp. 478-490;
Shiyas, C.R., Madhusudanan Pillai, V.M., A Mathematical Programming Model for
Manufacturing Cell Formation to Develop Multiple Configurations (2014) Journal of
Singh, N., Aneja, Y.P., Rana, S.P., A Bicriterion Framework for Operations
Assignment and Routing Flexibility Analysis in Cellular Manufacturing Systems
Tavakkoli-Moghaddam, R., Ranjbar-Bourani, M., Amin, G.R., Siadat, A., A Cell
Formation Problem Considering Machine Utilization and Alternative Process Routes by
Scatter Search (2012) Journal of Intelligent Manufacturing, 23 (4), pp. 1127-1139;
Wu, C.C., Hsu, P.H., Lai, K., Simulated-annealing Heuristics for the Single-machine
Scheduling Problem with Learning and Unequal Job Release times (2011) Journal of
Manufacturing Systems, 30 (1), pp. 54-62
CORRESPONDENCE ADDRESS: Azadeh, A.; School of Industrial and Systems Engineering,
College of Engineering and Center of Excellence for Intelligent Based Experimental
Mechanic, University of TehranIran; email: [email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Niakan, F., Baboli, A., Moyaux, T., Botta-Genoulaz, V.

54947325300;23974157700;55900429700;55666011400;
A new multi-objective mathematical model for dynamic cell formation under demand
and cost uncertainty considering social criteria
84956965005&doi=10.1016%2fj.apm.2015.09.047&partnerID=40&md5=a8e4c8a24ccf948638e0fd
b105e975d1
DOI: 10.1016/j.apm.2015.09.047
AFFILIATIONS: Université de Lyon, INSA-Lyon, DISP EA4570, Villeurbanne, 69621,
France
ABSTRACT: This paper examines a new multi-objective mathematical model in a Dynamic
Cell Formation Problem (DCFP), where social criteria and uncertainty conditions are
considered. Although corporate social responsibility is one of the important issues
that are increasingly considered by researchers and practitioners, it is largely
overlooked in the literature on DCFP. In this paper the first objective function
minimizes costs related to a machine (machine fixed and variable costs, machine
procurement and relocation costs, intra-cell and inter-cell movement costs) and
wages, while social issues are maximized (e.g. potential machine hazards are
minimized, while job opportunities are maximized). A robust counterpart of the
proposed model is then developed by applying the recent robust optimization theory.
Afterward, due to the NP-hardness of DCFP, a non-dominated sorting genetic
algorithm (NSGA-II) as a meta-heuristic method is designed. Finally, two
deterministic and robust mathematical formulations are compared by a number of
nominal realizations under randomly generated test problems. This serves to assess
the robustness of the solution achieved by the proposed robust optimization model.
The obtained results demonstrate the ability of the robust model to reach
appropriate solutions at all levels of uncertainty, specifically when a feasible
solution cannot be found with the deterministic model. © 2015 Elsevier Ltd.
AUTHOR KEYWORDS: Corporate social responsibility; Dynamic cell formation; Multi-
objective optimization; Non-dominated sorting genetic algorithm; Robust
optimization
INDEX KEYWORDS: Cells; Cellular manufacturing; Costs; Cytology; Genetic algorithms;
Heuristic methods; Multiobjective optimization; Site selection, Corporate social
responsibilities (CSR); Dynamic cell formation; Mathematical formulation; Non
dominated sorting genetic algorithm (NSGA II); Non- dominated sorting genetic
algorithms; Robust optimization; Robust optimization models; Robust optimization
theory, Optimization
REFERENCES: Cruz, J.M., Wakolbinger, T., Multiperiod effects of corporate social
responsibility on supply chain networks, transaction costs, emissions, and risk
(2008) Int. J. Prod. Econ., 116 (1), pp. 61-74;
Amaeshi, K.M., Osuji, O.K., Nnodim, P., Corporate social responsibility in supply
chains of global brands: a boundaryless responsibility? Clarifications, exceptions
and implications (2008) J. Bus. Ethics, 81 (1), pp. 223-234;
Carter, C.R., Jennings, M.M., Social responsibility and supply chain relationships
(2002) Transp. Res. Part E Logist. Transp. Rev., 38 (1), pp. 37-52;
(2001) Social Accountability 8000 International Standards, , SAI, New York;
(2010) Final Draft International standard ISO/FDIS 26000, , Guid. Soc. Responsib;
(2011) Sustainability reporting guidelines, , version 3.1;
(1998) Criteria for a recommended standard: occupational noise exposure, pp. 98-
126., Department of Health and Human Services, Washington, DC;
a dynamic model for a highly dynamic environment (1995) Comput. Ind. Eng., 29 (1-
4), pp. 221-225;
Schaller, J., Selçuk Erengüç, S., Vakharia, A., A methodology for integrating cell
formation and production planning in cellular manufacturing (1998) Ann. Oper. Res.,
77, pp. 1-21;
environment using Tabu search (2004) Comput. Ind. Eng., 46 (3), pp. 571-588;
dynamic cell formation problem using metaheuristics (2005) Appl. Math. Comput., 170
(2), pp. 761-780;
Tavakkoli-moghaddam, R., Safaei, N., Babakhani, M., Solving a dynamic cell
algorithms (2005) Stochastic Algorithms: Foundations and Applications, pp. 213-227;
cellular manufacturing systems (2006) Int. J. Prod. Econ., 103 (2), pp. 767-783;
systems under dynamic and uncertain conditions (2007) J. Intell. Manuf., 18 (3),
pp. 383-399;
Safaei, N., Saidi-Mehrabad, M., Tavakkoli-Moghaddam, R., A fuzzy programming
approach for a cell formation problem with dynamic and uncertain conditions (2008)
Fuzzy Sets Syst, 159, pp. 215-236;
Safaei, N., Saidi-Mehrabad, M., Jabal Ameli, M.S., A hybrid simulated annealing for
Oper. Res., 185, pp. 563-592;
Oper. Res., 187 (1), pp. 46-69;
41 (3-4), pp. 329-342;
Int. J. Prod. Econ., 120 (2), pp. 301-314;
multi-objective scatter search for a dynamic cell formation problem (2009) Comput.
Oper. Res., 36 (3), pp. 777-794;
Technol., pp. 318-329;
Modell., 34 (4), pp. 1078-1092;
and worker assignment (2010) Comput. Math. Appl., 60 (4), pp. 1014-1025;
Javadian, N., Aghajani, A., Rezaeian, J., Ghaneian Sebdani, M., A multi-objective
reconfiguration (2011) Int. J. Adv. Manuf. Technol., 56 (1-4), pp. 307-317;
manufacturing system (2011) Appl. Math. Modell., 35 (4), pp. 1810-1819;
Saxena, L., Jain, P., Dynamic cellular manufacturing systems design-a comprehensive
model (2011) Int. J. Adv. Manuf. Technol., 53 (1-4), pp. 11-34;
Kia, R., Baboli, A., Javadian, N., Tavakkoli-moghaddam, R., Kazemi, M., Khorrami,
simulated annealing (2012) Comput. Oper. Res., 39 (11), pp. 2642-2658;
formation considering labor utilization (2013) Appl. Math. Modell., 37 (4), pp.
2308-2316;
Appl. Math. Modell., 37 (4), pp. 1884-1896;
Javadi, B., Jolai, F., Slomp, J., Rabbani, M., Tavakkoli-Moghaddam, R., A hybrid
electromagnetism-like algorithm for dynamic inter/intra-cell layout problem (2014)
Int. J. Comput. Integr. Manuf., 27 (6), pp. 501-518;
Aghajani, A., Didehbani, S.A., Zadahmad, M., Seyedrezaei, M.H., Mohsenian, O., A
multi-objective mathematical model for cellular manufacturing systems design with
probabilistic demand and machine reliability analysis (2014) Int. J. Adv. Manuf.
Technol., 75 (5-8), pp. 755-770;
Bootaki, B., Mahdavi, I., Paydar, M.M., New bi-objective robust design-based
utilisation towards dynamic cell formation problem with fuzzy random demands (2014)
Int. J. Comput. Integr. Manuf., 28 (6), pp. 1-16;
parameters (2014) Int. J. Comput. Integr. Manuf., 28 (3), pp. 251-265;
Renna, P., Ambrico, M., Design and reconfiguration models for dynamic cellular
manufacturing to handle market changes (2014) Int. J. Comput. Integr. Manuf., 28
(2), pp. 170-186;
Cruz, J.M., Liu, Z., Modeling and analysis of the multiperiod effects of social
relationship on supply chain networks (2011) Eur. J. Oper. Res., 214 (1), pp. 39-
52;
Iacovides, A., .Fountoulakis, K., Kaprinis, S., Kaprinis, G., The relationship
between job stress, burnout and clinical depression (2003) J. Affective Disord., 75
(3), pp. 209-221;
Aryanezhad, M.B., Kheirkhah, A.S., Deljoo, V., Mirzapour Al-e-hashem, S.M.J.,
Designing safe job rotation schedules based upon workers' skills (2008) Int. J.
Adv. Manuf. Technol., 41 (1-2), pp. 193-199;
Dehghanian, F., Mansour, S., Designing sustainable recovery network of end-of-life
products using genetic algorithm (2009) Resour. Conserv. Recycl., 53 (10), pp. 559-
570;
Boggia, A., Cortina, C., Measuring sustainable development using a multi-criteria
model: a case study (2010) J. Environ. Manage., 91 (11), pp. 2301-2306;
Ben-Tal, A., El-Ghaoui, L., Nemirovski, A., (2009) Robust Optimization, pp. 7-23.,
Princeton University Press, New Jersey, USA;
Ben-Tal, A., Nemirovski, A., Robust solutions of uncertain linear programs (1999)
Oper. Res. Lett., 25 (1), pp. 1-16;
Ben-Tal, A., Golany, B., Nemirovski, A., Vial, J.-P., Retailer-supplier flexible
commitments contracts: a robust optimization approach (2005) Manuf. Serv. Oper.
Manage., 7 (3), pp. 248-271;
Pishvaee, M.S., Rabbani, M., Torabi, S.A., A robust optimization approach to
closed-loop supply chain network design under uncertainty (2011) Appl. Math.
Modell., 35 (2), pp. 637-649;
Baron, O., Milner, J., Naseraldin, H., Facility location: a robust optimization
approach (2011) Prod. Oper. Manage., 20 (5), pp. 772-785;
genetic algorithm: NSGA-II (2002) IEEE Trans. Evol. Comput., 6 (2), pp. 182-197;
Chatsirirungruang, P., Application of genetic algorithm and Taguchi method in
dynamic robust parameter design for unknown problems (2010) Int. J. Adv. Manuf.
Technol., 47 (9-12), pp. 993-1002
CORRESPONDENCE ADDRESS: Baboli, A.; Université de Lyon, INSA-Lyon, DISP
EA4570France; email: [email protected]
PUBLISHER: Elsevier Inc.
ISSN: 0307904X
CODEN: AMMOD
SOURCE: Scopus
Baykasoglua, A., Gorkemli, L.

56431201200;35145816800;
Agent-based dynamic part family formation for cellular manufacturing applications
times.
84912523143&doi=10.1080%2f00207543.2014.924634&partnerID=40&md5=3dbe3a375e1d6583542
747ddcd37d81f
DOI: 10.1080/00207543.2014.924634
AFFILIATIONS: Department of Industrial Engineering, Dokuz Eylül University, Izmir,
Turkey;
Graduate School of Natural and Applied Sciences, University of Gaziantep,
Gaziantep, Turkey;
Department of Industrial Engineering, Erciyes University, Kayseri, Turkey
ABSTRACT: One of the main critique on cellular manufacturing and its algorithms is
their inability to handle dynamics events, especially dynamic changes in part
spectrum. Unfortunately, there are not many efforts in the literature to overcome
this problem. Agent oriented computing provides a marvellous opportunity to handle
dynamic problems and to provide effective solutions, if carefully and intelligently
implemented. In this paper, we have proposed a novel agent-based clustering
algorithm for part family formation in cellular manufacturing by considering
dynamic demand changes. However, it is not easy to directly compare the performance
of the proposed algorithm with the literature results as there is no benchmark for
dynamic cell formation problems. We attempt to compare the performance of the
present algorithm on static test problems by dynamically introducing parts in these
data-sets to our algorithm. Many results have been presented on these static data-
sets by utilising several heuristics, meta-heuristics and optimisation-based
algorithms. Although the proposed algorithm is not an optimisation-based algorithm
and its operation is directed to handle dynamic changes in the problem domain
through negotiation, we have shown that it has ability to provide very good results
which are comparable to the best known solutions. © 2014 Taylor & Francis.
AUTHOR KEYWORDS: Agent-based simulation; Cellular manufacturing; Dynamic
clustering; Negotiation; Part family formation
INDEX KEYWORDS: Benchmarking; Cellular manufacturing; Computer simulation;
Optimization, Agent based simulation; Agent-Based Clustering; Dynamic cell
formation; Dynamic clustering; Effective solution; Manufacturing applications;
Negotiation; Part family formation, Clustering algorithms
REFERENCES: Aggarwal, C.C., Han, J., Wang, J., Yu, P.S., A Framework for Clustering
Evolving Data Streams (2003) VLDB'03 Proceedings of the 29th International
Conference on Very Large Data Bases, Berlin, Germany;
Ah Kioon, S., Bulgak, A.A., Bektas, T., Integrated Cellular Manufacturing Systems
Design with Production Planning and Dynamic System Reconfiguration (2009) European
Al-Sultan, K.S., Fedjki, C.A., A Genetic Algorithm for the Part Family Formation
Problem (1997) Production Planning & Control, 8 (8), pp. 788-796;
Askin, R.G., Subramanian, S., A Cost-based Heuristic for Group Technology
Configuration (1987) International Journal of Production Research, 25, pp. 101-113;
Balakrishnan, J., Cheng, C.H., Dynamic Cellular Manufacturing under Multiperiod

Planning Horizons (2005) Journal of Manufacturing Technology Management, 16 (5),
pp. 516-530;
Balakrishnan, J., Cheng, C.H., Multi-period Planning and Uncertainty Issues in
Cellular Manufacturing: A Review and Future Directions (2007) European Journal of
Baykasoglu, A., A Meta-heuristic Algorithm to Solve Quadratic Assignment
Formulations of Cell Formation Problems without Presetting Number of Cells (2004)
Baykasoglu, A., Gindy, N., MOCACEF 1.0: Multiple Objective Capability Based
Approach to Form Part-machine Groups for Cellular Manufacturing Applications (2000)
Baykasoglu, A., Gindy, N.N.Z., Cobb, R.C., Capability Based Formulation and
Solution of Multiple Objective Cell Formation Problems Using Simulated Annealing
(2001) Integrated Manufacturing Systems, 12 (4), pp. 258-274;
Baykasoglu, A., Gindy, N.N.Z., Saad, S.M., A Framework for the Reconfiguration of
Cellular Manufacturing Systems (1998) IMS-98, 2nd Int. Symposium on Intelligent
Manufacturing Systems, Sakarya, Turkey, August 6-7;
Baykasoglu, A., Kaplanoglu, V., Erol, R., Sahin, C., A Multi-agent Framework for
Load Consolidation in Logistics (2011) Transport, 26 (3), pp. 320-328;
Baykasoglu, A., Saad, S.M., Gindy, N., A Loading Approach for Cellular
Manufacturing Systems (1998) FAIM'1998: 8th International Conference on Flexible
Automation and Intelligent Manufacturing, Portland, OR, USA, July 1-3;
Ben-Arieh, D., Sreenivasan, R., Information Analysis in a Distributed Dynamic Group
Technology Method (1999) International Journal of Production Economics, 60-61, pp.
427-432;
Bianchi, L., (2000) Notes on Dynamic Vehicle Routing - The State of the Art, ,
Technical Report December 20;
Boctor, F., A Linear Formulation of the Machine-part Cell Formation Problem (1991)
Boe, W., Cheng, C.H., A Close Neighbor Algorithm for Designing Cellular
pp. 2097-2116;
Borshchev, A., Filippov, A., From System Dynamics and Discrete Event to Practical
Agent Based Modeling: Reasons, Techniques, Tools (2004) The 22nd International
Conference of the System Dynamics Society, Oxford, England, July 25-29;
Branke, J., (2001) Evolutionary Optimization in Dynamic Environments, , Dordrecht:
Kluwer Academic;
Carrie, A.S., Numerical Taxonomy Applied to Group Technology and Plant Layout
Cellular Manufacture (1982) Journal of Manufacturing Systems, 1, pp. 65-75;
Chandrasekharan, M.P., Rajagopalan, R., An Ideal Seed Non-hierarchical Clustering
Research, 24 (2), pp. 451-463;
Research, 24 (5), pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC - An algorithm for Concurrent
Formation of Part-families and Machine-cells (1987) International Journal of
Chandrasekharan, M.P., Rajagopalan, R., Groupabil1ty: An Analysis of the Properties
of Binary Data Matrices for Group Technology (1989) International Journal of
Chen, M., A Mathematical Programming Model for System Reconfiguration in a Dynamic
Cellular Manufacturing Environment (1998) Annals of Operations Research, 77, pp.
109-128;
Cheng, C.H., Gupta, Y.P., Lee, W.H., Wong, K.F., A Tsp-based Heuristic for Forming
Machine Groups and Part Families (1998) International Journal of Production
Research, 36, pp. 1325-1337;
Das, K., Abdul-Kader, W., Consideration of Dynamic Changes in Machine Reliability
and Part Demand: A Cellular Manufacturing Systems Design Model (2011) International
Davidsson, P., Johansson, S.J., Persson, J.A., Wernstedt, F., Agent-based
Approaches and Classical Optimization Techniques for Dynamic Distributed Resource
Allocation: A Preliminary Study (2003) AAMAS'03 Workshop on Representations and
Approaches for Time Critical Decentralized Resource/Role/Task Allocation,
Melbourne;
Dimopoulos, C., Mort, N.A., A Hierarchical Clustering Methodology Based on Genetic
Programming for the Solution of Simple Cell-formation Problems (2001) International
Erol, R., Sahin, C., Baykasoglu, A., Kaplanoglu, V., A Multi-agent Based Approach
to Dynamic Scheduling of Machines and Automated Guided Vehicles in Manufacturing
Systems (2012) Applied Soft Computing, 12 (6), pp. 1720-1732;
Fournier, D., Simon, G., Mermet, B., A Dynamic Clustering Algorithm for Mobile
Objects (2007) Lecture Notes in Computer Science, 4702, pp. 422-429;
Garro, A., Russo, W., easyABMS: A Domain-expert Oriented Methodology for Agent-
based Modeling and Simulation (2010) Simulation Modelling Practice and Theory, 18,
pp. 1453-1467;
Ghotboddini, M.M., Rabbani, M., Rahimian, H., A Comprehensive Dynamic Cell
Formation Design: Benders' Decomposition Approach (2011) Expert Systems with
Gonc¸alves, J.F., Resende, M.G.C., An Evolutionary Algorithm for Manufacturing Cell
Islier, A.A., Group Technology by an Ant System Algorithm (2005) International
James, T., Brown, E., Keeling, K., A Hybrid Grouping Genetic Algorithm for the Cell
Formation Problem (2007) Computers & Operations Research, 34, pp. 2059-2079;
Kao, Y., Li, Y.L., Ant Colony Recognition Systems for Part Clustering Problems
Karageorgos, A., Mehandjiev, N., Weichhart, G., Hämmerle, A., Agent-based
Optimisation of Logistics and Production Planning (2003) Engineering Applications
of Artificial Intelligence, 16 (4), pp. 335-348;
Keeling, K.B., Brown, E.C., James, T.L., Grouping Efficiency Measures and Their
Impact on Factory Measures for the Machine-part Cell Formation Problem: A
Simulation Study (2007) Engineering Applications of Artificial Intelligence, 20
(1), pp. 63-78;
Khalilian, M., Mustapha, N., Data Stream Clustering: Challenges and Issues (2010)
Proceedings of the International MultiConference of Engineers and Computer
Scientists, Hong Kong, March 17-19;
King, J.R., Machine-component Grouping in Production Flow Analysis: An Approach
Research, 18 (2), pp. 213-232;
King, J.R., Nakornchai, V., Machine-component Group Formation in Group Technology:
Review and Extension (1982) International Journal of Production Research, 20 (2),
pp. 117-133;
Kiselev, I., Alhajj, R., A Self-organizing Multi-agent System for Online
Unsupervised Learning in Complex Dynamic Environments (2008) First International
Workshop On: Optimization in Multi-Agent Systems;
Kumar, K.R., Kusiak, A., Vannelli, A., Grouping of Parts and Components in Flexible
Manufacturing Systems (1986) European Journal of Operational Research, 24, pp. 387-
397;
Kumar, K.R., Vannelli, A., Strategic Subcontracting for Efficient Disaggregated
Manufacturing (1987) International Journal of Production Research, 25 (12), pp.
1715-1728;
Kusiak, A., Cho, M., Similarity Coefficient Algorithm for Solving the Group
Technology Problem (1992) International Journal of Production Research, 30, pp.
2633-2646;
Kusiak, A., Chow, W., Efficient Solving of the Group Technology Problem (1987)
Kusiak, A., Vannelli, A., Kumar, K.R., Clustering Analysis: Model and Algorithms
Lee, S., Kim, G., Kim, S., Self-adaptive and Dynamic Clustering for Online Anomaly
Detection (2011) Expert Systems with Applications, 38, pp. 14891-14898;
Macal, C.M., North, M.J., Agent-based Modeling and Simulation (2009) Proceedings of
the 2009 Winter Simulation Conference, Austin, TX, December 13-16;
MacQueen, J.B., Some Methods for Classification and Analysis of Multivariate
Observations (1967) Proceedings of the Fifth Berkeley Symposium on Mathematical
Statistics and Probability, Berkeley, CA;
Reorganization by a Clustering Technique (1972) Operations Research, 20, pp. 993-
1009;
Megala, N., Rajendran, C., Gopalan, R., An Ant Colony Algorithm for Cell-formation
in Cellular Manufacturing Systems (2008) European Journal of Industrial
Mosier, C.T., Taube, L., The Facets of Group Technology and Their Impacts on
Implementation - A State-of-the-art Survey (1985) Omega, 13 (5), pp. 381-391;
Mosier, C.T., Taube, L., Weighted Similarity Measure Heuristics for the Group
Technology Machine Clustering Problem (1985) Omega, 13 (6), pp. 577-579;
Muruganandam, A., Prabhakaran, G., Murali, R.V., PRABHA - A New Heuristic Approach
for Machine Cell Formation under Dynamic Production Environments (2008) The
International Journal of Applied Management and Technology, 6 (3), pp. 191-221;
Onwubolu, G., Mutingi, M., A Genetic Algorithm Approach to Cellular Manufacturing
Systems (2001) Computers & Industrial Engineering, 39, pp. 125-144;
Psaraftis, H., Dynamic Vehicle Routing: Status and Prospects (1995) Annals of
Rezazadeh, H., Mahini, R., Zarei, M., Solving a Dynamic Virtual Cell Formation
Problem by Linear Programming Embedded Particle Swarm Optimization Algorithm (2011)
Applied Soft Computing, 11, pp. 3160-3169;
Saad, S.M., Baykasoglu, A., Gindy, N.N.Z., A New Integrated System for Loading and
Scheduling in Cellular Manufacturing (2002) International Journal of Computer
Safaei, N., Saidi-Mehrabad, M., Babakhani, M., Designing Cellular Manufacturing
Systems under Dynamic and Uncertain Conditions (2007) Journal of Intelligent
Sandhir, R.P., Kumar, S., Dynamic Fuzzy c-Means (dFCM) Clustering for Continuously
Varying Data Environments (2010) Fuzzy Systems (FUZZ), IEEE International
Conference, Barcelona, July 18-23;
Sarker, B.R., Measures of Grouping Efficiency in Cellular Manufacturing Systems
Saxena, L.K., Jain, P.K., Dynamic Cellular Manufacturing Systems Design - A
Comprehensive Model (2011) The International Journal of Advanced Manufacturing
Seifoddini, H., Single Linkage versus Average Linkage Clustering in Machine Cells
Formation Applications (1989) Computers & Industrial Engineering, 16 (3), pp. 419-
426;
Group Technology (1986) IIE Transactions, 18 (3), pp. 266-270;
Selim, H.M., Askin, R.G., Vakharia, A.S., Cell Formation in Group Technology:
Review, Evaluation and Directions for Future Research (1998) Computers & Industrial
Srinivasan, G., A Clustering Algorithm for Machine Cell Formation in Group
Technology Using Minimum Spanning Trees (1994) International Journal of Production
Research, 32 (9), pp. 2149-2158;
Srinivasan, G., Narendran, T.T., GRAFICS - A Nonhierarchical Clustering Algorithm
for Group Technology (1991) International Journal of Production Research, 29, pp.
463-478;
Srinivasan, G., Narendran, T., Mahadevan, B., An Assignment Model for the Part-
families Problem in Group Technology (1990) International Journal of Production
Research, 28, pp. 145-152;
Stanfel, L., Machine Clustering for Economic Production (1985) Engineering Costs
Suresh Kumar, C., Chandrasekharan, M.P., Grouping Efficacy: A Quantitative
Criterion for Goodness of Block Diagonal Forms of Binary Matrices in Group
Technology (1990) International Journal of Production Research, 28 (2), pp. 233-
243;
Turker, U., (1993) Static and Dynamic Considerations of Part Family and Machine
Cell Formations, , Master diss., University of Ottawa;
Waghodekar, P.H., Sahu, S., Machine-component Cell Formation in Group Technology:
Wang, J., Roze, C., Formation of Machine Cells and Part Families: A Modified p-
Median Model and Comparative Study (1997) International Journal of Production
Research, 35 (5), pp. 1259-1286;
Wellman, M.P., A Market-oriented Programming Environment and Its Application to
Distributed Multicommodity Flow Problems (1993) Journal of Artificial Intelligence
Wu, T., Chang, C., Chung, S., A Simulated Annealing Algorithm for Manufacturing
Cell Formation Problems (2008) Expert Systems with Applications, 34, pp. 1609-1617;
Xiangyong, L., Baki, M.F., Aneja, Y.P., An Ant Colony Optimization Metaheuristic
for Machine-part Cell Formation Problems (2010) Computers and Operation Research,
37, pp. 2071-2081;
Yin, Y., Yasuda, K., Similarity Coefficient Methods Applied to the Cell Formation
Problem: A Taxonomy and Review (2006) International Journal of Production
Economics, 101, pp. 329-352;
Younes, A., (2006) Adapting Evolutionary Approaches for Optimization in Dynamic
Environments, , PhD diss., University of Waterloo
CORRESPONDENCE ADDRESS: Baykasoglua, A.; Department of Industrial Engineering,
Dokuz Eylül UniversityTurkey
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Raminfar, R., Zulkifli, N., Vasili, M., Sai Hong, T.

55384122700;36134030300;24588202500;55097920600;
An integrated model for production planning and cell formation in cellular
(2013) Journal of Applied Mathematics, 2013, art. no. 487694, . Cited 6 times.
84876584427&doi=10.1155%2f2013%2f487694&partnerID=40&md5=60d0d37ce8071f34af169198cc
c7cc3f
DOI: 10.1155/2013/487694
AFFILIATIONS: Department of Mechanical and Manufacturing Engineering, Faculty of
Engineering, Universiti Putra Malaysia, 43400 Selangor, Selangor Darul Ehsan,
Malaysia;
Department of Industrial Engineering, Islamic Azad University, Lenjan Branch, Iran
ABSTRACT: Cellular manufacturing (CM) is a production approach directed towards
reducing costs, as well as increasing system's flexibility in today's small-to-
medium lot production environment. Many structural and operational issues should be
considered for a successful CM design and implementation such as cell formation
(CF), production planning, and facility layout. Most researchers have addressed
these issues sequentially or independently, instead of jointly optimizing a
combination of these issues. In order to attain better results to ensure that the
system will be capable of remaining efficient in unknown future situations, these
issues should be addressed simultaneously. In this paper, a mathematical model is
developed using an integrated approach for production planning and cell formation
problems in a CM. A set of numerical examples are provided from existing the
literature in order to test and illustrate the proposed model. In order to evaluate
and verify the performance of the proposed model, it is compared with a well-known
cell formation methods (rank order clustering and direct clustering analysis),
using group capability index (GCI) measure. The results and comparisons indicate
that the proposed model has a significantly higher and satisfactory performance and
it is reliable for the design and the analysis of CM systems. © 2013 Reza Raminfar
et al.
REFERENCES: Singh, N., Design of cellular manufacturing systems: An invited review
Wemmerlöv, U., Hyer, N.L., Cellular manufacturing in the U.S. Industry: A survey of
Kalpakjian, S., Schmid, S.R., (2010) Manufaturing Enginnering and Technology, , 6th
Prentice Hall;
pp. 2545-2563;
135-149., DOI 10.1007/s00170-006-0710-4;
Askin, R.G., A Hamiltonian path approach to reordering the part-machine matrix for
pp. 1081-1100;
pp. 293-318;
Zolfaghari, S., Design and plannng for cellular manufacturing: Application of
neural networks and advanced search techniques (1997) Mechanical Engineering, ,
Ottawa, Canada Universty of Ottawa;
Blacksburg, Va, USA Virginia Polytechnic Institute and State University;
S0096300305000238;
genetic algorithms (2004) International Journal of Manufacturing Technology and
Management, 15 (6), pp. 433-444;
pp. 109-128;
Wicks, E.M., (1995) Designing Cellular Manufacturing Systems with Time Varying
Product Mix and Resource Availability, , Blacksburg, Va, USA Virginia Polytechnic
Institute and State University;
(1), pp. 47-64;
Sotskov, Yu.N., Lai, T.-C., Minimizing total weighted flow time under uncertainty
using dominance and a stability box (2012) Computers & Operations Research, 39 (6),
pp. 1271-1289., 10.1016/j.cor.2011.02.001 2844293;
Matsveichuk, N.M., Sotskov, Yu.N., Egorova, N.G., Lai, T.-C., Schedule execution
for two-machine flow-shop with interval processing times (2009) Mathematical and
Computer Modelling, 49 (5-6), pp. 991-1011., 10.1016/j.mcm.2008.02.004 2495015
ZBL1165.90464;
Arvindh, B., Irani, S.A., Cell formation the need for an integrated solution of the
subproblems (1994) International Journal of Production Research, 32 (5), pp. 1197-
1218;
systems (2001) Integrated Manufacturing Systems, 12 (4), pp. 275-284., DOI
10.1108/09576060110392588;
Ah Kioon, S., Bulgak, A.A., Bektas, T., Integrated cellular manufacturing systems
Journal of Operational Research, 192 (2), pp. 414-428., 10.1016/j.ejor.2007.09.023
2454782 ZBL1157.90391;
1014-1025., 10.1016/j.camwa.2010.03.044 2672900 ZBL1201.90120;
Systems Inc, L., (2010) LINGO User's Guide, , Chicago, Ill, USA LINDO System;
Hsu, C.P., (1990) The Similarity Coefficient Approaches of Machine-Component Cell
Formation in Cellular Manufacturing: A Comparative Study, in Department of
Industrial and Systems Engineering, , Milwaukee, Wis, USA of Wisconsin-Milwaukee;
Manufacturing, , Prentice Hall Press;
Wemmerlov, U., Hyer, N., Comments on direct clustering algorithm for group
formation in cellular manufacture (1984) Journal of Manufacturing Systems, 3 (1)
CORRESPONDENCE ADDRESS: Raminfar, R.; Department of Mechanical and Manufacturing
Engineering, Faculty of Engineering, Universiti Putra Malaysia, 43400 Selangor,
Selangor Darul Ehsan, Malaysia; email: [email protected]
ISSN: 1110757X
ABBREVIATED SOURCE TITLE: J. Appl. Math.
SOURCE: Scopus
Chang, C.-C., Wu, T.-H., Wu, C.-W.

57142825500;7404814990;8700923900;
An efficient approach to determine cell formation, cell layout and intracellular
machine sequence in cellular manufacturing systems
84885188988&doi=10.1016%2fj.cie.2013.07.009&partnerID=40&md5=fe7a81e2c21be1583e553b
f671c1d1d7
DOI: 10.1016/j.cie.2013.07.009
AFFILIATIONS: Department of Information Management, Jen-Teh Junior College of
Medicine, Nursing and Management, 79-9, Shijou Li, Houlong, Miaoli 356, Taiwan;
Department of Business Administration, National Taipei University, 151, University
Road, San Shia, Taipei 237, Taiwan;
Department of Industrial Engineering and Engineering Management, National Tsing Hua
University, 101, Sec. 2, Kuang-Fu Road, Hsinchu 300, Taiwan
ABSTRACT: Cellular manufacturing systems (CMS) are used to improve production
flexibility and efficiency. They involve the identification of part families and
machine cells so that intercellular movement is minimized and the utilization of
the machines within a cell is maximized. Previous research has focused mainly on
cell formation problems and their variants; however, only few articles have focused
on more practical and complicated problems that simultaneously consider the three
critical issues in the CMS-design process, i.e., cell formation, cell layout, and
intracellular machine sequence. In this study, a two-stage mathematical programming
model is formulated to integrate the three critical issues with the consideration
of alternative process routings, operation sequences, and production volume. Next,
because of the combinatorial nature of the above model, an efficient tabu search
algorithm based on a generalized similarity coefficient is proposed. Computational
results from test problems show that our proposed model and solution approach are
both effective and efficient. When compared to the mathematical programming
approach, which takes more than 112 h (LINGO) and 1139 s (CPLEX) to solve a set of
ten test instances, the proposed algorithm can produce optimal solutions for the
same set of test instances in less than 12 s. © 2013 Elsevier Ltd.
AUTHOR KEYWORDS: Cell formation; Cell layout; Machine sequencing; Tabu search
INDEX KEYWORDS: Cells; Cytology; Manufacture; Mathematical programming; Tabu
search, Alternative process routings; Cell formation; Cell layout; Intercellular
movement; Machine sequencing; Mathematical programming models; Similarity
coefficients; Tabu search algorithms, Cellular manufacturing
REFERENCES: Ahi, A., Aryanezhad, M.B., Ashtiani, B., Makui, A., A novel approach to
problem based on TOPSIS method (2009) Computers and Operations Research, 36 (5),
pp. 1478-1496;
problem (1997) Computers and Industrial Engineering, 32, pp. 169-185;
Aneke, N.A.G., Carrie, A.S., A design technique for the layout of multiproduct
flowlines (1986) International Journal of Production Research, 24, pp. 471-481;
Technology, 32 (6), pp. 531-536;
a cellular manufacturing environment-A case study (2000) International Journal of
(8), pp. 2219-2245;
Chan, F.T.S., Lau, K.W., Chan, L.Y., Choy, K.L., Two-stage approach for machine-
Gupta, Y.P., Gupta, M.C., Kumar, A., Sundaram, C., A genetic algorithmbased
Heragu, S.S., Kusiak, A., Machine layout problem in flexible manufacturing systems
10 (2), pp. 93-107;
Prentice Hall;
10 (2), pp. 93-108;
Lei, D., Wu, Z., Tabu search-based approach to multi-objective machinepart cell
manufacturing cell design (1999) Computers & Industrial Engineering, 36, pp. 379-
389;
Nagi, R., Harhalakis, G., Proth, J.-M., Multiple routeing and capacity
707-720;
pp. 2185-2207;
(1), pp. 84-97;
pp. 1609-1617;
Research, 44, pp. 1217-1241;
181, pp. 156-167;
(2004) International Journal of Advanced Manufacturing Technology, 23, pp. 916-924
Taipei University, 151, University Road, San Shia, Taipei 237, Taiwan; email:
[email protected]
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Soolaki, M.
54416473500;
A multi-objective integrated cellular manufacturing systems design with production
planning, worker assignment and dynamic system reconfiguration
(2012) International Journal of Industrial and Systems Engineering, 12 (3), pp.
84867385108&doi=10.1504%2fIJISE.2012.049412&partnerID=40&md5=e21b8a8549e37cb1b71331
5b29f697bc
DOI: 10.1504/IJISE.2012.049412
Science and Technology, Tabarsi Street, Babol 47166-95635, Iran
ABSTRACT: This paper offers a new mathematical model for the design of cell
formation in dynamic cellular manufacturing system (DCMS) based on production
planning (PP) and worker assignment. Here, workers will assign on machines by their
skills. In dynamic environment, the best-designed cells for one period may not be
efficient for subsequent periods and reconfiguration of cells is required.
Reconfiguration may involve adding, removing or relocating machines; it may also
involve a change in processing rout of part types from a period to another. Here,
the aim of the model is to develop a multi-objective DCMS model that integrates
multi-period PP, dynamic system reconfiguration and available time of workers,
worker assignment and several other attributes. Consequently, a multi-objective
dynamic cell formation problem is presented, where the total cells load variation
(the second objective function) and sum of the miscellaneous costs (the first
objective function) are to be minimised simultaneously. For solving this type of
problems, it is reasonable to investigate a set of solutions, so I use fast and
elitist multi-objective genetic algorithm for solving the mathematical model to
find Pareto-optimal solutions and numerical results show effectiveness of the
proposed model. © 2012 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Dynamic system reconfiguration; Integrated cellular manufacturing
systems design; Mathematical model; Multi-objective DCMS model; Multi-objective
genetic algorithm; PP; Production planning; Worker assignment
INDEX KEYWORDS: Multi objective; Multi-objective genetic algorithm; Production
Planning; System reconfiguration; Worker assignment, Mathematical models; Planning;
Polypropylenes; Production control; Production engineering; Systems analysis,
REFERENCES: Aryanezhad, M.B., Deljoo, V., Mirzapour Al-E-Hashem, S.M.J., Dynamic
cell formation and the worker assignment problem: A new model (2008) Int. J.
Azadeh, A., Keramati, A., Karimi, A., Moghaddam, M., A multi-objective genetic
algorithm for scheduling optimisation of m job families on a single machine (2010)
Int. J. Industrial and Systems Engineering, 6 (4), pp. 417-440;
Bajestani, M.A., Rabbani, M., Rahimi-Vahed, A.R., Khoshkhou, G.B., A multiobjective
scatter search for a dynamic cell formation problem (2010) Journal of Computers and
pp. 516-530;
Coello, C.A.C., A comprehensive survey of evolutionary-based multi-objective
optimization techniques (1999) Int. J. Knowledge and Information System, 1 (3), pp.
269-308;
genetic algorithm: NSGAII (2002) IEEE Transactions on Evolutionary Computation, 6
(2), pp. 182-197;
genetic algorithm to solve dynamic cell formation problem (2010) Journal of Applied
stochastic cellular manufacturing problem: A queuing-based analysis (2011) Journal
of Expert Systems with Applications, 38 (3), pp. 1326-1335;
formation design: Benders' decomposition approach (2011) Journal of Expert Systems
to cell composition and layout design problems (1996) Int. J. Production Research,
34 (2), pp. 447-482;
Krishnan, K.K., Cheraghi, S.H., Nayak, C.N., Facility layout design for multiple
production scenarios in a dynamic environment (2008) Int. J. Industrial and Systems
(2006) Linear, Integer, Nonlinear and Global Optimization Package, Release 9.0, ,
http://www.lindo.com, LINGO, Chicago, USA: Lingo System Inc;
Mahdavi, I., Aalaei, A., Mahdi Paydar, M., Solimanpur, M., Designing a mathematical
pp. 1014-1025;
(2007) Journal of Applied Mathematics and Computation, 190 (1), pp. 662-670;
(2003) Production Planning Control, 14 (5), pp. 437-446;
Rezazadeh, H., Ghazanfari, M., Saidi-Mehrabad, M., Sadjadi, S.J., An extended
discrete particle swarm optimization algorithm for the dynamic facility layout
problem (2009) Journal of Zhejiang University Science, 10 (4), pp. 520-529;
Rezazadeh, H., Mahini, R., Zarei, M., Solving adynamic virtual cell formation
Journal of Applied Soft Computing, 11 (3), pp. 3160-3169;
Engineering, 187 (1-4), pp. 221-225;
Saad, S.M., Lassila, A.M., Methodology for dynamic scheduling and control in
biological manufacturing systems (2010) Int. J. Industrial and Systems Engineering,
5 (3), pp. 268-286;
approach (2007) Int. J. Advanced Manufacturing Technology, 33 (9-10), pp. 1001-
1009;
Shang, J.S., Tadikamalla, P.R., Multi-criteria design and control of a cellular
manufacturing system through simulation and optimization (1998) Int. J. Production
Research, 36 (6), pp. 1515-1528;
Sofianopoulou, S., Formation of manufacturing cells in group technology using a
genetic algorithm approach (2010) Int. J. Industrial and Systems Engineering, 5
(2), pp. 212-225;
Solimanpur, M., Mahdavi, I., Aalaei, A., Paydar, M., Multi-objective cell formation
and production planning in dynamic virtual cellular manufacturing systems (2009)
International Conference on Business and Information, p. 68., BAI 2009,
Kualalumpur, Malaysia, July;
Srinivas, N., Deb, K., Multi-objective optimization using nondominated sorting in
genetic algorithms (1994) IEEE Transactions on Evolutionary Computation, 2 (3), pp.
221-248;
Suër, G.A., Arikan, F., Babayig, C., Effects of different fuzzy operators on fuzzy
bi-objective cell loading problem in labor-intensive manufacturing cells (2009)
Tavakkoli-Moghaddam, R., Safaei, N., Sassani, A., A new solution for a dynamic cell
annealing (2008) Journal of Operational Research Society, 59 (4), pp. 443-454;
Wang, Q., Pan, L., Mileham, A.R., Owen, G.W., Newnes, L.B., Chatwin, C.R.,
Modelling randomness of a manual assembly system with walking workers (2007) Int.
J. Industrial and Systems Engineering, 2 (2), pp. 195-210;
Wirojanagud, P., Gel, E.S., Fowler, J.W., Cardy, R.L., Modeling inherent worker
difference for workforce planning (2007) Int. J. Production Research, 45 (3), pp.
525-553;
cell formation problem (2005) Int. J. Production Research, 43 (4), pp. 829-853;
multiple routs and multiple objectives (2000) Int. J. Production Research, 38 (2),
pp. 385-395
CORRESPONDENCE ADDRESS: Soolaki, M.; Department of Industrial Engineering,
Mazandaran University of Science and Technology, Tabarsi Street, Babol 47166-95635,
Iran; email: [email protected]
ISSN: 17485037
SOURCE: Scopus
Paydar, M.M., Mahdavi, I., Khonakdari, S.V., Solimanpur, M.

23025569300;16417373200;36782298300;35615315700;
Developing a mathematical model for cell formation in cellular manufacturing
systems
times.
80051517379&doi=10.1504%2fIJOR.2011.041800&partnerID=40&md5=65f0b432d97028a50f835d2
081b86241
DOI: 10.1504/IJOR.2011.041800
Science and Technology, Babol 47166-85635, Iran;
Department of Mathematical Sciences, Mazandaran University, Babolsar 47416-1467,
Iran;
Faculty of Engineering, Urmia University, Urmia, West Azerbaijan Province 57561-
15311, Iran
ABSTRACT: Cellular manufacturing is an application of group technology (GT)
concepts. The aim of a cellular manufacturing system (CMS) is to identify similar
manufacturing processes and features where machines are grouped into machine cells
based on their contributions to the production process. It has been realised that
CMSs benefit from the advantages of both product-based manufacturing systems and
job shop manufacturing systems. The cell formation problem (CFP) is one of the key
issues in the design of CMS which deals with the identification of machine cells
and part families. Many authors adopt either a sequential or a simultaneous
procedure to group the parts and machines. The sequential procedure used in some of
these studies determines the part families first, followed by machine assignments.
On the other hand, the simultaneous procedure determines the part families and
machine groups concurrently. This paper proposes a mathematical model to identify
machine cells and part families simultaneously, so that the number of voids and
exceptional elements are minimised. To evaluate performance of the proposed model,
a number of test problems adopted from the literature are solved and the solutions
are compared with those of previous well-known methods using the grouping efficacy
measure. Copyright © 2011 Inderscience Enterprises Ltd.
AUTHOR KEYWORDS: Cell formation; Exceptional elements; Grouping efficacy; Voids
REFERENCES: Adil, G.K., Ragamani, D., Strong, D., A mathematical model for cell
pp. 3-21., DOI 10.1016/j.cie.2004.06.008, PII S0360835204001330;
(1991) Int. J. Production Research, 29 (2), pp. 343-356;
algorithm for cellular manufacturing (1986) Int. J. Production Research, 24, pp.
451-464;
clustering for group technology (1986) Int. J. Production Research, 24 (5), pp.
1221-1264;
cellular manufacturing (1995) Int. J. Production Research, 33 (2), pp. 293-318;
Research, 36 (5), pp. 1325-1337;
Chu Chao-Hsien, Tsai Mayshing, Comparison of three array-based clustering
techniques for manufacturing cell formation (1990) International Journal of
Hyer, N., The potential of group technology for US manufacturing (1984) Journal of
Hyer, N., Wemmerlov, U., Group technology and productivity (1984) Harvard Business
Review, 62 (4), pp. 140-149., July-August;
(1), pp. 63-78., DOI 10.1016/j.engappai.2006.04.001, PII S0952197606000765;
J. Production Research, 28, pp. 233-243;
Research, 25 (4), pp. 561-569;
Society, 50, pp. 509-516;
10.1016/j.amc.2007.01.060, PII S0096300307001014;
51, pp. 53-57;
Mukattash, A.M., Abbasi, G.Y., Tahboub, K.K., Adil, M.B., A modified revised P-
median approach to cell formation (2007) International Journal of Industrial and
Systems Engineering, 2 (1), pp. 51-60., DOI 10.1504/IJISE.2007.011435;
10.1016/S0360-8352(00)00074-7;
Purcheck, F.G.K., A linear programming method for the combinatorial grouping of an
Advanced Manufacturing Technology, 18 (8), pp. 591-597., DOI 10.1007/s001700170036;
Ronald, B.H., Forming minimum-cost machine cells with exceptional parts using zero-
one integer programming (1997) Journal of Manufacturing Systems, 16 (2), pp. 79-90;

survey and critical review (1999) Int. J. Production Research, 37, pp. 285-314;
Seifoddini Hamid, K., Single linkage versus average linkage clustering in machine
cells formation applications (1989) Computers and Industrial Engineering, 16 (3),
pp. 419-426., DOI 10.1016/0360-8352(89)90160-5;
improper machine assignment in group technology applications (1989) Int. J.
Research, 34 (12), pp. 3401-3416;
Srinivasan, G., Narendran, T.T., GRAFICS - A non hierarchical clustering algorithm
for group technology (1991) Int. J. Production Research, 29, pp. 463-478;
1615;
(2004) Int. J. Advanced Manufacturing Technology, 23, pp. 916-924;
pp. 1609-1617;
Research, 35 (10), pp. 2773-2792
CORRESPONDENCE ADDRESS: Paydar, M.M.; Department of Industrial Engineering,
Mazandaran University of Science and Technology, Babol 47166-85635, Iran; email:
[email protected]
ISSN: 17457645
SOURCE: Scopus

56619196000;36136249100;
Incremental cell formation considering alternative machines
33 times.
0037144860&doi=10.1080%2f00207540210146189&partnerID=40&md5=643e0a57fc8407cd07395f0
b0d147bf0
DOI: 10.1080/00207540210146189
AFFILIATIONS: Department of Mechanical Engineering, N.B.K.R. Institute of Science
and Technology, Vidyanagar-524413, India;
Industrial Engineering and Management Division, Department of Humanities and Social
Science, Indian Institute of Technology Madras, Chennai - 600036, India
ABSTRACT: Many algorithms for cell formation have been developed for past three
decades in cellular manufacturing. Some use binary data for cell formation and
others use production data such as operation sequence, processing times, production
volumes, etc. for cell formation. All these algorithms assume that the conversion
of job shop to cellular manufacturing is performed comprehensively. (In other
words, they assume that all the cells are formed at a time.) However, this is far
from reality. In practice, cell formation is done incrementally, one after the
other, rather than comprehensively. None of the algorithms developed so far
addresses the issue of incremental cell formation. In this paper, the incremental
cell formation problem is defined and various categories of problems are mentioned.
One type of those categories is selected for solving. Two methods, namely the
branch and bound technique and a heuristic based on a multistage programming
approach, have been applied to solve the chosen problem. Data sets have been
generated to compare these two methods in terms of quality of solution and demand
on computational time. It has been found that the branch and bound technique gives
a superior quality solution, but is computationally more demanding, where as
heuristic based on a multistage programming approach is computationally far
superior.
INDEX KEYWORDS: Algorithms; Computational methods; Group technology; Heuristic
programming; Multiprogramming; Problem solving, Cell formation; Multistage
programming, Cellular manufacturing
alternate routeings (1996) International Journal of Production Research, 34, pp.
1361-1380;
Research, 24, pp. 1221-1233;
Groover, M.P., Zimmers, E.W., Jr., (1994) CAD/CAM: Computer-Aided Design and
Manufacturing, , (New Delhi: Prentice-Hall);
946;
pp. 1353-1367;
Kaparthi, S., Suresh, N.C., An improved neural network leader algorithm for part
machine grouping in group technology (1993) European Journal of Operational
Research, 69, pp. 342-356;
King, J.R., Narkornchai, V., Machine component group formation in group technology-
117-133;
397;
Research, 37, pp. 3119-3138;
51, pp. 53-57;
Mukhopadyay, S.K., Ramesh Babu, K., Vijai Sai, K.V., Modified Hamiltonian chain: A
graph theoretic approach to group technology (2000) International Journal of
Research, 37, pp. 539-556;
Offodile, F.O., Mehrez, A., Greznar, J., Cellular manufacturing: A taxonomic review
Rajagopalan, R., Batra, J.L., Design of cellular production system: A graph-
567-579;
Sofianopolou, S., Manufacturing cells design with alternative process plans and/or
707-720;
Sprecher, A., A competitive branch-and-bound algorithm for the simple assembly line
balancing problem (1999) International Journal of Production Research, 37, pp.
1787-1816;
Research, 32, pp. 2149-2158;
463-478;
Research, 28, pp. 145-152;
2185-2207;
Thomopoulos, N.T., Mixed model line balancing with smoothed station assignments
(1970) Management Science, 16, pp. 593-603;
Venugopal, V., Soft-computing based approaches to the group technology problem: A
pp. 3335-3357;
models (1994) International Journal of Production Research, 32, pp. 2105-2116;
ISSN: 00207543
SOURCE: Scopus
Malakooti, B., Yang, Z.

7004104039;7405434815;
Multiple criteria approach and generation of efficient alternatives for machine-
part family formation in group technology
Cited 24 times.
%3a1015557007084&partnerID=40&md5=df6e3c75018bc164abaeda0c82102a17
DOI: 10.1023/A:1015557007084
AFFILIATIONS: Electrical Engineering Department, Case Western Reserve University,
Cleveland, OH 44106, United States
ABSTRACT: Multiple Criteria Decision-Making (MCDM) seeks to find one or several
satisfactory alternatives among a set of possible alternatives. In this paper, for
the first time, we develop a multiple criteria decision-making approach for solving
the machine-part cell formation problem when there are conflicting objectives. The
objectives are to: maximize the machine utilization rate (to have a higher
productivity rate), minimize the number of duplicated machines (to have a lower
cost and space requirement), and minimize the number of exceptional elements (to
have a lower inter-flow traffic among cells). Our approach can be modified to
consider other objectives as desired. To find the most preferred alternative to
this problem, we develop an approach for generating all efficient (non-dominated)
alternatives and then select the most preferred alternative from this set. Our
approach consists of three steps: (i) generating a seed alternative for each given
number of cells; (ii) generating all non-dominated alternatives for each given seed
alternative; and (iii) evaluating all generated non-dominated alternatives to find
the most preferred alternative. The relationships among alternatives and objectives
are discussed. An example is solved to demonstrate the details of the proposed
approach. Some experimental results solving several problem selected from the
literature are also presented.
INDEX KEYWORDS: Algorithms; Decision making; Decision support systems; Flexible
manufacturing systems; Matrix algebra; Neural networks; Problem solving;
Productivity, Multiple criteria decision making; Productivity rate, Cellular
manufacturing
REFERENCES: Askin, R.G., A Hamiltonian path approach to recording the part-machine
matrix for cellular manufacturing (1991) International Journal of Production
Research, 29, pp. 1081-1100;
Bedworth, D.D., (1991) Computer Integrated Design and Manufacturing, , McGraw-Hill,
New York;
152;
cellular manufacture (1982) Journal of Manufacturing Systems, pp. 65-75;
Research, 24, pp. 1221-1233;
International Journal of Production of Research, 26, pp. 1161-1172;
Dahel, N., Smith, S., Designing flexibility into cellular manufacturing systems
Davey, A., Olson, D., Multiple criteria decision making models in group decision
support (1998) Group Decision and Negotiation, 7, pp. 55-75;
ElMaraghy, H.A., Knowledge-based system for assignment of parts to machines (1988)
International Journal of Advanced Manufacturing Technology, 3;
Karacapilidis, N., Pappis, C., Computer-supported collaborative argumentation and
fuzzy similarity measures in multiple criteria decision making (2000) Computers and
Keeney, R.L., Raiffa, H., (1976) Decisions with Multiple Objectives: Preferences
and Value Tradeoffs, , John Wiley, New York;
pp. 193-199;
Research, 18, pp. 213-232;
117-133;
Kusiak, A., The generalized group technology concepts (1987) International Journal
Kusiak, A., Similarity coefficient algorithms for solving the group technology
Li, J., Fuzzy cluster analysis and fuzzy pattern recognition method for formation
of part families (1988) Proceeding of the 16th North American Manufacturing
Research Conference, pp. 558-563;
Research, 28, pp. 913-925;
Malakooti, B., A decision support system and a heuristic interactive approach for
solving discrete multiple criteria problems (1988) IEEE Transactions on Systems,
Man, and Cybernetics, 18 (2), pp. 273-285;
Malakooti, B., An exact interactive paired comparison method for exploring the
efficient facets of MOLP problems with underlying quasi-concave utility functions
(1988) IEEE Transactions on Systems, Man, and Cybernetics, 18 (5), pp. 787-801;
Malakooti, B., Identifying nondominated alternatives with partial information for
discrete and multiple objective linear programming problems (1989) IEEE
Transactions on Systems, Man, and Cybernetics, 19, pp. 95-107;
Malakooti, B., Ranking and screening multiple criteria alternatives with partial
information and use of ordinal and cardinal strength of preferences (2000) IEEE
Transactions on Systems, Man, and Cybernetics Part A, 30 (3), pp. 355-369;
Malakooti, B., Al-awani, J.E., Quasi-convex utility functions for solving
interactive multi-objective linear programming (2001) Computers & Operations
Research, , (Accepted for publication);
Malakooti, B., Raman, V., An interactive artificial neural network approach for
machine set-up optimization (2000) Journal of Intelligent Manufacturing, 11, pp.
41-51;
Malakooti, B., Raman, V., Clustering and selection of multiple criteria
alternatives using unsupervised and supervised neural networks (2000) Journal of
Malakooti, B., Subramanian, S., Generalized polynomial decomposable multiple
attribute utility functions for ranking and rating of alternatives (1999) Applied
Malakooti, B., Yang, Z., A variable-parameter unsupervised learning neural network
clustering systems for group formation (1995) International Journal of Production
Research, 33 (9), pp. 2395-2413;
Malakooti, B., Zhou, Y., Adaptive feed-forward artificial neural network with
application to multiple criteria decision making (1994) Management Science, 40
(11), pp. 1542-1561;
Malakooti, B., Zhou, Y., Approximating polynomial functions by feedforward
artificial neural networks: Capacity, analysis, and design (1998) Applied
Pierreval, H., Plaquin, M., An evolutionary approach of multicriteria manufacturing
cell formation (1998) International Transactions in Operational Research, 5, pp.
13-25;
Rajamani, D., A model for cell formation in manufacturing systems with sequence
dependence (1992) International Journal of Production Research, 30, pp. 1227-1235;
Singh, N., Qi, Fuzzy multi-objective routing problem with application to process
planning in manufacturing systems (1991) International Journal of Production
Research, 29, pp. 1161-1170;
Steuer, R., (1986) Multiple Criteria Optimization: Theory, Computation, and
Application, , Wiley, New York;
Srinivasan, G., An assignment model for the part families problem in group
Xu, H., Wang, H.P., Part family formation for GT application based on fuzzy
mathematics (1989) International Journal of Production Research, 27, pp. 1637-1651
CORRESPONDENCE ADDRESS: Malakooti, B.; Electrical Engineering Department, Case
Western Reserve University, Cleveland, OH 44106, United States; email:
[email protected]
ISSN: 0740817X
CODEN: IIETD
SOURCE: Scopus
Malakooti, B., Yang, Z.

7004104039;7405434815;
Multiple criteria approach and generation of efficient alternatives for machine-
part family formation in group technology
85023908168&doi=10.1080%2f07408170208928916&partnerID=40&md5=aa4a400b0e8af71512b7ff
ffa308776a
DOI: 10.1080/07408170208928916
AFFILIATIONS: Electrical Engineering and Computer Science Department, Case Western
Reserve University, Cleveland, OH, 44106, United States
ABSTRACT: Multiple Criteria Decision-Making (MCDM) seeks to find one or several
satisfactory alternatives among a set of possible alternatives. In this paper, for
the first time, we develop a multiple criteria decision-making approach for solving
the machine-part cell formation problem when there are conflicting objectives. The
objectives are to: maximize the machine utilization rate (to have a higher
productivity rate), minimize the number of duplicated machines (to have a lower
cost and space requirement), and minimize the number of exceptional elements (to
have a lower inter-flow traffic among cells). Our approach can be modified to
consider other objectives as desired. To find the most preferred alternative to
this problem, we develop an approach for generating all efficient (non-dominated)
alternatives and then select the most preferred alternative from this set. Our
approach consists of three steps: (i) generating a seed alternative for each given
number of cells; (ii) generating all non-dominated alternatives for each given seed
alternative; and (iii) evaluating all generated non-dominated alternatives to find
the most preferred alternative. The relationships among alternatives and objectives
are discussed. An example is solved to demonstrate the details of the proposed
approach. Some experimental results solving several problems selected from the
literature are also presented. © 2002, IIE.
REFERENCES: A Hamiltonian path approach to recording the part-machine matrix for
1081-1100;
(1991) Computer Integrated Design and Manufacturing, , McGraw-Hill, New York;
152;
cellular manufacture (1982) Journal of Manufacturing Systems, pp. 65-75;
Research, 24, pp. 1221-1233;
Dahel, N., Smith, S., Designing flexibility into cellular manufacturing systems
Davey, A., Olson, D., Multiple criteria decision making models in group decision
support (1998) Group Decision and Negotiation, 7, pp. 55-75;
Knowledge-based system for assignment of parts to machines (1988) International
Journal of Advanced Manufacturing Technology, 3;
Karacapilidis, N., Pappis, C., Computer-supported collaborative argumentation and
fuzzy similarity measures in multiple criteria decision making (2000) Computers and
operations research, 27, pp. 653-671;
Keeney, R.L., Raiffa, H., (1976) Decisions with Multiple Objectives: Preferences
and Value tradeoffs, , John Wiley, New York;
pp. 193-199;
Research., 18, pp. 213-232;
117-133;
Kusiak, A., The generalized group technology concepts (1987) International Journal
Similarity coefficient algorithms for solving the group technology problem (1992)
Fuzzy cluster analysis and fuzzy pattern recognition method for formation of part
families (1988) Proceeding of the 16th North American Manufacturing Research
Research, 28, pp. 913-925;
Malakooti, B., A decision support system and a heuristic interactive approach for
solving discrete multiple criteria problems (1988) IEEE Transactions on Systems,
Mall, and Cybernetics, 18 (2), pp. 273-285;
Malakooti, B., An exact interactive paired comparison method for exploring the
efficient facets of MOLP problems with underlying quasi-concave utility functions
(1988) IEEE Transactions all Systems, Man, and Cybernetics, 18 (5), pp. 787-801;
Malakooti, B., Identifying nondominated alternatives with partial information for
discrete and multiple objective linear programming problems (1989) IEEE
Transactions on Systems, Man, and Cybernetics, 19, pp. 95-107;
Malakooti, B., Ranking and screening multiple criteria alternatives with partial
information and use of ordinal and cardinal strength of preferences (2000) IEEE
Transactions all Systems. Mall. and Cybernetics Part A, 30 (3), pp. 355-369;
Malakooti, B., Al-Awani, J.E., Quasi-convex utility functions for solving
interactive multi-objective linear programming (2001) Computers & Operations
Research, , (Accepted for publication);
Malakooti, B., Raman, V., An interactive artificial neural network approach for
machine set-up optimization (2000) Journal of Intelligent Manufacturing;, 11, pp.
41-51;
Malakooti, B., Raman, V., Clustering and selection of multiple criteria
alternatives using unsupervised and supervised neural networks (2000) Journal of
Intelligent Manufacturing;, 11, pp. 435-453;
Malakooti, B., Subramanian, S., Generalized polynomial decomposable multiple
attribute utility functions for ranking and rating of alternatives (1999) Applied
Malakooti, B., Yang, Z., A variable-parameter unsupervised learning neural network
clustering systems for group formation (1995) International Journal of Production
Research, 33 (9), pp. 2395-2413;
Malakooti, B., Zhou, Y., Adaptive feed-forward artificial neural network with
application to multiple criteria decision making (1994) Management Science, 40
(11), pp. 1542-1561;
Malakooti, B., Zhou, Y., Approximating polynomial functions by fccdforward
artificial neural networks:capacity, analysis, and design (1998) Applied
Pierreval, H., Plaquin, M., An evolutionary approach of multicriteria manufacturing
cell formation (1998) International Transactions in Operational Research, 5, pp.
13-25;
A model for cell formation in manufacturing systems with sequence dependence (1992)
Singh, N., Qi, Fuzzy multi-objective routing problem with application to process
planning in manufacturing systems (1991) International Journal of Production
Research, 29, pp. 1161-1170;
Steuer, R., (1986) Multiple Criteria Optimization: Theory, Computation, and
Application, , Wiley, New York;
Srinivasan, G., An assignment model for the part families problem in group
technology (1990) International Journal oj Production Research, 28, pp. 145-152.,
et al;
Xu, H., Wang, H.P., Part family formation for GT application based on fuzzy
mathematics (1989) International Journal oj Production Research, 27, pp. 1637-1651
CORRESPONDENCE ADDRESS: Malakooti, B.; Electrical Engineering and Computer Science
Department, Case Western Reserve University, Cleveland, OH, 44106, United States;
ISSN: 0740817X
SOURCE: Scopus
Deutsch, S.J., Freeman, S.F., Helander, M.

7202316204;57197941585;7006115011;
Manufacturing cell formation using an improved p-median model
0031640701&partnerID=40&md5=a2bfb0a5a3ede030265310027419fdbb
AFFILIATIONS: Dept. of Mech., Indust./Mfg. Eng., Northeastern University, Boston,

MA 02115, United States
ABSTRACT: The p-median model objective function is modified for the cell formation
problem to minimize the variability between parts in a group by considering part
similarity to all other parts in the group instead of similarity to an arbitrary
median. The heuristic vertex substitution method for solution of the part grouping
problem is adapted for this objective function and then modified to provide
improved starting points. The theoretical lower bound for the heuristic is
developed and shown to be valid for all solutions. Worst case run time is shown to
be O(n2) or O(n3) for distance matrix or network inputs respectively. Tests on
published problems show that the proposed p-median model method provides as good or
better objective function value (OFV) than the OFV of a p-median model in which
parts are grouped to an arbitrary median. Likewise the new p-median model is shown,
for these published problems, to give as good or better OFV than the algorithms
reported by the original authors of the problem. The test problems suggest that
other measures of solution quality such as bottlenecks and duplicate machines in
addition to OFV become important measures of solution quality for dense problems. ©
1998 Elsevier Science Ltd. All rights reserved.
INDEX KEYWORDS: Algorithms; Computational complexity; Heuristic methods;
Mathematical models; Matrix algebra; Problem solving; Systems analysis, Heuristic
vertex substitution methods; Objective function value (OFV), Cellular manufacturing
REFERENCES: Kusiak, A., Boe, J.W., Cheng, C.H., Clustering analysis: Models and
algorithms (1986) Control and Cybernetics, 15, pp. 139-154;
Klastorin, T.D., The p-median problem for cluster analysis: A comparative test
using the mixture model approach (1985) Management Science, 31, pp. 84-95;
Narula, S.C., Ogbu, U.I., Samuelsson, H.M., An algorithm for the p-median problem
Jarvinen, P., Rajala, J., Sinervo, H., A branch-and-bound algorithm for seeking the
p-median (1972) Operations Research, 20, pp. 173-182;
Francis, R.L., McGinnis L.F., Jr., White, J.A., (1992) Facility Layout and
Location: An Analytical Approach, , Prentice-Hall, Englewood Cliffs, NJ;
Maranzana, F.E., On the location of supply points to minimize transport costs
(1964) Operations Research Quarterly, 15, pp. 261-270;
Khumawala, B.M., An efficient algorithm for the p-median problems with maximum
distance constraints (1973) Geographical Analysis, 5, pp. 309-321;
Teitz, M.B., Bart, P., Heuristic methods for estimating the generalized vertex
median of a weighted graph (1968) Operations Research, 16, pp. 955-961;
Rosing, K.E., Hillsman, E.L., Rosing-Vogelaar, H., A note comparing optimal and
heuristic solutions to the p-median problem (1979) Geographical Analysis, 11, pp.
86-89;
Goodchild, M.F., Noronha, V.T., Location-allocation for small computers (1983)
Monograph, 8., Department of Geography, The University of Iowa, Iowa City, IA;
Densham, P.J., Rushton, G., A more efficient heuristic for solving large p-median
problems (1992) Papers in Regional Science: the Journal of the RSAI, 71, pp. 307-
329;
Theory of NP-Compleleness, , Bell Telephone Laboratories, Inc;
Parker, R.G., Rardin, R.L., (1988) Discrete Optimization, , Academic Press, New
York;
Hillier, F.S., Lieberman, G.J., (1990) Introduction to Operations Research, 5th
Edn., , McGraw-Hill, New York;
determining manufacturing families form design-based grouping for flexible
manufacturing (1986) Computers and Industrial Engineering, 16, pp. 193-201;
Cormen, T.H., Leiserson, C.E., Rivest, R.L., (1990) Introduction to Algorithms, ,
MIT Press, Cambridge, MA;
Ahuja, R.K., Magnanti, T.L., Orlin, J.B., (1993) Network Flows, Theory, Algorithms
and Applications, , Prentice-Hall, Englewood Cliffs, NJ;
117-133;
formation applications (1989) Computers in Industrial Engineering, 16, pp. 419-426;
Chan, H.M., Milner, D.A., Direct clustering algorithm for group formation cellular
Research, 18, pp. 213-232;
Research, 24, pp. 451-464;
manufacturing: Part II. An extension and comparison (1993) International Journal of
Research, 28, pp. 1555-1572;
Shafer, S.M., A goal programming approach to the cell formation problem (1991)
Peihua, G., Process-based machine grouping for cellular manufacturing systems
configuration (1987) International Journal of Production Research, 25, pp. 101-113
CORRESPONDENCE ADDRESS: Deutsch, S.J.; Dept. of Mech., Indust./Mfg. Eng.,
Northeastern University, Boston, MA 02115, United States
ISSN: 03608352
CODEN: CINDD
SOURCE: Scopus
Szwarc, D., Rajamani, D., Bector, C.R.

6506409711;6603907688;7003368089;
Cell formation considering fuzzy demand and machine capacity
0030650478&doi=10.1007%2fBF01225760&partnerID=40&md5=dd56bedc9c1a614a34db94a70b37e5
32
DOI: 10.1007/BF01225760
AFFILIATIONS: Department of Mechanical Engineering, University of Manitoba,
Winnipeg, Man., Canada;
Department of Actuarial Sciences, University of Manitoba, Winnipeg, Man., Canada;
Department of Mechanical Engineering, University of Manitoba, Winnipeg, Man. R3T
5V6, Canada
ABSTRACT: The concept of cellular manufacturing requires that machines and parts be
grouped together to form cells. Many researchers have addressed this cell formation
problem for crisp (or certain) input data. However, if the input data is not exact
or is imprecise (fuzzy), how is the decision made to form cells and assign parts
determined? In this paper, crisp and fuzzy mathematical models are developed to
optimally determine machine grouping and pans assignment under fuzzy demand and
machine capacity. The object of these models is to minimise the processing and the
material handling costs. Comparisons between the crisp and fuzzy results are made
to show how outcomes differ when uncertainty is introduced. The example problems
are solved using the Hyperlindo software package to illustrate the ability of the
model to react under different input parameters. To reduce the computation time,
nonlinear representations of the above crisp and fuzzy models are developed. These
nonlinear formulations allow each model to be elegantly decomposed into two
submodels. An iterative solution procedure is proposed which utilises these
submodels to reduce computation time substantially. Example problems are solved
using both the crisp and the fuzzy optimal models and the iterative procedure. The
solutions and computational experience for the two approaches are compared.
AUTHOR KEYWORDS: Cell Formation; Fuzzy Sets; Mathematical Programming
INDEX KEYWORDS: Computer software; Cost effectiveness; Flexible manufacturing
systems; Fuzzy sets; Iterative methods; Mathematical models; Mathematical
programming, Manufacturing cells; Software package Hyperlindo, Computer aided
manufacturing
REFERENCES: Heragu, S.S., Group technology and cellular manufacturing (1994) IEEE
Transactions on Systems, Man, and Cybernetics, 24 (2), pp. 203-215., 1994;
673;
Management, 6 (2), pp. 125-147;
Research, 20 (1), pp. 145-152;
Research, 27 (9), pp. 1465-1473;
Research, 28 (5), pp. 913-925;
Ahmed, M.U., Ahmed, N.U., Nandkeolyar, U., A volume and material handling cost
based heuristic for designing cellular manufacturing cells (1991) Journal of
390;
Grznar, J., Mehrez, A., Offodile, O.F., Formulation of the machine cell grouping
problem with capacity and material movement constraints (1994) Journal of
Del Valle, A.G., Balarezo, S., Tejero, J., A heuristic workloadbased model to form
cells by minimizing intercellular movements (1994) International Journal of
Adil, G.K., (1994) Design of the Cell System of Production, Unpublished Doctoral
Dissertation, , University of Manitoba, Winnipeg, Manitoba, Canada;
Kasilingam, R.G., Sankaran, S., Capacity selection by mathematical programming in
cellular manufacturing systems (1991) Production Planning and Control, 2 (4), pp.
353-358;
Rajamani, D., Singh, N., Aneja, Y.P., A model for cell formation in manufacturing
systems with sequence dependence (1992) International Journal of Production
Research, 30 (6), pp. 1227-1235;
Kang, S.-L., Wemmerlov, U., A work load-oriented heuristic methodology for
Askin, R.G., Mitwasi, M.G., Integrating facility layout with process selection and
capacity planning (1992) European Journal of Operational Research, 57, pp. 162-173;
Sankaran, S., Kasilingam, R.G., On cell size and machine requirements in planning
373-383;
Rajamani, D., Szwarc, D., A mathematical model for multiple machine replacement
with material handling and relocation considerations (1994) Engineering
Optimization, 22, pp. 213-229;
Zadeh, L.A., Fuzzy sets (1965) Information and Control, 8, pp. 338-353;
Zimmerman, H.J., (1991) Fuzzy Set Theory and Its Application, 2nd Rev. Edn, pp.
248-261., Kluwer Academic Publishers, Boston/Dordrecht/London;
Tanaka, H., Asai, K., Fuzzy linear programming problems with fuzzy numbers (1984)
1651;
Zhang, C., Wang, H.-P., Concurrent formation of part families and machine cells
based on the fuzzy set theory (1992) Journal of Manufacturing Systems, 11 (1), pp.
61-67;
Chu, C.H., Tsai, C.C., Manufacturing cell formation in a fuzzy environment (1993)
Proceedings of the National Decision Sciences Conference, 3, pp. 1432-1434;
Narayanaswamy, P., (1995) Machine Grouping and Pan Family Formation Problems in
Cellular Manufacturing, , Unpublished Master Of Science dissertation, University of
Manitoba, Winnipeg, Manitoba, Canada
CORRESPONDENCE ADDRESS: Rajamani, D.; Department of Mechanical Engineering,
University of Manitoba, Winnipeg, Man. R3T 5V6, Canada
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Lee, Ching-En, Chen, Chaw-Wen

7410141096;7501959953;
Two-stage method for group layout
(1997) Kung Yeh Kung Chieng Hsueh K'an/Journal of the Chinese Institute of
Industrial Engineers, 14 (1), pp. 13-27.
0030622934&partnerID=40&md5=2728ce71841d90cd0281a89dbad6f7db
AFFILIATIONS: Natl Chiao Tung Univ, Hsin-Chu, Taiwan

ABSTRACT: Functional layout has long been applied in the job shop environment to
cope with small-batch and mix-product manufacturing requirements. It is in company
with many problems such as, complicated material flows, low production performance,
high inventory, poor quality, and so on. The concept of cellular manufacturing
system (CMS) applying group technology (GT) techniques to group similar parts into
families processed by sets of dissimilar machines has been recognized as one of the
most powerful weapons to solve the above mentioned problems. There are a lot of
research papers that concentrate on the cell formation problem. However, few
discussed the even important issue of cell layout. This paper focuses on the cell
layout issue and presents a two-stage procedure by considering input/output points,
material handling traits, and CMS related characteristics, to solve this problem.
In stage one, a flowline loop-type machine layout for each cell is determined by
minimizing the total flow distance within each cell. Cells are then laid out using
spatial cutting procedures in the second stage. The objective function in this
stage is to minimize the total inter-cell flow distances and total flow distances
between each individual cell and the warehouse. A simulated annealing procedure is
incorporated so that the ultimate solution can be obtained.
INDEX KEYWORDS: Materials handling; Problem solving; Production control;
Scheduling; Simulated annealing, Cellular manufacturing system (CMS); Flowline loop
type machine layout; Group technology (GT) techniques; Job shop environment,
CORRESPONDENCE ADDRESS: Lee, Ching-En; Natl Chiao Tung Univ, Hsin-Chu, Taiwan
PUBLISHER: Chinese Inst Ind Eng, Taipei, Taiwan
ISSN: 10170669
CODEN: GOGOE
ABBREVIATED SOURCE TITLE: Kung Yeh Kung Chieng Hsueh K'an
SOURCE: Scopus
Soolaki, M., Arkat, J.

54416473500;55912953100;
Incorporating dynamic cellular manufacturing into strategic supply chain design
85034738723&doi=10.1007%2fs00170-017-1346-
2&partnerID=40&md5=d4cfaf4a28b8952b8f57675fdadb1b67
DOI: 10.1007/s00170-017-1346-2
Sanandaj, 66177-15175, Iran
ABSTRACT: For increasing the efficiency of the supply chain (SC), it is necessary
to take into account the interactions and relationships between the stages of
procurement of raw materials, manufacturing the products, and distributing them. An
integrated framework is proposed in this paper for companies interested in meeting
the demand for different products in the customer zones by establishing a number of
plants and distributors at the candidate sites and in having SC design with
reconfiguration capability based on changes in demand and more proper economic
opportunities. For this purpose, a geographically distributed cell design is
proposed for the selection of the proper location for each of the facilities and
the production process of the products. A mixed integer linear programming model is
presented here for the integration of the sectors for procurement, production, and
distribution of the products in the SC. In light of the NP-hard class of the cell
formation problem, a new algorithm titled hybrid genetic ant lion optimization
(HGALO) algorithm is presented for finding the optimal or near-optimal solutions. A
comparison is also made here between the proposed algorithm and the genetic
algorithm (GA) for demonstration of the efficiency of the proposed algorithm. The
quality of the solutions generated based on the HGALO algorithm demonstrates the
capability and effectiveness of the algorithm in finding high quality solutions. ©
2017, Springer-Verlag London Ltd., part of Springer Nature.
AUTHOR KEYWORDS: Cellular manufacturing system; Hybrid genetic ant lion
optimization; Procurement-production-distribution; Supply chain design
INDEX KEYWORDS: Efficiency; Genetic algorithms; Integer programming; Manufacture;
Optimization; Product design; Supply chains, Economic opportunities; High-quality
solutions; Hybrid genetic; Mixed integer linear programming model; Near-optimal
solutions; Production distribution; Reconfiguration capability; Supply chain
design, Cellular manufacturing
REFERENCES: Aalaei, A., Davoudpour, H., Designing a mathematical model for
integrating dynamic cellular manufacturing into supply chain system (2012) AIP Conf
Proc, 1499, p. 239;
Aalaei, A., Davoudpour, H., Two bounds for integrating the virtual dynamic cellular
manufacturing problem into supply chain management (2016) J Ind Manag Optim, 12
(3), pp. 907-930;
system into supply chain management (2017) Int J Prod Econ, 183, pp. 667-679;
dynamic virtual cellular manufacturing into supply chain management: a case study
(2016) Eng Appl Artif Intell, 47, pp. 3-15;
layout and operations scheduling (2011) Int J Adv Manuf Technol, 61 (5-8), pp. 637-
647;
Arkat, J., Farahani, M.H., Ahmadizar, F., Multi-objective genetic algorithm for
cell formation problem considering cellular layout and operations scheduling (2012)
Int J Comput Integr Manuf, 25 (7), pp. 625-635;
Oper Res, 192 (2), pp. 414-428;
Balakrishnan, J., Cheng, C.H.H., Dynamic cellular manufacturing under multiperiod
planning horizons (2005) J Manuf Technol Manag, 16 (5), pp. 516-530;
Benhalla, S., Gharabi, A., Olivier, C., Multi-plant cellular manufacturing design
within a supply chain (2011) J Oper Logist, 4 (1), pp. II.1-II.17;
Fahimnia, B., Farahani, R.Z., Marian, R., Luong, L., A review and critique on
integrated production–distribution planning models and techniques (2013) J Manuf
Syst, 32 (1), pp. 1-19;
Holland, J.H., Genetic algorithms and the optimal allocation of trials (1973) SIAM
J Comput, 2 (2), pp. 88-105;
Jang, Y.J., Jang, S.Y., Chang, B.M., Park, J., A combined model of network design
and production/distribution planning for a supply network (2002) Comput Ind Eng, 43
(1-2), pp. 263-281;
Kazemi, A., Zarandi, M.H.F., Husseini, S.M.M., A multi-agent system to solve the
production–distribution planning problem for a supply chain: a genetic algorithm
approach (2009) Int J Adv Manuf Technol, 44 (1), pp. 180-193;
Ma, Y., Yan, F., Kang, K., Wei, X., A novel integrated production-distribution
planning model with conflict and coordination in a supply chain network (2016)
Knowl-Based Syst, 105 (1), pp. 119-133;
Melo, M.T., Nickel, S., Saldanha-da-Gama, F., Dynamic multi-commodity capacitated
facility location: a mathematical modeling framework for strategic supply chain
planning (2005) Comput Oper Res, 33 (1), pp. 181-208;
Melo, M.T., Nickel, S., Saldanha-da-Gama, F., Facility location and supply chain
management: a review (2009) Eur J Oper Res, 196 (2), pp. 401-412;
Mirjalili, S., The ant lion optimizer (2015) Adv Eng Softw, 83, pp. 80-98;
Niknamfar, A.H., Niaki, S.T.A., Pasandideh, S.H.R., Robust optimization approach
for an aggregate production–distribution planning in a three-level supply chain
(2015) Int J Adv Manuf Technol, 76 (1), pp. 623-634;
Rao, P., Mohanty, R., Impact of cellular manufacturing on supply chain management:
exploration of interrelationships between design issues (2003) Int J Adv Manuf
Technol Manag, 5 (5-6), pp. 507-520;
Sadigh, A.N., Fallah, H., Nahavandi, N., A multi-objective supply chain model
integrated with location of distribution centers and supplier selection decisions
(2013) Int J Adv Manuf Technol, 69 (1), pp. 225-235;
routing in group technology manufacturing systems (1990) Eng Optim, 16 (3), pp.
235-245;
Saxena, L.K., Jain, P.K., An integrated model of dynamic cellular manufacturing and
supply chain system design (2012) Int J Adv Manuf Technol, 62 (1), pp. 385-404;
Int J Prod Res, 46 (17), pp. 4925-4945;
Soolaki, M., Arkat, J., (2018) Supply chain design considering cellular structure
and alternative processing routings. J Ind Syst Eng 11(1). Winter;
Vaart, T.V.D., Donk, P.D.V., A critical review of survey–based research in supply
chain integration (2008) Int J Prod Econ, 111 (1), pp. 42-55;
Vokurkar, J.R., Zank, G.M., Lund, C.M., Improving competitiveness through supply
chain management: a cumulative improving approach (2002) CR, 12 (1), pp. 14-25;
Wemmerlov, U., Nancy, L.H., Cellular manufacturing in the US industry: a survey of
Wilhelm, W., Liang, D., Rao, B., Warrier, D., Zhu, X., Bulusu, S., Design of
international assembly systems and their supply chains under NAFTA (2005) Transport
Res Part E: Log Transport Rev, 41 (6), pp. 467-493;
Zhang, L.L., Lee, C., Zhang, S., An integrated model for strategic supply chain
design: formulation and ABC-based solution approach (2016) Expert Syst Appl, 52
(15), pp. 39-49
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Subramanian, A.
56181982400;56182064500;6602277527;8935888900;23490732200;17436208400;
On solving manufacturing cell formation via Bicluster Editing
times.
84969919763&doi=10.1016%2fj.ejor.2016.05.010&partnerID=40&md5=5bcf03860646a4f07542a
9618cc5d622
DOI: 10.1016/j.ejor.2016.05.010
AFFILIATIONS: Fluminense Federal University, Niterói, RJ, Brazil;
Federal Rural University of Pernambuco, Garanhuns, PE, Brazil;
Federal University of Paraíba, João Pessoa, PB, Brazil
ABSTRACT: This work investigates the Bicluster Graph Editing Problem (BGEP) and how
it can be applied to solve the Manufacturing Cell Formation Problem (MCFP). We
develop an exact method for the BGEP with a new separation algorithm. We also
describe a new preprocessing procedure for the BGEP derived from theoretical
results on vertex distances in the input graph. Computational experiments performed
on randomly generated instances with various levels of difficulty show that our
separation algorithm accelerates the convergence speed, and our preprocessing
procedure is effective for low density instances. Another contribution of this work
is to take advantage of the fact that the BGEP and the MCFP share the same solution
space. This leads to the proposal of two new exact approaches for the MCFP that are
based on mathematical formulations for the BGEP. Both approaches use the grouping
efficacy measure as the objective function. Up to the authors' knowledge, these are
the first exact methods that employ such a measure to optimally solve instances of
the MCFP. The first approach is based on a new ILP formulation for the MCFP, and
the second consists of iteratively running several calls to a parameterized version
of the BGEP. Computational experiments performed on instances of the MCFP found in
the literature show that our exact methods for the MCFP are able to prove several
previously unknown optima. © 2016 Elsevier B.V. All rights reserved.
AUTHOR KEYWORDS: Biclusterization; Combinatorial optimization; Graph
partitioning; Manufacturing cell formation
INDEX KEYWORDS: Algorithms; Combinatorial optimization; Flexible manufacturing
systems; Graph theory; Iterative methods; Manufacture; Optimization,
Biclusterization; Computational experiment; Convergence speed; Graph Partitioning;
Manufacturing cell formation; Mathematical formulation; Objective functions;
Separation algorithms, Cellular manufacturing
REFERENCES: Abdullah, A., Hussain, A., A new biclustering technique based on
crossing minimization (2006) Neurocomputing, 69 (1618), pp. 1882-1896;
Amit, N., (2004) The Bicluster Graph Editing Problem, , Master's thesis. Tel Aviv
University;
Bellman, R., Dynamic programming treatment of the travelling salesman problem
(1962) J. ACM, 9 (1), pp. 61-63;
Bisson, G., Hussain, F., Chi-sim: A new similarity measure for the co-clustering
task (2008) Proceedings of the 2008 Seventh International Conference on Machine
Learning and Applications, pp. 211-217., ICMLA '08 IEEE Computer Society;
Journal of Operational Reseach, 230, pp. 563-572;
139-152;
clustering for group technology (1986) International Journal of Production Reseach,
24 (5), pp. 1221-1233;
Cheng, Y., Church, G.M., Biclustering of expression data (2000) Proceedings of the
Eighth International Conference on Intelligent Systems for Molecular Biology, pp.
93-103., AAAI Press;
Economics, 103 (2), pp. 767-783;
Dinkelbach, W., On nonlinear fractional programming (1967) Management Science, 13
(7), pp. 492-498;
Applications, 39 (3), pp. 2408-2414;
Faure, N., Chretienne, P., Gourdin, E., Sourd, F., Biclique completion problems for
multicast network design (2007) Discrete Optimization, 4 (3-4), pp. 360-377;
Flanders, R.E., Design, manufature and production control of a standard machine
(1924) Transactions of the American Society of Mechanical Enginneers, 46, pp. 691-
738;
Gilbert, E., Random graphs (1959) Annals of Mathematical Statistics, 30, pp. 1141-
1144;
Glover, F., Improved linear integer programming formulations of nonlinear integer
problems (1975) Management Science, 22 (4), pp. 455-460;
Goldengorin, B., Krushinsky, D., Pardalos, P.M., (2013) Cell Formation in
Industrial Engineering: Theory, Algorithms and Experiments, , Springer;
Guo, J., Hffner, F., Komusiewicz, C., Zhang, Y., Improved algorithms for bicluster
editing (2008) Proceedings of 5th International Conference on Theory and
Applications of Models of Computation, 4978, pp. 445-456., Springer Berlin /
Heidelberg;
Gupta, A., Palit, A., Clique generation using boolean equations (1979) Proceedings
of the IEEE, 67 (1), pp. 178-180;
Hartigan, J.A., (1975) Clustering Algorithms, , John Wiley & Sons;
Hsu, C.P., (1990) Similarity Coefficient Approaches to Machine Component Cell
Formation in Cellular Manufacturing: A Comparative Study, , Ph.D. thesis.
University of Wisconsin;
(2009) Ibm Ilog Cplex v12.1 User's Manual for Cplex, , IBM IBM;
Kumar, C.S., Chandrasekharan, M.P., Group efficacy: A quantitative criterion for
Protti, F., Dantas da Silva, M., Szwarcfiter, J.L., Applying modular decomposition
to parameterized bicluster editing (2006) Parameterized and Exact Computation,
4169, pp. 1-12., Lecture Notes in Computer Science Springer Berlin / Heidelberg;
Sousa Filho, G.F., Dos Anjos Cabral F, L., Ochi, L.S., Protti, F., Hybrid
metaheuristic for bicluster editing problem (2012) Electronic Notes in Discrete
Srinivasan, G., Narendran, T.T., Grafics - A nonhierarchical clustering-algorithm
pp. 463-478;
Wolsey, L., Integer programming (1998) Wiley Series in Discrete Mathematics and
Optimization, , Wiley;
(3), pp. 1609-1617;
Wu, T.H., Chang, C.C., A hybrid heuristic algorithm adopting both Boltzmann
pp. 346-360;
You, F., Castro, P.M., Grossmann, I.E., Dinkelbach's algorithm as an efficient
method to solve a class of MINLP models for large-scale cyclic scheduling problems
(2009) Computers & Chemical Engineering, 33 (11), pp. 1879-1889
CORRESPONDENCE ADDRESS: Protti, F.; Fluminense Federal UniversityBrazil; email:
[email protected]
PUBLISHER: Elsevier
ISSN: 03772217
CODEN: EJORD
SOURCE: Scopus
Jabal-Ameli, M.S., Moshref-Javadi, M.

21834329200;55911808200;
Concurrent cell formation and layout design using scatter search
(2014) International Journal of Advanced Manufacturing Technology, 71 (1-4), pp. 1-
22. Cited 10 times.
84897670962&doi=10.1007%2fs00170-013-5342-
x&partnerID=40&md5=1c64a1f15fa05420ee5fac2e4f6cd3b7
DOI: 10.1007/s00170-013-5342-x
Technology, Tehran 16846, Iran;
Department of Industrial and Systems Engineering, Auburn University, Auburn AL
ABSTRACT: Two key decisions in designing cellular manufacturing systems are cell
formation and layout design problems. In the cell formation problem, machine groups
and part families are determined while in the facility layout problem the location
of each machine in each cell (intra-cell layout) and the location of each cell
(inter-cell layout) are decided. Owing to the fact that there are interactions
between two problems, cell formation and layout design problem must be tackled
concurrently to design a productive manufacturing system. In this research, two
problems are investigated concurrently. Some important and realistic factors such
as inter-cell layout, intra-cell layout, operations sequence, part demands, batch
size, number of cells, cell size, and variable process routings are incorporated in
the problem. The problem is formulated as a mathematical model. Three different
methods are described to solve the problem: multi-objective scatter search (MOSS),
non-dominated genetic algorithm (NSGA-II), and the ε-constraint method. The methods
are employed to solve nine problems generated and adopted from the literature.
Sensitivity analysis is accomplished on the parameters of the problem to
investigate the effects of them on objective function values. The results show that
the proposed MOSS algorithm performs better than NSGA-II and produces better
solutions in comparison to multi-stage approaches. © 2013 Springer-Verlag London.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing systems; Layout design;
Multi-objective programming; NSGA-II; Scatter search
INDEX KEYWORDS: Cell formation; Layout designs; Multiobjective programming; NSGA-
II; Scatter search, Cells; Cellular manufacturing; Cytology; Design; Genetic
algorithms; Mathematical models, Problem solving
pp. 2-49., 10.1080/002075497195966;
(2000) Int J Prod Res, 38, pp. 481-507., 10.1080/002075400189275;
identification problem in cellular manufacture (1986) J Oper Manag, 6, pp. 125-
147., 10.1016/0272-6963(86)90021-5;
Oper Res, 69, pp. 284-291., 10.1016/0377-2217(93)90016-G;
Eur J Oper Res, 57, pp. 136-144., 10.1016/0377-2217(92)90038-B 0825.90451;
Jajodia, S., Minis, I., Harhalakis, G., Proth, J., CLASS: Computerized layout
solution using simulated annealing (1992) Int J Prod Res, 30 (50), pp. 95-108.,
10.1080/00207549208942880 0825.90487;
Review, evaluation and directions for future research (1998) Comput Ind Eng, 34
(1), pp. 3-20., 10.1016/S0360-8352(97)00147-2;
research (2010) Eur J Oper Res, 206, pp. 509-521., 10.1016/j.ejor.2009.10.020
1188.90002;
for solving the cell formation problem in group technology (1991) J Oper Manag, 10
(1), pp. 44-72., 10.1016/0272-6963(91)90035-V;
Shafers, M., Rogers, D.F., Similarity and distance measures for cellular
manufacturing. Part II. An extension and comparison (1993) Int J Prod Res, 31 (6),
pp. 1315-1326., 10.1080/00207549308956793;
problem: A taxonomy and review (2006) Int J Prod Econ, 101, pp. 329-352.,
10.1016/j.ijpe.2005.01.014;
Hassan, M.M.D., Layout design in group technology manufacturing (1995) Int J Prod
Econ, 38, pp. 173-188., 10.1016/0925-5273(94)00090-W;
the subproblems (1994) Int J Prod Res, 32 (5), pp. 1197-1218.,
10.1080/00207549408956995 0901.90102;
materials flow approach based on operation sequences (1990) IIE Trans, 22 (1), pp.
84-97., 10.1080/07408179008964161;
analysis (1996) Int J Prod Res, 34 (8), pp. 2299-2315., 10.1080/00207549608905026
0930.90017;
Res, 46 (10), pp. 2589-2620., 10.1080/00207540500478843 1160.90379;
(1995) Int J Prod Res, 33 (8), pp. 2079-2095., 10.1080/00207549508904803
0913.90125;
Trans, 29 (7), pp. 561-571;
Alfa, S.A., Chen, M., Heragu, S., Integrating the grouping and layout problems in
cellular manufacturing systems (1992) Comput Ind Eng, 23, pp. 54-58., 10.1016/0360-
8352(92)90062-O;
for designing line type cellular manufacturing systems (1996) Integr Manuf Syst, 7
(1), pp. 6-15., 10.1108/09576069610108471;
layout design and intercell flows for the machine sharing problem (1993) Int J Prod
Res, 31 (4), pp. 791-810., 10.1080/00207549308956757;
(1996) Prod Plan Control, 7 (1), pp. 99-103., 10.1080/09537289608930330;
Harhalakis, G., Lu, T., Minis, I., Nagi, R., A practical method for design of
hybrid-type production facilities (1996) Int J Prod Res, 34 (4), pp. 897-918.,
10.1080/00207549608904942 0946.90546;
a cellular manufacturing environment a case study (2000) Int J Prod Res, 38 (7),
pp. 1689-1709., 10.1080/002075400188807 0944.90541;
manufacturing systems (2000) IIE Trans, 32, pp. 219-235;
Urban, T.L., Chiang, W., Russell, R.A., The integrated machine allocation and
layout problem (2000) Int J Prod Res, 38 (13), pp. 2911-2930.,
10.1080/00207540050117369;
Lee, S., Chiang, C., A cut-tree-based approach for clustering machine cells in the
bidirectional linear flow layout (2001) Int J Prod Res, 39 (15), pp. 3491-3512.,
10.1080/00207510110054885;
Lee, S., Chiang, C., Cell formations in the uni-directional loop material handling
environment (2002) Eur J Oper Res, 137 (2), pp. 401-420., 10.1016/S0377-
2217(01)00160-6 1012.90518;
Dixit, A.R., Mishra, P.K., Ex-CLASS: Extended Cell formation and Layout Selection
considering production parameters with Sequence data (2010) Int J Prod Dev, 10, pp.
180-200., 10.1504/IJPD.2010.029992;
approach (2000) Int J Prod Res, 38 (10), pp. 2327-2347., 10.1080/00207540050028124
1012.90507;
based on TOPSIS method (2009) Comput Oper Res, 36, pp. 1478-1496.,
10.1016/j.cor.2008.02.012 1179.90101;
approach to facility layout design and cell formation (2011) Int J Adv Manuf
Technol, , 10.1007/s00170-011-3523-z;
447-482., 10.1080/00207549608904913 0924.90081;
manufacturing (1991) Int J Prod Res, 29 (2), pp. 375-390.,
10.1080/00207549108930077;
systems: A genetic algorithm approach (2006) Int J Prod Res, 44 (6), pp. 1217-
1241., 10.1080/00207540500338252 1095.90030;
annealing for designing cellular manufacturing systems using MDmTSP (2010) Comput
Ind Eng, 59, pp. 929-936., 10.1016/j.cie.2010.09.003;
Chiang, C., Lee, S., A genetic-based algorithm with the optimal partition approach
for the cell formation in bi-directional linear flow layout (2004) Int J Comput
Integr Manuf, 17 (4), pp. 364-375., 10.1080/09511920310001640512;
Ming, L.C., Ponnambalam, S.G., A Hybrid GA/PSO for the Concurrent Design of
Cellular Manufacturing System (2008) 2008 I.E. International Conference on Systems,
Man and Cybernetics, pp. 1855-1860;
488-497., 10.1016/j.rcim.2007.07.011;
Paydar, M.M., Mahdavi, I., Solimanpur, M., Tajdin, A., Solving a new mathematical
model for cellular manufacturing system: Fuzzy goal programming (2008) Proceedings
of the 2008 I.E. IEEM, pp. 1224-1228;
cellular manufacturing systems (2006) Int J Prod Econ, 103, pp. 767-783.,
10.1016/j.ijpe.2005.10.008;
annealing (2008) J Oper Res Soc, 59, pp. 443-454., 10.1057/palgrave.jors.2602436
1153.90512;
Oper Res, 192, pp. 414-428., 10.1016/j.ejor.2007.09.023 1157.90391;
integrated system identification and system optimization (1971) IEEE Trans Syst Man
Cybern, 1, pp. 296-297., 10.1109/TSMC.1971.4308298 0224.93016 300411;
Methodology, , Elsevier New York 0622.90002;
Decis Sci, 8, pp. 156-166., 10.1111/j.1540-5915.1977.tb01074.x 1461416;
Marti, R., Laguna, M., Glover, F., Principles of scatter search (2006) Eur J Oper
Res, 169, pp. 359-372., 10.1016/j.ejor.2004.08.004 1079.90178 2171867;
Oper Res, 36, pp. 777-794., 10.1016/j.cor.2007.10.026 1157.90384;
Tavakkoli-Moghaddam, R., Javadian, B., Khorrami, A., Gholipour-Kanani, Y., Design
cellular manufacturing system (2010) Expert Syst Appl, 37, pp. 2661-2669.,
10.1016/j.eswa.2009.08.012;
scatter search (2011) J Intell Manuf, , 10.1007/s10845-010-0395-2;
Rahimi-Vahed, A.R., Rabbani, M., Tavakkoli-Moghaddam, R., Torabi, S.A., Jolai, F.,
A multi-objective scatter search for a mixed-model assembly line sequencing problem
(2007) Adv Eng Inform, 21, pp. 85-99., 10.1016/j.aei.2006.09.007;
44, pp. 318-329., 10.1007/s00170-008-1835-4;
genetic algorithm: NSGA-II (2002) IEEE Trans Evol Comput, 6 (2), pp. 182-197.,
10.1109/4235.996017;
Srinivas, N., Deb, K., Multiobjective function optimization using nondominated
sorting genetic algorithms (1994) Evol Comput, 2 (3), pp. 221-248.,
10.1162/evco.1994.2.3.221;
considering alternative routing (1997) Int J Comput Integ Manuf Syst, 10, pp. 93-
107., 10.1016/S0951-5240(97)00001-3;
in group technology applications (1990) Int J Prod Res, 28 (12), pp. 1243-1257.,
10.1080/00207549008942864;
217-238., 10.1016/j.rcim.2005.04.002
CORRESPONDENCE ADDRESS: Moshref-Javadi, M.; Department of Industrial and Systems
Engineering, Auburn University, Auburn AL 36849, United States; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
24176685700;13007835700;13806002000;
Formation of machine groups and part families in cellular manufacturing systems
using a correlation analysis approach
1157-1169. Cited 33 times.
43449124442&doi=10.1007%2fs00170-007-0928-
9&partnerID=40&md5=f77161c83937847c639dac793ba624d9
DOI: 10.1007/s00170-007-0928-9
AFFILIATIONS: Unité de Recherche de Mécanique, Modélisation et Production, (U2MP),
Sfax, Tunisia;
Département de Génie Mécanique, Ecole Nationale d'Ingénieurs de Sfax, B.P. W, 3038
Sfax, Tunisia
ABSTRACT: The important step in the design of a cellular manufacturing (CM) system
is to identify the part families and machine groups and consequently to form
manufacturing cells. The scope of this article is to formulate a multivariate
approach based on a correlation analysis for solving cell formation problem. The
proposed approach is carried out in three phases. In the first phase, the
correlation matrix is used as similarity coefficient matrix. In the second phase,
principal component analysis (PCA) is applied to find the eigenvalues and
eigenvectors on the correlation similarity matrix. A scatter plot analysis as a
cluster analysis is applied to make simultaneously machine groups and part families
while maximizing correlation between elements. In the third stage, an algorithm is
improved to assign exceptional machines and exceptional parts using respectively
angle measure and Euclidian distance. The proposed approach is also applied to the
general group technology (GT) problem in which exceptional machines and part are
considered. Furthermore, the proposed approach has the flexibility to consider the
number of cells as a dependent or independent variable. Two numerical examples for
the design of cell structures are provided in order to illustrate the three phases
of proposed approach. The results of a comparative study based on multiple
performance criteria show that the present approach is very effective, efficient
and practical. © 2007 Springer-Verlag London Limited.
AUTHOR KEYWORDS: Cell formation; Cellular manufacturing; Correlation matrix;
Exceptional machines and parts; Principal component analysis
INDEX KEYWORDS: Correlation methods; Eigenvalues and eigenfunctions; Numerical
methods; Principal component analysis; Problem solving, Cell formation; Correlation
matrix; Exceptional machines, Cellular manufacturing
REFERENCES: Adenso-Diaz, B., Lozano, S., Eguira, I., Part-machine grouping using
weighted similarity coefficients (2005) Comput Ind Eng, 48, pp. 553-570;
considering investment and operational cost (1993) Eur J Oper Res, 69, pp. 330-341;
manufacturing cell (2005) Comput Ind Eng, 48, pp. 3-21;
Arvindh, B., Irani, S.A., Principal components analysis for evaluating the
feasibility of cellular manufacturing without initial-part matrix clustering (1991)
Int J Prod Res, 32, pp. 1909-1938;
Burgess, A.G., Morgan, I., Vollmann, T.E., Cellular manufacturing: Its impact on
the total factory (1993) Int J Prod Res, 31, pp. 2059-2077;
(1991) Int J Prod Res, 29, pp. 343-356;
Chaea, S.S., Wardeb, W.D., Effect of using principal coordinates and principal
components on retrieval of clusters (2005) Comput Stat Data Anal;
manufacturing (1982) J Manuf Syst, 1, pp. 65-67., 1;
Fts, C., Lau, K.W., Ply, C., Choy, K.L., Two-stage approach for machine-part
grouping and cell layout problems (2005) Robot Comput-Integr Manuf;
Cheng, C.H., Goh, C.H., Lee, A., Designing group technology manufacturing systems
using heuristic branching rules (2001) Comput Ind Eng, 40, pp. 117-131;
Int J Prod Res, 26, pp. 1161-1172;
Delagarge, J., (2000) «initiation À l'Analyse des Données» ; 3 Ième Édition, , Ed
Dunod;
Genwook, J., Leep, H.R., Parsaaei, H.R., A cellular manufacturing system based on
new similarity coefficient which considers alternative routes during machine
failure (1998) Comput Ind Eng, 34, pp. 21-36;
Gnanadesikan, R., (1997) Methods for Statistical Data Analysis of Multivariate
Observations, pp. 7-15., Wiley New York;
Gupta, T., Saifoddini, H., Production data based similarity coefficient for
system (1990) Int J Prod Res, 28, pp. 1247-1269;
Harkat, M.F., (2003) Détection et Localisation de Défauts Par Analyse en
Composantes Principales, , PhD Thesis Institut National Polytechnique de Lorraine;
Joines, J.A., King, R.E., Culbreth, C.T., (1996) A Comprehensive Review of
Production-oriented Manufacturing Cell Formation Techniques, , Research funded by
the NCSU Furniture Manufacturing and Management Center North Carolina State
University DDm-92-15432;
Kern, M., Wei, C., The cost of elimining exceptional elements in group technologie
cell formation (1991) Int J Prod Res, 29, pp. 1535-1547;
using a rank order clustering algorithm (1980) Int J Prod Res, 18, pp. 213-232., 2;

Review and extension (1982) Int J Prod Res, 20, pp. 117-133;
Kitaoka, M., Nakamura, R., Seriza, S., Usuki, J., Multivariate analysis model for
machine-part cell formation problem in group technology (1999) Int J Prod Econ, 60-
61, pp. 433-438;
J Prod Res, 28, pp. 233-243., 2;
561-569;
Labordere, A.H., (1977) Analyse de Données : Application et Méthodes Pratiques, ,
Ed Masson;
Ledauphin, S., Hanafi, M., Qannari, E., Simplification and signification of
principal components (2004) Chemometr Intell Lab Syst, 74, pp. 277-281;
McAuley, D., Machine grouping for efficient production (1972) Prod Eng, 51, pp. 53-
57;
Panchalavarapua, P.R., Chankongb, V., Design of cellular manufacturing systems with
assembly considerations (2005) Comput Ind Eng, 48, pp. 449-469;
systems in the presence of alternative process plans (1990) Int J Prod Res, 28, pp.
1541-1554;
Rummel, R.J., (1988) Applied Factor Analysis, , Northwestern University Press
Evanston;
(1985) SAS User's Guide-statistics 5, , SAS Institute Inc. SAS Institute Cary NC;
Slomp, J., Boppana, V.C., Suresh, N.C., Design of virtual manufacturing cells: A
mathematical programming approach (2005) Robot Comput-Integr Manuf, 21, pp. 273-
288;
Seifoddine, H., Djassemi, M., Merits of the production volume based similarity
coefficient in machine cell formation (1995) J Manuf Syst, 14, pp. 35-44;
Shambu, G., Performance evaluation of cellular manufacturing systems: A taxonomy
and review of research (1996) Int J Oper Prod Manage, 8, pp. 81-103;
Sinha, R.K., Hollier, R.H., A review of production control problems in cellular
manufactur (1984) Int J Prod Res, 22, pp. 773-789;
Stawowy, A., Evolutionary strategy for manufacturing cell design (2006) Int J Manag
Sci Omega, 34, pp. 1-18;
(1999) SPSS Professional Statistics, , SPSS Inc. SPSS Inc Chicago IL;
Yin, Y., Kazuhiko, K., Similarity coefficient methods applied to the cell formation
problem: A taxonomy and review (2006) Int J Prod Econ, 101, pp. 329-352
CORRESPONDENCE ADDRESS: Masmoudi, F.; Département de Génie Mécanique, Ecole
Nationale d'Ingénieurs de Sfax, B.P. W, 3038 Sfax, Tunisia; email:
[email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Parika, W., Seesuaysom, W., Vitayasak, S., Pongcharoen, P.

56436842600;56436725100;56002012600;17435722900;
Bat algorithm for designing cell formation with a consideration of routing
flexibility
Management, art. no. 6962631, pp. 1353-1357. Cited 3 times.
84914142103&doi=10.1109%2fIEEM.2013.6962631&partnerID=40&md5=c62087e138c236651bc58c
bdd49b92a6
DOI: 10.1109/IEEM.2013.6962631
AFFILIATIONS: Centre of Operations Research and Industrial Applications (CORIA),
Department of Industrial Engineering, Naresuan University, Pitsanulok, 65000,
Thailand
ABSTRACT: Cellular manufacturing system (CMS) is an approach that can be used to
enhance both flexibility and efficiency in small-to-medium lot production
environment. In cell formation, machines are grouped into cells based on their
contributions to manufacturing process. Flexible routes have resulted in different
machine sequences causing the changes in the movement of parts between cells. The
movements in manufacturing shop floor lead to the efficiency of productivity
relating to costs. Cell formation problem is classified into non-deterministic
polynomial-time hard problem, of which the amount of computation required to find
solutions increases exponentially with problem size. Solving this kind of problem
by full numerical methods especially for the large size problem can be
computationally expensive. The objectives of this paper were to describe the
application of Bat Algorithm (BA) for designing cell formation aiming to minimise
inter-cell part movement with a consideration of routing flexibility and
investigate the appropriate setting of BA parameters that have an effect to the
solution quality. A cell formation designing program was coded in modular style
using a general purpose programming language called Tcl/Tk. The computational
experiment was designed and conducted using ten datasets, in which the number of
machines in each cell is either equal or unequal. The statistical analysis on the
experimental results suggested that the population size and the number of
iterations have statistical impact on the quality of the solutions obtained. © 2013
IEEE.
AUTHOR KEYWORDS: Bat Algorithm; Cell formation; CMS; Inter-cell movement;
Routing flexibility
INDEX KEYWORDS: Cells; Curium; Cytology; Efficiency; Numerical methods; Polynomial
approximation; Population statistics; Problem oriented languages; Problem solving;
Routing algorithms, Bat algorithms; Cell formation; Cell movement; Computational
experiment; General-purpose programming language; Inter-cell part movements;
Production environments; Routing flexibility, Cellular manufacturing
REFERENCES: Balakrishnan, J.D., Cheng, C.H., Multi-period planning and uncertainty
issues in cellular manufacturing: A review and future directions (2007) European
Wemmerlov, U., Hyer, N.L., Cellular manufacturing in the us industry: A survey of
Papaioannou, G., John M Wilson M, J., The evolution of cell formation problem
research (2010) Expert Systems with Applications, 206, pp. 509-521;
Bazargan-Lari, M., Nahavandi, S., The impact of cell formation on layout designs in
cellular manufacturing (2001) Intelligent Automation and Soft Computing, 7, pp. 13-
22;
Wu, X.D., Chu, C.H., Wang, Y.F., Yan, W.L., A genetic algorithm for cellular
181, pp. 156-167., Aug;
cell formation and layout design in cellular manufacturing system (2008)
International Journal of Advanced Manufacturing Technology, 39, pp. 943-953., Nov;
cell formation, intracellular machine layout and cell layout in the cms problem
based on topsis method (2009) Computers & Operations Research, 36, pp. 1478-1496.,
May;
Bilge, U., Frat, M., Albey, E., A parametric fuzzy logic approach to dynamic part
routing under full routing flexibility (2008) Computers & Industrial
Byrne, M.D., Chutima, P., Real-time operational control of an fms with full routing
flexibility (1997) International Journal of Production Economics, 51, pp. 109-113;
Manufacturing, 22, pp. 217-238., Jul;
scatter search (2012) Journal of Intelligent Manufacturing, 23, pp. 1127-1139.,
Aug;
(2009) Expert Systems with Applications, 36, pp. 3652-3661., Mar;
Operational Research, 157, pp. 592-606., Sep;
layout (2004) Computers & Operations Research, 31, pp. 1603-1619., Sep;
Ateme-Nguema, B., Dao, T.M., Quantized hopfield networks and tabu search for
manufacturing cell formation problems (2009) International Journal of Production
Economics, 121, pp. 88-98., Sep;
Manufacturing Technology, 47, pp. 745-754., Mar;
Kao, Y.C., Lin, C.H., A pso-based approach to cell formation problems with
50, pp. 4075-4089;
(2013) Journal of Manufacturing Systems, 32, pp. 78-84., Jan;
Yang, X.-S., Nature-Inspired Metaheuristic Algorithm, 2010., Second ed.: Luniver
Press;
Pongcharoen, P., Musikapun, P., Solving multistage multi-machine multi-product
scheduling problem using bat algorithm The 2nd International Conference on
Management and Artificial Inelligent Bangkok, 2012., Thailand;
Gandomi, A.H., Yang, X.S., Alavi, A.H., Talatahari, S., Bat algorithm for
constrained optimization tasks Neural Computing and Applications, 2012, pp. 1-17;
Yang, X.S., Bat algorithm for multi-objective optimisation (2011) International
Journal of Bio-Inspired Computation, 3, pp. 267-274;
Yang, X.S., Gandomi, A.H., Bat algorithm: A novel approach for global engineering
optimization (2012) Engineering Computations (Swansea, Wales, 29, pp. 464-483;
Buntaotuk, J., Muenpak, N., Developing a genetic algorithm for cells formation
problem with routing flexibility (in thai (2008) Industrial Engineerinh, , Naresuan
Universtiy, Pitsanulok, Thailand;
Ousterhout, J.K., (2010) Tcl and Tk Tookit, , 2nd ed.: Addison Wesley
ISSN: 21573611
ISBN: 9781479909865
SOURCE: Scopus
Nouri, H., Hong, T.S.

36768934300;54787835500;
Development of bacteria foraging optimization algorithm for cell formation in
cellular manufacturing system considering cell load variations
(2013) Journal of Manufacturing Systems, 32 (1), p. 20. Cited 38 times.
84888774796&doi=10.1016%2fj.jmsy.2012.07.014&partnerID=40&md5=e15e1bdce6f812a0608d8
4d37d77cfec
DOI: 10.1016/j.jmsy.2012.07.014
AFFILIATIONS: Faculty of Engineering, Sanandaj Branch, Islamic Azad University,
Sanadaj, Iran;
Faculty of Engineering, University Putra Malaysia, 43400 Serdang, Selagor, Darul
Ehsan, Malaysia
ABSTRACT: The cellular manufacturing system (CMS) is considered as an efficient
production strategy for batch type production. The CMS relies on the principle of
grouping machines into machine cells and grouping machine parts into part families
on the basis of pertinent similarity measures. The bacteria foraging optimization
(BFO) algorithm is a modern evolutionary computation technique derived from the
social foraging behavior of Escherichia coli bacteria. Ever since Kevin M. Passino
invented the BFO, one of the main challenges has been the employment of the
algorithm to problem areas other than those of which the algorithm was proposed.
This paper investigates the first applications of this emerging novel optimization
algorithm to the cell formation (CF) problem. In addition, for this purpose matrix-
based bacteria foraging optimization algorithm traced constraints handling (MBATCH)
is developed. In this paper, an attempt is made to solve the cell formation problem
while considering cell load variations and a number of exceptional elements. The
BFO algorithm is used to create machine cells and part families. The performance of
the proposed algorithm is compared with a number of algorithms that are most
commonly used and reported in the corresponding scientific literature such as K-
means clustering, the C-link clustering and genetic algorithm using a well-known
performance measure that combined cell load variations and a number of exceptional
elements. The results lie in favor of better performance of the proposed algorithm.
© 2012 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All
rights reserved.
AUTHOR KEYWORDS: Bacteria foraging optimization algorithm; Cell formation; Cell
load variations; Cellular manufacturing system
INDEX KEYWORDS: Cells; Cellular manufacturing; Cytology; Escherichia coli; Genetic
algorithms, Bacteria foraging optimization algorithms; Bacteria foraging
optimizations; Batch type productions; Cell formation; Cell load variation;
Escherichia coli bacteria; Evolutionary computation techniques; Optimization
algorithms, Clustering algorithms
REFERENCES: Acharya, D.P., Panda, G., Mishra, S., Lakhshmi, Y.V.S., Bacteria
foraging based independent component analysis (2007) Proceedings of the
International Conference on Computational Intelligence and Multimedia Applications,
Vol. 2, pp. 527-531;
manufacturing systems (2009) Journal of Manufacturing Systems, 28, pp. 132-139.,
DECEMBER 4;
designing cellular manufacturing systems (1987) Production Research, 25 (5), pp.
639-655;
Baykasoglu, A., Gindy, N.Z., Cobb, R.C., Capability based formulation and solution
of multiple objective cell formation problems using simulated annealing (2001)
Integrated Manufacturing Systems, 2, pp. 258-274;
Burbidge, J.L., Production flow Analysis (1971) Production Engineer, 50 (4-5), pp.
139-152;
European Operational Research, 187, pp. 46-69;
Kim, Y.D., A study on surrogate objectives for loading a certain type of flexible
manufacturing system (1993) Production Research, 31, pp. 381-392;
Kusiak, A., Lee, H., Neural computing-based design of components for cellular
1777-1790;
Li, S.G., Rong, Y.L., The reliable design of one-piece flow production system using
fuzzy ant colony optimization (2009) Computers and Operations Research, 36, pp.
1656-1663;
Mahapatra, S.S., Sudhakarapandian, R., Genetic cell formation using ratio level
data in cellular manufacturing system (2008) International Journal of Advanced
Manufacturing Technology, , 10.1007/s00170-007-1029-35;
system (2012) Journal of Manufacturing Systems, 31, pp. 214-223., APRIL 2;
Majhi, B., Panda, G., Bacterial foraging based identification of nonlinear dynamics
system (2007) Proceedings of IEEE International Congress on Evolutionary
Computation (CEC-2007), pp. 1636-1641., Singapore;
Majhi, B., Panda, G., Particle swarm optimization based efficient adaptive channel
equalizer for digital communication (2007) Proceedings of International Conference
on Trends in Intelligent Electronics Systems (Ties 2007), , Chennai;
Majhi, B., Panda, G., Choubey, A., On the development of a new adaptive channel
equalizer using bacterial foraging optimization technique (2006) Proceedings of
IEEE Annual India Conference (INDICON-2006), pp. 1-6., New Delhi, India;
Majhi, R., Panda, G., Sahoo, G., Das, D.P., Stock market prediction of S&P 500 and
DJIA using bacterial foraging optimization technique (2007) IEEE Congress on
Evolutionary Computation (CEC 2007), pp. 2569-2575., Singapore;
Mishra, S., Hybrid least square adaptive bacterial foraging strategy for harmonic
estimation (2005) IEE Proceedings on Generation Transmission and Distribution, 152
(3), pp. 379-389;
Mishra, S., Bhende, C.N., Bacterial foraging technique based optimized active power
filter for load compensation (2007) IEEE Transactions on Power Delivery, 22 (1),
pp. 457-465;
Design of Cellular Manufacturing Systems for Dynamic and Uncertain Production
Requirements with Presence of Routing Flexibility, , PhD thesis, published;
using ordinal and ratio level data (1999) Production Research, 37 (3), pp. 539-556;
Panda, G., Majhi, B., Mishra, S., Nonlinear system identification using bacterial
foraging based learning (2006) Proceedings of Third International Conference on
Artificial Intelligence in Engineering Technology (ICAIET-2006), pp. 120-125., Kota
Kinabalu, Malaysia;
Passino, K.M., Biomimicry of bacterial foraging for distributed optimization and
control (2002) IEEE Control Systems Magazine, 22 (3), pp. 52-67;
Tripathy, M., Mishra, S., Bacteria foraging based to optimize both real power loss
and voltage stability limit (2007) IEEE Transactions on Power Systems, 22 (1), pp.
240-248;
Tripathy, M., Mishra, S., Lai, L.L., Zhang, Q.P., Transmission loss reduction based
on FACTS and bacteria foraging algorithm (2006) PPSN, pp. 222-231;
Ulagammai, L., Venkatesh, P., Kannan, S.P., Padhy, N.P., Application of bacteria
foraging technique trained and artificial and wavelet neural networks in load
forecasting (2007) Neurocomputing, pp. 2659-2667;
simulated annealing (1992) European Journal of Operations Research, 63, pp. 409-
422;
component and grouping problem with multiple objectives (1992) Computers and
manufacturing systems (1992) Computers in Industry, 20, pp. 11-23;
state-of-The-art review (1999) Production Research, 37 (14), pp. 3335-3357;
Wang, W., Koren, Y., Scalability planning for reconfigurable manufacturing systems"
(2012) Journal of Manufacturing Systems, 31, pp. 83-91., APRIL 2;
CORRESPONDENCE ADDRESS: Nouri, H.; Faculty of Engineering, Sanandaj Branch, Islamic
Azad University, Sanadaj, Iran; email: [email protected]
ISSN: 02786125
CODEN: JMSYE
SOURCE: Scopus
Aleisa, E., Suresh, N.C., Li Lin

14520378500;7004424841;35932327300;
Team formation in concurrent engineering using group technology (gt) concepts
(2011) Concurrent Engineering Research and Applications, 19 (3), pp. 213-224. Cited
8 times.
80054073477&doi=10.1177%2f1063293X11418014&partnerID=40&md5=6702a1eaff9640de1414e92
cca67b773
DOI: 10.1177/1063293X11418014
AFFILIATIONS: Industrial and Management Systems Engineering Department, College of
Engineering and Petroleum, Kuwait University, P.O. Box 5969, Safat 13060, Kuwait;
326F Jacobs Management Center, School of Management, University at Buffalo,
Buffalo, NY 14260-4000, United States;
Department of Industrial and Systems Engineering, University at Buffalo, State
University of New York, Buffalo, NY 14260-2050, United States
ABSTRACT: Concurrent engineering (CE) has emerged as an essential design principle
that facilitates rapid and efficient product development that is necessary to
survive in today's fiercely competitive environment. However, the lack of tools
that address design team formulation and proper design task assignment in CE has
made its application an immense challenge. In this article we explicitly address
this issue by pointing out the relevance of its structure to cell-formation problem
in cellular manufacturing (CM) and group technology. Particularly,
interdisciplinary CE teams will be formulated as multifunctional machine-cells that
process similar parts, in our case, design tasks requiring involvement of similar
individuals. The fruitful marriage of the two disciplines, concurrent engineering
and cellular manufacturing, opens the path towards utilizing the ample existing
efficient algorithms of cellular manufacturing to concurrent engineering rather
than re-inventing the wheel in developing methods in this respect. The paper in-
hand also incorporate sequences (or routing in cellular manufacturing) to create
work teams that can conduct similar tasks commonly known as work packages in a
smoother manner that avoids unnecessary back and forth alterations and overlapping.
In addition, to enable solving the task assignment problem in reasonable time for
relatively larger problems, the developed framework integrates a fuzzy ART
algorithm proven efficient in cellular manufacturing literature. The article also
provides an illustrative example on executing the methodology on a design example
and highlights its implications on task team assignments. © The Author(s), 2011.
AUTHOR KEYWORDS: cellular manufacturing; concurrent engineering; fuzzy artificial
neural networks.; group technology (GT); sequence-based clustering; team
formation
INDEX KEYWORDS: Cell formation; Competitive environment; Design Principles; Design
tasks; Design team; Efficient algorithm; Fuzzy ART; Fuzzy artificial neural
network; Illustrative examples; Proper design; sequence-based clustering; Similar
individuals; Task assignment; Team assignment; Team formation; Work packages; Work
team, Algorithms; Cellular neural networks; Concurrent engineering; Engineering;
Group technology; Product design; Product development, Cellular manufacturing
REFERENCES: Pennell, J.P., Winner, R.I., Concurrent Engineering: Practices and
Prospects (1989) IEEE Global Telecommunications Conference and Exhibition Publ by
IEEE, pp. 647-655., IEEE Service Center, Piscataway, NJ, USA: Available from IEEE
Service Cent (cat(89CH2682-3), Vol. 1, pp;
Nevins, J.L., Whitney, D.E., (1989) Concurrent Design of Products and Processes, A
Strategy for the Next Generation in Manufacturing, , New York: McGraw-Hill;
Kusiak, A., Park, K., Concurrent Engineering- Decomposition and Scheduling of
Design Activities (1990) International Journal of Production Research, 28 (10), pp.
1883-900;
Linton, L., Hall, D., Hutchison, K., Hoffman, D., Evanczuk, S., Sullivan, P.,
(1992) First Principles of Concurrent Engineering: A Competitive Strategy for
Product Development, , Washinton D.C.: CALS/ Concurrent Engineering Electronic
System Task Group;
Kerzner, H., (2009) Project Management A System Approach to Planning, Scheduling,
and Controlling, , 3rd edn, New York: John Wiley & Sons, Inc;
Ishii, K., Modeling of Concurrent Engineering Design (1993) Concurrent Engineering:
Automation, Tools, and Techniques, , Kusiak, A.K. A. (ed.) New York: John Wiley &
Sons, Inc;
Yassine, A., Braha, D., Four Complex Problems in Concurrent Engineering and the
Design Structure Matrix Method (2003) Concurrent Engineering Research &
Smith, R.P., Eppinger, S.D., Identifying controlling features of engineering design
iteration (1997) Management Science, 43 (3), pp. 276-293;
Chen, S.-J.G., Lin, L., Modeling team Member Characteristics for the Formation of a
Multifunctional Team in Concurrent Engineering (2004) IEEE Transactions on
Engineering Management, 51, pp. 111-124;
Ke, L., Archetti, C., Feng, Z., Ants can solve the team orienteering problem (2008)
10.1016/j.cie.2007.10.001, PII S0360835207002161;
Singh, N., (1996) Systems Approach to Computer-Integrated Design and Manufacturing,
, New York: Wiley;
Jin, Y., Levitt, R.E., Kunz, J.C., Christiansen, T.R., Virtual Design Team: A
Computer Simulation Framework for Studying Organizational Aspects of Concurrent
Design (1995) Simulation, 64, p. 160174;
Gardoni, M., Concurrent engineering in research projects to support information
content management in a collective way (2005) Concurrent Engineering Research and
Applications, 13 (2), pp. 135-144., DOI 10.1177/1063293X05053798;
Grey, C.F., Larson, E.W., (2008) Project Management the Managerial Process, , 4th
edn, Boston: McGraw-Hill Irwin;
Milosevic, D.Z., (2003) Project Management ToolBox: Tools and Techniques for the
Practicing Project Manager, , 1stedn, Hoboken, New Jersey: John Wiley & Sons, Inc;
Li, W.D., Qiu, Z.M., State-of-the-art technologies and methodologies for
collaborative product development systems (2006) International Journal of
T5757306118790;
Tseng, K.C., Abdalla, H., A novel approach to collaborative product design and
development environment (2006) Proceedings of the Institution of Mechanical
Engineers, Part B: Journal of Engineering Manufacture, 220 (12), pp. 1997-2020.,
http://journals.pepublishing.com/content/UX6WJ20261687734/fulltext.pdf? 30e21fc3-
565d-439a-8095-8e8b60c95998&returnUrl=, DOI 10.1243/09544054JEM485;
Boothroyd, G., Dewhurst, P., (1983) Design for Assembly: A Designer's Handbook, ,
Wakerfield, RI: Boothroyd Dewhurst Inc;
Makino, A., Barkan, P., Reynolds, L., Pflaff, E., Design for Serviceability Expert
System (1989) SME Winter Annual Meeting: Concurrent Product and Process Design;
Waghodekar, P.H., Sahu, S., Machine-Component Cell Formation in Group Technology:
Ham, I., Hitomi, K., Yoshida, T., (1985) Group Technology: Application to
Production Management, , Hingham, MA: Kluwer-Nijhoff;
Chen, L., Li, S., Concurrent Parametric Design Using a Multifunctional Team
Approach (2001) Proceedings of the ASME Design Engineering Technical Conference, 2,
pp. 287-296;
Suresh, N.C., Slomp, J., Kaparthi, S., Sequence-Dependent Clustering of Parts and
Machines: A Fuzzy ART Neural Network Approach (1999) International Journal of
Mitrofanov, S., (1966) The Scientific Principles of Group Technology, , National
Lending Library Translation;
Irani, S.A., (1999) Handbook of Cellular Manufacturing Systems, , New York, NY:
Wiley;
Waghodekar, P.H., Sahu, S., Machine-Component Cell-Formation in Group Technology-
Mosier, C.T., Experiment Investigating the Application of Clustering Procedures and
Similarity Coefficients to the GT Machine Cell Formation Problem (1989)
and Control, , New York: Chapman & Hall;
Jang, I.H., Rhee, J.T., Generalized Machine Cell Formation Considering Material
Flow and Plant Layout Using Modified Self-Organizing Feature Maps (1997) Computers
& Industrial Engineering, 33 (3-4), pp. 457-460;
Defersha, F.M., Chen, M., Machine Cell Formation Using a Mathematical Model and a
Genetic-Algorithm-Based Heuristic (2006) International Journal of Production
Research, 44 (12), pp. 2421-2444;
Tiwari, M.K., Roy, D., Solving a Part Classification Problem Using Simulated
Annealing-Like Hybrid (2003) Robotics and Computer-Integrated Manufacturing, 19
(5), pp. 415-424;
Park, S., Suresh, N.C., Performance of Fuzzy ART Neural Network and Hierarchical
Clustering for Part-Machine Grouping Based on Operation Sequences (2003)
of Uncertainty;
part-machine grouping in cellular manufacturing (2007) International Journal of
773232622;
S0736584507000737;
Selvam, R.P., Balasubramanian, K.N., Algorithmic Grouping of Operation Sequences
(1985) Engineering Costs and Production Economics, 9 (1-3), pp. 125-134;
Vakharia, A.J., Wemmerlov, U., Designing a Cellular Manufacturing System: A Cell
Layout Approach Using Operation Sequences (1986) Proceesings of the Decision
Science Institute;
Dahel, N.E., Design of Cellular Manufacturing Systems in Tandem Configuration
Hwang, H., Ji-Ung, S., A genetic-algorithm-based heuristic for the GT cell
formation problem (1996) Computers and Industrial Engineering, 30 (4), pp. 941-
955., DOI 10.1016/0360-8352(96)00044-7;
36 (1), pp. 157-179;
885-906., DOI 10.1080/00207540110101639;
Choobineh, F., A framework for the design of cellular Manufacturing Systems (1988)
Tam, K.Y., An Operation Sequence Based Similarity Coefficient for Part Families
Formations (1990) Journal of Manufacturing Systems, 9 (1), pp. 55-68;
Kang, S.L., Wemmerlov, U., A Work Load-Oriented Heuristic Methodology for
Manufacturing Cell-Formation Allowing Reallocation of Operations (1993) European
Irani, S.A., Zhang, H., Zhou, J., Huang, H., Udai, T.K., Subramanian, S.,
Production flow analysis and simplification toolkit (PFAST) (2000) International
10.1080/002075400188636;
Kaparthi Shashidhar, Suresh Nallan, C., Neural network system for shape-based
classification and coding of rotational parts (1991) International Journal of
Zhang, H., Huang, S., Appliations of Neural Networks in Manufacturing: A State-of-
the-Art Survey (1995) International Journal of Production Research, 33, pp. 705-
728;
Lee, S.D., Chiang, C.P., Cell Formations in the Uni-Directional Loop Material
Handling Environment (2002) European Journal of Operational Research, 137 (2), pp.
401-420;
King, J.R., Machine-Component Group Formation in Group Technology (1980) Omega-
International Journal of Management Science, 8 (2), pp. 193-199;
Chan, H.M., Milner, D.A., (1982) Direct Clustering Algorithm for Group Formation in
Cellular Manufacture;
51, pp. 53-57;
Pham, D.T., Afify, A.A., Clustering techniques and their applications in
engineering (2007) Proceedings of the Institution of Mechanical Engineers, Part C:
Journal of Mechanical Engineering Science, 221 (11), pp. 1445-1459., DOI
10.1243/09544062JMES508;
Carpenter, G.A., Grossberg, S., Rosen, D.B., Fuzzy ART. Fast Stable Learning and
Categorization of Analog Patterns by an Adaptive Resonance System (1991) Neural
Networks, 7 (6), pp. 759-771;
Suresh, N.C., Kaparthi, S., Performance of Fuzzy ART Neural Network for Group
Technology Cell Formation (1994) International Journal of Production Research, 32,
pp. 1693-1713;
Burke, L.I., Kamal, S., (1992) Fuzzy ART for Cellular Manufacturing, Intelligent
Engineering Systems Through Artificial Neural Networks, , Fairfield, NJ: ASME
CORRESPONDENCE ADDRESS: Aleisa, E.; Industrial and Management Systems Engineering
Department, College of Engineering and Petroleum, Kuwait University, P.O. Box 5969,
Safat 13060, Kuwait; email: [email protected]
ISSN: 1063293X
CODEN: CRAPE
ABBREVIATED SOURCE TITLE: Concurrent Eng Res Appl
SOURCE: Scopus
Chan, F.T.S., Lau, K.W., Chan, P.L.Y.

7202586517;36722692600;7403540482;
A holistic approach to manufacturing cell formation: Incorporation of machine
flexibility and machine aggregation
8344255886&doi=10.1243%2f0954405042323568&partnerID=40&md5=715097b10e05dd4c659c5c44
efb4feb3
DOI: 10.1243/0954405042323568
AFFILIATIONS: Department of Industrial Engineering, University of Hong Kong, Hong
Kong, Hong Kong;
Department of Industrial Engineering, University of Hong Kong, Pokfulam Road, Hong
Kong, Hong Kong
ABSTRACT: One of the most practical approaches of improving productivity in a
factory is to adopt the superior concept and technique of cellular manufacturing
(CM) based on group technology (GT). Particularly, cell formation is an important,
critical and difficult step in CM. In general, there have been a number of
methodologies proposed for solving a machine-part grouping problem (MPGP). Besides
considering the simple cell formation problem, some researchers have focused on
machine flexibility, in which parts are having alternative routeings/process plans.
However, it is very rare to consider the area of aggregation and disaggregation of
machines in cell formation under uncertain constraints and uncertainty. In the
light of this, the main aim of this present work is to address the MPGP
holistically with the considerations of machine flexibility as well as machine
aggregation and disaggregation simultaneously. In addition, based on the
availability of alternative routeings, a method is proposed to generate an
alternative solution for machine breakdown situations. Thus, the problem nature of
this work will be more realistic and practical for today's global manufacturing
era. The problem scope has been identified and the model is formulated in
mathematical programming form. The objective function of this model is to minimize
the total intercellular and intracellular part movement. Since MPGP has been proved
to be non-polynomial (NP) complete, a genetic algorithm (GA), which is an excellent
optimization technique, is employed to solve this problem.
AUTHOR KEYWORDS: Alternative routeings; Genetic algorithms; Machine-part grouping
problem; Uncertainty
INDEX KEYWORDS: Genetic algorithms; Heuristic methods; Machine components;
Mathematical models; Optimal systems; Optimization; Polynomial approximation;
Problem solving, Alternative routeings; Cell formation; Machine-part grouping
problems; Uncertainities, Systems engineering
REFERENCES: McAuley, J., Machine grouping for efficient production (1972) The Prod.
Engr, 51, pp. 53-57;
Production Management, , Kluwer-Nijho, Boston, Massachusetts;
multi-period planning horizons of cellular manufacturing systems (1998) Prod.
manufacturing cells (1993) Int. J. Prod. Res., 31 (8), pp. 1757-1766;
machine groups and part families (1998) Int. J. Prod. Res., 36 (5), pp. 1325-1337;
Moon, C., Gen, M.A., Genetic algorithm-based approach for design of independent
manufacturing cells (1999) Int. J. Prod. Economics, 60-61, pp. 421-426;
cell formation (2000) Int. J. Advd Mfg Technol., 16, pp. 491-497;
considering alternative routing (1997) Int. J. Computer Integrated Mfg Systems, 10
(2), pp. 93-107;
Albino, V., Garavelli, A.C., Limited flexibility in cellular manufacturing systems:
A simulation study (1999) Int. J. Prod. Economics, 60-61, pp. 447-455;
Pierreval, H., Plaquin, M.F., An evolutionary approach of multicriteria
manufacturing cell formation (1998) Int. Trans. Opl Res., 5 (1), pp. 13-25;
using genetic algorithms (1998) Int. J. Robotics and Computer Integrated Mfg, 14
(5-6), pp. 339-346;
certain constraints (2000) Int. J. Prod. Economics, 64, pp. 267-278;
generalized group technology (2001) Int. J. Computers Ind. Engng, 41 (2), pp. 227-
240;
Holland, J.H., (1992) Adaptation in Natural and Artificial Systems, 2nd Edition, ,
The University of Michigan Press, Ann Arbor, Michigan;
(2002) Int. J. Prod. Res., 40 (3), pp. 641-665;
manufacturing system using a genetic algorithm based heuristic approach (2000) Int.
J. Prod. Res., 38 (14), pp. 3357-3384;
and mutation operators in a genetic process (2002) Appl. Intell., 16 (1), pp. 7-17;
Falkenauer, E., New presentation and operators for GAs applied to grouping problems
(1994) Evolutionary Comput., 2 (2), pp. 123-144;
Gupta, Y., Gupta, M., Kumar, A., Sundram, C., Minimiz-ing total intercell and
J. Computer Integrated Mfg, 8 (2), pp. 92-101;
Paris, L., Pierreval, H., Manufacturing cell formation using distributed
evolutionary algorithms (1996) Proceedings of the Twelfth International Conference
on CAD/CAM Robotics and Factories of the Future, pp. 369-374., London, August;
technology problem (1992) Int. J. Prod. Res., 30 (11), pp. 2633-2646;
problem (1989) Int. J. Prod. Res., 27 (5), pp. 775-782;
formation for group technology application (1990) Int. J. Prod. Res., 28 (1), pp.
185-198;
manufacturing cell formation allowing reallocation of operations (1993) Eur. J. Opl
Res., 69 (3), pp. 292-311;
programming model employing genetic algorithms (1996) IIE Trans., 28 (1), pp. 69-
85;
Song, S., Hitomi, K., Group technology cell formation for minimizing the intercell
parts flow (1992) Int. J. Prod. Res., 30 (12), pp. 2737-2753;
Okogbaa, G., Chen, M., Chandrit, C., Manufacturing system cell formation and
evalution using a new intercell flow reduction heuristic (1992) Int. J. Prod. Res.,
30 (5), pp. 1101-1118;
Chow, W.S., Hawaleshka, O., Minimizing intercellular part movement in manufacturing
cell formation (1993) Int. J. Prod. Res., 31 (9), pp. 2161-2170;
Review and extensions (1982) Int. J. Prod. Res., 20 (2), pp. 117-133;
pp. 2243-2257
CORRESPONDENCE ADDRESS: Chan, F.T.S.; Department of Industrial Engineering,
University of Hong Kong, Pokfulam Road, Hong Kong, Hong Kong; email:
[email protected]
ISSN: 09544054
CODEN: PIBME
SOURCE: Scopus
Han, B.T., Cook, J.S.

7401726296;36898856800;
An efficient heuristic for robot acquisition and cell formation
(1998) Annals of Operations Research, 77, pp. 229-252. Cited 4 times.
0032394676&partnerID=40&md5=037b88e34fcfcf9711ba5b043e0e7f6f
AFFILIATIONS: Dept. Acco., Info. Syst. Bus. Laws, College of Business and
Economics, Washington State University, Pullman, WA 99164-4726, United States;
Jones School of Business, SUNY - Geneseo, 1 College Circle, Geneseo, NY 14454-1401,
United States
ABSTRACT: In this paper, a mathematical model and a solution algorithm are
developed for solving a robot acquisition and cell formation problem (RACFP). Our
model considers purchasing a proper mix of robots and assigning all given
workstations to purchased robots such that each robot cell satisfies its
workstations' resource demands while minimizing the total system (acquisition)
cost. Specifically, each robot has two capacity constraints - available work
envelope and effective machine time. RACFP is formulated as a multi-type two-
dimensional bin packing problem, a pure 0-1 integer program which is known to be
NP-hard. In this paper, a very efficient (polynomial time bound) heuristic
algorithm is developed and implemented. The algorithm consists of two major stages.
The first stage employs an LP-based bounding procedure to produce a tight solution
bound, whereas the second stage repetitively invokes a random search heuristic
using a greedy evaluation function. The algorithm is tested by solving 450 randomly
generated problems based on realistic parameter values. Computational results show
that the heuristic algorithm has outperformed algorithms using general optimization
techniques such as Simulated Annealing and Column Generation. All test problems are
solved within an order of magnitude of 10 seconds, with a gap of less than 1% from
the optimum. More importantly, over 70% of all solutions are optimal (334 out of
450). The algorithm can be easily modified for other applications such as file
placement for a multi-device storage system and job scheduling for a multi-
processing system.
REFERENCES: Aarts, E.H.L., Van Laarhoven, P.J.M., Statistical cooling: A general
approach to combinatorial problems (1985) Phillips Journal of Research, 40, pp.
193-226;
Appleton, E., Williams, D.J., (1987) Industrial Robot Applications, , Wiley, New
York, Chapter 3;
Bard, J.F., Feo, T.A., An algorithm for the manufacturing equipment selection
problem (1991) IIE Transactions, 23, pp. 83-92;
Baumol, W.T., Braunstein, Y.M., Empirical study of scale economies and production
complementarity: The case of journal productions (1987) Journal of Political
Economy, 85, pp. 1037-1048;
Berman, O., Maimon, O., Cooperation among flexible manufacturing systems (1986)
IEEE Journal of Robotics and Automation, RA-2, pp. 24-30;
Bernhardt, R., Dillman, R., Hormann, K., Tierney, K., (1992) Integration of Robots
into CIM, , Chapman and Hall, London, UK;
Blazewicz, J., Drabowski, M., Welgarz, J., Scheduling multiprocessor tasks to
minimize schedule length (1986) IEEE Transactions on Computers, C-35, pp. 389-393;
Chang, T.C., Wysk, R., Wang, H.P., (1991) Computer-Aided Manufacturing, , Prentice-
Hall, Englewood Cliffs, NJ, Chapters 9 and 14;
Coffman, E.G., Garey, M.R., Johnson, D.S., Approximation algorithms for bin-packing
- An updated survey (1984) Algorithm Design for Computer System Design, pp. 49-
106., G. Ausiello, M. Luccertini and P. Serafini, eds., Springer, Vienna;
Cook, J.S., Han, B.T., Optimal robot selection and workstation assignment for a CIM
system (1994) IEEE Transactions on Robotics and Automation, 10, pp. 210-219;
Gilmore, P.C., Gomory, R.E., A linear programming approach to the cutting-stock
problem (1961) Operations Research, 9, pp. 849-859;
Han, B.T., Diehr, G., Cook, J.S., Multiple-type, two-dimensional bin packing
problems: Applications and algorithms (1994) Annals of Operations Research, 50, pp.
239-261;
Han, B.T., Cook, J.S., (1996) Optimal Robot Acquisition for Multiple Cell
Formation, , Working Paper, Department of Management and Systems, Washington State
University;
Heragu, S.S., Recent models and techniques for the facility layout problem (1992)
Heragu, S.S., Lucarelli, C.M., Automated manufacturing system design using
analytical techniques (1996) The Industrial Electronics Handbook, , J.D. Irwin,
ed., CRC Press, Boca Raton, FL;
Hunt, V.D., (1989) Computer Integrated Manufacturing Handbook, , Chapman and Hall,
London, UK;
Jeng, W.D., Lin, J.T., Wen, U.P., Algorithms for sequencing robot activities in a
robot-centered parallel-processor workcell (1993) Computers and Operations
Research, 20, pp. 185-197;
Joshi, S.B., Mettala, E.G., Smith, J.S., Wysk, R.A., Formal models for control of
flexible manufacturing cells: Physical and system model (1995) IEEE Transactions on
Robotics and Automation, 11, pp. 558-570;
Kimemia, J., Gershwin, S.B., An algorithm for the computer control of a flexible
manufacturing system (1983) IIE Transactions, 15, pp. 353-362;
Kusiak, A., The production equipment requirements problem (1987) International
Lee, E., Mirchandani, P.B., Concurrent routing, sequencing, and setups for a two-
machine flexible manufacturing cell (1988) IEEE Journal of Robotics and Automation,
RA-4, pp. 256-264;
Maus, R., Allsup, R., (1986) Robotics: a Manager's Guide, , Wiley, New York;
Miltenburg, G.J., Krinsky, I., Evaluating flexible manufacturing systems (1987) IIE
Nyman, L.R., (1992) Making Manufacturing Cells Work, , Society of Manufacturing
Engineers with Computers and Automated Systems Association, McGraw Hill, New York;
Panzar, J.C., Willig, R.D., Economies of scope (1981) American Economic Review, 71,
pp. 268-272., Papers and Proceedings of the 93rd Annual Meeting of the American
Economic Association;
Sarin, S.C., Wilhelm, W.E., Prototype models for two-dimensional layout design of
robot systems (1984) IIE Transactions, 16, pp. 206-215;
Stecke, K.E., Formulation and solution of nonlinear integer production planning
problems for flexible manufacturing systems (1983) Management Science, 29, pp. 273-
288;
Wilhelm, W.E., An approach for modeling transient material flows in robotised
manufacturing cells (1986) Material Flow, 3, pp. 55-68
CORRESPONDENCE ADDRESS: Han, B.T.; Dept. Acco., Info. Syst. Bus. Laws, College of
Business and Economics, Washington State University, Pullman, WA 99164-4726, United
States; email: [email protected]
ISSN: 02545330
SOURCE: Scopus
Houck, C.R., Kay, M.G., Joines, J.A., Wilson, J.R.

8983634600;35810514300;7004005919;36037002500;
Empirical investigation of the benefits of partial lamarckianism
(1997) Evolutionary Computation, 5 (1), pp. 31-60. Cited 85 times.
0031082512&doi=10.1162%2fevco.1997.5.1.31&partnerID=40&md5=3c89d9f893922acd772ee0d7
f9930802
DOI: 10.1162/evco.1997.5.1.31
AFFILIATIONS: Box 7906, Department of Industrial Engineering, North Carolina State
University, Raleigh, NC 27695-7906, United States
ABSTRACT: Genetic algorithms (GAs) arc very efficient at exploring the entire
search space; however, they are relatively poor at finding the precise local
optimal solution in the region in which the algorithm converges. Hybrid GAs are the
combination of improvement procedures, which are good at finding local optima, and
GAs. There are two basic strategies for using hybrid GAs. In the first, Lamarckian
learning, the genetic representation is updated to match the solution found by the
improvement procedure. In the second, Baldwinian learning, improvement procedures
are used to change the fitness landscape, but the solution that is found is not
encoded back into the genetic string. This paper examines the issue of using
partial Lamarckianism (i.e., the updating of the genetic representation for only a
percentage of the individuals), as compared to pure Lamarckian and pure Baldwinian
learning in hybrid GAs. Multiple instances of five bounded nonlinear problems, the
location-allocation problem, and the cell formation problem were used as test
problems in an empirical investigation. Neither a pure Lamarckian nor a pure
Baldwinian search strategy was found to consistently lead to quicker convergence of
the GA to the best known solution for the series of test problems. Based on a
minimax criterion (i.e., minimizing the worst case performance across all test
problem instances), the 20% and 40% partial Lamarckianism search strategies yielded
the best mixture of solution quality and computational efficiency. © 1997 by the
Massachusetts Institute of Technology.
AUTHOR KEYWORDS: Baldwin effect; Hybrid genetic algorithms; Lamarckian evolution;
Local improvement procedures
INDEX KEYWORDS: algorithm; article; biological model; comparative study; evolution;
genotype; mutation; nonlinear system; phenotype, Algorithms; Evolution; Genotype;
Models, Genetic; Mutation; Nonlinear Dynamics; Phenotype
REFERENCES: Chu, P., Beasley, J., (1995) A Genetic Algorithm for the Generalized
Assignment Problem, , (Tech. Rep.). London: The Management School Imperial College;
Cooper, L., The transportation-location problems (1972) Operations Research, 20,

pp. 94-108;
Corana, A., Marchesi, M., Martini, C., Ridella, S., Minimizing multimodal functions
of continuous variables with the "simulated annealing" algorithm (1987) ACM
Transactions on Mathematical Software, 13 (3), pp. 262-280;
Davis, L., (1991) Handbook of Genetic Algorithms, , New York: Van Nostrand
Reinhold;
Duncan, D., T-tests and intervals for comparisons suggested by the data (1975)
Biometrics, 31, pp. 339-359;
Einot, I., Gabriel, K., A study of the powers of several methods of multiple
comparisons (1975) Journal of the American Statistical Association, 70 (351), pp.
574-583;
Goldberg, D., (1989) Genetic Algorithms in Search, Optimization and Machine
Grace, A., (1992) Optimization Toolbox User's Guide, , Natick, MA: Math Works;
Gruau, F., Whitley, D., Adding learning to the cellular development of neural
networks (1993) Evolutionary Computation, 1, pp. 213-233;
Hinton, G., Nolan, S., How learning can guide evolution (1987) Complex Systems, 1,
pp. 495-502;
Holland, J., (1975) Adaptation in Natural and Artificial Systems, , PhD thesis,
University of Michigan, Ann Arbor;
Homaifar, A., Guan, S., Liepins, G.E., A new approach on the traveling salesman
problem by genetic algorithms (1993) Proceedings of the 5th International
Conference on Genetic Algorithms, pp. 460-466., S. Forrest (Ed.), San Mateo, CA:
Morgan Kaufmann;
Houck, C.R., Joines, J.A., Kay, M.G., Comparison of genetic algorithms, random
restart, and two-opt switching for solving large location-allocation problems
(1996) Computers and Operations Research, 23 (6), pp. 587-596;
programming model employing genetic algorithms (1996) HE Transactions, 28 (1), pp.
69-85;
Joines, J., Houck, C., On the use of non-stationary penalty functions to solve
constrained optimization problems with genetic algorithms (1994) Proceedings of the
First IEEE Conference on Evolutionary Computation, 2, pp. 579-584., Z. Michalowicz,
J. D. Schaffer, H.-P. Schwefel, D. G. Fogel, & H. Kitano (Eds)., Piscataway, NJ:
IEEE Press;
Joines, J., King, R., Culbreth, C., (1995) The Use of a Local Improvement Beuristic
with a Genetic Algorithm for Manufacturing Cell Design., , (Tech. Rep. NCSU-IE 95-
06). Department of Industrial Engineering. Raleigh, NC: North Carolina State
University;
Lawrence, C., Zhou, J.L., Tits, A.L., (1994) User's Guide for CFSQP Version 2.4: A
C Code for Solving (Large Scale) Constrained Nonlinear (Minimax) Optimization
Problems, Generating Iterates Satisfying All Inequality Constraints, , (Tech. Rep.
TR-94016rl). College Park, MD: University of Maryland, Electrical Engineering
Department and Institute for Systems Research;
Love, R., Juel, H., Properties and solution methods for large location-allocation
problems with rectangular distances (1982) Journal of the Operations Research
Society, 33, pp. 443-452;
Love, R., Morris, J., A computational procedure for the exact solution of location-
allocation problems with rectangular distances (1975) Naval Research Logistics
Quarterly, 22, pp. 441-453;
Michalewicz, Z., (1996) Genetic Algorithms + Data Structures = Evolutionary
Programs (3rd Ed.), , New York: Springer-Verlag;
Michalewicz, Z., Nazhiyath, G., Genocop III: A co-evolutionary algorithm for
numerical optimization problems with nonlinear constraints (1995) Proceedings of
the Second IEEE International Conference on Evolutionary Computation, 1, pp. 647-
651., D. B. Fogel (Ed.), Piscataway, NJ: IEEE Press;
Mitchell, M., (1996) An Introduction to Genetic Algorithms, , Cambridge, MA: MIT
Press;
More, J.J., Garbow, B., Hillstrom, K., Testing unconstrained optimization software
(1981) ACM Transactions on Mathematical Software, 7 (1), pp. 17-41
CORRESPONDENCE ADDRESS: Houck, C.R.; Box 7906, Department of Industrial
Engineering, North Carolina State University, Raleigh, NC 27695-7906, United
States; email: [email protected]
PUBLISHER: MIT Press Journals
ISSN: 10636560
PUBMED ID: 10021752
ABBREVIATED SOURCE TITLE: Evol. Comput.
SOURCE: Scopus
Park, Y.-T., Wemmerlöv, U.

55547105195;6601920402;
A shop structure generator for cell formation research
7 times.
0001410837&doi=10.1080%2f00207549408957072&partnerID=40&md5=48a3458d9a00c0e618b4979
7bb93a53e
DOI: 10.1080/00207549408957072
AFFILIATIONS: Korea Institute of Science and Technology, PO Box 255, Cheongryang,
Seoul, 130-650, South Korea;
Graduate School of Business, University of Wisconsin-Madison, Madison, 53706,
United States
ABSTRACT: We present a new computerized shop generator designed for research
related to cell formation. The generator can take advantage of the following input
data: number of parts and machine types in the population, part-machine matrix
density, part and machine categories and proportions of parts and machines
belonging to each category (the part categories classify parts depending on the
number of machine types that appear in their routeings; similarly, the machine
categories classify machines depending on the fraction of the part population they
process), probabilities to determine machine sequence patterns (including possible
revisit-ations), part demand, unit processing times, productive capacity per
machine type, and maximum allowable utilization per machine. As part of the output,
the shop generator creates randomized part-machine matrices. It can also calculate
the required number of machines of each type and their utilizations, and produce
machine sequences with and without backtracks. A unique feature of the generator is
that it does not create part-machine data by reshuffling matrices with known block
structures (i.e. the solution to the cell formation problem is unknown). Rather,
data characteristics of the shop(s) to be cellularized are entered into the
generator as input parameters. These parameters can be either hypothetical or based
on typical characteristics found in industrial manufacturing data bases. The shop
generator software, programmed in Turbo Pascal, and a user's manual are available
from the second author. © 1994 Taylor & Francis Group, LLC.
REFERENCES: Burbidge, J., Production flow analysis (1971) Production Engineer, 50
(4-5), pp. 139-152;
Burbidge, J., Production flow analysis on the computer (1973) Proceedings of the
Third Annual Conference of the Institution of Production Engineer;
Burbidge, J., (1975) The Introduction of Group Technology, , New York: Wiley);
Burbidge, J., (1989) Production Flow Analysis for Planning Group Technology, ,
Oxford: Clarendon);
Dekleva, J., Menart, D., Advantages and disadvantages of different production cell
identification methods (1985) Proceedings of the Second IF IP Conferences, ,
Budapest, Hungary;
Gongaware, T., Ham, I., Cluster analysis application for group technology
manufacturing systems (1981) Proceedings of Ninth North American Metal Working
Research Conference, , Dearborn, Michigan;
Kandiixer, L., Onur, L., (1989) A Hypothetical Problem Generator for Evaluating
Part Family Machine Group Formation Techniques, , Research Report, IEOR-8906,
Bilkent University, Turkey;
Miltenburg, J., Zhang, W., A comparative evaluation of algorithms for solving the
machine-component grouping problem in group technology (1991) Journal of Operations
Tarsuslugil, M., Bioor, J., The use of similarity coefficient and cluster analysis
in production flow analysis (1979) Proceedings of 20Th International Mtd&R
Conference, pp. 525-532., Birmingham;
CORRESPONDENCE ADDRESS: Park, Y.-T.; Korea Institute of Science and Technology, PO
Box 255, Cheongryang, Seoul, 130-650, South Korea
ISSN: 00207543
SOURCE: Scopus

16417373200;26430357400;23025569300;35615315700;
Multi-objective cell formation and production planning in dynamic virtual cellular
41 times.
80052985872&doi=10.1080%2f00207543.2010.524902&partnerID=40&md5=69a7b8264668da2aed7
cd1a0d430c905
DOI: 10.1080/00207543.2010.524902
ABSTRACT: This article presents a fuzzy goal programming-based approach for solving
a multi-objective mathematical model of cell formation problem and production
planning in a dynamic virtual cellular manufacturing system. In a dynamic
environment, the product mix and part demand change over a planning horizon
decomposed into several time periods. Thus, the cell formation done for one period
may be no longer efficient for subsequent periods and hence reconfiguration of
cells is required. Due to the variation of demand and necessity of reconfiguration
of cells, the virtual cellular manufacturing (VCM) concept has been proposed by
researchers to utilise the benefits of cellular manufacturing without
reconfiguration charges. In a VCM system, machines, parts and workers are
temporarily grouped for one period during which machines and workers of a group
dedicatedly serve the parts of that group. The only difference of VCM with a real
CM is that machines of the same group are not necessarily brought to a physical
proximity in VCM. The virtual cells are created periodically depending on changes
in demand volumes and mix, as new parts accumulate during a planning horizon. The
major advantage of the proposed model is the consideration of demand and part mix
variation over a multi-period planning horizon with worker flexibility. The aim is
to minimise holding cost, backorder cost and exceptional elements in a cubic space
of machine-part-worker incidence matrix. To illustrate the applicability of the
proposed model, an example has been solved and computational results are presented.
© 2011 Taylor & Francis.
AUTHOR KEYWORDS: dynamic virtual cellular manufacturing system; exceptional
elements; fuzzy goal programming; production planning; worker flexibility
INDEX KEYWORDS: Exceptional elements; Fuzzy goal programming; production planning;
Virtual cellular manufacturing system; worker flexibility, Cells; Computer
programming; Mathematical models; Mathematical programming; Multiobjective
optimization; Planning; Production control; Production engineering; Project
management, Cellular manufacturing
REFERENCES: Abd El-Wahed, W.F., Lee, S.M., Interactive fuzzy goal programming for
multi-objective transportation problems (2006) Omega, 34 (2), pp. 58-166;
pp. 516-530., DOI 10.1108/17410380510600491;
S0377221705009045;
pp. 2597-2618;
139-152;
S0925527306000995;
10.1016/j.ejor.2007.02.040, PII S037722170700272X;
Eski, O., Ozkarahan, H., Design of manufacturing cells for uncertain production
requirements with presence of routing flexibility (2007) Lecture Notes in Computer
Science, Advanced Intelligent Computing Theories and Applications with Aspects of
Artificial Intelligence, pp. 670-681., Berlin, Heidelberg: Springer-Verlag;
Javadi, B., Solving a multi-objective mixed-model assembly line sequencing problem
by a fuzzy goal programming approach (2007) The International Journal of Advanced
Manufacturing Technology, , doi: 10.1007/s00170-007-1267-6;
Kesen, S.E., Analyzing the behaviors of virtual cells (VCs) and traditional
manufacturing systems: Ant colony optimization (ACO)-based metamodels (2009)
group technology (2003) International Journal of Production Economics, 86 (2), pp.
121-131;
Mahdavi, I., A new approach on cellular manufacturing system based on machine
partworker incidence matrix 2009 (2009) The Fourth GT/CM Symposium on Group
Technology and Cellular Manufacturing (GT/CM 2009), , 16-18 February 2009,
Kitakyushu, Japan;
Proceedings of the Fourth IFAC/IFIP Conference on in Formation Control Problems in
Manufacturing Technology, pp. 1-9., October 1982, Gaithersburg, MD;
Mishra, S., A fuzzy goal-programming model of machine-tool selection and operation
allocation problem in FMS (2006) International Journal of Production Research, 44
(2), pp. 43-47;
Spa, Yorks, UK: National Lending Library Translation;
cellular manufacturing systems (1992) American Production & Inventory Control
Society Conference, pp. 410-414., 4-5 October, Quebec, Montreal;
Uncertain Production Requirements with Presence of Routing Flexibility, , Thesis
PhD. Virginia Polytechnic Institute and State University, Blackburg, VA;
Narasimhan, R., Goal programming in a fuzzy environment (1980) Decision Sciences,
11 (2), pp. 325-326;
2358;
manufacturing cells (2001) Integrated Manufacturing Systems, 12 (4), pp. 306-315.,
DOI 10.1108/09576060110393406;
Engineering, 29 (4-13), pp. 221-225;
reconfiguration of cellular manufacturing systems using virtual cells (2002)
Production Planning and Control, 13 (4), pp. 381-393., DOI
10.1080/09537280210130478;
10.1016/j.ejor.2006.12.058, PII S0377221707000811;
52 (6), pp. 673-681;
Selim, H., Araz, C., Ozkarahan, I., Collaborative production-distribution planning
in supply chain: A fuzzy goal programming approach (2008) Transportation Research
Part E: Logistics and Transportation Review, 44 (3), pp. 396-419;
S0736584504001036;
S0096300305000238;
Tsai, W.H., Hung, S.J., A fuzzy goal programming approach for green supply chain
optimisation under activity-based costing and performance evaluation with a value-
chain structure (2009) International Journal of Production Research, 47 (18), pp.
4991-5017;
Manufacturing Systems, 11 (3), pp. 291-314., DOI 10.1023/A:1008117329327;
part populations (1999) IIE Transactions, 31 (1), pp. 11-20;
Yang, T., Ignizio, J.P., Kim, H.-J., Fuzzy programming with nonlinear membership
functions. Piecewise linear approximation (1991) Fuzzy Sets and Systems, 41 (1),
pp. 39-53., DOI 10.1016/0165-0114(91)90156-K;
functions (1978) Fuzzy Sets and Systems, 1 (1), pp. 45-55
[email protected]
ISSN: 00207543
CODEN: IJPRB
SOURCE: Scopus
Logendran, R., Ramakrishna, P.

57207586498;55480831700;
Manufacturing cell formation in the presence of lot splitting and multiple units of
the same machine
times.
0009552265&doi=10.1080%2f00207549508930173&partnerID=40&md5=840cf6f744c04874a87d49d
f8ff7f6b7
DOI: 10.1080/00207549508930173
AFFILIATIONS: Department of Industrial and Manufacturing Engineering, Oregon State
University, Corvallis, OR, 97331, United States
ABSTRACT: We present a realistic cell formation problem in the design of cellular
manufacturing systems which includes three important features. First, when multiple
units of a machine type are considered due to processing time requirements, the
model accounts for assigning the units to different cells if such an assignment
contributes to reducing material handling costs. Second, the model accounts for the
possibility of performing two or more nonconsecutive operations of a part on the
same machine. Finally, the model allows for splitting the lot into two if the total
workload required of a part's operation on a machine exceeded its daily unit
capacity expressed in manned hours. We refer to this feature as ‘lot splitting’.
Consequently, the operation required of each split lot of the part can be performed
on a separate unit (machine). The model formulated for the problem falls into the
class of generalized quadratic binary programming models. As the problem is shown
NP-hard in the strong sense, a higher level heuristic algorithm based upon a
concept known as tabu search is presented. Results obtained from solving an example
problem demonstrate the application of the proposed algorithm when either of the
two features—lot splitting or nonconsecutive operations, exist. The applicability
of the proposed algorithm has further been extended to solving a test problem
consisting of both features—lot splitting and non-consecutive operations. The
results obtained show a reduction of ⩽ 50% in total moves (material handling
costs) between the initial solution and the final best solution. © 1995 Taylor &
Francis Group, LLC.
Research, 25, pp. 639-665;
Burbidge, J.L., (1975) The Introduction to Group Technology, , New York: Wiley);
Theory of Np-Completeness, , New York: Freeman);
Glover, F., Tabu search: A tutorial Interfaces, 20, pp. 74-94., 990;
Hyer, N.K., Wemmerlov, U., Group technology in US manufacturing industry: A survey
of current practices (1989) International Journal of Production Research, 27, pp.
1287-1304;
Research, 18, pp. 213-232;
397;
Logendran, R., A workload-based model for minimizing total intercell and intracell
Research, 28, pp. 913-925;
Logendran, R., Ramakrishna, P., Sriskandarajah, C., Design of manufacturing cells

via babu search (1992) Proceedings of the Second International Conference on
Flexible Automation and Information Management, pp. 663-664., Falls Church, VA;
51, pp. 53-57;
567-579;
group technololgy (1986) IIE Transactions, 18 (3), pp. 271-277;
Waghodekar, P.H., Sahu, S., Machine component cell formation in GT: MACE (1984)
CORRESPONDENCE ADDRESS: Logendran, R.; Department of Industrial and Manufacturing
Engineering, Oregon State University, Corvallis, OR, 97331, United States
ISSN: 00207543
SOURCE: Scopus
Ghosh, T., Doloi, B., Dan, P.K.

52163539500;6508202513;26325403400;
Applying soft-computing techniques in solving dynamic multi-objective layout
problems in cellular manufacturing system
84949489296&doi=10.1007%2fs00170-015-8070-
6&partnerID=40&md5=9bba3b19f43dc9cd6e9684debe12f004
DOI: 10.1007/s00170-015-8070-6
AFFILIATIONS: Production Engineering Department, Jadavpur University, 188, Raja S.
C. Mullick Road, Kolkata, 700032, India;
Rajendra Mishra School of Engineering Entrepreneurship, IIT Kharagpur, Kharagpur,
721302, India
ABSTRACT: The formation of machine cells to process subsequent part families is not
the only goal of the designing of an efficient cellular manufacturing system (CMS).
A competent layout of the newly acquired cells is also essential to restrict the
total inter-cell material handling cost which is primarily significant with large
production volume. Furthermore, in realistic industrial scenario, the uncertainty
of product demand can influence the layout configuration to be altered from period
to period. Albeit there are numerous articles exist in the domain of CMS research
considering cell formation problems, layout issues have not been addressed
significantly. Therefore, the aim of our paper is to portray a reformed
mathematical model of the inter-cell layout design problem in dynamic production
situation considering material handling cost and a modified proximity relationship
of manufacturing cells. The proposed Quadratic Assignment Programming (QAP) model
is combinatorial in nature and is difficult to solve using traditional exact
solution methods. The state-of-the-art soft-computing techniques are extremely
advantageous for such QAP paradigms. Thus, we developed an improved genetic
algorithm (IGA) and a simulated annealing heuristic (SAH) to sort out the
abovementioned problem. Due to the inadequacy of datasets, we formed small to large
size test problems (6 × 6 × 2 to 24 × 24 × 10) in logical way to cater the purpose.
The proposed algorithms are successfully employed to attain near-optimal solutions
to the test problems. Computational results demonstrate the proficiency of the IGA
over SAH for all the test problems in terms of solution quality and computational
time. In addition, we conducted a statistical data analysis to validate the test
results. © 2015, Springer-Verlag London.
AUTHOR KEYWORDS: Genetic algorithm; Inter-cell material flow; Material handling;
Multi-objective cellular layout; Production uncertainty; Proximity factor;
Simulated annealing
Materials handling; Simulated annealing; Soft computing, Cell materials; Cellular
layout; Material handling; Production uncertainty; Proximity factors, Cellular
manufacturing
REFERENCES: Burbidge, J.L., A manual method of production flow analysis (1977)
review evaluation and directions for future research (1998) Comput Ind Eng, 34, pp.
3-20;
Won, Y., Currie, K.R., Fuzzy ART/RRR-RSS: a two-phase neural network algorithm for
part-machine grouping in cellular manufacturing (2007) Int J Prod Res, 45, pp.
2073-2104;
Trans, 29, pp. 561-571;
Kulkarni PC, Shanker K (2007) A genetic algorithm for layout problems in cellular
manufacturing systems. Proceedings of the 2007 I.E. IEEM pp 694–698; Balakrishnan,
J., Cheng, C.H., The dynamic plant layout problem: incorporating rolling horizons
and forecast uncertainty (2009) Omega, 37, pp. 165-177;
Kaufman, L., Broeckx, F., An algorithm for the quadratic assignment problem using
benders’ decomposition (1978) Eur J Oper Res, 2, pp. 207-211;
Fortenberry, J.C., Cox, J.F., Multiple criteria approach to the facility layout
problem (1985) Int J Prod Res, 23, pp. 773-782;
Urban, T.L., A multiple criteria model for the facility layout problem (1987) Int J
Prod Res, 25, pp. 1805-1812;
Harmonosky, C.M., Tothero, G.K., A multi-factor plant layout methodology (1992) Int
J Prod Res, 30, pp. 1773-1789;
Nicol, L.M., Hollier, R.H., Plant layout in practice (1983) Material Flow, 1, pp.
177-188;
Rosenblatt, J.M., The dynamics of plant layouts (1986) Manag Sci, 32, pp. 76-86;
Pillai, M.V., Hunagund, I.B., Krishnan, K.K., Design of robust layout for dynamic
plant layout problems (2011) Comput Ind Eng, 61, pp. 813-823;
Ripon, K.S.N., Glette, K., Koch, D., Hovin, M., Torresen, J., Genetic algorithm
using a modified backward pass heuristic for the dynamic facility layout problem
(2012) PALADYN;
Lacksonen, T.A., Enscore, E.E., Quadratic assignment algorithms for the dynamic
layout problems (1993) Int J Prod Res, 31, pp. 503-517;
Kaku, K.B., Mazzola, J.B., A tabu search heuristic for the dynamic plant layout
problem (1997) INFORMS J Comput, 9, pp. 374-384;
Urban, T.L., Solution procedures for the dynamic facility layout problem (1998) Ann
Oper Res, 76, pp. 323-342;
Sahin, R., Ertogral, K., Türkbey, O., A simulated annealing heuristic for the
dynamic layout problem with budget constraint (2010) Comput Ind Eng, 59, pp. 308-
313;
Ripon, K.S.N., Glette, K., Hovin, M., Torresen, J., An adaptive local search based
genetic algorithm for solving multi- objective facility layout problem (2010)
Neural information processing: theory and algorithms, lecture notes in computer
science, 6443, pp. 540-550;
Alfa, A.S., Chen, M., Heragu, S.S., Integrating the grouping and layout problems in
cellular manufacturing systems (1992) Comput Ind Eng, 23, pp. 55-58;
Sarker, B.R., Yu, J.A., Two-phase procedure for duplicating bottleneck machines in
a linear layout, cellular manufacturing system (1994) Int J Prod Res, 32, pp. 2049-
2067;
Tang, C., Abdel-Malek, L.L., A framework for hierarchical interactive generation of
cellular layout (1996) Int J Prod Res, 34, pp. 2133-2163;
Lee, S.D., Configuring layout for a cellular manufacturing system (1998) Int J Syst
Sci, 29, pp. 557-564;
Salum, L., The cellular manufacturing layout problem (2000) Int J Prod Res, 38, pp.
1053-1069;
Chan, W.M., Chan, C.Y., Kwong, C.K., Development of the MAIN algorithm for a
cellular manufacturing machine layout (2004) Int J Prod Res, 42, pp. 51-65;
inter-cell layout problem in cellular manufacturing (2004) Eur J Oper Res, 157, pp.
592-606;
Wu, X., Chu, C.-H., Wang, Y., Yan, W., Concurrent design of cellular manufacturing
systems: a genetic algorithm approach (2006) Int J Prod Res, 44, pp. 1217-1241;
217-238;
Appl Math Comput, 184, pp. 721-728;
488-497;
based on TOPSIS method (2009) Comput Oper Res, 36, pp. 1478-1496;
manufacturing systems (2009) J Manuf Syst, 28, pp. 132-139;
Ma H, Zhang D (2010) The dynamics facility layout study based on cellular
manufacturing, 2010 I.E. International Conference on Measuring Technology and
Mechatronics Automation pp 862–865; Jolai, F., Taghipour, M., Javadi, B., A
variable neighborhood binary particle swarm algorithm for cell layout problem
Leno, I.J., Sankar, S.S., Raj, M.V., Ponnambalam, S.G., Bi-criteria optimization in
integrated layout design of cellular manufacturing systems using a genetic
algorithm, SEMCCO 2011 (2011) Lect Notes Comput Sci, 7076, pp. 323-331;
layout and operations scheduling (2011) Int J Adv Manuf Technol;
Chen, C.W., Sha, D.Y., A design approach to the multi-objective facility layout
problem (1999) Int J Prod Res, 37, pp. 1175-1196;
Darwin, C., The origin of species by means of natural selection or the preservation
of favored races in the struggle for life, New York (1929) The Book League of
America (originally published in, p. 1859;
Fisher, R.A., (1930) The genetical theory of natural selection, , Clarendon,
Oxford;
Holland, J.H., (1975) Adaptation in natural and artificial systems, , University of
Goldberg, D.E., Genetic algorithms in search optimization & machine learning (1989)
Addison Wesley;
Gen, M., (2000) Cheng R, , Genetic algorithms and engineering optimization, Wiley;
Aarts, E., Korst, J., (1990) Simulated annealing and the Boltzmann machine, ,
Wiley, New York;
Mitchell, M., (1999) An introduction to genetic algorithms, , A Bradford Book. The
MIT Press, Cambridge;
Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P., Optimization by simulated
Souilah, A., Simulated annealing for manufacturing systems layout design (1995) Eur
J Oper Res, 82, pp. 592-614;
Balakrishnan, J., Cheng, C.H., Conway, D.G., Lau, C.M., A hybrid genetic algorithm
for the dynamic plant layout problem (2003) Int J Prod Econ, 86, pp. 107-120;
Kuppusamy, S., (2001) Simulated annealing heuristics for the dynamic facility
layout problem, , Master’s Thesis: West Virginia University;
Shang, J., (2002) Ant colony heuristics for the dynamic facility layout problem, ,
Master’s Thesis: West Virginia University;
Singh, S.P., Sharma, R.R.K., Two-level modified simulated annealing based approach
for solving facility layout problem (2008) Int J Prod Res, 46 (13), pp. 3563-3582;
Kratica, J., Tosic, D., Filipovic, V., Dugosija, D., A new genetic representation
for quadratic assignment problem (2011) Yugoslav J Oper Res, 21 (2), pp. 225-238
CORRESPONDENCE ADDRESS: Ghosh, T.; Production Engineering Department, Jadavpur
University, 188, Raja S. C. Mullick Road, India; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Chien-Ta Bruce, C.T.B., Lenny Koh, S.C., Kay Mahamaneerat, W.

57191763170;57133859200;57191763162;
Domain-concept association rules mining for large-scale and complex cellular
manufacturing tasks
(2007) Journal of Manufacturing Technology Management, 18 (7), pp. 787-806. Cited 6
times.
34548463049&doi=10.1108%2f17410380710817255&partnerID=40&md5=8f875121ad14348d41ccad
cef1d4fae6
DOI: 10.1108/17410380710817255
AFFILIATIONS: Computer Science Department, University of Missouri, Columbia,
Missouri, United States
ABSTRACT: Purpose The purpose of this paper is to provide a novel domain-concept
association rules (DCAR) mining algorithm that offers solutions to complex cell
formation problems, which consist of a non-binary machine-component (MC) matrix and
production factors for fast and accurate decision support. Design-methodology-
approach The DCAR algorithm first identifies the domain-concept from the demand
history and then performs association rule mining to find associations among
machines. After that, the algorithm forms machine-cells with a series of inclusion
and exclusion processes to minimize inter-cell material movement and intra-cell
void element costs as well as to maximize the grouping efficacy with the
constraints of bill of material (BOM) and the maximum number of machines allowed
for each cell. Findings The DCAR algorithm delivers either comparable or better
results than the existing approaches using known binary datasets. The paper
demonstrates that the DCAR can obtain satisfying machine-cells with production
costs when extra parameters are needed. Research limitations-implications The DCAR
algorithm adapts the idea of the sequential forward floating selection (SFFS) to
iteratively evaluate and arrange machine-cells until the result is stabilized. The
SFFS is an improvement over a greedy version of the algorithm, but can only ensure
sub-optimal solutions. Practical implications – The DCAR algorithm considers a wide
range of production parameters, which make the algorithm suitable to the real-world
manufacturing system settings. Originality-value The proposed DCAR algorithm is
unlike other array-based algorithms. It can group non-binary MC matrix with
considerations of real-world factors including product demand, BOM, costs, and
maximum number of machines allowed for each cell. © 2007, Emerald Group Publishing
Limited
AUTHOR KEYWORDS: Product life cycle; Research; Small to medium-sized enterprises;
Supply chain management
INDEX KEYWORDS: Algorithms; Cellular manufacturing; Flexible manufacturing systems;
Group technology, Bill of material (BOM); Binary datasets; Domain concept
association rules (DCAR); Sequential forward floating selection (SFFS), Data mining
REFERENCES: Agrawal, R., Imieliaski, T., Swami, A., Mining association rules
between sets of items in large databases (1993) Proceedings of the 1993 ACM-SIGMOD
International Conference on Management of Data, pp. 207-216;
Systems, , Wiley New York, NY;
pp. 516-530;
pp. 2097-2116;
Burbidge, J.L., Production flow analysis (1963) Production Engineering, 42, pp.
742-752;
Burbidge, J.L., (1975) The Introduction of Group Technology, , Wiley New York, NY;
Research, 24 (2), pp. 451-464;
Research, 24 (5), pp. 1221-1233;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC – an algorithm for concurrent
formation: incorporation of machine flexibility and machine aggregation (2004)
Proceedings of the Institution of Mechanical Engineers, Part B Engineering
Manufacture, 218 (10), pp. 1279-1296;
Chang, O.K., Baek, J-G., Baek, J-K., A two-phase heuristic algorithm for cell
Chen, M.C., Configuration of cellular manufacturing systems using association rule
induction (2003) International Journal of Production Research, 41 (2), pp. 381-395;
Research, 36 (5), pp. 1325-1337;
Chu, C-H., Hayya, J.C., A fuzzy-clustering approach to manufacturing cell formation
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., Greedy algorithms (1998)
Introduction to Algorithms, pp. 329-355., 2nd ed. McGraw-Hill St Louis, MO;
– an analysis of their performance (1991) Computers & Industrial Engineering, 20
(4), pp. 461-468;
(1), pp. 47-64;
Joines, J.A., Culbreth, C.T., King, R.E., Manufacturing cell design: an integer
programming model employing genetic algorithms (1996) IIE transactions, 28 (1), pp.
69-85;
Research, 18 (2), pp. 117-133;
reorganization by clustering techniques (1972) Operations Research, 20 (5), pp.
993-1009;
Pudil, P., Novovičová, J., Kittler, J., Floating search methods in feature
selection (1994) Pattern Recognition Letters, 15, pp. 1119-1125;
Santos, N.R., Araújo, L.O., Jr., Computational system for group technology – PFA
case study (2003) Integrated Manufacturing Systems, 14 (2), pp. 138-152;
Seifoddini, H., Single linkage vs average linkage clustering in machine cells
formation application (1989) Computers & Industrial Engineering, 16 (3), pp. 419-
426;
Selim, H.M., Abdel Aal, R.M.S., Mahdi, A.I., Formation of machine group and part
families: a modified SLC method and comparative study (2003) Integrated
Sofianopoulou, S., Manufacturing cells efficiency evaluation using data envelopment
analysis (2006) Journal of Manufacturing Technology Management, 17 (2), pp. 224-
238;
Srinivasan, G., Narendran, T.T., GRAFICS – a non-hierarchical clustering algorithm
pp. 463-478;
genetic algorithm (2004) Journal of Manufacturing Technology Management, 15 (6),
pp. 433-444;
Zolfaghari, S., Roa, E.V.L., Cellular manufacturing versus a hybrid system: a
comparative study (2006) Journal of Manufacturing Technology Management, 17 (7),
pp. 942-961
ISSN: 1741038X
ABBREVIATED SOURCE TITLE: J. Manuf. Technol. Manage.
SOURCE: Scopus
Logendran, R., Ramakrjshna, P., Sriskandarajah, C.

57207586498;57030553800;7004614677;
Tabu search-based heuristics for cellular manufacturing systems in the presence of
alternative process plans
times.
0028377447&doi=10.1080%2f00207549408956933&partnerID=40&md5=148da1d9ab5503ed91b1191
391f834cb
DOI: 10.1080/00207549408956933
AFFILIATIONS: Department of Industrial and Manufacturing Engineering, Oregon State
University, Covell Hall 118, Corvallis, OR, 97331, United States;
Department of Industrial Engineering, University of Toronto, Toronto, M5S 1A4,
Canada
ABSTRACT: When alternative process plans are considered in cellular manufacturing
systems, there is potential for performing an operation required of a part on
alternative machines. Under these circumstances, the cell formation problem of
determining the assignment of parts and machines to each manufacturing cell can be
viewed as being divided into two phases. The first phase deals with the problem of
determining the number of machines of each type and a unique process plan for each
part. In the second phase, the assignment of parts and machines to each
manufacturing cell should be determined. This research examines the first-phase
problem. A realistic formulation of the model is presented when the product-part
mixes are stable over the planning horizon. As the problem is proven NP-hard in the
strong sense, two different higher-level heuristics, based upon a concept known as
tabu search, are presented. Each heuristic is further extended into two methods: 1
and 2. An extensive statistical analysis, based upon randomized block design, has
been conducted to compare the performances of the heuristics. In three different
problem structures attempted with a block size of 10, the results obtained show the
superior performance of heuristic 2 over 1 with both methods. This further
substantiates the fact that there is clearly a need for efficient heuristics to
solve problems in manufacturing cell design that have any practical significance
and one cannot rely on an exhaustive search algorithm such as the branch-and-bound
technique incorporated in packaged software (LINDO and MPSX/M1P 370) as indicated
in some of the published literature. © 1994 Taylor & Francis Group, LLC.
INDEX KEYWORDS: Algorithms; Computational complexity; Computer software; Heuristic
methods; Mathematical models; Process control; Random processes; Statistical
methods; Systems analysis, Alternative process plans; Branch and bound algorithm;
Cellular manufacturing systems; Randomized block design; Software package LINDO;
Software package MPSX/MIP 370; Tabu search based heuristics, Computer aided
manufacturing
Production Research, 28 (8), 1555p;
Research, 25 (5), pp. 639-665;
Burftidge, J.L., (1975) 7He Introduction to Group Technology, , New York: Wiley;
Ciioobinrh, F., A framework for the design of cellular manufacturing systems (1988)
Garhy, M.R., Johnson, D.S., (1979) Computers and ¡nteractability: A Guide to the
Theory of Np-Completeness, , New York: Freeman;
Glover, F., Tabu search, Part I (1989) ORSA Journal on Computing, 1, pp. 190-206;
Glover, F., Tabu search, Part II (1990) ORSA Journal of Computing, 2, pp. 4-32;
Glover, F., Tabu scarch: A tutorial (1990) Interfaces, 20, pp. 74-94;
Hyer, N.K., Wemmerlov, U., Group technology in US manufacturing industry: A survey
of current practices (1989) International Journal of Production Research, 27, pp.
1287-1304;
Research, 18, pp. 213-232;
91;
Research, 28, pp. 913-925;
Logendran, R., Effcct of alternative process plans in manufacturingcell design:

Complexity issues (1992) Proceedings of the 18Th Annual National Science Foundation
Grantees' Conference on Design and Manufacturing Systems Research, pp. 885-889.,
Atlanta,, G A. 8-10 January 1992 (Dearborn, MN: SME);
Logendran, R., Ramakrishna, P., Sriskandarajah, C., Design of manufacturing cells
via tabu search (1992) Proceedings of the Second International Conference on
Flexible Automation and Information Management, pp. 633-644., Falls Church, VA, 30
June-2 July 1992 (Boca Raton, FL: CRC Press);
51 (2), pp. 53-57;
Montgomery, D.C., (1991) Design and Analysis of Experiments, , New York: Wiley;
Research, 28, pp. 2243-2257;
Rajamani, D., Singh, N., Anfja, Y.P., Integrated design of cellular manufacturing
(1988), Rockville, MD: Statistical Graphics Corporation, Inc; Tabucanon, M.T.,
Ojha, R., ICRMA—a heuristic approach for intercell flow reduction in ccllular
manufacturing (1987) Material Flow, 4, pp. 189-197
CORRESPONDENCE ADDRESS: Logendran, R.; Department of Industrial and Manufacturing
Engineering, Oregon State University, Covell Hall 118, Corvallis, OR, 97331, United
States
ISSN: 00207543
SOURCE: Scopus
Saxena, L.K., Jain, P.K.

36191976500;7402520507;
Dynamic cellular manufacturing systems design - A comprehensive model
79955612470&doi=10.1007%2fs00170-010-2842-
9&partnerID=40&md5=fbf1f05ee2683221e571c0f7c2e9ac7e
DOI: 10.1007/s00170-010-2842-9
AFFILIATIONS: Department of Mechanical Engineering, Jamia Millia Islamia, New Delhi
110025, India;
Department of Mechanical and Industrial Engineering, Indian Institute of Technology
Roorkee, Roorkee, India
ABSTRACT: This paper addresses the dynamic cell formation problem (DCF). In dynamic
environment, the product demand and mix changes in each period of a multiperiod
planning horizon. It causes need of reconfiguration of cells to respond to the
product demand and mix change in each period. This paper proposes a mixed-integer
nonlinear programming model to design the dynamic cellular manufacturing systems
(DCMSs) under dynamic environment. The proposed model, to the best of the author's
knowledge, is the most comprehensive model to date with more integrated approach to
the DCMSs. The proposed DCMS model integrates concurrently the important
manufacturing attributes in existing models in a single model such as machine
breakdown effect in terms of machine repair cost effect and production time loss
cost effect to incorporate reliability modeling; production planning in terms of
part inventory holding, part internal production cost, and part outsourcing;
process batch size; transfer batch size for intracell travel; transfer batch size
for intercell travel; lot splitting; alternative process plan, and routing and
sequence of operation; multiple copies of identical copies; machine capacity,
cutting tooling requirements, work load balancing, and machine in different cells
constraint; machine in same cell constraint; and machine procurements and multiple
period dynamic cell reconfiguration. Further, the objective of the proposed model
is to minimize the sum of various costs such as intracell movement costs; intercell
movement costs and machine procurement costs; setup cost; cutting tool consumption
costs; machine operation costs; production planning-related costs such as internal
part production cost, part holding costs, and subcontracting costs; system
reconfiguration costs; and machine breakdown repair cost, production time loss cost
due to machine breakdown, machine maintenance overheads, etc.,in an integrated
manner. Nonlinear terms of objective functions are transformed into linear terms to
make mixed-integer linear programming model. The proposed model has been
demonstrated with several problems, and results have been presented accordingly.
AUTHOR KEYWORDS: Alternative routings; Breakdown effects; Lot splitting; Mixed-
integer programming DCMS; Production planning-part held outsourcing; Transfer
batch size; Work load balancing
INDEX KEYWORDS: Alternative routings; Breakdown effects; Lot splitting; Mixed-
Integer Programming; Production planning-part held outsourcing; Transfer batch
size; Work load balancing, Cellular manufacturing; Dynamic models; Integer
programming; Linear programming; Machine shop practice; Outsourcing; Parallel
architectures; Planning; Production control; Production engineering; Project
management; Repair; Systems analysis, Costs
REFERENCES: Ahkioon, S., Bulgak, A.A., Bektas, T., Cellular manufacturing system
design with routing flexibility, machine procurement, production planning & dynamic
system reconfiguration (2009) Int J Prod Res, 47 (6), pp. 1573-1600;
Ahkioon, S., Bulgak, A.A., Bektas, T., Integrated cellular manufacturing system
design with production planning & dynamic system reconfiguration (2009) Eur J Oper
Res, 192, pp. 414-428;
2347., DOI 10.1080/00207540050028124;
problem (1997) Computers and Industrial Engineering, 32 (1), pp. 169-185;
Alkan, M., Erkman, A.M., Erkman, I., Fuzzy dynamic programming (1994) Proc Med
Elecrotechnical Conf, 2, pp. 723-726;
Int J Prod Res, 29, pp. 1081-1100;
Askin, R.G., Vakharia, A.J., Group technology-cell formation and operation (1991)
The Automated Factory Handbook: Technology and Management, pp. 317-366., Cleland
DI, Bidanda B (eds). TAB Books, New York;
Asokan, P., Prabhakaran, G., Satheesh Kumar, G., Machine-cell grouping in cellular
manufacturing systems using non-traditional optimisation techniques - A comparative
study (2001) International Journal of Advanced Manufacturing Technology, 18 (2),
pp. 140-147., DOI 10.1007/s001700170085;
S0377221705009045;
pp. 516-530., DOI 10.1108/17410380510600491;
Barker, A., Group technology and machining cells in the small-batch production
valves (1970) Mach Prod Eng, 116, pp. 2-6;
10.1108/09576060110392560;
(1991) Int J Prod Res, 29, pp. 343-356;
21-37., DOI 10.1016/S0305-0548(02)00144-2, PII S0305054802001442;
Econ, 64, pp. 179-284;
cellular manufacturing (1982) J Manuf Syst, 1, pp. 65-74;
Chandrasekharan, M.P., Rajagopalan, R., ZODIAC - AN ALGORITHM FOR CONCURRENT
FORMATION OF PART-FAMILIES AND MACHINE-CELLS. (1987) International Journal of
of binary data for group technology (1989) Int J Prod Res, 27, pp. 1035-1052;
cellular manufacturing environment (1998) Ann Oper Res, 74, pp. 109-128;
cells in group technology (1994) Eur J Oper Res, 75, pp. 100-111;
problem in group technology (1996) Journal of the Operational Research Society, 47
(6), pp. 794-802;
De Beer, C., De Witte, J., Production flow synthesis (1978) CIRP Annals, 27, pp.
389-392;
S0925527306000995;
Defersha, F.M., Chen, M., Machine Cell formation using a mathematical model and a
genetic-algorithm-based heuristic (2006) Int J Prod Res, 44 (12), pp. 2421-2444;
in cellular manufacturing systems (2007) Int J Prod Res, 46, pp. 6389-6413;
0947-6;
El-Essawy, I.F.K., Torrance, J., Component flow analysis-an effective approach to
production systems' design (1972) Prod Eng, 51, p. 165;
design: Benders' decomposition approach (1998) European Journal of Operational
Research, 107 (1), pp. 175-192., PII S0377221797002567;
Jabal Ameli, M.S., Arkat, J., Barzinpour, F., Modeling the effect of machine
breakdowns in the generalized cell formation (2008) Int J Adv Manuf Tech, 39, pp.
838-850;
Jayaswal, S., Adilz, G., Efficient algorithm for cell formation with sequence data,
machine replications and alternative process routings (2004) Int J Prod Res, 42,
pp. 2419-2433;
oriented manufacturing cell formation techniques (1996) Int J Flex Autom Intell
Manuf, 3 (3-4), pp. 120-161;
neural network approach (1992) Int J Prod Res, 30, pp. 1353-1367;
Khator, S.K., Irani, S.A., CELL FORMATION IN GROUP TECHNOLOGY: A NEW APPROACH.
(1987) Computers and Industrial Engineering, 12 (2), pp. 131-142., DOI
10.1016/0360-8352(87)90006-4;
Science, 220, pp. 671-680;
Kumar K.Ravi, Kusiak Andrew, Vannelli Anthony, GROUPING OF PARTS AND COMPONENTS IN
FLEXIBLE MANUFACTURING SYSTEMS. (1986) European Journal of Operational Research, 24
(3), pp. 387-397., DOI 10.1016/0377-2217(86)90032-9;
Kusiak, A., Chow, W.S., Decomposition of manufacturing systems (1988) IEEE J Robot
Autom, 4 (5), pp. 457-471;
561-569;
Logendran Rasaratnam, Workload based model for minimizing total intercell and
intracell moves in cellular manufacturing (1990) International Journal of
Logendran, R., Ramakrishna, R., Srikandarajah, C., Tabu search based heuristics for
Lokesh, K., Jain, P.K., Part-machine group formation with operation sequence, time
and production volume (2008) Int J Simul Model, 7 (4), pp. 198-209.,
www.ijsimm.com, doi:10.2507/IJSIMM08(2)3.125;
Lokesh, K., Jain, P.K., Part-Machine group formation with ordinal-ratio level data
and production volume (2009) Int J Simul Model, 8 (2), pp. 90-101., www.ijsimm.com,
doi:10.2507/IJSIMM07(4)4.113;
Lokesh, K., Jain, P.K., Concurrently part-machine group formation with important
production data (2010) Int J Simul Model, 9 (1), pp. 5-16., www.ijsimm.com,
doi:10.2507/IJSIMM09(1)1.133, IJSIMM-133-2009;
Lokesh, K., Jain, P.K., Dynamic cellular manufacturing systems design-a
comprehensive model & HHGA (2010) Advances in Production Engineering & Management
Journal, 5 (3), pp. 151-162., www.apem-journal.org;
474., DOI 10.1016/j.rcim.2005.11.013, PII S0736584506000597;
Lozano, S., Canca, D., Guerrero, F., Garcia, J.M., Machine grouping using sequence-
based similarity coefficients and neural networks (2001) Robotics and Computer-
Integrated Manufacturing, 17 (5), pp. 399-404., DOI 10.1016/S0736-5845(01)00015-1,
PII S0736584501000151;
Research, 38 (5), pp. 1201-1218., DOI 10.1080/002075400189095;
57;
Mitrafanov, S., (1966) Scientific Principles of Group Technology, , National
Lending Library, London;
Nsakanda, A.L., Diaby, M., Price, W.L., Hybrid genetic approach for solving large
scale capacitated cell formation problem with multiple routings (2006) Eur J Oper
Res, 171, pp. 1058-1070;
10.1016/S0360-8352(00)00074-7;
certain constraints (2000) International Journal of Production Economics, 64 (1),
pp. 267-278., DOI 10.1016/S0925-5273(99)00064-X;
Purcheck, G.F.K., Machine-component group formation: A heuristic method for
flexible production cells & flexible manufacturing systems (1985) Int J Prod Res,
23, pp. 911-943;
221-225;
Safaei, N., Saidi-Mehrabad, N., A new model of dynamic cell formation by a neural
approach (2006) Int J Adv Manuf Technol, 33, pp. 1001-1009., doi:10.1007/s00170-
006-0518-2, Online First;
10.1016/j.ejor.2006.12.058, PII S0377221707000811;
Sankaran, S., Multiple objective decision making approach to cell formation a goal
programming model (1990) Math Comput Model, 13, pp. 71-82;
Shafer, S.M., Rogers, D.F., A goal programmi9ng approach to cell formation problems
(1991) J Oper Manage, 10, pp. 28-43;
Oper Res, 69, pp. 284-291;
and Control, , Chapman & Hall, Suffolk;
0862-2;
Sofianopoulou, S., Manufacturing cells design with alternative process zlans and or
1419-1441;
Song, S., Hitomi, K., GT cell formation for minimizing the intercell part flow
(1992) Int J Prod Res, 30 (12), pp. 1029-1036;
Srinivasan, G., Narendran, T., GRAFICS-a nonhierarchical clustering algorithm for
group technology (1991) Int J Prod Res, 29, pp. 463-478., [38];
simulated annealing (1998) Int J Prod Res, 36, pp. 2185-2207;
Sule, D.R., (1994) Manufacturing Facilities: Location, Planning, and Design, , PWS,
Boston;
Eng, 28 (3), pp. 485-494;
multi-period planning horizons of cellular manufacturing systems (1998) Production
S0096300305000238;
formation problem with machine cost and alternative process plan by mimetic
algorithms (2005) Lect Notes Comput Sci, 3777, pp. 213-227;
Tompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A., (2003) Facility
Planning, , Wiley, New York;
Wang, X., Tang, J., Yung, K.L., Optimization of multiobjectives dynamic cell
44, pp. 318-329., doi:10.1007/00170-008-1835-4;
Wei, J.C., Kern, G.M., Commonality analysis: A linear clustering algorithm for
Wemmerlov, U., Hyer, N.L., Procedures for the part family machine group
identification problem in cellular manufacturing (1986) J Oper Manage, 6 (2), pp.
12-147;
434-446;
Research, 38 (2), pp. 385-395., DOI 10.1080/002075400189473
CORRESPONDENCE ADDRESS: Saxena, L. K.; Department of Mechanical Engineering, Jamia
Millia Islamia, New Delhi 110025, India; email: [email protected]
ISSN: 02683768
CODEN: IJATE
SOURCE: Scopus
Arumugam, S., Saral, J.

7006467632;57188880888;
Identification of Bottleneck Elements in Cellular Manufacturing Problem
(2015) Procedia Computer Science, 74, pp. 181-185. Cited 1 time.
84964048447&doi=10.1016%2fj.procs.2015.12.097&partnerID=40&md5=05a24b1f57fd60667b3c
0555edc8f58e
DOI: 10.1016/j.procs.2015.12.097
AFFILIATIONS: National Centre for Advanced Research in Discrete Mathematics,
Kalasalingam University, Anand Nagar, Krishnankoil, Tamil Nadu, 626126, India
ABSTRACT: The cell formation problem which arises in cellular manufacturing can be
formulated in graph theoretic terms. The input for a cellular manufacturing problem
consists of a set X of m machines and a set Y of p parts and an m × p matrix A =
(ai j), where ai j = 1 or 0 according as the part pj is processed on the machine
mi. This data can be represented as a bipartite graph G with bipartition X, Y and
mi is joined to pj if ai j = 1. Let G1, G2,⋯, Gk be nontrivial connected subgraphs
of G such that V(G1), V(G2),⋯, V(Gk) forms a partition of V(G). Then π = {G1, G2,⋯,
Gk} is called a k-cell partition of G. Any edge of G with one end in Gi and the
other end in Gj with i∗j represents an intercellular movement of a part. The set
V(Gi) is called a cell. Any part in a cell which is to be processed by a machine in
another cell is called a bottleneck part and any machine which processes a part in
another cell is called a bottleneck machine. In this paper we use graph theoretic
techniques to develop an efficient algorithm for identifying bottleneck elements
with respect to a given solution of the cellular manufacturing problem. If H is the
subgraph of G induced by the set of all exceptional edges with respect to the cell
partition π, then any vertex of H is a bottleneck element and its degree in H is
the strength of the bottleneck elements. Thus the bottleneck elements of high
strength identified by our algorithm are to be either duplicated if it is a machine
or to be subcontracted if it is a part, in order to ensure a smooth flow in the
manufacturing process. © 2015 The Authors.
AUTHOR KEYWORDS: bipartite graph; bottleneck machine; bottleneck part; cell;
Cellular manufacturing problem; depth first search
INDEX KEYWORDS: Algorithms; Cells; Cytology; Graph theory; Manufacture; Quality
control; Security of data, Bipartite graphs; Bottleneck machines; Bottleneck parts;
Cellular manufacturing problems; Depth first search, Cellular manufacturing
REFERENCES: Ang, D.S., An algorithm for handling exceptional elements in cellular
manufacturing systems (2000) Industrial Management and Data Systems, 100, pp. 251-
254;
2097-2116;
Chow, W.S., Hawaleshka, O., An efficient algorithm for solving machine chaining
problem in cellular manufacturing (1992) Computer and Industrial Engineering, 22,
pp. 95-100;
systems: An integer programming approach (1989) International Journal of Production
Research, 27, pp. 1465-1473;
Kern, G.M., Wei, J.C., The cost of elimination exceptional elements in group
pp. 1535-1547;
King, J.R., Nakornchai, V., A machine-component group formation in group
technology: A review and extension (1982) International Journal of Pro- Duction
Research, 20, pp. 117-133;
Shafer, S., Ken, G., Wei, J., A Mathematical programming approach for dealing with
Tsai, C.C., Chu, C.H., Barta, T., Analysis and modeling of a manufacturing cell
formation problem with fuzzy integer programming (1997) IIE Transac- Tions, 29, pp.
533-547;
formulations (2000) International Journal of Production Research, 38, pp. 1601-1613
EDITORS: Simanjuntak R., Miller M., Baskoro E.T.
ISSN: 18770509
SOURCE: Scopus
Safaei, N., Tavakkoli-Moghaddam, R.

8886880300;56491438400;
An extended fuzzy parametric programming-based approach for designing cellular
manufacturing systems under uncertainty and dynamic conditions
70449556659&doi=10.1080%2f09511920802616773&partnerID=40&md5=1cd0570a02aa9fbd7f498a
771ef865a0
DOI: 10.1080/09511920802616773
Toronto, Toronto, Canada;
Tehran, Iran
ABSTRACT: This paper proposes an extended fuzzy parametric programming (FPP)
approach to solve a dynamic cell formation problem considering the uncertain part
demand and machine capacity. The classical FPP approach gives the decision maker a
number of alternative decisions for different grades of precision. Linear
membership functions such as trapezoid, triangular and other piecewise forms have
widely been used to express the uncertain parameters in the different engineering
fields. Especially, to our best of knowledge, all researches related to the use of
the fuzzy programming-based approaches for cellular manufacturing systems (CMSs)
have been applied to the piecewise membership functions. In the case of lack of
sufficient knowledge, there is a section in the piecewise forms called 'core',
consisting of the fully included members (i.e. members with membership degree equal
to one). This section, which represents the expert's ignorance, is not considered
in the fuzzy programming-based approaches presented in the literature. In a highly
cost-intensive production system, such as cellular manufacturing systems, the
decision maker wants to know how big the changes of the cell configuration from one
period to another are. These changes are caused by the fluctuations in some
parameters of the system, such as part demand and machine capacity. However, when
these parameters are uncertain as well as dynamic, the risk of decision making will
increase significantly. On the other hand, in practice, a domain of uncertainty of
data corresponds to a unique decision and hence the whole uncertainty in the system
can be covered by only a few numbers of the alternative decisions, called
'applicable decisions'. This reduction in the decision space gives a better idea to
the decision maker to make the final decision. The extended FPP proposed in this
paper uses a simple strategy to extract all possible applicable solutions resulting
from the core of the membership functions of the uncertain parameters. To verify
the performance and applicability of the proposed approach, a comprehensive
numerical example is solved and experimental results are presented.
AUTHOR KEYWORDS: Cellular manufacturing system; Dynamic and uncertain environment;
Fuzzy parametric programming; Mixed-integer programming
INDEX KEYWORDS: Cell configurations; Cellular manufacturing system; Cellular
manufacturing systems; Cost-intensive; Decision makers; Decision space; Dynamic
cell formation; Dynamic condition; Engineering fields; Final decision; Fuzzy
parametric programming; Fuzzy programming; Know-how; Membership degrees; Mixed-
integer programming; Numerical example; Parametric programming; Piece-wise;
Production system; Uncertain parameters, Decision making; Dynamic programming;
Fuzzy systems; Integer programming; Membership functions; Microcontrollers;
Uncertainty analysis, Cellular manufacturing
REFERENCES: Arkan, F., Gungor, Z., A parametric model for cell formation and
exceptional elements' problems with fuzzy parameters (2005) Journal of Intelligent
Carlsson, C., Korhonen, P., A parametric approach to fuzzy linear programming
Dubois, D.R., Prade, H., Possibility theory, probability theory and multiple-valued
logics: A clarification (2001) Annals of Mathematics and Artificial Intelligence,
32, pp. 35-66;
Herrera, F., Verdegay, J.L., Zimmermann, H.J., Boolean programming problems with
fuzzy constraints (1993) Fuzzy Sets and Systems, 55 (3), pp. 285-293;
Lai, Y.-J., Hwang, C.-L., (1992) Fuzzy Mathematical Programming: Methods and
Applications, , Heidelberg: Springer-Verlag;
dynamic model for a highly dynamic environment (1995) Computers and Industrial
Engineering, 29 (1-4), pp. 221-225;
Safaei, N., Saidi-Mehrabad, M.S., Tavakkoli-Moghaddam, R., Sassani, F., A fuzzy
programming approach to a cell formation problem with dynamic and uncertain
pp. 2545-2563
CORRESPONDENCE ADDRESS: Safaei, N.; Department of Mechanical and Industrial
Engineering, University of Toronto, Toronto, Canada; email: [email protected]
ISSN: 0951192X
CODEN: ICIME
SOURCE: Scopus
Ahmed, M.U., Ahmed, N.U., Nandkeolyar, U.

7402830884;55432664300;6701651017;
A volume and material handling cost based heuristic for designing cellular
manufacturing cells
6963%2891%2990007-K&partnerID=40&md5=992a15312567a2e15b6876dc1d7920ba
DOI: 10.1016/0272-6963(91)90007-K
ABSTRACT: One of the major problems in a group technology or cellular manufacturing
environment is the formation of part groups and machine cells. Because of the
combinatorial nature of the cell formation problem, it is difficult to solve the
problem optimally. Most of the procedures related to cell design in cellular
manufacturing operate on the part-machine incidence matrix in an attempt to
identify block diagonality. If complete block diagonality does not exist, the
decision about cell configuration is left to the subjective judgement of the
designer. These procedures are also generally based on part routing only, and do
not consider part volume and material handling costs. In this paper we develop an
integer programming model, as well as a heuristic to effectively assign machines to
cells. In these procedures we consider component volumes, costs related to movement
of components between and within cells, and penalty for not using all machines in a
cell visited by a component. Since the integer programming formulation becomes
large even for small problems, an efficient heuristic is developed to solve larger
problems. The heuristic solutions to 180 randomly generated small problems were
compared against the optimal solutions obtained by the integer programming model.
The heuristic has been found to identify optimal solutions in all 180 cases. This
heuristic is also compared to several well known algorithms on 900 larger test
problems. These problems were generated to cover a wide range of environmental
situations such as varying levels of block diagonality in the part-machine
incidence matrix, and diversity in the component volumes and material handling
costs. In 99% of the problems our heuristic generated solutions which are better or
as good as the best solution obtained by other algorithms. Further, in situations
where complete block diagonality in the part-machine incidence matrix did not
exist, our heuristic produced even better results. Since the maximum number of
iterations required in our heuristic is the number of machines in the problem, the
heuristic is computationally efficient. © 1991.
REFERENCES: Askin, Chiu, A Graph Partitioning Procedure for Machine Assignment and
Cell Formation in Group Technology (1990) International Journal of Production
Research, 28 (8), pp. 1555-1572;
Burbidge, (1989) Production Flow Analysis for Planning Group Technology, ,
Clarendon Press, Oxford;
Dahel, (1988) An Optimization Framework for the Cellularization of Manufacturing
Systems, , Illinois Institute of Technology, Chicago, IL, Unpublished Ph.D.
Dissertation;
Greene, Sadowski, A Review of Cellular Manufacturing Assumptions, Advantages and
Design Techniques (1984) Journal of Operations Management, 4 (2), pp. 85-97;
Hyer, Wemmerlöv, MRP/GT A Framework for Production Planning and Control of Cellular
Manufacturing (1982) Decision Sciences, 13, pp. 681-701;
Hyer, The Potential of Group Technology for U.S. Manufacturing (1984) Journal of
Kennedy, A Review of Some Cluster Analysis Methods (1972) A I I E Transactions, 6
(3), pp. 216-227;
Kernigham, Lin, An Efficient Heuristic Procedure for Partitioning Graphs (1970)
Bell System Technical Journal, pp. 291-307;
King, Machine Component Grouping in Production Flow Analysis (1980) International
King, Nakornchai, Machine Component Group Formation in Group Technology Review and
Extensions (1982) International Journal of Production Research, 20 (2), pp. 117-
133;
Kumar, Vannelli, Efficient Algorithms for Grouping Component-Processor Families
(1984) IBM Research Report No. RC 10636, , IBM T.J. Watson Research Center, New
York;
Morris, (1988) Forming Cellular Layout in GT: A Simulation Evaluation of
Alternative Approaches, , The University of Oklahoma, Norman, OK, Unpublished
doctoral dissertation;
McCormick, Schweitzer, White, Problem Decomposition and Data Recognition by a
Mosier, Taube, The Facets of Group Technology and Their Impacts on Implementation—A
State-of-the-Art Survey (1985) Omega, 13 (5), pp. 381-391;
Purcheck, Machine-Component Group Formation: An Heuristic Method for Flexible
Production Cells and Flexible Manufacturing Systems (1985) International Journal of
Robinson, Duckstein, Polyhedral Dynamics As a Tool for Machine-Part Group Formation
Steudel, Ballakur, A Dynamic Programming Based Heuristic for Machine Grouping in
Manufacturing Cell Formation (1987) Computers and Engineering, 12 (3), pp. 215-222;
Suresh, Meredith, Achieving Factory Automation through Group Technology Principles

Wemmerlöv, Comments on the Direct Clustering Algorithm for Group Formation in
Cellular Manufacture (1984) Journal of Manufacturing Systems, 3 (1), pp. vii-ix;
Wemmerlöv, Hyer, Cellular Manufacturing in the U.S. Industry: A Survey of Users
Wu, Venugopal, Barash, Design of a Cellular Manufacturing Systems: A Syntactic
Pattern Recognition Approach (1986) Journal of Manufacturing Systems, 5 (2), pp.
81-87
ISSN: 02726963
CODEN: JOTME
SOURCE: Scopus
Brown, E.C., Sumichrast, R.T.
7404129184;6701865054;
Impact of the replacement heuristic in a grouping genetic algorithm
0548%2802%2900085-0&partnerID=40&md5=a458f3658495f775a5a477de71175d4e
DOI: 10.1016/S0305-0548(02)00085-0
AFFILIATIONS: Business Information Technology, Virginia Tech., 1007 Pamplin Hall,
Blacksburg, VA 24061, United States;
Pamplin College of Business, Virginia Tech., 1044 Pamplin Hall, Blacksburg, VA
ABSTRACT: The grouping genetic algorithm (GGA), developed by Emmanuel Falkenauer,
is a genetic algorithm whose encoding and operators are tailored to suit the
special structure of grouping problems. In particular, the crossover operator for a
GGA involves the development of heuristic procedures to restore group membership to
any entities that may have been displaced by preceding actions of the operator. In
this paper, we present evidence that the success of a GGA is heavily dependent on
the replacement heuristic used as a part of the crossover operator. We demonstrate
this by comparing the performance of a GGA that uses a naïve replacement heuristic
(GGA0) to a GGA that includes an intelligent replacement heuristic (GGACF). We
evaluate both the naïve and intelligent approaches by applying each of the two GGAs
to a well-known grouping problem, the machine-part cell formation problem. The
algorithms are tested on problems from the literature as well as randomly generated
problems. Using two measures of effectiveness, grouping efficiency and grouping
efficacy, our tests demonstrate that adding intelligence to the replacement
heuristic enhances the performance of a GGA, particularly on the larger problems
tested. Since the intelligence of the replacement heuristic is highly dependent on
the particular grouping problem being solved, our research brings into question the
robustness of the GGA. Our research investigates the significance of the
replacement heuristic used as a part of the crossover operator in a grouping
genetic algorithm (GGA). We test two GGAs and compare their replacement heuristics
using test problems from the well-known machine-part cell formation domain. The
purpose of our research is three-fold. First, we compare and contrast the GGA with
standard GA to improve understanding of how they differ in problem representation
and operation. Second, we provide evidence that GGA is limited not only to problems
where the objective is to form groups, but also to problems where it is practical
to incorporate a substantial amount of problem-specific information. Third, we
estimate the impact that the GGA replacement heuristic has on performance. Results
indicate that GGA performs up to 40% worse when problem-specific knowledge is not
incorporated into the replacement heuristic. © 2003 Elsevier Science Ltd. All
rights reserved.
AUTHOR KEYWORDS: Grouping genetic algorithm; Heuristic
INDEX KEYWORDS: Encoding (symbols); Genetic algorithms; Intelligent materials;
Mathematical operators, Grouping genetic algorithms (GGA), Heuristic programming,
genetic algorithm; operations technology
REFERENCES: Holland, J.H., (1975) Adaptation in Natural and Artificial Systems: an
Introductory Analysis With Applications in Biology, Control, and Artificial
Intelligence, , Ann Arbor, MI: University of Michigan Press;
Alendar, J.T., (1994) an Indexed Bibliography of Genetic Algorithms: Years 1957-
1993, , Compiled by Alendar JT. Printed in Finland;
Falkenauer, E., The grouping genetic algorithms-Widening the scope of the GAs
(1992) JORBEL-Belgian Journal of Operations Research, Statistics and Computer
Science, 33, pp. 79-102;
Falkenauer, E., (1998) Genetic Algorithms for Grouping Problems, , New York: Wiley;
Holland, J.H., Genetic algorithms (1992) Scientific American, 267 (1), pp. 66-72;
Programs, , New York: Springer;
(2000) Evolver 4.0, Palisade, , www.palisade.com;
Falkenauer, E., A new representation and operators for genetic algorithms applied
to grouping problems (1994) Evolutionary Computation, 2 (2), pp. 123-144;
Falkenauer, E., A hybrid grouping genetic algorithm for bin packing (1996) Journal
of Heuristics, 2, pp. 5-30;
Zulawinski, B., (1995) The Swapping Heuristic, , MS thesis, Michigan State
University, USA;
Rekiek, B., Falkenauer, E., Delchambre, A., Multi-product resource planning (1997)
Proceedings of the IEEE International Symposium on Assembly and Task Planning;
Rekiek, B., De Lit, P., Pellichero, F., Falkenauer, E., Delchambre, A., Applying
equal piles problem to balance assembly lines (1999) Proceedings of the IEEE
International Symposium on Assembly and Task Planning;
3651-3669;
752;
Research, 18, pp. 213-237;
Chandresekharan, M.P., Rajagopalan, R., An ideal seed non-hierarchical clustering
Research, 24, pp. 451-464;
Chandresekharan, M.P., Rajagopalan, R., MODROC: An extension of rank-order
Research, 24, pp. 1221-1233;
Chandresekharan, M.P., Rajagopalan, R., ZODIAC: An algorithm for concurrent
Chandresekharan, M.P., Rajagopalan, R., GROUPABILITY: An analysis of the properties
Kumar, C.S., Chandresekharan, M.P., Grouping efficacy: A quantitative criterion for
Research, 32, pp. 2149-2158;
Sandbothe, R.A., Two observations on the grouping efficacy measure of block
diagonal forms (1998) International Journal of Production Research, 36 (11), pp.
3217-3222;
Reeves, C.R., A genetic algorithm for flowshop sequencing (1995) Computers and
Operations Research, 22, pp. 5-13
CORRESPONDENCE ADDRESS: Brown, E.C.; Business Information Technology, Virginia
Tech., 1007 Pamplin Hall, Blacksburg, VA 24061, United States; email:
[email protected]
ISSN: 03050548
CODEN: CMORA
SOURCE: Scopus
J.
24461690200;23974157700;23485559000;56491438400;53881475500;54946850000;
Solving a group layout design model of a dynamic cellular manufacturing system with
alternative process routings, lot splitting and flexible reconfiguration by
simulated annealing
84859708574&doi=10.1016%2fj.cor.2012.01.012&partnerID=40&md5=4ef036325bc5955a0d9c92
30263aa2eb
DOI: 10.1016/j.cor.2012.01.012
AFFILIATIONS: Department of Industrial Engineering, Firoozkooh Branch, Islamic Azad
University, Firoozkooh, Iran;
Université de Lyon, INSA-Lyon, DISP Laboratory, F-69621, France;
Tehran, Iran;
Department of Industrial Engineering, Birjand University of Technology, Birjand,
Iran
ABSTRACT: This paper presents a novel mixed-integer non-linear programming model
for the layout design of a dynamic cellular manufacturing system (DCMS). In a
dynamic environment, the product mix and part demands are varying during a multi-
period planning horizon. As a result, the best cell configuration for one period
may not be efficient for successive periods, and thus it necessitates
reconfigurations. Three major and interrelated decisions are involved in the design
of a CMS; namely cell formation (CF), group layout (GL) and group scheduling (GS).
A novel aspect of this model is concurrently making the CF and GL decisions in a
dynamic environment. The proposed model integrating the CF and GL decisions can be
used by researchers and practitioners to design GL in practical and dynamic cell
formation problems. Another compromising aspect of this model is the utilization of
multi-rows layout to locate machines in the cells configured with flexible shapes.
Such a DCMS model with an extensive coverage of important manufacturing features
has not been proposed before and incorporates several design features including
alternate process routings, operation sequence, processing time, production volume
of parts, purchasing machine, duplicate machines, machine capacity, lot splitting,
intra-cell layout, inter-cell layout, multi-rows layout of equal area facilities
and flexible reconfiguration. The objective of the integrated model is to minimize
the total costs of intra and inter-cell material handling, machine relocation,
purchasing new machines, machine overhead and machine processing. Linearization
procedures are used to transform the presented non-linear programming model into a
linearized formulation. Two numerical examples taken from the literature are solved
by the Lingo software using a branch-and-bound method to illustrate the performance
of this model. An efficient simulated annealing (SA) algorithm with elaborately
designed solution representation and neighborhood generation is extended to solve
the proposed model because of its NP-hardness. It is then tested using several
problems with different sizes and settings to verify the computational efficiency
of the developed algorithm in comparison with the Lingo software. The obtained
results show that the proposed SA is able to find the near-optimal solutions in
computational time, approximately 100 times less than Lingo. Also, the
computational results show that the proposed model to some extent overcomes common
disadvantages in the existing dynamic cell formation models that have not yet
considered layout problems. © 2012 Elsevier Ltd. All rights reserved.
AUTHOR KEYWORDS: Dynamic cellular manufacturing systems; Flexible reconfiguration;
Group layout; Mixed-integer non-linear programming; Multi-rows layout; Simulated
annealing
INDEX KEYWORDS: Alternative process routings; Cell configurations; Cell formation;
Computational results; Computational time; Design features; Different sizes;
Dynamic cell formation; Dynamic environments; Flexible reconfiguration; Group
layout; Group scheduling; Integrated models; Inter-cell layouts; Inter-related
decisions; Layout designs; Layout problems; Linearization procedures; Lot
splitting; Machine processing; Manufacturing features; Material handling; Mixed-
integer nonlinear programming; Multi-period; Multi-rows layout; Near-optimal
solutions; NP-hardness; Numerical example; Operation sequences; Planning horizons;
Processing time; Product mix; Production volumes; Routings; Simulated annealing
algorithms; Solution representation; Total costs, Algorithms; Cells; Cellular
manufacturing; Computer programming; Cytology; Design; Group technology;
Linearization; Simulated annealing, Dynamic models
REFERENCES: Ahi, A., Aryanezhad, M.B., Ashtianim, B., Makui, A., A novel approach
to determine cell formation, intracellular machine layout and cell layout in the
CMS problem based on TOPSIS method (2009) Computers & Operations Research, 36, pp.
1478-1496;
multi-objective scatter search for a dynamic cell formation problem (2009)
reconfiguration (2007) International Journal of Production Research, pp. 1-28;
Al-Mubarak, F., Canel, C., Khumawala, B.M., A simulation study of focused cellular
manufacturing as an alternative batch-processing layout (2003) International
2347., DOI 10.1080/00207540050028124;
S0377221705009045;
pp. 516-530., DOI 10.1108/17410380510600491;
Designing A Cellular Manufacturing System, , PhD thesis, University of Wisconsin,
Madison, WI;
S0736584505000414;
10.1080/00207540412331327754;
Computer Integrated Manufacturing, 17, pp. 346-375;
layout (2004) Computers & Operations Research, 31, pp. 1603-1619;
environment using tabu search (2004) Computers & Industrial Engineering, 46, pp.
571-588;
production and transport systems (2003) Journal of Engineering Manufacture, 217
(7), pp. 883-897;
Chen, D.-S., Wang, Q., Chen, H.-C., Linear sequencing for machine layouts by a
modified simulated annealing (2001) International Journal of Production Research,
39 (8), pp. 1721-1732., DOI 10.1080/00207540010023565;
109-128;
Mathematical Modeling, 34 (4), pp. 1078-1092;
10.1016/j.ejor.2007.02.040, PII S037722170700272X;
Research, 45 (1), pp. 1-25;
S0925527306000995;
genetic-algorithm-based heuristic (2006) International Journal of of Production
Research, 44 (12), pp. 2421-2444;
0947-6;
Dimopoulos, C., Zalzala, A.M.S., Recent developments in evolutionary computing for
manufacturing optimization: Problems, solutions and comparisons (2000) IEEE
Vila Goncalves Filho, E., Tiberti, A.J., A group genetic algorithm for the machine
cell formation problem (2006) International Journal of Production Economics, 102
(1), pp. 1-21., DOI 10.1016/j.ijpe.2004.12.029, PII S0925527305000551;
Ficko, M., Brezocnick, M., Balic, J., Designing the layout of single and multiple-
rows flexible manufacturing system by genetic algorithms (2004) Journal of
Materials Processing Technology, 157-158, pp. 150-158;
Hicks, C., A Genetic Algorithm tool for optimising cellular or functional layouts
in the capital goods industry (2006) International Journal of Production Economics,
104 (2), pp. 598-614., DOI 10.1016/j.ijpe.2005.03.010, PII S0925527305000794;
Ho, Y.-C., Moodie, C.L., A hybrid approach for concurrent layout design of cells
and their flow paths in a tree configuration (2000) International Journal of
Hassan, M.M.D., Machine layout problem in modern manufacturing facilities (1994)
Ioannou, G., Time-phased creation of hybrid manufacturing systems (2006)
275., DOI 10.1007/s00170-003-1619-9;
Kim, C.-B., Kim, S.S., Foote, B.L., Assignment problems in single-row and double-
row machine layouts during slow and peak periods (1996) Computers and Industrial
Engineering, 30 (3 SPEC. ISSUE), pp. 411-422., DOI 10.1016/0360-8352(96)00010-1;
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P., Optimisation by simulated
pp. 117-133;
Lee, S.D., Chiang, C.P., A cut-tree-based approach for clustering machine cells in
the bidirectional linear flow layout (2001) International Journal of Production
Research, 39 (3), pp. 491-512;
Lockwood, W.T., Mahmoodi, F., Ruben, R.A., Mosier, C.T., Scheduling unbalanced
cellular manufacturing systems with lot splitting (2000) International Journal of
1014-1025;
S0736584507000737;
Uncertain Production Requirements with Presence of Routing Flexibility, , PhD
thesis submitted to the Faculty of the Virginia Polytechnic Institute and State
University, Blackburg, VA;
Montreuil, B., Venkatadri, U., Rardin, R.L., Fractal layout organization for job
shop environments (1999) International Journal of Production Research, 37 (3), pp.
501-521;
manufacturing system (2011) Applied Mathematical Modelling, 35, pp. 1810-1819;
Engineering, 29 (14), pp. 221-225;
Rosenblatt, M.J., The dynamics of plant layout (1986) Management Science, 32 (1),
pp. 76-86;
comprehensive model (2011) International Journal of Advance Manufacturing
Technology, 53 (1), pp. 11-34;
subcontracting production planning in dynamic cellular manufacturing (2009)
10.1016/j.ejor.2006.12.058, PII S0377221707000811;
10), pp. 1001-1009., DOI 10.1007/s00170-006-0518-2;
Süer, G.A., Saiz, M., Gonzalez, W., Evaluation of manufacturing cell loading rules
for independent cells (1999) International Journal of Production Research, 36, pp.
2185-2207;
Schaller, J.E., Erenguc, S.S., Vakharia, A.J., A methodology for integrating cell
formation and production planning in cellular manufacturing (1998) Annals of
Sahni, S., Gonzales, T., P-complete approximation problems (1976) Journal of the
Association for Computing Machinery, 23, pp. 555-565;
annealing (2008) Journal of the Operational Research Society, 59 (4), pp. 443-454.,
DOI 10.1057/palgrave.jors.2602436, PII 2602436;
376;
Applied Mathematics and Computation, 184 (2), pp. 721-728., DOI
10.1016/j.amc.2006.05.172, PII S009630030600748X;
S0096300305000238;
algorithms (2005) Lecture Notes in Computer Science, 3777, pp. 213-227;
Venkatadrk, U., Rardin, R.L., A methodology for fractal layout organization (1997)
IIE Transactions (Institute of Industrial Engineers), 29 (10), pp. 911-924;
181, pp. 156-167;
Wu, X., Chu, C.-H., Wang, Y., Yan, W., Concurrent design of cellular manufacturing
Research, 44 (6), pp. 1217-1241., DOI 10.1080/00207540500338252, PII W1262711506;
pp. 403-424., DOI 10.1080/00207540110073109;
layout problems under variable demand in cellular manufacturing systems (2001)
Computers in Industry, 46, pp. 181-188;
part populations (1999) IIE Transactions, 31, pp. 11-20
CORRESPONDENCE ADDRESS: Baboli, A.; Université de Lyon, INSA-Lyon, DISP Laboratory,
F-69621, France; email: [email protected]
ISSN: 03050548
CODEN: CMORA
SOURCE: Scopus

Data

Uploaded by

Copyright:

Available Formats

Data

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Data

Uploaded by

Copyright:

Available Formats

Scopus

EXPORT DATE:24 Jan 2020

Wu, T.-H., Low, C., Wu, W.-T.

Rajagopalan, R., Batra, J., Design of cellular production systems-a graph

Kao, Y., Lin, C.-H.

Nalluri, M.S.R., Kannan, K., Gao, X.-Z., Roy, D.S.

King, J.R., Nakornchai, V., Machine-component group formation in group technology:

Danilovic, M., Ilic, O.

Safaei, N., Tavakkoli-Moghaddam, R., Jabal-Ameli, S.

AFFILIATIONS: Department of Industrial Engineering, Iran University of Science and

Chung, S.-H., Wu, T.-H., Chang, C.-C.

Savsar, M., Reliability analysis of a flexible manufacturing cell (2000)

Li, X., Baki, M.F., Aneja, Y.P.

Venugopal, V., Narendran, T., Genetic algorithm approach to the machine-component

Ho, Y.-C., Moodie, C.L.

Almonacid, B., Soto, R., Crawford, B.

Safaei, N., Javadian, N., Saidi-Mehrabad, M., Javadi, B.

AFFILIATIONS: Department of Industrial Engineering, Iran University of Science and

LANGUAGE OF ORIGINAL DOCUMENT: English

Paydar, M.M., Saidi-Mehrabad, M., Jabbarzadeh, A.

AFFILIATIONS: Department of Industrial Engineering, Iran University of Science and

Tavakkoli-Moghaddam, R., Ranjbar-Bourani, M., Mirzahosseinian, H., Aryanezhad, M.B.

AFFILIATIONS: Department of Industrial Engineering, College of Engineering,

Wu, T.-H., Chung, S.-H., Chang, C.-C.

AFFILIATIONS: Department of Economics, Management and Industrial Engineering,

LANGUAGE OF ORIGINAL DOCUMENT: English

Žilinskas, J., Goldengorin, B., Pardalos, P.M.

Arkat, J., Abdollahzadeh, H., Ghahve, H.

Venkatadri, U., Elaskari, S.M., Kurdi, R.

Tavakkoli-Moghaddam, R., Minaeian, S., Rabbani, M.

AFFILIATIONS: Center of Excellence for Intelligence-Based Experimental Mechanics,

Balakrishnan, J., Cheng, C.H., Dynamic Cellular Manufacturing under Multi-Period

Vafaeinezhad, M., Kia, R., Shahnazari-Shahrezaei, P.

Dmytryshyn, T., Ismail, M., Rashwan, O.

Zhang, J., Zhou, B.

Gómez, A.T., Ferrary, F.R., Canto Dos Santos, J.V., Chiwiacowsky, L.

Kim, C.O., Baek, J.-G., Baek, J.-K.

Ganesh, M.V., Srinivasan, G.

Kumar, Chandrasekharan, Grouping efficacy: a quantitative criterion for goodness of

Huang, H., Feng, H., Pan, E., Xi, L.

Papaioannou, G., Wilson, J.M., The evolution of cell formation problem

Spiliopoulos, K., Sofianopoulou, S.

Rabbani, M., Jolai, F., Manavizadeh, N., Radmehr, F., Javadi, B.

Elbenani, B., Ferland, J.A.

Fan, J., Cao, M., Feng, D.

Ozcelik, F., Saraç, T.

Safaei, N., Saidi-Mehrabad, M., Tavakkoli-Moghaddam, R., Sassani, F.

Balakrishnan, J., Cheng, C.H., Multi-period planning and uncertainty issues in

Kamalakannan, R., Sudhakara Pandian, R.

Mahdavi, I., Tahami Baher, N., Teymourian, E.

Tunnukij, T., Hicks, C.

Askin, R.G., Standridge, C.R., (1993) Modeling and analysis of manufacturing

Gallagher, C.C., Knight, W.A., (1973) Group technology, , London: Butterworth;

Wu, T.-H., Chung, S.-H., Chang, C.-C.

Wu, T.-H., Chang, C.-C., Chung, S.-H., A simulated annealing algorithm to

Husseinzadeh Kashan, A., Karimi, B., Noktehdan, A.

Wu, T.-H., Chang, C.-C., Chung, S.-H.

Ahi, A., Ashtiani, B., Aryanezhad, M.-B., Makui, A.

ISBN: 1424415292; 9781424415298