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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
