Multiple-machine lower bounds for shop-scheduling problems

F. Sourd, W.P.M. Nuijten

    Research output: Contribution to journalArticleAcademicpeer-review

    8 Citations (Scopus)
    1 Downloads (Pure)


    In order to compute lower bounds for shop scheduling problems, a lot of attention has been paid to adjustment techniques based on one-machine relaxations. We present such a new technique but, following the observation that machines are connected to each other through precedence constraints, we also study techniques that are based on the combination of precedence constraints and disjunctive constraints between operations that are processed on different machines. A computational study of the effectiveness of these new techniques is performed on job-shop and flow-shop instances.
    Original languageEnglish
    Pages (from-to)341-352
    JournalINFORMS Journal on Computing
    Issue number4
    Publication statusPublished - 2000


    Dive into the research topics of 'Multiple-machine lower bounds for shop-scheduling problems'. Together they form a unique fingerprint.

    Cite this