A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem.
Jean-Paul WatsonJ. Christopher BeckPublished in: CPAIOR (2008)
Keyphrases
- job shop scheduling problem
- constraint programming
- job shop scheduling
- memetic algorithm
- tabu search
- combinatorial problems
- critical path
- constraint propagation
- genetic algorithm
- simulated annealing
- scheduling problem
- constraint satisfaction problems
- benchmark problems
- global constraints
- graph model
- integer programming
- constraint satisfaction
- benchmark instances
- search heuristics
- combinatorial optimization problems
- combinatorial optimization
- column generation
- combinatorial search problems
- search strategies
- metaheuristic
- symmetry breaking
- finite domain
- backtrack search
- propositional satisfiability
- cost function
- hard and soft constraints
- search algorithm