Linear time approximation scheme for the multiprocessor open shop problem

S.V. Sevastianov, G.J. Woeginger

    Research output: Contribution to journalArticleAcademicpeer-review

    24 Citations (Scopus)

    Abstract

    For the r-stage open shop problem with identical parallel machines at each stage and the minimum makespan criterion, an approximation scheme is constructed with running time O(nrm+C(m,)), where n is the number of jobs, m is the total number of machines, and C(m,) is a function independent of n.
    Original languageEnglish
    Pages (from-to)273-288
    JournalDiscrete Applied Mathematics
    Volume114
    Issue number1-3
    DOIs
    Publication statusPublished - 2001

    Fingerprint

    Dive into the research topics of 'Linear time approximation scheme for the multiprocessor open shop problem'. Together they form a unique fingerprint.

    Cite this