Journal article
Branching algorithms for solving the group technology problem
Journal of Manufacturing Systems, Vol.10(4), pp.332-343
1991
DOI: 10.1016/0278-6125(91)90028-Z
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.
Details
- Title: Subtitle
- Branching algorithms for solving the group technology problem
- Creators
- Andrew Kusiak - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Journal of Manufacturing Systems, Vol.10(4), pp.332-343
- DOI
- 10.1016/0278-6125(91)90028-Z
- ISSN
- 0278-6125
- Language
- English
- Date published
- 1991
- Academic Unit
- Industrial and Systems Engineering; Nursing
- Record Identifier
- 9983557522002771
Metrics
45 Record Views