A Branch-and-Bound Algorithm for Solving the Machine Allocation Problem

[1]  S. Martello,et al.  An upper bound for the zero-one knapsack problem and a branch and bound algorithm , 1977 .

[2]  J. King.  Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm , 1980 .

[3]  D. A. Milner,et al.  Direct clustering algorithm for group formation in cellular manufacture , 1982 .

[4]  M. Chandrasekharan,et al.  ZODIAC—an algorithm for concurrent formation of part-families and machine-cells , 1987 .

[5]  James R. Slagle,et al.  A Clustering and Data-Reorganizing Algorithm , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  Andrew Kusiak,et al.  Intelligent Manufacturing Systems , 1990 .

[7]  M. Chandrasekharan,et al.  An ideal seed non-hierarchical clustering algorithm for cellular manufacturing , 1986 .

[8]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[9]  Richard M. Soland,et al.  A branch and bound algorithm for the generalized assignment problem , 1975, Math. Program..

[10]  R. S. Lashkari,et al.  Machine grouping problem in cellular manufacturing systems ― an integer programming approach , 1989 .

[11]  Ronald G. Asktn,et al.  A cost-based heuristic for group technology configuration† , 1987 .

[12]  A. Kusiak,et al.  Efficient solving of the group technology problem , 1987 .

[13]  John McAuley,et al.  Machine grouping for efficient production , 1972 .

[14]  R. S. Lashkari,et al.  The cell formation problem in cellular manufacturing systems: a sequential modelling approach , 1989 .

[15]  Philip M. Wolfe,et al.  Application of the Similarity Coefficient Method in Group Technology , 1986 .

[16]  Theodore D. Klastorin.  An effective subgradient algorithm for the generalized assignment problem , 1979, Comput. Oper. Res..

[17]  F. Fred Choobineh,et al.  A framework for the design of cellular manufacturing systems , 1988 .