A branch-and-bound algorithm for solving the group technology problem

Andrew Kusiak; Chun Hung Chen

doi:10.1007/BF03543078

Back

A branch-and-bound algorithm for solving the group technology problem

Journal article

Peer reviewed

A branch-and-bound algorithm for solving the group technology problem

Andrew Kusiak and Chun Hung Chen

Annals of operations research, Vol.26(1-4), p.415

12/1990

DOI: 10.1007/BF03543078

View Online

Abstract

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 branchand- bound algorithm is presented. Two branching schemes are developed. The computational results for several test problems used in the literature are reported.

Industrial Engineering

Details

Title: Subtitle: A branch-and-bound algorithm for solving the group technology problem
Creators: Andrew Kusiak - University of Iowa
Chun Hung Chen
Resource Type: Journal article
Publication Details: Annals of operations research, Vol.26(1-4), p.415
DOI: 10.1007/BF03543078
ISSN: 0254-5330
Language: English
Date published: 12/1990
Academic Unit: Industrial and Systems Engineering; Nursing
Record Identifier: 9983557501702771

Metrics

63 Record Views