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)


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    The Bottleneck Assignment Problem


    Beteiligte:
    O. Gross (Autor:in)

    Erscheinungsdatum :

    1959


    Format / Umfang :

    2 pages


    Medientyp :

    Report


    Format :

    Keine Angabe


    Sprache :

    Englisch