Accession Number : AD0613686

Title :   THE BOTTLENECK ASSIGNMENT PROBLEM,

Corporate Author : RAND CORP SANTA MONICA CALIF

Personal Author(s) : Gross,O.

Report Date : 06 MAR 1959

Pagination or Media Count : 11

Abstract : 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)

Descriptors :   (*PRODUCTION CONTROL, NUMERICAL METHODS AND PROCEDURES), MANPOWER, MACHINES, LABOR, OPTIMIZATION, PERMUTATIONS

Distribution Statement : APPROVED FOR PUBLIC RELEASE