A Non-Binary Constraint Ordering Approach to Scheduling Problems.
Miguel A. SalidoFederico BarberPublished in: SGAI Conf. (Applications) (2004)
Keyphrases
- non binary
- scheduling problem
- generalized arc consistency
- constraint satisfaction problems
- binary constraints
- binary representation
- global constraints
- processing times
- np hard
- arc consistency
- single machine
- flowshop
- job shop scheduling problem
- soft constraints
- constraint satisfaction
- frequent pattern mining
- constraint networks
- cardinality constraints
- special case
- hidden variables
- dynamic programming
- np complete
- probabilistic model