| Article ID: | iaor19911530 |
| Country: | Switzerland |
| Volume: | 26 |
| Start Page Number: | 415 |
| End Page Number: | 431 |
| Publication Date: | Dec 1990 |
| Journal: | Annals of Operations Research |
| Authors: | Kusiak Andrew, Cheng Chun Hung |
| Keywords: | programming: branch and bound |
In this paper, the group technology problem (GT) with bottleneck parts and the problem with bottleneck machines are considered. To solve the two problems, a branch-and-bound algorithm is presented. Two branching schemes are developed. The computational results for several test problems used in the literature are reported.