Accession Number:

AD0613686

Title:

THE BOTTLENECK ASSIGNMENT PROBLEM,

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CALIF

Personal Author(s):

Report Date:

1959-03-06

Pagination or Media Count:

11.0

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

Subject Categories:

Distribution Statement:

APPROVED FOR PUBLIC RELEASE