A branch-and-bound algorithm for the cell formation problem

References

• Arkat, J., H. Abdollahzadeh, and H. Ghahve. 2012. “A New Branch-and-bound Algorithm for Cell Formation Problem.” Applied Mathematical Modelling 36: 5091–5100.
   Web of Science ®Google Scholar
• Askin, R. G., and S. P. Subramanian. 1987. “A Cost-based Heuristic for Group Technology Configuration.” International Journal of Production Research 25 (1): 101–113.
   Web of Science ®Google Scholar
• Boctor, F. F. 1991. “A Linear Formulation of the Machine-part Cell Formation Problem.” International Journal of Production Research 29 (2): 343–356.
   Web of Science ®Google Scholar
• Boe, W., and C. H. Cheng. 1991. “A Close Neighbor Algorithm for Designing Cellular Manufacturing Systems.” International Journal of Production Research 29 (10): 2097–2116.
   Web of Science ®Google Scholar
• Brusco, M. J. 2015a. “An Exact Algorithm for Maximizing Grouping Efficacy in Part-machine Clustering.” IIE Transactions 47 (6): 653–671.
   Web of Science ®Google Scholar
• Brusco, M. J. 2015b. “An Iterated Local Search Heuristic for Cell Formation.” Computers & Industrial Engineering 90: 292–304.
   Web of Science ®Google Scholar
• Burbidge, J. L. 1958. “A New Approach to Production Control.” Institution of Production Engineers Journal 37 (5): 288–302.
   Google Scholar
• Busygin, S., O. Prokopyev, and P. M. Pardalos. 2008. “Biclustering in Data Mining.” Computers & Operations Research 35 (9): 2964–2987.
   Web of Science ®Google Scholar
• Bychkov, I., M. Batsyn, P. Sukhov, and P.M. Pardalos. 2013. “Heuristic Algorithm for the Cell Formation Problem.” In Models, Algorithms, and Technologies for Network Analysis. Vol. 59, Springer Proceedings in Mathematics & Statistics, edited by Goldengorin, B. I., Kalyagin, V. A., and Pardalos, P. M., 43–69. New York: Springer.
   Google Scholar
• Bychkov, I., M. Batsyn, and P. Pardalos. 2014. “Exact Model for the Cell Formation Problem.” Optimization Letters 8 (8): 2203–2210.
   Web of Science ®Google Scholar
• Carrie, S. 1973. “Numerical Taxonomy Applied to Group Technology and Plant Layout.” International Journal of Production Research 11: 399–416.
   Google Scholar
• Chan, H. M., and D. A. Milner. 1982. “Direct Clustering Algorithm for Group Formation in Cellular Manufacture.” Journal of Manufacturing Systems 1 (1): 64–76.
   Google Scholar
• Chandrasekharan, M. P., and R. Rajagopalan. 1986a. “MODROC: An Extension of Rank Order Clustering for Group Technology.” International Journal of Production Research 24 (5): 1221–1233.
   Web of Science ®Google Scholar
• Chandrasekharan, M. P., and R. Rajagopalan. 1986b. “An Ideal Seed Non-hierarchical Clustering Algorithm for Cellular Manufacturing.” International Journal of Production Research 24 (2): 451–464.
   Web of Science ®Google Scholar
• Chandrasekharan, M. P., and R. Rajagopalan. 1987. “ZODIAC: An Algorithm for Concurrent Formation of Part Families and Machine Cells.” International Journal of Production Research 25 (6): 835–850.
   Web of Science ®Google Scholar
• Chandrasekharan, M. P., and R. Rajagopalan. 1989. “Groupability: Analysis of the Properties of Binary Data Matrices for Group Technology.” International Journal of Production Research 27 (6): 1035–1052.
   Web of Science ®Google Scholar
• Dell’Amico, M., and P. Toth. 2000. “Algorithms and Codes for Dense Assignment Problems: The State of the Art.” Discrete Applied Mathematics 100 (1–2): 17–48.
   Web of Science ®Google Scholar
• Dinkelbach, W. 1967. “On Nonlinear Fractional Programming.” Management Science 13: 492–498.
   Google Scholar
• Eckstein, J., W. E. Hart, and C. A. Phillips. 2015. “PEBBL: An Object-oriented Framework for Scalable Parallel Branch and Bound.” Mathematical Programming Computation 7 (4): 429–469.
   Web of Science ®Google Scholar
• Elbenani, B., and J. A. Ferland. 2012. “An Exact Method for Solving the Manufacturing Cell Formation Problem.” International Journal of Production Research 50 (15): 4038–4045.
   Web of Science ®Google Scholar
• Flanders, R. E. 1925. “Design Manufacture and Production Control of a Standard Machine.” Transactions of ASME 46: 691–738.
   Google Scholar
• Goldengorin, B., D. Krushinsky , and P. M. Pardalos. 2013. Cell Formation in Industrial Engineering. Theory, Algorithms and Experiments. Springer Optimization and its Applications 79. New York: Springer. 206 p.
   Google Scholar
• Goncalves, J. F., and M. G. C. Resende. 2004. “An Evolutionary Algorithm for Manufacturing Cell Formation.” Computers & Industrial Engineering 47: 247–273.
   Web of Science ®Google Scholar
• James, T. L., E. C. Brown, and K. B. Keeling. 2007. “A Hybrid Grouping Genetic Algorithm for the Cell Formation Problem.” Computers & Operations Research 34 (7): 2059–2079.
   Web of Science ®Google Scholar
• Jonker, R., and A. A. Volgenant. 1987. “Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems.” Computing 38: 325–340.
   Web of Science ®Google Scholar
• King, J. R. 1980. “Machine-component Grouping in Production Flow Analysis: An Approach Using a Rank Order Clustering Algorithm.” International Journal of Production Research 18 (2): 213–232.
   Web of Science ®Google Scholar
• King, J. R., and V. Nakornchai. 1982. “Machine-component Group Formation in Group Technology: Review and Extension.” International Journal of Production Research 20 (2): 117–133.
   Web of Science ®Google Scholar
• Kumar, K. R., A. Kusiak, and A. Vannelli. 1986. “Grouping of Parts and Components in Flexible Manufacturing Systems.” European Journal of Operations Research 24: 387–397.
   Web of Science ®Google Scholar
• Kumar, K. R., and M. P. Chandrasekharan. 1990. “Grouping Efficacy: A Quantitative Criterion for Goodness of Block Diagonal Forms of Binary Matrices in Group Technology.” International Journal of Production Research 28 (2): 233–243.
   Web of Science ®Google Scholar
• Kumar, K. R., and A. Vannelli. 1987. “Strategic Subcontracting for Efficient Disaggregated Manufacturing.” International Journal of Production Research 25 (12): 1715–1728.
   Web of Science ®Google Scholar
• Kusiak, A. 1987. “The Generalized Group Technology Concept.” International Journal of Production Research 25 (4): 561–569.
   Web of Science ®Google Scholar
• Kusiak, A., and W. S. Chow. 1987. “Efficient Solving of the Group Technology Problem.” Journal of Manufacturing Systems 6 (2): 117–124.
   Web of Science ®Google Scholar
• Kusiak, A., J. W. Boe, and C. Cheng. 1993. “Designing Cellular Manufacturing Systems: Branch-and-bound and A* Approaches.” IIE Transactions 25 (4): 46–56.
   Web of Science ®Google Scholar
• McCormick, W. T., P. J. Schweitzer, and T. W. White. 1972. “Problem Decomposition and Data Reorganization by a Clustering Technique.” Operations Research 20 (5): 993–1009.
   Web of Science ®Google Scholar
• Mitrofanov, S. P. 1933. Nauchnye osnovy gruppovoy tekhnologii, Leningrad: Lenizdat. 435 p (in Russian).
   Google Scholar
• Mosier, C. T., and L. Taube. 1985a. “The Facets of Group Technology and their Impact on Implementation.” OMEGA 13 (6): 381–391.
   Web of Science ®Google Scholar
• Mosier, C. T., and L. Taube. 1985b. “Weighted Similarity Measure Heuristics for the Group Technology Machine Clustering Problem.” OMEGA 13 (6): 577–583.
   Web of Science ®Google Scholar
• Paydar, M. M., and M. Saidi-Mehrabad. 2013. “A Hybrid Genetic-variable Neighborhood Search Algorithm for the Cell Formation Problem Based on Grouping Efficacy.” Computers & Operations Research 40 (4): 980–990.
   Web of Science ®Google Scholar
• Pietracaprina, A., G. Pucci, F. Silvestri, and F. Vandin. 2015. “Space-efficient Parallel Algorithms for Combinatorial Search Problems.” Journal of Parallel and Distributed Computing 76: 58–65.
   Web of Science ®Google Scholar
• Seifoddini, H. 1989. “A Note on the Similarity Coefficient Method and the Problem of Improper Machine Assignment in Group Technology Applications.” International Journal of Production Research 27 (7): 1161–1165.
   Web of Science ®Google Scholar
• Seifoddini, H., and P. M. Wolfe. 1986. “Application of the Similarity Coefficient Method in Group Technology.” IIE Transactions 18 (3): 271–277.
   Web of Science ®Google Scholar
• Spiliopoulos, K., and S. Sofianopoulou. 1998. “An Optimal Tree Search Method for the Manufacturing Systems Cell Formation Problem.” European Journal of Operational Research 105: 537–551.
   Web of Science ®Google Scholar
• Srinivasan, G., T. T. Narendran, and B. Mahadevan. 1990. “An Assignment Model for the Part-families Problem in Group Technology.” International Journal of Production Research 28 (1): 145–152.
   Web of Science ®Google Scholar
• Stanfel, L. 1985. “Machine Clustering for Economic Production.” Engineering Costs and Production Economics 9: 73–81.
   Web of Science ®Google Scholar
• Utkina, I., and M. Batsyn. 2016a. “A Branch and Bound Algorithm for the Cell Formation Problem.” Springer Proceedings in Mathematics & Statistics 156: 115–126.
   Google Scholar
• Utkina, I., M. Batsyn, and E. Batsyna. 2016b. “A Branch and Bound Algorithm for a Fractional 0–1 Programming Problem.” Lecture Notes in Computer Science 9869: 244–255.
   Google Scholar
• Waghodekar, P. H., and S. Sahu. 1984. “Machine-component Cell Formation in Group Technology MACE.” International Journal of Production Research 22: 937–948.
   Web of Science ®Google Scholar
• Zilinskas, J., B. Goldengorin, and P. M. Pardalos. 2015. “Pareto-optimal Front of Cell Formation Problem in Group Technology.” Journal of Global Optimization 61 (1): 91–108.
   Web of Science ®Google Scholar