Constraint-based job shop scheduling with ILOG SCHEDULER

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

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    49 Citaten (Scopus)

    Samenvatting

    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.
    Originele taal-2Engels
    Pagina's (van-tot)271-286
    Aantal pagina's16
    TijdschriftJournal of Heuristics
    Volume3
    Nummer van het tijdschrift4
    DOI's
    StatusGepubliceerd - 1998

    Vingerafdruk

    Duik in de onderzoeksthema's van 'Constraint-based job shop scheduling with ILOG SCHEDULER'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit