Abstract
In this paper, a group technology (GT) problem with bottleneck parts and bottleneck machines is considered. Three heuristic algorithms based on different branching schemes are developed. Each algorithm uses the cluster identification concept. The first algorithm solves an unconstraint GT problem. The second heuristic considers a constraint restricting the number of machines in each cell. The third algorithm screens machines and parts to identify bottlenecks. The algorithms are illustrated with numerical examples and an industrial case study.
Sign-in/Register to access full text options 
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.
