A cell formation algorithm: Hypergraph approximation - Cut tree

European Journal of Operational Research

Volumn 109, Issue 3, 1998, Pages 686-702

  Kandiller, Levent ^a,b  

^a MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Cell formation; Graph theory; Hypergraphs; Manufacturing; Modeling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL MODELS; RANDOM PROCESSES; TREES (MATHEMATICS);

CELL FORMATION ALGORITHMS; GOMORY-HU CUT TREE; HYPERGRAPH APPROXIMATIONS;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 0032167362     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00143-4     Document Type: Article

References (19)

1. C. Berge, Hypergraphs, North-Holland, Amsterdam, 1989.
2. D. de Werra, On an optimization problem occurring in FMSs: A hypergraph theoretical formulation, Technical Report ORWP 92/07, Ecole Polytechnique Federale de Lausanne, Departement de mathematiques, CH-1015 Lausanne, Suisse, March 1993.
3. L. Kandiller, A generic cell formation algorithm, in: Proceedings of International Conference on Industrial Engineering and Production Management, vol. I, FUCAM, Mons, Belgium, 1993, pp. 77-86.
4. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Applicable Theory in Computer Science Series, University of Paderbon, Germany, Wiley, New York, 1990.
5. H.R. Charney, D.L. Plato, Efficient partitioning of components, in: Proceedings of the Fifth Annual Design Automation Workshop, 1968, pp. 16.0-16.21.
6. M. Hanan, J.M. Kurtzberg, A review of the placement and quadratic assignment problems, SIAM Review 14 (1972) 324-342.
7. W.E. Donath, Logic partitioning, in: B.T. Preas, M.J. Lorenzetti (Eds.), Physical design automation of VLSI systems, Benjamin/Cummings, Menlo Park, CA, 1988.
8. S. Hadley, A new approximation technique for hypergraph partitioning problems, Technical Report, University of Waterloo, Department of Electrical and Computer Engineering, Waterloo, Ontario, Canada N2L 3G1, April 1989.
9. R.E. Gomory, T.C. Hu, Multi-terminal network flows, J. SIAM 9 (4) (1961) 551-570.
10. J. Cherian, T. Hagerup, K. Mehlhorn, Can a maximum flow be computed in O(nm) time? Proceedings of the 17th International Colloquium on Automata Languages and Programming (1998), 235-248.
11. L. Kandiller, A comparative study of cell formation in cellular manufacturing systems, International Journal of Production Research 32 (10) (1994) 2394-2429.
12. G.F. Purcheck, Machine-component group formation: An heuristic method for flexible production cells and flexible manufacturing systems, International Journal of Production Research 23 (5) (1985) 911-943.
13. J.R. King, Machine-component grouping in production flow analysis: An approach using a rank order clustering algorithm, International Journal of Production Research 18 (2) (1980) 213-232.
14. M.P. Chandrasekharan, R. Rajagopalan, Modroc: An extension of rank order clustering for group technology, International Journal of Production Research 24 (5) (1986) 1224-1233.
15. P.H. Waghodekar, S. Sahu, Machine-component cell formation in group technology: Mace, International Journal of Production Research 22 (6) (1984) 937-948.
16. A. Kusiak, W.S. Chow, Efficient solving of the group technology problem, Journal of Manufacturing Systems 6 (2) (1987) 117-124.
17. M.P. Chandrasekharan, R. Rajagopalan, An ideal seed non-hierarchical clustering algorithm for cellular manufacturing, International Journal of Production Research 24 (2) (1986) 451-464.
18. M.P. Chandrasekharan, R. Rajagopalan, Zodiac - an algorithm for concurrent formation of part-families and machine-cells, International Journal of Production Research 25 (6) (1987) 835-850.
19. Z. Faber, M.W. Carter, A new graph theory approach for forming machine cells in cellular production systems, in: A. Kusiak (Ed.), Flexible Manufacturing Systems: Methods and Studies, Elsevier, Amsterdam, 1986.