A simple algorithm for solving either of two different bottleneck assignment problems is described in this paper. The one problem requires finding an assignment of men to machines in a serial production line to maximize the rate of flow through the line; the other requires finding an assignment for parallel production lines (one man per line) so as to minimize the time to do a given job. The two problems are essentially identical. (Author)
The Bottleneck Assignment Problem
1959
2 pages
Report
Keine Angabe
Englisch