Abstract
This paper discusses two formulations of the group technology (GT) problem. The first one involves basic and alternative process plans without bottleneck parts. The second formulation considers basic process plans and bottleneck parts or bottleneck machines. The algorithms developed in the paper are illustrated with numerical examples. Computational results are also provided.