Article thumbnail

Group Technology with Flow Shop Cells

By Sergio Nicoletti, Gaia Nicosia and Andrea Pacifici


In this paper the Group Technology problem of grouping parts in families and machines in cells in order to convert a job shop production system to some pseudo flow shops is considered. Several heuristic methods for solving Group Technology problem have been proposed in the literature, in general, not producing a flow shop in each cell---unless a great number of extra machines is added. We use known techniques for solving the Shortest Common Supersequence and the Longest Common Subsequence problems to develop a method that takes into account the sequence of machines that each part has to visit. This new method allows us to obtain a flow shop layout for the machine cells using a limited number of machines in each cell. 2

Year: 1998
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles