Constraint-based job shop scheduling with ILOG SCHEDULER

W.P.M. Nuijten, C. Le Pape

    Research output: Contribution to journalArticleAcademicpeer-review

    48 Citations (Scopus)

    Abstract

    We introduce constraint-based scheduling and discuss its main principles. An approximation algorithm based on tree search is developed for the job shop scheduling problem using ILOG SCHEDULER. A new way of calculating lower bounds on the makespan of the job shop scheduling problem is presented and we show how such results can be used within a constraint-based approach. An empirical performance analysis shows that the algorithm we developed performs well. Finally, taking the job shop scheduling problem as a start point, we discuss how constraint-based scheduling can be used to solve more general scheduling problems.
    Original languageEnglish
    Pages (from-to)271-286
    Number of pages16
    JournalJournal of Heuristics
    Volume3
    Issue number4
    DOIs
    Publication statusPublished - 1998

    Fingerprint Dive into the research topics of 'Constraint-based job shop scheduling with ILOG SCHEDULER'. Together they form a unique fingerprint.

    Cite this