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)


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    The Bottleneck Assignment Problem


    Contributors:
    O. Gross (author)

    Publication date :

    1959


    Size :

    2 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English