SUMMARY This paper describes the development of a non-heuristic algorithm for solving group techology problems. The problem is first formulated as a bipartite graph, and then an expression for the upper limit to the number of groups is derived. Using this limit, a non-hierarchical clustering method ...
No comments yet
Be the first to share your thoughts!