A Constraint Satisfaction Approach to Makespan Scheduling.
Cheng-Chung ChengStephen F. SmithPublished in: AIPS (1996)
Keyphrases
- constraint satisfaction
- scheduling problem
- constraint relaxation
- release dates
- constraint satisfaction problems
- batch processing
- unrelated parallel machines
- scheduling jobs
- batch processing machines
- flowshop
- single machine
- np hard
- heuristic search
- processing times
- constraint programming
- parallel machines
- deteriorating jobs
- constraint propagation
- phase transition
- precedence constraints
- combinatorial problems
- relaxation labeling
- hard constraints
- arc consistency
- tabu search
- product configuration
- constrained problems
- russian doll search
- robust fault detection
- lower bound
- constraint solving
- soft constraints
- job shop
- maximum lateness
- identical parallel machines
- single machine scheduling problem
- probabilistic reasoning
- constraint networks
- sat solvers
- special case
- constraint problems
- forward checking