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: | Cheng Chun Hung, Goh Chon-Huat, Lee Anita |
Keywords: | programming: assignment, programming: quadratic |
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.