A competitive constraint programming approach for the group shop scheduling problem.
Francisco YuraszeckGonzalo MejíaDario Canut-de-BonPublished in: ANT/EDI40 (2023)
Keyphrases
- constraint programming
- scheduling problem
- combinatorial problems
- constraint satisfaction problems
- constraint propagation
- constraint satisfaction
- single machine
- integer programming
- global constraints
- symmetry breaking
- np hard
- np hard problems
- flowshop
- tabu search
- arc consistency
- search strategies
- search heuristics
- constraint logic programming
- column generation
- finite domain
- constraint networks
- constraint solvers
- constraint solver
- constraint optimization
- machine learning and data mining
- constraint solving
- hard and soft constraints
- data mining
- constraint problems
- np complete