Machine-Part Grouping in Flexible Manufacturing: Formalisation and the Use of Genetic Algorithms

The classical machine-part grouping problem of flexible manufacturing is considered. Against the background of the multiplicity of the “general” forms of the objective functions, pertinent to the problem, on the one hand, and of the specific problem formulations, requiring highly specialized methods and techniques for their treatment it is argued that the use of simple, generic approaches, which are at the same time flexible, is advisable. The primary issue is in adaptability to a definite problem formulation and the possibility of constraint verification. A discussion is presented of certain basic precepts of the objective function formulation. This is followed by an example of application of the effective genetic algorithm to the specific case of the bond-energy-based objective function. The genetic algorithm applied features not only effectiveness, but also high adaptability from application of evolving set of operators.