Constraint-based job shop scheduling with Ilog Scheduler

DOI10.1023/A:1009687210594zbMath0903.90101OpenAlexW2132914788MaRDI QIDQ1388065

Wim Nuijten, Claude le Pape

Publication date: 5 January 1999

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009687210594

zbMATH Keywords

job shop schedulingmakespanconstraint-based schedulingIlog Schedulerone machine lower bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Principles for the design of large neighborhood search, A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem, Models for global constraint applications, Enhancing CLP branch and bound techniques for scheduling problems, Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO, Combining metaheuristics with mathematical programming, constraint programming and machine learning, A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Scheduling with tails and deadlines, Resource-constrained project scheduling: Notation, classification, models, and methods, Deterministic job-shop scheduling: Past, present and future, Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties, Constraint propagation techniques for the disjunctive scheduling problem

Uses Software

• ILOG SCHEDULE