Pruning Search Space by Dominance Rules in Best First Search for the Job Shop Scheduling Problem.
María R. SierraRamiro VarelaPublished in: ICSOFT (PL/DPS/KE) (2008)
Keyphrases
- job shop scheduling problem
- search space
- heuristic search
- search strategy
- scheduling problem
- search algorithm
- tabu search
- search tree
- job shop scheduling
- branch and bound
- effective pruning
- metaheuristic
- critical path
- benchmark problems
- memetic algorithm
- combinatorial optimization problems
- genetic algorithm
- single machine
- maximum lateness
- search strategies
- combinatorial optimization
- branch and bound algorithm
- state space
- optimal solution
- constraint satisfaction problems
- simulated annealing
- lower bound
- graph model
- fitness function
- precedence constraints
- search procedure
- ant colony optimization
- feasible solution
- np hard
- evaluation function
- neural network
- upper bound
- flowshop