Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules.
Carlos MencíaMaría R. SierraMiguel A. SalidoJoan EscamillaRamiro VarelaPublished in: AI Commun. (2015)
Keyphrases
- weighted graph
- heuristic search
- job shop scheduling problem
- search space
- graph model
- search algorithm
- effective pruning
- job shop scheduling
- tabu search
- metaheuristic
- combinatorial optimization
- bidirectional search
- search strategy
- combinatorial optimization problems
- genetic algorithm
- state space
- admissible heuristics
- constraint satisfaction
- scheduling problem
- branch and bound
- simulated annealing
- search tree
- search problems
- benchmark problems
- search heuristics
- search strategies
- planning problems
- memetic algorithm
- constraint satisfaction problems
- heuristic search algorithms
- automated planning
- association rules
- optimal solution
- heuristic function
- beam search
- dynamic programming
- search methods
- traveling salesman problem
- iterative deepening