Solving the generalized machine assignment problem in group technology

Chun Hung Cheng, Chon Huat Goh, Anita Lee

Research output: Contribution to journalArticlepeer-review

25 Scopus citations


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. We formulate 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.

Original languageEnglish
Pages (from-to)794-802
Number of pages9
JournalJournal of the Operational Research Society
Issue number6
StatePublished - Jun 1996


  • Group technology
  • Layout
  • Production
  • Quadratic programming

ASJC Scopus subject areas

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing


Dive into the research topics of 'Solving the generalized machine assignment problem in group technology'. Together they form a unique fingerprint.

Cite this