Solving the generalized machine assignment problem in group technology

Solving the generalized machine assignment problem in group technology

0.00 Avg rating0 Votes
Article ID: iaor1997509
Country: United Kingdom
Volume: 47
Issue: 6
Start Page Number: 794
End Page Number: 802
Publication Date: Jun 1996
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: programming: assignment, programming: quadratic
Abstract:

Many existing solution methodologies for machine assignment problems in group technology do not consider factors such as part demand, operation sequence and cost of intercellular moves. This paper formulates a 0-1 quadratic programming model that takes into account these factors in machine assignment. Two approaches are proposed to solve this problem. the first is an A*-based approach that generates optimal solutions. The second is a heuristic approach developed to solve problems with large number of machines and/or parts. The heuristic approach is shown to be efficient in producing good solutions in a computational study.

Reviews

Required fields are marked *. Your email address will not be published.