?
Heuristic Algorithm for the Cell Formation Problem
Ch. 4. P. 43–69.
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.
Kemal Kıvanç Aköz, Samsonov A., Journal of Economic Theory 2025 Vol. 229 Article 106068
We define a (cooperative) informational bargaining problem, where several agents have to agree on the persuasion of a receiver. The bargaining set includes payoff vectors that can be generated by information structures and disagreement leads to an exogenous benchmark that may involve full or no information. We characterize the existence of an agreement that benefits ...
Added: September 26, 2025
Сидоренков А. В., Stroh W. A., Организационная психология 2023 Т. 13 № 1 С. 35–58
Purpose. The aim of the study is to explore the relationship between the effectiveness of production groups and the informal subgroups existing in them, namely: the relationship between the number of informal subgroups in groups and two types of group effectiveness — performance and social. Study design. The sample includes 78 groups from different organizations and ...
Added: May 4, 2023
Mikhail V. Batsyn, Ekaterina K. Batsyna, Ilya S. Bychkov, International Journal of Production Research 2020 Vol. 58 No. 20 P. 6159–6169
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 ...
Added: November 10, 2019
Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna, , in: Discrete Optimization and Operations Research/9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings.: Springer, 2016. P. 244–255.
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 ...
Added: October 3, 2018
Irina E. Utkina, Mikhail V. Batsyn, Ekaterina K. Batsyna, International Journal of Production Research 2018 Vol. 56 No. 9 P. 3262–3273
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 ...
Added: March 11, 2018
Ilya Bychkov, Mikhail Batsyn, Computers & Operations Research 2018 No. 91 P. 112–120
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 ...
Added: December 6, 2017
Ilya Bychkov, Mikhail Batsyn, Panos M. Pardalos, , in: Models, Algorithms, and Technologies for Network Analysis. Springer Proceedings in Mathematics & StatisticsVol. 197.: Springer, 2017. P. 11–26.
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 ...
Added: November 29, 2016
Mirkin B., Optimization Letters 2014
A review of the book in two perspectives: engineering design and data analysis. ...
Added: March 11, 2015
Mikhail Batsyn, Ilya Bychkov, Boris Goldengorin et al., , in: Models, Algorithms, and Technologies for Network AnalysisIssue 32.: NY: Springer, 2013. Ch. 2 P. 11–50.
In this paper 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 ...
Added: November 19, 2013
Ilya Bychkov, Mikhail Batsyn, Panos M. Pardalos, Optimization Letters 2014 Vol. 8 No. 8 P. 2203–2210
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 another cells (inter-cell operations). The grouping efficacy is the objective function for the ...
Added: September 21, 2013
Agadullina E., Gulevich O., Психологические исследования: электронный научный журнал 2013 Т. 6 № 28
The paper reviews contemporary research of group helping behavior - help for some members of outgroup or outgroup as a whole. Various forms of selfish helping (help, contrary to stereotypes, defensive help) and factors of intensity of the helping behavior are analyzed. In conclusion, describes the limitations of existing studies ...
Added: May 9, 2013
Goldengorin B. I., Krushinsky D., Slomp J., Operations Research 2012 Vol. 60 No. 5 P. 1526–5463
Lately, the problem of cell formation (CF) has gained a lot of attention in the industrial engineering literature. Since it was formulated (more than 50 years ago), the problem has incorporated additional industrial factors and constraints while its solution methods have been constantly improving in terms of the solution quality and CPU times. However, despite ...
Added: November 13, 2012
Krushinsky D., Goldengorin B. I., Computational Management Science 2012 Vol. 9 No. 2 P. 323–338
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 ...
Added: August 13, 2012