Types of Flexible Job Shop Scheduling: A Constraint Programming Experiment.
Erich Christian TeppanPublished in: ICAART (3) (2022)
Keyphrases
- constraint programming
- job shop scheduling
- combinatorial problems
- constraint satisfaction problems
- constraint propagation
- scheduling problem
- constraint satisfaction
- job shop scheduling problem
- global constraints
- graph coloring
- combinatorial optimization problems
- constraint solver
- np hard problems
- search strategies
- constraint solving
- constraint logic programming
- arc consistency
- combinatorial optimization
- search heuristics
- hard and soft constraints
- simulated annealing
- symmetry breaking
- finite domain
- lower bound
- tabu search