New lower and upper bounds for on-line scheduling

B. Chen, A. Vliet, van, G.J. Woeginger

    Research output: Contribution to journalArticleAcademicpeer-review

    71 Citations (Scopus)
    11 Downloads (Pure)


    We investigate the problem of on-line scheduling a set of independent jobs on m parallel and identical machines with the objective of minimizing the overall finishing time. In this note, we are mainly interested in the cases where m is small. We derive results on the inevitable worst-case deviations from the optimum as encountered by any on-line algorithm. For m = 2 and m = 3, Graham's List Scheduling heuristic is known to be best possible. For m = 4, we will derive almost matching upper and lower bounds on the best possible worst-case guarantee for any on-line algorithm.
    Original languageEnglish
    Pages (from-to)221-230
    Number of pages10
    JournalOperations Research Letters
    Issue number4
    Publication statusPublished - 1994


    Dive into the research topics of 'New lower and upper bounds for on-line scheduling'. Together they form a unique fingerprint.

    Cite this